Presentation Supersolvable Groups
Presentation Supersolvable Groups
Supersolvable Groups
UFMG
November/2019
Introduction
Introduction
Definition
Definition
Definition
Example
Example
S3 = (1, 2, 3), (1, 2) is supersolvable.
Example
Example
S3 = (1, 2, 3), (1, 2) is supersolvable.
Example
Example
S3 = (1, 2, 3), (1, 2) is supersolvable.
Example
Example
S3 = (1, 2, 3), (1, 2) is supersolvable.
Example
Example
A4 is not a supersolvable group.
Remark
Remark
Remark
Properties
Proposition
Supersolvable groups are finitely generated.
Proof.
Let G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 be a
supersolvable series. For each i, take gi ∈ Gi such that
Gi /Gi+1 = gi Gi+1 . If g ∈ G, then g = g0e0 a1 where
a1 ∈ G1 and e0 ∈ Z. Besides that, a1 = g1e1 a2 with a2 ∈ G2 .
Proceeding this reasoning, we can write
g = g0e0 g1e1 · · · gnen an+1 where an+1 ∈ Gn+1 , which means
an+1 = 1. Therefore, g = g0e0 g1e1 · · · gnen then
G = g0 , . . . , gn .
Properties
Proposition
Supersolvable groups are finitely generated.
Proof.
Let G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 be a
supersolvable series. For each i, take gi ∈ Gi such that
Gi /Gi+1 = gi Gi+1 . If g ∈ G, then g = g0e0 a1 where
a1 ∈ G1 and e0 ∈ Z. Besides that, a1 = g1e1 a2 with a2 ∈ G2 .
Proceeding this reasoning, we can write
g = g0e0 g1e1 · · · gnen an+1 where an+1 ∈ Gn+1 , which means
an+1 = 1. Therefore, g = g0e0 g1e1 · · · gnen then
G = g0 , . . . , gn .
Properties
Proposition
Supersolvable groups are finitely generated.
Proof.
Let G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 be a
supersolvable series. For each i, take gi ∈ Gi such that
Gi /Gi+1 = gi Gi+1 . If g ∈ G, then g = g0e0 a1 where
a1 ∈ G1 and e0 ∈ Z. Besides that, a1 = g1e1 a2 with a2 ∈ G2 .
Proceeding this reasoning, we can write
g = g0e0 g1e1 · · · gnen an+1 where an+1 ∈ Gn+1 , which means
an+1 = 1. Therefore, g = g0e0 g1e1 · · · gnen then
G = g0 , . . . , gn .
Properties
Proposition
Supersolvable groups are finitely generated.
Proof.
Let G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 be a
supersolvable series. For each i, take gi ∈ Gi such that
Gi /Gi+1 = gi Gi+1 . If g ∈ G, then g = g0e0 a1 where
a1 ∈ G1 and e0 ∈ Z. Besides that, a1 = g1e1 a2 with a2 ∈ G2 .
Proceeding this reasoning, we can write
g = g0e0 g1e1 · · · gnen an+1 where an+1 ∈ Gn+1 , which means
an+1 = 1. Therefore, g = g0e0 g1e1 · · · gnen then
G = g0 , . . . , gn .
Properties
Proposition
Supersolvable groups are finitely generated.
Proof.
Let G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 be a
supersolvable series. For each i, take gi ∈ Gi such that
Gi /Gi+1 = gi Gi+1 . If g ∈ G, then g = g0e0 a1 where
a1 ∈ G1 and e0 ∈ Z. Besides that, a1 = g1e1 a2 with a2 ∈ G2 .
Proceeding this reasoning, we can write
g = g0e0 g1e1 · · · gnen an+1 where an+1 ∈ Gn+1 , which means
an+1 = 1. Therefore, g = g0e0 g1e1 · · · gnen then
G = g0 , . . . , gn .
Properties
Theorem
Suppose H ≤ G, N E G, where G is supersolvable group.
Then H and G/N are supersolvable.
Proof
First, we shall prove that H is supersolvable.
Consider G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 the
supersolvable series of G. Since each Gi E G, defining
Hi = H ∩ Gi we have Hi E H and so we get a normal series
of H:
H = H0 ≥ H1 ≥ . . . ≥ Hn ≥ Hn+1 = 1.
Without loss of generality, we may assume that all the
factors in the chain above are different.
Teresinha Gouvêa, Vanderlei Lopes, Wesley Quaresma Supersolvable Groups 9 / 40
Supersolvable Groups
Properties
Theorem
Suppose H ≤ G, N E G, where G is supersolvable group.
Then H and G/N are supersolvable.
Proof
First, we shall prove that H is supersolvable.
Consider G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 the
supersolvable series of G. Since each Gi E G, defining
Hi = H ∩ Gi we have Hi E H and so we get a normal series
of H:
H = H0 ≥ H1 ≥ . . . ≥ Hn ≥ Hn+1 = 1.
Without loss of generality, we may assume that all the
factors in the chain above are different.
Teresinha Gouvêa, Vanderlei Lopes, Wesley Quaresma Supersolvable Groups 9 / 40
Supersolvable Groups
Properties
Theorem
Suppose H ≤ G, N E G, where G is supersolvable group.
Then H and G/N are supersolvable.
Proof
First, we shall prove that H is supersolvable.
Consider G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 the
supersolvable series of G. Since each Gi E G, defining
Hi = H ∩ Gi we have Hi E H and so we get a normal series
of H:
H = H0 ≥ H1 ≥ . . . ≥ Hn ≥ Hn+1 = 1.
Without loss of generality, we may assume that all the
factors in the chain above are different.
Teresinha Gouvêa, Vanderlei Lopes, Wesley Quaresma Supersolvable Groups 9 / 40
Supersolvable Groups
Properties
Proof
Analyzing its factors:
H ∩ Gi / H ∩ Gi+1 = H ∩ Gi / (H ∩ Gi ) ∩ Gi+1
∼
= H ∩ Gi Gi+1 /Gi+1
≤ Gi /Gi+1 .
Properties
Proof
Analyzing its factors:
H ∩ Gi / H ∩ Gi+1 = H ∩ Gi / (H ∩ Gi ) ∩ Gi+1
∼
= H ∩ Gi Gi+1 /Gi+1
≤ Gi /Gi+1 .
Properties
Proof.
Properties
Proof.
Properties
Proof.
Properties
Theorem
The following statements are true:
1 A direct product of finitely many supersolvable groups
is supersolvable.
2 If H1 , . . . , Hn are normal subgroups of G and the
groups G/H1 , . . . , G/Hn are supersolvable, then
n
T
G/ Hi is supersolvable.
i=1
Properties
Proof
Let us prove the statement 1. By using induction, it is
enough to show that if G and K are supersolvable then so
is G × K. Consider a supersolvable series
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 and
K = K0 ≥ K1 ≥ . . . ≥ Km ≥ Km+1 = 1 of G and K,
respectively. We have Gi × 1 = Gi × Km+1 E G × K and
G × Kj = G0 × Kj E G × K. Furthemore,
Properties
Proof
Let us prove the statement 1. By using induction, it is
enough to show that if G and K are supersolvable then so
is G × K. Consider a supersolvable series
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 and
K = K0 ≥ K1 ≥ . . . ≥ Km ≥ Km+1 = 1 of G and K,
respectively. We have Gi × 1 = Gi × Km+1 E G × K and
G × Kj = G0 × Kj E G × K. Furthemore,
Properties
Proof
Let us prove the statement 1. By using induction, it is
enough to show that if G and K are supersolvable then so
is G × K. Consider a supersolvable series
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 and
K = K0 ≥ K1 ≥ . . . ≥ Km ≥ Km+1 = 1 of G and K,
respectively. We have Gi × 1 = Gi × Km+1 E G × K and
G × Kj = G0 × Kj E G × K. Furthemore,
Properties
Proof
Let us prove the statement 1. By using induction, it is
enough to show that if G and K are supersolvable then so
is G × K. Consider a supersolvable series
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 and
K = K0 ≥ K1 ≥ . . . ≥ Km ≥ Km+1 = 1 of G and K,
respectively. We have Gi × 1 = Gi × Km+1 E G × K and
G × Kj = G0 × Kj E G × K. Furthemore,
Properties
Proof
Let us prove the statement 1. By using induction, it is
enough to show that if G and K are supersolvable then so
is G × K. Consider a supersolvable series
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 and
K = K0 ≥ K1 ≥ . . . ≥ Km ≥ Km+1 = 1 of G and K,
respectively. We have Gi × 1 = Gi × Km+1 E G × K and
G × Kj = G0 × Kj E G × K. Furthemore,
Properties
Proof.
G × K = G0 × K0 ≥ G × K1 ≥ · · · ≥ G × Km ≥ G × Km+1
= G × 1 ≥ G1 × 1 ≥ · · · ≥ Gn+1 × 1 = 1 × 1
is a supersolvable series of G × K.
For the statement 2, consider the homomorphism
n
Y
φ : G −→ G/Hi , g 7→ (gH1 , . . . , gHn )
i=1
n n n
Hi ∼
T T Q
whose kernel is Hi . It follows that G/ = G/Hi
i=1 i=1 i=1
which is a supersolvable group by the statement 1.
Teresinha Gouvêa, Vanderlei Lopes, Wesley Quaresma Supersolvable Groups 14 / 40
Supersolvable Groups
Properties
Proof.
G × K = G0 × K0 ≥ G × K1 ≥ · · · ≥ G × Km ≥ G × Km+1
= G × 1 ≥ G1 × 1 ≥ · · · ≥ Gn+1 × 1 = 1 × 1
is a supersolvable series of G × K.
For the statement 2, consider the homomorphism
n
Y
φ : G −→ G/Hi , g 7→ (gH1 , . . . , gHn )
i=1
n n n
Hi ∼
T T Q
whose kernel is Hi . It follows that G/ = G/Hi
i=1 i=1 i=1
which is a supersolvable group by the statement 1.
Teresinha Gouvêa, Vanderlei Lopes, Wesley Quaresma Supersolvable Groups 14 / 40
Supersolvable Groups
Properties
Proof.
G × K = G0 × K0 ≥ G × K1 ≥ · · · ≥ G × Km ≥ G × Km+1
= G × 1 ≥ G1 × 1 ≥ · · · ≥ Gn+1 × 1 = 1 × 1
is a supersolvable series of G × K.
For the statement 2, consider the homomorphism
n
Y
φ : G −→ G/Hi , g 7→ (gH1 , . . . , gHn )
i=1
n n n
Hi ∼
T T Q
whose kernel is Hi . It follows that G/ = G/Hi
i=1 i=1 i=1
which is a supersolvable group by the statement 1.
Teresinha Gouvêa, Vanderlei Lopes, Wesley Quaresma Supersolvable Groups 14 / 40
Supersolvable Groups
Properties
Corollary
Supersolvable groups satisfy the maximal condition of
chains of subgroups.
Proof
Let G be a supersolvable group and suppose that it has a
infinite series of subgroups
H0 ≤ H1 ≤ . . . ≤ Hn ≤ . . .
Properties
Corollary
Supersolvable groups satisfy the maximal condition of
chains of subgroups.
Proof
Let G be a supersolvable group and suppose that it has a
infinite series of subgroups
H0 ≤ H1 ≤ . . . ≤ Hn ≤ . . .
Properties
Corollary
Supersolvable groups satisfy the maximal condition of
chains of subgroups.
Proof
Let G be a supersolvable group and suppose that it has a
infinite series of subgroups
H0 ≤ H1 ≤ . . . ≤ Hn ≤ . . .
Remark
Proof.
Assume it is generated by {x1 , . . . , xk } then there exists
m ∈ N such that {x1 , . . . , xk } ⊆ Hm which means
∞
S
Hi ⊆ Hm , a contradiction.
i=0
Remark
Proof.
Assume it is generated by {x1 , . . . , xk } then there exists
m ∈ N such that {x1 , . . . , xk } ⊆ Hm which means
∞
S
Hi ⊆ Hm , a contradiction.
i=0
Remark
Proof.
Assume it is generated by {x1 , . . . , xk } then there exists
m ∈ N such that {x1 , . . . , xk } ⊆ Hm which means
∞
S
Hi ⊆ Hm , a contradiction.
i=0
Remark
Proof.
Assume it is generated by {x1 , . . . , xk } then there exists
m ∈ N such that {x1 , . . . , xk } ⊆ Hm which means
∞
S
Hi ⊆ Hm , a contradiction.
i=0
Remark
Proof.
Assume it is generated by {x1 , . . . , xk } then there exists
m ∈ N such that {x1 , . . . , xk } ⊆ Hm which means
∞
S
Hi ⊆ Hm , a contradiction.
i=0
Properties
Proposition
If G is a finitely generated nilpotent group, then G is
supersolvable.
Proof
Consider a upper central series
1 = ζ0 ≤ ζ1 ≤
· · · ≤ ζc ≤ ζc+1 = G, where ζi E G and
ζi+1 G
ζi ≤ Z ζi . Notice that ζi+1 /ζi is abelian and finitely
generated, thus we have it is a direct product of cyclic
groups
ζi+1 Ci Ci Ci
= 1 × 2 × ··· × k.
ζi ζi ζi ζi
Properties
Proposition
If G is a finitely generated nilpotent group, then G is
supersolvable.
Proof
Consider a upper central series
1 = ζ0 ≤ ζ1 ≤
· · · ≤ ζc ≤ ζc+1 = G, where ζi E G and
ζi+1 G
ζi ≤ Z ζi . Notice that ζi+1 /ζi is abelian and finitely
generated, thus we have it is a direct product of cyclic
groups
ζi+1 Ci Ci Ci
= 1 × 2 × ··· × k.
ζi ζi ζi ζi
Properties
Proposition
If G is a finitely generated nilpotent group, then G is
supersolvable.
Proof
Consider a upper central series
1 = ζ0 ≤ ζ1 ≤
· · · ≤ ζc ≤ ζc+1 = G, where ζi E G and
ζi+1 G
ζi ≤ Z ζi . Notice that ζi+1 /ζi is abelian and finitely
generated, thus we have it is a direct product of cyclic
groups
ζi+1 Ci Ci Ci
= 1 × 2 × ··· × k.
ζi ζi ζi ζi
Properties
Proof.
Ci
ζi+1
Since ≤Z G
ζi
j G
ζi we know that ζi E ζi , which implies
Cij E G. Thus we can refine the series in this way
Properties
Proof.
Ci
ζi+1
Since ≤Z G
ζi
j G
ζi we know that ζi E ζi , which implies
Cij E G. Thus we can refine the series in this way
Properties
Proof.
Ci
ζi+1
Since ≤Z G
ζi
j G
ζi we know that ζi E ζi , which implies
Cij E G. Thus we can refine the series in this way
Properties
Proof.
Ci
ζi+1
Since ≤Z G
ζi
j G
ζi we know that ζi E ζi , which implies
Cij E G. Thus we can refine the series in this way
Properties
Properties
Properties
Properties
Proposition
Let N E G. If N is G−supersolvable and G/N is
supersolvable then G is supersolvable.
Proof
In fact, applying the Correspondence Theorem to a
supersolvable series of G/N we can write
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ N
Properties
Proposition
Let N E G. If N is G−supersolvable and G/N is
supersolvable then G is supersolvable.
Proof
In fact, applying the Correspondence Theorem to a
supersolvable series of G/N we can write
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ N
Properties
Proposition
Let N E G. If N is G−supersolvable and G/N is
supersolvable then G is supersolvable.
Proof
In fact, applying the Correspondence Theorem to a
supersolvable series of G/N we can write
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ N
Properties
Proof.
Since N is G−supersolvable we have
N = N0 ≥ N1 ≥ . . . ≥ Nr ≥ Nr+1 = 1
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ N ≥ N1 ≥ . . .
. . . ≥ Nr ≥ Nr+1 = 1
Properties
Proof.
Since N is G−supersolvable we have
N = N0 ≥ N1 ≥ . . . ≥ Nr ≥ Nr+1 = 1
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ N ≥ N1 ≥ . . .
. . . ≥ Nr ≥ Nr+1 = 1
Properties
Proposition
If G is a supersolvable group and N E G, then N occurs as
a term in a supersolvable series of G.
Proof
As the quotient G/N is supersolvable, using the
Correspondence Theorem we can get a normal series of G
from G up to N :
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ N
Properties
Proposition
If G is a supersolvable group and N E G, then N occurs as
a term in a supersolvable series of G.
Proof
As the quotient G/N is supersolvable, using the
Correspondence Theorem we can get a normal series of G
from G up to N :
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ N
Properties
Proposition
If G is a supersolvable group and N E G, then N occurs as
a term in a supersolvable series of G.
Proof
As the quotient G/N is supersolvable, using the
Correspondence Theorem we can get a normal series of G
from G up to N :
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ N
Properties
Proof.
Since a supersolvable group is closed to subgroups we get
N = N0 ≥ N1 ≥ . . . ≥ Nr ≥ Nr+1 = 1 supersolvable series
of N . Then N occurs in the following supersolvable series
of G:
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ N ≥ N1 ≥ . . . ≥ Nr+1 = 1.
Properties
Proof.
Since a supersolvable group is closed to subgroups we get
N = N0 ≥ N1 ≥ . . . ≥ Nr ≥ Nr+1 = 1 supersolvable series
of N . Then N occurs in the following supersolvable series
of G:
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ N ≥ N1 ≥ . . . ≥ Nr+1 = 1.
Properties
Proof.
Since a supersolvable group is closed to subgroups we get
N = N0 ≥ N1 ≥ . . . ≥ Nr ≥ Nr+1 = 1 supersolvable series
of N . Then N occurs in the following supersolvable series
of G:
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ N ≥ N1 ≥ . . . ≥ Nr+1 = 1.
Properties
Proof.
Since a supersolvable group is closed to subgroups we get
N = N0 ≥ N1 ≥ . . . ≥ Nr ≥ Nr+1 = 1 supersolvable series
of N . Then N occurs in the following supersolvable series
of G:
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ N ≥ N1 ≥ . . . ≥ Nr+1 = 1.
Properties
Lemma
1 Every subgroup of an infinite cyclic group different from
Properties
Theorem
A supersolvable group G has a normal series
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 in which every
factor group Gi /Gi+1 is either infinite cyclic or cyclic of
prime order.
Proof
Let G be supersolvable with supersolvable series
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1. If Gi /Gi+1 is cyclic
of finite order p1 p2 · · · ps where p1 , . . . , ps are primes (not
necessarily distinct) then, by the previous lemma, Gi /Gi+1
has only one subgroup Hi 1 /Gi+1 , . . . , Hi s /Gi+1 of order
p1 p2 · · · ps , p2 · · · ps , . . . , ps respectively.
Teresinha Gouvêa, Vanderlei Lopes, Wesley Quaresma Supersolvable Groups 25 / 40
Supersolvable Groups
Properties
Theorem
A supersolvable group G has a normal series
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 in which every
factor group Gi /Gi+1 is either infinite cyclic or cyclic of
prime order.
Proof
Let G be supersolvable with supersolvable series
G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1. If Gi /Gi+1 is cyclic
of finite order p1 p2 · · · ps where p1 , . . . , ps are primes (not
necessarily distinct) then, by the previous lemma, Gi /Gi+1
has only one subgroup Hi 1 /Gi+1 , . . . , Hi s /Gi+1 of order
p1 p2 · · · ps , p2 · · · ps , . . . , ps respectively.
Teresinha Gouvêa, Vanderlei Lopes, Wesley Quaresma Supersolvable Groups 25 / 40
Supersolvable Groups
Properties
Proof.
Since Hi j /Gi+1 is a characteristic subgroup of
Gi /Gi+1 E G/Gi+1 we have Hi j /Gi+1 E G/Gi+1 then
Hi j E G. Hence, we can refine our series as below
G = G0 ≥ G1 ≥ . . . ≥ Gi ≥ Hi 1 ≥ . . .
. . . ≥ Hi s ≥ Gi+1 ≥ . . . ≥ Gn ≥ Gn+1 = 1.
Properties
Proof.
Since Hi j /Gi+1 is a characteristic subgroup of
Gi /Gi+1 E G/Gi+1 we have Hi j /Gi+1 E G/Gi+1 then
Hi j E G. Hence, we can refine our series as below
G = G0 ≥ G1 ≥ . . . ≥ Gi ≥ Hi 1 ≥ . . .
. . . ≥ Hi s ≥ Gi+1 ≥ . . . ≥ Gn ≥ Gn+1 = 1.
Properties
Proof.
Since Hi j /Gi+1 is a characteristic subgroup of
Gi /Gi+1 E G/Gi+1 we have Hi j /Gi+1 E G/Gi+1 then
Hi j E G. Hence, we can refine our series as below
G = G0 ≥ G1 ≥ . . . ≥ Gi ≥ Hi 1 ≥ . . .
. . . ≥ Hi s ≥ Gi+1 ≥ . . . ≥ Gn ≥ Gn+1 = 1.
Properties
Proof.
Since Hi j /Gi+1 is a characteristic subgroup of
Gi /Gi+1 E G/Gi+1 we have Hi j /Gi+1 E G/Gi+1 then
Hi j E G. Hence, we can refine our series as below
G = G0 ≥ G1 ≥ . . . ≥ Gi ≥ Hi 1 ≥ . . .
. . . ≥ Hi s ≥ Gi+1 ≥ . . . ≥ Gn ≥ Gn+1 = 1.
Properties
Corollary
Properties
Corollary
Properties
Corollary
Properties
Definition
A chief factor of G is a quotient H/K where H, K E G
and H/K is a minimal normal subgroup of G/K. A chief
series of G is a normal series whose factors are chief.
Properties
Proposition
The following statements are true:
1 A minimal normal subgroup of a supersolvable group is
cyclic of prime order.
2 A chief factor of a supersolvable group is cyclic of
prime order.
3 A supersolvable group with a chief series is a finite
group.
4 G is a finite supersolvable group if and only if it has a
chief series with cyclic factors of prime order.
Properties
Proposition
The following statements are true:
1 A minimal normal subgroup of a supersolvable group is
cyclic of prime order.
2 A chief factor of a supersolvable group is cyclic of
prime order.
3 A supersolvable group with a chief series is a finite
group.
4 G is a finite supersolvable group if and only if it has a
chief series with cyclic factors of prime order.
Properties
Proposition
The following statements are true:
1 A minimal normal subgroup of a supersolvable group is
cyclic of prime order.
2 A chief factor of a supersolvable group is cyclic of
prime order.
3 A supersolvable group with a chief series is a finite
group.
4 G is a finite supersolvable group if and only if it has a
chief series with cyclic factors of prime order.
Properties
Proposition
The following statements are true:
1 A minimal normal subgroup of a supersolvable group is
cyclic of prime order.
2 A chief factor of a supersolvable group is cyclic of
prime order.
3 A supersolvable group with a chief series is a finite
group.
4 G is a finite supersolvable group if and only if it has a
chief series with cyclic factors of prime order.
Properties
Proposition
The following statements are true:
1 A minimal normal subgroup of a supersolvable group is
cyclic of prime order.
2 A chief factor of a supersolvable group is cyclic of
prime order.
3 A supersolvable group with a chief series is a finite
group.
4 G is a finite supersolvable group if and only if it has a
chief series with cyclic factors of prime order.
Properties
Proof
1 Let N be a minimal normal subgroup of G. N is
Properties
Proof
1 Let N be a minimal normal subgroup of G. N is
Properties
Proof.
3 If G has a chief series
Properties
Proof.
3 If G has a chief series
Properties
Theorem
Let G be a supersolvable group. Then all maximal subgroups
of G has prime index.
Proof
Consider H < G. If H E G, G/H is a simple and
max
supersolvable group, therefore G/H is a cyclic group with
prime order, then [G : H] is prime.
Now, suppose that H is not a normal subgroup of G. Let
K be the maximal subgroup of H that is normal in G; we
G H
have that H/K < G/K and [G : H] = K : K , thus we
max
may assume that K = 1, without loss of generality.
Properties
Theorem
Let G be a supersolvable group. Then all maximal subgroups
of G has prime index.
Proof
Consider H < G. If H E G, G/H is a simple and
max
supersolvable group, therefore G/H is a cyclic group with
prime order, then [G : H] is prime.
Now, suppose that H is not a normal subgroup of G. Let
K be the maximal subgroup of H that is normal in G; we
G H
have that H/K < G/K and [G : H] = K : K , thus we
max
may assume that K = 1, without loss of generality.
Properties
Theorem
Let G be a supersolvable group. Then all maximal subgroups
of G has prime index.
Proof
Consider H < G. If H E G, G/H is a simple and
max
supersolvable group, therefore G/H is a cyclic group with
prime order, then [G : H] is prime.
Now, suppose that H is not a normal subgroup of G. Let
K be the maximal subgroup of H that is normal in G; we
G H
have that H/K < G/K and [G : H] = K : K , thus we
max
may assume that K = 1, without loss of generality.
Properties
Theorem
Let G be a supersolvable group. Then all maximal subgroups
of G has prime index.
Proof
Consider H < G. If H E G, G/H is a simple and
max
supersolvable group, therefore G/H is a cyclic group with
prime order, then [G : H] is prime.
Now, suppose that H is not a normal subgroup of G. Let
K be the maximal subgroup of H that is normal in G; we
G H
have that H/K < G/K and [G : H] = K : K , thus we
max
may assume that K = 1, without loss of generality.
Properties
Proof
Since G is supersolvable, we conclude that G has a normal
subgroup A, which is infinite cyclic or cyclic of prime order.
If A is infinite cyclic then A ∼
= Z; since Aut(Z) ∼= Z2 , all
subgroups of Z are characteristic.
Since A ∩ H ≤ A, then A ∩ H E G therefore A ∩ H = 1
because of K = 1 is the biggest subgroup with this
property. Moreover, we can choose B a proper subgroup of
A that is normal in G. Then we have H < AH and, by the
maximality of H, AH = G. However, this means that
H < BH < AH = G, which contradicts the maximality of
H.
Properties
Proof
Since G is supersolvable, we conclude that G has a normal
subgroup A, which is infinite cyclic or cyclic of prime order.
If A is infinite cyclic then A ∼
= Z; since Aut(Z) ∼= Z2 , all
subgroups of Z are characteristic.
Since A ∩ H ≤ A, then A ∩ H E G therefore A ∩ H = 1
because of K = 1 is the biggest subgroup with this
property. Moreover, we can choose B a proper subgroup of
A that is normal in G. Then we have H < AH and, by the
maximality of H, AH = G. However, this means that
H < BH < AH = G, which contradicts the maximality of
H.
Properties
Proof
Since G is supersolvable, we conclude that G has a normal
subgroup A, which is infinite cyclic or cyclic of prime order.
If A is infinite cyclic then A ∼
= Z; since Aut(Z) ∼= Z2 , all
subgroups of Z are characteristic.
Since A ∩ H ≤ A, then A ∩ H E G therefore A ∩ H = 1
because of K = 1 is the biggest subgroup with this
property. Moreover, we can choose B a proper subgroup of
A that is normal in G. Then we have H < AH and, by the
maximality of H, AH = G. However, this means that
H < BH < AH = G, which contradicts the maximality of
H.
Properties
Proof
Since G is supersolvable, we conclude that G has a normal
subgroup A, which is infinite cyclic or cyclic of prime order.
If A is infinite cyclic then A ∼
= Z; since Aut(Z) ∼= Z2 , all
subgroups of Z are characteristic.
Since A ∩ H ≤ A, then A ∩ H E G therefore A ∩ H = 1
because of K = 1 is the biggest subgroup with this
property. Moreover, we can choose B a proper subgroup of
A that is normal in G. Then we have H < AH and, by the
maximality of H, AH = G. However, this means that
H < BH < AH = G, which contradicts the maximality of
H.
Properties
Proof
Since G is supersolvable, we conclude that G has a normal
subgroup A, which is infinite cyclic or cyclic of prime order.
If A is infinite cyclic then A ∼
= Z; since Aut(Z) ∼= Z2 , all
subgroups of Z are characteristic.
Since A ∩ H ≤ A, then A ∩ H E G therefore A ∩ H = 1
because of K = 1 is the biggest subgroup with this
property. Moreover, we can choose B a proper subgroup of
A that is normal in G. Then we have H < AH and, by the
maximality of H, AH = G. However, this means that
H < BH < AH = G, which contradicts the maximality of
H.
Properties
Proof
Since G is supersolvable, we conclude that G has a normal
subgroup A, which is infinite cyclic or cyclic of prime order.
If A is infinite cyclic then A ∼
= Z; since Aut(Z) ∼= Z2 , all
subgroups of Z are characteristic.
Since A ∩ H ≤ A, then A ∩ H E G therefore A ∩ H = 1
because of K = 1 is the biggest subgroup with this
property. Moreover, we can choose B a proper subgroup of
A that is normal in G. Then we have H < AH and, by the
maximality of H, AH = G. However, this means that
H < BH < AH = G, which contradicts the maximality of
H.
Properties
Proof.
Thus A has prime order. Then we have
[G : H] = [AH : H] = [A : A ∩ H] = [A : 1] = |A|
This means that H has prime index.
Properties
Aplication
Theorem
Let G be a supersolvable group; then the commutator
subgroup G0 of G is nilpotent.
Proof
Let G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 be a
supersolvable series. Defining Hi := G0 ∩ Gi , as we have
already observed, G0 = H0 ≥ H1 ≥ . . . ≥ Hn+1 = 1 is a
supersolvable series for G0 and moreover, Hi E G. Let Kj
be the distinct terms of this chain, we affirm that
G0 = K0 ≥ K1 ≥ . . . ≥ Ks = 1 is a central series for G0 . In
fact, we already checked that the K 0 s form a normal series,
now we will verify that Ki /Ki+1 ≤ Z(G0 /Ki+1 ). This is
equivalent to show that [Ki , G0 ] ≤ Ki+1 .
Teresinha Gouvêa, Vanderlei Lopes, Wesley Quaresma Supersolvable Groups 36 / 40
Supersolvable Groups
Aplication
Theorem
Let G be a supersolvable group; then the commutator
subgroup G0 of G is nilpotent.
Proof
Let G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 be a
supersolvable series. Defining Hi := G0 ∩ Gi , as we have
already observed, G0 = H0 ≥ H1 ≥ . . . ≥ Hn+1 = 1 is a
supersolvable series for G0 and moreover, Hi E G. Let Kj
be the distinct terms of this chain, we affirm that
G0 = K0 ≥ K1 ≥ . . . ≥ Ks = 1 is a central series for G0 . In
fact, we already checked that the K 0 s form a normal series,
now we will verify that Ki /Ki+1 ≤ Z(G0 /Ki+1 ). This is
equivalent to show that [Ki , G0 ] ≤ Ki+1 .
Teresinha Gouvêa, Vanderlei Lopes, Wesley Quaresma Supersolvable Groups 36 / 40
Supersolvable Groups
Aplication
Theorem
Let G be a supersolvable group; then the commutator
subgroup G0 of G is nilpotent.
Proof
Let G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 be a
supersolvable series. Defining Hi := G0 ∩ Gi , as we have
already observed, G0 = H0 ≥ H1 ≥ . . . ≥ Hn+1 = 1 is a
supersolvable series for G0 and moreover, Hi E G. Let Kj
be the distinct terms of this chain, we affirm that
G0 = K0 ≥ K1 ≥ . . . ≥ Ks = 1 is a central series for G0 . In
fact, we already checked that the K 0 s form a normal series,
now we will verify that Ki /Ki+1 ≤ Z(G0 /Ki+1 ). This is
equivalent to show that [Ki , G0 ] ≤ Ki+1 .
Teresinha Gouvêa, Vanderlei Lopes, Wesley Quaresma Supersolvable Groups 36 / 40
Supersolvable Groups
Aplication
Theorem
Let G be a supersolvable group; then the commutator
subgroup G0 of G is nilpotent.
Proof
Let G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 be a
supersolvable series. Defining Hi := G0 ∩ Gi , as we have
already observed, G0 = H0 ≥ H1 ≥ . . . ≥ Hn+1 = 1 is a
supersolvable series for G0 and moreover, Hi E G. Let Kj
be the distinct terms of this chain, we affirm that
G0 = K0 ≥ K1 ≥ . . . ≥ Ks = 1 is a central series for G0 . In
fact, we already checked that the K 0 s form a normal series,
now we will verify that Ki /Ki+1 ≤ Z(G0 /Ki+1 ). This is
equivalent to show that [Ki , G0 ] ≤ Ki+1 .
Teresinha Gouvêa, Vanderlei Lopes, Wesley Quaresma Supersolvable Groups 36 / 40
Supersolvable Groups
Aplication
Theorem
Let G be a supersolvable group; then the commutator
subgroup G0 of G is nilpotent.
Proof
Let G = G0 ≥ G1 ≥ . . . ≥ Gn ≥ Gn+1 = 1 be a
supersolvable series. Defining Hi := G0 ∩ Gi , as we have
already observed, G0 = H0 ≥ H1 ≥ . . . ≥ Hn+1 = 1 is a
supersolvable series for G0 and moreover, Hi E G. Let Kj
be the distinct terms of this chain, we affirm that
G0 = K0 ≥ K1 ≥ . . . ≥ Ks = 1 is a central series for G0 . In
fact, we already checked that the K 0 s form a normal series,
now we will verify that Ki /Ki+1 ≤ Z(G0 /Ki+1 ). This is
equivalent to show that [Ki , G0 ] ≤ Ki+1 .
Teresinha Gouvêa, Vanderlei Lopes, Wesley Quaresma Supersolvable Groups 36 / 40
Supersolvable Groups
Aplication
Proof.
Note that g ∈ G induces an automorphism
ϕg ∈ Aut(Ki /Ki+1 ) in the cyclic group Ki /Ki+1 defined by
(ai Ki+1 )ϕg = agi Ki+1 . Since the group of automorphism of
a cyclic group is abelian, the automorphism induced by the
element [x, y] is trivial, with x, y ∈ G, then we have
[x,y]
(ai Ki+1 )ϕ[x,y] = ai Ki+1 = ai Ki+1
[x,y]
Therefore ai−1 ai = [ai , [x, y]] ∈ Ki+1 , ∀ ai ∈ Ki+1 and
x, y ∈ G, then [Ki , G0 ] ≤ Ki+1 , as we wish.
Aplication
Proof.
Note that g ∈ G induces an automorphism
ϕg ∈ Aut(Ki /Ki+1 ) in the cyclic group Ki /Ki+1 defined by
(ai Ki+1 )ϕg = agi Ki+1 . Since the group of automorphism of
a cyclic group is abelian, the automorphism induced by the
element [x, y] is trivial, with x, y ∈ G, then we have
[x,y]
(ai Ki+1 )ϕ[x,y] = ai Ki+1 = ai Ki+1
[x,y]
Therefore ai−1 ai = [ai , [x, y]] ∈ Ki+1 , ∀ ai ∈ Ki+1 and
x, y ∈ G, then [Ki , G0 ] ≤ Ki+1 , as we wish.
Aplication
Proof.
Note that g ∈ G induces an automorphism
ϕg ∈ Aut(Ki /Ki+1 ) in the cyclic group Ki /Ki+1 defined by
(ai Ki+1 )ϕg = agi Ki+1 . Since the group of automorphism of
a cyclic group is abelian, the automorphism induced by the
element [x, y] is trivial, with x, y ∈ G, then we have
[x,y]
(ai Ki+1 )ϕ[x,y] = ai Ki+1 = ai Ki+1
[x,y]
Therefore a−1
i ai = [ai , [x, y]] ∈ Ki+1 , ∀ ai ∈ Ki+1 and
x, y ∈ G, then [Ki , G0 ] ≤ Ki+1 , as we wish.
Aplication
Proof.
Note that g ∈ G induces an automorphism
ϕg ∈ Aut(Ki /Ki+1 ) in the cyclic group Ki /Ki+1 defined by
(ai Ki+1 )ϕg = agi Ki+1 . Since the group of automorphism of
a cyclic group is abelian, the automorphism induced by the
element [x, y] is trivial, with x, y ∈ G, then we have
[x,y]
(ai Ki+1 )ϕ[x,y] = ai Ki+1 = ai Ki+1
[x,y]
Therefore a−1
i ai = [ai , [x, y]] ∈ Ki+1 , ∀ ai ∈ Ki+1 and
x, y ∈ G, then [Ki , G0 ] ≤ Ki+1 , as we wish.
Aplications
Aplications
References
Thank you!