Factor groups (quotient groups) are the central construction of this chapter: given a normal subgroup , the set of cosets becomes a group. This is where cosets, normality, homomorphisms, and isomorphisms fuse into a single coherent picture. If Chapter 10 introduced cosets as partitions, Chapter 14 turns those partitions into groups.
Prerequisites. Cosets and Lagrange’s theorem (Ch. 10), direct products (Ch. 11), homomorphisms and kernels (Ch. 13).
§14.1 Normal Subgroups
The definition of normality is the gate through which every quotient group must pass.
Definition 14.1 (Normal subgroup). A subgroup of a group is normal in , written , if
where .
Theorem 14.2 (Equivalent conditions for normality). Let . The following are equivalent:
- for all .
- for all .
- for all .
- is the kernel of some homomorphism from .
Proof of Theorem 14.2
(1) (2). Immediate: equality implies inclusion.
(2) (1). Assume for all . Replacing by gives
Conjugating both sides by :
Combined with the hypothesis , we get .
(1) (3). Suppose . For any , we have for some , so . Thus . Replacing by and conjugating gives . Hence .
(3) (1). If , then every element can be written as for some . Then , so . The same argument with gives , hence . Therefore .
(4) (2). If for some homomorphism , then for and :
So , giving .
(1) (4). This requires the quotient group construction (Theorem 14.4 below). Once is built, the canonical projection satisfies . So every normal subgroup is the kernel of some homomorphism.
Remark. Condition (2) is the one most often checked in practice: to show , take arbitrary and and verify . Condition (3) says left cosets equal right cosets, which is equivalent to saying the coset partition is compatible with the group operation.
Corollary 14.3. Every subgroup of an abelian group is normal. Every subgroup of index is normal.
Proof of Corollary 14.3
If is abelian, then for all , .
If , there are exactly two left cosets: and . The same holds for right cosets. Since and there is only one other coset on each side, we must have for all .
§14.2 Every Kernel Is Normal; Every Normal Subgroup Is a Kernel
This is the complete characterization that ties homomorphisms to normality.
Theorem 14.4 (Kernel—normal correspondence). Let be a group.
- If is a homomorphism, then .
- If , then where is the canonical projection (defined in §14.3 below).
In short: a subgroup is normal if and only if it is the kernel of some homomorphism.
Proof of Theorem 14.4
(1) was proved during the equivalence (4) (2) in Theorem 14.2: for and ,
so .
(2) requires the quotient group to exist. By Theorem 14.5 below, is a group and is a surjective homomorphism. Then
So .
This theorem is fundamental: it says that the concepts “normal subgroup” and “kernel of a homomorphism” are the same concept viewed from two directions.
§14.3 The Quotient Group
Definition 14.5 (Quotient group / Factor group). Let . The quotient group (or factor group) is the set
of all left cosets of in , equipped with the operation
The critical question: is this operation well-defined? The product is defined by choosing representatives and , so we must verify it does not depend on which representatives are chosen.
Theorem 14.6 (Well-definedness and group structure of ). Let . Then:
- The operation on is well-defined.
- is a group under this operation, with identity and inverses .
Proof of Theorem 14.6
(1) Well-definedness. Suppose and . We must show , i.e., .
From we get for some . From we get for some . Then:
Since is normal, and (call it ). So:
Since , we have , giving .
(2) Group axioms.
Closure: since .
Associativity:
Identity: satisfies and .
Inverses: , and likewise .
Figure: why quotient multiplication is well-defined when representatives change.
The two rows start from the same input cosets but choose different representatives. The proof shows that both products still land in the same output coset. That is exactly what “the multiplication descends to cosets” means.
Theorem 14.7 (Normality is necessary). If and the operation on the set of left cosets is well-defined, then .
Proof of Theorem 14.7
Suppose the coset multiplication is well-defined. Let and . We need .
Consider the cosets and . Since , we have (because and are in the same left coset of ). By well-definedness:
The left side equals and the right side equals . So , which means .
Combining Theorems 14.6 and 14.7: the coset multiplication is well-defined if and only if .
§14.4 The Canonical Projection
Definition 14.8 (Canonical projection). Let . The canonical projection (or natural homomorphism) is
Theorem 14.9. The canonical projection is a surjective homomorphism with .
Proof of Theorem 14.9
Homomorphism:
Surjective: Every element of has the form for some .
Kernel:
Hence .
This completes the circle: every normal subgroup is the kernel of its own canonical projection, and every kernel is a normal subgroup.
The quotient is universal among maps that kill
This is the Lang formulation that turns quotient groups from constructions into universal objects.
Theorem 14.9a (Universal property of the quotient). Let , and let
be the canonical projection. If is a homomorphism such that
then there exists a unique homomorphism
such that
Equivalently: a homomorphism out of factors through exactly when it sends every element of to the identity.
Figure: the universal property of the quotient.
The triangle says that every homomorphism killing must factor uniquely through .
Proof of Theorem 14.9a
Existence. Define
We must first show this is well-defined. Suppose . Then
Since , we have , so
and hence . Therefore does not depend on the representative.
Now check the homomorphism law:
So is a homomorphism.
Finally,
so the triangle commutes.
Uniqueness. If is another homomorphism with , then for every coset ,
Since every element of is some , we get .
This theorem is the cleanest way to say what the quotient does: it is the most general group obtained from by forcing every element of to become trivial.
There are two especially important special cases:
- If , then is an isomorphism. That is exactly the First Isomorphism Theorem.
- If is surjective and , then This is the practical version used throughout Chapters 14 and 15 to identify factor groups.
§14.5 Concrete Quotient Group Computations
Example 14.10:
The remainder map defined by (the residue class of modulo ) is a surjective homomorphism with .
For , the cosets of in are:
These are exactly the four residue classes mod . By the Fundamental Homomorphism Theorem,
More generally, for every positive integer . This is the prototypical quotient group.
Example 14.11: with Cayley table
Let . Since is abelian, . The quotient has elements:
Cayley table for :
Verification of one entry using different representatives: For , choose representatives and (both lie in ):
The table is cyclic of order with generator , so:
Example 14.12:
is the alternating group on elements, with . Since , the subgroup is normal in (every subgroup of index is normal, by Corollary 14.3).
The two cosets are:
Cayley table for :
Check: . Using a different representative: .
This is the unique group of order :
Alternatively: the sign homomorphism has and image , so the FHT gives immediately.
Example 14.13:
Let . The projection onto the first factor,
is a surjective homomorphism with .
By the Fundamental Homomorphism Theorem:
Explicitly, the four cosets are:
Each coset collapses the second coordinate, leaving the first coordinate as the group element in .
Example 14.14: --- the circle group
The additive group is abelian, so . Two real numbers lie in the same coset of if and only if , i.e., they have the same fractional part. Each coset contains a unique representative in .
The map
where is the unit circle, is a surjective homomorphism of onto with
By the Fundamental Homomorphism Theorem:
This is the circle group: addition of real numbers modulo corresponds to multiplication of complex numbers on the unit circle. It shows quotient groups can be continuous, not just finite.
§14.6 Why Well-Definedness Matters: A Non-Normal Subgroup
Consider . This subgroup is not normal in (since ). Let us see the coset multiplication fail.
The left cosets of are:
Attempt to compute :
- Using representatives and : .
- Using representatives and : .
Figure: failure of quotient multiplication when the subgroup is not normal.
So but . Different representatives from the same cosets give products in different cosets. The “multiplication” depends on which representatives we pick, so it is not a function on cosets. The operation is not well-defined.
This is exactly what normality prevents: when , the relation ensures that the product of cosets is independent of the choice of representatives.
Productive Struggle — how quotient intuition usually goes wrong
Common wrong guess 1
Once the set of cosets has been written down, the quotient operation is automatically .
Where it breaks. The operation only makes sense if different representatives from the same cosets always give the same answer. The non-normal subgroup example in shows this can fail outright.
Repaired method. Treat well-definedness as a theorem, not as a notation convention. Either:
- prove normality and then use coset multiplication, or
- build the quotient through a surjective homomorphism and use the kernel theorem.
Common wrong guess 2
Once is known, the quotient structure is basically determined.
Where it breaks. Order gives only a shortlist. A quotient of order might be or . A quotient of order could be cyclic or not. Counting tells you size, not multiplication structure.
Repaired method. After computing the order, do one of the following:
- produce a surjective homomorphism with kernel and identify the image;
- compute the order of one or two quotient elements;
- build a quotient Cayley table when the quotient is small enough.
Chapter 14 becomes much easier once this is internalized: the hard part is rarely the count of cosets; it is the proof that the operation is well defined and the identification of the resulting group.
§14.7 The Fundamental Homomorphism Theorem (Quotient Form)
This is the theorem that organizes the entire chapter.
Theorem 14.15 (Fundamental Homomorphism Theorem / First Isomorphism Theorem). Let be a group homomorphism with kernel . Then:
- .
- is a subgroup of .
- The map defined by is an isomorphism.
- If is the canonical projection, then .
In diagram form:
Proof of Theorem 14.15
(1) was proved in Theorem 14.4.
(2) If , then .
(3) We verify the four properties of :
Well-defined: If , then , so , hence , i.e., .
Homomorphism:
Injective: If , then , so , hence . The kernel of is trivial, so is injective.
Surjective onto : For any , we have .
(4) For any : .
Corollary 14.16. If is a surjective homomorphism with kernel , then
This corollary is extremely powerful: to identify a quotient , find a surjective homomorphism from whose kernel is ; the image is your answer.
Example 14.16a: build a quotient from an actual surjective homomorphism
Define
This is a homomorphism because
It is surjective because
and generates .
Now compute the kernel:
Rewrite this as
for some integer . Setting , we get
So
Therefore the quotient is
This is exactly the mindset Chapter 15 will keep using: identify the quotient by finding the right surjective map first, and only then interpret the kernel as the subgroup being collapsed.
§14.8 Simple Groups
Definition 14.17 (Simple group). A group is simple if its only normal subgroups are and itself.
Equivalently, is simple if every homomorphism from is either injective or trivial (since the kernel must be or ).
Theorem 14.18. is simple for every prime .
Proof of Theorem 14.18
By Lagrange’s theorem, the only subgroups of are and (since is prime, the only divisors of are and ). Since is abelian, every subgroup is normal. Therefore the only normal subgroups are and , and is simple.
Example 14.19. is not simple, since is a nontrivial proper normal subgroup.
Example 14.20. is simple (prime order). is not simple (). But:
Theorem 14.21 (Preview). is simple for .
This is a deep result proved later in the text (Section 15). The simplicity of is the reason the quintic has no radical solution (Galois theory). Simple groups are the “atoms” of group theory: every finite group can be built from simple groups via extensions.
§14.9 Automorphisms and Inner Automorphisms
Definition 14.22 (Automorphism). An automorphism of a group is an isomorphism . The set of all automorphisms of is denoted .
Theorem 14.23. is a group under composition.
Proof of Theorem 14.23
- Closure: If , then is a bijection from to , and .
- Associativity: Composition of functions is always associative.
- Identity: The identity map is an automorphism.
- Inverses: If , then exists (since is a bijection) and is a homomorphism: .
Definition 14.24 (Inner automorphism). For each , the inner automorphism determined by is
The set of all inner automorphisms is .
Theorem 14.25. Each is indeed an automorphism.
Proof of Theorem 14.25
Homomorphism: .
Bijection: has inverse , since .
Theorem 14.26. .
Proof of Theorem 14.26
First, :
- because .
- .
- .
Now for normality: let and . We need . For any :
So .
Theorem 14.27. , where is the center of .
Proof of Theorem 14.27
Define by . Then:
Homomorphism: (shown in the proof of Theorem 14.26).
Surjective: By definition, every element of is for some .
Kernel:
By the Fundamental Homomorphism Theorem, .
Remark. A subgroup is normal if and only if for all , i.e., is invariant under all inner automorphisms. This is the “conjugation” viewpoint on normality. Note that is set-wise invariance; the inner automorphism may permute the elements of nontrivially.
§14.10 Lang’s Perspective: The Yoga of Kernels and Images
Stepping back from the details, the theorems of this chapter establish a tight correspondence:
Normal subgroups of Quotient groups of .
Specifically:
- Every normal subgroup determines a quotient group and a surjective homomorphism with .
- Every surjective homomorphism determines a normal subgroup , and .
The Fundamental Homomorphism Theorem gives a bijection:
This is what Lang calls the yoga of kernels and images: in any algebraic structure with a notion of homomorphism (groups, rings, modules, …), the “things you can collapse” (kernels/ideals/submodules) are in bijection with the “things you can map onto” (quotient objects). The First Isomorphism Theorem is the precise statement of this bijection.
This perspective pervades all of algebra:
| Structure | ”Kernel” object | Quotient | Isomorphism theorem |
|---|---|---|---|
| Group | Normal subgroup | ||
| Ring | Ideal | ||
| Vector space | Subspace | ||
| Module | Submodule |
Understanding this pattern at the group level is preparation for seeing it everywhere.
In the language of universal constructions, Theorem 14.9a says that is the universal receiver of homomorphisms out of that kill . This is the quotient analogue of the product universal property from Chapter 13. Products solve a universal mapping problem for maps into them; quotients solve a universal mapping problem for maps out of them.
Bridge to Chapter 15 — quotient maps become exact sequences
Chapter 14 should now be read as the last fully concrete stage before the language of exact sequences.
Every normal subgroup gives the canonical projection
Chapter 15 will rewrite that one map as the short exact sequence
Likewise, every surjective homomorphism
with kernel will be rewritten as
So the bridge is straightforward but important:
- this chapter teaches you to compute the quotient group and prove the homomorphism theorem;
- Chapter 15 compresses the same data into exact-sequence language and begins asking how such quotients assemble larger groups.
If Chapter 15 ever starts to feel too compressed, return mentally to Chapter 14 and expand every short exact sequence back into:
- a normal subgroup,
- a canonical or surjective homomorphism,
- a quotient group,
- a kernel computation,
- an identification of the image.
That expansion is exactly what the new notation is abbreviating.
Mastery Checklist
- State the definition of normal subgroup and three equivalent conditions
- Prove that normality conditions (1)—(4) are equivalent
- Prove well-definedness of coset multiplication requires normality
- Prove is a group (closure, associativity, identity, inverses)
- State and prove properties of the canonical projection
- State and prove the universal property of : maps out of that kill factor uniquely through the quotient
- Compute , , with Cayley tables
- Show explicitly what fails for (non-normal subgroup)
- State the FHT and use it to classify a quotient by finding a surjective homomorphism
- Define simple group; prove is simple; know is simple for
- Prove is a group and
- Prove
- Explain the kernel—image correspondence (Lang’s perspective)