Scribd
Upload
921 views

Composition Series

The document summarizes composition series and soluble groups. A composition series for a group G is a sequence of subgroups where successive quotients are simple groups. Every finite group has a composition series. A group is soluble if all its composition factors in a composition series are cyclic of prime order. If a normal subgroup and the quotient group are both soluble, then the full group is soluble.

Uploaded by

nothard
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
921 views

Composition Series

The document summarizes composition series and soluble groups. A composition series for a group G is a sequence of subgroups where successive quotients are simple groups. Every finite group has a composition series. A group is soluble if all its composition factors in a composition series are cyclic of prime order. If a normal subgroup and the quotient group are both soluble, then the full group is soluble.

Uploaded by

nothard
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

MAS 305 Algebraic Structures II

Notes 9 Autumn 2006

Composition series and soluble groups


Definition A normal subgroup N of a group G is called a maximal normal subgroup
of G if
(a) N 6= G;
(b) whenever N 6 M E G then either M = N or M = G.
By the Correspondence Theorem, if N C G and N 6= G then every normal subgroup
of G/N corresponds to a normal subgroup of G containing N. So a normal subgroup
N is maximal if and only if G/N is simple.
Definition Given a group G, a composition series for G of length n is a sequence of
subgroups
G = B0 > B1 > · · · > Bn = {1G }
such that
(a) Bi C Bi 1 for i = 1, . . . , n,
(b) Bi 1 /Bi is simple for i = 1, . . . , n.
In particular, B1 is a maximal normal subgroup of G and Bn 1 is simple. The (iso-
morphism classes of the) quotient groups Bi /Bi 1 are called composition factors of G.
Example S4 has the following composition series of length 4, where K is the Klein
group {(1), (1 2)(3 4), (1 3)(2 4), (1 4)(2 3)}.
S4 > A4 > K > h(1 2)(3 4)i > {1}
We know that A4 C S4 ; the composition factor S4 /A4 ⇠
= C2 . We have seen that K C A4 ;
⇠
and A4 /K = C3 . All subgroups of K are normal in K, because K is Abelian. Both
K/h(1 2)(3 4)i and h(1 2)(3 4)i/ {1} are isomorphic to C2 . So the composition factors
of S4 are C2 (three times) and C3 (once).

1
S4 v
A4 C S4 and S4 /A4 ⇠
= C2
A4 v
K C A4 and A4 /K ⇠
= C3
K v
H C K and K/H ⇠
= C2
h(1 2)(3 4)i = H v
{1} C H and H/ {1} ⇠
= C2
{1} v

Example If G is simple then its only composition series is G > {1}, of length 1.

Example (Z, +) has no composition series. If H 6 Z then H is cyclic of infinite order.


If H = hxi then h2xi is a subgroup of H with {0} 6= h2xi =6 H, and h2xi C H because
H is Abelian. So H is not simple. If B0 > B1 > · · · > Bn is a composition series then
Bn 1 is simple, so there can be no composition series.

Theorem Every finite group G has a composition series.

Proof We use induction on |G|. If |G| = 1 then the composition series is just G =
B0 = {1}.
Assume that |G| > 1 and that the result is true for all groups of order less than |G|.
Since G is finite, G has at least one maximal normal subgroup N. Then |N| < |G|, so
by induction N has a composition series N = B1 > B2 > · · · > Bn = {1} with Bi C Bi 1
and Bi 1 /Bi simple for i = 2, . . . , n. Putting B0 = G gives the composition series
G = B0 > B1 > · · · > Bn = {1} for G, because B1 C B0 and B0 /B1 = G/N, which is
simple. ⇤

The next theorem shows that statements such as “the composition factors of S4 are
C2 (three times) and C3 ” do not depend on the choice of composition series.

2
Applying the similar argument to B1 gives t + 1 = n 1 and
⇢
q(H) + 1 if H ⇠ = B1 /D
f1 (H) =
q(H) otherwise.
Hence n = m. Moreover, since G/B1 ⇠
= C1 /D and G/C1 ⇠= B1 /D, either
⇢
q(H) + 2 if H ⇠
= G/B1
(a) G/B1 ⇠= G/C1 and f(H) = y(H) = or
q(H) otherwise,
⇢
⇠ q(H) + 1 if H ⇠
= G/B1 or H ⇠ = G/C1
6 G/C1 and f(H) = y(H) =
(b) G/B1 = ⇤
q(H) otherwise.
Definition A finite group is soluble if all its composition factors are cyclic of prime
order.

Example S4 is soluble.

Example S5 is not soluble, because its only composition series is S5 > A5 > {1}.

We have already shown that if |G| = pn for some prime p then G has subgroups

{1G } = G0 < G1 < · · · < Gn = G

with Gi E G and |Gi | = pi for i = 0, . . . , n. So |Gi+1 /Gi | = p so Gi+1 /Gi ⇠ = C p for


i = 0, . . . , n 1. Thus every finite p-group is soluble.
A composition series in which every subgroup is normal in the whole group is
called a chief series. A finite group is supersoluble if it has a chief series all of whose
composition factors are cyclic of prime order. So all finite p-groups are supersoluble.

Theorem If H is a normal subgroup of a finite group G, and if H and G/H are both
soluble then G is soluble.

Proof Let H = H0 > H1 > · · · > Hr = {1} be a composition series for H. Let G/H =
K0 > K1 > · · · > Ks = {H} be a composition series for G/H. By the Correspondence
Theorem, there are subgroups G0 , . . . , Gs of G containing H such that Gi /H = Ki for
i = 0, . . . , s and Gi C Gi 1 for i = 1, . . . , s. By the Second Isomorphism Theorem,

Ki 1 /Ki = (Gi 1 /H)/(Gi /H) ⇠


= Gi 1 /Gi .
Then
G = G0 B G1 B · · · B Gs = H = H0 B H1 B · · · B Hr = {1}
is a composition series for G in which every composition factor is cyclic of prime
order. ⇤

You might also like