J.S. Milne
S
3
r =
_
1 2 3
2 3 1
_
=
_
1 2 3
1 3 2
_
Version 3.12
April 9, 2012
The rst version of these notes was written for a rstyear graduate algebra course. As in
most such courses, the notes concentrated on abstract groups and, in particular, on nite
groups. However, it is not as abstract groups that most mathematicians encounter groups,
but rather as algebraic groups, topological groups, or Lie groups, and it is not just the groups
themselves that are of interest, but also their linear representations. It is my intention (one
day) to expand the notes to take account of this, and to produce a volume that, while still
modest in size (c200 pages), will provide a more comprehensive introduction to group
theory for beginning graduate students in mathematics, physics, and related elds.
BibTeX information
@misc{milneGT,
author={Milne, James S.},
title={Group Theory (v3.12)},
year={2012},
note={Available at www.jmilne.org/math/},
pages={133}
}
Please send comments and corrections to me at the address on my website www.jmilne.
org/math/.
v2.01 (August 21, 1996). First version on the web; 57 pages.
v2.11 (August 29, 2003). Fixed many minor errors; numbering unchanged; 85 pages.
v3.00 (September 1, 2007). Revised and expanded; 121 pages.
v3.01 (May 17, 2008). Minor xes and changes; 124 pages.
v3.02 (September 21, 2009). Minor xes; changed TeX styles; 127 pages.
v3.10 (September 24, 2010). Many minor improvements; 131 pages.
v3.11 (March 28, 2011). Minor additions; 135 pages.
v3.12 (April 9, 2012). Minor xes; 133 pages.
The multiplication table of S
3
on the front page was produced by Group Explorer.
Copyright c _1996, 2002, 2003, 2007, 2008, 2010, 2011, 2012 J.S. Milne.
Single paper copies for noncommercial personal use may be made without explicit permis
sion from the copyright holder.
Contents
Contents 3
1 Basic Denitions and Results 7
Denitions and examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
Multiplication tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
Subgroups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
Groups of small order . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
Homomorphisms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
Cosets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
Normal subgroups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
Kernels and quotients . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
Theorems concerning homomorphisms . . . . . . . . . . . . . . . . . . . . . . . 21
Direct products . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
Commutative groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
The order of ab . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
2 Free Groups and Presentations; Coxeter Groups 31
Free monoids . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
Free groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
Generators and relations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
Finitely presented groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
Coxeter groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38
Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
3 Automorphisms and Extensions 43
Automorphisms of groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43
Characteristic subgroups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
Semidirect products . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46
Extensions of groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50
The H older program. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52
Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
4 Groups Acting on Sets 57
Denition and examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57
Permutation groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64
The ToddCoxeter algorithm. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70
Primitive actions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71
Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
5 The Sylow Theorems; Applications 77
3
The Sylow theorems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77
Alternative approach to the Sylow theorems . . . . . . . . . . . . . . . . . . . . 81
Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 84
6 Subnormal Series; Solvable and Nilpotent Groups 85
Subnormal Series. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85
Solvable groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87
Nilpotent groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 90
Groups with operators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 94
KrullSchmidt theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95
Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 96
7 Representations of Finite Groups 97
Matrix representations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97
Roots of 1 in elds . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98
Linear representations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98
Maschkes theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99
The group algebra; semisimplicity . . . . . . . . . . . . . . . . . . . . . . . . . 101
Semisimple modules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102
Simple Jalgebras and their modules . . . . . . . . . . . . . . . . . . . . . . . . 103
Semisimple Jalgebras and their modules . . . . . . . . . . . . . . . . . . . . . 107
The representations of G . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109
The characters of G . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 110
The character table of a group . . . . . . . . . . . . . . . . . . . . . . . . . . . 113
Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113
Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113
A Additional Exercises 115
B Solutions to the Exercises 119
C TwoHour Examination 127
Bibliography 129
Index 131
4
NOTATIONS.
We use the standard (Bourbaki) notations: N = {0. 1. 2. . . .]; Z is the ring of integers;
is the eld of rational numbers; 1 is the eld of real numbers; C is the eld of complex
numbers; F
q
is a nite eld with q elements where q is a power of a prime number. In
particular, F
]
=Z,Z for a prime number.
For integers m and n, m[n means that m divides n, i.e., n mZ. Throughout the notes,
is a prime number, i.e., =2. 3. 5. 7. 11. . . . . 1000000007. . . ..
Given an equivalence relation, + denotes the equivalence class containing +. The
empty set is denoted by 0. The cardinality of a set S is denoted by [S[ (so [S[ is the number
of elements in S when S is nite). Let 1 and be sets; a family of elements of indexed
by 1, denoted (a
i
)
iJ
, is a function i a
i
: 1 .
1
Rings are required to have an identity element 1, and homomorphisms of rings are
required to take 1 to 1. An element a of a ring is a unit if it has an inverse (element b such
that ab =1 =ba). The identity element of a ring is required to act as 1 on a module over
the ring.
X Y X is a subset of Y (not necessarily proper);
X
def
=Y X is dened to be Y , or equals Y by denition;
X ~Y X is isomorphic to Y ;
X .Y X and Y are canonically isomorphic (or there is a given or unique isomorphism);
PREREQUISITES
An undergraduate abstract algebra course.
COMPUTER ALGEBRA PROGRAMS
GAP is an open source computer algebra program, emphasizing computational group the
ory. To get started with GAP, I recommend going to Alexander Hulpkes page http://
www.math.colostate.edu/
~
hulpke/CGT/education.html where you will nd ver
sions of GAP for both Windows and Macs and a guide Abstract Algebra in GAP. The
Sage page http://www.sagemath.org/ provides a front end for GAP and other pro
grams. I also recommend N. Carters Group Explorer http://groupexplorer.sourceforge.
net for exploring the structure of groups of small order. Earlier versions of these notes
(v3.02) described how to use Maple for computations in group theory.
ACKNOWLEDGEMENTS
I thank the following for providing corrections and comments for earlier versions of these
notes: V.V. Acharya; Tony Bruguier; Dustin Clausen; Benot Claudon; Keith Conrad;
Demetres Christodes; Adam Glesser; Sylvan Jacques; Martin Klazar; Mark Meckes; Vic
tor Petrov; Efthymios Sofos; Dave Simpson; Robert Thompson; Bhupendra Nath Tiwari;
Leandro Vendramin; Michiel Vermeulen.
Also, I have beneted from the posts to mathoverow by Richard Borcherds, Robin
Chapman, Steve Dalton, Leonid Positselski, Noah Snyder, Richard Stanley, Qiaochu Yuan,
and others (a reference monnnn means http://mathoverflow.net/questions/nnnn/).
1
A family should be distinguished from a set. For example, if is the function Z Z,3Z sending an
integer to its equivalence class, then {(i ) [ i Z] is a set with three elements whereas ((i ))
iZ
is family
with an innite index set.
5
The theory of groups of nite order may be said to date from the time of Cauchy. To
him are due the rst attempts at classication with a view to forming a theory from a
number of isolated facts. Galois introduced into the theory the exceedingly important
idea of a [normal] subgroup, and the corresponding division of groups into simple
and composite. Moreover, by shewing that to every equation of nite degree there
corresponds a group of nite order on which all the properties of the equation depend,
Galois indicated how far reaching the applications of the theory might be, and thereby
contributed greatly, if indirectly, to its subsequent developement.
Many additions were made, mainly by French mathematicians, during the middle
part of the [nineteenth] century. The rst connected exposition of the theory was given
in the third edition of M. Serrets Cours dAlg` ebre Sup erieure, which was published
in 1866. This was followed in 1870 by M. Jordans Trait e des substitutions et des
equations alg ebriques. The greater part of M. Jordans treatise is devoted to a devel
opement of the ideas of Galois and to their application to the theory of equations.
No considerable progress in the theory, as apart from its applications, was made
till the appearance in 1872 of Herr Sylows memoir Th eor` emes sur les groupes de
substitutions in the fth volume of the Mathematische Annalen. Since the date of this
memoir, but more especially in recent years, the theory has advanced continuously.
W. Burnside, Theory of Groups of Finite Order, 1897.
Galois introduced the concept of a normal subgroup in 1832, and Camille Jordan in the
preface to his Trait e. . . in 1870 agged Galois distinction between groupes simples
and groupes compos ees as the most important dichotomy in the theory of permutation
groups. Moreover, in the Trait e, Jordan began building a database of nite simple
groups the alternating groups of degree at least 5 and most of the classical pro
jective linear groups over elds of prime cardinality. Finally, in 1872, Ludwig Sylow
published his famous theorems on subgroups of prime power order.
R. Solomon, Bull. Amer. Math. Soc., 2001.
Why are the nite simple groups classiable?
It is unlikely that there is any easy reason why a classication is possible, unless some
one comes up with a completely new way to classify groups. One problem, at least
with the current methods of classication via centralizers of involutions, is that every
simple group has to be tested to see if it leads to new simple groups containing it in
the centralizer of an involution. For example, when the baby monster was discovered,
it had a double cover, which was a potential centralizer of an involution in a larger
simple group, which turned out to be the monster. The monster happens to have no
double cover so the process stopped there, but without checking every nite simple
group there seems no obvious reason why one cannot have an innite chain of larger
and larger sporadic groups, each of which has a double cover that is a centralizer of
an involution in the next one. Because of this problem (among others), it was unclear
until quite late in the classication whether there would be a nite or innite number
of sporadic groups.
Richard Borcherds, mo38161.
CHAPTER 1
Basic Denitions and Results
The axioms for a group are short and natural. . . .
Yet somehow hidden behind these axioms is the
monster simple group, a huge and extraordinary
mathematical object, which appears to rely on nu
merous bizarre coincidences to exist. The axioms
for groups give no obvious hint that anything like
this exists.
Richard Borcherds, in Mathematicians 2009.
Group theory is the study of symmetries.
Denitions and examples
DEFINITION 1.1 A group is a set G together with a binary operation
(a. b) a+b: GG G
satisfying the following conditions:
G1: (associativity) for all a. b. c G,
(a+b) +c =a+(b +c):
G2: (existence of a neutral element) there exists an element e G such that
a+e =a =e +a (1)
for all a G;
G3: (existence of inverses) for each a G, there exists an a
t
G such that
a+a
t
=e =a
t
+a.
We usually abbreviate (G. +) to G. Also, we usually write ab for a + b and 1 for e; al
ternatively, we write a b for a +b and 0 for e. In the rst case, the group is said to be
multiplicative, and in the second, it is said to be additive.
1.2 In the following, a. b. . . . are elements of a group G.
7
8 1. BASIC DEFINITIONS AND RESULTS
(a) An element e satisfying (1) is called a neutral element. If e
t
is a second such element,
then e
t
=e +e
t
=e. In fact, e is the unique element of G such that e +e =e (apply
G3).
(b) If b +a =e and a+c =e, then
b =b +e =b +(a+c) =(b +a) +c =e +c =c.
Hence the element a
t
in (G3) is uniquely determined by a. We call it the inverse of
a, and denote it a
1
(or the negative of a, and denote it a).
(c) Note that (G1) shows that the product of any ordered triple a
1
, a
2
, a
3
of elements of
G is unambiguously dened: whether we form a
1
a
2
rst and then (a
1
a
2
)a
3
, or a
2
a
3
rst and then a
1
(a
2
a
3
), the result is the same. In fact, (G1) implies that the product
of any ordered ntuple a
1
, a
2
,. . . , a
n
of elements of G is unambiguously dened. We
prove this by induction on n. In one multiplication, we might end up with
(a
1
a
i
)(a
i1
a
n
) (2)
as the nal product, whereas in another we might end up with
(a
1
a
}
)(a
}1
a
n
). (3)
Note that the expression within each pair of parentheses is well dened because of
the induction hypotheses. Thus, if i = , (2) equals (3). If i = , we may suppose
i < . Then
(a
1
a
i
)(a
i1
a
n
) =(a
1
a
i
)
_
(a
i1
a
}
)(a
}1
a
n
)
_
(a
1
a
}
)(a
}1
a
n
) =
_
(a
1
a
i
)(a
i1
a
}
)
_
(a
}1
a
n
)
and the expressions on the right are equal because of (G1).
(d) The inverse of a
1
a
2
a
n
is a
1
n
a
1
n1
a
1
1
, i.e., the inverse of a product is the
product of the inverses in the reverse order.
(e) (G3) implies that the cancellation laws hold in groups,
ab =ac == b =c. ba =ca == b =c
(multiply on left or right by a
1
). Conversely, if G is nite, then the cancellation laws
imply (G3): the map . a.: G G is injective, and hence (by counting) bijective;
in particular, e is in the image, and so a has a right inverse; similarly, it has a left
inverse, and the argument in (b) above shows that the two inverses are equal.
Two groups (G. +) and (G
t
. +
t
) are isomorphic if there exists a onetoone correspon
dence a a
t
, G G
t
, such that (a+b)
t
=a
t
+
t
b
t
for all a. b G.
The order [G[ of a group G is its cardinality. A nite group whose order is a power of
a prime is called a group.
For an element a of a group G, dene
a
n
=
_
_
_
aa a n > 0 (n copies of a)
e n =0
a
1
a
1
a
1
n < 0 ([n[ copies of a
1
)
Denitions and examples 9
The usual rules hold:
a
n
a
n
=a
nn
. (a
n
)
n
=a
nn
. all m. n Z. (4)
It follows from (4) that the set
{n Z [ a
n
=e]
is an ideal in Z, and so equals mZ for some integer m _ 0. When m = 0, a
n
= e unless
n =0, and a is said to have innite order. When m =0, it is the smallest integer m > 0
such that a
n
=e, and a is said to have nite order m. In this case, a
1
=a
n1
, and
a
n
=e m[n.
EXAMPLES
1.3 Let C
o
be the group (Z. ), and, for an integer m_1, let C
n
be the group (Z,mZ. ).
1.4 Permutation groups. Let S be a set and let Sym(S) be the set of bijections : S S.
We dene the product of two elements of Sym(S) to be their composite:
= .
In other words, ()(s) =((s)) for all s S. For any . . ; Sym(S) and s S,
(( ) ;)(s) =( )(;(s)) =((;(s))) =( (;))(s). (5)
and so associativity holds. The identity map s s is an identity element for Sym(S),
and inverses exist because we required the elements of Sym(S) to be bijections. Therefore
Sym(S) is a group, called the group of symmetries of S. For example, the permutation
group on n letters S
n
is dened to be the group of symmetries of the set {1. .... n] it has
order n.
1.5 When G and H are groups, we can construct a new group GH, called the (direct)
product of G and H. As a set, it is the cartesian product of G and H, and multiplication is
dened by
(g. h)(g
t
. h
t
) =(gg
t
. hh
t
).
1.6 A group G is commutative (or abelian)
1
if
ab =ba. all a. b G.
In a commutative group, the product of any nite (not necessarily ordered) family S of ele
ments is well dened, for example, the empty product is e. Usually, we write commutative
groups additively. With this notation, Equation (4) becomes:
mana =(mn)a. m(na) =mna.
When G is commutative,
m(ab) =mamb for m Z and a. b G,
1
Abelian group is more common than commutative group, but I prefer to use descriptive names where
possible.
10 1. BASIC DEFINITIONS AND RESULTS
and so the map
(m. a) ma: ZG G
makes into a Zmodule. In a commutative group G, the elements of nite order form a
subgroup G
tors
of G, called the torsion subgroup.
1.7 Let J be a eld. The nn matrices with coefcients in J and nonzero determinant
form a group GL
n
(J) called the general linear group of degree n. For a nite dimen
sional Jvector space V , the Jlinear automorphisms of V form a group GL(V ) called the
general linear group of V . Note that if V has dimension n, then the choice of a basis de
termines an isomorphism GL(V ) GL
n
(J) sending an automorphism to its matrix with
respect to the basis.
1.8 Let V be a nite dimensional vector space over a eld J. A bilinear form on V is a
mapping : V V J that is linear in each variable. An automorphism of such a is an
isomorphism : V V such that
(. n) =(. n) for all . n V. (6)
The automorphisms of form a group Aut(). Let e
1
. . . . . e
n
be a basis for V , and let
1 =((e
i
. e
}
))
1_i,}_n
be the matrix of . The choice of the basis identies Aut() with the group of invertible
matrices such that
2
T
1 =1. (7)
When is symmetric, i.e.,
(. n) =(n. ) all . n V.
and nondegenerate, Aut() is called the orthogonal group of .
When is skewsymmetric, i.e.,
(. n) =(n. ) all . n V.
and nondegenerate, Aut() is called the symplectic group of . In this case, there exists a
basis for V for which the matrix of is
J
2n
=
_
0 1
n
1
n
0
_
. 2m=n.
2
When we use the basis to identify V with J
n
, the pairing becomes
_
o
1
.
.
.
o
n
_
.
_
_
b
1
.
.
.
b
n
_
_
(a
1
. . . . . a
n
) 1
_
_
b
1
.
.
.
b
n
_
_
.
If is the matrix of with respect to the basis, then corresponds to the map
_
o
1
.
.
.
o
n
_
_
o
1
.
.
.
o
n
_
.Therefore,
(6) becomes the statement that
(a
1
. . . . . a
n
)
T
1
_
_
b
1
.
.
.
b
n
_
_
=(a
1
. . . . . a
n
) 1
_
_
b
1
.
.
.
b
n
_
_
for all
_
o
1
.
.
.
o
n
_
.
_
_
b
1
.
.
.
b
n
_
_
J
n
.
On examining this statement on the standard basis vectors for J
n
, we see that it is equivalent to (7).
Multiplication tables 11
and the group of invertible matrices such that
T
J
2n
=J
2n
is called the symplectic group Sp
2n
.
REMARK 1.9 A set S together with a binary operation (a. b) a b: S S S is called a
magma. When the binary operation is associative, (S. ) is called a semigroup. The product
def
=a
1
a
n
of any sequence =(a
i
)
1_i_n
of elements in a semigroup S is welldened (see 1.2(c)),
and for any pair and T of such sequences,
(
)(
T) =
(LT). (8)
Let 0 be the empty sequence, i.e., the sequence of elements in S indexed by the empty set.
What should
0)(
) =
(0L) =
(L0) =(
)(
0).
In other words,
0 should be a neutral element. A semigroup with a neutral element
is called a monoid. In a monoid, the product of any nite (possibly empty) sequence of
elements is welldened, and (8) holds.
ASIDE 1.10 (a) The group conditions (G2,G3) can be replaced by the following weaker conditions
(existence of a left neutral element and left inverses): (G2
t
) there exists an e such that e +a =a for
all a; (G3
t
) for each a G, there exists an a
t
G such that a
t
+a =e. To see that these imply (G2)
and (G3), let a G, and apply (G3
t
) to nd a
t
and a
tt
such that a
t
+a =e and a
tt
+a
t
=e. Then
a+a
t
=e +(a+a
t
) =(a
tt
+a
t
) +(a+a
t
) =a
tt
+
_
(a
t
+a) +a
t
_
=a
tt
+a
t
=e.
whence (G3), and
a =e +a =(a+a
t
) +a =a+(a
t
+a) =a+e.
whence (G2).
(b) A group can be dened to be a set G with a binary operation + satisfying the following
conditions: (g1) + is associative; (g2) G is nonempty; (g3) for each a G, there exists an a
t
G
such that a
t
+a is neutral. As there is at most one neutral element in a set with an associative binary
operation, these conditions obviously imply those in (a). They are minimal in the sense that there
exist sets with a binary operation satisfying any two of them but not the third. For example, (N. )
satises (g1) and (g2) but not (g3); the empty set satises (g1) and (g3) but not (g2); the set of 22
matrices with coefcents in a eld and with +T =T T satises (g2) and (g3) but not (g1).
Multiplication tables
A binary operation on a nite set can be described by its multiplication table:
e a b c . . .
e ee ea eb ec . . .
a ae a
2
ab ac . . .
b be ba b
2
bc . . .
c ce ca cb c
2
. . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
12 1. BASIC DEFINITIONS AND RESULTS
The element e is an identity element if and only if the rst row and column of the table
simply repeat the elements. Inverses exist if and only if each element occurs exactly once
in each row and in each column (see 1.2e). If there are n elements, then verifying the
associativity law requires checking n
3
equalities.
For the multiplication table of S
3
, see the front page. Note that each colour occurs
exactly once in each row and and each column.
This suggests an algorithm for nding all groups of a given nite order n, namely, list
all possible multiplication tables and check the axioms. Except for very small n, this is not
practical! The table has n
2
positions, and if we allow each position to hold any of the n
elements, then that gives a total of n
n
2
possible tables very few of which dene groups. For
example, there are 8
64
=6277101735386680763835789423207666416102355444464
034512896 binary operations on a set with 8 elements, but only ve isomorphism classes
of groups of order 8 (see 4.21).
Subgroups
PROPOSITION 1.11 Let S be a nonempty subset of a group G. If
S1: a. b S == ab S, and
S2: a S == a
1
S.
then the binary operation on G makes S into a group.
PROOF. (S1) implies that the binary operation on G denes a binary operation S S S
on S, which is automatically associative. By assumption S contains at least one element a,
its inverse a
1
, and the product e =aa
1
. Finally (S2) shows that the inverses of elements
in S lie in S.
2
A nonempty subset S satisfying (S1) and (S2) is called a subgroup of G. When S is
nite, condition (S1) implies (S2): let a S; then {a. a
2
. . . .] S, and so a has nite order,
say a
n
=e; now a
1
=a
n1
S. The example (N. ) (Z. ) shows that (S1) does not
imply (S2) when S is innite.
EXAMPLE 1.12 The centre of a group G is the subset
7(G) ={g G [ g. =.g for all . G].
It is a subgroup of G.
PROPOSITION 1.13 An intersection of subgroups of G is a subgroup of G.
PROOF. It is nonempty because it contains e, and (S1) and (S2) obviously hold.
2
REMARK 1.14 It is generally true that an intersection of subobjects of an algebraic object
is a subobject. For example, an intersection of subrings of a ring is a subring, an intersection
of submodules of a module is a submodule, and so on.
PROPOSITION 1.15 For any subset X of a group G, there is a smallest subgroup of G con
taining X. It consists of all nite products of elements of X and their inverses (repetitions
allowed).
Subgroups 13
PROOF. The intersection S of all subgroups of G containing X is again a subgroup con
taining X, and it is evidently the smallest such group. Clearly S contains with X, all nite
products of elements of X and their inverses. But the set of such products satises (S1) and
(S2) and hence is a subgroup containing X. It therefore equals S.
2
The subgroup S given by the proposition is denoted (X), and is called the subgroup
generated by X. For example, (0) = {e]. If every element of X has nite order, for
example, if G is nite, then the set of all nite products of elements of X is already a group
and so equals (X).
We say that X generates G if G =(X), i.e., if every element of G can be written as a
nite product of elements from X and their inverses. Note that the order of an element a of
a group is the order of the subgroup (a) it generates.
EXAMPLES
1.16 The cyclic groups. A group is said to be cyclic if it is generated by a single element,
i.e., if G =(r) for some r G. If r has nite order n, then
G ={e. r. r
2
. .... r
n1
] ~C
n
. r
i
i mod n.
and G can be thought of as the group of rotational symmetries about the centre of a regular
polygon with nsides. If r has innite order, then
G ={. . . . r
i
. . . . . r
1
. e. r. . . . . r
i
. . . .] ~C
o
. r
i
i.
Thus, up to isomorphism, there is exactly one cyclic group of order n for each n _ o. In
future, we shall loosely use C
n
to denote any cyclic group of order n (not necessarily Z,nZ
or Z).
1.17 The dihedral groups D
n
.
3
For n _ 3, D
n
is the group of symmetries of a regular
polygon with nsides.
4
Number the vertices 1. . . . . n in the counterclockwise direction. Let
r be the rotation through 2,n about the centre of polygon (so i i 1 mod n), and let
s be the reection in the line (= rotation about the line) through the vertex 1 and the centre
of the polygon (so i n2i mod n). For example, the pictures
v
1
2 3
r
s
s =
_
1 1
2 3
r =1 2 3 1
v
1
2
3
4
r
s
s =
_
_
_
1 1
2 4
3 3
r =1 2 3 4 1
3
This group is denoted D
2n
or D
n
depending on whether the author is viewing it abstractly or concretely
as the symmetries of an npolygon (or perhaps on whether the author is a group theorist or not; see mo48434).
4
More formally, D
n
can be dened to be the subgroup of S
n
generated by r: i i 1 (mod n) and
s: i n2i (mod n). Then all the statements concerning D
n
can proved without appealing to geometry.
14 1. BASIC DEFINITIONS AND RESULTS
illustrate the groups D
3
and D
4
. In the general case
r
n
=e: s
2
=e: srs =r
1
(so sr =r
n1
s).
These equalites imply that
D
n
={e. r. .... r
n1
. s. rs. .... r
n1
s].
and it is clear from the geometry that the elements of the set are distinct, and so [D
n
[ =2n.
Let t be the reection in the line through the midpoint of the side joining the vertices
1 and 2 and the centre of the polygon (so i n 3 i mod n). Then r = t s. Hence
D
n
=(s. t ) and
s
2
=e. t
2
=e. (t s)
n
=e =(st )
n
.
We dene D
1
to be C
2
= {1. r] and D
2
to be C
2
C
2
= {1. r. s. rs]. The group D
2
is also called the Klein Viergruppe or, more simply, the 4group. Note that D
3
is the full
group of permutations of {1. 2. 3]. It is the smallest noncommutative group.
1.18 The quaternion group Q: Let a =
_
0
_
1
_
1 0
_
and b =
_
0 1
1 0
_
. Then
a
4
=e. a
2
=b
2
. bab
1
=a
3
(so ba =a
3
b).
The subgroup of GL
2
(C) generated by a and b is
Q={e. a. a
2
. a
3
. b. ab. a
2
b. a
3
b].
The group Q can also be described as the subset {1. i. . k] of the quaternion alge
bra H. Recall that
H=111i 1 1k
with the multiplication determined by
i
2
=1 =
2
. i =k =i.
The map i a, b extends uniquely to a homomorphism HM
2
(C) of 1algebras,
which maps the group (i. ) isomorphically onto (a. b).
1.19 Recall that S
n
is the permutation group on {1. 2. .... n]. A transposition is a permu
tation that interchanges two elements and leaves all other elements unchanged. It is not
difcult to see that S
n
is generated by transpositions (see (4.26) below for a more precise
statement).
Groups of small order
[For] n =6, there are three groups, a group C
6
,
and two groups C
2
C
3
and S
3
.
Cayley, American J. Math. 1 (1878), p. 51.
For each prime , there is only one group of order , namely C
]
(see 1.28 below). In
the following table, c n =t means that there are c commutative groups and n noncom
mutative groups (up to isomorphism, of course).
Homomorphisms 15
[G[ c n =t Groups Ref.
4 20 =2 C
4
, C
2
C
2
4.18
6 11 =2 C
6
; S
3
4.23
8 32 =5 C
S
, C
2
C
4
, C
2
C
2
C
2
; Q, D
4
4.21
9 20 =2 C
9
, C
3
C
3
4.18
10 11 =2 C
10
; D
5
5.14
12 23 =5 C
12
, C
2
C
6
; C
2
S
3
,
4
, C
4
C
3
5.16
14 11 =2 C
14
; D
T
5.14
15 10 =1 C
15
5.14
16 59 =14 See Wild 2005
18 23 =5 C
1S
, C
3
C
6
; D
9
. S
3
C
3
, (C
3
C
3
) C
2
20 23 =5 C
20
,C
2
C
10
;D
10
,C
5
C
4
,(a. b [ a
4
=b
5
=1. ba =ab
2
)
21 11 =2 C
21
; (a. b [ a
3
=b
T
=1, ba =ab
2
)
22 11 =2 C
22
; D
11
5.14
24 312=15 See opensourcemath.org/gap/small groups.html
Here (a. b [ a
4
= b
5
= 1. ba = ab
2
) is the group with generators a and b and relations
a
4
=b
5
=1 and ba =ab
2
(see Chapter 2).
Roughly speaking, the more high powers of primes divide n, the more groups of order
n there should be. In fact, if (n) is the number of isomorphism classes of groups of order
n, then
(n) _n
(
2
27
o(1))e(n)
2
where e(n) is the largest exponent of a prime dividing n and o(1) 0 as e(n) o (see
Pyber 1993).
By 2001, a complete irredundant list of groups of order _ 2000 had been found up
to isomorphism, there are exactly 49,910,529,484 (Besche et al. 2001).
5
Homomorphisms
DEFINITION 1.20 A homomorphism from a group G to a second G
t
is a map : G G
t
such that (ab) = (a)(b) for all a. b G. An isomorphism is a bijective homomor
phism.
For example, the determinant map det: GL
n
(J) J
is a homomorphism.
5
In fact Besche et al. did not construct the groups of order 1024 individually, but it is known that there are
49487365422 groups of that order. The remaining 423164062 groups of order up to 2000 (of which 408641062
have order 1536) are available as libraries in GAP and Magma. I would guess that 2048 is the smallest number
such that the exact number of groups of that order is unknown (Derek Holt, mo46855; Nov 21, 2010).
16 1. BASIC DEFINITIONS AND RESULTS
1.21 Let be a homomorphism. For any elements a
1
. . . . . a
n
of G,
(a
1
a
n
) =(a
1
(a
2
a
n
))
=(a
1
)(a
2
a
n
)
=(a
1
) (a
n
),
and so homomorphisms preserve all products. In particular, for m_1,
(a
n
) =(a)
n
. (9)
Moreover (e) =(ee) =(e)(e), and so (e) =e (apply 1.2a). Also
aa
1
=e =a
1
a == (a)(a
1
) =e =(a
1
)(a).
and so (a
1
) =(a)
1
. It follows that (9) holds for all m Z, and so a homomorphism
of commutative groups is also a homomorphism of Zmodules.
As we noted above, each row of the multiplication table of a group is a permutation of
the elements of the group. As Cayley pointed out, this allows one to realize the group as a
group of permutations.
THEOREM 1.22 (CAYLEY) There is a canonical injective homomorphism
: G Sym(G).
PROOF. For a G, dene a
1
: G G to be the map . a. (left multiplication by a).
For . G,
(a
1
b
1
)(.) =a
1
(b
1
(.)) =a
1
(b.) =ab. =(ab)
1
(.).
and so (ab)
1
=a
1
b
1
. As e
1
=id, this implies that
a
1
(a
1
)
1
=id =(a
1
)
1
a
1
.
and so a
1
is a bijection, i.e., a
1
Sym(G). Hence a a
1
is a homomorphism G
Sym(G), and it is injective because of the cancellation law.
2
COROLLARY 1.23 A nite group of order n can be realized as a subgroup of S
n
.
PROOF. List the elements of the group as a
1
. . . . . a
n
.
2
Unfortunately, unless n is small, S
n
is too large to be manageable. We shall see later
(4.22) that G can often be embedded in a permutation group of much smaller order than n.
Cosets 17
Cosets
For a subset S of a group G and an element a of G, we let
aS ={as [ s S]
Sa ={sa [ s S].
Because of the associativity law, a(bS) =(ab)S , and so we can denote this set unambigu
ously by abS.
When H is a subgroup of G, the sets of the form aH are called the left cosets of H
in G, and the sets of the form Ha are called the right cosets of H in G. Because e H,
aH =H if and only if a H.
EXAMPLE 1.24 Let G =(1
2
. ), and let H be a subspace of dimension 1 (line through
the origin). Then the cosets (left or right) of H are the lines aH parallel to H.
PROPOSITION 1.25 Let H be a subgroup of a group G.
(a) An element a of G lies in a left coset C of H if and only if C =aH.
(b) Two left cosets are either disjoint or equal.
(c) aH =bH if and only if a
1
b H.
(d) Any two left cosets have the same number of elements (possibly innite).
PROOF. (a) Certainly a aH. Conversely, if a lies in the left coset bH, then a =bh for
some h, and so
aH =bhH =bH.
(b) If C and C
t
are not disjoint, then they have a common element a, and C =aH and
C
t
=aH by (a).
(c) If a
1
b H, then H = a
1
bH, and so aH = aa
1
bH = bH. Conversely, if
aH =bH, then H =a
1
bH, and so a
1
b H.
(d) The map (ba
1
)
1
: ah bh is a bijection aH bH.
2
The index (G : H) of H in G is dened to be the number of left cosets of H in G.
6
For
example, (G : 1) is the order of G.
As the left cosets of H in G cover G, (1.25b) shows that they form a partition G. In
other words, the condition a and b lie in the same left coset is an equivalence relation on
G.
THEOREM 1.26 (LAGRANGE) If G is nite, then
(G : 1) =(G : H)(H : 1).
In particular, the order of every subgroup of a nite group divides the order of the group.
PROOF. The left cosets of H in G form a partition of G, there are (G : H) of them, and
each left coset has (H : 1) elements.
2
COROLLARY 1.27 The order of each element of a nite group divides the order of the
group.
6
More formally, (G : H) is the cardinality of the set {aH [ a G].
18 1. BASIC DEFINITIONS AND RESULTS
PROOF. Apply Lagranges theorem to H =(g), recalling that (H : 1) =order(g).
2
EXAMPLE 1.28 If G has order , a prime, then every element of G has order 1 or . But
only e has order 1, and so G is generated by any element a =e. In particular, G is cyclic
and so G ~C
]
. This shows, for example, that, up to isomorphism, there is only one group
of order 1. 000. 000. 007 (because this number is prime). In fact there are only two groups
of order 1. 000. 000. 014. 000. 000. 049 (see 4.18).
1.29 For a subset S of G, let S
1
={g
1
[ g S]. Then (aH)
1
is the right coset Ha
1
,
and (Ha)
1
=a
1
H. Therefore S S
1
denes a onetoone correspondence between
the set of left cosets and the set of right cosets under which aH Ha
1
. Hence (G : H)
is also the number of right cosets of H in G. But, in general, a left coset will not be a right
coset (see 1.34 below).
1.30 Lagranges theorem has a partial converse: if a prime divides m=(G : 1), then G
has an element of order (Cauchys theorem 4.13); if a prime power
n
divides m, then G
has a subgroup of order
n
(Sylows theorem 5.2). However, note that the 4group C
2
C
2
has order 4, but has no element of order 4, and
4
has order 12, but has no subgroup of
order 6 (see Exercise 415).
More generally, we have the following result.
PROPOSITION 1.31 For any subgroups H 1 of G,
(G : 1) =(G : H)(H : 1)
(meaning either both are innite or both are nite and equal).
PROOF. Write G =
iJ
g
i
H (disjoint union), and H =
}J
h
}
1 (disjoint union). On
multiplying the second equality by g
i
, we nd that g
i
H =
}J
g
i
h
}
1 (disjoint union),
and so G =
i,}JJ
g
i
h
}
1 (disjoint union). This shows that
(G : 1) =[1[[J[ =(G : H)(H : 1).
2
Normal subgroups
When S and T are two subsets of a group G, we let
ST ={st [ s S, t T ].
Because of the associativity law, 1(ST ) = (1S)T , and so we can denote this set unam
biguously as 1ST .
A subgroup N of G is normal, denoted N <G, if gNg
1
=N for all g G.
REMARK 1.32 To show that N is normal, it sufces to check that gNg
1
N for all g,
because multiplying this inclusion on the left and right with g
1
and g respectively gives
the inclusion N g
1
Ng, and rewriting this with g
1
for g gives that N gNg
1
for all
g. However, the next example shows that there can exist a subgroup N of a group G and
an element g of G such that gNg
1
N but gNg
1
=N.
Normal subgroups 19
EXAMPLE 1.33 Let G =GL
2
(), and let H =
_
1 n
0 1
_
n Z
_
. Then H is a subgroup of
G; in fact H .Z. Let g =
_
5 0
0 1
_
. Then
g
_
1 n
0 1
_
g
1
=
_
5 0
0 1
__
1 n
0 1
__
5
1
0
0 1
_
=
_
1 5n
0 1
_
.
Hence gHg
1
H (and g
1
Hg ,H).
PROPOSITION 1.34 A subgroup N of G is normal if and only if every left coset of N in
G is also a right coset, in which case, gN =Ng for all g G.
PROOF. Clearly,
gNg
1
=N gN =Ng.
Thus, if N is normal, then every left coset is a right coset (in fact, gN =Ng). Conversely,
if the left coset gN is also a right coset, then it must be the right coset Ng by (1.25a). Hence
gN =Ng, and so gNg
1
=N.
2
1.35 The proposition says that, in order for N to be normal, we must have that for all
g G and n N, there exists an n
t
N such that gn = n
t
g (equivalently, for all g G
and n N, there exists an n
t
such that ng =gn
t
). In other words, to say that N is normal
amounts to saying that an element of G can be moved past an element of N at the cost of
replacing the element of N by another element of N.
EXAMPLE 1.36 (a) Every subgroup of index two is normal. Indeed, let g GH. Then
G =H LgH (disjoint union). Hence gH is the complement of H in G. Similarly, Hg is
the complement of H in G, and so gH =Hg.
(b) Consider the dihedral group
D
n
={e. r. . . . . r
n1
. s. . . . . r
n1
s].
Then C
n
={e. r. . . . . r
n1
] has index 2, and hence is normal. For n _3 the subgroup {e. s]
is not normal because r
1
sr =r
n2
s {e. s].
(c) Every subgroup of a commutative group is normal (obviously), but the converse
is false: the quaternion group Q is not commutative, but every subgroup is normal (see
Exercise 11).
A group G is said to be simple if it has no normal subgroups other than G and {e]. Such
a group can still have lots of nonnormal subgroups in fact, the Sylow theorems (Chapter
5) imply that every nite group has nontrivial subgroups unless it is cyclic of prime order.
PROPOSITION 1.37 If H and N are subgroups of G and N is normal, then HN is a
subgroup of G. If H is also normal, then HN is a normal subgroup of G.
PROOF. The set HN is nonempty, and
(h
1
n
1
)(h
2
n
2
)
1.35
= h
1
h
2
n
t
1
n
2
HN.
and so it is closed under multiplication. Since
(hn)
1
=n
1
h
1
1.35
= h
1
n
t
HN
20 1. BASIC DEFINITIONS AND RESULTS
it is also closed under the formation of inverses, and so HN is a subgroup. If both H and
N are normal, then
gHNg
1
=gHg
1
gNg
1
=HN
for all g G.
2
An intersection of normal subgroups of a group is again a normal subgroup (cf. 1.14).
Therefore, we can dene the normal subgroup generated by a subset X of a group G to
be the intersection of the normal subgroups containing X. Its description in terms of X
is a little complicated. We say that a subset X of a group G is normal (or closed under
conjugation) if gXg
1
X for all g G.
LEMMA 1.38 If X is normal, then the subgroup (X) generated by it is normal.
PROOF. The map conjugation by g, a gag
1
, is a homomorphismGG. If a (X),
say, a =.
1
.
n
with each .
i
or its inverse in X, then
gag
1
=(g.
1
g
1
) (g.
n
g
1
).
As X is closed under conjugation, each g.
i
g
1
or its inverse lies in X, and so g(X)g
1
(X).
2
LEMMA 1.39 For any subset X of G, the subset
_
G
gXg
1
is normal, and it is the
smallest normal set containing X.
PROOF. Obvious.
2
On combining these lemmas, we obtain the following proposition.
PROPOSITION 1.40 The normal subgroup generated by a subset X of G is (
_
G
gXg
1
).
Kernels and quotients
The kernel of a homomorphism : G G
t
is
Ker() ={g G[ (g) =e].
If is injective, then Ker() ={e]. Conversely, if Ker() ={e], then is injective, because
(g) =(g
t
) == (g
1
g
t
) =e == g
1
g
t
=e == g =g
t
.
PROPOSITION 1.41 The kernel of a homomorphism is a normal subgroup.
PROOF. It is obviously a subgroup, and if a Ker(), so that (a) =e, and g G, then
(gag
1
) =(g)(a)(g)
1
=(g)(g)
1
=e.
Hence gag
1
Ker ().
2
For example, the kernel of the homomorphism det: GL
n
(J) J
is the group of nn
matrices with determinant 1 this group SL
n
(J) is called the special linear group of
degree n.
Theorems concerning homomorphisms 21
PROPOSITION 1.42 Every normal subgroup occurs as the kernel of a homomorphism.
More precisely, if N is a normal subgroup of G, then there is a unique group structure
on the set G,N of cosets of N in G for which the natural map a a: G G,N is a
homomorphism.
PROOF. Write the cosets as left cosets, and dene (aN)(bN) =(ab)N. We have to check
(a) that this is welldened, and (b) that it gives a group structure on the set of cosets. It
will then be obvious that the map g gN is a homomorphism with kernel N.
(a). Let aN =a
t
N and bN =b
t
N; we have to show that abN =a
t
b
t
N. But
abN =a(bN) =a(b
t
N)
1.34
= aNb
t
=a
t
Nb
t
1.34
= a
t
b
t
N.
(b). The product is certainly associative, the coset N is an identity element, and a
1
N
is an inverse for aN.
2
The group G,N is called the
7
quotient of G by N.
Propositions 1.41 and 1.42 show that the normal subgroups are exactly the kernels of
homomorphisms.
PROPOSITION 1.43 The map a aN: G G,N has
the following universal property: for any homomorphism
: G G
t
of groups such that (N) = {e], there exists
a unique homomorphism G,N G
t
making the diagram
at right commute:
G G,N
G
t
.
o o1
PROOF. Note that for n N, (gn) =(g)(n) =(g), and so is constant on each left
coset gN of N in G. It therefore denes a map
: G,N G
t
. (gN) =(g).
and is a homomorphism because
((gN) (g
t
N)) = (gg
t
N) =(gg
t
) =(g)(g
t
) = (gN) (g
t
N).
The uniqueness of follows from the surjectivity of G G,N.
2
EXAMPLE 1.44 (a) Consider the subgroup mZ of Z. The quotient group Z,mZ is a cyclic
group of order m.
(b) Let 1 be a line through the origin in 1
2
. Then 1
2
,1 is isomorphic to 1 (because it
is a onedimensional vector space over 1).
(c) For n _2, the quotient D
n
,(r) ={ e. s] (cyclic group of order 2).
Theorems concerning homomorphisms
The theorems in this subsection are sometimes called the isomorphism theorems (rst, sec
ond, . . . , or rst, third, . . . , or . . . ).
7
Some authors say factor instead of quotient, but this can be confused with direct factor.
22 1. BASIC DEFINITIONS AND RESULTS
FACTORIZATION OF HOMOMORPHISMS
Recall that the image of a map : S T is (S) ={(s) [ s S].
THEOREM 1.45 (HOMOMORPHISM THEOREM) For any homomorphism : G G
t
of
groups, the kernel N of is a normal subgroup of G, the image 1 of is a subgroup
of G
t
, and factors in a natural way into the composite of a surjection, an isomorphism,
and an injection:
G
G
t
surjective
_
1
_
injective
G,N
1()
isomorphism
1.
PROOF. We have already seen (1.41) that the kernel is a normal subgroup of G. If b =(a)
and b
t
=(a
t
), then bb
t
=(aa
t
) and b
1
=(a
1
), and so 1
def
=(G) is a subgroup of G
t
.
The universal property of quotients (1.43) shows that the map . (.): G 1 denes
a homomorphism : G,N 1 with (gN) = (g). The homomorphism is certainly
surjective, and if (gN) = e, then g Ker() = N, and so has trivial kernel. This
implies that it is injective (p. 20).
2
THE ISOMORPHISM THEOREM
THEOREM 1.46 (ISOMORPHISM THEOREM) Let H be a subgroup of G and N a normal
subgroup of G. Then HN is a subgroup of G, H N is a normal subgroup of H, and the
map
h(H N) hN: H,H N HN,N
is an isomorphism.
PROOF. We have already seen (1.37) that HN is a subgroup. Consider the map
H G,N. h hN.
This is a homomorphism, and its kernel is H N, which is therefore normal in H. Ac
cording to Theorem 1.45, the map induces an isomorphism H,H N 1 where 1 is its
image. But 1 is the set of cosets of the form hN with h H, i.e., 1 =HN,N.
2
It is not necessary to assume that N be normal in G as long as hNh
1
= N for all
h H (i.e., H is contained in the normalizer of N see later). Then H N is still
normal in H, but it need not be a normal subgroup of G.
THE CORRESPONDENCE THEOREM
The next theorem shows that if
G is a quotient group of G, then the lattice of subgroups in
G captures the structure of the lattice of subgroups of G lying over the kernel of G
G.
THEOREM 1.47 (CORRESPONDENCE THEOREM) Let : G
G be a surjective homo
morphism, and let N =Ker(). Then there is a onetoone correspondence
{subgroups of G containing N]
1:1
{subgroups of
G]
under which a subgroup H of G containing N corresponds to
H =(H) and a subgroup
H of
G corresponds to H =
1
(
H). Moreover, if H 
H and H
t

H
t
, then
Direct products 23
(a)
H
H
t
H H
t
, in which case (
H
t
:
H) =(H
t
: H);
(b)
H is normal in
G if and only if H is normal in G, in which case, induces an
isomorphism
G,H
:
G,
H.
PROOF. If
H is a subgroup of
G, then
1
(
H) is easily seen to be a subgroup of G con
taining N, and if H is a subgroup of G, then (H) is a subgroup of
G (see 1.45). Clearly,
1
(H) =HN, which equals H if and only if H N, and
1
(
H) =
H. Therefore,
the two operations give the required bijection. The remaining statements are easily veried.
For example, a decomposition H
t
=
iJ
a
i
H of H
t
into a disjoint union of left cosets of
H gives a similar decomposition
H
t
=
iJ
a
i
H of
H
t
.
2
COROLLARY 1.48 Let N be a normal subgroup of G; then there is a onetoone corre
spondence between the set of subgroups of G containing N and the set of subgroups of
G,N, H H,N. Moreover H is normal in G if and only if H,N is normal in G,N, in
which case the homomorphism g gN: G G,N induces an isomorphism
G,H
:
(G,N),(H,N).
PROOF. This is the special case of the theorem in which is g gN: G G,N.
2
EXAMPLE 1.49 Let G=D
4
and let N be its subgroup (r
2
). Recall (1.17) that srs
1
=r
3
,
and so sr
2
s
1
=
_
r
3
_
2
= r
2
. Therefore N is normal. The groups G and G,N have the
following lattices of subgroups:
D
4
D
4
,(r
2
)
(r
2
. s) (r) (r
2
. rs) ( s) ( r) ( r s)
(s) (r
2
s) (r
2
) (rs) (r
3
s) 1
1
Direct products
Let G be a group, and let H
1
. . . . . H
k
be subgroups of G. We say that G is a direct product
of the subgroups H
i
if the map
(h
1
. h
2
. . . . . h
k
) h
1
h
2
h
k
: H
1
H
2
H
k
G
is an isomorphism of groups. This means that each element g of G can be written uniquely
in the form g =h
1
h
2
h
k
, h
i
H
i
, and that if g =h
1
h
2
h
k
and g
t
=h
t
1
h
t
2
h
t
k
, then
gg
t
=(h
1
h
t
1
)(h
2
h
t
2
) (h
k
h
t
k
).
The following propositions give criteria for a group to be a direct product of subgroups.
24 1. BASIC DEFINITIONS AND RESULTS
PROPOSITION 1.50 A group G is a direct product of subgroups H
1
, H
2
if and only if
(a) G =H
1
H
2
,
(b) H
1
H
2
={e], and
(c) every element of H
1
commutes with every element of H
2
.
PROOF. If G is the direct product of H
1
and H
2
, then certainly (a) and (c) hold, and (b)
holds because, for any g H
1
H
2
, the element (g. g
1
) maps to e under (h
1
. h
2
) h
1
h
2
and so equals (e. e).
Conversely, (c) implies that (h
1
. h
2
) h
1
h
2
is a homomorphism, and (b) implies that
it is injective:
h
1
h
2
=e == h
1
=h
1
2
H
1
H
2
={e].
Finally, (a) implies that it is surjective.
2
PROPOSITION 1.51 A group G is a direct product of subgroups H
1
, H
2
if and only if
(a) G =H
1
H
2
,
(b) H
1
H
2
={e], and
(c) H
1
and H
2
are both normal in G.
PROOF. Certainly, these conditions are implied by those in the previous proposition, and so
it remains to show that they imply that each element h
1
of H
1
commutes with each element
h
2
of H
2
. Two elements h
1
. h
2
of a group commute if and only if their commutator
h
1
. h
2

def
=(h
1
h
2
)(h
2
h
1
)
1
is e. But
(h
1
h
2
)(h
2
h
1
)
1
=h
1
h
2
h
1
1
h
1
2
=
_
(h
1
h
2
h
1
1
) h
1
2
h
1
_
h
2
h
1
1
h
1
2
_
.
which is in H
2
because H
2
is normal, and is in H
1
because H
1
is normal. Therefore (b)
implies h
1
. h
2
 =e.
2
PROPOSITION 1.52 A group G is a direct product of subgroups H
1
. H
2
. . . . . H
k
if and
only if
(a) G =H
1
H
2
H
k
.
(b) for each , H
}
(H
1
H
}1
H
}1
H
k
) ={e], and
(c) each of H
1
. H
2
. . . . . H
k
is normal in G,
PROOF. The necessity of the conditions being obvious, we shall prove only the sufciency.
For k = 2, we have just done this, and so we argue by induction on k. An induction
argument using (1.37) shows that H
1
H
k1
is a normal subgroup of G. The conditions
(a,b,c) hold for the subgroups H
1
. . . . . H
k1
of H
1
H
k1
, and so the induction hypothesis
shows that
(h
1
. h
2
. . . . . h
k1
) h
1
h
2
h
k1
: H
1
H
2
H
k1
H
1
H
2
H
k1
is an isomorphism. The pair H
1
H
k1
, H
k
satises the hypotheses of (1.51), and so
(h. h
k
) hh
k
: (H
1
H
k1
) H
k
G
is also an isomorphism. The composite of these isomorphisms
H
1
H
k1
H
k
(h
1
,...,h
k
)(h
1
h
k1
,h
k
)
H
1
H
k1
H
k
(h,h
k
)hh
k
G
sends (h
1
. h
2
. . . . . h
k
) to h
1
h
2
h
k
.
2
Commutative groups 25
Commutative groups
The classication of nitely generated commutative groups is most naturally studied as part
of the theory of modules over a principal ideal domain, but, for the sake of completeness, I
include an elementary exposition here.
Let M be a commutative group, written additively. The subgroup (.
1
. . . . . .
k
) of M
generated by the elements .
1
. . . . . .
k
consists of the sums
m
i
.
i
, m
i
Z. A subset
{.
1
. . . . . .
k
] of M is a basis for M if it generates M and
m
1
.
1
m
k
.
k
=0. m
i
Z == m
i
.
i
=0 for every i :
then
M =(.
1
) (.
k
).
LEMMA 1.53 Suppose that M is generated by {.
1
. . . . . .
k
]. For any c
1
. . . . . c
k
N with
gcd(c
1
. . . . . c
k
) = 1, there exist generators ,
1
. . . . . ,
k
for M such that ,
1
= c
1
.
1
c
k
.
k
.
PROOF. We argue by induction on s =c
1
c
k
. The lemma certainly holds if s =1,
and so we assume s > 1. Then, at least two c
i
are nonzero, say, c
1
_c
2
> 0. Now
{.
1
. .
2
.
1
. .
3
. . . . . .
k
] generates M,
gcd(c
1
c
2
. c
2
. c
3
. . . . . c
k
) =1, and
(c
1
c
2
) c
2
c
k
< s,
and so, by induction, there exist generators ,
1
. . . . . ,
k
for M such that
,
1
=(c
1
c
2
).
1
c
2
(.
1
.
2
) c
3
.
3
c
k
.
k
=c
1
.
1
c
k
.
k
.
2
THEOREM 1.54 Every nitely generated commutative group M has a basis; hence it is a
nite direct sum of cyclic groups.
PROOF.
8
We argue by induction on the number of generators of M. If M can be generated
by one element, the statement is trivial, and so we may assume that it requires at least k >1
generators. Among the generating sets {.
1
. . . . . .
k
] for M with k elements there is one for
which the order of .
1
is the smallest possible. We shall show that M is then the direct sum
of (.
1
) and (.
2
. . . . . .
k
). This will complete the proof, because the induction hypothesis
provides us with a basis for the second group, which together with .
1
forms a basis for M.
If M is not the direct sum of (.
1
) and (.
2
. . . . . .
k
), then there exists a relation
m
1
.
1
m
2
.
2
m
k
.
k
=0 (10)
with m
1
.
1
=0. After possibly changing the sign of some of the .
i
, we may suppose that
m
1
. . . . . m
k
N and m
1
< order(.
1
). Let J = gcd(m
1
. . . . . m
k
) > 0, and let c
i
= m
i
,J.
According to the lemma, there exists a generating set ,
1
. . . . . ,
k
such that ,
1
=c
1
.
1
c
k
.
k
. But
J,
1
=m
1
.
1
m
2
.
2
m
k
.
k
=0
and J _m
1
< order(.
1
), and so this contradicts the choice of {.
1
. . . . . .
k
].
2
8
John Stillwell tells me that, for nite commutative groups, this is similar to the rst proof of the theorem,
given by Kronecker in 1870.
26 1. BASIC DEFINITIONS AND RESULTS
COROLLARY 1.55 A nite commutative group is cyclic if, for each n > 0, it contains at
most n elements of order dividing n.
PROOF. After the Theorem 1.54, we may suppose that G = C
n
1
C
n
r
with n
i
N.
If n divides n
i
and n
}
with i = , then G has more than n elements of order dividing n.
Therefore, the hypothesis implies that the n
i
are relatively prime. Let a
i
generate the i th
factor. Then (a
1
. . . . . a
i
) has order n
1
n
i
, and so generates G.
2
EXAMPLE 1.56 Let J be a eld. The elements of order dividing n in J
is cyclic.
THEOREM 1.57 A nonzero nitely generated commutative group M can be expressed
M ~C
n
1
C
n
s
C
i
o
(11)
for certain integers n
1
. . . . . n
x
_2 and r _0. Moreover,
(a) r is uniquely determined by M;
(b) the n
i
can be chosen so that n
1
_2 and n
1
[n
2
. . . . . n
x1
[n
x
, and then they are uniquely
determined by M;
(c) the n
i
can be chosen to be powers of prime numbers, and then they are uniquely
determined by M.
The number r is called the rank of M. By r being uniquely determined by M, we mean
that in any two decompositions of M of the form (11), the number of copies of C
o
will be
the same (and similarly for the n
i
in (b) and (c)). The integers n
1
. . . . . n
x
in (b) are called
the invariant factors of M. Statement (c) says that M can be expressed
M ~C
]
e
1
1
C
]
e
t
t
C
i
o
, e
i
_1, (12)
for certain prime powers
e
i
i
(repetitions of primes allowed), and that the integers
e
1
1
. . . . .
e
t
t
are uniquely determined by M; they are called the elementary divisors of M.
PROOF. The rst assertion is a restatement of Theorem 1.54.
(a) For a prime not dividing any of the n
i
,
M,M ~(C
o
,C
o
)
i
~(Z,Z)
i
.
and so r is the dimension of M,M as an F
]
vector space.
(b,c) If gcd(m. n) =1, then C
n
C
n
contains an element of order mn, and so
C
n
C
n
~C
nn
. (13)
Use (13) to decompose the C
n
i
into products of cyclic groups of prime power order. Once
this has been achieved, (13) can be used to combine factors to achieve a decomposition as
in (b); for example, C
n
s
=
C
]
e
i
i
where the product is over the distinct primes among the
i
and e
i
is the highest exponent for the prime
i
.
In proving the uniqueness statements in (b) and (c), we can replace M with its torsion
subgroup (and so assume r =0). A prime will occur as one of the primes
i
in (12) if
and only M has an element of order , in which case will occur exact a times where
o
Commutative groups 27
is the number of elements of order dividing . Similarly,
2
will divide some
e
i
i
in (12)
if and only if M has an element of order
2
, in which case it will divide exactly b of the
e
i
i
where
ob
2b
is the number of elements in M of order dividing
2
. Continuing in
this fashion, we nd that the elementary divisors of M can be read off from knowing the
numbers of elements of M of each prime power order.
The uniqueness of the invariant factors can be derived from that of the elementary divi
sors, or it can be proved directly: n
x
is the smallest integer > 0 such that n
x
M =0; n
x1
is the smallest integer >0 such that n
x1
M is cyclic; n
x2
is the smallest integer such that
n
x2
can be expressed as a product of two cyclic groups, and so on.
2
SUMMARY 1.58 Each nite commutative group is isomorphic to exactly one of the groups
C
n
1
C
n
r
. n
1
[n
2
. . . . . n
i1
[n
i
.
The order of this group is n
1
n
i
. For example, each commutative group of order 90 is
isomorphic to exactly one of C
90
or C
3
C
30
to see this, note that the largest invariant
factor must be a factor of 90 divisible by all the prime factors of 90.
THE LINEAR CHARACTERS OF A COMMUTATIVE GROUP
Let j(C) ={: C [ [:[ =1]. This is an innite group. For any integer n, the set j
n
(C) of
elements of order dividing n is cyclic of order n; in fact,
j
n
(C) ={e
2tin{n
[ 0 _m_n1] ={1. . . . . .
n1
]
where =e
2ti{n
is a primitive nth root of 1.
A linear character (or just character) of a group G is a homomorphism G j(C).
The homomorphism a 1 is called the trivial (or principal) character.
EXAMPLE 1.59 The quadratic residue modulo of an integer a not divisible by is
dened by
_
a
_
=
_
1 if a is a square in Z,Z
1 otherwise.
Clearly, this depends only on a modulo , and if neither a nor b is divisible by , then
_
ob
]
_
=
_
o
]
__
b
]
_
(because (Z,Z)
is cyclic). Therefore a
_
o
]
_
: (Z,Z)
{1] =
j
2
(C) is a character of (Z,Z)
.
The set of characters of a group G becomes a group G
of Z is isomorphic to j(C) by
the map (1).
THEOREM 1.60 Let G be a nite commutative group.
(a) The dual of G
is isomorphic to G.
(b) The map G G
is
an isomorphism.
28 1. BASIC DEFINITIONS AND RESULTS
In other words, G ~G
and G .G
.
PROOF. The statements are obvious for cyclic groups, and (GH)
.G
.
2
ASIDE 1.61 The statement that the natural map G G
is an isomorphism.
THEOREM 1.62 (ORTHOGONALITY RELATIONS) Let G be a nite commutative group.
For any characters and [ of G,
oG
(a)[(a
1
) =
_
[G[ if =[
0 otherwise.
In particular,
oG
(a) =
_
[G[ if is trivial
0 otherwise.
PROOF. If =[, then (a)[(a
1
) =1, and so the sum is [G[. Otherwise there exists a
b G such that (b) =[(b). As a runs over G, so also does ab, and so
oG
(a)[(a
1
) =
oG
(ab)[((ab)
1
) =(b)[(b)
1
oG
(a)[(a
1
).
Because (b)[(b)
1
=1, this implies that
oG
(a)[(a
1
) =0.
2
COROLLARY 1.63 For any a G,
_G
_
(a) =
_
[G[ if a =e
0 otherwise.
PROOF. Apply the theorem to G
, noting that (G
.G.
2
The order of ab
Let a and b be elements of a group G. If a has order m and b has order n, what can we say
about the order of ab? The next theorem shows that we can say nothing at all.
THEOREM 1.64 For any integers m. n. r >1, there exists a nite group G with elements a
and b such that a has order m, b has order n, and ab has order r.
PROOF. We shall show that, for a suitable prime power q, there exist elements a and b of
SL
2
(F
q
) such that a, b, and ab have orders 2m, 2n, and 2r respectively. As 1 is the
unique element of order 2 in SL
2
(F
q
), the images of a, b, ab in SL
2
(F
q
),{1] will then
have orders m, n, and r as required.
9
Following Bourbaki, I require locally compact spaces to be Hausdorff.
Exercises 29
Let be a prime number not dividing 2mnr. Then is a unit in the nite ring
Z,2mnrZ, and so some power of it, q say, is 1 in the ring. This means that 2mnr di
vides q 1. As the group F
q
has order q 1 and is cyclic (see 1.56), there exist elements
u, , and n of F
q
having orders 2m, 2n, and 2r respectively. Let
a =
_
u 1
0 u
1
_
and b =
_
0
t
1
_
(elements of SL
2
(F
q
)).
where t has been chosen so that
u t u
1
1
=nn
1
.
The characteristic polynomial of a is (Xu)(Xu
1
), and so a is similar to diag(u. u
1
).
Therefore a has order 2m. Similarly b has order 2n. The matrix
ab =
_
u t
1
u
1
t u
1
1
_
.
has characteristic polynomial
X
2
(u t u
1
1
)X 1 =(X n)(X n
1
),
and so ab is similar to diag(n. n
1
). Therefore ab has order 2r.
10
2
Exercises
11 Show that the quaternion group has only one element of order 2, and that it commutes
with all elements of Q. Deduce that Q is not isomorphic to D
4
, and that every subgroup of
Q is normal.
12 Consider the elements
a =
_
0 1
1 0
_
b =
_
0 1
1 1
_
in GL
2
(Z). Show that a
4
=1 and b
3
=1, but that ab has innite order, and hence that the
group (a. b) is innite.
13 Show that every nite group of even order contains an element of order 2.
14 Let n =n
1
n
i
be a partition of the positive integer n. Use Lagranges theorem
to show that n is divisible by
i
i=1
n
i
.
15 Let N be a normal subgroup of G of index n. Show that if g G, then g
n
N. Give
an example to show that this may be false when the subgroup is not normal.
16 A group G is said to have nite exponent if there exists an m > 0 such that a
n
=e
for every a in G; the smallest such m is then called the exponent of G.
10
I dont know who found this beautiful proof. Apparently the original proof of G.A. Miller is very compli
cated; see mo24913.
30 1. BASIC DEFINITIONS AND RESULTS
(a) Show that every group of exponent 2 is commutative.
(b) Show that, for an odd prime , the group of matrices
_
_
_
_
_
1 a b
0 1 c
0 0 1
_
_
a. b. c F
]
_
_
_
has exponent , but is not commutative.
17 Two subgroups H and H
t
of a group G are said to be commensurable if H H
t
is
of nite index in both H and H
t
. Show that commensurability is an equivalence relation
on the subgroups of G.
18 Show that a nonempty nite set with an associative binary operation satisfying the
cancellation laws is a group.
19 Let G be a set with an associative binary operation. Show that if left multiplication
. a. by every element a is bijective and right multiplication by some element is injec
tive, then G is a group. Give an example to show that the second condition is needed.
CHAPTER 2
Free Groups and Presentations;
Coxeter Groups
It is frequently useful to describe a group by giving a set of generators for the group and
a set of relations for the generators from which every other relation in the group can be
deduced. For example, D
n
can be described as the group with generators r. s and relations
r
n
=e. s
2
=e. srsr =e.
In this chapter, we make precise what this means. First we need to dene the free group on a
set X of generators this is a group generated by X and with no relations except for those
implied by the group axioms. Because inverses cause problems, we rst do this for monoids.
Recall that a monoid is a set S with an associative binary operation having an identity
element e. A homomorphism : S S
t
of monoids is a map such that (ab) =(a)(b)
for all a. b S and (e) = e unlike the case of groups, the second condition is not
automatic. A homomorphism of monoids preserves all nite products.
Free monoids
Let X ={a. b. c. . . .] be a (possibly innite) set of symbols. A word is a nite sequence of
symbols from X in which repetition is allowed. For example,
aa. aabac. b
are distinct words. Two words can be multiplied by juxtaposition, for example,
aaaa+aabac =aaaaaabac.
This denes on the set of all words an associative binary operation. The empty sequence
is allowed, and we denote it by 1. (In the unfortunate case that the symbol 1 is already an
element of X, we denote it by a different symbol.) Then 1 serves as an identity element.
Write SX for the set of words together with this binary operation. Then SX is a monoid,
called the free monoid on X.
31
32 2. FREE GROUPS AND PRESENTATIONS; COXETER GROUPS
When we identify an element a of X with the word a, X becomes
a subset of SX and generates it (i.e., no proper submonoid of SX
contains X). Moreover, the map X SX has the following uni
versal property: for any map of sets : X S fromX to a monoid
S, there exists a unique homomorphism SX S making the dia
gram at right commute:
X SX
S.
o o
Free groups
We want to construct a group JX containing X and having the same universal property as
SX with monoid replaced by group. Dene X
t
to be the set consisting of the symbols
in X and also one additional symbol, denoted a
1
, for each a X; thus
X
t
={a. a
1
. b. b
1
. . . .].
Let W
t
be the set of words using symbols from X
t
. This becomes a monoid under juxtapo
sition, but it is not a group because a
1
is not yet the inverse of a, and we cant cancel out
the obvious terms in words of the following form:
aa
1
or a
1
a
A word is said to be reduced if it contains no pairs of the form aa
1
or a
1
a. Starting with
a word n, we can perform a nite sequence of cancellations to arrive at a reduced word
(possibly empty), which will be called the reduced form n
0
of n. There may be many
different ways of performing the cancellations, for example,
cabb
1
a
1
c
1
ca caa
1
c
1
ca cc
1
ca ca.
cabb
1
a
1
c
1
ca cabb
1
a
1
a cabb
1
ca.
We have underlined the pair we are cancelling. Note that the middle a
1
is cancelled with
different as, and that different terms survive in the two cases (the ca at the right in the rst
cancellation, and the ca at left in the second). Nevertheless we ended up with the same
answer, and the next result says that this always happens.
PROPOSITION 2.1 There is only one reduced form of a word.
PROOF. We use induction on the length of the word n. If n is reduced, there is nothing to
prove. Otherwise a pair of the form a
0
a
1
0
or a
1
0
a
0
occurs assume the rst, since the
argument is the same in both cases.
Observe that any two reduced forms of n obtained by a sequence of cancellations in
which a
0
a
1
0
is cancelled rst are equal, because the induction hypothesis can be applied
to the (shorter) word obtained by cancelling a
0
a
1
0
.
Next observe that any two reduced forms of n obtained by a sequence of cancellations
in which a
0
a
1
0
is cancelled at some point are equal, because the result of such a sequence
of cancellations will not be affected if a
0
a
1
0
is cancelled rst.
Finally, consider a reduced form n
0
obtained by a sequence in which no cancellation
cancels a
0
a
1
0
directly. Since a
0
a
1
0
does not remain in n
0
, at least one of a
0
or a
1
0
must
be cancelled at some point. If the pair itself is not cancelled, then the rst cancellation
involving the pair must look like
,a
1
0
,a
0
a
1
0
or a
0
,a
1
0
,a
0
Free groups 33
where our original pair is underlined. But the word obtained after this cancellation is the
same as if our original pair were cancelled, and so we may cancel the original pair instead.
Thus we are back in the case just proved.
2
We say two words n. n
t
are equivalent, denoted n n
t
, if they have the same reduced
form. This is an equivalence relation (obviously).
PROPOSITION 2.2 Products of equivalent words are equivalent, i.e.,
n n
t
. 
t
== n n
t
t
.
PROOF. Let n
0
and
0
be the reduced forms of n and of . To obtain the reduced form
of n, we can rst cancel as much as possible in n and separately, to obtain n
0
0
and
then continue cancelling. Thus the reduced form of n is the reduced form of n
0
0
. A
similar statement holds for n
t
t
, but (by assumption) the reduced forms of n and equal
the reduced forms of n
t
and
t
, and so we obtain the same result in the two cases.
2
Let JX be the set of equivalence classes of words. Proposition 2.2 shows that the
binary operation on W
t
denes a binary operation on JX, which obviously makes it into a
monoid. It also has inverses, because
(ab gh)
_
h
1
g
1
b
1
a
1
_
1.
Thus JX is a group, called the free group on X. To summarize: the elements of JX are
represented by words in X
t
; two words represent the same element of JX if and only if
they have the same reduced forms; multiplication is dened by juxtaposition; the empty
word represents 1; inverses are obtained in the obvious way. Alternatively, each element of
JX is represented by a unique reduced word; multiplication is dened by juxtaposition and
passage to the reduced form.
When we identify a X with the equivalence class of the (reduced) word a, then X
becomes identied with a subset of JX clearly it generates JX. The next proposition
is a precise statement of the fact that there are no relations among the elements of X when
regarded as elements of JX except those imposed by the group axioms.
PROPOSITION 2.3 For any map of sets : X G from X to a group G, there exists a
unique homomorphism JX G making the following diagram commute:
X JX
G.
o o
1
u
1
1
1
1
u
u
1
1
=1
(ibid. IV Exercise 5.7).
3
Strictly speaking, I should say the relations a
2
n1
, a
2
n2
b
2
, bab
1
a.
36 2. FREE GROUPS AND PRESENTATIONS; COXETER GROUPS
PROPOSITION 2.8 Let G be the group dened by the presentation (X. 1). For any group
H and map of sets : X H sending each element of 1 to 1 (in the obvious sense
4
), there
exists a unique homomorphism G H making the following diagram commute:
X G
H.
o o
PROOF. From the universal property of free groups (2.3), we know that extends to a
homomorphism JX H, which we again denote . Let 1 be the image of 1 in JX.
By assumption 1 Ker(), and therefore the normal subgroup N generated by 1 is
contained in Ker(). By the universal property of quotients (see 1.43), factors through
JX,N =G. This proves the existence, and the uniqueness follows from the fact that we
know the map on a set of generators for X.
2
EXAMPLE 2.9 Let G =(a. b [ a
n
. b
2
. baba). We prove that G is isomorphic to the dihedral
group D
n
(see 1.17). Because the elements r. s D
n
satisfy these relations, the map
{a. b] D
n
. a r. b s
extends uniquely to a homomorphism G D
n
. This homomorphism is surjective because
r and s generate D
n
. The equalities
a
n
=1. b
2
=1. ba =a
n1
b
imply that each element of G is represented by one of the following elements,
1. . . . . a
n1
. b. ab. . . . . a
n1
b.
and so [G[ _ 2n = [D
n
[. Therefore the homomorphism is bijective (and these symbols
represent distinct elements of G).
Similarly,
(a. b [ a
2
. b
2
. (ab)
n
) .D
n
by a s, b t .
EXAMPLE 2.10 (a) Let G =(.. , [ .
n
. ,
n
) where m. n > 1. Then . has order m, , has
order n, and ., has innite order in G. To see this, recall that for any integers m. n. r > 1,
there exists a group H with elements a and b such that a, b, and ab have orders m, n, and r
respectively (Theorem 1.64). According to (2.8), there exists a homomorphism : G H
such that (.) =a and (,) =b. The order of . certainly divides m, and the fact that (.)
has order m shows that . has order exactly m. Similarly, , has order n. As (.,) =ab,
the element ., must have order at least r. As this is true for all r > 1, the element ., has
innite order.
(b) Let G =SL
2
(Z),{1], and let S and T be the elements of G represented by the
matrices
_
0 1
1 0
_
and
_
1 1
0 1
_
. Then S and ST generate G, and S
2
=1 =(ST )
3
(see Theorem
4
Each element of 1 represents an element of JX, and the condition requires that the unique extension of
to JX sends each of these elements to 1.
Finitely presented groups 37
2.12 of my course notes on modular forms). It is known that this is a full set of relations
for S and ST in G, and so every group generated by an element of order 2 and an element
of order 3 is a quotient of G. Most nite simple groups of Lie type, and all but three of the
sporadic simple groups, fall into this class.
Finitely presented groups
A group is said to be nitely presented if it admits a presentation (X. 1) with both X and
1 nite.
EXAMPLE 2.11 Consider a nite group G. Let X =G, and let 1 be the set of words
{abc
1
[ ab =c in G].
I claim that (X. 1) is a presentation of G, and so G is nitely presented. Let G
t
= (X [
1). The extension of a a: X G to JX sends each element of 1 to 1, and therefore
denes a homomorphism G
t
G, which is obviously surjective. But every element of G
t
is represented by an element of X, and so [G
t
[ _ [G[. Therefore the homomorphism is
bijective.
Although it is easy to dene a group by a nite presentation, calculating the properties
of the group can be very difcult note that we are dening the group, which may be quite
small, as the quotient of a huge free group by a huge subgroup. I list some negative results.
THE WORD PROBLEM
Let G be the group dened by a nite presentation (X. 1). The word problem for G asks
whether there exists an algorithm (decision procedure) for deciding whether a word on X
t
represents 1 in G. The answer is negative: Novikov and Boone showed that there exist
nitely presented groups G for which no such algorithm exists. Of course, there do exist
other groups for which there is an algorithm.
The same ideas lead to the following result: there does not exist an algorithm that
will determine for an arbitrary nite presentation whether or not the corresponding group
is trivial, nite, abelian, solvable, nilpotent, simple, torsion, torsionfree, free, or has a
solvable word problem.
See Rotman 1995, Chapter 12, for proofs of these statements.
THE BURNSIDE PROBLEM
Recall that a group is said to have exponent e if g
e
=1 for all g G and e is the smallest
natural number with this property. It is easy to write down examples of innite groups
generated by a nite number of elements of nite order (see Exercise 12 or Example 2.10),
but does there exist such a group with nite exponent? (Burnside problem). In 1968, Adjan
and Novikov showed the answer is yes: there do exist innite nitely generated groups of
nite exponent.
38 2. FREE GROUPS AND PRESENTATIONS; COXETER GROUPS
THE RESTRICTED BURNSIDE PROBLEM
The Burnside group of exponent e on r generators T(r. e) is the quotient of the free group
on r generators by the subgroup generated by all eth powers. The Burnside problem asked
whether T(r. e) is nite, and it is known to be innite except some small values of r and
e. The restricted Burnside problem asks whether T(r. e) has only nitely many nite quo
tients; equivalently, it asks whether there is one nite quotient of T(r. e) having all other
nite quotients as quotients. The classication of the nite simple groups (see p. 52) showed
that in order prove that T(r. e) always has only nitely many nite quotients, it sufces to
prove it for e equal to a prime power. This was shown by Em Zelmanov in 1989 after
earlier work of Kostrikin. See Feit 1995.
TODDCOXETER ALGORITHM
There are some quite innocuous looking nite presentations that are known to dene quite
small groups, but for which this is very difcult to prove. The standard approach to these
questions is to use the ToddCoxeter algorithm (see Chapter 4 below).
We shall develop various methods for recognizing groups from their presentations (see
also the exercises).
Coxeter groups
A Coxeter system is a pair (G. S) consisting of a group G and a set of generators S for G
subject only to relations of the form (st )
n(x,t)
=1, where
_
_
_
m(s. s) = 1 all s.
m(s. t ) _ 2
m(s. t ) = m(t. s).
(14)
When no relation occurs between s and t , we set m(s. t ) = o. Thus a Coxeter system is
dened by a set S and a mapping
m: S S NL{o]
satisfying (14); then G =(S [ 1) where
1 ={(st )
n(x,t)
[ m(s. t ) <o].
The Coxeter groups are those that arise as part of a Coxeter system. The cardinality of S is
called the rank of the Coxeter system.
EXAMPLES
2.12 Up to isomorphism, the only Coxeter system of rank 1 is (C
2
. {s]).
2.13 The Coxeter systems of rank 2 are indexed by m(s. t ) _2.
(a) If m(s. t ) is an integer n, then the Coxeter system is (G. {s. t ]) where
G =(s. t [ s
2
. t
2
. (st )
n
).
According to (2.9), G .D
n
. In particular, s =t and st has order n.
Coxeter groups 39
(b) If m(s. t ) =o, then the Coxeter system is (G. {s. t ]) where G =(s. t [ s
2
. t
2
). Ac
cording to (2.10), s and t each have order 2, and st has innite order.
2.14 Let V =1
n
endowed with the standard positive denite symmetric bilinear form
((.
i
)
1_i_n
. (,
i
)
1_i_n
) =
.
i
,
i
.
A reection is a linear map s: V V sending some nonzero vector to and xing the
points of the hyperplane H
orthogonal to . We write s
=
2(. )
(. )
.
because this is certainly correct for = and for H
=(a
1
. . . . .
i
a
i
. . . . .
}
a
i
. . . . . a
n
)
xed. Therefore, (i ) is a reection. As S
n
is generated by the transpositions, this shows
that it is a nite reection group (hence also a Coxeter group).
THE STRUCTURE OF COXETER GROUPS
THEOREM 2.16 Let (G. S) be the the Coxeter system dened by a map m: S S NL
{o] satisfying (14).
(a) The natural map S G is injective.
(b) Each s S has order 2 in G.
(c) For each s =t in S, st has order m(s. t ) in G.
PROOF. Note that the order of s is 1 or 2, and the order of st divides m(s. t ), and so the
theorem says that the elements of S remain distinct in G and that each s and each st has
the largest possible order.
If S has only a single element, then G .C
2
(see 2.12), and so the statements are obvi
ous. Otherwise, let s and t be distinct elements of S, and let G
t
=(s. t [ s
2
. t
2
. (st )
n(x,t)
).
The map S G
t
sending s to s, t to t , and all other elements of S to 1 extends to a homo
morphism G G
t
. We know that s and t are distinct elements of order 2 in G
t
and that st
has order m(s. t ) in G
t
(see 2.13), and it follows that the same is true in G.
2
40 2. FREE GROUPS AND PRESENTATIONS; COXETER GROUPS
REMARK 2.17 Let V be the 1vector space with basis a family (e
x
)
xS
indexed by S.
The standard proof of Theorem 2.16 denes a geometry on V for which there exist re
ections o
x
, s S, such that o
x
o
t
has order m(s. t ). According to (2.8), the map s o
x
extends to homomorphism of group G GL(V ). This proves the theorem, and it realizes
G as a group of automorphisms of a geometry. See Humphreys 1990, Chapter 5, or v3.02
of these notes.
Exercises
21 Let D
n
=(a. b[a
n
. b
2
. abab) be the nth dihedral group. If n is odd, prove that D
2n
~
(a
n
) (a
2
. b), and hence that D
2n
~C
2
D
n
.
22 Prove that the group with generators a
1
. . . . . a
n
and relations a
i
. a
}
 = 1, i = , is
the free abelian group on a
1
. . . . . a
n
. [Hint: Use universal properties.]
23 Let a and b be elements of an arbitrary free group J. Prove:
(a) If a
n
=b
n
with n > 1, then a =b.
(b) If a
n
b
n
=b
n
a
n
with mn ,=0, then ab =ba.
(c) If the equation .
n
=a has a solution . for every n, then a =1.
24 Let J
n
denote the free group on n generators. Prove:
(a) If n < m, then J
n
is isomorphic to both a subgroup and a quotient group of J
n
.
(b) Prove that J
1
J
1
is not a free group.
(c) Prove that the centre 7(J
n
) =1 provided n > 1.
25 Prove that Q
n
(see 2.7b) has a unique subgroup of order 2, which is 7(Q
n
). Prove
that Q
n
,7(Q
n
) is isomorphic to D
2
n1.
26 (a) Prove that (a. b [ a
2
. b
2
. (ab)
n
) .D
n
(cf. 2.9).
(b) Prove that G = (a. b [ a
2
. abab) is an innite group. (This is usually known as the
innite dihedral group.)
27 Let G = (a. b. c [ a
3
. b
3
. c
4
. acac
1
. aba
1
bc
1
b
1
). Prove that G is the trivial
group {1]. [Hint: Expand (aba
1
)
3
=(bcb
1
)
3
.]
28 Let J be the free group on the set {.. ,] and let G =C
2
, with generator a =1. Let
be the homomorphism J G such that (.) =a =(,). Find a minimal generating set
for the kernel of . Is the kernel a free group?
29 Let G =(s. t [ t
1
s
3
t =s
5
). Prove that the element
g =s
1
t
1
s
1
t st
1
st
is in the kernel of every map from G to a nite group.
Exercises 41
Coxeter came to Cambridge and gave a lecture [in which he stated a] problem for which he gave
proofs for selected examples, and he asked for a unied proof. I left the lecture room thinking.
As I was walking through Cambridge, suddenly the idea hit me, but it hit me while I was in
the middle of the road. When the idea hit me I stopped and a large truck ran into me. . . . So I
pretended that Coxeter had calculated the difculty of this problem so precisely that he knew
that I would get the solution just in the middle of the road. . . . Ever since, Ive called that theorem
the murder weapon. One consequence of it is that in a group if a
2
= b
3
= c
5
= (abc)
1
,
then c
610
=1.
John Conway, Math. Intelligencer 23 (2001), no. 2, pp. 89.
CHAPTER 3
Automorphisms and Extensions
Automorphisms of groups
An automorphism of a group G is an isomorphism of the group with itself. The set Aut(G)
of automorphisms of G becomes a group under composition: the composite of two auto
morphisms is again an automorphism; composition of maps is always associative (see (5),
p. 9); the identity map g g is an identity element; an automorphism is a bijection, and
therefore has an inverse, which is again an automorphism.
For g G, the map i
conjugation by g,
. g.g
1
: G G
is an automorphism of G. An automorphism of this form is called an inner automorphism,
and the remaining automorphisms are said to be outer.
Note that
(gh).(gh)
1
=g(h.h
1
)g
1
, i.e., i
h
(.) =(i
i
h
)(.).
and so the map g i
1
)(.) =(g
1
(.) g
1
) =(g) . (g)
1
=i
()
(.).
EXAMPLE 3.1 (a) Let G =F
n
]
. The automorphisms of G as a commutative group are just
the automorphisms of G as a vector space over F
]
; thus Aut(G) =GL
n
(F
]
). Because G
is commutative, all nontrivial automorphisms of G are outer.
(b) As a particular case of (a), we see that
Aut(C
2
C
2
) =GL
2
(F
2
).
43
44 3. AUTOMORPHISMS AND EXTENSIONS
(c) Since the centre of the quaternion group Q is (a
2
), we have that
Inn(Q) .Q,(a
2
) ~C
2
C
2
.
In fact, Aut(Q) ~S
4
. See Exercise 34.
ASIDE 3.2 Let be an automorphism of a group H. If is inner, then it extends to every group G
containing H as a subgroup. The converse is also true (Schupp 1987).
COMPLETE GROUPS
DEFINITION 3.3 A group G is complete if the map g i
: G Aut(G) is an isomor
phism.
Thus, a group G is complete if and only if (a) the centre 7(G) of G is trivial, and (b)
every automorphism of G is inner.
EXAMPLE 3.4 (a) For n =2. 6, S
n
is complete. The group S
2
is commutative and hence
fails (a); Aut(S
6
),Inn(S
6
) ~C
2
and hence S
6
fails (b). See Rotman 1995, Theorems 7.5,
7.10.
(b) If G is a simple noncommutative group, then Aut(G) is complete. See Rotman
1995, Theorem 7.14.
According to Exercise 33, GL
2
(F
2
) ~S
3
, and so the nonisomorphic groups C
2
C
2
and S
3
have isomorphic automorphism groups.
AUTOMORPHISMS OF CYCLIC GROUPS
Let G be a cyclic group of order n, say G = (a). Let m be an integer _ 1. The smallest
multiple of m divisible by n is m
n
gcd(n,n)
. Therefore, a
n
has order
n
gcd(n,n)
, and so the
generators of G are exactly the elements a
n
with gcd(m. n) =1. An automorphism of G
must send a to another generator of G, and so (a) =a
n
for some m relatively prime to n.
The map m denes an isomorphism
Aut(C
n
) (Z,nZ)
where
(Z,nZ)
. If n =
i
1
1
i
s
x
is the factorization of n into a
product of powers of distinct primes, then
Z,nZ .Z,
i
1
1
Z Z,
i
s
x
Z. m mod n (m mod
i
1
. . . .)
by the Chinese remainder theorem. This is an isomorphism of rings, and so
(Z,nZ)
.(Z,
i
1
1
Z)
(Z,
i
s
x
Z)
.
Characteristic subgroups 45
It remains to consider the case n =
i
, prime.
Suppose rst that is odd. The set {0. 1. . . . .
i
1] is a complete set of representatives
for Z,
i
Z, and
1
]
of these elements are divisible by . Hence (Z,
i
Z)
has order
i
]
r
]
=
i1
(1). The homomorphism
(Z,
i
Z)
(Z,Z)
is cyclic. Let a
(Z,
i
Z)
. Then a
]
r
(]1)
=1 and a
]
r
again maps to a
generator of (Z,Z)
. Therefore (Z,
i
Z)
contains an element
def
=a
]
r
of order 1.
Using the binomial theorem, one nds that 1 has order
i1
in (Z,
i
Z)
. Therefore
(Z,
i
Z)
is cyclic with generator (1 ) (cf. (13), p. 26), and every element can be
written uniquely in the form
i
(1)
}
. 0 _i < 1. 0 _ <
i1
.
On the other hand,
(Z,8Z)
={
1.
3.
5.
7] =(
3.
5) ~C
2
C
2
is not cyclic.
SUMMARY 3.5 (a) For a cyclic group of G of order n, Aut(G) .(Z,nZ)
. The automor
phism of G corresponding to m (Z,nZ)
sends an element a of G to a
n
.
(b) If n =
i
1
1
i
s
x
is the factorization of n into a product of powers of distinct primes
i
, then
(Z,nZ)
.(Z,
i
1
1
Z)
(Z,
i
s
x
Z)
~
_
_
C
(]1)]
r1 odd,
C
2
i
=2
2
C
2
C
2
r2 =2, r > 2.
Characteristic subgroups
DEFINITION 3.6 A characteristic subgroup of a group G is a subgroup H such that
(H) =H for all automorphisms of G.
The same argument as in (1.32) shows that it sufces to check that (H) H for all
Aut(G). Thus, a subgroup H of G is normal if it is stable under all inner automorphisms of
G, and it is characteristic if it stable under all automorphisms. In particular, a characteristic
subgroup is normal.
REMARK 3.7 (a) Consider a group G and a normal subgroup N. An inner automorphism
of G restricts to an automorphism of N, which may be outer (for an example, see 3.16
below). Thus a normal subgroup of N need not be a normal subgroup of G. However, a
characteristic subgroup of N will be a normal subgroup of G. Also a characteristic sub
group of a characteristic subgroup is a characteristic subgroup.
46 3. AUTOMORPHISMS AND EXTENSIONS
(b) The centre 7(G) of G is a characteristic subgroup, because
:g =g: all g G == (:)(g) =(g)(:) all g G.
and as g runs over G, (g) also runs over G. Expect subgroups with a general group
theoretic denition to be characteristic.
(c) If H is the only subgroup of G of order m, then it must be characteristic, because
(H) is again a subgroup of G of order m.
(d) Every subgroup of a commutative group is normal but not necessarily characteris
tic. For example, every subspace of dimension 1 in F
2
]
is subgroup of F
2
]
, but it is not
characteristic because it is not stable under Aut(F
2
]
) =GL
2
(F
]
).
Semidirect products
Let N be a normal subgroup of G. Each element g of G denes an automorphism of N,
n gng
1
, and this denes a homomorphism
0: G Aut(N). g i
[N.
If there exists a subgroup Q of G such that G G,N maps Q isomorphically onto G,N,
then I claim that we can reconstruct G from N, Q, and the restriction of 0 to Q. Indeed,
an element g of G can be written uniquely in the form
g =nq. n N. q Q;
q must be the unique element of Q mapping to gN G,N, and n must be gq
1
. Thus,
we have a onetoone correspondence of sets
G
11
N Q.
If g =nq and g
t
=n
t
q
t
, then
gg
t
=(nq)
_
n
t
q
t
_
=n(qn
t
q
1
)qq
t
=n 0(q)(n
t
) qq
t
.
DEFINITION 3.8 A group G is a semidirect product of its subgroups N and Q if N is
normal and the homomorphism G G,N induces an isomorphism QG,N.
Equivalently, G is a semidirect product of subgroup N and Q if
N <G; NQ=G; N Q={1]. (15)
Note that Q need not be a normal subgroup of G. When G is the semidirect product of
subgroups N and Q, we write G =N Q (or N
0
Q where 0: Q Aut(N) gives the
action of Q on N by inner automorphisms).
EXAMPLE 3.9 (a) In D
n
, n _2, let C
n
=(r) and C
2
=(s); then
D
n
=(r)
0
(s) =C
n
0
C
2
where 0(s)(r
i
) =r
i
(see 1.17).
Semidirect products 47
(b) The alternating subgroup
n
is a normal subgroup of S
n
(because it has index 2),
and C
2
={(12)] maps isomorphically onto S
n
,
n
. Therefore S
n
=
n
C
2
.
(c) The quaternion group can not be written as a semidirect product in any nontrivial
fashion (see Exercise 31).
(d) A cyclic group of order
2
, prime, is not a semidirect product (because it has only
one subgroup of order ).
(e) Let G =GL
n
(J). Let T be the subgroup of upper triangular matrices in G, T the
subgroup of diagonal matrices in G, and U the subgroup of upper triangular matrices with
all their diagonal coefcients equal to 1. Thus, when n =2,
T =
__
+ +
0 +
__
. T =
__
+ 0
0 +
__
. U =
__
1 +
0 1
__
.
Then, U is a normal subgroup of T, UT =T, and U T ={1]. Therefore,
T =U T .
Note that, when n _2, the action of T on U is not trivial, for example,
_
a 0
0 b
__
1 c
0 1
__
a
1
0
0 b
1
_
=
_
1 ac,b
0 1
_
.
and so T is not the direct product of T and U.
We have seen that, from a semidirect product G =N Q, we obtain a triple
(N. Q. 0: QAut(N)).
and that the triple determines G. We now prove that every triple (N. Q. 0) consisting of two
groups N and Q and a homomorphism 0: QAut(N) arises from a semidirect product.
As a set, let G =N Q, and dene
(n. q)(n
t
. q
t
) =(n 0(q)(n
t
). qq
t
).
PROPOSITION 3.10 The composition law above makes G into a group, in fact, the semidi
rect product of N and Q.
PROOF. Write
q
n for 0(q)(n), so that the composition law becomes
(n. q)(n
t
. q
t
) =(n
q
n
t
. qq
t
).
Then
((n. q). (n
t
. q
t
))(n
tt
. q
tt
) =(n
q
n
t
qq
0
n
tt
. qq
t
q
tt
) =(n. q)((n
t
. q
t
)(n
tt
. q
tt
))
and so the associative law holds. Because 0(1) =1 and 0(q)(1) =1,
(1. 1)(n. q) =(n. q) =(n. q)(1. 1),
and so (1. 1) is an identity element. Next
(n. q)(
q
1
n
1
. q
1
) =(1. 1) =(
q
1
n
1
. q
1
)(n. q).
and so (
q
1
n
1
. q
1
) is an inverse for (n. q). Thus G is a group, and it is obvious that
N <G, NQ =G, and N Q ={1], and so G =N Q. Moreover, when N and Q are
regarded as subgroups of G, the action of Q on N is that given by 0.
2
48 3. AUTOMORPHISMS AND EXTENSIONS
EXAMPLES
3.11 A group of order 12. Let 0 be the (unique) nontrivial homomorphism
C
4
Aut(C
3
) .C
2
.
namely, that sending a generator of C
4
to the map a a
2
. Then G
def
= C
3
0
C
4
is a
noncommutative group of order 12, not isomorphic to
4
. If we denote the generators of
C
3
and C
4
by a and b, then a and b generate G, and have the dening relations
a
3
=1. b
4
=1. bab
1
=a
2
.
3.12 Direct products. The bijection of sets
(n. q) (n. q): N QN
0
Q
is an isomorphism of groups if and only if 0 is the trivial homomorphism Q Aut(N),
i.e., 0(q)(n) =n for all q Q, n N.
3.13 Groups of order 6. Both S
3
and C
6
are semidirect products of C
3
by C
2
they
correspond to the two distinct homomorphisms C
2
C
2
.Aut(C
3
).
3.14 Groups of order
3
(element of order
2
). Let N = (a) be cyclic of order
2
,
and let Q=(b) be cyclic of order , where is an odd prime. Then Aut N ~C
]1
C
]
(see 3.5), and C
]
is generated by : a a
1]
(note that
2
(a) = a
12]
. . . .). Dene
QAut N by b . The group G
def
=N
0
Q has generators a. b and dening relations
a
]
2
=1. b
]
=1. bab
1
=a
1]
.
It is a noncommutative group of order
3
, and possesses an element of order
2
.
3.15 Groups of order
3
(no element of order
2
). Let N = (a. b) be the product of
two cyclic groups (a) and (b) of order , and let Q = (c) be a cyclic group of order .
Dene 0: QAut(N) to be the homomorphism such that
0(c
i
)(a) =ab
i
. 0(c
i
)(b) =b.
(If we regard N as the additive group N =F
2
]
with a and b the standard basis elements, then
0(c
i
) is the automorphism of N dened by the matrix
_
1 0
i 1
_
.) The group G
def
=N
0
Q
is a group of order
3
, with generators a. b. c and dening relations
a
]
=b
]
=c
]
=1. ab =cac
1
. b. a =1 =b. c.
Because b = 1, the middle equality shows that the group is not commutative. When is
odd, all elements except 1 have order . When =2, G ~D
4
, which does have an element
of order 2
2
. Note that this shows that a group can have quite different representations as a
semidirect product:
D
4
(3.9a)
~ C
4
C
2
~(C
2
C
2
) C
2
.
Semidirect products 49
For an odd prime , a noncommutative group of order
3
is isomorphic to the group in
(3.14) if it has an element of order
2
and to the group in (3.15) if it doesnt (see Exercise
44). In particular, up to isomorphism, there are exactly two noncommutative groups of
order
3
.
3.16 Making outer automorphisms inner. Let be an automorphism, possibly outer,
of a group N. We can realize N as a normal subgroup of a group G in such a way that
becomes the restriction to N of an inner automorphism of G. To see this, let 0: C
o
Aut(N) be the homomorphism sending a generator a of C
o
to Aut(N), and let G =
N
0
C
o
. The element g =(1. a) of G has the property that g(n. 1)g
1
=((n). 1) for all
n N.
CRITERIA FOR SEMIDIRECT PRODUCTS TO BE ISOMORPHIC
It will be useful to have criteria for when two triples (N. Q. 0) and (N. Q. 0
t
) determine
isomorphic groups.
LEMMA 3.17 If there exists an Aut(N) such that
0
t
(q) = 0(q)
1
. all q Q.
then the map
(n. q) ((n). q): N
0
QN
0
0 Q
is an isomorphism.
PROOF. For (n. q) N
0
Q, let ;(n. q) =((n). q). Then
;(n. q) ;(n
t
. q
t
) =((n). q) ((n
t
). q
t
)
=((n) 0
t
(q)((n
t
)). qq
t
)
=((n) ( 0(q)
1
)((n
t
)). qq
t
)
=((n) (0(q)(n
t
)). qq
t
).
and
;((n. q) (n
t
. q
t
)) =;(n 0(q)(n
t
). qq
t
)
=((n)
_
0(q)(n
t
)
_
. qq
t
).
Therefore ; is a homomorphism. The map
(n. q) (
1
(n). q): N
0
0 QN
0
Q
is also a homomorphism, and it is inverse to ;, and so both are isomorphisms.
2
LEMMA 3.18 If 0 =0
t
with Aut(Q), then the map
(n. q) (n. (q)): N
0
Q~N
0
0 Q
is an isomorphism.
PROOF. Routine verication.
2
50 3. AUTOMORPHISMS AND EXTENSIONS
LEMMA 3.19 If Q is cyclic and the subgroup 0(Q) of Aut(N) is conjugate to 0
t
(Q), then
N
0
Q~N
0
0 Q.
PROOF. Let a generate Q. By assumption, there exists an a
t
Q and an Aut(N) such
that
0
t
(a
t
) = 0(a)
1
.
The element 0
t
(a
t
) generates 0
t
(Q), and so we can choose a
t
to generate Q, say a
t
=a
i
with i relatively prime to the order of Q. Now the map (n. q) ((n). q
i
) is an isomor
phism N
0
QN
0
0 Q.
2
SUMMARY 3.20 Let G be a group with subgroups H
1
and H
2
such that G =H
1
H
2
and
H
1
H
2
= {e], so that each element g of G can be written uniquely as g = h
1
h
2
with
h
1
H
1
and h
2
H
2
.
(a) If H
1
and H
2
are both normal, then G is the direct product of H
1
and H
2
, G =
H
1
H
2
(1.51).
(b) If H
1
is normal in G, then G is the semidirect product of H
1
and H
2
, G =H
1
H
2
((15), p. 46).
(c) If neither H
1
nor H
2
is normal, then G is the ZappaSz ep (or knit) product of H
1
and H
2
(see http://en.wikipedia.org/wiki/ZappaSzep_product).
Extensions of groups
A sequence of groups and homomorphisms
1 N
t
G
t
Q1 (16)
is exact if  is injective, is surjective, and Ker() =Im(). Thus (N) is a normal sub
group of G (isomorphic by  to N) and G,(N)
:
Q. We often identify N with the
subgroup (N) of G and Q with the quotient G,N.
An exact sequence (16) is also called an extension of Q by N.
1
An extension is central
if (N) 7(G). For example, a semidirect product N
0
Q gives rise to an extension of
Q by N,
1 N N
0
QQ1.
which is central if and only if 0 is the trivial homomorphism.
Two extensions of Q by N are said to be isomorphic if there exists a commutative
diagram
1 N G Q 1
_
_
_
_
~
_
_
_
1 N G
t
Q 1.
An extension of Q by N,
1 N
t
G
t
Q1.
is said to be split if it is isomorphic to the extension dened by a semidirect product N
0
Q.
Equivalent conditions:
1
This is Bourbakis terminology (Alg` ebre, I 6); some authors call (16) an extension of N by Q.
Extensions of groups 51
(a) there exists a subgroup Q
t
G such that induces an isomorphism Q
t
Q; or
(b) there exists a homomorphism s: QG such that s =id.
In general, an extension will not split. For example, the extensions
1 N QQ,N 1 (17)
with N any subgroup of order 4 in the quaternion group Q, and
1 C
]
C
]
2 C
]
1
do not split. We give two criteria for an extension to split.
THEOREM 3.21 (SCHURZASSENHAUS) An extension of nite groups of relatively prime
order is split.
PROOF. Rotman 1995, 7.41.
2
PROPOSITION 3.22 An extension (17) splits if N is complete. In fact, G is then direct
product of N with the centralizer of N in G,
C
G
(N)
def
={g G [ gn =ng all n N].
PROOF. Let Q=C
G
(N). We shall check that N and Q satisfy the conditions of Proposi
tion 1.51.
Observe rst that, for any g G, n gng
1
: N N is an automorphism of N, and
(because N is complete), it must be the inner automorphism dened by an element ; of N;
thus
gng
1
=;n;
1
all n N.
This equation shows that ;
1
g Q, and hence g =;(;
1
g) NQ. Since g was arbitrary,
we have shown that G =NQ.
Next note that every element of N Q is in the centre of N, which (because N is
complete) is trivial; hence N Q=1.
Finally, for any element g =nq G,
gQg
1
=n(qQq
1
)n
1
=nQn
1
=Q
(recall that every element of N commutes with every element of Q). Therefore Q is normal
in G.
2
An extension
1 N G Q1
gives rise to a homomorphism 0
t
: G Aut(N), namely,
0
t
(g)(n) =gng
1
.
Let q G map to q in Q; then the image of 0
t
( q) in Aut(N),Inn(N) depends only on q;
therefore we get a homomorphism
0 : QOut(N)
def
=Aut(N),Inn(N).
52 3. AUTOMORPHISMS AND EXTENSIONS
This map 0 depends only on the isomorphismclass of the extension, and we write Ext
1
(Q. N)
0
for the set of isomorphism classes of extensions with a given 0. These sets have been ex
tensively studied.
When Q and N are commutative and 0 is trivial, the group G is also commutative, and
there is a commutative group structure on the set Ext
1
(Q. N). Moreover, endomorphisms
of Q and N act as endomorphisms on Ext
1
(Q. N). In particular, multiplication by m on
Q or N induces multiplication by m on Ext
1
(Q. N). Thus, if Q and N are killed by m
and n respectively, then Ext
1
(Q. N) is killed by m and by n, and hence by gcd(m. n). This
proves the SchurZassenhaus theorem in this case.
The H older program.
It would be of the greatest interest if it were possible
to give an overview of the entire collection of nite
simple groups.
Otto H older, Math. Ann., 1892
Recall that a group G is simple if it contains no normal subgroup except 1 and G. In
other words, a group is simple if it cant be realized as an extension of smaller groups.
Every nite group can be obtained by taking repeated extensions of simple groups. Thus
the simple nite groups can be regarded as the basic building blocks for all nite groups.
The problem of classifying all simple groups falls into two parts:
A. Classify all nite simple groups;
B. Classify all extensions of nite groups.
A. THE CLASSIFICATION OF FINITE SIMPLE GROUPS
There is a complete list of nite simple groups. They are
2
(a) the cyclic groups of prime order,
(b) the alternating groups
n
for n _5 (see the next chapter),
(c) certain innite families of matrix groups (said to be of Lie type), and
(d) the 26 sporadic groups.
By far the largest class is (c), but the 26 sporadic groups are of more interest than
their small number might suggest. Some have even speculated that the largest of them, the
FischerGriess monster, is built into the fabric of the universe.
As an example of a matrix group, consider
SL
n
(F
q
)
def
={mm matrices with entries in F
q
such that det =1].
Here q =
n
, prime, and F
q
is the eld with q elements. This group is not simple
if q = 2, because the scalar matrices diag(. . . . . ),
n
= 1, are in the centre for any m
dividing q 1, but these are the only matrices in the centre, and the groups
PSL
n
(F
q
)
def
=SL
n
(F
q
),{centre]
2
It has been shown that every group on the list can be generated by two elements, and so this is true for all
nite simple groups. If a proof of this could be found that doesnt use the classication, then the proof of the
classication would be greatly simplied (mo59213).
Exercises 53
are simple when m_3 (Rotman 1995, 8.23) and when m=2 and q >3 (ibid. 8.13). Other
nite simple groups can be obtained from the groups in (1.8). The smallest noncommutative
group is
5
, and the second smallest is PSL
3
(F
2
), which has order 168 (see Exercise 48).
B THE CLASSIFICATION OF ALL EXTENSIONS OF FINITE GROUPS
Much is known about the extensions of nite groups, for example, about the extensions of
one simple group by another. However, as Solomon writes (2001, p. 347):
. . . the classication of all nite groups is completely infeasible. Neverthe
less experience shows that most of the nite groups which occur in nature
. . . are close either to simple groups or to groups such as dihedral groups,
Heisenberg groups, etc., which arise naturally in the study of simple groups.
As we noted earlier, by the year 2001, a complete irredundant list of nite groups was
available only for those up to an order of about 2000, and the number of groups on the list
is overwhelming.
NOTES The dream of classifying the nite simple groups goes back at least to H older 1892. How
ever a clear strategy for accomplishing this did not begin to emerge until the 1950s, when work of
Brauer and others suggested that the key was to study the centralizers of elements of order 2 (the
involution centralizers). For example, Brauer and Fowler (1955) showed that, for any nite group
H, the determination of the nite simple groups with an involution centralizer isomorphic to H is a
nite problem. Later work showed that the problem is even tractable, and so the strategy became: (a)
list the groups H that are candidates for being an involution centralizer in some nite simple group,
and (b) for each H in (a) list the nite simple groups for which H occurs as an involution centralizer.
Of course, this approach applies only to the nite simple groups containing an element of order 2,
but an old conjecture said that, except for the cyclic groups of prime order, every nite simple group
has even order and hence contains an element of order 2 by Cauchys theorem (4.13). With the
proof of this conjecture by Feit and Thompson (1963), the effort to complete the classication of the
nite simple groups began in earnest. A complete classication was announced in 1982, but there
remained sceptics, because the proof depended on thousands of pages of rarely read journal articles,
and, in fact, in reworking the proof, gaps were discovered. However, these have been closed, and
with the publication of Aschbacher and Smith 2004 it has become generally accepted that the proof
of the classication is indeed complete.
For a popular account of the history of the classication, see the book Ronan 2006, and for a
more technical account, see the expository article Solomon 2001.
Exercises
31 Let G be the quaternion group (1.18). Prove that G cant be written as a semidirect
product in any nontrivial fashion.
32 Let G be a group of order mn where m and n have no common factor. If G contains
exactly one subgroup M of order m and exactly one subgroup N of order n, prove that G
is the direct product of M and N.
33 Prove that GL
2
(F
2
) ~S
3
.
34 Let G be the quaternion group (1.18). Prove that Aut(G) ~S
4
.
54 3. AUTOMORPHISMS AND EXTENSIONS
35 Let G be the set of all matrices in GL
3
(1) of the form
_
o 0 b
0 o c
0 0 d
_
, aJ =0. Check that
G is a subgroup of GL
3
(1), and prove that it is a semidirect product of 1
2
(additive group)
by 1
0
J
CHAPTER 4
Groups Acting on Sets
Denition and examples
DEFINITION 4.1 Let X be a set and let G be a group. A left action of G on X is a mapping
(g. .) g.: GX X such that
(a) 1. =., for all . X:
(b) (g
1
g
2
). =g
1
(g
2
.), all g
1
, g
2
G, . X.
A set together with a (left) action of G is called a (left) Gset. An action is trivial if g. =.
for all g G.
The conditions imply that, for each g G, left translation by g,
g
1
: X X. . g..
has (g
1
)
1
as an inverse, and therefore g
1
is a bijection, i.e., g
1
Sym(X). Axiom (b)
now says that
g g
1
: G Sym(X) (18)
is a homomorphism. Thus, from a left action of G on X, we obtain a homomorphism
G Sym(X): conversely, every such homomorphism denes an action of G on X. The
action is said to be faithful (or effective) if the homomorphism (18) is injective, i.e., if
g. =. for all . X == g =1.
EXAMPLE 4.2 (a) Every subgroup of the symmetric group S
n
acts faithfully on {1. 2. .... n].
(b) Every subgroup H of a group G acts faithfully on G by left translation,
H G G. (h. .) h..
(c) Let H be a subgroup of G. The group G acts on the set of left cosets of H,
GG,H G,H. (g. C) gC.
The action is faithful if, for example, H =G and G is simple.
(d) Every group G acts on itself by conjugation,
GG G. (g. .)
.
def
=g.g
1
.
57
58 4. GROUPS ACTING ON SETS
For any normal subgroup N, G acts on N and G,N by conjugation.
(e) For any group G, Aut(G) acts on G.
(f) The group of rigid motions of 1
n
is the group of bijections 1
n
1
n
preserving
lengths. It acts on 1
n
on the left.
A right action X G G is dened similarly. To turn a right action into a left action,
set g + . = .g
1
. For example, there is a natural right action of G on the set of right
cosets of a subgroup H in G, namely, (C. g) Cg, which can be turned into a left action
(g. C) Cg
1
.
A map of Gsets (alternatively, a Gmap or a Gequivariant map) is a map : X Y
such that
(g.) =g(.). all g G. . X.
An isomorphism of Gsets is a bijective Gmap; its inverse is then also a Gmap.
ORBITS
Let G act on X. A subset S X is said to be stable under the action of G if
g G. . S == g. S.
The action of G on X then induces an action of G on S.
Write . 
G
, if , = g., some g G. This relation is reexive because . = 1.,
symmetric because
, =g. == . =g
1
,
(multiply by g
1
on the left and use the axioms), and transitive because
, =g.. : =g
t
, == : =g
t
(g.) =(g
t
g)..
It is therefore an equivalence relation. The equivalence classes are called Gorbits. Thus
the Gorbits partition X. Write G\X for the set of orbits.
By denition, the Gorbit containing .
0
is
G.
0
={g.
0
[ g G].
It is the smallest Gstable subset of X containing .
0
.
EXAMPLE 4.3 (a) Suppose G acts on X, and let G be an element of order n. Then the
orbits of () are the sets of the form
{.
0
. .
0
. . . . .
n1
.
0
].
(These elements need not be distinct, and so the set may contain fewer than n elements.)
(b) The orbits for a subgroup H of G acting on G by left multiplication are the right
cosets of H in G. We write H\G for the set of right cosets. Similarly, the orbits for H
acting by right multiplication are the left cosets, and we write G,H for the set of left cosets.
Note that the group law on G will not induce a group law on G,H unless H is normal.
(c) For a group G acting on itself by conjugation, the orbits are called conjugacy
classes: for . G, the conjugacy class of . is the set
{g.g
1
[ g G]
Denition and examples 59
of conjugates of .. The conjugacy class of .
0
always contains .
0
, and it consists only of .
0
if and only if .
0
is in the centre of G. In linear algebra the conjugacy classes in G =GL
n
(k)
are called similarity classes, and the theory of rational canonical forms provides a set of
representatives for the conjugacy classes: two matrices are similar (conjugate) if and only
if they have the same rational canonical form.
Note that a subset of X is stable if and only if it is a union of orbits. For example, a
subgroup H of G is normal if and only if it is a union of conjugacy classes.
The action of G on X is said to be transitive, and G is said to act transitively on X,
if there is only one orbit, i.e., for any two elements . and , of X, there exists a g G
such that g. = ,. The set X is then called a homogeneous Gset. For example, S
n
acts
transitively on {1. 2. ...n]. For any subgroup H of a group G, G acts transitively on G,H,
but the action of G on itself is never transitive if G =1 because {1] is always a conjugacy
class.
The action of G on X is doubly transitive if for any two pairs (.
1
. .
2
), (,
1
. ,
2
) of
elements of X with .
1
=.
2
and ,
1
=,
2
, there exists a (single) g G such that g.
1
=,
1
and g.
2
=,
2
. Dene kfold transitivity for k _3 similarly.
STABILIZERS
Let G act on X. The stabilizer (or isotropy group) of an element . X is
Stab(.) ={g G [ g. =.].
It is a subgroup, but it need not be a normal subgroup (see the next lemma). The action is
free if Stab(.) ={e] for all ..
LEMMA 4.4 For any g G and . X,
Stab(g.) =g Stab(.) g
1
.
PROOF. Certainly, if g
t
. =., then
(gg
t
g
1
)g. =gg
t
. =g. =,.
and so g Stab(.) g
1
Stab(g.). Conversely, if g
t
(g.) =g., then
(g
1
g
t
g). =g
1
g
t
(g.) =g
1
, =..
and so g
1
g
t
g Stab(.), i.e., g
t
g Stab(.) g
1
.
2
Clearly
_
xA
Stab(.) =Ker(G Sym(X)).
which is a normal subgroup of G. The action is faithful if and only if
_
Stab(.) ={1].
EXAMPLE 4.5 (a) Let G act on itself by conjugation. Then
Stab(.) ={g G [ g. =.g].
60 4. GROUPS ACTING ON SETS
This group is called the centralizer C
G
(.) of . in G. It consists of all elements of G that
commute with, i.e., centralize, .. The intersection
_
xG
C
G
(.) ={g G [ g. =.g for all . G]
is the centre of G.
(b) Let G act on G,H by left multiplication. Then Stab(H) =H, and the stabilizer of
gH is gHg
1
.
(c) Let G be the group of rigid motions of 1
n
(4.2f). The stabilizer of the origin is the
orthogonal group O
n
for the standard positive denite form on 1
n
(Artin 1991, Chap. 4,
5.16). Let T .(1
n
. ) be the subgroup of G of translations of 1
n
, i.e., maps of the form
0
some
0
1
n
. Then T is a normal subgroup of G and G .T O (cf. Artin
1991, Chap. 5, 2).
For a subset S of X, we dene the stabilizer of S to be
Stab(S) ={g G [ gS =S].
Then Stab(S) is a subgroup of G, and the same argument as in the proof of (4.4) shows that
Stab(gS) =g Stab(S) g
1
.
EXAMPLE 4.6 Let G act on G by conjugation, and let H be a subgroup of G. The stabi
lizer of H is called the normalizer N
G
(H) of H in G:
N
G
(H) ={g G [ gHg
1
=H].
Clearly N
G
(H) is the largest subgroup of G containing H as a normal subgroup.
It is possible for gS S but g Stab(S) (see 1.33).
TRANSITIVE ACTIONS
PROPOSITION 4.7 If G acts transitively on X, then for any .
0
X, the map
gStab(.
0
) g.
0
: G,Stab(.
0
) X
is an isomorphism of Gsets.
PROOF. It is welldened because, if h Stab(.
0
), then gh.
0
=g.
0
. It is injective because
g.
0
=g
t
.
0
== g
1
g
t
.
0
=.
0
== g. g
t
lie in the same left coset of Stab(.
0
).
It is surjective because G acts transitively. Finally, it is obviously Gequivariant.
2
Thus every homogeneous Gset X is isomorphic to G,H for some subgroup H of G,
but such a realization of X is not canonical: it depends on the choice of .
0
X. To say
this another way, the Gset G,H has a preferred point, namely, the coset H; to give a
homogeneous Gset X together with a preferred point is essentially the same as to give a
subgroup of G.
Denition and examples 61
COROLLARY 4.8 Let G act on X, and let O =G.
0
be the orbit containing .
0
. Then the
cardinality of O is
[O[ =(G : Stab(.
0
)). (19)
For example, the number of conjugates gHg
1
of a subgroup H of G is (G: N
G
(H)).
PROOF. The action of G on O is transitive, and so g g.
0
denes a bijection G,Stab(.
0
)
G.
0
.
2
The equation (19) is frequently useful for computing [O[.
PROPOSITION 4.9 Let .
0
X. If G acts transitively on X, then
Ker(G Sym(X))
is the largest normal subgroup contained in Stab(.
0
).
PROOF. When
Ker(G Sym(X)) =
_
xA
Stab(.) =
_
G
Stab(g.
0
)
(4.4)
=
_
g Stab(.
0
) g
1
.
Hence, the proposition is a consequence of the following lemma.
2
LEMMA 4.10 For any subgroup H of a group G,
_
G
gHg
1
is the largest normal
subgroup contained in H.
PROOF. Note that N
0
def
=
_
G
gHg
1
, being an intersection of subgroups, is itself a sub
group. It is normal because
g
1
N
0
g
1
1
=
_
G
(g
1
g)N
0
(g
1
g)
1
=N
0
for the second equality, we used that, as g runs over the elements of G, so also does
g
1
g. Thus N
0
is a normal subgroup of G contained in eHe
1
=H. If N is a second such
group, then
N =gNg
1
gHg
1
for all g G, and so
N
_
G
gHg
1
=N
0
.
2
THE CLASS EQUATION
When X is nite, it is a disjoint union of a nite number of orbits:
X =
n
_
i=1
O
i
(disjoint union).
Hence:
62 4. GROUPS ACTING ON SETS
PROPOSITION 4.11 The number of elements in X is
[X[ =
n
i=1
[O
i
[ =
n
i=1
(G : Stab(.
i
)). .
i
in O
i
. (20)
When G acts on itself by conjugation, this formula becomes:
PROPOSITION 4.12 (CLASS EQUATION)
[G[ =
(G : C
G
(.)) (21)
(. runs over a set of representatives for the conjugacy classes), or
[G[ =[7(G)[
(G : C
G
(,)) (22)
(, runs over set of representatives for the conjugacy classes containing more than one ele
ment).
THEOREM 4.13 (CAUCHY) If the prime divides [G[, then G contains an element of
order .
PROOF. We use induction on [G[. If for some , not in the centre of G, does not divide
(G : C
G
(,)), then [C
G
(,) and we can apply induction to nd an element of order
in C
G
(,). Thus we may suppose that divides all of the terms (G : C
G
(,)) in the class
equation (second form), and so also divides 7(G). But 7(G) is commutative, and it follows
from the structure theorem
1
of such groups that 7(G) will contain an element of order .
2
COROLLARY 4.14 A nite group G is a group if and only if every element has order a
power of .
PROOF. If [G[ is a power of , then Lagranges theorem (1.26) shows that the order of
every element is a power of . The converse follows from Cauchys theorem.
2
COROLLARY 4.15 Every group of order 2, an odd prime, is cyclic or dihedral.
PROOF. From Cauchys theorem, we know that such a G contains elements s and r of or
ders 2 and respectively. Let H =(r). Then H is of index 2, and so is normal. Obviously
s H, and so G =H LHs :
G ={1. r. . . . . r
]1
. s. rs. . . . . r
]1
s].
As H is normal, srs
1
=r
i
, some i . Because s
2
=1, r =s
2
rs
2
=s(srs
1
)s
1
=r
i
2
,
and so i
2
1 mod . Because Z,Z is a eld, its only elements with square 1 are 1, and
so i 1 or 1 mod . In the rst case, the group is commutative (any group generated by
a set of commuting elements is obviously commutative); in the second srs
1
= r
1
and
we have the dihedral group (2.9).
2
1
Here is a direct proof that the theorem holds for an abelian group 7. We use induction on the order of 7.
It sufces to show that 7 contains an element whose order is divisible by . because then some power of the
element will have order exactly . Let g =1 be an element of 7. If doesnt divide the order of g, then it
divides the order of 7,(g), in which case there exists (by induction) an element of G whose order in 7,(g) is
divisible by . But the order of such an element must itself be divisible by .
Denition and examples 63
GROUPS
THEOREM 4.16 Every nontrivial nite group has nontrivial centre.
PROOF. By assumption, (G : 1) is a power of , and so (G : C
G
(,)) is power of (=
0
)
for all , not in the centre of G. As divides every term in the class equation (22) except
(perhaps) [7(G)[, it must divide [7(G)[ also.
2
COROLLARY 4.17 A group of order
n
has normal subgroups of order
n
for all m_n.
PROOF. We use induction on n. The centre of G contains an element g of order , and so
N =(g) is a normal subgroup of G of order . Now the induction hypothesis allows us to
assume the result for G,N. and the correspondence theorem (1.47) then gives it to us for
G.
2
PROPOSITION 4.18 Every group of order
2
is commutative, and hence is isomorphic to
C
]
C
]
or C
]
2.
PROOF. We know that the centre 7 is nontrivial, and that G,7 therefore has order 1 or .
In either case it is cyclic, and the next result implies that G is commutative.
2
LEMMA 4.19 Suppose G contains a subgroup H in its centre (hence H is normal) such
that G,H is cyclic. Then G is commutative.
PROOF. Let a be an element of G whose image in G,H generates it. Then every element
of G can be written g =a
i
h with h H, i Z. Now
a
i
h a
i
0
h
t
=a
i
a
i
0
hh
t
because H 7(G)
=a
i
0
a
i
h
t
h
=a
i
0
h
t
a
i
h.
2
REMARK 4.20 The above proof shows that if H 7(G) and G contains a set of repre
sentatives for G,H whose elements commute, then G is commutative.
For odd, it is now not difcult to show that any noncommutative group of order
3
is isomorphic to exactly one of the groups constructed in (3.14, 3.15) (Exercise 44). Thus,
up to isomorphism, there are exactly two noncommutative groups of order
3
.
EXAMPLE 4.21 Let G be a noncommutative group of order 8. Then G must contain an
element a of order 4 (see Exercise 16). If G contains an element b of order 2 not in
(a), then G . (a)
0
(b) where 0 is the unique isomorphism Z,2Z (Z,4Z)
, and so
G ~ D
4
. If not, any element b of G not in (a) must have order 4, and a
2
= b
2
. Now
bab
1
is an element of order 4 in (a). It cant equal a, because otherwise G would be
commutative, and so bab
1
=a
3
. Therefore G is the quaternion group (1.18, 2.7b).
64 4. GROUPS ACTING ON SETS
ACTION ON THE LEFT COSETS
The action of G on the set of left cosets G,H of H in G is a very useful tool in the study
of groups. We illustrate this with some examples.
Let X =G,H. Recall that, for any g G,
Stab(gH) =gStab(H)g
1
=gHg
1
and the kernel of
G Sym(X)
is the largest normal subgroup
_
G
gHg
1
of G contained in H.
REMARK 4.22 (a) Let H be a subgroup of G not containing a normal subgroup of G other
than 1. Then G Sym(G,H) is injective, and we have realized G as a subgroup of a
symmetric group of order much smaller than (G : 1). For example, if G is simple, then the
Sylow theorems (see Chapter 5) show that G has many proper subgroups H =1 (unless G
is cyclic), but (by denition) it has no such normal subgroup.
(b) If (G : 1) does not divide (G : H), then
G Sym(G,H)
cant be injective (Lagranges theorem, 1.26), and we can conclude that H contains a nor
mal subgroup =1 of G. For example, if G has order 99, then it will have a subgroup N of
order 11 (Cauchys theorem, 4.13), and the subgroup must be normal. In fact, G =N Q.
EXAMPLE 4.23 Corollary 4.15 shows that every group G of order 6 is either cyclic or
dihedral. Here we present a slightly different argument. According to Cauchys theorem
(4.13), G must contain an element r of order 3 and an element s of order 2. Moreover
N
def
= (r) must be normal because 6 doesnt divide 2 (or simply because it has index 2).
Let H = (s). Either (a) H is normal in G, or (b) H is not normal in G. In the rst
case, rsr
1
= s, i.e., rs = sr, and so G . (r) (s) ~ C
2
C
3
. In the second case,
G Sym(G,H) is injective, hence surjective, and so G ~S
3
~D
3
.
Permutation groups
Consider Sym(X) where X has n elements. Since (up to isomorphism) a symmetry group
Sym(X) depends only on the number of elements in X, we may take X = {1. 2. . . . . n],
and so work with S
n
. The symbol
_
1 2 3 4 5 6 T
2 5 T 4 3 1 6
_
denotes the permutation sending 1 2,
2 5, 3 7, etc..
Consider a permutation
o =
_
1 2 3 . . . n
o(1) o(2) o(3) . . . o(n)
_
.
The pairs (i. ) with i < and o(i ) > o( ) are called the inversions of o, and o is said
to be even or odd according as the number its inversions is even or odd.. The signature,
sign(o), of o is 1 or 1 according as o is even or odd. For example, sign(o) =1 if o is
a transposition.
Permutation groups 65
REMARK 4.24 To compute the signature of o, connect (by a line) each element i in the top
row to the element i in the bottom row, and count the number of times that the lines cross:
o is even or odd according as this number is even or odd. For example,
1 2 3 4 5
3 5 1 4 2
is even (6 intersections). This works, because there is one crossing for each inversion.
For a permutation o, consider the products
V =
1_i~}_n
( i ) = (21)(31) (n1)
(32) (n2)
(n(n1))
oV =
1_i~}_n
(o( ) o(i )) = (o(2) o(1))(o(3) o(1)) (o(n) o(1))
(o(3) o(2)) (o(n) o(2))
(o(n) o(n1)).
The terms in the products are the same except that each inversion introduces a negative
sign.
2
Therefore,
oV =sign(o)V.
Now let 1 be the additive group of maps Z
n
Z. For 1 and o S
n
, let o be
the element of 1 dened by
(o )(:
1
. . . . . :
n
) =(:
c(1)
. . . . . :
c(n)
).
For o. t S
n
, one nds that
3
o(t ) =(ot). (23)
Let be the element of 1 dened by
(:
1
. . . . . :
n
) =
1_i~}_n
(:
}
:
i
).
The same argument as above shows that
o =sign(o).
On putting = in (23) and using that =0, one nds that
sign(o)sign(t) =sign(ot).
Therefore, sign is a homomorphism S
n
{1]. When n _ 2, it is surjective, and so its
kernel is a normal subgroup of S
n
of order
n
2
, called the alternating group
n
.
2
Each is a product over the 2element subsets of {1. 2. . . . . n]; the factor corresponding to the subset {i. ]
is ( i ).
3
For . Z
n
and o S
n
, let .
c
be the element of Z
n
such that (.
c
)
i
= .
c(i)
. Then (.
c
)
r
= .
cr
. By
denition, (o )(.) =(.
c
). Therefore
(o(t ))(.) =(t )(.
c
) =((.
c
)
r
) =(.
cr
) =((ot) )(.).
66 4. GROUPS ACTING ON SETS
REMARK 4.25 Clearly sign is the unique homomorphism S
n
{1] such that sign(o) =
1 for every transposition o. Now let G = Sym(X) where X is a set with n elements.
Once we have chosen an ordering of X, we can speak of the inversions of an element o of
G. Dene c(o) to be 1 or 1 according as o has an even or an odd number of inversions.
The same arguments as above show that c is the unique homomorphism G {1] such
that c(o) = 1 for every transposition o. In particular, it is independent of the choice of
the ordering. In other words, the parity of the number of inversions of o is independent of
the choice of the ordering on X. Can you prove this directly?
A cycle is a permutation of the following form
i
1
i
2
i
3
i
i
i
1
. remaining i s xed.
The i
}
are required to be distinct. We denote this cycle by (i
1
i
2
...i
i
), and call r its length
note that r is also its order as an element of S
n
. A cycle of length 2 is a transposition.
A cycle (i ) of length 1 is the identity map. The support of the cycle (i
1
. . . i
i
) is the set
{i
1
. . . . . i
i
], and cycles are said to be disjoint if their supports are disjoint. Note that disjoint
cycles commute. If
o =(i
1
...i
i
)(
1
...
x
) (l
1
...l
u
) (disjoint cycles).
then
o
n
=(i
1
...i
i
)
n
(
1
...
x
)
n
(l
1
...l
u
)
n
(disjoint cycles).
and it follows that o has order lcm(r. s. .... u).
PROPOSITION 4.26 Every permutation can be written (in essentially one way) as a product
of disjoint cycles.
PROOF. Let o S
n
, and let O {1. 2. . . . . n] be an orbit for (o). If [O[ =r, then for any
i O.
O ={i. o(i ). . . . . o
i1
(i )].
Therefore o and the cycle (i o(i ) . . . o
i1
(i )) have the same action on any element of O.
Let
{1. 2. . . . . n] =
n
_
}=1
O
}
be the decomposition of {1. . . . . n] into a disjoint union of orbits for (o), and let ;
}
be the
cycle associated (as above) with O
}
. Then
o =;
1
;
n
is a decomposition of o into a product of disjoint cycles. For the uniqueness, note that
a decomposition o = ;
1
;
n
into a product of disjoint cycles must correspond to a de
composition of {1. .... n] into orbits (ignoring cycles of length 1 and orbits with only one
element). We can drop cycles of length one, change the order of the cycles, and change how
we write each cycle (by choosing different initial elements), but thats all because the orbits
are intrinsically attached to o.
2
Permutation groups 67
For example,
_
1 2 3 4 5 6 7 8
5 7 4 2 1 3 6 8
_
=(15)(27634)(8). (24)
It has order lcm(2. 5) =10.
COROLLARY 4.27 Each permutation o can be written as a product of transpositions; the
number of transpositions in such a product is even or odd according as o is even or odd.
PROOF. The cycle
(i
1
i
2
...i
i
) =(i
1
i
2
) (i
i2
i
i1
)(i
i1
i
i
).
and so the rst statement follows from the proposition. Because sign is a homomorphism,
and the signature of a transposition is 1, sign(o) =(1)
#transpositions
.
2
Note that the formula in the proof shows that the signature of a cycle of length r is
(1)
i1
, that is, an rcycle is even or odd according as r is odd or even.
It is possible to dene a permutation to be even or odd according as it is a product of an
even or odd number of transpositions, but then one has to go through an argument as above
to show that this is a welldened notion.
The corollary says that S
n
is generated by transpositions. For
n
there is the following
result.
COROLLARY 4.28 The alternating group
n
is generated by cycles of length three.
PROOF. Any o
n
is the product (possibly empty) of an even number of transpositions,
o =t
1
t
t
1
t
n
t
t
n
, but the product of two transpositions can always be written as a product
of 3cycles:
(i )(kl) =
_
_
(i )(l) =(il) case =k.
(i )(k)(k)(kl) =(ik)(kl) case i. . k. l distinct,
1 case (i ) =(kl).
2
Recall that two elements a and b of a group G are said to be conjugate a  b if there
exists an element g G such that b =gag
1
, and that conjugacy is an equivalence relation.
For a group G, it is useful to determine the conjugacy classes in G.
EXAMPLE 4.29 In S
n
, the conjugate of a cycle is given by:
g(i
1
. . . i
k
)g
1
=(g(i
1
). . . g(i
k
)).
Hence g(i
1
. . . i
i
) (l
1
. . . l
u
)g
1
= (g(i
1
). . . g(i
i
)) (g(l
1
)...g(l
u
)) (even if the cycles
are not disjoint, because conjugation is a homomorphism). In other words, to obtain gog
1
,
replace each element in each cycle of o by its image under g.
We shall now determine the conjugacy classes in S
n
. By a partition of n, we mean a
sequence of integers n
1
. . . . . n
k
such that
1 _n
1
_n
2
_ _n
k
_n and
n
1
n
2
n
k
=n.
68 4. GROUPS ACTING ON SETS
For example, there are exactly 5 partitions of 4, namely,
4 =1111. 4 =112. 4 =13. 4 =22. 4 =4.
and 1. 121. 505 partitions of 61. Note that a partition
{1. 2. .... n] =O
1
L... LO
k
(disjoint union)
of {1. 2. . . . . n] determines a partition of n,
n =n
1
n
2
... n
k
. n
i
=[O
i
[.
provided the numbering has been chosen so that [O
i
[ _ [O
i1
[. Since the orbits of an
element o of S
n
form a partition of {1. . . . . n], we can attach to each such o a partition of
n. For example, the partition of 8 attached to (15)(27634)(8) is 1. 2. 5 and the partition
attached to n attached to
o =(i
1
. . . i
n
1
) (l
1
. . . l
n
k
). (disjoint cycles) 1 < n
i
_n
i1
.
is 1. 1. . . . . 1. n
1
. . . . . n
k
(n
n
i
ones).
PROPOSITION 4.30 Two elements o and t of S
n
are conjugate if and only if they dene
the same partitions of n.
PROOF. ==: We saw in (4.29) that conjugating an element preserves the type of its dis
joint cycle decomposition.
==: Since o and t dene the same partitions of n, their decompositions into products
of disjoint cycles have the same type:
o =(i
1
. . . i
i
)(
1
. . .
x
). . . (l
1
. . . l
u
).
t =(i
t
1
. . . i
t
i
)(
t
1
. . .
t
x
). . . (l
t
1
. . . l
t
u
).
If we dene g to be
_
i
1
i
i
1
x
l
1
l
u
i
t
1
i
t
i
t
1
t
x
l
t
1
l
t
u
_
.
then
gog
1
=t.
2
EXAMPLE 4.31 (ik) =(
1234...
i}k4...
)(123)(
1234...
i}k4...
)
1
.
REMARK 4.32 For 1 < k _ n, there are
n(n1)(nk1)
k
distinct kcycles in S
n
. The
1
k
is
needed so that we dont count
(i
1
i
2
. . . i
k
) =(i
k
i
1
. . . i
k1
) =. . .
k times. Similarly, it is possible to compute the number of elements in any conjugacy
class in S
n
, but a little care is needed when the partition of n has several terms equal. For
example, the number of permutations in S
4
of type (ab)(cJ) is
1
2
_
43
2
21
2
_
=3.
Permutation groups 69
The
1
2
is needed so that we dont count (ab)(cJ) = (cJ)(ab) twice. For S
4
we have the
following table:
Partition Element No. in Conj. Class Parity
1111 1 1 even
112 (ab) 6 odd
13 (abc) 8 even
22 (ab)(cJ) 3 even
4 (abcJ) 6 odd
Note that
4
contains exactly 3 elements of order 2, namely those of type 2 2, and that
together with 1 they form a subgroup V . This group is a union of conjugacy classes, and is
therefore a normal subgroup of S
4
.
THEOREM 4.33 (GALOIS) The group
n
is simple if n _5
REMARK 4.34 For n =2,
n
is trivial, and for n =3,
n
is cyclic of order 3, and hence
simple; for n =4 it is nonabelian and nonsimple it contains the normal, even character
istic, subgroup V (see 4.32).
LEMMA 4.35 Let N be a normal subgroup of
n
(n _ 5); if N contains a cycle of length
three, then it contains all cycles of length three, and so equals
n
(by 4.28).
PROOF. Let ; be the cycle of length three in N, and let o be a second cycle of length three
in
n
. We know from (4.30) that o =g;g
1
for some g S
n
. If g
n
, then this shows
that o is also in N. If not, because n _ 5, there exists a transposition t S
n
disjoint from
o. Then tg
n
and
o =t ot
1
=tg;g
1
t
1
.
and so again o N.
2
The next lemma completes the proof of the Theorem.
LEMMA 4.36 Every normal subgroup N of
n
, n _ 5, N =1, contains a cycle of length
3.
PROOF. Let o N, o =1. If o is not a 3cycle, we shall construct another element o
t
N,
o
t
=1, which xes more elements of {1. 2. . . . . n] than does o. If o
t
is not a 3cycle, then
we can apply the same construction. After a nite number of steps, we arrive at a 3cycle.
Suppose o is not a 3cycle. When we express it as a product of disjoint cycles, either it
contains a cycle of length _3 or else it is a product of transpositions, say
(i) o =(i
1
i
2
i
3
...) or
(ii) o =(i
1
i
2
)(i
3
i
4
) .
In the rst case, o moves two numbers, say i
4
, i
5
, other than i
1
, i
2
, i
3
, because o =
(i
1
i
2
i
3
), (i
1
. . . i
4
). Let ; =(i
3
i
4
i
5
). Then o
1
def
=;o;
1
=(i
1
i
2
i
4
. . .) N, and is distinct
from o (because it acts differently on i
2
). Thus o
t
def
=o
1
o
1
=1, but o
t
=;o;
1
o
1
xes
i
2
and all elements other than i
1
. .... i
5
xed by o it therefore xes more elements than
o.
70 4. GROUPS ACTING ON SETS
In the second case, form ;, o
1
, o
t
as in the rst case with i
4
as in (ii) and i
5
any
element distinct from i
1
. i
2
. i
3
. i
4
. Then o
1
= (i
1
i
2
)(i
4
i
5
) is distinct from o because
it acts differently on i
4
. Thus o
t
= o
1
o
1
= 1, but o
t
xes i
1
and i
2
, and all elements
=i
1
. .... i
5
not xed by o it therefore xes at least one more element than o.
2
COROLLARY 4.37 For n _5, the only normal subgroups of S
n
are 1.
n
, and S
n
.
PROOF. If N is normal in S
n
, then N
n
is normal in
n
. Therefore either N
n
=
n
or N
n
={1]. In the rst case, N
n
, which has index 2 in S
n
, and so N =
n
or
S
n
. In the second case, the map . .
n
: N S
n
,
n
is injective, and so N has order 1
or 2, but it cant have order 2 because no conjugacy class in S
n
(other than {1]) consists of
a single element.
2
ASIDE 4.38 There exists a description of the conjugacy classes in
n
, from which it is possible to
deduce its simplicity for n _5 (see Exercise 412).
ASIDE 4.39 A group G is said to be solvable if there exist subgroups
G =G
0
G
1
G
i1
G
i
G
i
={1]
such that each G
i
is normal in G
i1
and each quotient G
i1
,G
i
is commutative. Thus
n
(also S
n
)
is not solvable if n _5. Let (X) X be of degree n.
In Galois theory, one attaches to a subgroup G
(
of the group of permutations of the roots
of , and shows that the roots of can be obtained from the coefcients of by the algebraic
operations of addition, subtraction, multiplication, division, and the extraction of mth roots if and
only if G
(
is solvable (Galoiss theorem). For every n, there exist lots of polynomials of degree
n with G
(
~S
n
, and hence (when n _5) lots of polynomials not solvable in radicals.
The ToddCoxeter algorithm.
Let G be a group described by a nite presentation, and let H be a subgroup described by a
generating set. Then the ToddCoxeter algorithm
4
is a strategy for writing down the set of
left cosets of H in G together with the action of G on the set. I illustrate it with an example
(from Artin 1991, 6.9, which provides more details, but note that he composes permutations
in the reverse direction from us).
Let G = (a. b. c [ a
3
. b
2
. c
2
. cba) and let H be the subgroup generated by c (strictly
speaking, H is the subgroup generated by the element of G represented by the reduced
word c). The operation of G on the set of cosets is described by the action of the generators,
which must satisfy the following rules:
(i) Each generator (a. b. c in our example) acts as a permutation.
(ii) The relations (a
3
. b
2
. c
2
. cba in our example) act trivially.
(iii) The generators of H (c in our example) x the coset 1H.
(iv) The operation on the cosets is transitive.
4
To solve a problem, an algorithm must always terminate in a nite time with the correct answer to the
problem. The ToddCoxeter algorithm does not solve the problem of determining whether a nite presentation
denes a nite group (in fact, there is no such algorithm). It does, however, solve the problem of determining
the order of a nite group from a nite presentation of the group (use the algorithm with H the trivial subgroup
1.)
Primitive actions. 71
The strategy is to introduce cosets, denoted 1. 2. . . . with 1 =1H, as necessary.
Rule (iii) tells us simply that c1 = c. We now apply the rst two rules. Since we
dont know what a1 is, lets denote it 2: a1 = 2. Similarly, let a2 = 3. Now a3 = a
3
1,
which according to (ii) must be 1. Thus, we have introduced three (potential) cosets 1, 2, 3,
permuted by a as follows:
1
o
2
o
3
o
1.
What is b1? We dont know, and so it is prudent to introduce another coset 4 =b1. Now
b4 =1 because b
2
=1, and so we have
1
b
4
b
1.
We still have the relation cba. We know a1 =2, but we dont know what b2 is, and so we
set b2 =5:
1
o
2
b
5.
By (iii) c1 =1, and by (ii) applied to cba we have c5 =1. Therefore, according to (i) we
must have 5 =1; we drop 5, and so now b2 =1. Since b4 =1 we must have 4 =2, and so
we can drop 4 also. What we know can be summarized by the table:
a a a b b c c a b c
1 2 3 1 2 1 1 1 2 1 1
2 3 1 2 1 2 2 3 2
3 1 2 3 3 3 1 2 3
The bottom right corner, which is forced by (ii), tells us that c2 = 3. Hence also c3 = 2,
and this then determines the rest of the table:
a a a b b c c a b c
1 2 3 1 2 1 1 1 2 1 1
2 3 1 2 1 2 3 2 3 3 2
3 1 2 3 3 3 2 3 1 2 3
We nd that we have three cosets on which a. b. c act as
a =(123) b =(12) c =(23).
More precisely, we have written down a map G S
3
that is consistent with the above
rules. A theorem (Artin 1991, 9.10) now says that this does in fact describe the action of
G on G,H. Since the three elements (123), (12), and (23) generate S
3
, this shows that the
action of G on G,H induces an isomorphism G S
3
, and that H is a subgroup of order
2.
In Artin 1991, 6.9, it is explained how to make this procedure into an algorithm which,
when it succeeds in producing a consistent table, will in fact produce the correct table.
This algorithm is implemented in GAP.
Primitive actions.
Let G be a group acting on a set X, and let be a partition of X. We say that is stabilized
by G if
== g .
It sufces to check the condition for a set of generators for G.
72 4. GROUPS ACTING ON SETS
EXAMPLE 4.40 (a) The subgroup G=((1234)) of S
4
stabilizes the partition {{1. 3]. {2. 4]]
of {1. 2. 3. 4].
(b) Identify X = {1. 2. 3. 4] with the set of vertices of the square on which D
4
acts
in the usual way, namely, with r = (1234), s = (2. 4). Then D
4
stabilizes the partition
{{1. 3]. {2. 4]] (opposite vertices stay opposite).
(c) Let X be the set of partitions of {1. 2. 3. 4] into two sets, each with two elements.
Then S
4
acts on X, and Ker(S
4
Sym(X)) is the subgroup V dened in (4.32).
The group G always stabilizes the trivial partitions of X, namely, the set of all one
element subsets of X, and {X]. When it stabilizes only those partitions, we say that the
action is primitive; otherwise it is imprimitive. A subgroup of Sym(X) (e.g., of S
n
) is said
to be primitive if it acts primitively on X. Obviously, S
n
itself is primitive, but Example
4.40b shows that D
4
, regarded as a subgroup of S
4
in the obvious way, is not primitive.
EXAMPLE 4.41 A doubly transitive action is primitive: if it stabilized
{{.. .
t
. ...]. {,. ...]...],
then there would be no element sending (.. .
t
) to (.. ,).
REMARK 4.42 The Gorbits form a partition of X that is stabilized by G. If the action is
primitive, then the partition into orbits must be one of the trivial ones. Hence
action primitive == action transitive or trivial.
For the remainder of this section, G is a nite group acting transitively on a set X with at
least two elements.
PROPOSITION 4.43 The group G acts imprimitively if and only if there is a proper subset
of X with at least 2 elements such that,
for each g G, either g = or g =0. (25)
PROOF. ==: The partition stabilized by G contains such an .
==: From such an , we can form a partition {. g
1
. g
2
. ...] of X, which is stabi
lized by G.
2
A subset of X satisfying (25) is called block.
PROPOSITION 4.44 Let be a block in X with [[ _2 and =X. For any . ,
Stab(.) _Stab() _G.
PROOF. We have Stab() Stab(.) because
g. =. == g =0 == g =.
Let , , , = .. Because G acts transitively on X, there is a g G such that g. = ,.
Then g Stab(), but g Stab(.).
Let , . There is a g G such that g. =,, and then g Stab().
2
Exercises 73
THEOREM 4.45 The group G acts primitively on X if and only if, for one (hence all) . in
X, Stab(.) is a maximal subgroup of G.
PROOF. If G does not act primitively on X, then (see 4.43) there is a block _X with at
least two elements, and so (4.44) shows that Stab(.) will not be maximal for any . .
Conversely, suppose that there exists an . in X and a subgroup H such that
Stab(.) _H _G.
Then I claim that =H. is a block =X with at least two elements.
Because H =Stab(.), H. ={.], and so {.] _ _X.
If g H, then g =. If g H, then g is disjoint from : for suppose gh. =h
t
.
some h
t
H; then h
t1
gh Stab(.) H, say h
t1
gh =h
tt
, and g =h
t
h
tt
h
1
H.
2
Exercises
41 Let H
1
and H
2
be subgroups of a group G. Show that the maps of Gsets G,H
1
G,H
2
are in natural onetoone correspondence with the elements gH
2
of G,H
2
such that
H
1
gH
2
g
1
.
42 (a) Show that a nite group G cant be equal to the union of the conjugates of a proper
subgroup H.
(b) Show that (a) holds for an innite group G provided that (G: H) is nite.
(c) Give an example to show that (a) fails in general for innite groups.
(d) Give an example of a proper subset S of a nite group G such that G=
_
G
gSg
1
.
43 Show that any set of representatives for the conjugacy classes in a nite group gener
ates the group.
44 Prove that any noncommutative group of order
3
, an odd prime, is isomorphic to
one of the two groups constructed in (3.14, 3.15).
45 Let be the smallest prime dividing (G : 1) (assumed nite). Show that any subgroup
of G of index is normal.
46 Show that a group of order 2m, m odd, contains a subgroup of index 2. (Hint: Use
Cayleys theorem 1.22)
47 For n _ 5, show that the kcycles in S
n
generate S
n
or
n
according as k is even or
odd.
48 Let G =GL
3
(F
2
).
(a) Show that (G : 1) =168.
(b) Let X be the set of lines through the origin in F
3
2
; show that X has 7 elements, and
that there is a natural injective homomorphism G Sym(X) =S
T
.
(c) Use Jordan canonical forms to show that G has six conjugacy classes, with 1, 21, 42,
56, 24, and 24 elements respectively. [Note that if M is a free F
2
module of rank
one, then End
F
2
j
(M) =F
2
.]
74 4. GROUPS ACTING ON SETS
(d) Deduce that G is simple.
49 Let G be a group. If Aut(G) is cyclic, prove that G is commutative; if further, G is
nite, prove that G is cyclic.
410 Show that S
n
is generated by (12). (13). . . . . (1n); also by (12). (23). . . . . (n1n).
411 Let 1 be a conjugacy class of a nite group G contained in a normal subgroup H
of G. Prove that 1 is a union of k conjugacy classes of equal size in H, where k =(G :
H C
G
(.)) for any . 1.
412 (a) Let o
n
. From Exercise 411 we know that the conjugacy class of o in S
n
either remains a single conjugacy class in
n
or breaks up as a union of two classes of equal
size. Show that the second case occurs o does not commute with an odd permutation
the partition of n dened by o consists of distinct odd integers.
(b) For each conjugacy class 1 in
T
, give a member of 1, and determine [1[.
413 Let G be the group with generators a. b and relations a
4
=1 =b
2
, aba =bab.
(a) Use the ToddCoxeter algorithm (with H = 1) to nd the image of G under the
homomorphism G S
n
, n =(G : 1), given by Cayleys Theorem 1.11. [No need to
include every step; just an outline will do.]
(b) Use Sage/GAP to check your answer.
414 Show that if the action of G on X is primitive and effective, then the action of any
normal subgroup H =1 of G is transitive.
415 (a) Check that
4
has 8 elements of order 3, and 3 elements of order 2. Hence it has
no element of order 6.
(b) Prove that
4
has no subgroup of order 6 (cf. 1.30). (Use 4.23.)
(c) Prove that
4
is the only subgroup of S
4
of order 12.
416 Let G be a group with a subgroup of index r. Prove:
(a) If G is simple, then (G : 1) divides r.
(b) If r =2. 3. or 4, then G cant be simple.
(c) There exists a nonabelian simple group with a subgroup of index 5.
417 Prove that S
n
is isomorphic to a subgroup of
n2
.
418 Let H and 1 be subgroups of a group G. A double coset of H and 1 in G is a set
of the form
Ha1 ={hak [ h H, k 1]
for some a G.
(a) Show that the double cosets of H and 1 in G partition G.
(b) Let H a1a
1
act on H 1 by b(h. k) =(hb. a
1
b
1
ak). Show that the orbits
for this action are exactly the bres of the map (h. k) hak: H 1 Ha1.
Exercises 75
(c) (Double coset counting formula). Use (b) to show that
[Ha1[ =
[H[[1[
[H a1a
1
[
.
CHAPTER 5
The Sylow Theorems; Applications
In this chapter, all groups are nite.
Let G be a group and let be a prime dividing (G: 1). A subgroup of G is called a
Sylow subgroup of G if its order is the highest power of dividing (G : 1). In other
words, H is a Sylow subgroup of G if it is a group and its index in G is prime to .
The Sylow theorems state that there exist Sylow subgroups for all primes dividing
(G: 1), that the Sylow subgroups for a xed are conjugate, and that every subgroup
of G is contained in such a subgroup; moreover, the theorems restrict the possible number
of Sylow subgroups in G.
The Sylow theorems
In the proofs, we frequently use that if O is an orbit for a group H acting on a set X, and
.
0
O, then the map H X, h h.
0
induces a bijection
H,Stab(.
0
) O:
see (4.7). Therefore
(H : Stab(.
0
)) =[O[.
In particular, when H is a group, [O[ is a power of : either O consists of a single
element, or [O[ is divisible by . Since X is a disjoint union of the orbits, we can conclude:
LEMMA 5.1 Let H be a group acting on a nite set X, and let X
1
be the set of points
xed by H; then
[X[ [X
1
[ (mod ).
When the lemma is applied to a group H acting on itself by conjugation, we nd that
(7(H) : 1) (H : 1) mod
and so [(7(H): 1) (cf. the proof of 4.16).
THEOREM 5.2 (SYLOW I) Let G be a nite group, and let be prime. If
i
[(G : 1), then
G has a subgroup of order
i
.
77
78 5. THE SYLOW THEOREMS; APPLICATIONS
PROOF. According to (4.17), it sufces to prove this with
i
the highest power of divid
ing (G : 1), and so from now on we assume that (G : 1) =
i
m with m not divisible by .
Let
X ={subsets of G with
i
elements].
with the action of G dened by
GX X. (g. ) g
def
={ga [ a ].
Let X, and let
H =Stab()
def
={g G [ g =].
For any a
0
, h ha
0
: H is injective (cancellation law), and so (H : 1) _[[ =
i
.
In the equation
(G : 1) =(G : H)(H : 1)
we know that (G : 1) =
i
m, (H : 1) _
i
, and that (G : H) is the number of elements in
the orbit of . If we can nd an such that doesnt divide the number of elements in its
orbit, then we can conclude that (for such an ), H =Stab has order
i
.
The number of elements in X is
[X[ =
_
i
m
i
_
=
(
i
m)(
i
m1) (
i
mi ) (
i
m
i
1)
i
(
i
1) (
i
i ) (
i
i
1)
.
Note that, because i <
i
, the power of dividing
i
mi is the power of dividing
i . The same is true for
i
i . Therefore the corresponding terms on top and bottom are
divisible by the same powers of , and so does not divide [X[. Because the orbits form a
partition of X,
[X[ =
[O
i
[. O
i
the distinct orbits.
and so at least one of the [O
i
[ is not divisible by .
2
EXAMPLE 5.3 Let F
]
= Z,Z, the eld with elements, and let G = GL
n
(F
]
). The
nn matrices in G are precisely those whose columns form a basis for F
n
]
. Thus, the rst
column can be any nonzero vector in F
n
]
, of which there are
n
1; the second column
can be any vector not in the span of the rst column, of which there are
n
; and so on.
Therefore, the order of G is
(
n
1)(
n
)(
n
2
) (
n
n1
).
and so the power of dividing (G : 1) is
12(n1)
. Consider the upper triangular
matrices with 1s down the diagonal:
_
_
_
_
_
_
_
1 + + +
0 1 + +
0 0 1 +
.
.
.
.
.
.
.
.
.
.
.
.
0 0 0 1
_
_
_
_
_
_
_
.
They form a subgroup U of order
n1
n2
, which is therefore a Sylow subgroup
G.
The Sylow theorems 79
REMARK 5.4 The theorem gives another proof of Cauchys theorem (4.13). If a prime
divides (G: 1), then G will have a subgroup H of order , and any g H, g = 1, is an
element of G of order .
REMARK 5.5 The proof of Theorem 5.2 can be modied to show directly that for each
power
i
of dividing (G : 1) there is a subgroup H of G of order
i
. One again writes
(G : 1) =
i
m and considers the set X of all subsets of order
i
. In this case, the highest
power
i
0
of dividing [X[ is the highest power of dividing m, and it follows that there
is an orbit in X whose order is not divisible by
i
0
1
. For an in such an orbit, the same
counting argument shows that Stab() has
i
elements. We recommend that the reader
write out the details.
THEOREM 5.6 (SYLOW II) Let G be a nite group, and let [G[ =
i
m with m not divisi
ble by .
(a) Any two Sylow subgroups are conjugate.
(b) Let s
]
be the number of Sylow subgroups in G; then s
]
1 mod and s
]
[m.
(c) Every subgroup of G is contained in a Sylow subgroup.
Let H be a subgroup of G. Recall (4.6, 4.8) that the normalizer of H in G is
N
G
(H) ={g G [ gHg
1
=H].
and that the number of conjugates of H in G is (G : N
G
(H)).
LEMMA 5.7 Let 1 be a Sylow subgroup of G, and let H be a subgroup. If H nor
malizes 1, i.e., if H N
G
(1), then H 1. In particular, no Sylow subgroup of G
other than 1 normalizes 1.
PROOF. Because H and 1 are subgroups of N
G
(1) with 1 normal in N
G
(1), H1 is a
subgroup, and H,H1 .H1,1 (apply 1.46). Therefore (H1 : 1) is a power of (here
is where we use that H is a group), but
(H1 : 1) =(H1 : 1)(1 : 1).
and (1 : 1) is the largest power of dividing (G : 1), hence also the largest power of
dividing (H1 : 1). Thus (H1 : 1) =
0
=1, and H 1.
2
PROOF (OF SYLOW II) (a) Let X be the set of Sylow subgroups in G, and let G act on
X by conjugation,
(g. 1) g1g
1
: GX X.
Let O be one of the Gorbits: we have to show O is all of X.
Let 1 O, and let 1 act on O through the action of G. This single Gorbit may break
up into several 1orbits, one of which will be {1]. In fact this is the only onepoint orbit
because
{Q] is a 1orbit 1 normalizes Q.
which we know (5.7) happens only for Q = 1. Hence the number of elements in every
1orbit other than {1] is divisible by , and we have that [O[ 1 mod .
80 5. THE SYLOW THEOREMS; APPLICATIONS
Suppose there exists a 1 O. We again let 1 act on O, but this time the argument
shows that there are no onepoint orbits, and so the number of elements in every 1orbit is
divisible by . This implies that #O is divisible by , which contradicts what we proved in
the last paragraph. There can be no such 1, and so O is all of X.
(b) Since s
]
is now the number of elements in O, we have also shown that s
]
1 (mod
).
Let 1 be a Sylow subgroup of G. According to (a), s
]
is the number of conjugates
of 1, which equals
(G : N
G
(1)) =
(G : 1)
(N
G
(1) : 1)
=
(G : 1)
(N
G
(1) : 1) (1 : 1)
=
m
(N
G
(1) : 1)
.
This is a factor of m.
(c) Let H be a subgroup of G, and let H act on the set X of Sylow subgroups by
conjugation. Because [X[ =s
]
is not divisible by , X
1
must be nonempty (Lemma 5.1),
i.e., at least one Horbit consists of a single Sylow subgroup. But then H normalizes 1
and Lemma 5.7 implies that H 1.
2
COROLLARY 5.8 A Sylow subgroup is normal if and only if it is the only Sylow 
subgroup.
PROOF. Let 1 be a Sylow subgroup of G. If 1 is normal, then (a) of Sylow II implies
that it is the only Sylow subgroup. The converse statement follows from (3.7c) (which
shows, in fact, that 1 is even characteristic).
2
COROLLARY 5.9 Suppose that a group G has only one Sylow subgroup for each prime
dividing its order. Then G is a direct product of its Sylow subgroups.
PROOF. Let 1
1
. . . . . 1
k
be Sylow subgroups of G, and let [1
i
[ =
i
i
i
; the
i
are distinct
primes. Because each 1
i
is normal in G, the product 1
1
1
k
is a normal subgroup of G.
We shall prove by induction on k that it has order
i
1
1
i
k
k
. If k =1, there is nothing to
prove, and so we may suppose that k _2 and that 1
1
1
k1
has order
i
1
1
i
k1
k1
. Then
1
1
1
k1
1
k
=1; therefore (1.51) shows that (1
1
1
k1
)1
k
is the direct product of
1
1
1
k1
and 1
k
, and so has order
i
1
1
i
k
k
. Now (1.52) applied to the full set of Sylow
subgroups of G shows that G is their direct product.
2
EXAMPLE 5.10 Let G =GL(V ) where V is a vector space of dimension n over F
]
. There
is a geometric description of the Sylow subgroups of G. A maximal ag J in V is a
sequence of subspaces
V =V
n
V
n1
V
i
V
1
{0]
with dimV
i
=i . Given such a ag J, let U(J) be the set of linear maps : V V such
that
(a) (V
i
) V
i
for all i , and
(b) the endomorphism of V
i
,V
i1
induced by is the identity map.
I claim that U(J) is a Sylowsubgroup of G. Indeed, we can construct a basis {e
1
. . . . . e
n
]
for V such {e
1
] is basis for V
1
, {e
1
. e
2
] is a basis for V
2
, and so on. Relative to this basis,
the matrices of the elements of U(J) are exactly the elements of the group U of (5.3).
Alternative approach to the Sylow theorems 81
Let g GL
n
(F). Then gJ
def
={gV
n
. gV
n1
. . . .] is again a maximal ag, and U(gJ) =
g U(J) g
1
. From (a) of Sylow II, we see that the Sylow subgroups of G are precisely
the groups of the form U(J) for some maximal ag J.
ASIDE 5.11 Some books use different numberings for Sylows theorems. I have essentially fol
lowed the original (Sylow 1872).
Alternative approach to the Sylow theorems
We briey forget that we have proved the Sylow theorems.
THEOREM 5.12 Let G be a group, and let 1 be a Sylow subgroup of G. For any sub
group H of G, there exists an a G such that H a1a
1
is a Sylow subgroup of H.
PROOF. Recall (Exercise 418) that G is a disjoint union of the double cosets for H and
1, and so
[G[ =
o
[Ha1[ =
o
[H[[1[
[H a1a
1
[
where the sum is over a set of representatives for the double cosets. On dividing by [1[ we
nd that
[G[
[1[
=
o
[H[
[H a1a
1
[
.
and so there exists an a such that (H: H a1a
1
) is not divisible by . For such an a,
H a1a
1
is a Sylow subgroup of H.
2
PROOF (OF SYLOW I) According to Cayleys theorem (1.22), G embeds into S
n
, and S
n
embeds into GL
n
(F
]
) (see 7.1b below). As GL
n
(F
]
) has a Sylow subgroup (see 5.3), so
also does G.
2
PROOF (OF SYLOW II(a,c)) Let 1 be a Sylowsubgroup of G, and let 1
t
be a subgroup
of G. Then 1
t
is the unique Sylow subgroup of 1
t
, and so the theorem with H = 1
t
shows that a1a
1
1
t
for some a. This implies (a) and (c) of Sylow II.
2
Examples
We apply what we have learnt to obtain information about groups of various orders.
5.13 (GROUPS OF ORDER 99) Let G have order 99. The Sylow theorems imply that G
has at least one subgroup H of order 11, and in fact s
11
99
11
and s
11
1 mod 11. It
follows that s
11
= 1, and H is normal. Similarly, s
9
[11 and s
9
1 mod 3, and so the
Sylow 3subgroup is also normal. Hence G is isomorphic to the direct product of its Sylow
subgroups (5.9), which are both commutative (4.18), and so G commutative.
Here is an alternative proof. Verify as before that the Sylow 11subgroup N of G is
normal. The Sylow 3subgroup Q maps bijectively onto G,N, and so G = N Q. It
remains to determine the action by conjugation of Q on N. But Aut(N) is cyclic of order
10 (see 3.5), and so there is only the trivial homomorphism Q Aut(N). It follows that
G is the direct product of N and Q.
82 5. THE SYLOW THEOREMS; APPLICATIONS
5.14 (GROUPS OF ORDER q, . q PRIMES, < q) Let G be such a group, and let 1 and
Q be Sylow and q subgroups. Then (G : Q) =, which is the smallest prime dividing
(G : 1), and so (see Exercise 45) Q is normal. Because 1 maps bijectively onto G,Q, we
have that
G =Q1.
and it remains to determine the action of 1 on Q by conjugation.
The group Aut(Q) is cyclic of order q 1 (see 3.5), and so, unless [q 1, G =Q1.
If [q 1, then Aut(Q) (being cyclic) has a unique subgroup 1
t
of order . In fact 1
t
consists of the maps
. .
i
. {i Z,qZ [ i
]
=1].
Let a and b be generators for 1 and Q respectively, and suppose that the action of a on Q
by conjugation is . .
i
0
. i
0
=1 (in Z,qZ). Then G has generators a. b and relations
a
]
. b
q
. aba
1
=b
i
0
.
Choosing a different i
0
amounts to choosing a different generator a for 1, and so gives an
isomorphic group G.
In summary: if [ q 1, then the only group of order q is the cyclic group C
]q
; if
[q 1, then there is also a nonabelian group given by the above generators and relations.
5.15 (GROUPS OF ORDER 30) Let G be a group of order 30. Then
s
3
=1. 4. 7. 10. . . . and divides 10:
s
5
=1. 6. 11. . . . and divides 6.
Hence s
3
=1 or 10, and s
5
=1 or 6. In fact, at least one is 1, for otherwise there would be
20 elements of order 3 and 24 elements of order 5, which is impossible. Therefore, a Sylow
3subgroup 1 or a Sylow 5subgroup Q is normal, and so H = 1Q is a subgroup of G.
Because 3 doesnt divide 5 1 = 4, (5.14) shows that H is commutative, H ~ C
3
C
5
.
Hence
G =(C
3
C
5
)
0
C
2
.
and it remains to determine the possible homomorphisms 0: C
2
Aut(C
3
C
5
). But such
a homomorphism 0 is determined by the image of the nonidentity element of C
2
, which
must be an element of order 2. Let a, b, c generate C
3
, C
5
, C
2
. Then
Aut(C
3
C
5
) =Aut(C
3
) Aut(C
5
).
and the only elements of Aut C
3
and Aut C
5
of order 2 are a a
1
and b b
1
. Thus
there are exactly 4 homomorphisms 0, and 0(c) is one of the following elements:
_
a a
b b
_
a a
b b
1
_
a a
1
b b
_
a a
1
b b
1
.
The groups corresponding to these homomorphisms have centres of order 30, 3 (generated
by a), 5 (generated by b), and 1 respectively, and hence are nonisomorphic. We have shown
that (up to isomorphism) there are exactly 4 groups of order 30. For example, the third on
our list has generators a. b. c and relations
a
3
. b
5
. c
2
. ab =ba. cac
1
=a
1
. cbc
1
=b.
Examples 83
5.16 (GROUPS OF ORDER 12) Let G be a group of order 12, and let 1 be its Sylow 3
subgroup. If 1 is not normal, then 1 doesnt contain a nontrivial normal subgroup of G,
and so the map (4.2, action on the left cosets)
: G Sym(G,1) ~S
4
is injective, and its image is a subgroup of S
4
of order 12. From Sylow II we see that G
has exactly 4 Sylow 3subgroups, and hence it has exactly 8 elements of order 3. But all
elements of S
4
of order 3 are in
4
(see the table in 4.32), and so (G) intersects
4
in a
subgroup with at least 8 elements. By Lagranges theorem (G) =
4
, and so G ~
4
.
Now assume that 1 is normal. Then G =1 Q where Q is the Sylow 4subgroup. If
Q is cyclic of order 4, then there is a unique nontrivial map Q(=C
4
) Aut(1)(=C
2
),
and hence we obtain a single noncommutative group C
3
C
4
. If Q =C
2
C
2
, there are
exactly 3 nontrivial homomorphism 0: QAut(1), but the three groups resulting are all
isomorphic to S
3
C
2
with C
2
=Ker 0. (The homomorphisms differ by an automorphism
of Q, and so we can also apply Lemma 3.18.)
In total, there are 3 noncommutative groups of order 12 and 2 commutative groups.
5.17 (GROUPS OF ORDER
3
) Let G be a group of order
3
, with an odd prime, and
assume G is not commutative. We know from (4.17) that G has a normal subgroup N of
order
2
.
If every element of G has order (except 1), then N ~C
]
C
]
and there is a subgroup
Q of G of order such that QN ={1]. Hence
G =N
0
Q
for some homomorphism 0: QN. The order of Aut(N) ~GL
2
(F
]
) is (
2
1)(
2
)
(see 5.3), and so its Sylow subgroups have order . By the Sylow theorems, they are
conjugate, and so Lemma 3.19 shows that there is exactly one nonabelian group in this
case.
Suppose G has elements of order
2
, and let N be the subgroup generated by such an
element a. Because (G : N) = is the smallest (in fact only) prime dividing (G : 1), N is
normal in G (Exercise 45). We next show that G contains an element of order not in N.
We know 7(G) = 1, and, because G isnt commutative, that G,7(G) is not cyclic
(4.19). Therefore (7(G) : 1) = and G,7(G) ~C
]
C
]
. In particular, we see that for
all . G, .
]
7(G). Because G,7(G) is commutative, the commutator of any pair of
elements of G lies in 7(G), and an easy induction argument shows that
(.,)
n
=.
n
,
n
,. .
n.n1/
2
. n _1.
Therefore (.,)
]
=.
]
,
]
, and so . .
]
: G G is a homomorphism. Its image is con
tained in 7(G), and so its kernel has order at least
2
. Since N contains only 1 el
ements of order , we see that there exists an element b of order outside N. Hence
G =(a) (b) ~C
]
2 C
]
, and it remains to observe (3.19) that the nontrivial homomor
phisms C
]
Aut(C
]
2) ~C
]
C
]1
give isomorphic groups.
Thus, up to isomorphism, the only noncommutative groups of order
3
are those con
structed in (3.14, 3.15).
84 5. THE SYLOW THEOREMS; APPLICATIONS
5.18 (GROUPS OF ORDER 2
n
, 4
n
. AND 8
n
, ODD) Let G be a group of order 2
n
n
,
1 _ m_ 3, an odd prime, 1 _ n. We shall show that G is not simple. Let 1 be a Sylow
subgroup and let N =N
G
(1), so that s
]
=(G : N).
From Sylow II, we know that s
]
[2
n
, s
]
=1. 1. 21. . . .. If s
]
=1, 1 is normal.
If not, there are two cases to consider:
(i) s
]
=4 and =3, or
(ii) s
]
=8 and =7.
In the rst case, the action by conjugation of G on the set of Sylow3subgroups
1
denes
a homomorphism G S
4
, which, if G is simple, must be injective. Therefore (G : 1)[4,
and so n =1; we have (G : 1) =2
n
3. Now the Sylow 2subgroup has index 3, and so we
have a homomorphism G S
3
. Its kernel is a nontrivial normal subgroup of G.
In the second case, the same argument shows that (G : 1)[8, and so n =1 again. Thus
(G : 1) =56 and s
T
=8. Therefore G has 48 elements of order 7, and so there can be only
one Sylow 2subgroup, which must therefore be normal.
Note that groups of order q
i
, . q primes, <q are not simple, because Exercise 45
shows that the Sylow qsubgroup is normal. An examination of cases now reveals that
5
is the smallest noncyclic simple group.
5.19 (GROUPS OF ORDER 60) Let G be a simple group of order 60. We shall show that G
is isomorphic to
5
. Let 1 be a Sylow 2subgroup and N =N
G
(1), so that s
2
=(G : N).
According to the Sylow theorems, s
2
=1. 3. 5. or 15.
(a) The case s
2
=1 is impossible, because 1 would be normal (see 5.8).
(b) The case s
2
=3 is impossible, because the kernel of G Sym(G,N) would be a
nontrivial normal subgroup of G.
(c) In the case s
2
=5, we get an inclusion G Sym(G,N) =S
5
, which realizes G as
a subgroup of index 2 in S
5
, but we saw in (4.37) that, for n _ 5,
n
is the only subgroup
of index 2 in S
n
.
(d) In the case s
2
=15, a counting argument (using that s
5
=6) shows that there exist
two Sylow 2subgroups 1 and Q intersecting in a group of order 2. The normalizer N
of 1 Q contains 1 and Q, and so it has index 1, 3, or 5 in G. The rst two cases are
impossible for the same reasons as in (a) and (b). If (G: N) =5, the argument in (c) gives
an isomorphism G ~
5
; but this is impossible because s
2
(
5
) =5.
Exercises
51 Show that a nite group (not necessarily commutative) is cyclic if, for each n > 0, it
contains at most n elements of order dividing n.
1
Equivalently, the usual map G Sym(G,N).
CHAPTER 6
Subnormal Series; Solvable and
Nilpotent Groups
Subnormal Series.
Let G be a group. A chain of subgroups
G =G
0
G
1
G
i
G
i1
G
n
={1].
is called a subnormal series if G
i
is normal in G
i1
for every i , and it is called a normal
series if G
i
is normal in G for every i .
1
The series is said to be without repetitions if all the
inclusions G
i1
G
i
are proper (i.e., G
i1
=G
i
). Then n is called the length of the series.
The quotient groups G
i1
,G
i
are called the quotient (or factor) groups of the series.
A subnormal series is said to be a composition series if it has no proper renement that
is also a subnormal series. In other words, it is a composition series if G
i
is maximal among
the proper normal subgroups G
i1
for each i . Thus a subnormal series is a composition
series if and only if each quotient group is simple and nontrivial. Obviously, every nite
group has a composition series (usually many): choose G
1
to be a maximal proper normal
subgroup of G; then choose G
2
to be a maximal proper normal subgroup of G
1
, etc.. An
innite group may or may not have a nite composition series.
Note that from a subnormal series
G =G
0
>G
1
> >G
i
>G
i1
> >G
n
={1]
we obtain a sequence of exact sequences
1 G
n1
G
n2
G
n2
,G
n1
1
1 G
i1
G
i
G
i
,G
i1
1
1 G
1
G
0
G
0
,G
1
1.
Thus G is built up out of the quotients G
0
,G
1
. G
1
,G
2
. . . . . G
n1
by forming successive ex
tensions. In particular, since every nite group has a composition series, it can be regarded
1
Some authors write normal series where we write subnormal series and invariant series where we
write normal series.
85
86 6. SUBNORMAL SERIES; SOLVABLE AND NILPOTENT GROUPS
as being built up out of simple groups. The JordanH older theorem, which is the main topic
of this section, says that these simple groups are independent of the composition series (up
to order and isomorphism).
Note that if G has a subnormal series G =G
0
>G
1
> >G
n
={1], then
(G : 1) =
1_i_n
(G
i1
: G
i
) =
1_i_n
(G
i1
,G
i
: 1).
EXAMPLE 6.1 (a) The symmetric group S
3
has a composition series
S
3
>
3
>1
with quotients C
2
, C
3
.
(b) The symmetric group S
4
has a composition series
S
4
>
4
>V >((13)(24)) >1.
where V ~C
2
C
2
consists of all elements of order 2 in
4
(see 4.32). The quotients are
C
2
, C
3
, C
2
, C
2
.
(c) Any maximal ag in F
n
]
, a prime, is a composition series. Its length is n, and its
quotients are C
]
. C
]
. . . . . C
]
.
(d) Consider the cyclic group C
n
=(a). For any factorization m=
1
i
of m into
a product of primes (not necessarily distinct), there is a composition series
C
n
> C m
p
1
> C m
p
1
p
2
>
[ [ [
(a) (a
]
1
) (a
]
1
]
2
)
The length is r, and the quotients are C
]
1
. C
]
2
. . . . . C
]
r
.
(e) Suppose G is a direct product of simple groups, G =H
1
H
i
. Then G has a
composition series
G>H
2
H
i
>H
3
H
i
>
of length r and with quotients H
1
. H
2
. . . . . H
i
. Note that for any permutation o of {1. 2. . . . r],
there is another composition series with quotients H
c(1)
. H
c(2)
. . . . . H
c(i)
.
(f) We saw in (4.37) that for n _ 5, the only normal subgroups of S
n
are S
n
,
n
, {1],
and in (4.33) that
n
is simple. Hence S
n
>
n
>{1] is the only composition series for S
n
.
THEOREM 6.2 (JORDANH OLDER)
2
Let G be a nite group. If
G =G
0
>G
1
> >G
x
={1]
G =H
0
>H
1
> >H
t
={1]
are two composition series for G, then s = t and there is a permutation o of {1. 2. . . . . s]
such that G
i
,G
i1
~H
c(i)
,H
c(i)1
.
PROOF. We use induction on the order of G.
Case I: H
1
=G
1
. In this case, we have two composition series for G
1
, to which we can
apply the induction hypothesis.
2
Jordan showed that corresponding quotients had the same order, and H older that they were isomorphic.
Solvable groups 87
Case II: H
1
=G
1
. Because G
1
and H
1
are both normal in G, the product G
1
H
1
is a
normal subgroup of G. It properly contains both G
1
and H
1
, which are maximal normal
subgroups of G, and so G
1
H
1
=G. Therefore
G,G
1
=G
1
H
1
,G
1
.H
1
,G
1
H
1
(see 1.46).
Similarly G,H
1
.G
1
,G
1
H
1
. Let 1
2
=G
1
H
1
; then 1
2
is a maximal normal sub
group in both G
1
and H
1
, and
G,G
1
.H
1
,1
2
. G,H
1
.G
1
,1
2
. (26)
Choose a composition series
1
2
>1
3
> >1
u
.
We have the picture:
G
1
> G
2
> > G
x
,
G 1
2
> > 1
u
,
H
1
> H
2
> > H
t
.
On applying the induction hypothesis to G
1
and H
1
and their composition series in the
diagram, we nd that
Quotients(G>G
1
>G
2
> ) = {G,G
1
. G
1
,G
2
. G
2
,G
3
. . . .] (denition)
 {G,G
1
. G
1
,1
2
. 1
2
,1
3
. . . .] (induction)
 {H
1
,1
2
. G,H
1
. 1
2
,1
3
. . . .] (apply (26))
 {G,H
1
. H
1
,1
2
. 1
2
,1
3
. . . .] (reorder)
 {G,H
1
. H
1
,H
2
. H
2
,H
3
. . . .] (induction)
= Quotients(G>H
1
>H
2
> ) (denition).
2
Note that the theorem applied to a cyclic group C
n
implies that the factorization of an
integer into a product of primes is unique.
REMARK 6.3 There are innite groups having nite composition series (there are even
innite simple groups). For such a group, let J(G) be the minimum length of a composition
series. Then the JordanH older theorem extends to show that all composition series have
length J(G) and have isomorphic quotient groups. The same proof works except that you
have to use induction on J(G) instead of [G[ and verify that a normal subgroup of a group
with a nite composition series also has a nite composition series (Exercise 61).
The quotients of a composition series are sometimes called composition factors.
Solvable groups
A subnormal series whose quotient groups are all commutative is called a solvable series.
A group is solvable (or soluble) if it has a solvable series. Alternatively, we can say that
a group is solvable if it can be obtained by forming successive extensions of commutative
groups. Since a commutative group is simple if and only if it is cyclic of prime order, we
88 6. SUBNORMAL SERIES; SOLVABLE AND NILPOTENT GROUPS
see that G is solvable if and only if for one (hence every) composition series the quotients
are all cyclic groups of prime order.
Every commutative group is solvable, as is every dihedral group. The results in Chapter
5 show that every group of order < 60 is solvable. By contrast, a noncommutative simple
group, e.g.,
n
for n _5, will not be solvable.
THEOREM 6.4 (FEITTHOMPSON) Every nite group of odd order is solvable.
3
PROOF. The proof occupies an entire issue of the Pacic Journal of Mathematics (Feit and
Thompson 1963).
2
In other words, every nite group is either solvable or contains an element of order 2.
For the role this theorem played in the classication of the nite simple groups, see p. 53.
For a more recent look at the FeitThompson theorem, see Glauberman 1999.
EXAMPLE 6.5 Consider the subgroups T =
__
+ +
0 +
__
and U =
__
1 +
0 1
__
of GL
2
(J),
some eld J. Then U is a normal subgroup of T, and T,U . J
, U . (J. ).
Hence T is solvable.
PROPOSITION 6.6 (a) Every subgroup and every quotient group of a solvable group is
solvable.
(b) An extension of solvable groups is solvable.
PROOF. (a) Let G>G
1
> >G
n
be a solvable series for G, and let H be a subgroup of G.
The homomorphism
. .G
i1
: H G
i
G
i
,G
i1
has kernel (H G
i
) G
i1
=H G
i1
. Therefore, H G
i1
is a normal subgroup of
H G
i
and the quotient H G
i
,H G
i1
injects into G
i
,G
i1
, which is commutative.
We have shown that
H >H G
1
> >H G
n
is a solvable series for H.
Let
G be a quotient group of G, and let
G
i
be the image of G
i
in
G. Then
G>
G
1
> >
G
n
={1]
is a solvable series for
G.
(b) Let N be a normal subgroup of G, and let
G =G,N. We have to show that if N
and
G are solvable, then so also is G. Let
G>
G
1
> >
G
n
={1]
3
Burnside (1897, p. 379) wrote:
No simple group of odd order is at present known to exist. An investigation as to the existence
or nonexistence of such groups would undoubtedly lead, whatever the conclusion might be, to
results of importance; it may be recommended to the reader as well worth his attention. Also,
there is no known simple group whose order contains fewer than three different primes. . . .
Signicant progress in the rst problem was not made until Suzuki, M., The nonexistence of a certain type of
simple group of nite order, 1957. However, the second problem was solved by Burnside himself, who proved
using characters that any group whose order contains fewer than three different primes is solvable (see Alperin
and Bell 1995, p. 182).
Solvable groups 89
N >N
1
> >N
n
={1]
be solvable series for
G and N, and let G
i
be the inverse image of
G
i
in G. Then
G
i
,G
i1
.
G
i
,
G
i1
(see 1.48), and so
G>G
1
> >G
n
(=N) >N
1
> >N
n
is a solvable series for G.
2
COROLLARY 6.7 A nite group is solvable.
PROOF. We use induction on the order the group G. According to (4.16), the centre 7(G)
of G is nontrivial, and so the induction hypothesis implies that G,7(G) is solvable. Be
cause 7(G) is commutative, (b) of the proposition shows that G is solvable.
2
Let G be a group. Recall that the commutator of .. , G is
.. , =.,.
1
,
1
=.,(,.)
1
Thus
.. , =1 ., =,..
and G is commutative if and only if every commutator equals 1.
EXAMPLE 6.8 For any nitedimensional vector space V over a eld k and any maximal
ag J ={V
n
. V
n1
. . . .] in V , the group
T(J) ={ Aut(V ) [ (V
}
) V
}
all ]
is solvable. Indeed, let U(J) be the group dened in Example 5.10. Then T(J),U(J) is
commutative, and, when k = F
]
, U(J) is a group. This proves that T(J) is solvable
when k =F
]
, and in the general case one denes subgroups T
0
T
1
of T(J) with
T
i
={ T(J) [ (V
}
) V
}i
all ]
and notes that the commutator of two elements of T
i
lies in T
i1
.
For any homomorphism : G H
(.. ,) =(.,.
1
,
1
) =(.). (,).
i.e., maps the commutator of .. , to the commutator of (.). (,). In particular, we see
that if H is commutative, then maps all commutators in G to 1.
The group G
t
=G
(1)
generated by the commutators in G is called the commutator or
rst derived subgroup of G.
PROPOSITION 6.9 The commutator subgroup G
t
is a characteristic subgroup of G; it is the
smallest normal subgroup of G such that G,G
t
is commutative.
PROOF. An automorphism of G maps the generating set for G
t
into G
t
, and hence maps
G
t
into G
t
. Since this is true for all automorphisms of G, G
t
is characteristic.
Write g g for the homomorphism g gG
t
: G G,G
t
. Then g.
h =g. h, which
is 1 because g. h G
t
. Hence g.
h =1 for all g,
h G,G
t
, which shows that G,G
t
is
commutative.
Let N be a second normal subgroup of G such that G,N is commutative. Then g. h
1 in G,N, and so g. h N. Since these elements generate G
t
, N G
t
.
2
90 6. SUBNORMAL SERIES; SOLVABLE AND NILPOTENT GROUPS
For n _ 5.
n
is the smallest normal subgroup of S
n
giving a commutative quotient.
Hence (S
n
)
t
=
n
.
The second derived subgroup of G is (G
t
)
t
; the third is G
(3)
=(G
tt
)
t
; and so on. Since
a characteristic subgroup of a characteristic subgroup is characteristic (3.7a), each derived
group G
(n)
is a characteristic subgroup of G. Hence we obtain a normal series
G G
(1)
G
(2)
.
which is called the derived series of G. For example, when n _ 5, the derived series of S
n
is
S
n
n
.
PROPOSITION 6.10 A group G is solvable if and only if its kth derived subgroup G
(k)
=1
for some k.
PROOF. If G
(k)
=1, then the derived series is a solvable series for G. Conversely, let
G =G
0
>G
1
>G
2
> >G
x
=1
be a solvable series for G. Because G,G
1
is commutative, G
1
G
t
. Now G
t
G
2
is a
subgroup of G
1
, and from
G
t
,G
t
G
2
:
G
t
G
2
,G
2
G
1
,G
2
we see that
G
1
,G
2
commutative == G
t
,G
t
G
2
commutative == G
tt
G
t
G
2
G
2
.
Continuing in the fashion, we nd that G
(i)
G
i
for all i , and hence G
(x)
=1.
2
Thus, a solvable group G has a canonical solvable series, namely the derived series, in
which all the groups are normal in G. The proof of the proposition shows that the derived
series is the shortest solvable series for G. Its length is called the solvable length of G.
ASIDE 6.11 Not every element of the commutator subgroup of a group is itself a commutator, but
the smallest groups where this occurs have order 96. This was shown by a computer search through
the libraries of small groups. See also mo44269.
Nilpotent groups
Let G be a group. Recall that we write 7(G) for the centre of G. Let 7
2
(G) G be the
subgroup of G corresponding to 7(G,7(G)) G,7(G). Thus
g 7
2
(G) g. . 7(G) for all . G.
Continuing in this fashion, we get a sequence of subgroups (ascending central series)
{1] 7(G) 7
2
(G)
where
g 7
i
(G) g. . 7
i1
(G) for all . G.
If 7
n
(G) =G for some m, then G is said to be nilpotent, and the smallest such m is called
the (nilpotency) class of G. For example, all nite groups are nilpotent (apply 4.16).
Only the group {1] has class 0, and the groups of class 1 are exactly the commutative
groups. A group G is of class 2 if and only if G,7(G) is commutative such a group is
said to be metabelian.
Nilpotent groups 91
EXAMPLE 6.12 (a) A nilpotent group is obviously solvable, but the converse is false. For
example, for a eld J, let
T =
_ _
a b
0 c
_
a. b. c J. ac =0
_
.
Then 7(T) ={a1 [ a =0], and the centre of T,7(T) is trivial. Therefore T,7(T) is not
nilpotent, but we saw in (6.5) that it is solvable.
(b) The group G =
_
_
_
_
_
1 + +
0 1 +
0 0 1
_
_
_
_
_
is metabelian: its centre is
_
_
_
_
_
1 0 +
0 1 0
0 0 1
_
_
_
_
_
, and
G,7(G) is commutative.
(c) Any nonabelian group G of order
3
is metabelian. In fact, G
t
=7(G) has order
(see 5.17), and G,G
t
is commutative (4.18). In particular, the quaternion and dihedral
groups of order 8, Q and D
4
, are metabelian. The dihedral group D
2
n is nilpotent of class
n this can be proved by induction, using that 7(D
2
n) has order 2, and D
2
n,7(D
2
n) ~
D
2
n1. If n is not a power of 2, then D
n
is not nilpotent (use Theorem 6.18 below).
PROPOSITION 6.13 (a) A subgroup of a nilpotent group is nilpotent.
(b) quotient of a nilpotent group is nilpotent.
PROOF. (a) Let H be a subgroup of a nilpotent group G. Clearly, 7(H) 7(G) H.
Assume (inductively) that 7
i
(H) 7
i
(G) H; then 7
i1
(H) 7
i1
(G) H, because
(for h H)
h 7
i1
(G) == h. . 7
i
(G) all . G == h. . 7
i
(H) all . H.
(b) Straightforward.
2
REMARK 6.14 It should be noted that if H is a subgroup of G, then 7(H) may be bigger
than 7(G). For example, the centre of
H =
_ _
a 0
0 b
_
ab =0
_
GL
2
(J).
is H itself, but the centre of GL
2
(J) consists only of the scalar matrices.
PROPOSITION 6.15 A group G is nilpotent of class _m if and only if
. . . g
1
. g
2
. g
3
. . . . . . g
n1
 =1
for all g
1
. .... g
n1
G.
PROOF. Recall, g 7
i
(G) g. . 7
i1
(G) for all . G.
Assume G is nilpotent of class _m; then
G =7
n
(G) == g
1
. g
2
 7
n1
(G) all g
1
. g
2
G
== g
1
. g
2
. g
3
 7
n2
(G) all g
1
. g
2
. g
3
G
== g
1
. g
2
. g
3
. .... g
n
 7(G) all g
1
. . . . . g
n
G
== g
1
. g
2
. g
3
. . . . . g
n1
 =1 all g
1
. . . . . g
n
G.
92 6. SUBNORMAL SERIES; SOLVABLE AND NILPOTENT GROUPS
For the converse, let g
1
G. Then
...g
1
. g
2
. g
3
..... g
n
. g
n1
 =1 for all g
1
. g
2
. .... g
n1
G
== ...g
1
. g
2
. g
3
. .... g
n
 7(G). for all g
1
. .... g
n
G
== ...g
1
. g
2
. g
3
. .... g
n1
 7
2
(G). for all g
1
. .... g
n1
G
== g
1
7
n
(G) all g
1
G.
2
An extension of nilpotent groups need not be nilpotent, i.e.,
N and G,N nilpotent =G nilpotent. (27)
For example, the subgroup U of the group T in Examples 6.5 and 6.12 is commutative and
T,U is commutative, but T is not nilpotent.
However, the implication (27) holds when N is contained in the centre of G. In fact,
we have the following more precise result.
COROLLARY 6.16 For any subgroup N of the centre of G,
G,N nilpotent of class m == G nilpotent of class _m1.
PROOF. Write for the map G G,N. Then
(...g
1
. g
2
. g
3
. .... g
n
. g
n1
) =...g
1
. g
2
. g
3
. .... g
n
. g
n1
 =1
all g
1
. .... g
n1
G. Hence ...g
1
. g
2
. g
3
. .... g
n
. g
n1
 N 7(G), and so
...g
1
. g
2
. g
3
. .... g
n1
. g
n2
 =1 all g
1
. .... g
n2
G.
2
COROLLARY 6.17 A nite group is nilpotent.
PROOF. We use induction on the order of G. Because 7(G) =1, G,7(G) nilpotent, which
implies that G is nilpotent.
2
Recall that an extension
1 N
t
G
t
Q1
is central if (N) 7(G). Then:
the nilpotent groups are those that can be obtained from commutative groups
by successive central extensions.
Contrast:
the solvable groups are those that can be obtained from commutative groups
by successive extensions (not necessarily central).
THEOREM 6.18 A nite group is nilpotent if and only if it is equal to a direct product of
its Sylow subgroups.
Nilpotent groups 93
PROOF. Adirect product of nilpotent groups is obviously nilpotent, and so the if direction
follows from the preceding corollary. For the converse, let G be a nite nilpotent group.
According to (5.9) it sufces to prove that all Sylow subgroups are normal. Let 1 be such a
subgroup of G, and let N =N
G
(1). The rst lemma below shows that N
G
(N) =N, and
the second then implies that N =G, i.e., that 1 is normal in G.
2
LEMMA 6.19 Let 1 be a Sylow subgroup of a nite group G. For any subgroup H of
G containing N
G
(1), we have N
G
(H) =H.
PROOF. Let g N
G
(H), so that gHg
1
=H. Then H g1g
1
=1
t
, which is a Sylow
subgroup of H. By Sylow II, h1
t
h
1
=1 for some h H, and so hg1g
1
h
1
1.
Hence hg N
G
(1) H, and so g H.
2
LEMMA 6.20 Let H be proper subgroup of a nite nilpotent group G; then H =N
G
(H).
PROOF. The statement is obviously true for commutative groups, and so we can assume
G to be noncommutative. We use induction on the order of G. Because G is nilpotent,
7(G) = 1. Certainly the elements of 7(G) normalize H, and so if 7(G) _ H, we have
H _ 7(G) H N
G
(H). Thus we may suppose 7(G) H. Then the normalizer of H
in G corresponds under (1.47) to the normalizer of H,7(G) in G,7(G), and we can apply
the induction hypothesis.
2
REMARK 6.21 For a nite abelian group G we recover the fact that G is a direct product
of its primary subgroups.
PROPOSITION 6.22 (FRATTINIS ARGUMENT) Let H be a normal subgroup of a nite
group G, and let 1 be a Sylow subgroup of H. Then G =H N
G
(1).
PROOF. Let g G. Then g1g
1
gHg
1
=H, and both g1g
1
and 1 are Sylow 
subgroups of H. According to Sylow II, there is an h H such that g1g
1
=h1h
1
, and
it follows that h
1
g N
G
(1) and so g H N
G
(1).
2
THEOREM 6.23 A nite group is nilpotent if and only if every maximal proper subgroup
is normal.
PROOF. We saw in Lemma 6.20 that for any proper subgroup H of a nilpotent group G,
H _N
G
(H). Hence,
H maximal == N
G
(H) =G.
i.e., H is normal in G.
Conversely, suppose every maximal proper subgroup of G is normal. We shall check
the condition of Theorem 6.18. Thus, let 1 be a Sylow subgroup of G. If 1 is not
normal in G, then there exists a maximal proper subgroup H of G containing N
G
(1).
Being maximal, H is normal, and so Frattinis argument shows that G =H N
G
(1) =H
contradiction.
2
ASIDE 6.24 Consider a nilpotent group G of class 2:
1 G T 1. . T commutative. 7(G).
Taking commutators induces a map
_
2
T (and every such map occurs for some extension).
The image of this map is the commutator subgroup and the image of the pure tensors b .b
t
is the set
of actual commutators. This can be used to give examples of groups whose commutator subgroup
doesnt consist entirely of commutators (Torsten Ekedahl, mo44269).
94 6. SUBNORMAL SERIES; SOLVABLE AND NILPOTENT GROUPS
Groups with operators
Recall that the set Aut(G) of automorphisms of a group G is again a group. Let be
a group. A pair (G. ) consisting of a group G together with a homomorphism :
Aut(G) is called an group, or G is said to have as a group of operators.
Let G be an group, and write
. for ().. Then
(a)
()
. =
.) ( is a homomorphism);
(b)
(.,) =
, (() is a homomorphism);
(c)
1
. =. ( is a homomorphism).
Conversely, a map (. .)
. is inverse to .
(
1
)
.,
and so .
.) is a homomorphism Aut(G).
Let G be a group with operators . A subgroup H of G is admissible or invariant if
. H ==
. H, all .
An intersection of admissible groups is admissible. If H is admissible, so also are its
normalizer N
G
(H) and centralizer C
G
(H).
An homomorphism (or admissible homomorphism) of groups is a homomor
phism ;: G G
t
such that ;(
g) =
: G Aut(G).
In this case, the admissible subgroups are the normal subgroups.
(c) Consider G with = Aut(G) as group of operators. In this case, the admissible
subgroups are the characteristic subgroups.
Almost everything we have proved for groups also holds for groups with operators. In
particular, the Theorems 1.45, 1.46, and 1.47 hold for groups with operators. In each case,
the proof is the same as before except that admissibility must be checked.
THEOREM 6.26 For any admissible homomorphism ;: G G
t
of groups, N
def
=Ker(;)
is an admissible normal subgroup of G, ;(G) is an admissible subgroup of G
t
, and ; factors
in a natural way into the composite of an admissible surjection, an admissible isomorphism,
and an admissible injection:
G G,N
:
;(G) G
t
.
THEOREM 6.27 Let G be a group with operators , and let H and N be admissible
subgroups with N normal. Then H N is a normal admissible subgroup of H, HN
is an admissible subgroup of G, and h(H N) hH is an admissible isomorphism
H,H N HN,N.
KrullSchmidt theorem 95
THEOREM 6.28 Let : G
G be a surjective admissible homomorphism of groups.
Under the onetoone correspondence H 
H between the set of subgroups of G contain
ing Ker() and the set of subgroups of
G (see 1.47), admissible subgroups correspond to
admissible subgroups.
Let : Aut(G) be a group with operating. An admissible subnormal series is a
chain of admissible subgroups of G
G G
1
G
2
G
i
with each G
i
normal in G
i1
. Dene similarly an admissible composition series. The quo
tients of an admissible subnormal series are groups, and the quotients of an admissible
composition series are simple groups, i.e., they have no normal admissible subgroups
apart from the obvious two.
The JordanH older theorem continues to hold for groups. In this case the isomor
phisms between the corresponding quotients of two composition series are admissible. The
proof is the same as that of the original theorem, because it uses only the isomorphism
theorems, which we have noted also hold for groups.
EXAMPLE 6.29 (a) Consider G with G acting by conjugation. In this case an admissible
subnormal series is a sequence of subgroups
G =G
0
G
1
G
2
G
x
={1].
with each G
i
normal in G, i.e., a normal series. The action of G on G
i
by conjugation
passes to the quotient, to give an action of G on G
i
,G
i1
. The quotients of two admissible
composition series are isomorphic as Ggroups.
(b) Consider G with =Aut(G) as operator group. In this case, an admissible subnor
mal series is a sequence
G =G
0
G
1
G
2
G
x
={1]
with each G
i
a characteristic subgroup of G, and the quotients of two admissible composi
tion series are isomorphic as Aut(G)groups.
KrullSchmidt theorem
A group G is indecomposable if G =1 and G is not isomorphic to a direct product of two
nontrivial groups, i.e., if
G ~H H
t
== H =1 or H
t
=1.
EXAMPLE 6.30 (a) A simple group is indecomposable, but an indecomposable group need
not be simple: it may have a normal subgroup. For example, S
3
is indecomposable but has
C
3
as a normal subgroup.
(b) A nite commutative group is indecomposable if and only if it is cyclic of prime
power order.
Of course, this is obvious fromthe classication, but it is not difcult to prove it directly.
Let G be cyclic of order
n
, and suppose that G ~H H
t
. Then H and H
t
must be 
groups, and they cant both be killed by
n
, m < n. It follows that one must be cyclic
96 6. SUBNORMAL SERIES; SOLVABLE AND NILPOTENT GROUPS
of order
n
, and that the other is trivial. Conversely, suppose that G is commutative and
indecomposable. Since every nite commutative group is (obviously) a direct product of
groups with running over the primes, G is a group. If g is an element of G of highest
order, one shows that (g) is a direct factor of G, G ~(g) H, which is a contradiction.
(c) Every nite group can be written as a direct product of indecomposable groups
(obviously).
THEOREM 6.31 (KRULLSCHMIDT) Suppose that G is a direct product of indecompos
able subgroups G
1
. . . . . G
x
and of indecomposable subgroups H
1
. . . . . H
t
:
G .G
1
G
x
. G .H
1
H
t
.
Then s = t , and there is a reindexing such that G
i
~ H
i
. Moreover, given r, we can
arrange the numbering so that
G =G
1
G
i
H
i1
H
t
.
PROOF. See Rotman 1995, 6.36.
2
EXAMPLE 6.32 Let G =F
]
F
]
, and think of it as a twodimensional vector space over
F
]
. Let
G
1
=((1. 0)). G
2
=((0. 1)): H
1
=((1. 1)). H
2
=((1. 1)).
Then G =G
1
G
2
, G =H
1
H
2
, G =G
1
H
2
.
REMARK 6.33 (a) The KrullSchmidt theorem holds also for an innite group provided it
satises both chain conditions on subgroups, i.e., ascending and descending sequences of
subgroups of G become stationary.
(b) The KrullSchmidt theorem also holds for groups with operators. For example,
let Aut(G) operate on G; then the subgroups in the statement of the theorem will all be
characteristic.
(c) When applied to a nite abelian group, the theorem shows that the groups C
n
i
in a
decomposition G =C
n
1
... C
n
r
with each m
i
a prime power are uniquely determined
up to isomorphism (and ordering).
Exercises
61 Let G be a group (not necessarily nite) with a nite composition series
G =G
0
G
1
G
n
=1.
and let N be a normal subgroup of G. Show that
N =N G
0
N G
1
N G
n
=1
becomes a composition series for N once the repetitions have been omitted.
62 If G
1
and G
2
are groups such that G
t
1
~G
t
2
and G
1
,G
t
1
~G
2
,G
t
2
, are G
1
and G
2
necessarily isomorphic? (Here
t
denotes the commutator subgroup.)
CHAPTER 7
Representations of Finite Groups
Throughout this chapter, G is a nite group and J is a eld. All vector spaces are nite
dimensional.
An Jalgebra is a ring containing J in its centre and nite dimensional as an J
vector space. We do not assume to be commutative; for example, could be the ma
trix algebra M
n
(J). Let e
1
. . . . . e
n
be a basis for as an Jvector space; then e
i
e
}
=
k
a
k
i}
e
k
for some a
k
i}
J, called the structure constants of relative to the basis (e
i
)
i
;
once a basis has been chosen, the algebra is uniquely determined by its structure con
stants.
All modules are nite dimensional when regarded as Jvector spaces. For an 
module V , mV denotes the direct sum of m copies of V .
The opposite
opp
of an Jalgebra is the same Jalgebra as but with the multipli
cation reversed, i.e.,
opp
=(. .
t
) with a
t
b =ba. In other words, there is a onetoone
correspondence a a
t
: 
opp
which is an isomorphism of Jvector spaces and has the
property that a
t
b
t
=(ba)
t
.
An module M is simple if it is nonzero and contains no submodules except 0 and M,
and it is semisimple if it is isomorphic to a direct sum of simple modules.
Matrix representations
A matrix representation of degree n of G over J is a homomorphism G GL
n
(J).
The representation is said to be faithful if the homomorphism is injective. Thus a faithful
representation identies G with group of nn matrices.
EXAMPLE 7.1 (a) There is a representation Q GL
2
(C) of the quaternion group Q =
(a. b) sending a to
_
0
_
1
_
1 0
_
and b to
_
0 1
1 0
_
. In fact, that is how we originally dened
Q in (1.18).
(b) Let G = S
n
. For each o S
n
, let 1(o) be the matrix obtained from the identity
matrix by using o to permute the rows. Then, for any nn matrix , 1(o) is obtained
fromby using o to permute the rows. In particular, 1(o)1(o
t
) =1(oo
t
), and so o 1(o)
is a representation of S
n
. Clearly, it is faithful. As every nite group embeds into S
n
for
some n (Cayleys theorem, see 1.22), this shows that every nite group has a faithful matrix
representation.
(c) Let G =C
n
=(o). If J contains a nth root of 1, say , then there is representation
o
i
i
: C
n
GL
1
(J) = J
_
1 i
0 1
_
: C
]
GL
2
(J).
ASIDE 7.2 Recall that the Burnside problem asks whether every nitely generated group with nite
exponent is nite (see p. 37). Burnside proved that the problem has a positive answer for subgroups
of GL
n
(C). Therefore, no innite nitely generated group with nite exponent has a faithful repre
sentation over C.
Roots of 1 in elds
As the last example indicates, the representations of a group over a eld J depend on the
roots of 1 in the eld. The nth roots of 1 in a eld J form a subgroup j
n
(J) of J
, which
is cyclic (see 1.56).
If the characteristic of J divides n, then [j
n
(J)[ < n. Otherwise, X
n
1 has distinct
roots (a multiple root would have to be a root of its derivative nX
n1
), and we can always
arrange that [j
n
(J)[ =n by extending J, for example, by replacing a subeld J of C with
J where =e
2ti{n
, or by replacing J with JX,(g(X)) where g(X) is an irreducible
factor of X
n
1 not dividing X
n
1 for any proper divisor m of n.
An element of order n in J
0_i_n1
V
i
. V
i
def
={ V [ o =
i
].
Conversely, every such direct sum decomposition of G arises from a representation of G.
Maschkes theorem 99
(b) Let G be a commutative group of exponent n, and assume that J contains a primitive
nth root of 1. Let
G
=Hom(G. J
) =Hom(G. j
n
(J))
To give a representation of G on a vector space V is the same as to give a direct sum
decomposition
V =
_G
_
V
_
. V
_
def
={ V [ o =(o)].
When G is cyclic, this is a restatement of (a), and the general case follows easily (decom
pose V with respect to the action of one cyclic factor of G; then decompose each summand
with respect to the action of a second cyclic factor of G; and so on).
Maschkes theorem
Let G GL(V ) be a linear representation of G on an Jvector space V . A subspace W
of V is said to be Ginvariant if gW W for all g G. An Jlinear map : V V
t
of
vector spaces on which G acts linearly is said to be Ginvariant if
(g) =g() for all g G. V.
Finally, a bilinear form : V V J is said to be Ginvariant if
(g. g
t
) =(.
t
) for all g G, .
t
V.
THEOREM 7.4 (MASCHKE) Let G GL(V ) be a linear representation of G. If the char
acteristic of J does not divide [G[, then every Ginvariant subspace W of V has a G
invariant complement, i.e., there exists a Ginvariant subspace W
t
such that V =W W
t
.
Note that the theorem always applies when J has characteristic zero.
The condition on the characteristic is certainly necessary: let G = (o) be the cyclic
group of order , where is the characteristic of J, and let o acts on V =J
2
as the matrix
_
1 1
0 1
_
(see 7.3b); the subspace (
+
0
) is Ginvariant, and its complementary subspaces are
those of the form J
_
o
b
_
, b =0; none of them is Ginvariant. In fact, in every representation
of C
]
on a nonzero vector space over a eld of characteristic , there is a nonzero xed
vector.
Because of the importance of the ideas involved, we present two proofs of Maschkes
theorem.
PROOF OF MASCHKES THEOREM (CASE J =1 OR C)
LEMMA 7.5 Let be a symmetric bilinear form on V , and let W be a subspace of V . If
and W are Ginvariant, then so also is W
J
def
={ V [ (n. ) =0 for all n W].
PROOF. Let W
J
and let g G. For any n W , (n. g) =(g
1
n. ) because is
Ginvariant, and (g
1
n. ) =0 because W is Ginvariant. This shows that g W
J
.
2
Recall from linear algebra that if is nondegenerate, then V =W W
J
. Therefore,
in order to prove Maschkes theorem, it sufces to show that there exists a Ginvariant
nondegenerate symmetric bilinear from : V V J.
100 7. REPRESENTATIONS OF FINITE GROUPS
LEMMA 7.6 For any symmetric bilinear form on V ,
(. n)
def
=
G
(g. gn)
is a Ginvariant symmetric bilinear form on V .
PROOF. The form is obviously bilinear and symmetric, and for g
0
G,
(g
0
. g
0
n)
def
=
G
(gg
0
. gg
0
n).
which equals
G
(g. gn) because, as g runs over G, so also does gg
0
.
2
Unfortunately, we cant conclude that
is nondegenerate when is (otherwise we
could prove that all JGmodules are semisimple, with no restriction on J or G).
LEMMA 7.7 Let J =1. If is a positive denite symmetric bilinear form on V , then so
also is
.
PROOF. If
is positive denite, then for any nonzero in V ,
(. ) =
G
(g. g) > 0.
2
This completes the proof of Maschkes theorem when J =1, because there certainly
exist positive denite symmetric bilinear forms on V . A similar argument using hermitian
forms applies when J =C (or, indeed, when J is any subeld of C).
ASIDE 7.8 A representation of a group G on a real vector space V is unitary if there exists a
Ginvariant positive denite symmetric bilinear form on V . Lemma 7.6 shows that every unitary
representation is semisimple, and Lemma 7.7 shows that every real representation of a nite group
is unitary.
PROOF OF MASCHKES THEOREM (GENERAL CASE)
An endomorphism of an Jvector space V is called a projector if
2
=. The minimum
polynomial of a projector divides X
2
X =X(X1), and so V decomposes into a direct
sum of eigenspaces,
V =V
0
() V
1
(), where
_
V
0
() ={ V [ =0] =Ker()
V
1
() ={ V [ =] =Im().
Conversely, a decomposition V =V
0
V
1
arises from a projector (
0
.
1
) (0.
1
).
Now suppose that G acts linearly on V . If a projector is Ginvariant, then V
1
() and
V
0
() are obviously Ginvariant. Thus, to prove the theorem it sufces to show that W is
the image of a Ginvariant projector .
We begin by choosing an Jlinear projector with image W , which certainly exists,
and we modify it to obtain a Ginvariant projector with the same image. For V , let
() =
1
[G[
G
g
_
(g
1
)
_
.
The group algebra; semisimplicity 101
This makes sense because [G[ 1 J
G
g(g
1
n) =
1
[G[
G
n =n. (28)
The image of is contained in W , because Im() W and W is Ginvariant, and so
2
()
def
= ( ())
(2S)
= ()
for any V . Thus, is a projector, and (28) shows that Im( ) W , and hence Im( ) =
W . It remains to show that is Ginvariant. For g
0
V
(g
0
) =
1
[G[
G
g
_
(g
1
g
0
)
_
=g
0
1
[G[
G
(g
1
0
g)
_
(g
1
g
0
)
_
.
which equals g
0
() because, as g runs over G, so also does g
1
0
g.
The group algebra; semisimplicity
The group algebra JG of G is dened to be the Jvector space with basis the elements
of G endowed with the multiplication extending that on G. Thus,
an element of JG is a sum
G
c
g, c
J,
two elements
G
c
g and
G
c
t
= c
t
G
c
g
__
G
c
t
g
_
=
G
c
tt
g. c
tt
2
=
c
1
c
t
2
.
A linear action
g. g: GV V
of G on an Jvector space extends uniquely to an action of JG on V ,
G
c
g.
G
c
g: JG V V.
which makes V into an JGmodule. The submodules for this action are exactly the G
invariant subspaces.
Let G GL(V ) be a linear representation of G. When V is simple (resp. semisimple)
as an JGmodule, the representation is usually said to be irreducible (resp. completely
reducible). However, I will call them simple (resp. semisimple) representations.
PROPOSITION 7.9 If the characteristic of J does not divide [G[, then every JGmodule
is a direct sum of simple submodules.
PROOF. Let V be a JGmodule. If V is simple, then there is nothing to prove. Otherwise,
it contains a nonzero proper submodule W . According to Maschkes theorem, V =W
W
t
with W
t
an JGsubmodule. If W and W
t
are simple, then the proof is complete;
otherwise, we can continue the argument, which terminates in a nite number of steps
because V has nite dimension as an Jvector space.
2
As we have observed, the linear representations of G can be regarded as JGmodules.
Thus, to understand the linear representations of G, we need to understand the JG
modules, and for this we need to understand the structure of the Jalgebra JG. In the next
three sections we study Jalgebras and their modules; in particular, we prove the famous
Wedderburn theorems concerning Jalgebras whose modules are all semisimple.
102 7. REPRESENTATIONS OF FINITE GROUPS
Semisimple modules
In this section, is an Jalgebra.
PROPOSITION 7.10 Every module V admits a ltration
V =V
0
V
1
V
x
={0]
such that the quotients V
i
,V
i1
are simple modules. If
V =W
0
W
1
W
t
={0]
is a second such ltration, then s = t and there is a permutation o of {1. . . . . s] such that
V
i
,V
i1
~W
c(i)
,W
c(i)1
for all i .
PROOF. This is a variant of the JordanH older theorem (6.2), which can be proved by the
same argument.
2
COROLLARY 7.11 Suppose
V ~V
1
V
x
~W
1
W
t
with all the modules V
i
and W
}
simple. Then s = t and there is a permutation o of
{1. . . . . s] such that V
i
~W
c(i)
.
PROOF. Each decomposition denes a ltration, to which the proposition can be applied.
2
PROPOSITION 7.12 Let V be an module. If V is a sum of simple submodules, say
V =
iJ
S
i
(the sum need not be direct), then for any submodule W of V , there is a
subset J of 1 such that
V =W
iJ
S
i
.
PROOF. Let J be maximal among the subsets of 1 such the sum S
J
def
=
}J
S
}
is direct
and W S
J
=0. I claim that W S
J
=V (hence V is the direct sum of W and the S
}
with J). For this, it sufces to show that each S
i
is contained in W S
J
. Because S
i
is simple, S
i
(W S
J
) equals S
i
or 0. In the rst case, S
i
W S
J
, and in the second
S
J
S
i
=0 and W (S
J
S
i
) =0, contradicting the denition of 1.
2
COROLLARY 7.13 The following conditions on an module V are equivalent:
(a) V is semisimple;
(b) V is a sum of simple submodules;
(c) every submodule of V has a complement.
PROOF. The proposition shows that (b) implies (c), and the argument in the proof of (7.9)
shows that (c) implies (a). It is obvious that (a) implies (b).
2
COROLLARY 7.14 Sums, submodules, and quotient modules of semisimple modules are
semisimple.
PROOF. Each is a sum of simple modules.
2
Simple Jalgebras and their modules 103
Simple Jalgebras and their modules
An Jalgebra is said to be simple if it contains no twosided ideals except 0 and . We
shall make frequent use of the following observation:
The kernel of a homomorphism : T of Jalgebras is an ideal in not
containing 1; therefore, if is simple, then is injective.
EXAMPLE 7.15 We consider the matrix algebra M
n
(J). Let e
i}
be the matrix with 1 in
the (i. )th position and zeros elsewhere.
(a) Let 1 be a twosided ideal in M
n
(J), and suppose that 1 contains a nonzero matrix
M =(m
i}
) with, say, m
i
0
}
0
=0. As
e
i i
0
M e
}
0
}
=m
i
0
}
0
e
i}
and e
i i
0
M e
}
0
}
1, we see that 1 contains all the matrices e
i}
and so equals
M
n
(J). We have shown that M
n
(J) is simple.
(b) For M. N M
n
(J), the th column of M N is M N
}
where N
}
is the th column
of N. Therefore, for a given matrix N,
_
N
}
=0 = (M N)
}
=0
N
}
=0 = (M N)
}
can be arbitrary.
(29)
For 1 _ i _ n, let 1(i ) be the set of matrices whose th columns are zero for =i
and whose i th column is arbitrary. For example, when n =4,
1(3) =
_
_
_
_
_
_
0 0 + 0
0 0 + 0
0 0 + 0
0 0 + 0
_
_
_
_
_
_
M
4
(J).
It follows from (29) that 1(i ) is a minimal left ideal in M
n
(J). Note that M
n
(J) is
a direct sum
M
n
(J) =1(1) 1(n)
of minimal left ideals.
EXAMPLE 7.16 An Jalgebra is said to be a division algebra if every nonzero element
a has an inverse, i.e., there exists a b such that ab = 1 = ba. Thus a division algebra
satises all the axioms to be a eld except commutativity (and for this reason is sometimes
called a skew eld). Clearly, a division algebra has no nonzero proper ideals, left, right, or
twosided, and so is simple.
If D is a division algebra, then the argument in (7.15a) shows that the algebra M
n
(D)
is simple.
EXAMPLE 7.17 For a. b J
o
0 )(1)
def
=
o
(
o
0 (1)) =
o
(a
t
) =a
t
a =
o
0
o
(1).
and so
End
) .
opp
(as Jalgebras).
More generally,
End
(V ) .
opp
for any module V that is free of rank 1, and
End
(V ) .M
n
(
opp
)
for any free module V of rank n (cf. 7.32 below).
CENTRALIZERS
Let be an Jsubalgebra of an Jalgebra T. The centralizer of in T is
C
B
() ={b T [ ba =ab for all a ].
It is again an Jsubalgebra of T.
EXAMPLE 7.20 In the following examples, the centralizers are taken in M
n
(J).
(a) Let be the set of scalar matrices in M
n
(J), i.e., = J 1
n
. Clearly, C() =
M
n
(J).
(b) Let =M
n
(J). Then C() is the centre of M
n
(J), which we now compute. Let
e
i}
be the matrix with 1 in the (i. )th position and zeros elsewhere, so that
e
i}
e
In
=
_
e
in
if =l
0 if =l.
Let = (a
i}
) M
n
(J). Then =
i,}
a
i}
e
i}
, and so e
In
=
i
a
iI
e
in
and
e
In
=
}
a
n}
e
I}
. If is in the centre of M
n
(J), then e
In
= e
In
, and so
a
iI
=0 for i =l, a
n}
=0 for =m, and a
I I
=a
nn
. It follows that the centre of
M
n
(J) is set of scalar matrices J 1
n
. Thus C() =J 1
n
.
(c) Let be the set of diagonal matrices in M
n
(J). In this case, C() =.
Notice that in all three cases, C(C()) =.
Simple Jalgebras and their modules 105
THEOREM 7.21 (DOUBLE CENTRALIZER THEOREM) Let be an Jalgebra, and let V
be a faithful semisimple module. Then C(C()) = (centralizers taken in End
T
(V )).
PROOF. Let D = C() and let T = C(D). Clearly T, and the reverse inclusion
follows from the next lemma when we take
1
. . . . .
n
to generate V as a Jvector space.
2
LEMMA 7.22 For any
1
. . . . .
n
V and b T, there exists an a such that
a
1
=b
1
. a
2
=b
2
. . . . . a
n
=b
n
.
PROOF. We rst prove this for n =1. Note that
1
is an submodule of V , and so (see
7.13) there exists an submodule W of V such that V =
1
W . Let : V V be the
map (a
1
. n) (a
1
. 0) (projection onto
1
). It is linear, hence lies in D, and has the
property that () = if and only if
1
. Now
(b
1
) =b(
1
) =b
1
.
and so b
1
1
, as required.
We now prove the general case. Let W be the direct sum of n copies of V with acting
diagonally, i.e.,
a(
1
. . . . .
n
) =(a
1
. . . . . a
n
). a .
i
V.
Then W is again a semisimple module (7.14). The centralizer of in End
T
(W ) consists
of the matrices (;
i}
)
1_i,}_n
, ;
i}
End
T
(V ), such that (;
i}
a) =(a;
i}
) for all a , i.e.,
such that ;
i}
D (cf. 7.32). In other words, the centralizer of in End
T
() is M
n
(D). An
argument as in Example 7.20(b), using the matrices e
i}
() with in the i th position and
zeros elsewhere, shows that the centralizer of M
n
(D) in End
T
(W ) consists of the diagonal
matrices
_
_
_
_
_
0 0
0 0
.
.
.
.
.
.
.
.
.
.
.
.
0 0
_
_
_
_
_
with T. We now apply the case n = 1 of the lemma to , W , b, and the vector
(
1
. . . . .
n
) to complete the proof.
2
THEOREM 7.23 Every simple Jalgebra is isomorphic to M
n
(D) for some n and some
division Jalgebra D.
PROOF. Choose a simple module S, for example, any minimal left ideal of . Then
acts faithfully on S, because the kernel of End
T
(S) will be a twosided ideal of not
containing 1, and hence is 0.
Let D be the centralizer of in the Jalgebra End
T
(S) of Jlinear maps S S.
According to the double centralizer theorem (7.21), the centralizer of D in End
T
(S) is
, i.e., = End
T
(S). Schurs lemma (7.24 below) implies that D is a division algebra.
Therefore S is a free Dmodule (7.18), say, S ~D
n
, and so End
T
(S) ~M
n
(D
opp
) (see
7.19).
2
LEMMA 7.24 (SCHURS LEMMA) For every Jalgebra and simple module S, End
(S)
is a division algebra.
PROOF. Let ; be an linear map S S. Then Ker(;) is an submodule of S, and so
it is either S or 0. In the rst case, ; is zero, and in the second it is an isomorphism, i.e., it
has an inverse that is also linear.
2
106 7. REPRESENTATIONS OF FINITE GROUPS
MODULES OVER SIMPLE JALGEBRAS
For any Jalgebra , the submodules of
are the left ideals in , and the simple sub
modules of
are the minimal left ideals.
PROPOSITION 7.25 Any two minimal left ideals of a simple Jalgebra are isomorphic as
left modules, and
is a direct sum of its minimal left ideals.
PROOF. After Theorem 7.23, we may assume that =M
n
(D) for some division algebra
D. We saw in (7.16) that the minimal left ideals in M
n
(D) are those of the form 1({ ]).
Clearly =
1_}_n
1({ ]) and each 1({ ]) is isomorphic to D
n
with its natural action
of M
n
(D).
2
THEOREM 7.26 Let be a simple Jalgebra, and let S be a simple module. Then every
module is isomorphic to a direct sum of copies of S.
PROOF. Let S
0
be a minimal left ideal of . The proposition shows that
~S
n
0
for some
n. Let e
1
. . . . . e
i
be a set of generators for V as an module. The map
(a
1
. . . . . a
i
)
a
i
e
i
realizes V as a quotient of a direct sum of r copies of
, and hence as a quotient of nrS
0
.
Thus, V is a sum of simple submodules each isomorphic to S
0
, and so Proposition 7.12
shows that V ~mS
0
for some m.
2
COROLLARY 7.27 Let be a simple Jalgebra. Then any two simple modules are
isomorphic, and any two modules having the same dimension over J are isomorphic.
PROOF. Obvious from the Theorem.
2
COROLLARY 7.28 The integer n in Theorem 7.23 is uniquely determined by , and D is
uniquely determined up to isomorphism.
PROOF. If ~M
n
(D), then D ~End
_
_
_
_
_
_
_
_
11
1}
1n
.
.
.
.
.
.
.
.
.
i1
i}
}n
.
.
.
.
.
.
.
.
.
n1
n}
nn
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
.
1
.
.
.
.
}
.
.
.
.
n
_
_
_
_
_
_
_
_
def
=
_
_
_
_
_
_
_
_
11
(.
1
)
1n
(.
n
)
.
.
.
i1
(.
1
)
i n
(.
n
)
.
.
.
n1
(.
1
)
nn
(.
n
)
_
_
_
_
_
_
_
_
.
Thus, we see
Hom
(M. N) .
_
Hom
(M
}
. N
i
)
_
1_}_n, 1_i_n
(30)
1
The tensor product D
T
D
t
of two central simple algebras over J is again a central simple algebra, and
hence is isomorphic to M
i
(D
tt
) for some central simple algebra D
tt
. Dene
DD
t
 =D
tt
.
This product is associative because of the associativity of tensor products, the isomorphism class of J is an
identity element, and D
opp
 is an inverse for D.
108 7. REPRESENTATIONS OF FINITE GROUPS
(isomorphism of Jvector spaces). When M = N, this becomes an isomorphism of J
algebras. For example, if M is a direct sum of m copies of M
0
, then
End
(M) .M
n
(End
(M
0
)) (31)
(mm matrices with coefcients in the ring End
(M
0
)).
THEOREM 7.33 Let V be a nite dimensional Jvector space, and let be an Jsubalgebra
of End
T
(V ). If V is semisimple as an module, then the centralizer of in End
T
(V ) is
a product of simple Jalgebras (hence it is a semisimple Jalgebra).
PROOF. By assumption, we can write V ~
i
r
i
S
i
where the S
i
are simple modules,
no two of which are isomorphic. The centralizer of in End
T
(V ) is End
(V ), and
End
(V ) ~End
i
r
i
S
i
). Because Hom
(S
}
. S
i
) =0 for i = ,
End
r
i
S
i
) .
i
End
(r
i
S
i
) by (30)
.
i
M
i
i
(D
i
) by (31)
where D
i
=End
(S
i
). According to Schurs lemma (7.24), D
i
is a division algebra, and
therefore M
i
i
(D
i
) is a simple Jalgebra (see 7.16).
2
THEOREM 7.34 Every semisimple Jalgebra is isomorphic to a product of simple J
algebras.
PROOF. Choose an module V on which acts faithfully, for example, V =
. Then
is equal to its double centralizer C(C()) in End
T
(V ) (see 7.21). According to Theorem
7.33, C() is semisimple, and so C(C()) is a product of simple algebras.
2
Modules over a semisimple Jalgebra
Let =T C be a product of Jalgebras. A Tmodule M becomes an module with
the action
(b. c)m=bm.
THEOREM 7.35 Let be a semisimple Jalgebra, say, =
1
t
with the
i
simple. For each
i
, let S
i
be a simple
i
module (cf. 7.27).
(a) Each S
i
is a simple module, and every simple module is isomorphic to exactly
of the S
i
.
(b) Every module is isomorphic to
r
i
S
i
for some r
i
N, and two modules
r
i
S
i
and
r
t
i
S
i
are isomorphic if and only if r
i
=r
t
i
for all i .
PROOF. (a) It is obvious that each S
i
is simple when regarded as an module, and that no
two of themare isomorphic. It follows from(7.25) that
r
i
S
i
for some r
i
N. Let S
be a simple module, and let . be a nonzero element of S. Then the map a a.:
S
is surjective, and so its restriction to some S
i
in
is nonzero, and hence an isomorphism.
(b) The rst part follows from (a) and the denition of a semisimple ring, and the second
part follows from (7.11).
2
The representations of G 109
The representations of G
PROPOSITION 7.36 The dimension of the centre of JG as an Jvector space is the num
ber of conjugacy classes in G.
PROOF. Let C
1
. . . . . C
t
be the conjugacy classes in G, and, for each i , let c
i
be the element
oC
i
a in JG. We shall prove the stronger statement:
centre of JG =Jc
1
Jc
t
(32)
As c
1
. . . . . c
t
are obviously linearly independent, it sufces to showthat they span the centre.
For any g G and
oG
m
o
a JG,
g
_
oG
m
o
a
_
g
1
=
oG
m
o
gag
1
.
The coefcient of a in the right hand sum is m
1
o
, and so
g
_
oG
m
o
a
_
g
1
=
oG
m
1
o
a.
This shows that
oG
m
o
a lies in the centre of JG if and only if the function a m
o
is
constant on conjugacy classes, i.e., if and only if
oG
m
o
a
i
Jc
i
.
2
REMARK 7.37 An element
oG
m
o
a of JG can be regarded as a map a m
o
: G
J. In this way, JG . Map(G. J). The action of G on JG corresponds to the action
(g )(a) = (g
1
a) of g G on : G J. In the above proof, we showed that the
elements of the centre of JG correspond exactly to the functions : G J that are
constant on each conjugacy class. Such functions are called class functions.
In the remainder of this chapter, we assume that J is an algebraically closed eld of
characteristic zero (e.g., C)
PROPOSITION 7.38 The group algebra JG is isomorphic to a product of matrix algebras
over J.
PROOF. Recall that, when J has characteristic zero, Maschkes theorem (7.9) implies that
JG is semisimple, and so is a product of simple algebras (7.35). Each of these is a matrix
algebra over a division algebra (7.23), but the only division algebra over an algebraically
closed eld is the eld itself (7.29).
2
The representation G GL(
TGj
JG) is called the regular representation.
THEOREM 7.39 (a) The number of isomorphism classes of simple JGmodules is equal
to the number of conjugacy classes in G.
(b) The multiplicity of any simple representation S in the regular representation is equal
to its degree dim
T
S.
(c) Let S
1
. . . . . S
t
be a set of representatives for the isomorphism classes of simple JG
modules, and let
i
=dim
T
S
i
. Then
1_i_t
2
i
=[G[.
110 7. REPRESENTATIONS OF FINITE GROUPS
PROOF. (a) Under our hypothesis, JG ~M
(
1
(J) M
(
t
(J) for some integers
1
. . . . .
t
.
According to Theorem 7.35, the number of isomorphism classes of simple JGmodules
is the number of factors t . The centre of a product of Jalgebras is the product of their
centres, and so the centre of JG is isomorphic to tJ. Therefore t is the dimension of the
centre of J, which we know equals the number of conjugacy classes of G.
(b) With the notations of (7.15), M
(
(J) .1(1) 1( ).
(c) The equality is simply the statement
1_i_t
dim
T
M
(
i
(J) =dim
T
JG.
2
The characters of G
Recall that the trace Tr
V
() of an endomorphism : V V of a vector space V is
a
i i
where (a
i}
) is the matrix of with respect to some basis for V . It is independent of the
choice of the basis (the traces of conjugate matrices are equal).
From each representation of g g
V
: G GL(V ), we obtain a function
V
on G.
V
(g) =Tr
V
(g
V
).
called the character of j. Note that
V
depends only on the isomorphism class of the
JGmodule V , and that
V
is a class function. The character is said to be simple (or
irreducible) if it is dened by a simple JGmodule. The principal character
1
is that
dened by the trivial representation of G (so
1
(g) = 1 for all g G), and the regular
character
reg
is that dened by the regular representation. On computing
reg
(g) by using
the elements of G as a basis for JG, one see that
reg
(g) is the number of elements a of
G such that ga =a, and so
reg
(g) =
_
[G[ if g =e
0 otherwise.
When V has dimension 1, the character
V
of j is said to be linear. In this case, GL(V ) .
J
, and so
V
(g) = j(g). Therefore,
V
is a homomorphism G J
, and so this
denition of linear character essentially agrees with the earlier one.
LEMMA 7.40 For any Gmodules V and V
t
,
V V
0 =
V
V
0 .
PROOF. Compute the matrix of g
1
with respect to a basis of V V
t
that is made by com
bining a basis for V with a basis for V
t
.
2
Let S
1
. . . . . S
t
be a set of representatives for the isomorphism classes of simple JG
modules with S
1
chosen to be the trivial representation, and let
1
. . . . .
t
be the corre
sponding characters.
PROPOSITION 7.41 The functions
1
. . . . .
t
are linearly independent over J, i.e., if c
1
. . . . . c
t
J are such that
i
c
i
i
(g) =0 for all g G, then the c
i
are all zero.
The characters of G 111
PROOF. Write JG ~ M
(
1
(J) M
(
t
(J), and let e
}
= (0. . . . . 0. 1. 0. . . . . 0). Then
e
}
acts as 1 on S
}
and as 0 on S
}
for i = , and so
i
(e
}
) =
_
}
=dim
T
S
}
if i =
0 otherwise.
(33)
Therefore,
i
c
i
i
(e
}
) =c
}
}
,
from which the claim follows.
2
PROPOSITION 7.42 Two JGmodules are isomorphic if and only if their characters are
equal.
PROOF. We have already observed that the character of a representation depends only
on its isomorphism class. Conversely, if V =
1_i_t
c
i
S
i
, c
i
N, then its character is
V
=
1_i_t
c
i
i
, and (33) shows that c
i
=
V
(e
i
),
i
. Therefore
V
determines the
multiplicity with which each S
i
occurs in V , and hence it determines the isomorphism
class of V .
2
ASIDE 7.43 The proposition is false if J is allowed to have characteristic = 0. For example,
the representation o
i
_
1 i
0 1
_
: C
]
GL
2
(J) of (7.1c) is not trivial, but it has the same character
as the trivial representation. The proposition is false even when the characteristic of J doesnt
divide the order of the group, because, for any representation G GL(V ), the character of the
representation of G on V is identically zero. However, a theorem of Brauer and Nesbitt says that,
for nitedimensional representations j
1
and j
2
of an Jalgebra , if j
1
(a) and j
2
(a) have the
same characteristic polynomials for all a , then the representations are isomorphic (cf. mo6560).
Any function G J that can be expressed as a Zlinear combination of characters is
called a virtual character.
2
PROPOSITION 7.44 The simple characters of G form a Zbasis for the virtual characters
of G.
PROOF. Let
1
. . . . .
t
be the simple characters of G. Then the characters of G are exactly
the class functions that can be expressed in the form
m
i
i
, m
i
N, and so the virtual
characters are exactly the class functions that can be expressed
m
i
i
, m
i
Z. Therefore
the simple characters certainly generate the Zmodule of virtual characters, and Proposition
7.41 shows that they are linearly independent over Z (even over J).
2
PROPOSITION 7.45 The simple characters of G form an Jbasis for the class functions on
G.
PROOF. The class functions are the functions from the set of conjugacy classes in G to
J. As this set has t elements, they form an Jvector space of dimension t . As the simple
characters are a set of t linearly independent elements of this vector space, they must form
a basis.
2
2
Some authors call it a generalized character, but this is to be avoided: there is more than one way to
generalize the notion of a character.
112 7. REPRESENTATIONS OF FINITE GROUPS
We now assume that J is a subeld of C stable under complex conjugation c c.
For class functions
1
and
2
on G, dene
(
1
[
2
) =
1
[G[
oG
1
(a)
2
(a).
LEMMA 7.46 The pairing ( [ ) is an inner product on the Jspace of class functions on G.
PROOF. We have to check:
(
1
2
[ ) =(
1
[ ) (
2
[ ) for all class functions
1
.
2
. ;
(c
1
[
2
) =c(
1
.
2
) for c J and class functions
1
.
2
;
(
2
[
1
) =(
1
[
2
) for all class functions
1
.
2
;
( [ ) > 0 for all nonzero class functions .
All of these are obvious from the denition.
2
For an JGmodule V , V
G
denotes the submodule of elements xed by G:
V
G
={ V [ g = for all g G]
LEMMA 7.47 Let be the element
1
[G[
oG
a of JG. For any JGmodule V ,
V
is
a projector with image V
G
.
PROOF. For any g G,
g =
1
[G[
oG
ga =
1
[G[
oG
a =. (34)
from which it follows that = (in the Jalgebra JG). Therefore, for any JG
module V ,
2
V
=
V
and so
V
is a projector. If is in its image, say =
0
, then
g =g
0
(34)
=
0
=
and so lies in V
G
. Conversely, if V
G
, the obviously =
1
[G[
oG
a =, and so
is in the image of .
2
PROPOSITION 7.48 For any JGmodule V ,
dim
T
V
G
=
1
[G[
oG
V
(a).
PROOF. Let be as in Lemma 7.47. Because
V
is a projector, V is the direct sum of
its 0eigenspace and its 1eigenspace, and we showed that the latter is V
G
. Therefore,
Tr
V
(
V
) =dim
T
V
G
. On the other hand, because the trace is a linear function,
Tr
V
(
V
) =
1
[G[
oG
Tr
V
(a
V
) =
1
[G[
oG
V
(a).
2
THEOREM 7.49 For any JGmodules V and W.
dim
T
Hom
TGj
(V. W ) =(
V
[
W
).
The character table of a group 113
PROOF. The group G acts on the space Hom
T
(V. W ) of Jlinear maps V W by the
rule,
(g)() =g((g)). g G. Hom
T
(V. W ). V.
and Hom
T
(V. W )
G
=Hom
TG
(V. W ).
2
COROLLARY 7.50 If and
t
are simple characters, then
([
t
) =
_
1 if =
t
0 otherwise.
Therefore the simple characters form an orthonormal basis for the space of class functions
on G.
The character table of a group
To be written.
Examples
To be written.
Exercises
71 Let C be an nr matrix with coefcients in a eld J. Show that
{M M
n
(J) [ MC =0]
is a left ideal in M
n
(J), and that every left ideal is of this form for some C.
72 This exercise shows how to recover a nite group G from its category of representa
tions over a eld k. Let S be a nite set, and let be the set of maps S k.
(a) Show that becomes a commutative ring with the product
(
1
2
)(g) =
1
(g)
2
(g).
1
,
2
. g G.
Moreover, when we identify c k with the constant function, becomes a kalgebra.
(b) Show that
.
xS
k
x
(product of copies of k indexed by the elements of S).
and that the k
x
are exactly the minimal ksubalgebras of . Deduce that End
kalg
() .
Sym(S).
(c) Let (
1
.
2
) act on S S by (
1
.
2
)(s
1
. s
2
) =
1
(s
1
)
2
(s
2
); show that this
denes a bijection .Map(S S. k). Now take S =G.
(d) Show that the map r
: G End
klinear
(),
(r
(g) )(g
t
) =(gg
t
). . g. g
t
G
is a representation of G (this is the regular representation).
114 7. REPRESENTATIONS OF FINITE GROUPS
(e) Dene z: by z( )(g
1
. g
2
) = (g
1
g
2
). Show that, for any homomor
phism: of kalgebras such (1)z=z, there exists a unique element
g G such that ( ) =g for all . [Hint: Deduce from (b) that there exists a
bijection : G G such that ( )(g) =(g) for all g G. From the hypothesis
on , deduce that (g
1
g
2
) =g
1
(g
2
) for all g
1
. g
2
G(1). Hence (g) =g (e)
for all g G. Deduce that ( ) =(e) for all .]
(f) Show that the following maps are Gequivariant
e:k (trivial representation on k; r
on )
m: (r
on ; r
on )
z: (r
on ; 1r
on ).
(g) Suppose that we are given, for each nite dimensional representation (V. r
V
), a k
linear map z
V
. If the family (z
V
) satises the conditions
i) for all representations V , W , z
V W
=z
V
z
W
:
ii) for k with its trivial representation, z
k
=id
k
;
iii) for all Gequivariant maps : V W , z
W
= z
V
:
then there exists a unique g G(1) such that z
V
=r
V
(g) for all V . [Hint: show that
z
2
=
2
=()
3
=1
is isomorphic with the symmetric group S
3
of degree 3 by giving, with proof, an explicit
isomorphism.
64. Prove or give a counterexample:
(a) Every group of order 30 has a normal subgroup of order 15.
(b) Every group of order 30 is nilpotent.
65. Let t Z, and let G be the group with generators .. , and relations .,.
1
= ,
t
,
.
3
=1.
(a) Find necessary and sufcient conditions on t for G to be nite.
(b) In case G is nite, determine its order.
66. Let G be a group of order q, =q primes.
(a) Prove G is solvable.
(b) Prove that G is nilpotent G is abelian G is cyclic.
(c) Is G always nilpotent? (Prove or nd a counterexample.)
67. Let X be a set with
n
elements, prime, and let G be a nite group acting transitively
on X. Prove that every Sylow subgroup of G acts transitively on X.
68. Let G =(a. b. c [ bc =cb, a
4
=b
2
=c
2
=1. aca
1
=c, aba
1
=bc). Determine
the order of G and nd the derived series of G.
69. Let N be a nontrivial normal subgroup of a nilpotent group G. Prove that N 7(G) =
1.
70. Do not assume Sylows theorems in this problem.
118 A. ADDITIONAL EXERCISES
(a) Let H be a subgroup of a nite group G, and 1 a Sylow subgroup of G. Prove
that there exists an . G such that .1.
1
H is a Sylow subgroup of H.
(b) Prove that the group of n n matrices
_
_
_
_
1 + . . .
0 1
. . .
0 1
_
_
_
_
is a Sylow subgroup of
GL
n
(F
]
).
(c) Indicate how (a) and (b) can be used to prove that any nite group has a Sylow 
subgroup.
71. Suppose H is a normal subgroup of a nite group G such that G,H is cyclic of order
n, where n is relatively prime to (G : 1). Prove that G is equal to the semidirect product
H S with S a cyclic subgroup of G of order n.
72. Let H be a minimal normal subgroup of a nite solvable group G. Prove that H is
isomorphic to a direct sum of cyclic groups of order for some prime .
73. (a) Prove that subgroups and T of a group G are of nite index in G if and only if
T is of nite index in G.
(b) An element . of a group G is said to be an FCelement if its centralizer C
G
(.) has nite
index in G. Prove that the set of all JC elements in G is a normal.
74. Let G be a group of order
2
q
2
for primes > q. Prove that G has a normal subgroup
of order
n
for some n _1.
75. (a) Let 1 be a nite nilpotent group, and let 1be a subgroup of 1 such that 1 1 =1,
where 1 is the derived subgroup. Prove that 1 =1. [You may assume that a nite group
is nilpotent if and only if every maximal subgroup is normal.]
(b) Let G be a nite group. If G has a subgroup H such that both G,H and H are
nilpotent, prove that G is nilpotent.
76. Let G be a nite noncyclic group. Prove that the following are equivalent:
(a) (G : 7(G)) _
2
.
(b) Every maximal subgroup of G is abelian.
(c) There exist at least two maximal subgroups that are abelian.
77. Prove that every group G of order 56 can be written (nontrivially) as a semidirect
product. Find (with proofs) two nonisomorphic nonabelian groups of order 56.
78. Let G be a nite group and : G G a homomorphism.
(a) Prove that there is an integer n _0 such that
n
(G) =
n
(G) for all integers m_n.
Let =
n
.
(b) Prove that G is the semidirect product of the subgroups Ker and Im.
(c) Prove that Im is normal in G or give a counterexample.
79. Let S be a set of representatives for the conjugacy classes in a nite group G and let H
be a subgroup of G. Show that S H == H =G.
80. Let G be a nite group.
(a) Prove that there is a unique normal subgroup 1 of G such that (i) G,1 is solvable
and (ii) if N is a normal subgroup and G,N is solvable, then N 1.
(b) Show that 1 is characteristic.
(c) Prove that 1 =1. 1 and that 1 =1 or 1 is nonsolvable.
APPENDIX B
Solutions to the Exercises
These solutions fall somewhere between hints and complete solutions. Students were ex
pected to write out complete solutions.
11 By inspection, the only element of order 2 is c =a
2
=b
2
. Since gcg
1
also has order
2, it must equal c, i.e., gcg
1
=c for all g Q. Thus c commutes with all elements of Q,
and {1. c] is a normal subgroup of Q. The remaining subgroups have orders 1, 4, or 8, and
are automatically normal (see 1.36a).
12 The product ab =
_
1 1
0 1
_
, and
_
1 1
0 1
_
n
=
_
1 n
0 1
_
.
13 Consider the subsets {g. g
1
] of G. Each set has exactly 2 elements unless g has order
1 or 2, in which case it has 1 element. Since G is a disjoint union of these sets, there must
be a (nonzero) even number of sets with 1 element, and hence at least one element of order
2.
14 The symmetric group S
n
contains a subgroup that is a direct product of subgroups S
n
1
,
. . . , S
n
r
.
15 Because the group G,N has order n, (gN)
n
= 1 for every g G (see 1.27). But
(gN)
n
=g
n
N, and so g
n
N. For the second statement, consider the subgroup {1. s] of
D
3
. It has index 3 in D
3
, but the element t has order 2, and so t
3
=t {1. s].
16 (a) Let a. b G. We are given that a
2
=b
2
=(ab)
2
=e. In particular, abab =e. On
multiplying this on right by ba, we nd that ab =ba. (b) Show by induction that
_
_
1 a b
0 1 c
0 0 1
_
_
n
=
_
_
1 na nb
n(n1)
2
ac
0 1 nc
0 0 1
_
_
.
17 Commensurability is obviously reexive and symmetric, and so it sufces to prove
transitivity. We shall use that if a subgroup H of a group G has nite index in G, then
H G
t
has nite index in G
t
for any subgroup G
t
of G (because the natural map G
t
,H
119
120 B. SOLUTIONS TO THE EXERCISES
G
t
G,H is injective). Using this, it follows that if H
1
and H
3
are both commensurable
with H
2
, then H
1
H
2
H
3
is of nite index in H
1
H
2
and in H
2
H
3
(and therefore
also in H
1
and H
3
). As H
1
H
3
H
1
H
2
H
3
, it also has nite index in each of H
1
and H
3
.
18 By assumption, the set G is nonempty, so let a G. Because G satises the can
cellation law, the map . a.: G G is a permutuation of G, and some power of this
permutation is the identity permutation. Therefore, for some n _1, a
n
. =. for all . G,
and so a
n
is a left neutral element. By counting, one sees that every element has a left
inverse, and so we can apply (1.10a).
19 Let b be such that the right multiplication . .b is injective. Let a
0
G; there is
a unique e G such that a
0
e =a
0
. Then a
0
eb =a
0
b, which implies that eb =b. Then
aeb =ab for all a , which implies that ae =a. Therefore e is a right neutral element.
For each a G, there is a unique a
t
such that aa
t
=e. Therefore G also has right inverses,
and so it is a group (1.10a).
Let G be a set, and consider the binary operation a. b b on G. This is associative,
and all left multiplications are bijective (in fact, the identity map), but G is not a group if it
has at least two elements.
21 The key point is that (a) =(a
2
) (a
n
). Apply (1.50) to see that D
2n
breaks up as a
product.
22 Note rst that any group generated by a commuting set of elements must be commu
tative, and so the group G in the problem is commutative. According to (2.8), any map
{a
1
. . . . . a
n
] with commutative extends uniquely to homomorphism G , and so
G has the universal property that characterizes the free abelian group on the generators a
i
.
23 (a) If a =b, then the word a ab
1
b
1
is reduced and =1. Therefore, if a
n
b
n
=
1, then a =b. (b) is similar. (c) The reduced form of .
n
, . =1, has length at least n.
24 (a) Universality. (b) C
o
C
o
is commutative, and the only commutative free groups
are 1 and C
o
. (c) Suppose a is a nonempty reduced word in .
1
. . . . . .
n
, say a =.
i
(or
.
1
i
). For =i , the reduced form of .
}
. a
def
=.
}
a.
1
}
a
1
cant be empty, and so a and
.
}
dont commute.
25 The unique element of order 2 is b
2
. Since gb
2
g
1
also has order 2 for any g Q
n
,
we see that gb
2
g
1
= b
2
, and so b
2
lies in the centre. [Check that it is the full centre.]
The quotient group Q
n
,(b
2
) has generators a and b, and relations a
2
n2
= 1, b
2
= 1,
bab
1
=a
1
, which is a presentation for D
2
n2 (see 2.9).
26 (a) A comparison of the presentation D
n
= (r. s [ r
n
. s
2
. srsr = 1) with that for G
suggests putting r =ab and s =a. Check (using 2.8) that there are homomorphisms:
D
n
G. r ab. s a. G D
n
. a s. b s
1
r.
The composites D
n
G D
n
and G D
n
G are the both the identity map on gen
erating elements, and therefore (2.8 again) are identity maps. (b) Omit.
121
27 The hint gives ab
3
a
1
=bc
3
b
1
. But b
3
=1. So c
3
=1. Since c
4
=1, this forces
c =1. From acac
1
=1 this gives a
2
=1. But a
3
=1. So a =1. The nal relation then
gives b =1.
28 The elements .
2
, .,, ,
2
lie in the kernel, and it is easy to see that (.. ,[.
2
. .,. ,
2
)
has order (at most) 2, and so they must generate the kernel (at least as a normal group
the problem is unclear). One can prove directly that these elements are free, or else apply
the NielsenSchreier theorem (2.6). Note that the formula on p. 34 (correctly) predicts that
the kernel is free of rank 2 221 =3
29 We have to show that if s and t are elements of a nite group satisfying t
1
s
3
t =s
5
,
then the given element g is equal to 1. Because the group is nite, s
n
=1 for some n. If
3[n, the proof is easy, and so we suppose that gcd(3. n) =1. But then
3r nr
t
=1, some r. r
t
Z.
and so s
3i
=s. Hence
t
1
st =t
1
s
3i
t =(t
1
s
3
t )
i
=s
5i
.
Now,
g =s
1
(t
1
s
1
t )s(t
1
st ) =s
1
s
5i
ss
5i
=1.
as required. [In such a question, look for a pattern. Note that g has two conjugates in it, as
does the relation for G, and so it is natural to try to relate them.]
31 Let N be the unique subgroup of order 2 in G. Then G,N has order 4, but there is no
subgroup Q G of order 4 with QN = 1 (because every group of order 4 contains a
group of order 2), and so G =N Q for any Q. A similar argument applies to subgroups
N of order 4.
32 For any g G, gMg
1
is a subgroup of order m, and therefore equals M. Thus M
(similarly N) is normal in G, and MN is a subgroup of G. The order of any element of
M N divides gcd(m. n) = 1, and so equals 1. Now (1.51) shows that M N ~ MN,
which therefore has order mn, and so equals G.
33 Show that GL
2
(F
2
) permutes the 3 nonzero vectors in F
2
F
2
(2dimensional vector
space over F
2
).
34 The following solutions were suggested by readers. We write the quaternion group as
Q={1. i. . k].
(A) Take a cube. Write the six elements of Q of order 4 on the six faces with i opposite i ,
etc.. Each rotation of the cube induces an automorphism of Q, and Aut(Q) is the symmetry
group of the cube, S
4
. (B) The group Q has one element of order 2, namely 1, and six
elements of order 4, namely, i , , k. Any automorphism of Q must map 1 to
itself and permute the elements of order 4. Note that i = k, k = i , ki = , so must
122 B. SOLUTIONS TO THE EXERCISES
send the circularly ordered set i. . k to a similar set, i.e., to one of the eight sets in the
following table:
i k i k
i k i k
i k i k
i k i k
Because (1) =1, must permute the rows of the table, and it is not difcult to see that
all permutations are possible.
35 The pair
N =
_
_
_
_
_
1 0 b
0 1 c
0 0 1
_
_
_
_
_
and Q=
_
_
_
_
_
a 0 0
0 a 0
0 0 J
_
_
_
_
_
satises the conditions (i), (ii), (iii) of (3.8). For example, for (i) (Maple says that)
_
_
a 0 b
0 a c
0 0 J
_
_
_
_
1 0 b
0 1 c
0 0 1
_
_
_
_
a 0 b
0 a c
0 0 J
_
_
1
=
_
_
1 0
b
d
1
d
(b ab)
0 1
c
d
1
d
(c ac)
0 0 1
_
_
It is not a direct product of the two groups because it is not commutative.
36 Let g generate C
o
. Then the only other generator is g
1
, and the only nontrivial
automorphism is g g
1
. Hence Aut(C
o
) ={1]. The homomorphism S
3
Aut(S
3
)
is injective because 7(S
3
) = 1, but S
3
has exactly 3 elements a
1
. a
2
. a
3
of order 2 and 2
elements b. b
2
of order 3. The elements a
1
. b generate S
3
, and there are only 6 possibilities
for (a
1
), (b), and so S
3
Aut(S
3
) is also onto.
37 (a) The element g
o(q)
N, and so has order dividing [N[. (c) The element g =
(1. 4. 3)(2. 5), and so this is obvious. (d) By the rst part, ((1. 0. . . . . 0). q)
]
=((1. . . . . 1). 1),
and (1. . . . . 1) has order in (C
]
)
]
. (e) We have (n. q)(n. q) =(nn
1
. qq) =(1. 1).
38 Let n q 7(G). Then
(n q)(1 q
t
) = n qq
t
(1 q
t
)(n q) = q
t
nq
t1
q
t
q
all q
t
Q
_
==
n C
1
(Q)
q 7(Q)
and
(n q)(n
t
1) = nqn
t
q
1
q
(n
t
1)(n q) = n
t
n q
n
t
N
_
== n
1
n
t
n =qn
t
q
1
.
The converse and the remaining statements are easy.
41 Let : G,H
1
G,H
2
be a Gmap, and let (H
1
) = gH
2
. For a G, (aH
1
) =
a(H
1
) = agH
2
. When a H
1
, (aH
1
) = gH
2
, and so agH
2
= gH
2
; hence g
1
ag
H
2
, and so a gH
2
g
1
. We have shown H
1
gH
2
g
1
. Conversely, if g satises this
condition, the aH
1
agH
2
is a welldened map of Gsets.
123
42 (a) Let H be a proper subgroup of G, and let N =N
G
(H). The number of conjugates
of H is (G : N) _(G : H) (see 4.8). Since each conjugate of H has (H : 1) elements and
the conjugates overlap (at least) in {1], we see that
_
gHg
1
c
i
with c
i
equal to 21, 24, 42, or 56, but this doesnt happen.
49 Since G,7(G) Aut(G), we see that G,7(G) is cyclic, and so by (4.19) that G is
commutative. If G is nite and not cyclic, it has a factor C
]
r C
]
s etc..
410 Clearly (i ) =(1 )(1i )(1 ). Hence any subgroup containing (12). (13). . . . contains
all transpositions, and we know S
n
is generated by transpositions.
411 Note that C
G
(.)H =C
1
(.), and so H,C
1
(.) ~H C
G
(.),C
G
(.)). Prove each
class has the same number c of elements. Then
[1[ =(G : C
G
(.)) =(G : H C
G
(.))(H C
G
(.) : C
G
(.)) =kc.
412 (a) The rst equivalence follows fromthe preceding problem. For the second, note that
o commutes with all cycles in its decomposition, and so they must be even (i.e., have odd
length); if two cycles have the same odd length k, one can nd a product of k transpositions
which interchanges them, and commutes with o; conversely, show that if the partition of n
dened by o consists of distinct integers, then o commutes only with the group generated
by the cycles in its cycle decomposition. (b) List of conjugacy classes in S
T
, their size,
125
parity, and (when the parity is even) whether it splits in
T
.
Cycle Size Parity Splits in
T
C
T
(o) contains
1 (1) 1 1 N
2 (12) 21 O
3 (123) 70 1 N (67)
4 (1234) 210 O
5 (12345) 504 1 N (67)
6 (123456) 840 O
7 (1234567) 720 1 Y 720 doesnt divide 2520
8 (12)(34) 105 1 N (67)
9 (12)(345) 420 O
10 (12)(3456) 630 1 N (12)
11 (12)(3456) 504 O
12 (123)(456) 280 1 N (14)(25)(36)
13 (123)(4567) 420 O
14 (12)(34)(56) 105 O
15 (12)(34)(567) 210 1 N (12)
413 According to GAP, n =6, a (13)(26)(45), b (12)(34)(56).
414 Since Stab(g.
0
) =gStab(.
0
)g
1
, if H Stab(.
0
) then H Stab(.) for all ., and
so H = 1, contrary to hypothesis. Now Stab(.
0
) is maximal, and so H Stab(.
0
) = G,
which shows that H acts transitively.
51 Let be a prime dividing [G[ and let 1 be a Sylow subgroup, of order
n
say. The
elements of 1 all have order dividing
n
, and it has at most
1
n1
=
n
1
1
<
n
elements of order dividing
n1
; therefore 1 must have an element of order
n
, and so it
is cyclic. Each Sylow subgroup has exactly
n
elements of order dividing
n
, and so
there can be only one. Now (5.9) shows that G is a product of its Sylow subgroups.
62 No, D
4
and the quaternion group have isomorphic commutator subgroups and quotient
groups but are not isomorphic. Similarly, S
n
and
n
C
2
are not isomorphic when n _5.
APPENDIX C
TwoHour Examination
1. Which of the following statements are true (give brief justications for each of (a), (b),
(c), (d); give a correct set of implications for (e)).
(a) If a and b are elements of a group, then a
2
=1. b
3
=1 == (ab)
6
=1.
(b) The following two elements are conjugate in S
T
:
_
1 2 3 4 5 6 7
3 4 5 6 7 2 1
_
.
_
1 2 3 4 5 6 7
2 3 1 5 6 7 4
_
.
(c) If G and H are nite groups and G
594
~H
594
. then G ~H.
(d) The only subgroup of
5
containing (123) is
5
itself.
(e) Nilpotent == cyclic == commutative == solvable (for a nite group).
2. How many Sylow 11subgroups can a group of order 110 = 2 5 11 have? Classify
the groups of order 110 containing a subgroup of order 10. Must every group of order 110
contain a subgroup of order 10?
3. Let G be a nite nilpotent group. Show that if every commutative quotient of G is cyclic,
then G itself is cyclic. Is the statement true for nonnilpotent groups?
4. (a) Let G be a subgroup of Sym(X), where X is a set with n elements. If G is commu
tative and acts transitively on X, show that each element g =1 of G moves every element
of X. Deduce that (G : 1) _n.
(b) For each m_1, nd a commutative subgroup of S
3n
of order 3
n
.
(c) Show that a commutative subgroup of S
n
has order _3
n
3
.
5. Let H be a normal subgroup of a group G, and let 1 be a subgroup of H. Assume that
every automorphism of H is inner. Prove that G =H N
G
(1).
6. (a) Describe the group with generators . and , and dening relation ,.,
1
=.
1
.
(b) Describe the group with generators . and , and dening relations ,.,
1
= .
1
,
.,.
1
=,
1
.
You may use results proved in class or in the notes, but you should indicate clearly what
you are using.
127
128 C. TWOHOUR EXAMINATION
SOLUTIONS
1. (a) False: in (a. b[a
2
. b
3
), ab has innite order.
(b) True, the cycle decompositions are (1357)(246), (123)(4567).
(c) True, use the KrullSchmidt theorem.
(d) False, the group it generates is proper.
(e) Cyclic == commutative == nilpotent == solvable.
2. The number of Sylow 11subgroups s
11
=1. 12. . . . and divides 10. Hence there is only
one Sylow 11subgroup 1. Have
G =1
0
H. 1 =C
11
. H =C
10
or D
5
.
Now have to look at the maps 0 : H Aut(C
11
) = C
10
. Yes, by the SchurZassenhaus
lemma.
3. Suppose G has class > 1. Then G has quotient H of class 2. Consider
1 7(H) H H,7(H) 1.
Then H is commutative by (4.17), which is a contradiction. Therefore G is commutative,
and hence cyclic.
Alternatively, by induction, which shows that G,7(G) is cyclic.
No! In fact, its not even true for solvable groups (e.g., S
3
).
4. (a) If g. =., then gh. =hg. =h.. Hence g xes every element of X, and so g =1.
Fix an . X; then g g. : G X is injective. [Note that Cayleys theorem gives an
embedding G S
n
, n =(G : 1).]
(b) Partition the set into subsets of order 3, and let G =G
1
G
n
.
(c) Let O
1
. . . . . O
i
be the orbits of G, and let G
i
be the image of G in Sym(O
i
). Then
G G
1
G
i
, and so (by induction),
(G : 1) _(G
1
: 1) (G
i
: 1) _3
n
1
3
3
nr
3
=3
n
3
.
5. Let g G, and let h H be such that conjugation by h on H agrees with conjugation
by g. Then g1g
1
=h1h
1
, and so h
1
g N
G
(1).
6. (a) Its the group .
G =(.) (,) =C
o
0
C
o
with 0: C
o
Aut(C
o
) =1. Alternatively, the elements can be written uniquely in the
form .
i
,
}
, i. Z, and ,. =.
1
,.
(b) Its the quaternion group. From the two relations get
,. =.
1
,. ,. =.,
1
and so .
2
=,
2
. The second relation implies
.,
2
.
1
=,
2
. =,
2
.
and so ,
4
=1.
Alternatively, the ToddCoxeter algorithm shows that it is the subgroup of S
S
generated
by (1287)(3465) and (1584)(2673).
Bibliography
ALPERIN, J. L. AND BELL, R. B. 1995. Groups and representations, volume 162 of
Graduate Texts in Mathematics. SpringerVerlag, New York.
ARTIN, M. 1991. Algebra. Prentice Hall Inc., Englewood Cliffs, NJ.
ASCHBACHER, M. AND SMITH, S. D. 2004. The classication of quasithin groups. I, II,
volume 111, 112 of Mathematical Surveys and Monographs. American Mathematical
Society, Providence, RI. Structure of strongly quasithin 1groups.
BESCHE, H. U., EICK, B., AND OBRIEN, E. A. 2001. The groups of order at most 2000.
Electron. Res. Announc. Amer. Math. Soc. 7:14 (electronic).
BRAUER, R. AND FOWLER, K. A. 1955. On groups of even order. Ann. of Math. (2)
62:565583.
BURNSIDE, W. 1897. Theory of groups of nite order. Cambridge: at the University Press,
Cambridge.
CURTIS, C. W. 1999. Pioneers of representation theory: Frobenius, Burnside, Schur, and
Brauer, volume 15 of History of Mathematics. American Mathematical Society, Provi
dence, RI.
FEIT, W. 1995. On the work of Em Zelmanov. In Proceedings of the International
Congress of Mathematicians, Vol. 1, 2 (Z urich, 1994), pp. 1724, Basel. Birkh auser.
FEIT, W. AND THOMPSON, J. G. 1963. Solvability of groups of odd order. Pacic J. Math.
13:7751029.
GLAUBERMAN, G. 1999. A new look at the FeitThompson odd order theorem. Mat.
Contemp. 16:7392. 15th School of Algebra (Portuguese) (Canela, 1998). Available at
www.mat.unb.br/
~
matcont/16_5.ps.
HALL, JR., M. 1959. The theory of groups. The Macmillan Co., New York, N.Y.
HUMPHREYS, J. E. 1990. Reection groups and Coxeter groups, volume 29 of Cambridge
Studies in Advanced Mathematics. Cambridge University Press, Cambridge.
MASSEY, W. S. 1967. Algebraic topology: An introduction. Harcourt, Brace & World,
Inc., New York.
PYBER, L. 1993. Enumerating nite groups of given order. Ann. of Math. (2) 137:203220.
129
130 BIBLIOGRAPHY
RONAN, M. 2006. Symmetry and the monster. One of the greatest quests of mathematics.
Oxford University Press, Oxford.
ROTMAN, J. J. 1995. An introduction to the theory of groups, volume 148 of Graduate
Texts in Mathematics. SpringerVerlag, New York, fourth edition.
SCHUPP, P. E. 1987. A characterization of inner automorphisms. Proc. Amer. Math. Soc.
101:226228.
SERRE, J.P. 1980. Trees. SpringerVerlag, Berlin. Translated from the French by John
Stillwell.
SERRE, J.P. 2003. On a theorem of Jordan. Bull. Amer. Math. Soc. (N.S.) 40:429440.
SOLOMON, R. 2001. A brief history of the classication of the nite simple groups. Bull.
Amer. Math. Soc. (N.S.) 38:315352.
SYLOW, M. L. 1872. Th eor` emes sur les groupes de substitutions. Math. Ann. 5:584594.
WILD, M. 2005. The groups of order sixteen made easy. Amer. Math. Monthly 112:2031.
Index
action
doubly transitive, 59
effective, 57
faithful, 57
free, 59
imprimitive, 72
kfold transitive, 59
left, 57
linear, 98
primitive, 72
right, 58
transitive, 59
trivial, 57
algebra
division, 103
group, 101
quaternion, 103
semisimple, 107
simple, 103
algorithm
ToddCoxeter, 38, 70
n
, 65
automorphism
inner, 43
of a bilinear form, 10
of a group, 43
outer, 43
basis
for a commutative group, 25
block, 72
centralizer
of element, 60
of subgroup, 115
centralizer, of a subalgebra, 104
centre
of a group, 12
class
nilpotency, 90
class equation
class, 62
C
n
, 9
commutator, 24, 35
composition factors, 87
conjugacy class, 58
coset
left, 17
right, 17
Coxeter system, 38
cycle, 66
dimension, 104
disjoint cycles
disjoint, 66
D
n
, 13
element
neutral, 8
elementary divisors, 26
equivariant map, 58
exact sequence, 50
exponent
of a group, 29, 37
extension
central, 50
isomorphic, 50
split, 50
extension, of groups, 50
faithful representation, 97
ag
full, 80
Frattinis argument, 93
Gmap, 58
Gset, 57
generates, 13
generators
of a group, 35
GL
n
(J), 10
group, 7
4, 14
, 94
abelian, 9
additive, 7
alternating, 65
131
132 INDEX
Burnside, 38
commutative, 9
complete, 44
Coxeter, 38
cyclic, 13
dihedral, 13
nite reection, 39
nitely presented, 37
free, 33
free abelian, 35
general linear, 10
indecomposable, 95
isotropy, 59
metabelian, 90
metacyclic, 117
multiplicative, 7
nilpotent, 90
of rigid motions, 58
of symmetries, 9
orthogonal, 10
, 8
permutation, 9
primitive, 72
quaternion, 14
generalized, 35
quotient, 21
reection, 39
simple, 19
soluble, 87
solvable, 70, 87
special linear, 20
symplectic, 10
with operators, 94
group.
factor, 21
groups
of order 12, 83
of order 2
n
n
, m_3., 84
of order 2, 62
of order 30, 82
of order 60, 84
of order 99, 81
of order , 18
of order
2
, 63
of order
3
, 83
of order q, 82
of small order, 14
homogeneous, 59
homomorphism
admissible, 94
normal, 54
of groups, 15
index
of a subgroup, 17
invariant factors, 26
inverse, 8
inversion, of a permutation, 64
isomorphism
of Gsets, 58
of groups, 8, 15
kernel, 20
Klein Viergruppe, 14
length
of a subnormal series, 85
solvable, 90
length of a cycle, 66
map, of Gsets, 58
module
semisimple, 97
simple, 97
monoid
free, 31
negative, 8
normalizer
of a subgroup, 60
opposite algebra, 97
orbit, 58
order
of a group, 8
of an element, 9
partition
of a natural number, 67
stabilized, 71
permutation
even, 64
odd, 64
presentation
of a group, 35
problem
Burnside, 37
restricted Burnside, 38
word, 37
product
direct, 9, 23
knit, 50
semidirect, 46
ZappaSz ep, 50
projector, 100
quotients, of a normal series
of a normal series, 85
rank
Index 133
of a commutative group, 26
of a Coxeter system, 38
of a free group, 34
reduced form
of a word, 32
reection, 39
relations, 35
dening, 35
representation
linear, 98
matrix, 97
series
admissible subnormal, 95
ascending central, 90
composition, 85
derived, 90
normal, 85
solvable, 87
subnormal, 85
without repetitions, 85
signature, 64
skew eld, 103
S
n
, 9, 14
stabilizer
of a subset, 60
of an element, 59
stable subset
stable, 58
subgroup, 12
invariant, 94
admissible, 94
characteristic, 45
commutator, 89
rst derived, 89
generated by a set, 13
normal, 18
normal generated by a set, 20
second derived, 90
Sylow , 77
torsion, 10
subset
normal, 20
support
of a cycle, 66
table
multiplication, 11
theorem
Cauchy, 62
Cayley, 16
centre of a group, 63
commutative groups have bases, 25
correspondence, 22
double centralizer, 105
factorization of homomorphisms, 22
FeitThompson, 88
Galois, 69
isomorphism, 22
JordanH older, 86
KrullSchmidt, 96
Lagrange, 17
Maschke, 99
NielsenSchreier, 34
nilpotency condition, 92
primitivity condition, 73
SchurZassenhaus, 51
structure of commutative groups, 26
structure of Coxeter groups, 39
Sylow I, 77
Sylow II, 79
Sylow subgroups of subgroups, 81
transposition, 14
word, 31
reduced, 32
words
equivalent, 33