
- •List of Symbols
- •Classical Algebra
- •Modern Algebra
- •Binary Operations
- •Algebraic Structures
- •Extending Number Systems
- •Algebra of Sets
- •Number of Elements in a Set
- •Boolean Algebras
- •Propositional Logic
- •Switching Circuits
- •Divisors
- •Posets and Lattices
- •Normal Forms and Simplification of Circuits
- •Transistor Gates
- •Representation Theorem
- •Exercises
- •Groups and Symmetries
- •Subgroups
- •Cyclic Groups and Dihedral Groups
- •Morphisms
- •Permutation Groups
- •Even and Odd Permutations
- •Equivalence Relations
- •Normal Subgroups and Quotient Groups
- •Morphism Theorem
- •Direct Products
- •Groups of Low Order
- •Action of a Group on a Set
- •Exercises
- •Translations and the Euclidean Group
- •Matrix Groups
- •Finite Groups in Two Dimensions
- •Proper Rotations of Regular Solids
- •Finite Rotation Groups in Three Dimensions
- •Necklace Problems
- •Coloring Polyhedra
- •Counting Switching Circuits
- •Exercises
- •Monoids and Semigroups
- •Finite-State Machines
- •Quotient Monoids and the Monoid of a Machine
- •Exercises
- •Rings
- •Integral Domains and Fields
- •Subrings and Morphisms of Rings
- •New Rings From Old
- •Field of Fractions
- •Convolution Fractions
- •Exercises
- •Euclidean Rings
- •Euclidean Algorithm
- •Unique Factorization
- •Factoring Real and Complex Polynomials
- •Factoring Rational and Integral Polynomials
- •Factoring Polynomials over Finite Fields
- •Linear Congruences and the Chinese Remainder Theorem
- •Exercises
- •Ideals and Quotient Rings
- •Computations in Quotient Rings
- •Morphism Theorem
- •Quotient Polynomial Rings that are Fields
- •Exercises
- •Field Extensions
- •Algebraic Numbers
- •Galois Fields
- •Primitive Elements
- •Exercises
- •Latin Squares
- •Orthogonal Latin Squares
- •Finite Geometries
- •Magic Squares
- •Exercises
- •Constructible Numbers
- •Duplicating a Cube
- •Trisecting an Angle
- •Squaring the Circle
- •Constructing Regular Polygons
- •Nonconstructible Number of Degree 4
- •Exercises
- •The Coding Problem
- •Simple Codes
- •Polynomial Representation
- •Matrix Representation
- •Error Correcting and Decoding
- •BCH Codes
- •Exercises
- •Induction
- •Divisors
- •Prime Factorization
- •Proofs in Mathematics
- •Modern Algebra in General
- •History of Modern Algebra
- •Connections to Computer Science and Combinatorics
- •Groups and Symmetry
- •Rings and Fields
- •Convolution Fractions
- •Latin Squares
- •Geometrical Constructions
- •Coding Theory
- •Chapter 2
- •Chapter 3
- •Chapter 4
- •Chapter 5
- •Chapter 6
- •Chapter 7
- •Chapter 8
- •Chapter 9
- •Chapter 10
- •Chapter 11
- •Chapter 12
- •Chapter 13
- •Chapter 14
- •Index
86 |
4 QUOTIENT GROUPS |
Case 3. Suppose that N contains the pair of disjoint transpositions (ab) Ž (cd). Then, if e is the element of {1, 2, 3, 4, 5} not appearing in these transpositions, we have
(abe)−1 Ž (ab) Ž (cd) Ž (abe) = (aeb) Ž (ab) Ž (cd) Ž (abe) = (ae) Ž (cd) N.
Also, (ab) Ž (cd) Ž (ae) Ž (cd) = (aeb) N , and again we are back to case 1.
We have shown that any normal subgroup of A5 containing more than one element must be A5 itself.
A group without any proper normal subgroups is called a simple group. The term simple must be understood in the technical sense that it cannot be broken down, because it cannot have any nontrivial quotient groups. This is analogous to a prime number, which has no nontrivial quotients. Apart from the cyclic groups of prime order, which have no proper subgroups of any kind, simple groups are comparatively rare.
The group A5 is of great interest to mathematicians because it is used in Galois theory to show that there is an equation of the fifth degree that cannot be solved by any algebraic formula.
It can be shown that every alternating group An, n 5, is simple. The cyclic groups Cp , p a prime, are another infinite series of simple groups (the abelian ones), and other series have been known for decades. But it was not until 1981 that the finite simple groups were completely classified. This was the culmination of more than 30 years of effort by hundreds of mathematicians, yielding thousands of pages of published work, and was one of the great achievements of twentieth-century mathematics. One spectacular landmark came in 1963, when J. G. Thompson and W. Feit verified a long-standing conjecture of W. Burnside (1852–1927) that every finite, non-abelian, simple group has even order (the proof is more than 250 pages long!). The main difficulty in the classification was the existence of sporadic finite simple groups, not belonging to any of the known families. The largest of these, known as the monster, has order approximately 2 × 1053. The complete classification encompasses several infinite families and exactly 26 sporadic groups.
MORPHISM THEOREM
The morphism theorem is a basic result of group theory that describes the relationship between morphisms, normal subgroups, and quotient groups. There is an analogous result for most algebraic systems, including rings and vector spaces.
If f : G → H is a group morphism, the kernel of f , denoted by Kerf , is defined to be the set of elements of G that are mapped by f to the identity of H . That is, Kerf = {g G|f (g) = eH }.
Proposition 4.23. Let f : G → H be a group morphism. Then:
(i)Kerf is a normal subgroup of G.
(ii)f is injective if and only if Kerf = {eG}.
MORPHISM THEOREM |
87 |
Proof. (i) We first show that Kerf is a subgroup of G. Let a, b Kerf so
that f (a) = f (b) = eH . Then |
|
|
|
|
|
|
|
|
|
|
|
|
||||||||
|
|
|
|
|
|
f (ab) = f (a)f (b) = eH eH = eH , |
so ab Kerf |
|
|
|
||||||||||
and |
|
|
|
|
f (a−1) = f (a)−1 = eH−1 = eH , so |
a−1 Kerf. |
|
|
|
|||||||||||
|
|
|
|
|
|
|
|
|
||||||||||||
Therefore, Kerf is a subgroup of G. |
|
|
|
|
|
|
|
|
|
|
|
|||||||||
If a Kerf and g G, then |
|
|
|
|
|
|
|
|
|
|
|
|
||||||||
f (g−1ag) = f (g−1)f (a)f (g) = f (g)−1eH f (g) = f (g)−1f (g) = eH . |
||||||||||||||||||||
Hence g−1ag Kerf , and Kerf is a normal subgroup of G. |
|
|
|
|
||||||||||||||||
(ii) If |
f |
is injective, only |
one |
element maps |
to the identity of H. Hence |
|||||||||||||||
Kerf |
=1 |
{ |
e |
G} |
. Conversely, if Kerf |
= { |
1} |
, suppose that |
|
|
= |
f (g2). Then |
||||||||
|
2 |
|
= |
f (g1)f (g2)−1 |
= |
|
|
2 |
|
|
= { |
|
} |
|
|
|
= |
|
||
f (g1g− ) |
|
|
|
eH so g1g− |
|
Kerf |
|
eG |
|
. Hence |
g1 |
|
g2, and |
|||||||
f is injective. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Proposition 4.24. For any group morphism f : G → H , the image of f , Imf = {f (g)|g G}, is a subgroup of H (although not necessarily normal).
Proof. Let f (g1), f (g2) Imf . |
1 Then eH = f (eG) Imf, f (g1)f (g2) = |
|||||||
|
|
Imf , and f (g1)−1 |
= |
1 |
|
|
Imf . Hence Imf |
is a subgroup of H . |
f (g1g2) |
|
|
f (g− ) |
|
Theorem 4.25. Morphism Theorem for Groups. Let K be the kernel of the group morphism f : G → H . Then G/K is isomorphic to the image of f , and the isomorphism ψ: G/K → Imf is defined by ψ(Kg) = f (g).
This result is also known as the first isomorphism theorem; the second and third isomorphism theorems are given in Exercises 4.43 and 4.44.
Proof. The function ψ is defined on a coset by using one particular element in the coset, so we have to check that ψ is well defined; that is, it does not matter which element we use. If Kg = Kg , then g ≡ g mod K so g g−1 = k K = Kerf . Hence g = kg and so
f (g ) = f (kg) = f (k)f (g) = eH f (g) = f (g).
Thus ψ is well defined on cosets.
The function ψ is a morphism because
ψ(Kg1Kg2) = ψ(Kg1g2) = f (g1g2) = f (g1)f (g2) = ψ(Kg1)ψ(Kg2).
If ψ(Kg) = eH , then f (g) = eH and g K. Hence the only element in the kernel of ψ is the identity coset K, and ψ is injective. Finally, Im ψ = Imf ,
88 4 QUOTIENT GROUPS
by the definition of ψ. Therefore, ψ is the required isomorphism between G/K and Imf .
Conversely, note that if K is any normal subgroup of G, the map g → Kg is a morphism from G to G/K, whose kernel is precisely K.
By taking f to be the identity morphism from G to itself, the morphism
theorem implies that G/{e} G.
=
The function f : Z → Zn, defined by f (x) = [x], has nZ as its kernel, and
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
= |
|
|
|
|
therefore the morphism theorem yields the fact that Z/nZ Zn. |
= |
|||||||||||||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
12 |
= r |
|
|
|
2r |
|||
If a and b are generators of the cyclic groups C |
|
|
a |
and |
C6 |
b , respec- |
||||||||||||||||||
|
|
|
|
|
function f : C |
C |
|
|
|
|
|
f (a ) |
= |
b |
|
|
||||||||
tively, consider the |
r |
|
a |
r1 |
|
|
|
12 → |
6 given by |
|
|
|
|
. This is well |
||||||||||
In fact, if a |
|
= |
|
, then 12 divides r |
− |
r |
|
by Proposition 3.11, so cer- |
||||||||||||||||
defined.2r |
b |
2r1 |
|
|
|
|
|
|
verified |
that f |
|
1 |
|
|
|
|
|
|
the kernel is |
|||||
tainly b |
|
.9 |
It |
|
is |
easily |
is |
|
morphism, and |
|||||||||||||||
K = {e, a |
3= 6 |
|
|
|
r |
|
|
|
2r |
= 0, so 6 divides 2r, whence |
||||||||||||||
, a |
, a |
} because if |
a |
|
is in K, then b |
|
|
|||||||||||||||||
3 divides r. Thus C12/K |
C6, and this isomorphism is obtained by mapping |
|||||||||||||||||||||||
the coset Kar |
to b2r . |
|
|
= |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The alternating group An is of index 2 in the symmetric group Sn (by Theorem 3.36) and so is a normal subgroup by Proposition 4.20. It is instructive to obtain this same conclusion from the morphism theorem. If σ is a permutation in Sn, recall that σ is called even or odd according as σ D = D or σ D = −D, where D is the discriminant in n variables (see the discussion leading to Theorem 3.33). Consider the multiplicative group {1, −1}, and define a
function f : Sn → {1, −1} by f (σ ) = |
|
1 |
if σ D |
= |
D |
. Then f is a surjec- |
|
− |
1 |
if σ D |
|
D |
|||
|
|
|
= − |
|
|
tive morphism (verify) and the kernel is the group An of even permutations. Since |Sn| = n!, the morphism theorem and Corollary 4.8 give the following result (and reprove Theorem 3.36).
|
= |
|
| |
|
| = |
21 n!. |
Proposition 4.26. |
An is a normal subgroup of Sn, Sn/An C2 |
, and |
|
An |
|
Example 4.27. Show that the quotient group R/Z, of real numbers modulo 1 is isomorphic to the circle group W = {eiθ C|θ R}.
Solution. The set W consists of points on the circle of complex numbers of unit modulus, and forms a group under multiplication. Define the function f : R → W by f (x) = e2πix . This is a morphism from (R, +) to (W, ·) because
f (x + y) = e2πi(x+y) = e2πix · e2πiy = f (x) · f (y).
This function can be visualized in Figure 4.1 as wrapping the real line around and around the circle.
The morphism f is clearly surjective, and its kernel is {x R|e2πix = 1} = Z.
Therefore, the morphism theorem implies that R/Z = W . The quotient space R/Z is the set of equivalence classes of R under the relation defined by x ≡ y mod Z if and only if the real numbers x and y differ by an integer. This quotient space is called the group of real numbers modulo 1.

MORPHISM THEOREM |
|
|
|
|
|
89 |
|
|
|
|
|
|
i |
|
|
|
|
|
−1 |
W |
−2 −1 |
0 |
1 |
2 |
3 |
f |
1 |
|
|
|
|
|
|
|
|
|
|
|
|
−i |
|
|
Figure 4.1. |
Morphism f : R → W . |
|
Proposition 4.28. If G and H are finite groups whose orders are relatively prime, there is only one morphism from G to H , the trivial one.
Proof. Let K be the kernel of a morphism f from G to H . Then G/K = Imf , a subgroup of H . Now |G/K| = |G|/|K|, which is a divisor of |G|. But by Lagrange’s theorem, |Imf | is a divisor of |H |. Since |G| and |H | are relatively prime, we must have |G/K| = |Imf | = 1. Therefore K = G, so f : G → H is the trivial morphism defined by f (g) = eH for all g G.
Example 4.29. Find all the subgroups and quotient groups of D4, the symmetry group of a square, and draw the poset diagram of its subgroups.
Solution. Any symmetry of the square induces a permutation of its vertices. Thus, as in Example 3.30, this defines a group morphism f : D4 → S4. However, unlike the case of the symmetries of an equilateral triangle, this is not an isomorphism because |D4| = 8, whereas |S4| = 24. The kernel of f consists of symmetries fixing the vertices and so consists of the identity only. Therefore, by the morphism theorem, D4 is isomorphic to the image of f in S4. We equate an element of D4 with its image in S4. All the elements of D4 are shown in Figure 4.2. The corner by the vertex 1 is blocked in, and the reverse side of the square is shaded to illustrate the effect of the symmetries. The order of each symmetry is given in Table 4.3.
1 |
|
2 |
1 |
|
2 |
1 |
|
2 |
1 |
|
|
2 |
4 |
|
3 |
4 |
|
3 |
4 |
|
3 |
4 |
|
|
3 |
|
(1) = e |
|
|
(1234) = g |
|
(13)°(24) = g2 |
|
(1432) = g3 |
1 |
4 |
(24) = h |
2 |
1 |
2 |
1 |
2 |
1 |
2 |
3 |
4 |
3 |
4 |
3 |
4 |
3 |
|
(12) ° (34) = gh |
|
(13) = g2h |
(14) ° (23) = g3h |
Figure 4.2. Symmetries of the square.

90 4 QUOTIENT GROUPS
|
TABLE 4.3. Orders of the Symmetries of a Square |
|
|
|
|
|
|
||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||
|
Elements of D4 |
e |
g |
g2 |
g3 |
h |
gh |
|
g2h |
g3h |
|
|
|
|
|
||
|
Order of Element |
1 |
4 |
2 |
4 |
2 |
2 |
|
|
2 |
2 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
D4 |
|
|
|
|
|
|
|
|
|
|
|
|
|
K1 = e, g2,h, g2h |
|
|
C4 |
|
|
e, g2, gh, g3h = K2 |
|
|
|
||||||||
|
e, h e, g2h |
|
|
e, g2 |
= L |
|
e, gh |
|
|
e, g3h |
|
|
|
|
|
||
|
|
|
|
e |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Figure 4.3. Poset diagram of subgroups of D4. |
|
|
|
|
|
|
||||||||||
The cyclic subgroups generated by the elements are |
{ |
e |
} |
, C |
4 = { |
e, g, g2 |
, g3 |
} |
, |
||||||||
{e, g2}, {e, h}, {e, gh}, {e, g2h}, and {e, g3h}. |
|
|
|
|
|
|
|
|
By Lagrange’s theorem, any proper subgroup must have order 2 or 4. Since any group of order 2 is cyclic, the only proper subgroups that are not cyclic are of order 4 and contain elements of order 1 and 2. There are two such subgroups, K1 = {e, g2, h, g2h} and K2 = {e, g2, gh, g3h}. All the subgroups are illustrated in Figure 4.3.
To find all the quotient groups, we must determine which subgroups are normal.
The trivial group {e} and the whole group D4 are normal subgroups. Since C4, K1, and K2 have index 2 in D4, they are normal by Proposition 4.20, and their quotient groups are cyclic of order 2.
Subgroup H |
|
Left Coset gH |
|
Right Coset Hg |
|
|
||||||||||||||
{ |
e, h |
}2 |
|
{ |
|
3 |
|
} |
|
|
{g, |
2 } = { |
g, g3h |
} |
||||||
|
|
|
|
|
g, gh |
|
|
|
|
|
hg |
|
|
|||||||
{e, g h} |
|
{g, g2h} |
|
{g, g hg} = {g, gh} |
||||||||||||||||
{e, |
|
3 |
} |
|
{g, |
g |
h |
} |
{ |
|
3 |
} = { |
g, h |
}2 |
||||||
|
|
gh |
|
|
|
|
|
|
g, ghg |
|
|
|
|
|||||||
{e, g h} |
|
{g, h} |
|
|
|
|
{g, g hg} = {g, g h} |
For each of the subgroups above, the left and right cosets containing g are different; therefore, none of the subgroups are normal.
Left Cosets of L |
|
|
|
|
Right Cosets of L |
||
2 |
|
|
|
|
2 |
|
|
L = {e, g 3} |
|
|
|
|
L = {e, g |
3} |
|
gL = {g, g }2 |
2 |
|
|
|
Lg = {g, g |
2} |
|
hL = {h, hg } =2 |
{h, g h} |
|
|
|
Lh = {h, g |
h |
} |
3 |
h} |
3 |
|||||
ghL = {gh, ghg } = {gh, g |
Lgh = {gh, g h} |
The table above shows that L = {e, g2} is a normal subgroup. The multiplication table for D4/L given in Table 4.4 shows that it is isomorphic to the Klein 4-group.