Group Theory
Group Theory
Group Theory
COURSE NOTES
C ONTENTS
1. Basics 3
2. Homomorphisms 7
3. Subgroups 11
4. Generators 14
5. Cyclic groups 16
6. Cosets and Lagrange’s Theorem 19
7. Normal subgroups and quotient groups 23
8. Isomorphism Theorems 26
9. Direct products 29
10. Group actions 34
11. Sylow’s Theorems 38
12. Applications of Sylow’s Theorems 43
13. Finitely generated abelian groups 46
14. The symmetric group 49
15. The Jordan-Hölder Theorem 58
16. Soluble groups 62
17. Solutions to exercises 67
→
GROUP THEORY (MATH 33300) 3
1. B ASICS
1.1. Definition. Let G be a non-empty set and fix a map ◦ : G × G → G. The pair
(G, ◦) is called a group if
(1) for all a, b, c ∈ G: (a ◦ b) ◦ c = a ◦ (b ◦ c) (associativity axiom).
(2) there is e ∈ G such that e ◦ a = a for all a ∈ G (identity axiom).
(3) for every a ∈ G there is a 0 ∈ G such that a 0 ◦ a = e (inverse axiom) .
◦ is called the composition (sometimes also multiplication) and e is called the
identity element (or neutral element) of G, and a 0 the inverse of a. Where there is
no ambiguity, we will use the notation G instead of (G, ◦), and ab instead of a ◦ b.
We will denote by an (n ∈ N) the n-fold product of a, e.g., a3 = aaa.
Proof. We have
a = ea (identity axiom)
= (a 0 a)a for some a 0 ∈ G (inverse axiom)
(1.1) = a 0 a2 (associativity axiom)
= a 0a (by assumption)
=e (by definition of a 0 ).
1.5. Definition. The number of elements of a group G is called the order of G and is
denoted |G|. G is called a finite group if |G| < ∞ and infinite otherwise.
4 COURSE NOTES
1.6. Example. Let Zn denote the set {0, 1, . . . , n − 1}, where m is the residue class
modulo n (that is, the equivalence class of integers congruent to m mod n). Then:
(1) (Zn , +) is a finite group of order n.
(2) (Z∗n , ·), with Z∗n = {m ∈ Zn : gcd(m, n) = 1}, is a finite group of order ϕ(n) =
the number of integers < n that are coprime to n (Euler’s ϕ function).
1.8. Example. All of the above examples are abelian groups. An example of a non-
abelian group is the set of matrices
!
x y
(1.2) T= : x ∈ R∗ , y ∈ R
0 1/x
where the composition is matrix multiplication.
Proof. We have
! ! !
x1 y1 x2 y2 x3 y3
(1.3) =
0 1/x1 0 1/x2 0 1/x3
where x3 = x1 x2 and y3 = x1 y2 + y1 /x2 . Hence T is closed under multiplication. Ma-
trix multiplication is well known to be associative. The identity element corresponds
to x = 1, y = 0. As to the inverse,
!−1 !
x y 1/x −y
(1.4) = ∈ T.
0 1/x 0 x
Therefore T is a group. It is non abelian since for example
! ! ! ! ! !
2 0 1 1 2 2 2 12 1 1 2 0
(1.5) = 6= = .
0 12 0 1 0 21 0 12 0 1 0 12
1.11. Theorem. In a group table, every group element appears precisely once in ev-
ery row, and once in every column.
Proof. Suppose in the ith row we have xi xj = xi xk for j 6= k. Multiplying from the left
by x−1
i we obtain xj = xk , which contradicts our assumption that xj and xk are distinct
group elements. The proof for columns is analogous.
b ? ?
If the central coefficient ? is chosen to be e, then the ? below can, in view of Theorem
1.11 applied to the second column, only be b—but then there are two b 0 s in the final
row. Hence the only possibility is:
e a b
(1.10) a b e .
b e a
We have thus shown that there exists only one group of order 3.
1.13. Example. Let G = {e, a, b, c} and assume a2 = b2 = e. Then the group table is
e a b c
a e ? ?
(1.11)
b
.
? e ?
c ? ? ?
6 COURSE NOTES
The only possibility for ? is c, otherwise there would be two c’s in the last column.
Hence
e a b c
a e c b
(1.12) b ? e ? .
c ? a ?
1.14. Exercise. Write down the group tables for all residue class groups Z∗p for all
primes p ≤ 17.
1.15. Exercise. Let G be the set of symmetries of the regular n-gon (i.e., G comprises
reflections at diagonals and rotations about the center). Show that G forms a group
of order 2n, if the composition is the usual composition law for maps.
[This group is called the dihedral group Dn ; we will meet it again later in the
lecture.]
1.16. Exercise. Let K be a finite field with q elements. Determine the order of GL(n, K).
GROUP THEORY (MATH 33300) 7
2. H OMOMORPHISMS
2.1. Definition. Let (G, ◦), (H, ∗) be groups. The map ϕ : G → H is called a homo-
morphism from (G, ◦) to (H, ∗), if for all a, b ∈ G
2.2. Example.
(1) Let e 0 be the identity element of H. Then map ϕ : G → H defined by ϕ(a) = e 0
is a homomorphism.
(2) The map exp : R → R∗ , x 7→ ex , defines a homomorphism from (R, +) to
(R∗ , ·), since ex+y = ex ey .
(3) The map π : Z → Zn , m → m, defines a homomorphism from (Z, +) to
(Zn , +).
are homomorphisms.
(2) the map ϕ3 : R → SO(2) defined by
!
cos(t) − sin(t)
(2.3) ϕ3 (t) = ,
sin(t) cos(t)
is a homomorphism.
2.7. Exercise. Decide whether the homomorphisms in Exercise 2.3 are mono-, epi-,
or isomorphisms.
8 COURSE NOTES
Proof. (1) We have ϕ(e) = ϕ(ee) = ϕ(e)ϕ(e) and (1) follows from Lemma 1.3.
(2) ϕ(e) = ϕ(a−1 a) = ϕ(a−1 )ϕ(a), which proves (2) in view of (1).
(3) follows from (1) trivially when n = 0, and by induction for n > 0. For n < 0
ϕ(an ) = ϕ((a−1 )−n ) (by definition)
= ϕ(a−1 )−n (as we have just proved)
(2.4)
= (ϕ(a)−1 )−n (by (2))
= ϕ(a)n (by definition).
2.9. Definition. Let ϕ be a homomorphism from (G, ◦) to (H, ∗), and denote by e, e 0
denote the respective identity elements. The set
(2.5) im ϕ = {ϕ(a) : a ∈ G} ⊆ H
the kernel of ϕ.
Thus ba−1 ∈ ker ϕ, and hence, by our assumption ker ϕ = {e} we conclude ba−1 = e,
i.e., a = b.
GROUP THEORY (MATH 33300) 9
2.12. Theorem.
(1) If ϕ : G → H and ψ : H → K are homomorphisms, then so is ψ ◦ ϕ : G → K.
(2) If ϕ : G → H and ψ : H → K are isomorphisms, then so is ψ ◦ ϕ : G → K.
(3) If ϕ : G → H is an isomorphism, then so is ϕ−1 : H → G.
(4) The identity map id : G → G, a 7→ a is an automorphism.
(2.9) ϕ−1 (xy) = ϕ−1 (ϕ(a)ϕ(b)) = ϕ−1 (ϕ(ab)) = ab = ϕ−1 (x)ϕ−1 (y).
2.13. The above theorem has an important consequence: If G ' H then by (3) H '
G. If G ' H and H ' K then by (2) G ' K. Finally, by (4) we have G ' G. Hence '
defines an equivalence relation on groups.
Recall: Given a set X, an equivalence relation R is defined as a subset of X × X with
the properties:
(1) (x, x) ∈ R for all x ∈ R (reflexivity axiom).
(2) (x, y) ∈ R implies (y, x) ∈ R (symmetry axiom).
(3) (x, y), (y, z) ∈ R implies (x, z) ∈ R (transitivity axiom).
If (x, y) ∈ R we say x and y are equivalent and write x ∼ y.
It is in fact invertible:
(2.11) ϕ−1
g = ϕg−1
2.18. Exercise. Show that for a, b ∈ G the elements ab and ba are conjugate.
2.20. Definition. The kernel of Φ is called the center of G and is denoted by Z(G).
Explicitly,
Z(G) = {a ∈ G : ϕa = id} (by definition)
(2.13) = {a ∈ G : aba−1 = b for all b ∈ G}
= {a ∈ G : ab = ba for all b ∈ G}.
Hence Z(G) is the set of elements in G that commute with all elements in G. Note
that obviously Z(G) is a group, cf. also Exercise 2.10.
2.23. Exercise. Show that the symmetry group of a rectangle (that is not a square) is
the Klein four group.
2.24. Exercise. Set ζ := e2πi/n , and let G = {ζk : k = 1, . . . , n} be the group of the nth
roots of unity, where the composition is standard multiplication in C.
(1) Show that ϕ : Z → G, m 7→ ζm , is a homomorphism.
(2) Calculate ker(ϕ).
3. S UBGROUPS
3.2. Example.
(1) (Z, +) < (Q, +) < (R, +) < (C, +).
(2) If d ∈ N divides n ∈ N, then (nZ, +) ≤ (dZ, +).
(3) The groups in Example 1.8 and Exercise 2.3 are subgroups of GL(2, R).
Proof. The first implication follows from the previous theorem. Hence assume (3.3)
holds. Since G is a group, for every fixed a ∈ G the map G → G, x 7→ ax, is
injective. If a ∈ H, then the restriction of this map to H yields, in view of (3.3), a the
map H → H, x 7→ ax, which is still injective. But since H is finite, injective implies
surjective and hence bijective. Hence if y = ax ∈ H, the inverse map is H → H,
12 COURSE NOTES
3.6. Example. Let G = {e, a, b, c} be the Klein four group as defined in 1.13. The
above theorem shows that {e, a}, {e, b}, {e, c} are subgroups of G.
3.9. With the special choice ϕ = ϕg : x 7→ gxg−1 (the inner automorphism, 2.16) the
above shows that for every H ≤ G and g ∈ G we have gHg−1 ≤ G.
(3.4) H1 H2 = {ab : a ∈ H1 , b ∈ H2 }
Proof. If a, b ∈ H, so a, b ∈ Hα for all α. Then ab, a−1 ∈ Hα for all α and hence
ab, a−1 ∈ H.
4. G ENERATORS
4.3. Theorem. Let G be a group and S ⊆ G a non-empty subset. Then hSi consists of
all finite products of elements from S ∪ S−1 , where S−1 := {a−1 : a ∈ S}.
Proof. Let
4.6. Exercise.
(1) Fix > 0. Show that (R, +) is generated by the set (0, ].
(2) Give an example of a generating set S 6= Q for (Q, +). Justify your answer.
4.7. Exercise. Let us define the special linear group over a field K by
Show that
!
!
1 x 0 −1
(4.4) SL(2, K) = :x∈K ∪ .
0 1 1 0
GROUP THEORY (MATH 33300) 15
5. C YCLIC GROUPS
5.1. Definition. A group G is called cyclic, if there is g ∈ G such that G = hgi. The
element g is called the generator of G.
Note that G = {gn : n ∈ Z}, and that every cyclic group is abelian (since gm gn =
gm+n = gn gm ).
5.2. Example.
(1) (Z, +) is generated by 1 and thus cyclic. The subgroups (nZ, +) for some fixed
n ∈ Z are generated by n and hence also cyclic.
(2) (Zn , +) is generated by 1 and thus cyclic.
Proof. Let G = hgi and H < G. Every h ∈ H can be expressed as h = gm for some
m ∈ Z. Since the trivial group H = {e} is cyclic we may exclude this case from now
on and assume h 6= e. Thus there exists an element gm ∈ H with m 6= 0. Since
inverse axiom gm ∈ H implies g−m ∈ H there is gm ∈ H with m > 0, and hence the
set I = {k ∈ N : gk ∈ H} is non-empty. Let s be the smallest element of I and gm
an arbitrary element of H. Let q, r ∈ Z be such that m = qs + r, 0 ≤ r < s. Now
gr = gm−qs = gm (gs )−q ∈ H. If r 6= 0 then r ∈ I and we have a contradiction with s
being minimal. If r = 0, then m = qs, so gm = (gs )q , that is, H ⊆ hgs i. Since gs ∈ H
we also have hgs i ⊆ H and thus H = hgs i.
5.5. Definition. Let G be a group. The order of a ∈ G is the order of the cyclic group
hai and is denoted by ord a := |hai|.
5.6. Theorem. The order of a ∈ G is either infinite or equal to the smallest integer
s > 0 such that as = e. In the latter case hai = {e, a, a2 , . . . , as−1 }.
Proof. If ai 6= aj for all i 6= j, then ord a = ∞. Otherwise there are i < j such that
ai = aj , and hence ak = e with k = j − i > 0. Let s > 0 be the smallest integer
such that as = e. Then all elements in the set H = {e, a, a2 , . . . , as−1 } are distinct
(otherwise there would be a smaller element k < s such that ak = e) and is closed
under multiplication since as = e. Since H is finite, this implies H is a group and thus
H = hai.
GROUP THEORY (MATH 33300) 17
The following two corollaries follow directly from the above theorem.
5.9. Corollary. If ord a = n then hai = ham i if and only if m, n are coprime.
5.10. Corollary. A cyclic group of order n has ϕ(n) generators, where ϕ is Euler’s
ϕ function.
5.11. Theorem. If G is a cyclic group of order n, then for every divisor d of n there
exists precisely one subgroup of order d.
dm
Proof. Suppose G = hai, ord a = n = dm. So ord am = gcd(m,dm) = d and ham i has
order d. Suppose now there is a further subgroup H ≤ G of order d. By Theorem 5.3
H = hak i for some k ≥ 1. Now d = ord ak by assumption, which equals ord ak =
0
dm
gcd(k,n)
, so gcd(n, k) = m. This means m divides k, set k = mk 0 . Hence ak = (am )k ∈
ham i, i.e., H = hak i ≤ ham i. But since H has the same order as ham i, we in fact have
H = ham i.
Note that the above theorem in fact gives a complete classification of all subgroups
of a cyclic group G, since (a) every subgroup is cyclic (Theorem 5.3) and (b) the order
of every cyclic subgroup divides the order of G; this follows from Theorem 5.8.
6.4. Let us consider the equivalence classes for the relation RH . The equivalence
class of g ∈ G is
[g]H = {x ∈ G : (x, g) ∈ RH } (by definition)
= {x ∈ G : xg−1 ∈ H}
(6.5)
= {yg ∈ G : y ∈ H} (y = xg−1 )
= Hg.
6.5. Definition. For a given subgroup H ≤ G the sets Hg, g ∈ G are called the right
cosets of H.
6.6. Example. In the case G = Z, H = nZ, the right cosets m + nZ are the residue
classes modulo n.
6.9. Definition. Let H ≤ G. The number of distinct right cosets is called the index
of H in G and denoted by |G : H|. [The index can be infinite.]
[Note that the statement also formally holds if |G| and |G : H| or |H| are infinite.]
Proof. We have G = g∈G Hg, which is a disjoint union of |G : H| cosets. Since |Hg| =
S
6.11. Corollary. If G is a finite group, then the order of every subgroup divides |G|.
A special case of this for cyclic subgroups:
6.12. Corollary. If G is a finite group, then ord a divides |G| for every a ∈ G.
6.14. Corollary. (Fermat’s Little Theorem.) If G is a finite group, then a|G| = e for all
a ∈ G.
A special case of this is the following, which is due to Euler.
Proof. Let Z∗n be the group of integers modulo n that are coprime to n. Since |Z∗n | =
ϕ(n) we have mϕ(n) = 1 by Fermat’s Little Theorem 6.14. Recall that mr = mr for
any r ∈ N, and so mϕ(n) ≡ 1 mod n.
Proof. Prime order means that |G| is a prime number. So for a ∈ G \ {e} we have
ord a 6= 1. By Corollary 6.12 ord a divides |G| so ord a = |G| is the only possibility,
and hence hai = G since G is finite.
6.20. Definition. For a given subgroup H ≤ G the sets gH, g ∈ G are called the left
cosets of H.
One could of course repeat the above calculations for left cosets (and this is recom-
mended as an exercise), but the following theorem offers a shortcut.
6.21. Theorem. Let H ≤ G. Then there is a bijection from the set of right cosets to
the set of left cosets, defined by Hg 7→ g−1 H.
Hence Ha = Hb implies a−1 H = b−1 H and so the map is well defined. The reverse
implication implies injectivity, and surjectivity is obvious (the inverse map is given
by gH 7→ Hg−1 ).
(6.9) |G : K| = |G : H| |H : K|.
Proof. Let
[ [
(6.10) G= gα H, H= hβ K
α∈I β∈J
be unions of distinct cosets, where I, J denote suitable index sets. We claim that
[
(6.11) G= gα hβ K
α∈I,β∈J
is a union of distinct cosets. To prove this claim, suppose that gα hβ K = gα̃ hβ̃ K. This
implies that
This says in particular that if the Hi have finite index in G, so does their intersec-
tion.
6.26. Exercise.
(1) Write down the decomposition of Z∗15 into left cosets with respect to the sub-
group h7i.
350 1000
(2) Calculate in Z∗15 : 7 , 2 .
GROUP THEORY (MATH 33300) 23
7.3. Example.
(1) {e} E G and G E G.
(2) If H ≤ G and G is abelian, then H E G.
7.7. Note that with the choice H2 = {e} the theorem says that ker ϕ E G1 .
Proof. (1) Since H is normal, (aH)(bH) = a(bH)H ∈ G/H. The neutral element is
eH = H, and the inverse of aH is a−1 H.
(2) follows directly from the definitions.
(3) We have π(ab) = (ab)H = (aH)(bH) = π(a)π(b), so π is a homomorphism. As
to the kernel,
a ∈ ker π ⇔ π(a) = H (by definition, since H is the identity in G/H)
(7.6) ⇔ aH = H (by definition of π)
⇔a∈H (Theorem 6.7 (2))
7.12. It is often convenient to use the notation G := G/H, and a := aH. The group
multiplication in G is then given by a b = ab, the identity is e, and the inverse of a
is given by a−1 .
7.14. Example.
(1) Since Z is abelian, every subgroup nZ is normal. The quotient groups Z/nZ
are easily seen to be equal to Zn (the residue classes modulo n).
(2) The map GL(n, K) → K∗ = K \ {0}, A 7→ det A is a homomorphism since
det AB = det A det B. Its kernel is SL(n, K) := {A ∈ Kn×n : det A = 1} and we
have GL(n, K)/ SL(n, K) ' K∗ .
(3) For the trivial normal subgroup {e} E G we have G/{e} = {g{e} : g ∈ G} = {{g} :
g ∈ G} with composition {a}{b} = {ab}. Clearly G → G/{e} a 7→ {a} defines an
isomorphism. In the opposite extreme G E G, we have G/G = {G} and thus
G/G ' {e}.
26 COURSE NOTES
8. I SOMORPHISM T HEOREMS
8.1. The following theorems are useful in the classification of quotient groups of a
given group G, or (vice versa) its normal subgroups.
The following proves the maps is well defined (⇒) and injective (⇐):
We conclude Φ is an isomorphism.
8.3. Example.
(1) The isomorphisms given in Example 7.14 follow directly from the homomor-
phism theorem.
(2) Recall the inner automorphism ϕx (g) = xgx−1 , and that the homomorphism
G → Aut G, x 7→ ϕx has as its kernel the center Z(G) of G. Its image I(G)
is called the group of inner automorphisms. The homomorphism theorem
shows that G/Z(G) ' I(G).
(3) For m, n ∈ N, the map ϕ : mZ → Zn , mr 7→ r, is an epimorphism with kernel
mnZ. The homomorphism theorem shows mZ/mnZ ' Z/nZ.
8.5. Theorem. Every cyclic group of order n ∈ N is isomorphic to (Zn , +), and every
infinite cyclic group is isomorphic to (Z, +).
and by Theorem 3.11 HN is a subgroup. Note that N E HN, and consider the re-
striction of the canonical epimorphism π : G → G/N to H, which we denote by
π0 : H → G/N, h 7→ hN. For the image,
(8.8) ker π0 = {h ∈ H : hN = N} = {h ∈ H : h ∈ N} = H ∩ N.
Therefore H ∩ N is normal (Theorem 7.13), and the isomorphism follows from the
homomorphism theorem (take ϕ = π0 ).
8.7. Example. Isomorphism theorems are for instance useful in the calculation of
group orders, since isomorphic groups have the same order. If H ≤ G and K E G
so that HK is finite, then Lagrange’s Theorem with Theorem 7.10 (2) and the first
isomorphism theorem yield
|HK| |H|
(8.9) = |HK : K| = |HK/K| = |H/H ∩ K| = |H : H ∩ K| = ,
|K| |H ∩ K|
that is
|H| |K|
(8.10) |HK| = .
|H ∩ K|
8.8. Exercise. Prove formula (8.10) for general finite subgroups H, K ≤ G.
9. D IRECT PRODUCTS
9.2. Clearly the multiplication is associative, the identity is (e, . . . , e) and the inverse
(a−1 −1
1 , . . . , an ). Thus (G, ◦) is a group. We will also use the notations
Y
n
(9.3) G= Gi , Gn = G × G × · · · × G (n times).
i=1
9.3. Theorem.
Q Q
(1) ni=1 Gi = ni=1 |Gi |.
Qn Qn
(2) Z i=1 Gi = i=1 Z(Gi ).
Qn
(3) i=1 Gi is abelian if and and only if every factor Gi is abelian.
9.6. Definition. A group G is called inner direct product of the normal subgroups
N1 , . . . , Nk E G if
(1) G = N1 N2 · · · Nk ,
Q
(2) Ni ∩ j6=i Nj = {e}.
9.7. Note that our analysis in 9.5 shows that the outer direct product G = G1 × · · · ×
Gn is in fact an inner direct product G = G10 · · · Gn0 with Gi0 ' Gi .
9.8. Example. The Klein four group {e, a, b, c} is an inner direct product of {e, a} and
{e, b} and hence isomorphic to Z2 × Z2 .
The following theorem says that the notion of an outer and inner direct product
are essentially (i.e., up to isomorphism) the same.
(9.8) ϕ : G → N1 × N2 × · · · × Nk , a 7→ (a1 , a2 , . . . , ak ),
Then N E G and
Y
k
(9.11) G/N ' Gi /Ni .
i=1
32 COURSE NOTES
9.15. Theorem.
(1) The direct product of two cyclic groups with coprime order is cyclic.
(2) If a cyclic group has order mn, with m, n coprime, then it is isomorphic to the
direct product of two cyclic groups of order m and n, respectively.
We rewrite this theorem in following equivalent (by Theorem 8.5) form:
9.22. Exercise. Let H, K be normal subgroups of the finite group G, with gcd(|H|, |K|) =
1. Show that
(1) H ∩ K = {e}.
(2) hk = kh for all h ∈ H, k ∈ K.
(3) HK ' H × K.
34 COURSE NOTES
is an equivalence relation.
Proof. Since e · x = x we have (x, x) ∈ R(G) for all x ∈ X. Next, if (x, y) ∈ R(G), i.e.,
g · x = y for some g ∈ G, then
and so (y, x) ∈ R(G). Finally if (x, y), (y, z) ∈ R(G), i.e., g · x = y, h · y = z for some
g, h ∈ G, then
(10.3) (hg) · x = h · (g · x) = h · y = z,
10.3. Theorem 10.2 implies that X can be written as a disjoint union of equivalence
classes with respect to R(G). The equivalence class of x ∈ X is explicitly
[x] = {y ∈ X : (x, y) ∈ R(G)} (by definition)
= {y ∈ X : (∃g ∈ G)(g · x = y)} (by definition of R(G))
(10.4)
= {g · x : g ∈ G}
= G · x.
Hence,
[
(10.5) X= G · x.
x∈X
and
(10.7) |G · x| = |G : Gx |.
If h, h 0 ∈ Gx , we have hh 0 ∈ Gx , since
(10.9) (hh 0 ) · x = h · (h 0 · x) = h · x = x.
Hence Gx ≤ G.
To prove (10.7), consider the map
10.9. Definition. The subset V ⊆ X is called a representative set for the orbits G · x,
if
(1) For every x ∈ X there is a v ∈ V such that G · x = G · v,
6 b for a, b ∈ V then G · a 6= G · b.
(2) If a =
The elements of V are called representatives.
defines a G action.
(2) What are the orbits and fixed point sets of this G action?
10.13. Exercise. Let H ≤ G, and define H action by restricting the map (10.14) to
H × X. Calculate the orbits and fixed point sets in the following cases:
(1) H =
SO(2). !
a 0
(2) H = : a ∈ R>0 .
0 a
!
a 0
(3) H = : a ∈ R>0 .
0 a−1
!
1 x
(4) H = :x∈R .
0 1
* !+
0 −1
(5) H = .
1 0
10.14. Note that x ∈ FixG (X) if and only if G · x = {x}, i.e., Gx = G, i.e., |G : Gx | = 1.
Therefore x ∈ V and we can write (10.12) as
[ X
(10.15) X = FixG (X) ∪ G · x, |X| = | FixG (X)| + |G : Gx |.
x∈V x∈V
|G:Gx |>1 |G:Gx |>1
In particular, if p does not divide |X|, there is at least one fixed point.
By Lagrange’s Theorems every summand on the right hand side divides pr . Since
|G : Gx | > 1 we have |G : Gx | = pl for some l ≥ 1. Hence |G : Gx | is in particular
divisible by p.
GROUP THEORY (MATH 33300) 37
10.19. Theorem. If G is a group of order pr , p prime, then its center Z(G) is non-
trivial, i.e. Z(G) 6= {e}.
Proof. Z(G), NG (x) are subgroups of G. By Lagrange’s theorem, |Z(G)| = pk for some
k = 0, . . . , r, and also |G : NG (x)| = pl , for some l = 1, . . . , r. In view of (10.21), |Z(G)|
is therefore divisible by p, and hence k ≥ 1. That is, |Z(G)| > 1.
11.1. Lemma. Let n ∈ N and p prime such that n = pr m for some!m ∈ N with
n
gcd(m, p) = 1. Then, for every s = 1, . . . , r, pr−s+1 does not divide .
ps
Proof. We have
!
n n!
= (by definition)
ps ps !(n− ps )!
n(n − 1) · · · (n − ps + 1)
=
1 · 2 · · · ps
(11.1)
(n − 1) · · · (n − ps + 1)
= mpr−s
1 · 2 · · · (ps − 1)
!
n − 1
= mpr−s .
ps − 1
We thus need to show that the integer
Y mpr − i
! ps −1
n−1
(11.2) =
ps − 1 i=1
i
11.2. The First Sylow Theorem. Let G be a finite group of order n = pr m, with p
prime and gcd(m, p) = 1. Then, given any s = 1, . . . , r, there is a subgroup of order
ps .
Proof. Let
(11.5) Xs = {A ⊆ G : |A| = ps }
action on the family X of subsets A of G. Since |gA| = |A|, it in fact defines an action
on Xs . We have therefore a decomposition into disjoint orbits,
[
(11.6) Xs = GA
A∈V
By Lemma 11.1 the above is not divisible by pr−s+1 , hence at least one summand
|G : GA | is not divisible by pr−s+1 . Thus pr−s is the highest power of p that may divide
|G : GA |.
By assumption pr m = |G| = |G : GA | |GA |. We the previous observation this implies
that ps divides |GA |, and so |GA | ≥ ps .
Since GA is the stabilizer of A we have GA A = A, i.e., GA a ⊆ A for every a ∈ A.
Therefore |GA | = |GA a| ≤ |A| = ps .
Combining this with the above inequality yields |GA | = ps . This proves the exis-
tence of a subgroup of order ps .
11.3. Corollary. (Cauchy’s Theorem.) Let G be a finite group whose order is divisi-
ble by the prime p. Then G contains an element of order p.
11.4. Definition. Let p be a prime. A group G is called p-group, if the order of every
element of G is a power of p.
k
That is, by Corollary 5.7, for every g ∈ G there is a k ≥ 0 such that gp = e.
11.5. Corollary. A finite group is a p-group, if and only if its order is a power of p.
Proof. If |G| = pl , then by Fermat’s Little Theorem 6.14, gp = e for all g, and hence
l
G is a p-group. If, on the other hand, |G| would be divisible by a prime q 6= p, then
(by the previous Theorem of Cauchy) G would have an element of order q, which
contradicts the assumption that G is a p-group.
Note that (2) says that p-Sylow groups are maximal in the family of p-subgroup.
In particular, a p-group is equal to its (unique) p-Sylow group.
11.8. Theorem. Let G be a finite group of order n = pr m, with p prime and gcd(m, p) =
1. Then every subgroup of order pr is a p-Sylow group.
11.9. Corollary. Let G be a finite group of order n = pr m, with p prime and gcd(m, p) =
1. Then G contains at least one p-Sylow group of order pr .
Proof. The First Sylow Theorem shows that G contains a subgroup of order pr , which
by 11.8 is a p-Sylow group.
Proof. Since x and gxg−1 have the same order, H is a p-subgroup if and only if gHg−1
is.
Let H be a p-Sylow group and assume gHg−1 < K for some p-subgroup K. Then
H < K 0 with the p-subgroup K 0 = g−1 Kg. But H < K 0 contradicts the assumption that
H is a p-Sylow group, cf. Definition 11.7 (2).
11.11. The Second Sylow Theorem. Let G be a finite group of order n = pr m, with p
prime and gcd(m, p) = 1, and let P be a p-Sylow group of G. Then, every p-subgroup
H of G is conjugate to a subgroup of P.
Proof. First assume P is a p-Sylow group of order pr . Consider the left cosets
Now
|G| pr m
(11.11) |X| = |G : P| = = r = m,
|P| p
and thus p does not divide |X|. Therefore at least one of the summands in (11.10) is
not divisible by p, say |HaP|. On the other hand, by Corollary 10.7, |HaP| divides |H|,
GROUP THEORY (MATH 33300) 41
but since |H| is a power of p, we find |HaP| = 1. We conclude from this that gP is a
fixed point under the H action, i.e., for all h ∈ H,
We highlight the last argument of the above proof in the following statement.
11.12. Corollary. Let G be a finite group of order n = pr m, with p prime and gcd(m, p) =
1. Then:
(1) Every p-Sylow group has order pr .
(2) Every pair of p-Sylow groups of G are conjugate (and thus isomorphic).
11.14. Lemma. Let P be a p-Sylow group of G. If a ∈ NG (P)/P has order pl for some
l ≥ 0, then a is the identity in NG (P)/P (i.e., a ∈ P).
Proof. The cyclic group hai has order pl and hence is a p-group. By Theorem 8.10
(2) there is a subgroup H [namely H = π−1 (hai)] such that P ≤ H ≤ NG (P) and
hai = H/P. Now |H| = |H/P| |P| and so |H| is a power of p, hence H is a p-group.
Definition 11.7 (2) implies H = P and thus hai = P/P = {e}.
11.16. The Third Sylow Theorem. Let G be a finite group whose order is divisible
by p. Then the number of p-Sylow groups of G divides |G| and is of the form kp + 1
for some k ≥ 0.
Proof. Denote by
(11.13) X = {P0 , P1 , P2 , . . . , Pr }
the collection of p-Sylow groups Pi of G. By Corollary 11.12,
(11.14) X = {gP0 g−1 : g ∈ G},
and by Theorem 10.17, |X| = |G : NG (P0 )| = |G|/|NG (P0 )|. Hence |X| divides |G|.
To prove the second part of the statement, define the action
(11.15) P × X → X, (h, X) 7→ hXh−1 .
Equation (10.15) yields
X
(11.16) |X| = | FixP (X)| + |P : PX |.
X∈V
|P:PX |>1
Now
(11.17) FixP (X) = {X ∈ X : hXh−1 = X for all h ∈ P}.
Since X is a p-Sylow group, Lemma 11.15 says that the condition hXh−1 = X for all
h ∈ P implies P ⊆ X and hence P = X by Definition 11.7 (2). Therefore
(11.18) FixP (X) = {P}, | FixP (X)| = 1,
and (11.16) becomes
X
(11.19) |X| = 1 + |P : PX |.
X∈V
|P:PX |>1
Since |P : PX | = |P|/|PX | are of the form pj for some j ≥ 0, we conclude that the terms
corresponding to |P : PX | > 1 are divisible by p.
GROUP THEORY (MATH 33300) 43
12.1. We will know discuss some applications of Sylow’s theorems to the classifica-
tion of groups G of order pr . The simplest case is r = 1. Then by Corollary 6.18 G is
cyclic, and by Theorem 8.5 it is isomorphic to (Zp , +).
In the case r = 2 we know from Theorem 10.19 that the center Z(G) is non-trivial,
i.e., |Z(G)| > 1 and hence |Z(G)| = p or |Z(G)| = p2 . In the latter case Z(G) = G
and G is abelian. In the former case G/Z(G) has order p and is thus cyclic (Corollary
6.18). This implies G is abelian (why?) and so Z(G) = G, which contradicts our
assumption |Z(G)| = p. We conclude that every group of order p2 is abelian. The
following theorem gives a complete classification:
12.2. Theorem. For every prime p there are, up to isomorphism, precisely two non-
isomorphic groups of order p2 ; these are Zp2 and Zp × Zp .
Proof. By Theorem 5.11, Zp2 has precisely one subgroup of order p, whereas Zp × Zp
has at least two: Zp × {0} and {0} × Zp . The two groups are therefore non-isomorphic.
Assume G has order p2 and is not isomorphic to Zp2 . This means G is not cyclic. By
Cauchy’s Theorem 11.3 there is a ∈ G with ord a = p. For b ∈ / hai we have ordb = p
2
or = p ; the latter is impossible since this would imply G is cyclic. So ord b = p and
|hbi| = p. Note that, since b ∈/ hai and any group of prime order cannot have non-
trivial subgroups, we have hai ∩ hbi = {e}. Clearly |haihbi| = |hai| |hbi| = p2 = |G| and
thus G = haihbi. By the first observation in 12.1 G is abelian, hence hai and hbi are
normal subgroups, and so Theorem 8.5 and Theorem 9.12 show that G ' Zp ×Zp .
The case r > 2 is harder; we have the following general theorem, which allows a
reduction to smaller r.
12.3. Theorem. Every group of order pr , p prime, has a normal subgroup of order
pr−1 .
Proof. Proof by induction. For r = 1 the statement is trivial. By Theorem 10.19, Z(G)
is non-trivial, i.e., |Z(G)| = pl , for l ≥ 1. The First Sylow Theorem guarantees the
existence of a subgroup N ≤ Z(G) of order p, which (as a subgroup of the center) is
normal. Then |G/N| = |G|/|N| = pr−1 . By assumption, the group G/N has a normal
subgroup K of order pr−2 . By Theorem 8.10 (2) there is a subgroup K with N ≤ K E G,
such that K = K/N. Finally, pr−2 = |K| = |K|/|N| = |K|/p implies |K| = pr−1 .
12.4. Corollary. Let G be a finite group of order pr , p prime. Then there are groups
Gi (i = 0, . . . , r) of order pi such that
12.5. Theorem. Let G be a finite group of order pq, with p < q both prime. Then
(1) G contains precisely one q-Sylow group of order q.
(2) If q 6= kp + 1 for all k ≥ 0, then G is cyclic.
Proof. (1) Corollary 11.9 shows that there is at least one q-Sylow group. Furthermore,
any such group has of order q (cf. Theorem 11.8). Let sq be the number of the q-Sylow
groups of G. By the Third Sylow Theorem, sq divides |G|, so sq ∈ {1, p, q, pq}, and
furthermore is of the form sq = kq + 1, for some k ≥ 0. The only consistent choice
is sq = 1, since p = kq + 1 implies p > q (contradicting our assumption p < q),
q = kq + 1 implies q > q, and pq = kq + 1 implies that q divides 1, which is false.
(2) The plan is to prove G ' Zp × Zq , which, by Theorem 9.16 is equivalent to
G ' Zpq , and thus establishes that G is cyclic. Let sp be the number of the p-Sylow
groups of G. Again, by the Third Sylow Theorem, sp divides |G|, so sp ∈ {1, p, q, pq},
and in addition is of the form sp = kp + 1, for some k ≥ 0. And again, sp = 1 is the
only possibility, since sp = p, pq are ruled out since p does not divide 1, and sp = q
violates the assumption of (2). Hence we have precisely one subgroup Hp of order p
and precisely one subgroup Hq of order q. By Corollary 6.19 Hp ∩ Hq = {e}. Therefore
Theorem 8.5 and Theorem 9.12 imply that G ' Zp × Zq (cf. the proof of Theorem
12.2).
12.6. Corollary. There are precisely two (up to isomorphism) groups of order 2p, p
prime; these are Z2p and the dihedral group Dp .
Proof. Let G be a group of order 2p. The statement for p = 2 follows from Theorem
12.2. For p > 2 we now from the previous proof that sp = 1 and s2 = 1 or s2 = p.
We have seen that s2 = 1 implies G is cyclic, i.e., G ' Z2p . If s2 = p, then we have p-
subgroups of order 2. Let P be the unique p-Sylow group of order p. P is then normal
(Corollary 11.13) and cyclic, say P = hai. We have the coset decomposition G = P∪bP
with b ∈ G \ P. There are three possibilities: ord b = 2, p, 2p. If ord b = p, then |hbi| =
p which implies hbi = P by the uniqueness of P—a contradiction. If ord b = 2p
then G is cyclic and there is precisely one 2-Sylow-group—a contradiction. Hence
ord b = 2. Since also G = P ∪ abP, by the same reasoning ord(ab) = 2. We conclude
(12.2) G = {e, a, a2 , . . . , ap−1 , b, ba, ba2 , . . . , bap−1 }
with ord a = p, ord b = ord(ab) = 2, and so G = Dp in this case.
12.7. Lemma. If P is a p-Sylow group of the finite group G, then NG (NG (P)) =
NG (P).
Proof. By Corollary 11.13, P is the unique p-Sylow group of NG (P). If x ∈ NG (NG (P))
then xNG (P)x−1 ⊆ NG (P), and (because P ⊆ NG (P)) we have xPx−1 ⊆ NG (P). Since
also xPx−1 is p-Sylow, we have by uniqueness xPx−1 = P. So x ∈ NG (P) and so
NG (NG (P)) ⊆ NG (P). Recall NG (P) ⊆ NG (NG (P)) by definition.
GROUP THEORY (MATH 33300) 45
12.8. Definition. We say a group G satisfies the normaliser condition if H < G im-
plies H < NG (H).
12.9. Lemma. Assume the finite group G satisfies the normaliser condition. Then
for every prime p dividing |G| there is precisely one p-Sylow group of G.
Proof. Let P be a p-Sylow group of G. By the previous lemma NG (NG (P)) = NG (P),
and so the normaliser condition rules NG (P) < G out, i.e., we have in fact NG (P) = G.
Hence P E G, and Corollary 11.13 completes the proof.
12.10. Theorem. Assume the finite group G satisfies the normaliser condition, and
let p1 , . . . , pr be the primes dividing |G|. Then
(12.3) G = Gp1 · · · Gpr
with the p-Sylow groups
(12.4) Gp := {x ∈ G : ord x = pk for some k ≥ 0}.
Proof. hxi is a p-group, and so hxi ≤ Hp , where Hp is the unique p-Sylow group of G
constructed in Lemma 12.9. Hence Gp ≤ Hp . Trivially, Hp ≤ Gp . Exercise 9.17 yields
that
(12.5) Gp1 · · · Gpr ' Gp1 × · · · × Gpr .
Since the outer direct product has the same order as G, it is isomorphic to G, and the
proof is complete.
12.11. Exercise. Let G be a group of order 12, and s2 and s3 the number of 2- resp.
3-Sylow groups in G.
(1) Which numbers are possible for s2 and s3 ? Justify your answer.
(2) Show that it is not possible to have s2 = 3 and s3 = 4 simultaneously.
(3) Show that, if s2 = s3 = 1, then G is abelian and there are two possible choices
of G.
13.1. It is no surprise that the structure of abelian groups is easier to analyze than
that of more general groups. It is traditional to use the symbol + for the group com-
position “addition”), ) for the neutral element, −g for the inverse of g, and call the
direct product × of abelian groups the direct sum, denoted by ⊕.
13.2. A finitely generated abelian group G = hg1 , . . . , gn i then consists of all linear
combinations of the form m1 g1 +. . . mn gn with mi ∈ Z. Note that a finitely generated
abelian group is not necessarily finite; one example of an infinite, finitely generated
abelian group is Z.
13.3. The abelian group G is the direct sum of the subgroups G1 , . . . , Gn , if and only
if (1) every g ∈ G can be written g = g1 + . . . + gn with gi ∈ Gi and (2) g1 + . . . + gn = 0
implies gi = 0 for all i.
13.4. The p-Sylow groups of a finite abelian group G are easily described: Let p be
a prime dividing |G|. Then
is the unique p-Sylow group of G, cf. Lemma 12.9 (note that every abelian group
satisfies the normaliser condition). Theorem 12.10 furthermore shows:
13.5. Corollary. Every finite abelian group is the direct sum of its p-Sylow groups.
The following provides a complete description of all finitely generated abelian
groups.
13.6. Theorem. An abelian group is finitely generated, if and only if it is the direct
sum of finitely many cyclic groups. In this case
Proof. Assume G is the direct sum of finitely many cyclic groups. Then the generators
of the cyclic groups form a finite generating set for G.
On the other hand, assume G is generated by n elements, a1 , . . . , an , with n mini-
mal (i.e., there is no generating set with less than n elements). We proceed by induc-
tion on n. If n = 1, then G is cyclic.
If in the case of general n, for any minimal set of generators a1 , . . . , an we have
that m1 a1 + . . . + mn an = 0 implies mi ai = 0 for all i, then by 13.3
Suppose this is not the case, i.e., there is a minimal set of generators such that m1 a1 +
. . . + mn an = 0 has a solution with at least one mi ai 6= 0. What we will show is that
G can still be written as a direct product of cyclic groups.
Assume without loss of generality that all mi ≥ 0 (replace ai by −ai if necessary,
−ai will still be a generator). Let m > 0 be the smallest non-zero coefficient that
can appear for any choice of generators. Without loss of generality, we may assume
m = m1 (if necessary, relabel the ai in different order).
Let us prove the following:
Claim 1. If m10 a1 + . . . + mn0 an = 0 for some mi0 ∈ Z≥0 , then m divides m10 .
Claim 2. m divides mi for all i.
(13.6) a∗1 := a1 + s2 a2 + . . . + sn an .
Then
X
n
(13.7) m1 a∗1 = m1 a1 + m1 s2 a2 + . . . + m1 sn an = mi ai = 0.
i=1
(13.9) g = k1 a∗1 = k2 a2 + . . . + kn an ,
i.e.,
k1 a∗1 − k2 a2 + . . . + kn an = 0.
(13.10)
48 COURSE NOTES
Using (13.6),
(13.11) k1 a1 + (k1 s1 − k2 )a2 + . . . . . . + (k1 sn − kn )an = 0.
Claim 1 now implies k1 = hm1 and so g = k1 a∗1 = hm1 a∗1 = 0 (since m1 a∗1 = 0). So
g = 0 and Claim 3 is proved.
By the induction hypothesis, ha2 , . . . , an i is the direct sum of finitely many cyclic
groups. Claim 3 thus concludes the proof of the first part of the Theorem.
The isomorphism (13.2) follows from the facts that every cyclic group is isomor-
phic to Z or Zn (for some n ∈ N), and that Zn can be written as a direct sum of groups
of the form Zpk (Corollary 9.18).
13.7. Exercise. Let G be a finitely generated abelian group. Prove that, if every g ∈ G
has finite order, then G is finite.
GROUP THEORY (MATH 33300) 49
14.1. Definition. Let X be a set and consider the set S(X) of bijective maps f : X → X,
and denote by ◦ the usual composition of maps. Then (S(X), ◦), or S(X) for short, is
called the symmetric group of X (often also the group of permutations of X).
14.3. An important example is the symmetric group of N, S(N), and the group of
permutations of n elements, Sn := S({1, 2, . . . , n}), which we view as a subgroup of
Sn+1 and of S(N). It follows from elementary combinatorics that |Sn | = n!.
and re-arranging the columns in such a way that the top row appears in the correct
order. For example
!−1 !
1 2 3 4 5 1 2 3 4 5
(14.5) = .
3 1 5 4 2 2 5 1 4 3
14.5. Example. The Klein four group can be realized as the following subgroup of
S4 :
! ! !
1 2 3 4 1 2 3 4 1 2 3 4
(14.6) V4 = e = id, a = , b= , c= .
2 1 4 3 3 4 1 2 4 3 2 1
50 COURSE NOTES
14.6. It is convenient to reduce the notation by ignoring those elements that remain
unchanged, e.g.,
! !
1 2 3 5 1 2 3 4 5
(14.7) := .
3 1 5 2 3 1 5 4 2
(14.8) 1 7→ 3 7→ 5 7→ 2 7→ 1, 4 7→ 4,
and is in fact completely characterized by the notation (1, 3, 5, 2) (or any cyclic per-
mutation thereof). This motivates the following:
such that
(14.11) f = (i1 , . . . , ir ).
14.8. Note that the condition f(ir ) = i1 is superfluous; it is implied by the other
assumptions. The only one-cycle is the identity id = (i), for any i ∈ N. It is customary
to use (1). Here are a few calculation rules for the cycle notation:
14.9. Theorem.
(1) (i1 , i2 , . . . , ir ) = (im+1 mod r , . . . , im+r mod r ) for all m ∈ Z (i.e., a cycle is invariant
under cyclic permutations).
(2) (i1 , . . . , ir ) = (i1 , . . . , ij )(ij , . . . , ir ) (2 ≤ j ≤ r − 1).
(3) (i1 , . . . , ir ) = (i1 , i2 )(i2 , i3 ) · · · (ir−2 , ir−1 )(ir−1
! , ir ).
i1 ... ir
(4) (i1 , . . . , ir )m = .
im+1 mod r . . . im+r mod r
(5) ord(i1 , . . . , ir ) = r.
(6) (i1 , . . . , ir )−1 = (ir , ir−1 , . . . , i1 ).
(7) f(i1 , . . . , ir )f−1 = (f(i1 ), . . . , f(ir )).
fk Sn = fl Sn ⇔ f−1
l fk Sn = Sn
⇔ f−1
l fk (n + 1) = n + 1
(14.15)
⇔ fk (n + 1) = fl (n + 1)
⇔k=l
since fl (n + 1) = l for 1 ≤ l ≤ n + 1.
14.11. The above theorem implies that |Sn+1 : Sn | = n + 1. Thus, via Lagrange’s
Theorem, |Sn+1 | = (n + 1)|Sn |, and we recover (by induction on n) the classical com-
binatorial result |Sn | = n!.
Proof by induction. For n = 2, S2 is the group of 2! = 2 elements {(1), (1, 2)}, where
(1) = (1, 2)(1, 2). Hence S2 = h(1, 2)i. If f ∈ Sn+1 , then Theorem 14.10 says that
f = fl g where fl is a transposition (or the identity) and g ∈ Sn . By the induction
hypothesis g is a product of transpositions, and therefore the same is true for f.
52 COURSE NOTES
14.13. Note that in fact Sn = h(1, 2), (1, 3), . . . , (1, n)i, since (i, j) = (1, i)(1, j)(1, i):
1 i j
i 1 j
i j 1
1 j i
14.14. Definition. Two cycles f = (i1 , . . . , ir ) and g = (j1 , . . . , js ) are called disjoint,
if {i1 , . . . , ir } ∩ {j1 , . . . , js } = ∅.
the decomposition of X into disjoint orbits of the action of the cyclic subgroup hfi ≤
Sn . Define
f(j) (j ∈ X )
i
(14.17) fi (j) :=
j (j ∈
/ Xi ).
If Xi comprises only one element, then fi = id. If, say, X1 , . . . , Xk are orbits with more
than one element, then f1 , . . . , fk are disjoint cycles, since fi (jl ) = f(jl ) = jl+1 for all
jl ∈ {j1 , . . . , jm } = Xi ; this is a consequence of the fact that Xi is an orbit of the cyclic
group hfi. We therefore have f = f1 · · · fk . Note that Xi is the only non-trivial orbit
(i.e., it has more than one element) of the action of hfi i.
To show uniqueness, suppose f = g1 . . . gl is a different factorisation into disjoint
cycles, and let Yi be the non-trivial orbit of hgi i. Since the action of hfi and hgi i on Yi
are the same, Yi is also an orbit of hfi. If x ∈ X is not changed by at least one gi , then
f(x) = x. Hence hfi has no further non-trivial orbits than Y1 , . . . , Yl . But this implies
k = l, X1 = Y1 , X2 = Y2 , etc. (after suitably relabeling the Yi ). Now gi |Xi = f|Xi = fi |Xi ,
and one the complement gi |Xci = id = fi |Xci , and hence fi = gi .
GROUP THEORY (MATH 33300) 53
Proof. Let us take (2) as the definition of and then show the remaining statements,
including (14.18). For f, g ∈ Sn we have
Y f(g(i)) − f(g(j))
(fg) =
1≤i<j≤n
i−j
Y f(g(i)) − f(g(j)) Y g(i) − g(j)
=
1≤i<j≤n
g(i) − g(j) 1≤i<j≤n i−j
Y f(i) − f(j) Y g(i) − g(j)
(14.20) =
i − j 1≤i<j≤n i−j
1≤g−1 (i)<g−1 (j)≤n
Y f(i) − f(j) Y g(i) − g(j)
=
1≤i<j≤n
i − j 1≤i<j≤n i−j
= (f)(g).
The equality before last follows from the fact that f(i)−f(j)
i−j
is invariant under the ex-
change of i and j.
To prove (1) (and thus in particular the original definition (14.18)) let (i, j) be a
transposition. By Theorem 14.9 (7) (i, j) = (g(1), g(2)) = g(1, 2)g−1 for any g such
that g(1) = i, g(2) = j. Because of (14.20), ((i, j)) = (g)((1, 2))(g)−1 = ((1, 2)).
Finally
Y f(1) − f(j) Y f(2) − f(j) Y f(i) − f(j)
((1, 2)) =
1<j≤n
1 − j 2<j≤n 2 − j 3≤i<j≤n i − j
= −1.
Hence if f = f1 · · · fs with transpositions fi , we have (f) = (f1 ) · · · (fs ) = (−1)s .
54 COURSE NOTES
14.19. Note that the definition of is in fact independent of n. For f ∈ Sn−1 ≤ Sn (so
f(n) = n) we have
Y f(i) − f(j)
(f) =
1≤i<j≤n
i−j
Y f(i) − f(j) Y f(i) − f(n)
(14.22) =
1≤i<j≤n−1
i − j 1≤i<n i − n
Y f(i) − f(j)
= ,
1≤i<j≤n−1
i − j
since
Y f(i) − f(n) Y f(i) − n Qn−1 Qn−1
i=1 (f(i) − n) (i − n)
(14.23) = = Qn−1 = Qi=1
n−1
= 1.
1≤i<n
i−n 1≤i<n
i−n i=1 (i − n) i=1 (i − n)
14.20. Corollary. The number of transpositions that can appear in the factorisation
of a given permutation f is always either even or odd.
14.21. Definition. A permutation is called even if (f) = 1, and odd if (f) = −1.
14.22. Example.
(1) The identity is even since (1) = (i, j)(j, i).
(2) All transpositions are odd.
(3) 3-cycles are even, since (i, j, k) = (i, j)(j, k).
(4) Theorem 14.9 shows that an r-cycle is even or odd, if r is odd or even, respec-
tively.
Proof. The Homomorphism Theorem shows Sn /An ' {−1, 1} and so 2 = |{−1, 1}| =
|Sn /An | = |Sn |/|An | = n!/2.
GROUP THEORY (MATH 33300) 55
14.26. Since An is the group of even permutations, every element in An can be rep-
resented as an even product of transpositions (assume n ≥ 3). Hence
(14.26) An = h{(i, j)(k, l) : 1 ≤ i < j ≤ n, 1 ≤ k < l ≤ n}.
The following is more useful.
14.29. Definition. A group G is called simple if G 6= {e} and {e} and G are the only
normal subgroups.
Case 1: Suppose the canonical factorisation contains one r-cycle with r ≥ 4. Since
ai commute, we may assume that this is the first cycle a1 = (i1 , i2 , i3 , . . . , ir ). Since N
is normal, we have for b = (i1 , i2 , i3 ) ∈ An that the following element is in N:
N 3 a(ba−1 b−1 ) = (aba−1 )b−1
= (a1 ba−1
1 )b
−1
= (i2 , i3 , i5 )(i4 , i2 , i1 )
(14.31)
= (i3 , i5 , i2 )(i2 , i1 , i4 )
= (i3 , i5 , i2 , i1 , i4 )
which is a 5-cycle, so we have reduced the problem to Case 1.
Case 3. Suppose the canonical factorisation of a contains more than one 3-cycle,
i.e., a = (i1 , i2 , i3 )(i4 , i5 , i6 )a3 · · · ar . For b = (i1 , i2 , i4 ) ∈ An
(14.32)
N 3 a(ba−1 b−1 ) = [(i1 , i2 , i3 )(i4 , i5 , i6 )](i1 , i2 , i4 )[(i1 , i2 , i3 )(i4 , i5 , i6 )]−1 (i4 , i2 , i1 )
= (i2 , i3 , i5 )(i4 , i2 , i1 )
and we conclude as in Case 2.
Case 4: Suppose the canonical factorisation of a contains only transpositions, a =
(i1 , i2 )(i3 , i4 )a3 · · · ar . Choose i5 6= i1 , i2 , i3 , i4 , and let b = (i1 , i3 , i5 ).
N 3 a(ba−1 b−1 ) = [a(i1 , i3 , i5 )a−1 ](i5 , i3 , i1 )
(14.33)
= (i2 , i4 , a(i5 ))(i5 , i3 , i1 ).
If a(i5 ) = i5 then we obtain a 5-cycle and hence Case 1, if a(i5 ) 6= i5 it follows
(i2 , i4 , a(i5 )) = (a(i1 ), a(i3 ), a(i5 )) and (i5 , i3 , i1 ) are disjoint (since a is bijective),
which yields Case 3.
14.34. Exercise. Show that Sn is generated by {(1, 2), (1, 3), . . . , (1, n)}.
58 COURSE NOTES
(15.1) G = G1 ≥ G2 ≥ G3 ≥ . . .
is called a descending chain of G. The chain is finite, if there is i0 such that Gi+1 = Gi
for all i ≥ i0 .
A descending chain is called a normal chain, if Gi+1 E Gi for all i ∈ N, and Gi /Gi+i
are called the factors of the normal chain. (Note: Gi is not necessarily normal in G,
which is why one often finds the notion of a subnormal chain in the literature.)
A normal chain is called a cyclic chain or abelian chain, if all factors are cyclic or
abelian, respectively.
A finite normal chain
(15.2) G = G1 ≥ G2 ≥ . . . ≥ Gm = N
(15.3) G1 ≥ G2 ≥ . . . ≥ Gm , H1 ≥ H2 ≥ . . . ≥ Hn ,
15.2. Example. Z > pZ > p2 Z > . . . is an infinite normal chain. Since pi Z/pi+1 Z '
Zp (Example 8.3) the chain is abelian.
and since the kernel A1 K/A1 is normal, we have KA1 = A1 K is normal in A1 H (Theo-
rem 8.10 (3)). This proves (1) and thus (2).
To construct ϕ, note that H ≤ A and A1 E A implies A1 H = HA1 and thus A1 E A1 H ≤
A. The First Isomorphism Theorem shows that
This is precisely the epimorphism needed, since hA1 ∈ ker ϕ if and only if ψ1 (hA1 ) =
hL ∈ ker ψ2 = KL/L. This is the case if and only if h ∈ K, i.e.,
60 COURSE NOTES
15.6. Schreier’s Theorem. Any two normal series of a group G possess equivalent
refinements.
Proof. Let
(15.14) G = G1 ≥ G2 ≥ . . . ≥ Gm = E, G = H1 ≥ H2 ≥ . . . ≥ Hn = E
Note that Gi,1 = Gi , Gi,n = Gi+1 . The Zassenhaus lemma (1) shows Gi,j+1 E Gi,j . We
thus obtain a refinement of the normal series,
15.7. Example. Z > 2Z > 10Z > 30Z > {0} and Z > 3Z > 24Z > {0} are normal
series of Z. The refinements gained from the procedure in the above proof are here
(ignore repetitions)
(15.19) Z > 2Z > 10Z > 30Z > 120Z > {0} (with factors Z2 , Z5 , Z3 , Z4 , Z)
(15.20) Z > 3Z > 6Z > 24Z > 120Z > {0} (with factors Z3 , Z2 , Z4 , Z5 , Z).
15.8. Exercise. As in Example 15.7, work out the equivalent refinements of the nor-
mal series
(15.21) Z > 15Z > 60Z > {0}, Z > 12Z > {0},
15.12. Note that every finite group possesses a composition series, since the process
of refining the series G ≥ {e} must terminate after finitely many steps. On the other
hand, the infinite group (Z, +) is an example of a group that does not possess a
composition series.
15.13. Example.
(1) Consider the inner direct product G = N1 N2 · · · Nk of simple normal sub-
groups Ni . Then G = N1 N1 N2 · · · Nk > N2 · · · Nk > N3 · · · Nk > . . . > Nk > E
is a composition series with factors N1 , N2 , . . . , Nk .
(2) Z24 > Z8 > Z4 > Z2 > {0}, Z24 > Z12 > Z4 > Z2 > {0}, Z24 > Z12 > Z6 > Z2 >
{0} are composition series since its factors have prime order.
(3) Z4 > Z2 > {0} and Z2 × Z2 > Z2 > {0} have the same factors, Z2 . This illustrates
that non-isomorphic groups can have equivalent composition series.
15.15. Exercise. Show that every abelian group with a composition series is finite.
15.16. Exercise. Write down all possible composition series of Z24 with correspond-
ing factors.
62 COURSE NOTES
16.3. Since [a, b]−1 = [b, a], K(G) comprises all finite products of commutators.
Note however that a product of commutators is not necessarily a commutator! It
is evident that [a, b] = e if and only if a, b commute. Hence G is abelian if and only
if K(G) = {e}, and the larger K(G), the higher the degree of non-commutativity in G.
(16.4) xhx−1 = ϕx (h) = [ϕx (a1 ), ϕx (b1 )] · · · [ϕx (ar ), ϕx (br )].
Proof. G/N is abelian if and only if abN = aNbN = bNaN = baN for all a, b ∈ G.
This is equivalent to a−1 b−1 abN = N for all a, b ∈ G, i.e., [a−1 , b−1 ] ∈ N for all
a, b ∈ G. But this is the same as saying [a, b] ∈ N for all a, b ∈ G, i.e., K(G) ⊆ N
(since N is closed under multiplication).
16.8. Theorem.
(1) K(Sn ) = An if n ≥ 2.
(2) K(An ) = An if n ≥ 5.
Proof. (1) S2 is abelian and A2 = {(1)}, so the case n = 2 is proved. Assume n ≥ 3. We
have for 3-cycles
(16.5)
(i, j, k) = (i, k, j)2 = (i, k)(k, j)(i, k)(k, j) = (i, k)(k, j)(i, k)−1 (k, j)−1 = [(i, k), (k, j)]
and so all 3-cycles are in K(Sn ). Since the 3-cycles generate An (Theorem 14.27), we
have An ≤ K(Sn ). But since Sn /An ' {1, −1} is abelian (cf. 14.23), and, by Theorem
16.5, this implies K(Sn ) ≤ An .
(2) This follows directly from Theorem 14.30. We give a more elementary proof:
If (i, j, k) is a 3-cycle as above, and l, m ∈ N \ {i, j, k} (these exist since n ≥ 5) we
have (as above)
(16.6) (i, j, k) = (i, k, j)2 = [(i, k), (k, j)] = [(i, k)(l, m), (l, m)(k, j)]
since (l, m) commutes with (i, k) and (k, j). This shows (again by Theorem 14.27)
An ≤ K(An ), and thus An = K(An ).
= {[k1 , k2 ]N : k1 , k2 ∈ Kn (G)}
(since N is normal)
= {[k1 , k2 ] : k1 , k2 ∈ Kn (G)} N/N
16.14. Note that every abelian group is soluble, since K(G) = {e}. Hence soluble
groups may be viewed as a natural generalization of abelian groups. An example of
a non-abelian group that is soluble is S4 ; recall 16.10.
Proof. By Theorem 16.8, K(Sn ) = An and Km (Sn ) = Km−1 (An ) = An for all m ≥ 2. So
Km (Sn ) 6= {e} for all m ≥ 0.
16.16. Theorem.
(1) Every subgroup of a soluble group is soluble.
(2) Every quotient group of a soluble group is soluble.
(3) Every finite direct product of soluble groups is soluble.
Proof. Note that Km (G) = {e} implies via Theorem 16.11 that Km (H) = {e} for every
H ≤ G and Km (G/N) = {e} for every N E G.
16.17. Theorem. Let N E G such that N and G/N are soluble, then G is soluble.
Proof. Since G/N is soluble there is m ∈ N such that Km (G/N) = {N}. From Theorem
16.11 (2), Km (G)N = N, i.e., Km (G) ≤ N. Since N is soluble, Kl (N) = {e} for some l ∈
N. Now Kl+m (G) = Kl (Km (G)) ≤ Kl (N) (by Theorem 16.11 (1)) = {e}. So Kl+m (G) =
{e} and G is soluble.
is an abelian normal series, since Ki+1 (G) = K(Ki (G)) E Ki (G) (Theorem 16.4) and
Ki (G)/Ki+1 (G) are abelian groups (Corollary 16.6). We have in fact:
Proof. We have already seen that the series of commutator groups (16.9) yields the
required abelian normal series. For the inverse direction, we use induction on the
length of the series.
Length 1: If G = G1 ≥ G2 = {e} is an abelian normal series, then G ' G/{e} =
G1 /G2 is abelian (by definition), so G is abelian and hence soluble.
Length < n: The induction hypothesis is that all groups with abelian normal series
of length < n are soluble. Let
Proof. Let
(16.12) G = G1 ≥ G2 ≥ . . . ≥ Gr = {e}
Then H/Gi+1 is abelian since it is a subgroup of the abelian group Gi /Gi+1 . By the
second isomorphism theorem Gi /H is isomorphic to (Gi /Gi+1 )/(H/Gi+1 ) which is
abelian, and therefore Gi /H is abelian. A general refinement of (16.12) is obtained by
iterating the above process finitely many times.
16.21. Theorem. Let G be a group with composition series. G is soluble, if and only
if the composition factors of G have prime order.
Proof. If G is soluble, then Theorem 16.19 guarantees the existence of an abelian nor-
mal series. We use Schreier’s Theorem to show that the composition series and the
abelian normal series can both be refined, so that they become equivalent normal
series. These are abelian by Lemma 16.20. But since a refinement of a composition
series is only achieved by repetition, the composition series itself is already abelian.
Hence the composition factors are simple abelian groups, and are therefore cyclic
and have prime order.
Proof. We have already noted in 15.12 that every finite group has a composition se-
ries. If on the other hand G possesses the composition series
(16.14) G = G1 ≥ G2 ≥ . . . ≥ Gm = {e},
then, by Theorem 16.21 we have |Gi | = |Gi /Gi+1 | |Gi+1 | = pi |Gi+1 | for some prime pi
(1 ≤ i < m). Hence |G| = p1 |G2 | = p1 p2 |G3 | = . . . = p1 p2 · · · pm−1 < ∞.
66 COURSE NOTES
16.24. Feit-Thomson Theorem (1963). Every finite group of odd order is soluble.
Exercise 1.4.
(1) Note that if a 0 a = e (as in the inverse axiom) then (aa 0 )(aa 0 ) = a(a 0 a)a 0 =
aa 0 , and by Lemma 1.3 aa 0 = e.
(2) We have a = ea (identity axiom) = aa 0 a (as shown in (1)) = ae (inverse
axiom).
(3) Suppose there are two identities, e, ẽ. Then ea = ae = a = ẽa = aẽ for all
a ∈ G (by the identity axiom and (2)). In particular for a = e: e = ẽe, and for
a = ẽ: ẽe = ẽ. Hence ẽ = e.
(4) Suppose there are two inverses a 0 , ã 0 of a, i.e., a 0 a = ã 0 a = e. This implies
a 0 aa 0 = ã 0 aa 0 ⇒ a 0 e = ã 0 e (by (3)) ⇒ a 0 = ã 0 .
(5) By definition, (a−1 )−1 a−1 = e ⇒ (a−1 )−1 a−1 a = ea ⇒ (a−1 )−1 e = a ⇒
(a−1 )−1 = a.
(6) By definition, (ab)−1 (ab) = e ⇒ (ab)−1 (ab)b−1 = eb−1 ⇒ (ab)−1 a = b−1 ⇒
(ab)−1 aa−1 = b−1 a−1 ⇒ (ab)−1 = b−1 a−1 .
Exercise 1.15. The symmetries of an n-gon are reflections σ0 , . . . , σn−1 at the n di-
agonals (which are lines through the origin that meet the horizontal axis at angles
πm/n, m = 0, . . . , n − 1 mod n) and rotations ρm by an angle 2πm/n, m = 0, . . . , n −
1 mod n.
Existence of identity and inverse: m = 0 corresponds to the identity element. The
inverse of a reflection is the reflection itself, σ−1 = σ, and the inverse of the rotation
by 2πm/n is −2πm/n, i.e., ρ−1 m = ρn−m .
Closure under multiplication: The product of two rotations 2πm/n, 2πm 0 /n is evi-
dently a rotation by 2π(m + m 0 )/n, i.e., ρm ρm 0 = ρm+m 0 . Any reflection σm can be
written as σm = ρm/2 σ0 ρ−1m/2 . Note that for any rotation about the origin by and an-
gle α, we have ρα σ0 = σ0 ρ−1 α . This an the previous relation yields σm = ρm σ0 , and
σm σm 0 = ρm σ0 ρm 0 σ0 = ρm−m 0 σ0 σ0 = ρm−m 0 . Hence the product of two reflections is a
rotation. Similarly ρm σm 0 = ρm+m 0 σ0 = σm + m 0 and σm ρm 0 = ρm−m 0 σ0 = σm − m 0 ,
so the product of a reflection and rotation are a reflection.
Exercise 1.16. Assume K is a finite field with q elements. Let M ∈ Kn×n and consider
the system of equations Mx = 0 with x ∈ K. We know from linear algebra that x = 0
is the unique solution of Mx = 0, if and only if det M 6= 0. So if det M 6= 0, the
column vectors of M must be linearly independent over K, i.e., form a basis of the
vector space Kn . In other words, the order of GL(n, K) is the number of different
68 COURSE NOTES
bases of Kn . To see how many there are, note that there are qn − 1 choice of the first
basis vector (anything but the zero vector), qn − q (anything but a multiple of the
previously chosen vector), qn − q2 (anything but a linear combination of the previous
two), . . . , qn −qn−1 (anything but a linear combination of the previous (n−1) choices).
Hence the total is
Yn Y
n Y
n Y
n
(17.1) (qn − qj−1 ) = qj−1 (qn−j+1 − 1) = qn(n−1)/2 (qj − 1).
j=1 j=1 j=1 j=1
GROUP THEORY (MATH 33300) 69
Exercise 2.7.
(1) Clearly none of the maps is surjective, since both miss a good part of T . Since
! ! ! !
1 t 1 u 1 t−u 1 0
(17.2) = ⇔ = ⇔ t = u,
0 1 0 1 0 1 0 1
ϕ1 is injective, and hence a monomorphism. The analogous argument shows
ϕ2 is a monomorphism.
(2) Since ϕ3 (t) = ϕ3 (t + 2π), the map is not injective. But since for every x, y ∈ R
with x2 + y2 = 1 we find a t ∈ R such that x = cos(t), y = sin(t), the map is
surjective. Hence ϕ3 is an epimorphism.
Exercise 2.22. Recall that the elements of the Klein four group satisfy a2 = b2 =
c2 = e (and hence every element equals its inverse), ab = ba = c, bc = cb = a,
ca = ac = b. Besides the trivial automorphism ϕ0 = id we find the following:
Exercise 2.23. Clear—recall the relations between rotations and reflections discussed
in Exercise 1.15.
70 COURSE NOTES
Exercise 2.24.
(1) Clear.
(2) ker ϕ = {m ∈ Z : ζm = 1} = nZ.
Exercise 2.25.
(1) If Aut G = {id} then ϕg = id for all g ∈ G, and hence ϕg (a) = gag−1 = a, i.e.,
ag = ga for all a, g ∈ G. (Alternatively, note that Aut G = {id} implies that
Z(G) := ker Φ = G, which also says that G is abelian.)
(2) If x → x2 is a homomorphism, then (ab)2 = a2 b2 ⇒ abab = aabb ⇒ ba =
ab.
(3) If x → x−1 is a homomorphism, then (ab)−1 = a−1 b−1 ⇒ b−1 a−1 = a−1 b−1 .
Hence all inverses commute, and so all elements commute.
Exercise 4.6.
(1) Since 0 is the neutral element of R and {0} ≤ h(0, ]i by definition, we may
assume x ∈ R \ {0}. Choose n ∈ Z such that x0 := x/n ∈ (0, ] (this is always
possible by the Archimedian principle). Hence x = nx0 with x0 ∈ (0, ] and
the claim is proved.
(2) The set S = { q1 : q ∈ N} generates Q, since every x ∈ Q can be expressed as
x = n q1 for n ∈ Z, q ∈ N.
Exercise 4.7. The relations given in the hint follow from direct computation. They!
1 x
imply that every g ∈ SL(2, R) can be represented as a product of the matrices
0 1
!
0 −1
and . The claim now follows from Theorem 4.3.
1 0
GROUP THEORY (MATH 33300) 71
Exercise 5.12.
(1) For element of an abelian group (ab)r = ar br . Hence, if ord a = m and ordb =
n, then ord ab ≤ mn. That is, every product of finite-order elements has finite
order. Since the inverse of a group element has the same order the first claim
is proved.
A counter example for the case of a non-abelian group is the following.
Consider the group of maps R → R generated by the reflections R0 : x 7→ −x
(reflection at x = 0) and R1 : x 7→ 1 − x (reflection at x = 1/2). We have R20 =
id = R21 , i.e., both elements have order 2. However, R1 ◦R0 (x) = R1 (−x) = 1+x,
i.e., T1 = R1 ◦ R0 : x 7→ x + 1 is a translation by 1. Clearly T n 6= id for any
n ∈ Z \ {0}, and therefore T1 has infinite order. !
0 −1
A second counter example is given by the following matrices: S =
1 0
!
1 −1
and T = satisfy the relations S2 = −e and T 3 = −e, and have there-
1 0
!
1 1
fore order 4 and 6, respectively. For the product, TS = − , which has
0 1
!
1 n
infinite order since (TS)n = (−1)n 6= e for any n ∈ Z \ {0}.
0 1
(2) We have (ab)2 = e, and hence ab = b−1 a−1 . But since a2 = e, b2 = e, we have
a−1 = a and b−1 = b, so ab = ba and the claim follows.
(3) Suppose a is the only element in G of order 2. Given g ∈ G, et b = gag−1 .
Then 6= e and b2 = gag−1 gag−1 = ga2 g−1 = e. Hence b has order 2 and thus
by assumption a = b. So a = gag−1 , i.e., ag = ga for all g ∈ G.
Exercise 5.13.
(1) ϕ(a)s = ϕ(as ) since ϕ is a homomorphism. Because it is an automorphism
ϕ(as ) = e if and only if as = e. Since the order of an element g is either infinite
or the smallest integer s > 0 such that gs = e, the claim is proved.
(2) Apply (1) with the inner automorphism ϕ = ϕb .
(3) Let a, c ∈ G. Applying (2) with the choice b = ca yields ord ac = ord aba−1 =
ord b = ord ca which proves the claim.
(4) We have as = e if and only if (a−1 )s = e. Since the order of an element g
is either infinite or the smallest integer s > 0 such that gs = e, the claim is
proved.
Exercise 5.14.
(1) Every g ∈ G = hai is of the form g = ak , 0 ≤ k ≤ n − 1. Hence ϕ(a) = ak
for some k in the above range. By Exercise 5.13 (1), ord ak = ord a = n, and
72 COURSE NOTES
Exercise 6.13. By Corollary 6.12, s = ord a divides |G|, i.e., |G| ∈ sZ. Hence Corollary
5.7 implies a|G| = e.
Exercise 6.26.
(1) We have Z∗15 = {1, 2, 4, 7, 8, 11, 13, 14} and hence |Z∗15 | = ϕ(15) = 8. Further-
more h7i = {1, 4, 7, 13} since
2
(a) 7 = 49 = 4,
3
(b) 7 = 4 · 7 = 28 = 13,
4
(c) 7 = 13 · 7 = −2 · 7 = −14 = 1.
By Lagrange’s Theorem, |Z∗15 : h7i| = 8/4 = 2, and so we have two left cosets
Z∗15 = h7i ∩ 2h7i. [Instead of 2 any element not in h7i can be used.]
350 352 −2 −2
(2) 7 = 7 7 = 7 (since 352 = 8 · 44, apply Fermat’s little theorem with
2 2
|G| = 8) = 13 = (−2) = 4.
1000
2 = 1 since 1000 = 8 · 125 and by Fermat’s little theorem.
GROUP THEORY (MATH 33300) 73
Exercise 7.4.
(1) Since H, K are normal in G, we have HK = KH and hence HK is a subgroup of
G (Theorem 3.11). To show HK is normal, note that for any g ∈ G: gHKg−1 =
gHg−1 gKg−1 ⊆ HK, since by normality of H, K we have gHg−1 ⊆ H, gKg−1 ⊆
K.
(2) Set N = x∈G xHx−1 . This means that if a ∈ N we have that a ∈ xHx−1 for all
T
Exercise 7.9.
(1) Suppose a, b ∈ NG (X), i.e., aX = Xa, bX = Xb. Then Xa−1 = a−1 X and so
a−1 ∈ NG (X). Furthermore, abX = aXb = Xab and thus ab ∈ NG (X).
(2) If H E G then by definition aHa−1 ⊆ H for all a ∈ G. Since this implies that
H ⊆ a−1 Ha, we have in fact H ⊆ aHa−1 for all a ∈ G and hence aH = Ha for
all a ∈ G. Therefore NG (H) = G.
If on the other hand NG (H) = G, we have xH = Hx for all x ∈ G and hence
xHx−1 ⊆ H for all x ∈ G. Hence H E G.
(3) We have for all g ∈ NG (H): gHg−1 = (gH)g−1 = (Hg)g−1 = H, and so
H E NG (H).
(4) Problem (2) says that K E H implies NH (K) = H. The statement follows from
the observation that NH (K) = {h ∈ H : hK = Kh} ⊆ NG (K).
Exercise 8.8. The idea of proof is similar as in Lagrange’s theorem. Consider the
union
[
(17.9) HK = hK.
h∈H
Exercise 9.10.
(1) The normal subgroup property implies that bab−1 ∈ Ni and aba−1 ∈ Nj .
Hence for i 6= j we have
Y
(17.10) aba−1 b−1 ∈ Ni Ni ∩ Nj Nj = Ni ∩ Nj ⊆ Ni ∩ Nj = {e},
j6=i
and hence ai = e for every i. As to the general case, suppose we have two
decompositions a = a1 · · · ak and a = b1 · · · bk , then, using again (1), we see
that (a1 b−1 −1
1 ) · · · (ak bk ) = e, which, in view of the special case considered
before, implies that ai b−1 i = e, i.e., ai = bi .
Exercise 9.17. Theorem 8.5 shows that G is cyclic if and only if G ' Zn with n =
pk1 1 . . . pkr r . Using Theorem 9.16, we have Zn = Zpk1 ···pkr−1 × Zpkr r . Hence, by induction
1 r−1
on r, Zn = Zpk1 × · · · × Zpkr r .
1
Exercise 9.22.
(1) (We have already proved this; cf. Corollary 6.19.) The group L = H ∩ K is a
subgroup of both H and K. Hence, by Lagrange’s Theorem, |L| divides both
|H| and |K|. But since the latter a coprime, the only possibility is |L| = 1 and
hence L = {e}. (Note: We have not used the fact that H, K are normal.)
(2) Since H E G we have gH = Hg for all g ∈ G. Hence in particular (for g ∈ K) we
have HK = KH, and hence G 0 := HK is a group (by Theorem 3.11); note that
this fact was already proved in Exercise 7.4. Part (1) of the present exercise
shows that G 0 is an inner direct product of H and K, and so, by Theorem 9.9,
hk = kh for all h ∈ H, k ∈ K.
(3) We have shown in (2) that HK is an inner direct product. By Theorem 9.12 this
inner direct product is isomorphic to the outer direct product H × K.
GROUP THEORY (MATH 33300) 75
Exercise 10.8.
Exercise 10.12.
Exercise 10.13.
! !
r r cos φ
(1) The orbits are H · = : φ ∈ [0, 2π) for r ≥ 0, i.e., the origin
0 r sin φ
{0} (r = 0) and all circles of radius r > 0 centered at the origin. 0 is thus the
only fixed point. ! !
cos φ a cos φ
(2) The orbits are H · 0 = {0}, and the rays H · = : a ∈ R>0
sin φ a sin φ
for φ ∈ [0, 2π). 0 is therefore again ! theonly fixed
! point.
r ra
(3) The orbits are H · 0 = {0}, H · = : a ∈ R>0 for r ∈ R \ {0} (i.e.,
r ra−1
the branches of hyperbolas satisfying the equation xy = r2 , where r values
with the!same modulus ! but opposite
sign correspond to different orbits) and
r ra
H· = : a ∈ R>0 for r ∈ R \ {0} (the branches of hyperbolas
−r −ra−1
satisfying the equation xy = −r2 ). 0 is the only fixed point.
76 COURSE NOTES
! !
r r
(4) The orbits are the one-element sets H · = for r ∈ R, and the
0 0
! !
0 x
straight lines H · = : x ∈ R for r ∈ R \ {0}. Hence FixH (R2 ) =
r r
!
r
:r∈R .
0
! !
1 0 0 −1
(5) We have H = ± ,± . The H action yields π/2 rotations in
0 1 1 0
! ! !
x x y
R2 about the origin. The orbits are H · 0 = {0}, H · = ± ,± ,
y y −x
which are disjoint for x > 0, y ≥ 0, say. 0 is the only fixed point.
Exercise 10.22.
(1) We have (gh)(aH) = g(haH) by the associativity of group composition, and
e(aH) = aH by the identity axiom.
(2) Let x = aH, y = bH ∈ X = G/H. Then g = ba−1 ∈ G satisfies g · x =
(ba−1 )(aH) = bH = y.
GROUP THEORY (MATH 33300) 77
Exercise 12.11.
(1) By the Third Sylow Theorem s2 divides 12 and is of the form 2k + 1 for some
k ≥ 0. Hence s2 ∈ {1, 3}. Similarly, s3 divides 12 and is of the form 3k + 1 for
some k ≥ 0. Hence s3 ∈ {1, 4}.
(2) Suppose s3 = 4, i.e., there are four distinct 3-Sylow groups P1 , P2 , P3 , P4 of G,
each with 3 elements. Then for i 6= j, Pi ∩ Pj < Pi and thus |Pi ∩ Pj | < 3. Hence
|Pi ∩ Pj | = 1 (since 2 does not divide 3) and so Pi ∩ Pj = {e}. Therefore G has 8
elements of order 3 (2 from each Pi ), and the identity.
The set S of three remaining elements in G is the set of elements which
order is not equal to 3. This follows from the fact that if ord g = 3, then hgi
is a 3-Sylow group and hence is equal to one of P1 , P2 , P3 , P4 . So G has only 8
elements of order 3. Thus
4
[
Pi = {g ∈ G : ord g = 3} ∪ {e}
i=1
and hence
4
[
S := G \ Pi = {g ∈ G : g 6= e, ord g 6= 3}.
i=1
We note that every 2-Sylow group in G (which has order 12) has order 4. Since
4 and 3 are coprime, it is clear that every 2-Sylow group has a trivial intersec-
tion with any Pi and is therefore contained in S ∪ {e}. But |S ∪ {e}| = 4. This
implies that S ∪ {e} is a 2-Sylow group (in particular a group). Moreover, any
2-Sylow group is equal to S ∪ {e}. Hence, there can be only one 2-Sylow group.
(3) Since there is a unique 2-Sylow group P2 and a unique 3-Sylow group P3 , by
Corollary 11.13 both are normal in G. Now P2 ∩ P3 < P3 and so, by the same
argument as in (2), P2 ∩ P3 = {e}. Therefore, and since |P2 | = 4, |P3 | = 3, we
have |P2 P3 | = 12 and thus G = P2 P3 . G is hence an inner direct product of
P2 and P3 . By 12.1 P3 ' Z3 , and by Theorem 12.2 P2 ' Z4 or ' Z2 × Z2 . We
conclude
(17.13) G = {e, b, b2 , b3 , a2 , a2 b, a2 b2 , a2 b3 }.
Exercise 13.7. Since G is finitely generated, it is by Theorem 13.6 the direct product
of finitely many cyclic groups ha1 i × · · · × har i. If G is infinite then at least one of
these, say ha1 i, must be infinite. This in turn implies that G contains an element of
infinite order, namely (a1 , e, e, . . . , e), contradicting our assumption.
Exercise 14.2. It is well known that the composition of two bijective maps is bijective.
The composition of maps is furthermore associative. The existence of the identity and
inverse is evident.
Exercise 14.31.
Exercise 14.32. Use Theorem 14.9 (7), i.e., π(i1 , . . . , lr )π−1 = (π(i1 ), . . . , π(ir )).
(1) π(2, 3)(1, 4)π−1 = π(2, 3)π−1 π(1, 4)π−1 = (1, 3)(2, 4).
(2) π = (2, 3, 4), so π(1, 2, 3)π−1 = (1, 3, 4).
(3) π(1, 2, 3, 4, 5)π−1 = (1, 3)(2, 4, 1)(1, 2, 3, 4, 5)(2, 4, 1)−1 (1, 3)−1 = (1, 3)(2, 4, 3, 1, 5)(1, 3)−1 =
(2, 4, 1, 3, 5).
(4) π(1, 2, 3, 4, 5)π−1 = (1, 2, 3)(1, 2, 3, 4, 5)(1, 2, 3)−1 = (2, 3, 1, 4, 5).
!
1 2 ··· r
Exercise 14.33. For f = we have by Theorem 14.9 (7): f(1, 2, . . . , r)f−1 =
i1 i2 · · · ir
(i1 , i2 , . . . , ir ). Hence the r-cycle (i1 , i2 , . . . , ir ) is conjugate to (1, 2, . . . , r), and so all
r-cycles are conjugate.
Exercise 14.34. As shown in 14.13, any transposition can be written as (i, j) = (1, i)(1, j)(1, i).
Since Sn is generated by transpositions (Corollary 14.12), it is also generated by the
transpositions (1, i), i = 2, . . . , n.
GROUP THEORY (MATH 33300) 81
(17.19) Z > 3Z > 15Z > 60Z > {0} (with factors Z3 , Z5 , Z4 , Z)
(17.20) Z > 3Z > 12Z > 60Z > {0} (with factors Z3 , Z4 , Z5 , Z).
Exercise 15.16. Recall that very subgroup of a cyclic group is cyclic. So the subgroups
of Z24 are of the form mZ24 ' Z24/m for every integer m that divides 24. The factors of
any normal series of Z24 are thus Z24/m /Z24/n ' Zn/m where m, n|24 and m|n. Zn/m is
simple if and only if n/m is a prime. The following are therefore composition series
82 COURSE NOTES
of Z24 :
Z24 > Z8 > Z4 > Z2 > {0} with factors Z3 , Z2 , Z2 , Z2 ;
Z24 > Z12 > Z4 > Z2 > {0} with factors Z2 , Z3 , Z2 , Z2 ;
(17.21)
Z24 > Z12 > Z6 > Z2 > {0} with factors Z2 , Z2 , Z3 , Z2 ;
Z24 > Z12 > Z6 > Z3 > {0} with factors Z2 , Z2 , Z2 , Z3 .
The Jordan-Hölder Theorem implies (in view of the above factors) that these are in
fact all composition series.