Part IA - Groups: Based On Lectures by J. Goedecke

Part IA — Groups
Based on lectures by J. Goedecke

Notes taken by Dexter Chua
Michaelmas 2014
These notes are not endorsed by the lecturers, and I have modified them (often
significantly) after lectures. They are nowhere near accurate representations of what
was actually lectured, and in particular, all errors are almost surely mine.
Examples of groups
Axioms for groups. Examples from geometry: symmetry groups of regular polygons,
cube, tetrahedron. Permutations on a set; the symmetric group. Subgroups and
homomorphisms. Symmetry groups as subgroups of general permutation groups. The
Möbius group; cross-ratios, preservation of circles, the point at infinity. Conjugation.
Fixed points of Möbius maps and iteration. [4]
Lagrange’s theorem
Cosets. Lagrange’s theorem. Groups of small order (up to order 8). Quaternions.
Fermat-Euler theorem from the group-theoretic point of view. [5]
Group actions
Group actions; orbits and stabilizers. Orbit-stabilizer theorem. Cayley’s theorem
(every group is isomorphic to a subgroup of a permutation group). Conjugacy classes.
Cauchy’s theorem. [4]
Quotient groups
Normal subgroups, quotient groups and the isomorphism theorem. [4]
Matrix groups
The general and special linear groups; relation with the Möbius group. The orthogonal
and special orthogonal groups. Proof (in R3 ) that every element of the orthogonal
group is the product of reflections and every rotation in R3 has an axis. Basis change
as an example of conjugation. [3]
Permutations
Permutations, cycles and transpositions. The sign of a permutation. Conjugacy in Sn
and in An . Simple groups; simplicity of A5 . [4]
1
Contents IA Groups
Contents
0 Introduction 4
1 Groups and homomorphisms 6

1.1 Groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
1.2 Homomorphisms . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
1.3 Cyclic groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
1.4 Dihedral groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
1.5 Direct products of groups . . . . . . . . . . . . . . . . . . . . . . 14
2 Symmetric group I 16
2.1 Symmetric groups . . . . . . . . . . . . . . . . . . . . . . . . . . 16
2.2 Sign of permutations . . . . . . . . . . . . . . . . . . . . . . . . . 18
3 Lagrange’s Theorem 21
3.1 Small groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
3.2 Left and right cosets . . . . . . . . . . . . . . . . . . . . . . . . . 25
4 Quotient groups 26
4.1 Normal subgroups . . . . . . . . . . . . . . . . . . . . . . . . . . 26
4.2 Quotient groups . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
4.3 The Isomorphism Theorem . . . . . . . . . . . . . . . . . . . . . 28
5 Group actions 30
5.1 Group acting on sets . . . . . . . . . . . . . . . . . . . . . . . . . 30
5.2 Orbits and Stabilizers . . . . . . . . . . . . . . . . . . . . . . . . 31
5.3 Important actions . . . . . . . . . . . . . . . . . . . . . . . . . . 32
5.4 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
6 Symmetric groups II 37
6.1 Conjugacy classes in Sn . . . . . . . . . . . . . . . . . . . . . . . 37
6.2 Conjugacy classes in An . . . . . . . . . . . . . . . . . . . . . . . 38
7 Quaternions 40
8 Matrix groups 42
8.1 General and special linear groups . . . . . . . . . . . . . . . . . . 42
8.2 Actions of GLn (C) . . . . . . . . . . . . . . . . . . . . . . . . . . 42
8.3 Orthogonal groups . . . . . . . . . . . . . . . . . . . . . . . . . . 43
8.4 Rotations and reflections in R2 and R3 . . . . . . . . . . . . . . . 45
8.5 Unitary groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46
9 More on regular polyhedra 48

9.1 Symmetries of the cube . . . . . . . . . . . . . . . . . . . . . . . 48
9.2 Symmetries of the tetrahedron . . . . . . . . . . . . . . . . . . . 49
2
Contents IA Groups
10 Möbius group 50
10.1 Möbius maps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50
10.2 Fixed points of Möbius maps . . . . . . . . . . . . . . . . . . . . 52
10.3 Permutation properties of Möbius maps . . . . . . . . . . . . . . 53
10.4 Cross-ratios . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
11 Projective line (non-examinable) 56
3
0 Introduction IA Groups
0 Introduction
Group theory is an example of algebra. In pure mathematics, algebra (usually)
does not refer to the boring mindless manipulation of symbols. Instead, in
algebra, we have some set of objects with some operations on them. For example,
we can take the integers with addition as the operation. However, in algebra, we
allow any set and any operations, not just numbers.
Of course, such a definition is too broad to be helpful. We categorize algebraic
structures into different types. In this course, we will study a particular kind of
structures, groups. In the IB Groups, Rings and Modules course, we will study
rings and modules as well.
These different kinds of structures are defined by certain axioms. The group
axioms will say that the operation must follow certain rules, and any set and
operation that satisfies these rules will be considered to form a group. We will
then have a different set of axioms for rings, modules etc.
As mentioned above, the most familiar kinds of algebraic structures are
number systems such as integers and rational numbers. The focus of group
theory, however, is not on things that resemble “numbers”. Instead, it is the
study of symmetries.
First of all, what is a symmetry? We are all familiar with, say, the symmetries
of an (equilateral) triangle (we will always assume the triangle is equilateral). We
rotate a triangle by 120◦ , and we get the original triangle. We say that rotating
by 120◦ is a symmetry of a triangle. In general, a symmetry is something we do
to an object that leaves the object intact.
Of course, we don’t require that the symmetry leaves everything intact.
Otherwise, we would only be allowed to do nothing. Instead, we require certain
important things to be intact. For example, when considering the symmetries
of a triangle, we only care about how the resultant object looks, but don’t care
about where the individual vertices went.
In the case of the triangle, we have six symmetries: three rotations (rotation
by 0◦ , 120◦ and 240◦ ), and three reflections along the axes below:
These six together form the underlying set of the group of symmetries. A more
sophisticated example is the symmetries of R3 . We define these as operations on
R3 that leave distances between points unchanged. These include translations,
rotations, reflections, and combinations of these.
So what is the operation? This operation combines two symmetries to give a
new symmetry. The natural thing to do is to do the symmetry one after another.
For example, if we combine the two 120◦ rotations, we get a 240◦ rotation.
Now we are studying algebra, not geometry. So to define the group, we
abstract away the triangle. Instead, we define the group to be six objects, say
{e, r, r2 , s, rs, r2 s}, with rules defining how we combine two elements to get a
third. Officially, we do not mention the triangle at all when defining the group.
4
0 Introduction IA Groups
We can now come up with the group axioms. What rules should the set of
symmetries obey? First of all, we must have a “do nothing” symmetry. We call
this the identity element. When we compose the identity with another symmetry,
the other symmetry is unchanged.
Secondly, given a symmetry, we can do the reverse symmetry. So for any
element, there is an inverse element that, when combined with the original, gives
the identity.
Finally, given three symmetries, we can combine them, one after another. If
we denote the operation of the group as ∗, then if we have three symmetries,
x, y, z, we should be able to form x ∗ y ∗ z. If we want to define it in terms of
the binary operation ∗, we can define it as (x ∗ y) ∗ z, where we first combine
the first two symmetries, then combine the result with the third. Alternatively,
we can also define it as x ∗ (y ∗ z). Intuitively, these two should give the same
result, since both are applying x after y after z. Hence we have the third rule
x ∗ (y ∗ z) = (x ∗ y) ∗ z.
Now a group is any set with an operation that satisfies the three rules above.
In group theory, the objective is to study the properties of groups just assuming
these three axioms. It turns out that there is a lot we can talk about.
5
1 Groups and homomorphisms IA Groups
1 Groups and homomorphisms

1.1 Groups
Definition (Binary operation). A (binary) operation is a way of combining two
elements to get a new element. Formally, it is a map ∗ : A × A → A.
Definition (Group). A group is a set G with a binary operation ∗ satisfying
the following axioms:
1. There is some e ∈ G such that for all a, we have
a ∗ e = e ∗ a = a. (identity)
2. For all a ∈ G, there is some a−1 ∈ G such that
a ∗ a−1 = a−1 ∗ a = e. (inverse)
3. For all a, b, c ∈ G, we have
(a ∗ b) ∗ c = a ∗ (b ∗ c). (associativity)
Definition (Order of group). The order of the group, denoted by |G|, is the
number of elements in G. A group is a finite group if the order is finite.
Note that technically, the inverse axiom makes no sense, since we have not
specified what e is. Even if we take it to be the e given by the identity axiom,
the identity axiom only states there is some e that satisfies that property, but
there could be many! We don’t know which one a ∗ a−1 is supposed to be equal
to! So we should technically take that to mean there is some a−1 such that
a ∗ a−1 and a−1 ∗ a satisfy the identity axiom. Of course, we will soon show that
identities are indeed unique, and we will happily talk about “the” identity.
Some people put a zeroth axiom called “closure”:
0. For all a, b ∈ G, we have a ∗ b ∈ G. (closure)
Technically speaking, this axiom also makes no sense — when we say ∗ is a
binary operation, by definition, a ∗ b must be a member of G. However, in
practice, we often have to check that this axiom actually holds. For example, if
we let G be the set of all matrices of the form
 
1 x y
0 1 z 
0 0 1
under matrix multiplication, we will have to check that the product of two such
matrices is indeed a matrix of this form. Officially, we are checking that the
binary operation is a well-defined operation on G.
It is important to know that it is generally not true that a ∗ b = b ∗ a. There is
no a priori reason why this should be true. For example, if we are considering the
symmetries of a triangle, rotating and then reflecting is different from reflecting
and then rotating.
However, for some groups, this happens to be true. We call such groups
abelian groups.
6
Definition (Abelian group). A group is abelian if it satisfies

4. (∀a, b ∈ G) a ∗ b = b ∗ a. (commutativity)
If it is clear from context, we are lazy and leave out the operation ∗, and
write a ∗ b as ab. We also write a2 = aa, an = aaa
| {z· · · a}, a0 = e, a−n = (a−1 )n
n copies
etc.
Example. The following are abelian groups:
(i) Z with +
(ii) Q with +
(iii) Zn (integers mod n) with +n
(iv) Q∗ with ×
(v) {−1, 1} with ×
The following are non-abelian groups:
(vi) Symmetries of an equilateral triangle (or any n-gon) with composition.
(D2n )
(vii) 2 × 2 invertible matrices with matrix multiplication (GL2 (R))
(viii) Symmetry groups of 3D objects
Recall that the first group axiom requires that there exists an identity element,
which we shall call e. Then the second requires that for each a, there is an inverse
a−1 such that a−1 a = e. This only makes sense if there is only one identity e, or
else which identity should a−1 a be equal to?
We shall now show that there can only be one identity. It turns out that the
inverses are also unique. So we will talk about the identity and the inverse.
Proposition. Let (G, ∗) be a group. Then
(i) The identity is unique.
(ii) Inverses are unique.
Proof.
(i) Suppose e and e0 are identities. Then we have ee0 = e0 , treating e as an
inverse, and ee0 = e, treating e0 as an inverse. Thus e = e0 .
(ii) Suppose a−1 and b both satisfy the inverse axiom for some a ∈ G. Then
b = be = b(aa−1 ) = (ba)a−1 = ea−1 = a−1 . Thus b = a−1 .
Proposition. Let (G, ∗) be a group and a, b ∈ G. Then
(i) (a−1 )−1 = a
(ii) (ab)−1 = b−1 a−1
Proof.
7
(i) Given a−1 , both a and (a−1 )−1 satisfy
xa−1 = ax−1 = e.
By uniqueness of inverses, (a−1 )−1 = a.

(ii) We have
(ab)(b−1 a−1 ) = a(bb−1 )a−1

= aea−1
= aa−1
=e
Similarly, (b−1 a−1 )ab = e. So b−1 a−1 is an inverse of ab. By the uniqueness
of inverses, (ab)−1 = b−1 a−1 .
Sometimes if we have a group G, we might want to discard some of the
elements. For example if G is the group of all symmetries of a triangle, we might
one day decide that we hate reflections because they reverse orientation. So
we only pick the rotations in G and form a new, smaller group. We call this a
subgroup of G.
Definition (Subgroup). A H is a subgroup of G, written H ≤ G, if H ⊆ G and
H with the restricted operation ∗ from G is also a group.
Example.
– (Z, +) ≤ (Q, +) ≤ (R, +) ≤ (C, +)

– (e, ∗) ≤ (G, ∗) (trivial subgroup)
– G≤G
– ({±1}, ×) ≤ (Q∗ , ×)
According to the definition, to prove that H is a subgroup of G, we need to

make sure H satisfies all group axioms. However, this is often tedious. Instead,
there are some simplified criteria to decide whether H is a subgroup.
Lemma (Subgroup criteria I). Let (G, ∗) be a group and H ⊆ G. H ≤ G iff
(i) e ∈ H
(ii) (∀a, b ∈ H) ab ∈ H
(iii) (∀a ∈ H) a−1 ∈ H
Proof. The group axioms are satisfied as follows:
0. Closure: (ii)
1. Identity: (i). Note that H and G must have the same identity. Suppose that
eH and eG are the identities of H and G respectively. Then eH eH = eH .
Now eH has an inverse in G. Thus we have eH eH e−1 −1
H = eH eH . So
eH eG = eG . Thus eH = eG .
8
2. Inverse: (iii)
3. Associativity: inherited from G.
Humans are lazy, and the test above is still too complicated. We thus come
up with an even simpler test:
Lemma (Subgroup criteria II). A subset H ⊆ G is a subgroup of G iff:
(I) H is non-empty
(II) (∀a, b ∈ H) ab−1 ∈ H

Proof. (I) and (II) follow trivially from (i), (ii) and (iii).
To prove that (I) and (II) imply (i), (ii) and (iii), we have
(i) H must contain at least one element a. Then aa−1 = e ∈ H.
(iii) ea−1 = a−1 ∈ H.

(ii) a(b−1 )−1 = ab ∈ H.
Proof that (i), (ii) and (iii) imply (I) and (II): trivial.
Proposition. The subgroups of (Z, +) are exactly nZ, for n ∈ N (nZ is the
integer multiples of n).
Proof. Firstly, it is trivial to show that for any n ∈ N, nZ is a subgroup. Now
show that any subgroup must be in the form nZ.
Let H ≤ Z. We know 0 ∈ H. If there are no other elements in H, then
H = 0Z. Otherwise, pick the smallest positive integer n in H. Then H = nZ.
Otherwise, suppose (∃a ∈ H) a - n. Let a = pn + q, where 0 < q < n. Since
a − pn ∈ H, q ∈ H. Yet q < n but n is the smallest member of H. Contradiction.
So every a ∈ H is divisible by n. Also, by closure, all multiples of n must be in
H. So H = nZ.
1.2 Homomorphisms
It is often helpful to study functions between different groups. First, we need to
define what a function is. These definitions should be familiar from IA Numbers
and Sets.
Definition (Function). Given two sets X, Y , a function f : X → Y sends each

x ∈ X to a particular f (x) ∈ Y . X is called the domain and Y is the co-domain.
Example.
– Identity function: for any set X, 1X : X → X with 1X (x) = x is a function.
This is also written as idX .
– Inclusion map: ι : Z → Q: ι(n) = n. Note that this differs from the

identity function as the domain and codomain are different in the inclusion
map.
– f1 : Z → Z: f1 (x) = x + 1.
9
– f2 : Z → Z: f2 (x) = 2x.
– f3 : Z → Z: f3 (x) = x2 .
– For g : {0, 1, 2, 3, 4} → {0, 1, 2, 3, 4}, we have:

◦ g1 (x) = x + 1 if x < 4; g1 (4) = 4.
◦ g2 (x) = x + 1 if x < 4; g1 (4) = 0.
Definition (Composition of functions). The composition of two functions is a
function you get by applying one after another. In particular, if f : X → Y and
G : Y → Z, then g ◦ f : X → Z with g ◦ f (x) = g(f (x)).
Example. f2 ◦ f1 (x) = 2x + 2. f1 ◦ f2 (x) = 2x + 1. Note that function
composition is not commutative.
Definition (Injective functions). A function f is injective if it hits everything

at most once, i.e.
(∀x, y ∈ X) f (x) = f (y) ⇒ x = y.
Definition (Surjective functions). A function is surjective if it hits everything
at least once, i.e.
(∀y ∈ Y )(∃x ∈ X) f (x) = y.
Definition (Bijective functions). A function is bijective if it is both injective

and surjective. i.e. it hits everything exactly once. Note that a function has an
inverse iff it is bijective.
Example. ι and f2 are injective but not subjective. f3 and g1 are neither. 1X ,
f1 and g2 are bijective.
Lemma. The composition of two bijective functions is bijective
When considering sets, functions are allowed to do all sorts of crazy things,
and can send any element to any element without any restrictions. However, we
are currently studying groups, and groups have additional structure on top of
the set of elements. Hence we are not interested in arbitrary functions. Instead,
we are interested in functions that “respect” the group structure. We call these
homomorphisms.
Definition (Group homomorphism). Let (G, ∗) and (H, ×) be groups. A func-
tion f : G → H is a group homomorphism iff
(∀g1 , g2 ∈ G) f (g1 ) × f (g2 ) = f (g1 ∗ g2 ),
Definition (Group isomorphism). Isomorphisms are bijective homomorphisms.

Two groups are isomorphic if there exists an isomorphism between them. We
write G ∼
= H.
We will consider two isomorphic groups to be “the same”. For example, when
we say that there is only one group of order 2, it means that any two groups of
order 2 must be isomorphic.
Example.
10
– f : G → H defined by f (g) = e, where e is the identity of H, is a

homomorphism.
– 1G : G → G and f2 : Z → 2Z are isomorphisms. ι : Z → Q and f2 : Z → Z
are homomorphisms.
– exp : (R, +) → (R+ , ×) with exp(x) = ex is an isomorphism.
– Take (Z4 , +) and H : ({eikπ/2 : k = 0, 1, 2, 3}, ×). Then f : Z4 → H by
f (a) = eiπa/2 is an isomorphism.
– f : GL2 (R) → R∗ with f (A) = det(A) is a homomorphism, where GL2 (R)
is the set of 2 × 2 invertible matrices.
Proposition. Suppose that f : G → H is a homomorphism. Then
(i) Homomorphisms send the identity to the identity, i.e.
f (eG ) = eH
(ii) Homomorphisms send inverses to inverses, i.e.
f (a−1 ) = f (a)−1
(iii) The composite of 2 group homomorphisms is a group homomorphism.

(iv) The inverse of an isomorphism is an isomorphism.
Proof.
(i)
f (eG ) = f (e2G ) = f (eG )2

f (eG )−1 f (eG ) = f (eG )−1 f (eG )2
f (eG ) = eH
(ii)
eH = f (eG )
= f (aa−1 )
= f (a)f (a−1 )
Since inverses are unique, f (a−1 ) = f (a)−1 .

(iii) Let f : G1 → G2 and g : G2 → G3 . Then g(f (ab)) = g(f (a)f (b)) =
g(f (a))g(f (b)).
(iv) Let f : G → H be an isomorphism. Then
n o
f −1 (ab) = f −1 f f −1 (a) f f −1 (b)

n o
= f −1 f f −1 (a)f −1 (b)
= f −1 (a)f −1 (b)
So f −1 is a homomorphism. Since it is bijective, f −1 is an isomorphism.
11
Definition (Image of homomorphism). If f : G → H is a homomorphism, then

the image of f is
im f = f (G) = {f (g) : g ∈ G}.
Definition (Kernel of homomorphism). The kernel of f , written as
ker f = f −1 ({eH }) = {g ∈ G : f (g) = eH }.
Proposition. Both the image and the kernel are subgroups of the respective
groups, i.e. im f ≤ H and ker f ≤ G.
Proof. Since eH ∈ im f and eG ∈ ker f , im f and ker f are non-empty. Moreover,
suppose b1 , b2 ∈ im f . Now ∃a1 , a2 ∈ G such that f (ai ) = bi . Then b1 b−1 2 =
f (a1 )f (a−1
2 ) = f (a1 a−1
2 ) ∈ im f .
Then consider b1 , b2 ∈ ker f . We have f (b1 b−1
2 ) = f (b1 )f (b2 )
−1
= e2 = e. So
−1
b1 b2 ∈ ker f .
Proposition. Given any homomorphism f : G → H and any a ∈ G, for all
k ∈ ker f , aka−1 ∈ ker f .
This proposition seems rather pointless. However, it is not. All subgroups
that satisfy this property are known as normal subgroups, and normal subgroups
have very important properties. We will postpone the discussion of normal
subgroups to later lectures.
Proof. f (aka−1 ) = f (a)f (k)f (a)−1 = f (a)ef (a)−1 = e. So aka−1 ∈ ker f .
Example. Images and kernels for previously defined functions:
(i) For the function that sends everything to e, im f = {e} and ker f = G.
(ii) For the identity function, im 1G = G and ker 1G = {e}.
(iii) For the inclusion map ι : Z → Q, we have im ι = Z and ker ι = {0}
(iv) For f2 : Z → Z and f2 (x) = 2x, we have im f2 = 2Z and ker f2 = {0}.
(v) For det : GL2 (R) → R∗ , we have im det = R∗ and ker det = {A : det A =
1} = SL2 (R)
Proposition. For all homomorphisms f : G → H, f is
(i) surjective iff im f = H
(ii) injective iff ker f = {e}
Proof.
(i) By definition.
(ii) We know that f (e) = e. So if f is injective, then by definition ker f =
{e}. If ker f = {e}, then given a, b such that f (a) = f (b), f (ab−1 ) =
f (a)f (b)−1 = e. Thus ab−1 ∈ ker f = {e}. Then ab−1 = e and a = b.
So far, the definitions of images and kernels seem to be just convenient
terminology to refer to things. However, we will later prove an important
theorem, the first isomorphism theorem, that relates these two objects and
provides deep insights (hopefully).
Before we get to that, we will first study some interesting classes of groups
and develop some necessary theory.
12
1.3 Cyclic groups

The simplest class of groups is cyclic groups. A cyclic group is a group of the
form {e, a, a2 , a2 , · · · , an−1 }, where an = e. For example, if we consider the
group of all rotations of a triangle, and write r = rotation by 120◦ , the elements
will be {e, r, r2 } with r3 = e.
Officially, we define a cyclic group as follows:
Definition (Cyclic group Cn ). A group G is cyclic if
(∃a)(∀b)(∃n ∈ Z) b = an ,
i.e. every element is some power of a. Such an a is called a generator of G.

We write Cn for the cyclic group of order n.
Example.
(i) Z is cyclic with generator 1 or −1. It is the infinite cyclic group.

(ii) ({+1, −1}, ×) is cyclic with generator −1.
(iii) (Zn , +) is cyclic with all numbers coprime with n as generators.
Notation. Given a group G and a ∈ G, we write hai for the cyclic group
generated by a, i.e. the subgroup of all powers of a. It is the smallest subgroup
containing a.
Definition (Order of element). The order of an element a is the smallest integer
n such that an = e. If n doesn’t exist, a has infinite order. Write ord(a) for the
order of a.
We have given two different meanings to the word “order”. One is the order
of a group and the other is the order of an element. Since mathematicians
are usually (but not always) sensible, the name wouldn’t be used twice if they
weren’t related. In fact, we have
Lemma. For a in g, ord(a) = |hai|.

Proof. If ord(a) = ∞, an 6= am for all n 6= m. Otherwise am−n = e. Thus
|hai| = ∞ = ord(a).
Otherwise, suppose ord(a) = k. Thus ak = e. We now claim that hai =
{e, a1 , a2 , · · · ak−1 }. Note that hai does not contain higher powers of a as ak = e
and higher powers will loop back to existing elements. There are also no repeating
elements in the list provided since am = an ⇒ am−n = e. So done.
It is trivial to show that
Proposition. Cyclic groups are abelian.
Definition (Exponent of group). The exponent of a group G is the smallest

integer n such that an = e for all a ∈ G.
13
1.4 Dihedral groups

Definition (Dihedral groups D2n ). Dihedral groups are the symmetries of a
regular n-gon. It contains n rotations (including the identity symmetry, i.e.
rotation by 0◦ ) and n reflections.
We write the group as D2n . Note that the subscript refers to the order of
the group, not the number of sides of the polygon.
The dihedral group is not hard to define. However, we need to come up with
a presentation of D2n that is easy to work with.
◦
We first look at the rotations. The set of all rotations is generated by r = 360
n .
This r has order n.
How about the reflections? We know that each reflection has order 2. Let s
be our favorite reflection. Then using some geometric arguments, we can show
that any reflection can be written as a product of rm and s for some m. We also
have srs = r−1 .
Hence we can define D2n as follows: D2n is a group generated by r and s,
and every element can be written as a product of r’s and s’s. Whenever we see
rn and s2 , we replace it by e. When we see srs, we replace it by r−1 .
It then follows that every element can be written in the form rm s.
Formally, we can write D2n as follows:
D2n = hr, s | rn = s2 = e, srs−1 = r−1 i

= {e, r, r2 , · · · rn−1 , s, rs, r2 s, · · · rn−1 s}
This is a notation we will commonly use to represent groups. For example, a

cyclic group of order n can be written as
Cn = ha | an = ei.
1.5 Direct products of groups

Recall that if we have to sets X, Y , then we can obtain the product X × Y =
{(x, y) : x ∈ X, y ∈ Y }. We can do the same if X and Y are groups.
Definition (Direct product of groups). Given two groups (G, ∗) and (H, ×), we
can define a set G × H = {(g1 , g2 ) : gi ∈ Gi } and an operation (a1 , a2 ) ∗ (b1 , b2 ) =
(a1 ∗ b1 , a2 × b2 ). This forms a group.
Why would we want to take the product of two groups? Suppose we have
two independent triangles. Then the symmetries of this system include, say
rotating the first triangle, rotating the second, or rotating both. The symmetry
group of this combined system would then be D6 × D6 .
Example.
C2 × C2 = {(0, 0), (0, 1), (1, 0), (1, 1)}

= {e, x, y, xy} with everything order 2
= hx, y | x2 = y 2 = e, xy = yxi
Proposition. Cn × Cm ∼
= Cnm iff hcf(m, n) = 1.
14
Proof. Suppose that hcf(m, n) = 1. Let Cn = hai and Cm = hbi. Let k be the
order of (a, b). Then (a, b)k = (ak , bk ) = e. This is possible only if n | k and
m | k, i.e. k is a common multiple n and m. Since the order is the minimum
nm
value of k that satisfies the above equation, k = lcm(n, m) = hcf(n,m) = nm.
Now consider h(a, b)i ≤ Cn × Cm . Since (a, b) has order nm, h(a, b)i has nm
elements. Since Cn × Cm also has nm elements, h(a, b)i must be the whole of
Cn × Cm . And we know that h(a, b)i ∼ = Cnm . So Cn × Cm ∼ = Cnm .
On the other hand, suppose hcf(m, n) = 1. Then k = lcm(m, n) 6= mn. Then
for any (a, b) ∈ Cn × Cm ,we have (a, b)k = (ak , bk ) = e. So the order of any (a, b)
is at most k < mn. So there is no element of order mn. So Cn × Cm is not a
cyclic group of order nm.
Given a complicated group G, it is sometimes helpful to write it as a product
H × K, which could make things a bit simpler. We can do so by the following
theorem:
Proposition (Direct product theorem). Let H1 , H2 ≤ G. Suppose the following

are true:
(i) H1 ∩ H2 = {e}.
(ii) (∀ai ∈ Hi ) a1 a2 = a2 a1 .
(iii) (∀a ∈ G)(∃ai ∈ Hi ) a = a1 a2 . We also write this as G = H1 H2 .

Then G ∼
= H1 × H2 .
Proof. Define f : H1 × H2 → G by f (a1 , a2 ) = a1 a2 . Then it is a homomorphism
since
f ((a1 , a2 ) ∗ (b1 , b2 )) = f (a1 b1 , a2 b2 )

= a1 b1 a2 b2
= a1 a2 b1 b2
= f (a1 , a2 )f (b1 , b2 ).
Surjectivity follows from (iii). We’ll show injectivity by showing that the kernel
is {e}. If f (a1 , a2 ) = e, then we know that a1 a2 = e. Then a1 = a−1 2 . Since
a1 ∈ H1 and a−1 −1
2 ∈ H2 , we have a1 = a2 ∈ H1 ∩ H2 = {e}. Thus a1 = a2 = e
and ker f = {e}.
15
2 Symmetric group I IA Groups
2 Symmetric group I
We will devote two full chapters to the study of symmetric groups, because
it is really important. Recall that we defined a symmetry to be an operation
that leaves some important property of the object intact. We can treat each
such operation as a bijection. For example, a symmetry of R2 is a bijection
f : R2 → R2 that preserves distances. Note that we must require it to be a
bijection, instead of a mere function, since we require each symmetry to be an
inverse.
We can consider the case where we don’t care about anything at all. So a
“symmetry” would be any arbitrary bijection X → X, and the set of all bijections
will form a group, known as the symmetric group. Of course, we will no longer
think of these as “symmetries” anymore, but just bijections.
In some sense, the symmetric group is the most general case of a symmetry
group. In fact, we will later (in Chapter 5) show that every group can be written
as a subgroup of some symmetric group.
2.1 Symmetric groups

Definition (Permutation). A permutation of X is a bijection from a set X to
X itself. The set of all permutations on X is Sym X.
When composing permutations, we treat them as functions. So if σ and ρ
are permutations, σ ◦ ρ is given by first applying ρ, then applying σ.
Theorem. Sym X with composition forms a group.
Proof. The groups axioms are satisfied as follows:
0. If σ : X → X and τ : X → X, then σ ◦ τ : X → X. If they are both
bijections, then the composite is also bijective. So if σ, τ ∈ Sym X, then
σ ◦ τ ∈ Sym X.
1. The identity 1X : X → X is clearly a permutation, and gives the identity
of the group.
2. Every bijective function has a bijective inverse. So if σ ∈ Sym X, then
σ −1 ∈ Sym X.
3. Composition of functions is associative.
Definition (Symmetric group Sn ). If X is finite, say |X| = n (usually use
X = {1, 2, · · · , n}), we write Sym X = Sn . The is the symmetric group of degree
n.
It is important to note that the degree of the symmetric group is different
from the order of the symmetric group. For example, S3 has degree 3 but order
6. In general, the order of Sn is n!.
There are two ways to write out an element of the symmetric group. The
first is the two row notation.
Notation. (Two row notation) We write 1, 2, 3, · · · n on the top line and their
images below, e.g.

1 2 3 1 2 3 4 5
∈ S3 and ∈ S5
2 3 1 2 1 3 4 5
16
In general, if σ : X → X, we write

1 2 3 ··· n
σ(1) σ(2) σ(3) ··· σ(n)
Example. For small n, we have

1
(i) When n = 1, Sn = = {e} ∼
= C1 .
1

1 2 1 2 ∼
(ii) When n = 2, Sn = , = C2
1 2 2 1
(iii) When n = 3,
 
1 2 3 1 2 3 1 2 3 
, ,

 
 1 2 3 2 3 1 3 1 2 

 

Sn = ∼
  = D6 .
 1 2 3 1 2 3 1 2 3 

, ,

 
2 1 3 3 2 1 1 3 2
 
Note that S3 is not abelian. Thus Sn is not abelian for n ≥ 3 since we can
always view S3 as a subgroup of Sn by fixing 4, 5, 6, · · · n.
In general, we can view D2n as a subgroup of Sn because each symmetry is
a permutation of the corners.
While the two row notation is fully general and can represent any (finite)
permutation, it is clumsy to write and wastes a lot of space. It is also very
annoying to type using LATEX. Hence, most of the time, we actually use the
cycle notation.
Notation (Cycle notation). If a map sends 1 7→ 2, 2 7→ 3, 3 7→ 1, then we
write it as a cycle (1 2 3). Alternatively, we can write (2 3 1) or (3 1 2), but by
convention, we usually write the smallest number first. We leave out numbers
that don’t move. So we write (1 2) instead of (1 2)(3).
For more complicated maps, we can write them as products of cycles. For
example, in S4 , we can have things like (1 2)(3 4).
The order of each cycle is the length of the cycle, and the inverse is the cycle
written the other way round, e.g. (1 2 3)−1 = (3 2 1) = (1 3 2).
Example.
(i) Suppose we want to simplify (1 2 3)(1 2). Recall that composition is from
right to left. So 1 gets mapped to 3 ((1 2) maps 1 to 2, and (1 2 3) further
maps it to 3). Then 3 gets mapped to 1. 2 is mapped to 2 itself. So
(1 2 3)(1 2) = (1 3)(2)
(ii) (1 2 3 4)(1 4) = (1)(2 3 4) = (2 3 4).
Definition (k-cycles and transpositions). We call (a1 a2 a3 · · · ak ) a k-cycle.
2-cycles are called transpositions. Two cycles are disjoint if no number appears
in both cycles.
Example. (1 2) and (3 4) are disjoint but (1 2 3) and (1 2) are not.
17
Lemma. Disjoint cycles commute.

Proof. If σ, τ ∈ Sn are disjoint cycles. Consider any n. Show that: σ(τ (a)) =
τ (σ(a)). If a is in neither of σ and τ , then σ(τ (a)) = τ (σ(a)) = a. Otherwise,
wlog assume that a is in τ but not in σ. Then τ (a) ∈ τ and thus τ (a) 6∈ σ. Thus
σ(a) = a and σ(τ (a)) = τ (a). Therefore we have σ(τ (a)) = τ (σ(a)) = τ (a).
Therefore τ and σ commute.
In general, non-disjoint cycles may not commute. For example, (1 3)(2 3) =
(1 3 2) while (2 3)(1 3) = (1 2 3).
Theorem. Any permutation in Sn can be written (essentially) uniquely as a
product of disjoint cycles. (Essentially unique means unique up to re-ordering of
cycles and rotation within cycles, e.g. (1 2) and (2 1))
Proof. Let σ ∈ Sn . Start with (1 σ(1) σ 2 (1) σ 3 (1) · · · ). As the set {1, 2, 3 · · · n}
is finite, for some k, we must have σ k (1) already in the list. If σ k (1) = σ l (1),
with l < k, then σ k−l (1) = 1. So all σ i (1) are distinct until we get back to 1.
Thus we have the first cycle (1 σ(1) σ 2 (1) σ 3 (1) · · · σ k−1 (1)).
Now choose the smallest number that is not yet in a cycle, say j. Repeat to
obtain a cycle (j σ(j) σ 2 (j) · · · σ l−1 (j)). Since σ is a bijection, nothing in this
cycle can be in previous cycles as well.
Repeat until all {1, 2, 3 · · · n} are exhausted. This is essentially unique
because every number j completely determines the whole cycle it belongs to,
and whichever number we start with, we’ll end up with the same cycle.
Definition (Cycle type). Write a permutation σ ∈ Sn in disjoint cycle notation.
The cycle type is the list of cycle lengths. This is unique up to re-ordering. We
often (but not always) leave out singleton cycles.
Example. (1 2) has cycle type 2 (transposition). (1 2)(3 4) has cycle type 2, 2
(double transposition). (1 2 3)(4 5) has cycle type 3, 2.
Lemma. For σ ∈ Sn , the order of σ is the least common multiple of cycle
lengths in the disjoint cycle notation. In particular, a k-cycle has order k.
Proof. As disjoint cycles commute, we can group together each cycle when we take
powers. i.e. if σ = τ1 τ2 · · · τl with τi all disjoint cycles, then σ m = τ1m τ2m · · · τlm .
Now if cycle τi has length ki , then τiki = e, and τim = e iff ki | m. To get an
m such that σ m = e, we need all ki to divide m. i.e. m is a common multiple of
ki . Since the order is the least possible m such that σ m = e, the order is the
least common multiple of ki .
Example. Any transpositions and double transpositions have order 2.
(1 2 3)(4 5) has order 6.
2.2 Sign of permutations

To classify different permutations, we can group different permutations according
to their cycle type. While this is a very useful thing to do, it is a rather fine
division. In this section, we will assign a “sign” to each permutation, and each
permutation can either be odd or even. This high-level classification allows us
to separate permutations into two sets, which is also a useful notion.
18
To define the sign, we first need to write permutations as products of trans-

positions.
Proposition. Every permutation is a product of transpositions.

This is not a deep or mysterious fact. All it says is that you can rearrange
things however you want just by swapping two objects at a time.
Proof. As each permutation is a product of disjoint cycles, it suffices to prove
that each cycle is a product of transpositions. Consider a cycle (a1 a2 a3 · · · ak ).
This is in fact equal to (a1 a2 )(a2 a3 ) · · · (ak−1 ak ). Thus a k-cycle can be written
as a product of k − 1 transpositions.
Note that the product is not unique. For example,
(1 2 3 4 5) = (1 2)(2 3)(3 4)(4 5) = (1 2)(2 3)(1 2)(3 4)(1 2)(4 5).
However, the number of terms in the product, mod 2, is always the same.
Theorem. Writing σ ∈ Sn as a product of transpositions in different ways, σ is
either always composed of an even number of transpositions, or always an odd
number of transpositions.
The proof is rather magical.

Proof. Write #(σ) for the number of cycles in disjoint cycle notation, including
singleton cycles. So #(e) = n and #((1 2)) = n − 1. When we multiply σ by a
transposition τ = (c d) (wlog assume c < d),
– If c, d are in the same σ-cycle, say, (c a2 · · · ak−1 d ak+1 · · · ak+l )(c d) =
(c ak+1 ak+2 · · · ak+l )(d a2 a3 · · · ak−1 ). So #(στ ) = #(σ) + 1 .
– If c, d are in different σ-cycles, say
(d a2 a3 · · · ak−1 )(c ak+1 ak+2 · · · ak+l )(c d)
= (c a2 · · · ak−1 d ak+1 · · · ak+l )(c d)(c d)
= (c a2 · · · ak−1 d ak+1 · · · ak+l ) and #(στ ) = #(σ) − 1.
Therefore for any transposition τ , #(στ ) ≡ #(σ) + 1 (mod 2).
Now suppose σ = τ1 · · · τl = τ10 · · · τk0 . Since disjoint cycle notation is unique,
#(σ) is uniquely determined by σ.
Now we can construct σ by starting with e and multiplying the transpositions
one by one. Each time we add a transposition, we increase #(σ) by 1 (mod 2).
So #(σ) ≡ #(e) + l (mod 2). Similarly, #(σ) ≡ #(e) + k (mod 2). So l ≡ k
(mod 2).
Definition (Sign of permutation). Viewing σ ∈ Sn as a product of transpositions,
σ = τ1 · · · τl , we call sgn(σ) = (−1)l . If sgn(σ) = 1, we call σ an even permutation.
If sgn(σ) = −1, we call σ an odd permutation.
While l itself is not well-defined, it is either always odd or always even, and
(−1)l is well-defined.
Theorem. For n ≥ 2, sgn : Sn → {±1} is a surjective group homomorphism.
19
Proof. Suppose σ1 = τ1 · · · τl1 and σ2 = τ10 · · · τl2 . Then sgn(σ1 σ2 ) = (−1)l1 +l2 =
(−1)l1 (−1)l2 = sgn(σ1 ) sgn(σ2 ). So it is a homomorphism.
It is surjective since sgn(e) = 1 and sgn((1 2)) = −1.
It is this was rather trivial to prove. The hard bit is showing that sgn is
well defined. If a question asks you to show that sgn is a well-defined group
homomorphism, you have to show that it is well-defined.
Lemma. σ is an even permutation iff the number of cycles of even length is
even.
Proof. A k-cycle can be written as k − 1 transpositions. Thus an even-length
cycle is odd, vice versa.
Since sgn is a group homomorphism, writing σ in disjoint cycle notation,
σ = σ1 σ2 · · · σl , we get sgn(σ) = sgn(σ1 ) · · · sgn(σl ). Suppose there are m even-
length cycles and n odd-length cycles, then sgn(σ) = (−1)m 1n . This is equal to
1 iff (−1)m = 1, i.e. m is even.
Rather confusingly, odd length cycles are even, and even length cycles are
odd.
Definition (Alternating group An ). The alternating group An is the kernel of
sgn, i.e. the even permutations. Since An is a kernel of a group homomorphism,
An ≤ Sn .
Among the many uses of the sgn homomorphism, it is used in the definition
of the determinant of a matrix: if An×n is a square matrix, then
X
det A = sgn(σ)a1σ(1) · · · anσ(n) .
σ∈Sn
Proposition. Any subgroup of Sn contains either no odd permutations or

exactly half.
Proof. If Sn has at least one odd permutation τ , then there exists a bijection
between the odd and even permutations by σ 7→ στ (bijection since σ 7→ στ −1
is a well-defined inverse). So there are as many odd permutations as even
permutations.
After we prove the isomorphism theorem later, we can provide an even shorter
proof of this.
20
3 Lagrange’s Theorem IA Groups
3 Lagrange’s Theorem
One can model a Rubik’s cube with a group, with each possible move correspond-
ing to a group element. Of course, Rubik’s cubes of different sizes correspond to
different groups.
Suppose I have a 4 × 4 × 4 Rubik’s cube, but I want to practice solving a
2 × 2 × 2 Rubik’s cube. It is easy. I just have to make sure every time I make a
move, I move two layers together. Then I can pretend I am solving a 2 × 2 × 2
cube. This corresponds to picking a particular subgroup of the 4 × 4 × 4 group.
Now what if I have a 3 × 3 × 3 cube? I can still practice solving a 2 × 2 × 2
one. This time, I just look at the corners and pretend that the edges and centers
do not exist. Then I am satisfied when the corners are in the right positions,
while the centers and edges can be completely scrambled. In this case, we are
not taking a subgroup. Instead, we are identifying certain moves together. In
particular, we are treating two moves as the same as long as their difference is
confined to the centers and edges.
Let G be the 3 × 3 × 3 cube group, and H be the subgroup of G that only
permutes the edges and centers. Then for any a, b ∈ G, we think a and b are “the
same” if a−1 b ∈ H. Then the set of things equivalent to a is aH = {ah : h ∈ H}.
We call this a coset, and the set of cosets form a group.
An immediate question one can ask is: why not Ha = {ha : h ∈ H}? In
this particular case, the two happen to be the same for all possible a. However,
for a general subgroup H, they need not be. We can still define the coset
aH = {ah : h ∈ H}, but these are less interesting. For example, the set of all
{aH} will no longer form a group. We will look into these more in-depth in the
next chapter. In this chapter, we will first look at results for general cosets. In
particular, we will, step by step, prove the things we casually claimed above.
Definition (Cosets). Let H ≤ G and a ∈ G. Then the set aH = {ah : h ∈ H}
is a left coset of H and Ha = {ha : h ∈ H} is a right coset of H.
Example.
(i) Take 2Z ≤ Z. Then 6 + 2Z = {all even numbers} = 0 + 2Z. 1 + 2Z =
{all odd numbers} = 17 + 2Z.
(ii) Take G = S3 , let H = h(1 2)i = {e, (1 2)}. The left cosets are
eH = (1 2)H = {e, (1 2)}

(1 3)H = (1 2 3)H = {(1 3), (1 2 3)}
(2 3)H = (1 3 2)H = {(2 3), (1 3 2)}
(iii) Take G = D6 (which is isomorphic to S3 ). Recall D6 = hr, s | r3 e = s2 , rs =

sr−1 i.Take H = hsi = {e, s}. We have left coset rH = {r, rs = sr−1 } and
the right coset Hr = {r, sr}. Thus rH 6= Hr.
Proposition. aH = bH ⇔ b−1 a ∈ H.
Proof. (⇒) Since a ∈ aH, a ∈ bH. Then a = bh for some h ∈ H. So b−1 a =
h ∈ H.
(⇐). Let b−1 a = h0 . Then a = bh0 . Then ∀ah ∈ aH, we have ah = b(h0 h) ∈
bH. So aH ⊆ bH. Similarly, bH ⊆ aH. So aH = bH.
21
Definition (Partition). Let X S be a set, and X1 , · · · Xn be subsets of X. The

Xi are called a partition of X if Xi = X and Xi ∩ Xj = ∅ for i 6= j. i.e. every
element is in exactly one of Xi .
Lemma. The left cosets of a subgroup H ≤ G partition G, and every coset has
the same size.
Proof. For each a ∈ G, a ∈ aH. Thus the union of all cosets gives all of G. Now
we have to show that for all a, b ∈ G, the cosets aH and bH are either the same
or disjoint.
Suppose that aH and bH are not disjoint. Let ah1 = bh2 ∈ aH ∩ bH. Then
b−1 a = h2 h−1
1 ∈ H. So aH = bH.
To show that they each coset has the same size, note that f : H → aH with
f (h) = ah is invertible with inverse f −1 (h) = a−1 h. Thus there exists a bijection
between them and they have the same size.
Definition (Index of a subgroup). The index of H in G, written |G : H|, is the
number of left cosets of H in G.
Theorem (Lagrange’s theorem). If G is a finite group and H is a subgroup of
G, then |H| divides |G|. In particular,
|H||G : H| = |G|.
Note that the converse is not true. If k divides |G|, there is not necessarily a
subgroup of order k, e.g. |A4 | = 12 but there is no subgroup of order 6. However,
we will later see that this is true if k is a prime (cf. Cauchy’s theorem).
Proof. Suppose that there are |G : H| left cosets in total. Since the left cosets
partition G, and each coset has size |H|, we have
|H||G : H| = |G|.
Again, the hard part of this proof is to prove that the left cosets partition G
and have the same size. If you are asked to prove Lagrange’s theorem in exams,
that is what you actually have to prove.
Corollary. The order of an element divides the order of the group, i.e. for any
finite group G and a ∈ G, ord(a) divides |G|.
Proof. Consider the subgroup generated by a, which has order ord(a). Then by
Lagrange’s theorem, ord(a) divides |G|.
Corollary. The exponent of a group divides the order of the group, i.e. for any
finite group G and a ∈ G, a|G| = e.
Proof. We know that |G| = k ord(a) for some k ∈ N. Then a|G| = (aord(a) )k =
ek = e.
Corollary. Groups of prime order are cyclic and are generated by every non-
identity element.
Proof. Say |G| = p. If a ∈ G is not the identity, the subgroup generated by a
must have order p since it has to divide p. Thus the subgroup generated by a
has the same size as G and they must be equal. Then G must be cyclic since it
is equal to the subgroup generated by a.
22
A useful way to think about cosets is to view them as equivalence classes.

To do so, we need to first define what an equivalence class is.
Definition (Equivalence relation). An equivalence relation ∼ is a relation that

is reflexive, symmetric and transitive. i.e.
(i) (∀x) x ∼ x (reflexivity)
(ii) (∀x, y) x ∼ y ⇒ y ∼ x (symmetry)
(iii) (∀x, y, z) [(x ∼ y) ∧ (y ∼ z) ⇒ x ∼ z] (transitivity)

Example. The following relations are equivalence relations:
(i) Consider Z. The relation ≡n defined as a ≡n b ⇔ n | (a − b).
(ii) Consider the set (formally: class) of all finite groups. Then “is isomorphic
to” is an equivalence relation.
Definition (Equivalence class). Given an equivalence relation ∼ on A, the
equivalence class of a is
[a]∼ = [a] = {b ∈ A : a ∼ b}
Proposition. The equivalence classes form a partition of A.

Proof. By reflexivity, we have a ∈ [a]. Thus the equivalence classes cover the
whole set. We must now show that for all a, b ∈ A, either [a] = [b] or [a] ∩ [b] = ∅.
Suppose [a] ∩ [b] 6= ∅. Then ∃c ∈ [a] ∩ [b]. So a ∼ c, b ∼ c. By symmetry, c ∼ b.
By transitivity, we have a ∼ b. Now for all b0 ∈ [b], we have b ∼ b0 . Thus by
transitivity, we have a ∼ b0 . Thus [b] ⊆ [a]. Similarly, [a] ⊆ [b] and [a] = [b].
Lemma. Given a group G and a subgroup H, define the equivalence relation
on G with a ∼ b iff b−1 a ∈ H. The equivalence classes are the left cosets of H.
Proof. First show that it is an equivalence relation.
(i) Reflexivity: Since aa−1 = e ∈ H, a ∼ a.

(ii) Symmetry: a ∼ b ⇒ b−1 a ∈ H ⇒ (b−1 a)−1 = a−1 b ∈ H ⇒ b ∼ a.
(iii) Transitivity: If a ∼ b and b ∼ c, we have b−1 a, c−1 b ∈ H. So c−1 bb−1 a =
c−1 a ∈ H. So a ∼ c.
To show that the equivalence classes are the cosets, we have a ∼ b ⇔ b−1 a ∈
H ⇔ aH = bH.
Example. Consider (Z, +), and for fixed n, take the subgroup nZ. The cosets
are 0 + H, 1 + H, · · · (n − 1) + H. We can write these as [0], [1], [2] · · · [n]. To
perform arithmetic “mod n”, define [a] + [b] = [a + b], and [a][b] = [ab]. We
need to check that it is well-defined, i.e. it doesn’t depend on the choice of the
representative of [a].
If [a1 ] = [a2 ] and [b1 ] = [b2 ], then a1 = a2 + kn and b1 = b2 + kn, then
a1 + b1 = a2 + b2 + n(k + l) and a1 b1 = a2 b2 + n(kb2 + la2 + kln). So [a1 + b1 ] =
[a2 + b2 ] and [a1 b1 ] = [a2 b2 ].
23
We have seen that (Zn , +n ) is a group. What happens with multiplication?

We can only take elements which have inverses (these are called units, cf. IB
Groups, Rings and Modules). Call the set of them Un = {[a] : (a, n) = 1}. We’ll
see these are the units.
Definition (Euler totient function). (Euler totient function) φ(n) = |Un |.
Example. If p is a prime, φ(n) = p − 1. φ(4) = 2.
Proposition. Un is a group under multiplication mod n.
Proof. The operation is well-defined as shown above. To check the axioms:

0. Closure: if a, b are coprime to n, then a · b is also coprime to n. So
[a], [b] ∈ Un ⇒ [a] · [b] = [a · b] ∈ Un
1. Identity: [1]
2. Let [a] ∈ Un . Consider the map Un → Un with [c] 7→ [ac]. This is injective:
if [ac1 ] = [ac2 ], then n divides a(c1 − c2 ). Since a is coprime to n, n divides
c1 − c2 , so [c1 ] = [c2 ]. Since Un is finite, any injection (Un → Un ) is also a
surjection. So there exists a c such that [ac] = [a][c] = 1. So [c] = [a]−1 .
3. Associativity (and also commutativity): inherited from Z.

Theorem (Fermat-Euler theorem). Let n ∈ N and a ∈ Z coprime to n. Then
aφ(n) ≡ 1 (mod n).
In particular, (Fermat’s Little Theorem) if n = p is a prime, then for any a not

a multiple of p.
ap−1 ≡ 1 (mod p).
Proof. As a is coprime with n, [a] ∈ Un . Then [a]|Un | = [1], i.e. aφ(n) ≡ 1
(mod n).
3.1 Small groups

We will study the structures of certain small groups.
Example (Using Lagrange theorem to find subgroups). To find subgroups of
D10 , we know that the subgroups must have size 1, 2, 5 or 10:
1: {e}
2: The groups generated by the 5 reflections of order 2
5: The group must be cyclic since it has prime order 5. It is then generated
by an element of order 5, i.e. r, r2 , r3 and r4 . They generate the same
group hri.
10: D10
As for D8 , subgroups must have order 1, 2, 4 or 8.
1: {e}
24
2: 5 elements of order 2, namely 4 reflections and r2 .

4: First consider the subgroup isomorphic to C4 , which is hri. There are two
other non-cyclic group.
8: D8
Proposition. Any group of order 4 is either isomorphic to C4 or C2 × C2 .
Proof. Let |G| = 4. By Lagrange theorem, possible element orders are 1 (e only),
2 and 4. If there is an element a ∈ G of order 4, then G = hai ∼
= C4 .
Otherwise all non-identity elements have order 2. Then G must be abelian
(For any a, b, (ab)2 = 1 ⇒ ab = (ab)−1 ⇒ ab = b−1 a−1 ⇒ ab = ba). Pick
2 elements of order 2, say b, c ∈ G, then hbi = {e, b} and hci = {e, c}. So
hbi ∩ hci = {e}. As G is abelian, hbi and hci commute. We know that bc = cb has
order 2 as well, and is the only element of G left. So G ∼
= hbi × hci ∼= C2 × C2
by the direct product theorem.
Proposition. A group of order 6 is either cyclic or dihedral (i.e. is isomorphic
to C6 or D6 ). (See proof in next section)
3.2 Left and right cosets

As |aH| = |H| and similarly |H| = |Ha|, left and right cosets have the same size.
Are they necessarily the same? We’ve previously shown that they might not be
the same. In some other cases, they are.
Example.
(i) Take G = (Z, +) and H = 2Z. We have 0 + 2Z = 2Z + 0 = even numbers

and 1 + 2Z = 2Z + 1 = odd numbers. Since G is abelian, aH = Ha for all
a, ∈ G, H ≤ G.
(ii) Let G = D6 = hr, s | r3 = e = s2 , rs = sr−1 i. Let U = hri. Since
the cosets partition G, so one must be U and the other sU = {s, sr =
r2 s, sr2 = rs} = U s. So for all a ∈ G, aU = U a.
(iii) Let G = D6 and take H = hsi . We have H = {e, s}, rH = {r, rs = sr−1 }
and r2 H = {r2 , rs }; while H = {e, s}, Hr = {r, sr} and Hr2 = {r2 , sr2 }.
So the left and right subgroups do not coincide.
This distinction will become useful in the next chapter.
25
4 Quotient groups IA Groups
4 Quotient groups
In the previous section, when attempting to pretend that a 3 × 3 × 3 Rubik’s
cube is a 2 × 2 × 2 one, we came up with the cosets aH, and claimed that these
form a group. We also said that this is not the case for arbitrary subgroup H,
but only for subgroups that satisfy aH = Ha. Before we prove these, we first
study these subgroups a bit.
4.1 Normal subgroups

Definition (Normal subgroup). A subgroup K of G is a normal subgroup if
(∀a ∈ G)(∀k ∈ K) aka−1 ∈ K.
We write K C G. This is equivalent to:

(i) (∀a ∈ G) aK = Ka, i.e. left coset = right coset
(ii) (∀a ∈ G) aKa−1 = K (cf. conjugacy classes)

From the example last time, H = hsi ≤ D6 is not a normal subgroup, but
K = hri C D6 . We know that every group G has at least two normal subgroups
{e} and G.
Lemma.
(i) Every subgroup of index 2 is normal.
(ii) Any subgroup of an abelian group is normal.
Proof.
(i) If K ≤ G has index 2, then there are only two possible cosets K and G \ K.
As eK = Ke and cosets partition G, the other left coset and right coset
must be G \ K. So all left cosets and right cosets are the same.
(ii) For all a ∈ G and k ∈ K, we have aka−1 = aa−1 k = k ∈ K.
Proposition. Every kernel is a normal subgroup.

Proof. Given homomorphism f : G → H and some a ∈ G, for all k ∈ ker f , we
have f (aka−1 ) = f (a)f (k)f (a)−1 = f (a)ef (a)−1 = e. Therefore aka−1 ∈ ker f
by definition of the kernel.
In fact, we will see in the next section that all normal subgroups are kernels
of some homomorphism.
Example. Consider G = D8 . Let K = hr2 i is normal. Check: Any element of
G is either sr` or r` for some `. Clearly e satisfies aka−1 ∈ K. Now check r2 :
For the case of sr` , we have sr` r2 (sr` )−1 = sr` r2 r−` s−1 = sr2 s = ssr−2 = r2 .
For the case of r` , r` r2 r−` = r2 .
Proposition. A group of order 6 is either cyclic or dihedral (i.e. ∼

= C6 or D6 ).
26
Proof. Let |G| = 6. By Lagrange theorem, possible element orders are 1, 2, 3 and
6. If there is an a ∈ G of order 6, then G = hai ∼= C6 . Otherwise, we can only
have elements of orders 2 and 3 other than the identity. If G only has elements
of order 2, the order must be a power of 2 by Sheet 1 Q. 8, which is not the case.
So there must be an element r of order 3. So hri C G as it has index 2. Now G
must also have an element s of order 2 by Sheet 1 Q. 9.
Since hri is normal, we know that srs−1 ∈ hri. If srs−1 = e, then r = e,
which is not true. If srs−1 = r, then sr = rs and sr has order 6 (lcm of the
orders of s and r), which was ruled out above. Otherwise if srs−1 = r2 = r−1 ,
then G is dihedral by definition of the dihedral group.
4.2 Quotient groups

Proposition. Let K C G. Then the set of (left) cosets of K in G is a group
under the operation aK ∗ bK = (ab)K.
Proof. First show that the operation is well-defined. If aK = a0 K and bK = b0 K,
we want to show that aK ∗ bK = a0 K ∗ b0 K. We know that a0 = ak1 and b0 = bk2
for some k1 , k2 ∈ K. Then a0 b0 = ak1 bk2 . We know that bk1 b−1 ∈ K. Let
bk1 b−1 = k3 . Then k1 b = bk3 . So a0 b0 = abk3 k2 ∈ (ab)K. So picking a different
representative of the coset gives the same product.
1. Closure: If aK, bK are cosets, then (ab)K is also a coset
2. Identity: The identity is eK = K (clear from definition)
3. Inverse: The inverse of aK is a−1 K (clear from definition)
4. Associativity: Follows from the associativity of G.
Definition (Quotient group). Given a group G and a normal subgroup K, the
quotient group or factor group of G by K, written as G/K, is the set of (left)
cosets of K in G under the operation aK ∗ bK = (ab)K.
Note that the set of left cosets also exists for non-normal subgroups (abnormal
subgroups?), but the group operation above is not well defined.
Example.
(i) Take G = Z and nZ (which must be normal since G is abelian), the cosets
are k + nZ for 0 ≤ k < n. The quotient group is Zn . So we can write
Z/(nZ) = Zn . In fact these are the only quotient groups of Z since nZ are
the only subgroups.
Note that if G is abelian, G/K is also abelian.
(ii) Take K = hri C D6 . We have two cosets K and sK. So D6 /K has order 2
and is isomorphic to C2 .
(iii) Take K = hr2 i C D8 . We know that G/K should have 82 = 4 elements. We
have G/K = {K, rK = r3 K, sK = sr2 K, srK = sr3 K}. We see that all
elements (except K) has order 2, so G/K ∼
= C2 × C2 .
Note that quotient groups are not subgroups of G. They contain different
kinds of elements. For example, Z/nZ ∼ = Cn are finite, but all subgroups of Z
infinite.
27
Example. (Non-example) Consider D6 with H = hsi. H is not a normal

subgroup. We have rH ∗ r2 H = r3 H = H, but rH = rsH and r2 H = srH (by
considering the individual elements). So we have rsH ∗ srH = r2 H 6= H, and
the operation is not well-defined.
Lemma. Given K C G, the quotient map q : G → G/K with g 7→ gK is a
surjective group homomorphism.
Proof. q(ab) = (ab)K = aKbK = q(a)q(b). So q is a group homomorphism.
Also for all aK ∈ G/K, q(a) = aK. So it is surjective.
Note that the kernel of the quotient map is K itself. So any normal subgroup
is a kernel of some homomorphism.
Proposition. The quotient of a cyclic group is cyclic.
Proof. Let G = Cn with H ≤ Cn . We know that H is also cyclic. Say Cn = hci
and H = hck i ∼
= C` , where k` = n. We have Cn /H = {H, cH, c2 H, · · · ck−1 H} =
∼
hcHi = Ck .
4.3 The Isomorphism Theorem

Now we come to the Really Important TheoremTM .
Theorem (The Isomorphism Theorem). Let f : G → H be a group homomor-
phism with kernel K. Then K C G and G/K ∼
= im f .
Proof. We have proved that K C G before. We define a group homomorphism
θ : G/K → im f by θ(aK) = f (a).
First check that this is well-defined: If a1 K = a2 K, then a−1
2 a1 ∈ K. So
f (a2 )−1 f (a1 ) = f (a−1

2 a1 ) = e.
So f (a1 ) = f (a2 ) and θ(a1 K) = θ(a2 K).

Now we check that it is a group homomorphism:
θ(aKbK) = θ(abK) = f (ab) = f (a)f (b) = θ(aK)θ(bK).
To show that it is injective, suppose θ(aK) = θ(bK). Then f (a) = f (b). Hence
f (b)−1 f (a) = e. Hence b−1 a ∈ K. So aK = bK.
By definition, θ is surjective since im θ = im f . So θ gives an isomorphism
G/K ∼ = im f ≤ H.
If f is injective, then the kernel is {e}, so G/K ∼
= G and G is isomorphic to
a subgroup of H. We can think of f as an inclusion map. If f is surjective, then
im f = H. In this case, G/K ∼ = H.
Example.
∗
(i) Take f : GLn (R) → R with A 7→ det A, ker f = SLN (R). im f = R∗ as for
λ 0 ··· 0
0 1 · · · 0
all λ ∈ R∗ , det  . . ..  = λ. So we know that GLn (R)/SLn (R) ∼ =
 
 .. .. ..
. .
0 0 0 1
R∗ .
28
(ii) Define θ : (R, +) → (C∗, ×) with r 7→ exp(2πir). This is a group homomor-

phism since θ(r + s) = exp(2πi(r + s)) = exp(2πir) exp(2πis) = θ(r)θ(s).
We know that the kernel is Z C R. Clearly the image is the unit circle
(S1 , ×). So R/Z ∼= (S1 , ×).
(iii) G = (Z∗p , ×) for prime p 6= 2. We have f : G → G with a 7→ a2 . This
is a homomorphism since (ab)2 = a2 b2 (Z∗p is abelian). The kernel is
{±1} = {1, p − 1}. We know that im f ∼= G/ ker f with order p−1
2 . These
are known as quadratic residues.
Lemma. Any cyclic group is isomorphic to either Z or Z/(nZ) for some n ∈ N.
Proof. Let G = hci. Define f : Z → G with m 7→ cm . This is a group

homomorphism since cm1 +m2 = cm1 cm2 . f is surjective since G is by definition
all cm for all m. We know that ker f C Z. We have three possibilities. Either
(i) ker f = {e}, so F is an isomorphism and G ∼
= Z; or
(ii) ker f = Z, then G ∼
= Z/Z = {e} = C1 ; or
(iii) ker f = nZ (since these are the only proper subgroups of Z), then G ∼
=
Z/(nZ).
Definition (Simple group). A group is simple if it has no non-trivial proper
normal subgroup, i.e. only {e} and G are normal subgroups.
Example. Cp for prime p are simple groups since it has no proper subgroups
at all, let alone normal ones. A5 is simple, which we will prove after Chapter 6.
The finite simple groups are the building blocks of all finite groups. All finite
simple groups have been classified (The Atlas of Finite Groups). If we have
K C G with K 6= G or {e}, then we can “quotient out” G into G/K. If G/K
is not simple, repeat. Then we can write G as an “inverse quotient” of simple
groups.
29
5 Group actions IA Groups
5 Group actions
Recall that we came up with groups to model symmetries and permutations.
Intuitively, elements of groups are supposed to “do things”. However, as we
developed group theory, we abstracted these away and just looked at how
elements combine to form new elements. Group actions recapture this idea and
make each group element correspond to some function.
5.1 Group acting on sets

Definition (Group action). Let X be a set and G be a group. An action of G
on X is a homomorphism ϕ : G → Sym X.
This means that the homomorphism ϕ turns each element g ∈ G into a
permutation of X, in a way that respects the group structure.
Instead of writing ϕ(g)(x), we usually directly write g(x) or gx.
Alternatively, we can define the group action as follows:
Proposition. Let X be a set and G be a group. Then ϕ : G → Sym X is a
homomorphism (i.e. an action) iff θ : G × X → X defined by θ(g, x) = ϕ(g)(x)
satisfies
0. (∀g ∈ G)(x ∈ X) θ(g, x) ∈ X.
1. (∀x ∈ X) θ(e, x) = x.
2. (∀g, h ∈ G)(∀x ∈ X) θ(g, θ(h, x)) = θ(gh, x).
This criteria is almost the definition of a homomorphism. However, here we
do not explicitly require θ(g, ·) to be a bijection, but require θ(e, ·) to be the
identity function. This automatically ensures that θ(g, ·) is a bijection, since
when composed with θ(g −1 , ·), it gives θ(e, ·), which is the identity. So θ(g, ·)
has an inverse. This is usually an easier thing to show.
Example.
(i) Trivial action: for any group G acting on any set X, we can have ϕ(g) = 1X
for all g, i.e. G does nothing.
(ii) Sn acts on {1, · · · n} by permutation.
(iii) D2n acts on the vertices of a regular n-gon (or the set {1, · · · , n}).
(iv) The rotations of a cube act on the faces/vertices/diagonals/axes of the
cube.
Note that different groups can act on the same sets, and the same group can
act on different sets.
Definition (Kernel of action). The kernel of an action G on X is the kernel of
ϕ, i.e. all g such that ϕ(g) = 1X .
Note that by the isomorphism theorem, ker ϕ C G and G/K is isomorphic to
a subgroup of Sym X.
Example.
30
(i) D2n acting on {1, 2 · · · n} gives ϕ : D2n → Sn with kernel {e}.

(ii) Let G be the rotations of a cube and let it act on the three axes x, y, z
through the faces. We have ϕ : G → S3 . Then any rotation by 180◦ doesn’t
change the axes, i.e. act as the identity. So the kernel of the action has
at least 4 elements: e and the three 180◦ rotations. In fact, we’ll see later
that these 4 are exactly the kernel.
Definition (Faithful action). An action is faithful if the kernel is just {e}.
5.2 Orbits and Stabilizers

Definition (Orbit of action). Given an action G on X, the orbit of an element
x ∈ X is
orb(x) = G(x) = {y ∈ X : (∃g ∈ G) g(x) = y}.
Intuitively, it is the elements that x can possibly get mapped to.
Definition (Stabilizer of action). The stabilizer of x is
stab(x) = Gx = {g ∈ G : g(x) = x} ⊆ G.
Intuitively, it is the elements in G that do not change x.

Lemma. stab(x) is a subgroup of G.
Proof. We know that e(x) = x by definition. So stab(x) is non-empty. Suppose

g, h ∈ stab(x), then gh−1 (x) = g(h−1 (x)) = g(x) = x. So gh−1 ∈ stab(X). So
stab(x) is a subgroup.
Example.
(i) Consider D8 acting on the corners of the square X = {1, 2, 3, 4}. Then
orb(1) = X since 1 can go anywhere by rotations. stab(1) = {e, reflection
in the line through 1}
(ii) Consider the rotations of a cube acting on the three axes x, y, z. Then
orb(x) is everything, and stab(x) contains e, 180◦ rotations and rotations
about the x axis.
Definition (Transitive action). An action G on X is transitive if (∀x) orb(x) =
X, i.e. you can reach any element from any element.
Lemma. The orbits of an action partition X.
Proof. Firstly, (∀x)(x ∈ orb(x)) as e(x) = x. So every x is in some orbit.

Then suppose z ∈ orb(x) and z ∈ orb(y), we have to show that orb(x) =
orb(y). We know that z = g1 (x) and z = g2 (y) for some g1 , g2 . Then g1 (x) =
g2 (y) and y = g2−1 g1 (x).
For any w = g3 (y) ∈ orb(y), we have w = g3 g2−1 g1 (x). So w ∈ orb(x). Thus
orb(y) ⊆ orb(x) and similarly orb(x) ⊆ orb(y). Therefore orb(x) = orb(y).
31
Suppose a group G acts on X. We fix an x ∈ X. Then by definition of

the orbit, given any g ∈ G, we have g(x) ∈ orb(x). So each g ∈ G gives us
a member of orb(x). Conversely, every object in orb(x) arises this way, by
definition of orb(x). However, different elements in G can give us the same orbit.
In particular, if g ∈ stab(x), then hg and h give us the same object in orb(x),
since hg(x) = h(g(x)) = h(x). So we have a correspondence between things in
orb(x) and members of G, “up to stab(x)”.
Theorem (Orbit-stabilizer theorem). Let the group G act on X. Then there
is a bijection between orb(x) and cosets of stab(x) in G. In particular, if G is
finite, then
| orb(x)|| stab(x)| = |G|.
Proof. We biject the cosets of stab(x) with elements in the orbit of x. Recall
that G : stab(x) is the set of cosets of stab(x). We can define
θ : (G : stab(x)) → orb(x)
g stab(x) 7→ g(x).
This is well-defined — if g stab(x) = h stab(x), then h = gk for some k ∈ stab(x).

So h(x) = g(k(x)) = g(x).
This map is surjective since for any y ∈ orb(x), there is some g ∈ G such
that g(x) = y, by definition. Then θ(g stab(x)) = y. It is injective since if
g(x) = h(x), then h−1 g(x) = x. So h−1 g ∈ stab(x). So g stab(x) = h stab(x).
Hence the number of cosets is | orb(x)|. Then the result follows from La-
grange’s theorem.
An important application of the orbit-stabilizer theorem is determining group
sizes. To find the order of the symmetry group of, say, a pyramid, we find
something for it to act on, pick a favorite element, and find the orbit and
stabilizer sizes.
Example.
(i) Suppose we want to know how big D2n is. D2n acts on the vertices
{1, 2, 3, · · · , n} transitively. So | orb(1)| = n. Also, stab(1) = {e, reflection
in the line through 1}. So |D2n | = | orb(1)|| stab(1)| = 2n.
Note that if the action is transitive, then all orbits have size |X| and thus
all stabilizers have the same size.
(ii) Let h(1 2)i act on {1, 2, 3}. Then orb(1) = {1, 2} and stab(1) = {e}.
orb(3) = {3} and stab(3) = h(1 2)i.
(iii) Consider S4 acting on {1, 2, 3, 4}. We know that orb(1) = X and |S4 | = 24.
So | stab(1)| = 24 4 = 6. That makes it easier to find stab(1). Clearly
S{2,3,4} ∼
= S3 fix 1. So S{2,3,4} ≤ stab(1). However, |S3 | = 6 = | stab(1)|,
so this is all of the stabilizer.
5.3 Important actions

Given any group G, there are a few important actions we can define. In particular,
we will define the conjugation action, which is a very important concept on
32
its own. In fact, the whole of the next chapter will be devoted to studying
conjugation in the symmetric groups.
First, we will study some less important examples of actions.
Lemma (Left regular action). Any group G acts on itself by left multiplication.
This action is faithful and transitive.
Proof. We have
1. (∀g ∈ G)(x ∈ G) g(x) = g · x ∈ G by definition of a group.
2. (∀x ∈ G) e · x = x by definition of a group.
3. g(hx) = (gh)x by associativity.
So it is an action.
To show that it is faithful, we want to know that [(∀x ∈ X) gx = x] ⇒ g = e.
This follows directly from the uniqueness of identity.
To show that it is transitive, ∀x, y ∈ G, then (yx−1 )(x) = y. So any x can
be sent to any y.
Theorem (Cayley’s theorem). Every group is isomorphic to some subgroup of
some symmetric group.
Proof. Take the left regular action of G on itself. This gives a group homo-
morphism ϕ : G → Sym G with ker ϕ = {e} as the action is faithful. By the
isomorphism theorem, G ∼ = im ϕ ≤ Sym G.
Lemma (Left coset action). Let H ≤ G. Then G acts on the left cosets of H
by left multiplication transitively.
Proof. First show that it is an action:
0. g(aH) = (ga)H is a coset of H.
1. e(aH) = (ea)H = aH.
2. g1 (g2 (aH)) = g1 ((g2 a)H) = (g1 g2 a)H = (g1 g2 )(aH).
To show that it is transitive, given aH, bH, we know that (ba−1 )(aH) = bH.
So any aH can be mapped to bH.
In the boring case where H = {e}, then this is just the left regular action
since G/{e} ∼= G.
Definition (Conjugation of element). The conjugation of a ∈ G by b ∈ G is
given by bab−1 ∈ G. Given any a, c, if there exists some b such that c = bab−1 ,
then we say a and c are conjugate.
What is conjugation? This bab−1 form looks familiar from Vectors and
Matrices. It is the formula used for changing basis. If b is the change-of-basis
matrix and a is a matrix, then the matrix in the new basis is given by bab−1 . In
this case, bab−1 is the same matrix viewed from a different basis.
In general, two conjugate elements are “the same” in some sense. For example,
we will later show that in Sn , two elements are conjugate if and only if they
have the same cycle type. Conjugate elements in general have many properties
in common, such as their order.
33
Lemma (Conjugation action). Any group G acts on itself by conjugation (i.e.

g(x) = gxg −1 ).
Proof. To show that this is an action, we have
0. g(x) = gxg −1 ∈ G for all g, x ∈ G.
1. e(x) = exe−1 = x
2. g(h(x)) = g(hxh−1 ) = ghxh−1 g −1 = (gh)x(gh)−1 = (gh)(x)
Definition (Conjugacy classes and centralizers). The conjugacy classes are the
orbits of the conjugacy action.
ccl(a) = {b ∈ G : (∃g ∈ g) gag −1 = b}.
The centralizers are the stabilizers of this action, i.e. elements that commute
with a.
CG (a) = {g ∈ G : gag −1 = a} = {g ∈ G : ga = ag}.
The centralizer is defined as the elements that commute with a particular
element a. For the whole group G, we can define the center.
Definition (Center of group). The center of G is the elements that commute
with all other elements.
Z(G) = {g ∈ G : (∀a) gag −1 = a} = {g ∈ G : (∀a) ga = ag}.
It is sometimes written as C(G) instead of Z(G).

In many ways, conjugation is related to normal subgroups.
Lemma. Let K C G. Then G acts by conjugation on K.
Proof. We only have to prove closure as the other properties follow from the
conjugation action. However, by definition of a normal subgroup, for every
g ∈ G, k ∈ K, we have gkg −1 ∈ K. So it is closed.
Proposition. Normal subgroups are exactly those subgroups which are unions
of conjugacy classes.
Proof. Let K C G. If k ∈ K, then by definition for every g ∈ G, we get
gkg −1 ∈ K. So ccl(k) ⊆ K. So K is the union of the conjugacy classes of all its
elements.
Conversely, if K is a union of conjugacy classes and a subgroup of G, then
for all k ∈ K, g ∈ G, we have gkg −1 ∈ K. So K is normal.
Lemma. Let X be the set of subgroups of G. Then G acts by conjugation on
X.
Proof. To show that it is an action, we have
0. If H ≤ G, then we have to show that gHg −1 is also a subgroup. We
know that e ∈ H and thus geg −1 = e ∈ gHg −1 , so gHg −1 is non-empty.
For any two elements gag −1 and gbg −1 ∈ gHg −1 , (gag −1 )(gbg −1 )−1 =
g(ab−1 )g −1 ∈ gHg −1 . So gHg −1 is a subgroup.
34
1. eHe−1 = H.
2. g1 (g2 Hg2−1 )g1−1 = (g1 g2 )H(g1 g2 )−1 .
Under this action, normal subgroups have singleton orbits.

Definition (Normalizer of subgroup). The normalizer of a subgroup is the
stabilizer of the (group) conjugation action.
NG (H) = {g ∈ G : gHg −1 = H}.
We clearly have H ⊆ NG (H). It is easy to show that NG (H) is the largest

subgroup of G in which H is a normal subgroup, hence the name.
There is a connection between actions in general and conjugation of subgroups.
Lemma. Stabilizers of the elements in the same orbit are conjugate, i.e. let G
act on X and let g ∈ G, x ∈ X. Then stab(g(x)) = g stab(x)g −1 .
5.4 Applications
Example. Let G+ be the rotations of a cube acting on the vertices. Let
X be the set of vertices. Then |X| = 8. Since the action is transitive, the
orbit of element is the whole of X. The stabilizer of vertex 1 is the set of
rotations through 1 and the diagonally opposite vertex, of which there are 3. So
|G+ | = | orb(1)|| stab(1)| = 8 · 3 = 24.
Example. Let G be a finite simple group of order greater than 2, and H ≤ G
have index n 6= 1. Then |G| ≤ n!/2.
Proof. Consider the left coset action of G on H. We get a group homomorphism

ϕ : G → Sn since there are n cosets of H. Since H = 6 G, ϕ is non-trivial and
ker ϕ 6= G. Now ker ϕ C G. Since G is simple, ker ϕ = {e}. So G ∼ = im ϕ ⊆ Sn
by the isomorphism theorem. So |G| ≤ |Sn | = n!.
We can further refine this by considering sgn ◦ϕ : G → {±1}. The kernel
of this composite is normal in G. So K = ker(sgn ◦φ) = {e} or G. Since
G/K ∼ = im(sgn ◦φ), we know that |G|/|K| = 1 or 2 since im(sgn ◦φ) has at most
two elements. Hence for |G| > 2, we cannot have K = {e}, or else |G|/|K| > 2.
So we must have K = G, so sgn(ϕ(g)) = 1 for all g and im ϕ ≤ An . So
|G| ≤ n!/2
We have seen on Sheet 1 that if |G| is even, then G has an element of order
2. In fact,
Theorem (Cauchy’s Theorem). Let G be a finite group and prime p dividing
|G|. Then G has an element of order p (in fact there must be at least p − 1
elements of order p).
It is important to remember that this only holds for prime p. For example,
A4 doesn’t have an element of order 6 even though 6 | 12 = |A4 |. The converse,
however, holds for any number trivially by Lagrange’s theorem.
Proof. Let G and p be fixed. Consider Gp = G × G × · · · × G, the set of p-tuples
of G. Let X ⊆ Gp be X = {(a1 , a2 , · · · , ap ) ∈ Gp : a1 a2 · · · ap = e}.
35
In particular, if an element b has order p, then (b, b, · · · , b) ∈ X. In fact, if

(b, b, · · · , b) ∈ X and b 6= e, then b has order p, since p is prime.
Now let H = hh : hp = ei ∼ = Cp be a cyclic group of order p with generator h
(This h is not related to G in any way). Let H act on X by “rotation”:
h(a1 , a2 , · · · , ap ) = (a2 , a3 , · · · , ap , a1 )
This is an action:
0. If a1 · · · ap = e, then a−1 1 = a2 · · · ap . So a2 · · · ap a1 = a−1

1 a1 = e. So
(a2 , a3 , · · · , ap , a1 ) ∈ X.
1. e acts as an identity by construction
2. The “associativity” condition also works by construction.
As orbits partition X, the sum of all orbit sizes must be |X|. We know that
|X| = |G|p−1 since we can freely choose the first p − 1 entries and the last one
must be the inverse of their product. Since p divides |G|, p also divides |X|. We
have | orb(a1 , · · · , ap )|| stabH (a1 , · · · , ap )| = |H| = p. So all orbits have size 1 or
p, and they sum to |X| = p× something. We know that there is one orbit of size
1, namely (e, e, · · · , e). So there must be at least p − 1 other orbits of size 1 for
the sum to be divisible by p.
In order to have an orbit of size 1, they must look like (a, a, · · · , a) for some
a ∈ G, which has order p.
36
6 Symmetric groups II IA Groups
6 Symmetric groups II
In this chapter, we will look at conjugacy classes of Sn and An . It turns out this
is easy for Sn , since two elements are conjugate if and only if they have the same
cycle type. However, it is slightly more complicated in An . This is since while
(1 2 3) and (1 3 2) might be conjugate in S4 , the element needed to perform the
conjugation might be odd and not in An .
6.1 Conjugacy classes in Sn

Recall σ, τ ∈ Sn are conjugate if ∃ρ ∈ Sn such that ρσρ−1 = τ .
We first investigate the special case, when σ is a k-cycle.
Proposition. If (a1 a2 · · · ak ) is a k-cycle and ρ ∈ Sn , then ρ(a1 · · · ak )ρ−1
is the k-cycle (ρ(a1 ) ρ(a2 ) · · · ρ(a3 )).
Proof. Consider any ρ(a1 ) acted on by ρ(a1 · · · ak )ρ−1 . The three permutations
send it to ρ(a1 ) 7→ a1 7→ a2 7→ ρ(a2 ) and similarly for other ai s. Since ρ is
bijective, any b can be written as ρ(a) for some a. So the result is the k-cycle
(ρ(a1 ) ρ(a2 ) · · · ρ(a3 )).
Corollary. Two elements in Sn are conjugate iff they have the same cycle type.
Proof. Suppose σ = σ1 σ2 · · · σ` , where σi are disjoint cycles. Then ρσρ−1 =
ρσ1 ρ−1 ρσ2 ρ−1 · · · ρσ` ρ−1 . Since the conjugation of a cycle conserves its length,
ρσρ−1 has the same cycle type.
Conversely, if σ, τ have the same cycle type, say
σ = (a1 a2 · · · ak )(ak+1 · · · ak+` ), τ = (b1 b2 · · · bk )(bk+1 · · · bk+` ),
if we let ρ(ai ) = bi , then ρσρ−1 = τ .

Example. Conjugacy classes of S4 :
Cycle type Example element Size of ccl Size of centralizer Sign

(1, 1, 1, 1) e 1 24 +1
(2, 1, 1) (1 2) 6 4 −1
(2, 2) (1 2)(3 4) 3 8 +1
(3, 1) (1 2 3) 8 3 +1
(4) (1 2 3 4) 6 4 −1
We know that a normal subgroup is a union of conjugacy classes. We can now

find all normal subgroups by finding possible union of conjugacy classes whose
cardinality divides 24. Note that the normal subgroup must contain e.
(i) Order 1: {e}
(ii) Order 2: None
(iii) Order 3: None
(iv) Order 4: {e, (1 2)(3 4), (1 3)(2 4), (1 4)(2 3)} ∼
= C2 × C2 = V4 is a possible
candidate. We can check the group axioms and find that it is really a
subgroup
37
(v) Order 6: None

(vi) Order 8: None
(vii) Order 12: A4 (We know it is a normal subgroup since it is the kernel of
the signature and/or it has index 2)
(viii) Order 24: S4
We can also obtain the quotients of S4 : S4 /{e} ∼
= S4 , S4 /V4 ∼
= S3 ∼
= D6 ,
S4 /A4 ∼
= C2 , S4 /S4 = {e}.
6.2 Conjugacy classes in An

We have seen that |Sn | = 2|An | and that conjugacy classes in Sn are “nice”.
How about in An ?
The first thought is that we write it down:
cclSn (σ) = {τ ∈ Sn : (∃ρ ∈ Sn ) τ = ρσρ−1 }

cclAn (σ) = {τ ∈ An : (∃ρ ∈ An ) τ = ρσρ−1 }
Obviously cclAn (σ) ⊆ cclSn (σ), but the converse need not be true since the
conjugation need to map σ to τ may be odd.
Example. Consider (1 2 3) and (1 3 2). They are conjugate in S3 by (2 3), but
(2 3) 6∈ A3 . (This does not automatically entail that they are not conjugate in
A3 because there might be another even permutation that conjugate (1 2 3) and
(1 3 2). In A5 , (2 3)(4 5) works (but not in A3 ))
We can use the orbit-stabilizer theorem:
|Sn | = | cclSn (σ)||CSn (σ)|

|An | = | cclAn (σ)||CAn (σ)|
We know that An is half of Sn and cclAn is contained in cclSn . So we have two

options: either cclSn (σ) = cclAn (σ) and |CSn (σ)| = 12 |CAn (σ)|; or 12 | cclSn (σ)| =
| cclAn (σ)| and CAn (σ) = CSn (σ).
Definition (Splitting of conjugacy classes). When | cclAn (σ)| = 12 | cclSn (σ)|, we
say that the conjugacy class of σ splits in An .
So the conjugacy classes are either retained or split.

Proposition. For σ ∈ An , the conjugacy class of σ splits in An if and only if
no odd permutation commutes with σ.
Proof. We have the conjugacy classes splitting if and only if the centralizer
does not. So instead we check whether the centralizer splits. Clearly CAn (σ) =
CSn (σ) ∩ An . So splitting of centralizer occurs if and only if an odd permutation
commutes with σ.
Example. Conjugacy classes in A4 :
38
Cycle type Example | cclS4 | Odd element in CS4 ? | cclA4 |

(1, 1, 1, 1) e 1 Yes (1 2) 1
(2, 2) (1 2)(3 4) 3 Yes (1 2) 3
(3, 1) (1 2 3) 8 No 4, 4
In the (3, 1) case, by the orbit stabilizer theorem, |CS4 ((1 2 3))| = 3, which is
odd and cannot split.
Example. Conjugacy classes in A5 :
Cycle type Example | cclS5 | Odd element in CS5 ? | cclA5 |

(1, 1, 1, 1, 1) e 1 Yes (1 2) 1
(2, 2, 1) (1 2)(3 4) 15 Yes (1 2) 15
(3, 1, 1) (1 2 3) 20 Yes (4 5) 20
(5) (1 2 3 4 5) 24 No 12, 12
Since the centralizer of (1 2 3 4 5) has size 5, it cannot split, so its conjugacy

class must split.
Lemma. σ = (1 2 3 4 5) ∈ S5 has CS5 (σ) = hσi.
Proof. | cclSn (σ)| = 24 and |S5 | = 120. So |CS5 (σ)| = 5. Clearly hσi ⊆ CS5 (σ).
Since they both have size 5, we know that CS5 (σ) = hσi
Theorem. A5 is simple.
Proof. We know that normal subgroups must be unions of the conjugacy classes,
must contain e and their order must divide 60. The possible orders are 1, 2,
3, 4, 5, 6, 10, 12, 15, 20, 30. However, the conjugacy classes 1, 15, 20, 12, 12
cannot add up to any of the possible orders apart from 1 and 60. So we only
have trivial normal subgroups.
In fact, all An for n ≥ 5 are simple, but the proof is horrible (cf. IB Groups,
Rings and Modules).
39
7 Quaternions IA Groups
7 Quaternions
In the remaining of the course, we will look at different important groups. Here,
we will have a brief look at
Definition (Quaternions). The quaternions is the set of matrices

1 0 i 0 0 1 0 i
, , ,
0 1 0 −i −1 0 i 0

−1 0 −i 0 0 −1 0 −i
, , ,
0 −1 0 i 1 0 −i 0
which is a subgroup of GL2 (C).

Notation. We can also write the quaternions as
Q8 = ha, b : a4 = e, b2 = a2 , bab−1 = a−1 i
Even better, we can write
Q8 = {1, −1, i, −i, j, −j, k, −k}
with
(i) (−1)2 = 1
(ii) i2 = j 2 = k 2 = −1
(iii) (−1)i = −i etc.

(iv) ij = k, jk = i, ki = j
(v) ji = −k, kj = −i, ik = −j
We have

1 0 i 0 0 1 0 i
1= ,i = ,j = ,k =
0 1 0 −i −1 0 i 0

−1 0 −i 0 0 −1 0 −i
−1 = , −i = , −j = , −k =
0 −1 0 i 1 0 −i 0
Lemma. If G has order 8, then either G is abelian (i.e. ∼ = C8 , C4 × C2 or

C2 × C2 × C2 ), or G is not abelian and isomorphic to D8 or Q8 (dihedral or
quaternion).
Proof. Consider the different possible cases:
– If G contains an element of order 8, then G ∼
= C8 .
– If all non-identity elements have order 2, then G is abelian (Sheet 1, Q8).
Let a = 6 b ∈ G \ {e}. By the direct product theorem, ha, bi = hai × hbi.
Then take c 6∈ ha, bi. By the direct product theorem, we obtain ha, b, ci =
hai × hbi × hci = C2 × C2 × C2 . Since ha, b, ci ⊆ G and |ha, b, ci| = |G|,
G = ha, b, ci ∼
= C2 × C2 × C2 .
40
7 Quaternions IA Groups
– G has no element of order 8 but has an order 4 element a ∈ G. Let

H = hai. Since H has index 2, it is normal in G. So G/H ∼ = C2 since
|G/H| = 2. This means that for any b 6∈ H, bH generates G/H. Then
(bH)2 = b2 H = H. So b2 ∈ H. Since b2 ∈ hai and hai is a cyclic group, b2
commutes with a.
If b2 = a or a3 , then b has order 8. Contradiction. So b2 = e or a2 .
We also know that H is normal, so bab−1 ∈ H. Let bab−1 = a` . Since
a and b2 commute, we know that a = b2 ab−2 = b(bab−1 )b−1 = ba` b−1 =
2
(bab−1 )` = a` . So `2 ≡ 1 (mod 4). So ` ≡ ±1 (mod 4).
◦ When l ≡ 1 (mod 4), bab−1 = a, i.e. ba = ab. So G is abelian.

∗ If b2 = e, then G = ha, bi ∼
= hai × hbi ∼
= C4 × C2 .
∗ If b = a , then (ba ) = e. So G = ha, ba−1 i ∼
2 2 −1 2
= C4 × C2 .
◦ If l ≡ −1 (mod 4), then bab−1 = a−1 .
∗ If b2 = e, then G = ha, b : a4 = e = b2 , bab−1 = a−1 i. So G ∼
= D8
by definition.
∗ If b2 = a2 , then we have G ∼= Q8 .
41
8 Matrix groups IA Groups
8 Matrix groups
8.1 General and special linear groups
Consider Mn×n (F ), i.e. the set of n × n matrices over the field F = R or C (or
Fp ). We know that matrix multiplication is associative (since they represent
functions) but are, in general, not commutative. To make this a group, we want
the identity matrix I to be the identity. To ensure everything has an inverse, we
can only include invertible matrices.
(We do not necessarily
need
to take I as the identity of the group. We can,
0 0
for example, take e = and obtain a group in which every matrix is of
0 1
0 0
the form for some non-zero a. This forms a group, albeit a boring one
0 a
∼ ∗
(it is simply = R ))
Definition (General linear group GLn (F )).
GLn (F ) = {A ∈ Mn×n (F ) : A is invertible}
is the general linear group.
Alternatively, we can define GLn (F ) as matrices with non-zero determinants.

Proposition. GLn (F ) is a group.
Proof. Identity is I, which is in GLn (F ) by definition (I is its self-inverse). The
composition of invertible matrices is invertible, so is closed. Inverse exist by
definition. Multiplication is associative.
Proposition. det : GLn (F ) → F \ {0} is a surjective group homomorphism.

Proof. det AB = det A det B. If A is invertible, it has non-zero determinant and
det A ∈ F \ {0}.
To show it is surjective, for any x ∈ F \ {0}, if we take the identity matrix
and replace I11 with x, then the determinant is x. So it is surjective.
Definition (Special linear group SLn (F )). The special linear group SLn (F ) is
the kernel of the determinant, i.e.
SLn (F ) = {A ∈ GLn (F ) : det A = 1}.
So SLn (F ) C GLn (F ) as it is a kernel. Note that Q8 ≤ SL2 (C)
8.2 Actions of GLn (C)

Proposition. GLn (C) acts faithfully on Cn by left multiplication to the vector,
with two orbits (0 and everything else).
Proof. First show that it is a group action:

1. If A ∈ GLn (C) and v ∈ Cn , then Av ∈ Cn . So it is closed.
2. Iv = v for all v ∈ Cn .
42
3. A(Bv) = (AB)v.
Now prove that it is faithful: a linear map is determined by what it does
on a basis. Take the standard basis e1 = (1, 0, · · · , 0), · · · en = (0, · · · , 1). Any
matrix which maps each ek to itself must be I (since the columns of a matrix
are the images of the basis vectors)
To show that there are 2 orbits, we know that A0 = 0 for all A. Also, as A
is invertible, Av = 0 ⇔ v = 0. So 0 forms a singleton orbit. Then given any
two vectors v =6 w ∈ Cn \ {0}, there is a matrix A ∈ GLn (C) such that Av = w
(cf. Vectors and Matrices).
Similarly, GLn (R) acts on Rn .
Proposition. GLn (C) acts on Mn×n (C) by conjugation. (Proof is trivial)
This action can be thought of as a “change of basis” action. Two matrices
are conjugate if they represent the same map but with respect to different bases.
The P is the base change matrix.
From Vectors and Matrices, we know that there are three different types of
orbits for GL2 (C): A is conjugate to a matrix of one of these forms:

λ 0
(i) , with λ 6= µ, i.e. two distinct eigenvalues
0 µ

λ 0
(ii) , i.e. a repeated eigenvalue with 2-dimensional eigenspace
0 λ

λ 1
(iii) , i.e. a repeated eigenvalue with a 1-dimensional eigenspace
0 λ
Note that we said there are three types of orbits, not three orbits. There are
infinitely many orbits, e.g. one for each of λI.
8.3 Orthogonal groups

Recall that AT is defined by ATij = Aji , i.e. we reflect the matrix in the diagonal.
They have the following properties:
(i) (AB)T = B T AT
(ii) (A−1 )T = (AT )−1
(iii) AT A = I ⇔ AAT = I ⇔ A−1 = AT . In this case A is orthogonal
(iv) det AT = det A
We are now in R, because orthogonal matrices don’t make sense with complex
matrices.
Note that a matrix is orthogonal if the columns (or rows) form an orthonormal
basis of Rn : AAT = I ⇔ aik ajk = δij ⇔ ai · aj = δij , where ai is the ith column
of A.
The importance of orthogonal matrices is that they are the isometries of Rn .
Lemma (Orthogonal matrices are isometries). For any orthogonal A and x, y ∈
Rn , we have
43
(i) (Ax) · (Ay) = x · y

(ii) |Ax| = |x|
Proof. Treat the dot product as a matrix multiplication. So
(Ax)T (Ay) = xT AT Ay = xT Iy = xT y
Then we have |Ax|2 = (Ax) · (Ax) = x · x = |x|2 . Since both are positive, we
know that |Ax| = |x|.
It is important to note that orthogonal matrices are isometries, but not all
isometries are orthogonal. For example, translations are isometries but are not
represented by orthogonal matrices, since they are not linear maps and cannot
be represented by matrices at all! However, it is true that all linear isometries
can be represented by orthogonal matrices.
Definition (Orthogonal group O(n)). The orthogonal group is
O(n) = On = On (R) = {A ∈ GLn (R) : AT A = I},
i.e. the group of orthogonal matrices.
We will later show that this is the set of matrices that preserve distances in
Rn .
Lemma. The orthogonal group is a group.
Proof. We have to check that it is a subgroup of GLn (R): It is non-empty,
since I ∈ O(n). If A, B ∈ O(n), then (AB −1 )(AB −1 )T = AB −1 (B −1 )T AT =
AB −1 BA−1 = I, so AB −1 ∈ O(n) and this is indeed a subgroup.
Proposition. det : O(n) → {±1} is a surjective group homomorphism.
Proof. For A ∈ O(n), we know that AT A = I. So det AT A = (det A)2 = 1. So
det A = ±1. Since det(AB) = det A det B, it is a homomorphism. We have
 
−1 0 · · · 0
 0 1 · · · 0
det I = 1, det  .  = −1,
 
.. . .
 .. . . 0
0 0 ··· 1
so it is surjective.
Definition (Special orthogonal group SO(n)). The special orthogonal group is
the kernel of det : O(n) → {±1}.
SO(n) = SOn = SOn (R) = {A ∈ O(n) : det A = 1}.
By the isomorphism theorem, O(n)/SO(n) ∼ = C2 .

What’s wrong with matrices with determinant −1? Why do we want to
eliminate these? An important example of an orthogonal matrix with determinant
−1 is a reflection. These transformations reverse orientation, and is often
unwanted.
44
 
−1 0 ··· 0
0 1 ··· 0
Lemma. O(n) = SO(n) ∪  .  SO(n)
 
.. . .
 .. . . 0
0 0 ··· 1
Proof. Cosets partition the group.
8.4 Rotations and reflections in R2 and R3

Lemma. SO(2) consists of all rotations of R2 around 0.

T a b
Proof. Let A ∈ SO(2). So A A = I and det A = 1. Suppose A = .
c d

d −b
Then A−1 = . So AT = A−1 implies ad − bc = 1, c = −b, d = a.
−c a
Combining these equations we obtain a2 + c2 = 1. Set a = cos θ = d, and
c = sin θ = −b. Then these satisfies all three equations. So

cos θ − sin θ
A= .
sin θ cos θ
Note that A maps (1, 0) to (cos θ, sin θ), and maps (0, 1) = (− sin θ, cos θ), which
are rotations by θ counterclockwise. So A represents a rotation by θ.
Corollary. Any matrix in O(2) is either a rotation around 0 or a reflection in a
line through 0.
Proof. If A ∈ SO(2), we’ve show that it is a rotation. Otherwise,

1 0 cos θ − sin θ cos θ − sin θ
A= =
0 −1 sin θ cos θ − sin θ − cos θ

1 0
since O(2) = SO(2) ∪ SO(2). This has eigenvalues 1, −1. So it is a
0 −1
reflection in the line of the eigenspace E1 . The line goes through 0 since the
eigenspace is a subspace which must include 0.
Lemma. Every matrix in SO(3) is a rotation around some axis.
Proof. Let A ∈ SO(3). We know that det A = 1 and A is an isometry. The
eigenvalues λ must have |λ| = 1. They also multiply to det A = 1. Since we are
in R, complex eigenvalues come in complex conjugate pairs. If there are complex
eigenvalues λ and λ̄, then λλ̄ = |λ|2 = 1. The third eigenvalue must be real and
has to be +1.
If all eigenvalues are real. Then eigenvalues are either 1 or −1, and must
multiply to 1. The possibilities are 1, 1, 1 and −1, −1, 1, all of which contain an
eigenvalue of 1.
So pick an eigenvector for our eigenvalue 1 as the third basis vector. Then in
some orthonormal basis,  
a b 0
A =  c d 0
0 0 1
45
Since the third column is the image of the third basis vector, and by orthogonality
the third row is 0, 0, 1. Now let

a b
A0 = ∈ GL2 (R)
c d
with det A0 = 1. A0 is still orthogonal, so A0 ∈ SO(2). Therefore A0 is a rotation

and  
cos θ − sin θ 0
A =  sin θ cos θ 0
0 0 1
in some basis, and this is exactly the rotation through an axis.
Lemma. Every matrix in O(3) is the product of at most three reflections in
planes through 0.
Note that a rotation is a product of two reflections. This lemma effectively
states that every matrix in O(3) is a reflection, a rotation or a product of a
reflection and a rotation.
 
1 0 0
Proof. Recall O(3) = SO(3) ∪ 0 1 0  SO(3). So if A ∈ SO(3), we know
  0 0 −1
cos θ − sin θ 0
that A =  sin θ cos θ 0 in some basis, which is a composite of two
0 0 1
reflections:   
1 0 0 cos θ sin θ 0
A = 0 −1 0  sin θ − cos θ 0 ,
0 0 1 0 0 1
 
1 0 0
Then if A ∈ 0 1 0  SO(3), then it is automatically a product of three
0 0 −1
reflections.
In the last line we’ve shown that everything in O(3) \ SO(3) can be written as
a product of three reflections, but it is possible that they needonly 1 reflection.

−1 0 0
However, some matrices do genuinely need 3 reflections, e.g.  0 −1 0 
0 0 −1
8.5 Unitary groups

The concept of orthogonal matrices only make sense if we are talking about
real matrices. If we are talking about complex, then instead we need unitary
matrices. To do so, we replace the transposition with the Hermitian conjugate.
It is defined by A† = (A∗ )T with (A† )ij = A∗ji , where the asterisk is the complex
conjugate. We still have
(i) (AB)† = B † A†
(ii) (A−1 )† = (A† )−1
46
(iii) A† A = I ⇔ AA† = I ⇔ A† = A−1 . We say A is a unitary matrix

(iv) det A† = (det A)∗
Definition (Unitary group U (n)). The unitary group is
U(n) = Un = {A ∈ GLn (C) : A† A = I}.
Lemma. det : U(n) → S 1 , where S 1 is the unit circle in the complex plane, is
a surjective group homomorphism.
Proof. We know that 1 = det I = det A† A = | det A|2 . So | det A| = 1. Since

det AB = det A det B, it is a group
 homomorphism.

λ 0 ··· 0
 0 1 · · · 0
Now given λ ∈ S1 , we have  . . . ∈ U(n). So it is surjective.
 
 .. .. . . 0

0 0 0 1
Definition (Special unitary group SU (n)). The special unitary group SU(n) =
SUn is the kernel of det U (n) → S 1 .
Similarly, unitary matrices preserve the complex dot product: (Ax) · (Ay) =
x · y.
47
9 More on regular polyhedra IA Groups
9 More on regular polyhedra

In this section, we will look at the symmetry groups of the cube and the
tetrahedron.
9.1 Symmetries of the cube

Rotations
Recall that there are |G+ | = 24 rotations of the group by the orbit-stabilizer
theorem.
Proposition. G+ ∼
= S4 , where G+ is the group of all rotations of the cube.
Proof. Consider G+ acting on the 4 diagonals of the cube. This gives a group
homomorphism ϕ : G+ → S4 . We have (1 2 3 4) ∈ im ϕ by rotation around
the axis through the top and bottom face. We also (1 2) ∈ im ϕ by rotation
around the axis through the mid-point of the edge connect 1 and 2. Since (1 2)
and (1 2 3 4) generate S4 (Sheet 2 Q. 5d), im ϕ = S4 , i.e. φ is surjective. Since
|S4 | = |G+ |, ϕ must be an isomorphism.
All symmetries
Consider the reflection in the mid-point of the cube τ , sending every point to
its opposite. We can view this as −I in R3 . So it commutes with all other
symmetries of the cube.
Proposition. G ∼
= S4 × C2 , where G is the group of all symmetries of the cube.
Proof. Let τ be “reflection in mid-point” as shown above. This commutes with
everything. (Actually it is enough to check that it commutes with rotations
only)
We have to show that G = G+ hτ i. This can be deduced using sizes: since
+
G and hτ i intersect at e only, (i) and (ii) of the Direct Product Theorem gives
an injective group homomorphism G+ × hτ i → G. Since both sides have the
same size, the homomorphism must be surjective as well. So G ∼ = G+ × hτ i ∼
=
S4 × C2 .
In fact, we have also proved that the group of symmetries of an octahedron

is S4 × C2 since the octahedron is the dual of the cube. (if you join the centers
of each face of the cube, you get an octahedron)
48
9 More on regular polyhedra IA Groups
9.2 Symmetries of the tetrahedron

Rotations
Let 1, 2, 3, 4 be the vertices (in any order). G+ is just the rotations. Let it act
on the vertices. Then orb(1) = {1, 2, 3, 4} and stab(1) = { rotations in the axis
through 1 and the center of the opposite face } = {e, 2π 4π
3 , 3 }
+
So |G | = 4 · 3 = 12 by the orbit-stabilizer theorem.
The action gives a group homomorphism ϕ : G+ → S4 . Clearly ker ϕ = {e}.
So G+ ≤ S4 and G+ has size 12. We “guess” it is A4 (actually it must be A4
since that is the only subgroup of S4 of order 12, but it’s nice to see why that’s
the case).
If we rotate in an axis through 1, we get (2 3 4), (2 4 3). Similarly, rotating
through other axes through vertices gives all 3-cycles.
If we rotate through an axis that passes through two opposite edges, e.g.
through 1-2 edge and 3-4 edge, then we have (1 2)(3 4) and similarly we obtain
all double transpositions. So G+ ∼ = A4 . This shows that there is no rotation
that fixes two vertices and swaps the other two.
All symmetries
Now consider the plane that goes through 1, 2 and the mid-point of 3 and 4.
Reflection through this plane swaps 3 and 4, but doesn’t change 1, 2. So now
stab(1) = h(2 3 4), (3, 4)i ∼
= D6 (alternatively, if we want to fix 1, we just move
2, 3, 4 around which is the symmetries of the triangular base)
So |G| = 4 · 6 = 24 and G ∼ = S4 (which makes sense since we can move
any of its vertices around in any way and still be a tetrahedron, so we have all
permutations of vertices as the symmetry group)
49
10 Möbius group IA Groups
10 Möbius group
10.1 Möbius maps
We want to study maps f : C → C in the form f (z) = az+b cz+d with a, b, c, d ∈ C
and ad − bc 6= 0.
We impose ad − bc 6= 0 or else the map will be constant: for any z, w ∈ C,
f (z) − f (w) = (az+b)(cw+d)−(aw+b)(cz+d)
(cw+d)(cz+d) = (ad−bc)(z−w)
(cw+d)(cz+d) . If ad − bc = 0, then f
is constant and boring (more importantly, it will not be invertible).
If c 6= 0, then f (− dc ) involves division by 0. So we add ∞ to C to form
the extended complex plane (Riemann sphere) C ∪ {∞} = C∞ (cf. Vectors and
Matrices). Then we define f (− dc ) = ∞. We call C∞ a one-point compactification
of C (because it adds one point to C to make it compact, cf. Metric and Topology).
Definition (Möbius map). A Möbius map is a map from C∞ → C∞ of the form
az + b
f (z) = ,
cz + d
where a, b, c, d ∈ C and ad − bc 6= 0, with f (− dc ) = ∞ and f (∞) = a

c 6 0.
when c =
(if c = 0, then f (∞) = ∞)
Lemma. The Möbius maps are bijections C∞ → C∞ .
az+b dz−b
Proof. The inverse of f (z) = cz+d is g(z) = −cz+a , which we can check by
composition both ways.
Proposition. The Möbius maps form a group M under function composition.

(The Möbius group)
Proof. The group axioms are shown as follows:

a1 z+b1
a2 c1 z+d1 + b2
a1 z+b1 a2 z+b2
0. If f1 (z) = c1 z+d1 and f2 (z) = c2 z+d2 , then f2 ◦f1 (z) = =
a1 z+b1
c2 c1 z+d1 + d2
(a1 a2 + b2 c1 )z + (a2 b1 + b2 d1 )
. Now we have to check that ad − bc 6= 0:
(c2 a1 + d2 c1 )z + (c2 b1 + d1 d2 )
we have (a1 a2 + b2 c1 )(c2 b1 + d1 d2 ) − (a2 b1 + b2 d1 )(c2 a1 + d2 c1 ) = (a1 d1 −
b1 c1 )(a2 d2 − b2 c2 ) 6= 0.
6 ∞, − dc11 . We have to manually check the special cases,
(This works for z =
which is simply yet more tedious algebra)
1z+0
1. The identity function is 1(z) = 0+1 which satisfies ad − bc 6= 0.
2. We have shown above that f −1 (z) = dz−b

−cz+a with da − bc =
6 0, which are
also Möbius maps
3. Composition of functions is always associative
50
M is not abelian. e.g. f1 (z) = 2z and f2 (z) = z + 1 are not commutative:

f1 ◦ f2 (z) = 2z + 2 and f2 ◦ f1 (z) = 2z + 1.
Note that the point at “infinity” is not special. ∞ is no different to any other
point of the Riemann sphere. However, from the way we write down the Möbius
map, we have to check infinity specially. In this particular case, we can get quite
1
far with conventions such as ∞ = 0, 01 = ∞ and a·∞ a
c·∞ = c .
Clearly az+b λaz+λb
cz+d = λcz+λd for any λ 6= 0. So we do not have a unique represen-
tation of a map in terms of a, b, c, d. But a, b, c, d does uniquely determine a
Möbius map.

a b az + b
Proposition. The map θ : GL2 (C) → M sending 7→ is a
c d cz + d
surjective group homomorphism.
Proof. Firstly, since the determinant ad − bc of any matrix in GL2 (C) is non-zero,
it does map to a Möbius map. This also shows that θ is surjective.
We have previously calculated that
(a1 a2 + b2 c1 )z + (a2 b1 + b2 d1 )
θ(A2 ) ◦ θ(A1 ) = = θ(A2 A1 )
(c2 a1 + d2 c1 )z + (c2 b1 + d1 d2 )
So it is a homomorphism.
The kernel of θ is

az + b
ker(θ) = A ∈ GL2 (C) : (∀z) z =
cz + d
We can try different values of z: z = ∞ ⇒ c = 0; z = 0 ⇒ b = 0; z = 1 ⇒ d = a.

So
ker θ = Z = {λI : λ ∈ C, λ 6= 0},
where I is the identity matrix and Z is the centre of GL2 (C).
By the isomorphism theorem, we have
M∼
= GL2 (C)/Z
Definition (Projective general linear group PGL2 (C)). (Non-examinable) The

projective general linear group is
PGL2 (C) = GL2 (C)/Z.
Since fA = fB iff B = λA for some λ 6= 0 (where A, B are the corresponding

matrices of the maps), if we restrict θ to SL2 (C), we have θ|SL2 (C) : SL2 (C) → M
is also surjective. The kernel is now just {±I}. So
M∼
= SL2 (C)/{±I} = PSL2 (C)
Clearly PSL2 (C) ∼

= PGL2 (C) since both are isomorphic to the Möbius group.
Proposition. Every Möbius map is a composite of maps of the following form:
(i) Dilation/rotation: f (z) = az, a 6= 0
(ii) Translation: f (z) = z + b
51
1
(iii) Inversion: f (z) = z
Proof. Let az+b

cz+d ∈ M .
If c = 0, i.e. g(∞) = ∞, then g(z) = ad z + db , i.e.
a a b
z 7→ z 7→ z + .
d d d
1
If c 6= 0, let g(∞) = z0 , Let h(z) = z−z 0
. Then hg(∞) = ∞ is of the above form.
We have h (w) = w + z0 being of type (iii) followed by (ii). So g = h−1 (hg) is
−1 1
a composition of maps of the three forms listed above.

Alternatively, with sufficient magic, we have
d 1 ad + bc a ad + bc az + b
z 7→ z + 7→ d
7→ − d
7→ − 2 d
= .
c z+ c c2 (z
+ c) c c (z + c ) cz + d
Note that the non-calculation method above can be transformed into another
(different) composition with the same end result. So the way we compose a
Möbius map from the “elementary” maps are not unique.
10.2 Fixed points of Möbius maps

Definition (Fixed point). A fixed point of f is a z such that f (z) = z.
We know that any Möbius map with c = 0 fixes ∞. We also know that
z → z + b for any b 6= 0 fixes ∞ only, where as z 7→ az for a 6= 0, 1 fixes 0 and
∞. It turns out that you cannot have more than two fixed points, unless you
are the identity.
Proposition. Any Möbius map with at least 3 fixed points must be the identity.
Proof. Consider f (z) = az+b
cz+d . This has fixed points at those z which satisfy
az+b 2
cz+d = z ⇔ cz + (d − a)z − b = 0. A quadratic has at most two roots, unless
c = b = 0 and d = a, in which the equation just says 0 = 0.
However, if c = b = 0 and d = a, then f is just the identity.
Proposition. Any Möbius map is conjugate to f (z) = νz for some ν 6= 0 or to
f (z) = z + 1.
Proof. We have the surjective group homomorphism θ : GL2 (C) → M . The
conjugacy classes of GL2 (C) are of types

λ 0 λz + 0 λ
7→ g(z) = = z
0 µ 0z + µ µ

λ 0 λz + 0
7→ g(z) = = 1z
0 λ 0z + λ

λ 1 λz + 1 1
7→ g(z) = =z+
0 λ λ λ
But the last one is not in the
form z + 1. We knowthat the last g(z) can
1 λ1 1 1
also be represented by , which is conjugate to (since that’s its
0 1 0 1
Jordan-normal form). So z + λ1 is also conjugate to z + 1.
52
Now we see easily that (for ν 6= 0, 1), νz has 0 and ∞ as fixed points, z + 1
only has ∞. Does this transfer to their conjugates?
Proposition. Every non-identity has exactly 1 or 2 fixed points.

Proof. Given f ∈ M and f 6= id. So ∃h ∈ M such that hf h−1 (z) = νz. Now
f (w) = w ⇔ hf (w) = h(w) ⇔ hf h−1 (h(w)) = h(w). So h(w) is a fixed point
of hf h−1 . Since h is a bijection, f and hf h−1 have the same number of fixed
points.
So f has exactly 2 fixed points if f is conjugate to νz, and exactly 1 fixed
point if f is conjugate to z + 1.
Intuitively, we can show that conjugation preserves fixed points because if we
conjugate by h, we first move the Riemann sphere around by h, apply f (that
fixes the fixed points) then restore the Riemann sphere to its original orientation.
So we have simply moved the fixed point around by h.
10.3 Permutation properties of Möbius maps

We have seen that the Möbius map with three fixed points is the identity. As a
corollary, we obtain the following.
Proposition. Given f, g ∈ M . If ∃z1 , z2 , z3 ∈ C∞ such that f (zi ) = g(zi ), then

f = g. i.e. every Möbius map is uniquely determined by three points.
Proof. As Möbius maps are invertible, write f (zi ) = g(zi ) as g −1 f (zi ) = zi . So
g −1 f has three fixed points. So g −1 f must be the identity. So f = g.
Definition (Three-transitive action). An action of G on X is called three-

transitive if the induced action on {(x1 , x2 , x3 ) ∈ X 3 : xi pairwise disjoint},
given by g(x1 , x2 , x3 ) = (g(x1 ), g(x2 ), g(x3 )), is transitive.
This means that for any two triples x1 , x2 , x3 and y1 , y2 , y3 of distinct elements
of X, there exists g ∈ G such that g(xi ) = yi .
If this g is always unique, then the action is called sharply three transitive
This is a really weird definition. The reason we raise it here is that the
Möbius map satisfies this property.
Proposition. The Möbius group M acts sharply three-transitively on C∞ .
Proof. We want to show that we can send any three points to any other three
points. However, it is easier to show that we can send any three points to 0, 1, ∞.
Suppose we want to send z1 → ∞, z2 7→ 0, z3 7→ 1. Then the following works:
(z − z2 )(z3 − z1 )
f (z) =
(z − z1 )(z3 − z2 )
If any term zi is ∞, we simply remove the terms with zi , e.g. if z1 = ∞, we have

f (z) = zz−z 2
3 −z2
.
So given also w1 , w2 , w3 distinct in C∞ and g ∈ M sending w1 7→ ∞, w2 7→
0, w3 7→ 1, then we have g −1 f (zi ) = wi .
The uniqueness of the map follows from the fact that a Möbius map is
uniquely determined by 3 points.
53
3 points not only define a Möbius map uniquely. They also uniquely define
a line or circle. Note that on the Riemann sphere, we can think of a line as a
circle through infinity, and it would be technically correct to refer to both of
them as “circles”. However, we would rather be clearer and say “line/circle”.
We will see how Möbius maps relate to lines and circles. We will first recap
some knowledge about lines and circles in the complex plane.
Lemma. The general equation of a circle or straight line in C is
Az z̄ + B̄z + B z̄ + C = 0,
2
where A, C ∈ R and |B| > AC.
A = 0 gives a straight line. If A 6= 0, B = 0, we have a circle centered at the
origin. If C = 0, the circle passes through 0.
Proof. This comes from noting that |z − B| = r for r ∈ R > 0 is a circle;
|z − a| = |z − b| with a 6= b is a line. The detailed proof can be found in Vectors
and Matrices.
Proposition. Möbius maps send circles/straight lines to circles/straight lines.
Note that it can send circles to straight lines and vice versa.
Alternatively, Möbius maps send circles on the Riemann sphere to circles on
the Riemann sphere.
Proof. We can either calculate it directly using w = az+b dw−b
cz+d ⇔ z = −cw+a and
substituting z into the circle equation, which gives A ww̄ + B̄ w + B w̄ + C 0 = 0
0 0 0
with A0 , C 0 ∈ R.
Alternatively, we know that each Möbius map is a composition of translation,
dilation/rotation and inversion. We can check for each of the three types. Clearly
dilation/rotation and translation maps a circle/line to a circle/line. So we simply
do inversion: if w = z −1
Az z̄ + B̄z + B z̄ + C = 0
⇔ Cww̄ + Bw + B̄ w̄ + A = 0
Example. Consider f (z) = z−i z+i . Where does the real line go? The real line
is simply a circle through 0, 1, ∞. f maps this circle to the circle containing
f (∞) = 1, f (0) = −1 and f (1) = −i, which is the unit circle.
Where does the upper half plane go? We know that the Möbius map is
smooth. So the upper-half plane either maps to the inside of the circle or the
outside of the circle. We try the point i, which maps to 0. So the upper half
plane is mapped to the inside of the circle.
10.4 Cross-ratios
Finally, we’ll look at an important concept known as cross-ratios. Roughly
speaking, this is a quantity that is preserved by Möbius transforms.
Definition (Cross-ratios). Given four distinct points z1 , z2 , z3 , z4 ∈ C∞ , their
cross-ratio is [z1 , z2 , z3 , z4 ] = g(z4 ), with g being the unique Möbius map that
maps z1 7→ ∞, z2 7→ 0, z3 7→ 1. So [∞, 0, 1, λ] = λ for any λ 6= ∞, 0, 1. We have
z4 − z2 z3 − z1
[z1 , z2 , z3 , z4 ] = ·
z4 − z1 z3 − z2
54
(with special cases as above).

We know that this exists and is uniquely defined because M acts sharply
three-transitively on C∞ .
Note that different authors use different permutations of 1, 2, 3, 4, but they
all lead to the same result as long as you are consistent.
Lemma. For z1 , z2 , z3 , z4 ∈ C∞ all distinct, then
[z1 , z2 , z3 , z4 ] = [z2 , z1 , z4 , z3 ] = [z3 , z4 , z1 , z2 ] = [z4 , z3 , z2 , z1 ]
i.e. if we perform a double transposition on the entries, the cross-ratio is retained.

Proof. By inspection of the formula.
Proposition. If f ∈ M , then [z1 , z2 , z3 , z4 ] = [f (z1 ), f (z2 ), f (z3 ), f (z4 )].
Proof. Use our original definition of the cross ratio (instead of the formula). Let
g be the unique Möbius map such that [z1 , z2 , z3 , z4 ] = g(z4 ) = λ, i.e.
g
z1 7−
→∞
z2 7→ 0
z3 7→ 1
z4 7→ λ
We know that gf −1 sends
f −1 g
f (z1 ) 7−−→ z1 7−
→∞
f −1 g
f (z2 ) 7−−→ z2 7−
→0
f −1 g
f (z3 ) 7−−→ z3 7−
→1
f −1 g
f (z4 ) 7−−→ z4 7−
→λ
So [f (z1 ), f (z2 ), f (z3 ), f (z4 )] = gf −1 f (z4 ) = g(z4 ) = λ.

In fact, we can see from this proof that: given z1 , z2 , z3 , z4 all distinct and
w1 , w2 , w3 , w4 distinct in C∞ , then ∃f ∈ M with f (zi ) = wi iff [z1 , z2 , z3 , z4 ] =
[w1 , w2 , w3 , w4 ].
Corollary. z1 , z2 , z3 , z4 lie on some circle/straight line iff [z1 , z2 , z3 , z4 ] ∈ R.

Proof. Let C be the circle/line through z1 , z2 , z3 . Let g be the unique Möbius
map with g(z1 ) = ∞, g(z2 ) = 0, g(z3 ) = 1. Then g(z4 ) = [z1 , z2 , z3 , z4 ] by
definition.
Since we know that Möbius maps preserve circle/lines, z4 ∈ C ⇔ g(z4 ) is on
the line through ∞, 0, 1, i.e. g(z4 ) ∈ R.
55
11 Projective line (non-examinable) IA Groups
11 Projective line (non-examinable)

We have seen in matrix groups that GL2 (C) acts on C2 , the column vectors.
Instead, we can also have GL2 (C) acting on the set of 1-dimensional subspaces
(i.e. lines) of C2 .
For any v ∈ C2 , write the line generated by v as hvi. Then clearly hvi = {λv :
λ ∈ C}. Now for any A ∈ GL2 (C), define the action as Ahvi = hAvi. Check
that this is well-defined: for any hvi = hwi, we want to show that hAvi = hAwi.
This is true because hvi = hwi if and only if w = λv for some λ ∈ C \ {0}, and
then hAwi = hAλvi = hλ(Av)i = hAvi.
What is the kernel of this action? By definition the kernel has
to fix all lines.
In particular, it has to fix our magic lines generated by 10 , 01 and 11 . Since
we want Ah 10 i = h 10 i, so we must 1 λ

have
A 0 = 0 for some λ. Similarly,
λ 0
A 01 = µ0 . So we can write A = . However, also need Ah 11 i = h 11 i.

0 µ
Since A is a linear function, we know that A 11 = A 10 +A 01 = µλ . For the final

vector to be parallel to 11 , we must have λ = µ. So A = λI for some I. Clearly

any matrix of this form fixes any line. So the kernel Z = {λI : λ ∈ C \ {0}}.
Note that every line is uniquely determined by its slope. For any v =
(v1 , v2 ), w = (w1 , w2 ), we have hvi = hwi iff z1 /z2 = w1 /w2 . So we have a
one-to-one correspondence from our lines to C∞ , that maps h zz12 i ↔ z1 /z2 .
Finally, for each A ∈ GL2 (C), given any line h z1 i, we have

a b z az + b az + b
= ↔
c d 1 cz + d cz + d
So GL2 (C) acting on the lines is just “the same” as the Möbius groups acting
on points.
56

Part IA - Groups: Based On Lectures by J. Goedecke

Uploaded by

Copyright:

Available Formats

Part IA - Groups: Based On Lectures by J. Goedecke

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Part IA - Groups: Based On Lectures by J. Goedecke

Uploaded by

Copyright:

Available Formats

Part IA — Groups

Based on lectures by J. Goedecke

1 Groups and homomorphisms 6

9 More on regular polyhedra 48

11 Projective line (non-examinable) 56

1 Groups and homomorphisms

2. For all a ∈ G, there is some a−1 ∈ G such that

a ∗ a−1 = a−1 ∗ a = e. (inverse)

3. For all a, b, c ∈ G, we have

Definition (Abelian group). A group is abelian if it satisfies

(i) Given a−1 , both a and (a−1 )−1 satisfy

By uniqueness of inverses, (a−1 )−1 = a.

(ab)(b−1 a−1 ) = a(bb−1 )a−1

– (Z, +) ≤ (Q, +) ≤ (R, +) ≤ (C, +)

According to the definition, to prove that H is a subgroup of G, we need to

(II) (∀a, b ∈ H) ab−1 ∈ H

(iii) ea−1 = a−1 ∈ H.

Definition (Function). Given two sets X, Y , a function f : X → Y sends each

– Inclusion map: ι : Z → Q: ι(n) = n. Note that this differs from the

– For g : {0, 1, 2, 3, 4} → {0, 1, 2, 3, 4}, we have:

Definition (Injective functions). A function f is injective if it hits everything

Definition (Bijective functions). A function is bijective if it is both injective

(∀g1 , g2 ∈ G) f (g1 ) × f (g2 ) = f (g1 ∗ g2 ),

Definition (Group isomorphism). Isomorphisms are bijective homomorphisms.

– f : G → H defined by f (g) = e, where e is the identity of H, is a

(ii) Homomorphisms send inverses to inverses, i.e.

(iii) The composite of 2 group homomorphisms is a group homomorphism.

f (eG ) = f (e2G ) = f (eG )2

Since inverses are unique, f (a−1 ) = f (a)−1 .

So f −1 is a homomorphism. Since it is bijective, f −1 is an isomorphism.

Definition (Image of homomorphism). If f : G → H is a homomorphism, then

1.3 Cyclic groups

i.e. every element is some power of a. Such an a is called a generator of G.

(i) Z is cyclic with generator 1 or −1. It is the infinite cyclic group.

Lemma. For a in g, ord(a) = |hai|.

Definition (Exponent of group). The exponent of a group G is the smallest

1.4 Dihedral groups

D2n = hr, s | rn = s2 = e, srs−1 = r−1 i

This is a notation we will commonly use to represent groups. For example, a

1.5 Direct products of groups

C2 × C2 = {(0, 0), (0, 1), (1, 0), (1, 1)}

Proposition (Direct product theorem). Let H1 , H2 ≤ G. Suppose the following

(iii) (∀a ∈ G)(∃ai ∈ Hi ) a = a1 a2 . We also write this as G = H1 H2 .

f ((a1 , a2 ) ∗ (b1 , b2 )) = f (a1 b1 , a2 b2 )

2.1 Symmetric groups

Example. For small n, we have

Lemma. Disjoint cycles commute.

2.2 Sign of permutations

To define the sign, we first need to write permutations as products of trans-

Proposition. Every permutation is a product of transpositions.

(1 2 3 4 5) = (1 2)(2 3)(3 4)(4 5) = (1 2)(2 3)(1 2)(3 4)(1 2)(4 5).

The proof is rather magical.

Proposition. Any subgroup of Sn contains either no odd permutations or

eH = (1 2)H = {e, (1 2)}

(iii) Take G = D6 (which is isomorphic to S3 ). Recall D6 = hr, s | r3 e = s2 , rs =

Definition (Partition). Let X S be a set, and X1 , · · · Xn be subsets of X. The

A useful way to think about cosets is to view them as equivalence classes.

Definition (Equivalence relation). An equivalence relation ∼ is a relation that