Cosets, Normal Subgroups and Quotient Groups

The tenth and last unit of a rings-first abstract algebra course. The cosets of a subgroup split a group into pieces of equal size, which proves Lagrange's theorem that the order of a subgroup divides the order of a finite group, with Euler's and Fermat's theorems and the orbit-stabilizer relation as corollaries. Cosets can be multiplied exactly when the subgroup is normal, closed under conjugation, and then they form the quotient group G/N; the first isomorphism theorem identifies the quotient by a kernel with the image, and splits the order of the Rubik's cube group into cubie arrangements and orientations. The unit closes the course by comparing quotient rings and quotient groups.

In the stop sign's group $D_8$, the eight rotations and the eight reflections split the sixteen symmetries into two equal halves. In $\mathbb{Z}_{36}$, the multiples of 4 and their translates split the 36 elements into four sets of nine. Does every subgroup cut its group into equal pieces? And can the pieces be multiplied, as the congruence classes of the integers were?

A subgroup $H$ of a group $G$ can be moved around inside $G$: multiplying all its elements by a fixed $g$ gives the coset $gH$. The cosets of $H$ do not overlap and all have the size of $H$. Counting them gives Lagrange's theorem: the order of a subgroup divides the order of the group. Its consequences reach back through the course. The order of an element divides the order of the group, and groups of prime order are cyclic. Euler's theorem $a^{\varphi(n)} \equiv 1 \pmod n$, on which the RSA cryptosystem rests, becomes a fact about the group $U(n)$.

The rule $(aH)(bH) = abH$ for multiplying cosets is well defined exactly when $H$ is normal: closed under conjugation, or equivalently, with equal left and right cosets. Then the cosets form the quotient group $G/N$. Normal subgroups are exactly the kernels of homomorphisms. The first isomorphism theorem identifies the quotient by a kernel with the image of the homomorphism. It gives the integers modulo $n$ as $\mathbb{Z}/n\mathbb{Z}$ and the angles as $\mathbb{R}/\mathbb{Z}$. For the Rubik's cube, it factors the order of the cube group into the arrangements of the cubies and the twists and flips that leave them in place.

The unit takes these steps in order. First come cosets and Lagrange's theorem, with its consequences. Then come normal subgroups and the quotient groups they allow. Finally the first isomorphism theorem recognizes quotients as images, and a closing section below looks back over the course's quotients of rings and of groups.

This is the tenth and last unit of the course. It covers Chapter 8 of the course text (Hungerford, 2014), §§8.1 to 8.4, with Judson (2026, Chapters 6, 10 and 11) as a free companion. The class sessions:

  • listed the cosets of a rotation subgroup of a dihedral group and counted them with Lagrange's theorem;
  • showed with a reflection subgroup that multiplying cosets by representatives can fail;
  • defined normal subgroups by conjugation;
  • pictured a quotient of the plane by a line as a family of parallel lines, then proved that kernels are normal and stated the first isomorphism theorem.

The articles use the running examples of Groups: $\mathbb{Z}_{36}$, the dihedral group $D_8$, the permutation $\sigma = (1\;5\;2\;8)(3\;6\;7)$ in $S_8$, $U(n)$ and the Rubik's cube group.

Articles

  • Cosets and Lagrange's Theorem: why do the cosets of a subgroup cut a group into equal pieces? Left and right cosets, in $D_8$, where they can differ, and in $\mathbb{Z}_{36}$. Congruence modulo a subgroup, the test $a^{-1}b \in H$ for equal cosets, and the index. Lagrange's theorem, checked on every subgroup of four groups. On the cube, it counts the 2,217,093,120 cosets of the proof that God's number is 20. The corollaries: orders of elements, groups of prime order, and Euler's and Fermat's theorems in $U(45)$ and $U(23)$. Then $A_4$, where the converse fails, and the orbit-stabilizer relation behind the Schreier-Sims count of the cube group.
  • Normal Subgroups and Quotient Groups: which subgroups have cosets that can be multiplied? The product fails for $\langle r^4, s \rangle$ in $D_8$. Three equivalent definitions of normality, with abelian groups, kernels and subgroups of index 2 as examples, and non-normal subgroups in $D_8$, $S_8$ and the cube group. The coset product is well defined exactly for normal subgroups, as a figure of $D_8$'s sorted Cayley table shows. The quotient group and the natural homomorphism make normal subgroups exactly the kernels. Examples: $\mathbb{Z}/n\mathbb{Z}$, $S_n/A_n$, the rotations and reflections, and the parity of the cube. No position of the cube is reached by both an even and an odd number of quarter turns. Normal subgroups beside ideals, and simple groups.
  • The First Isomorphism Theorem for Groups: how can a quotient be recognized without listing its cosets? The theorem, the counting rule $\lvert G \rvert = \lvert \ker f \rvert \cdot \lvert f(G) \rvert$, and a recipe. Worked cases: $\mathbb{Z}_{36}/\langle 9 \rangle \cong \mathbb{Z}_9$, with a figure of the cosets as fibers; $S_n/A_n$ and $D_8/\langle r \rangle$; cyclic groups as quotients of $\mathbb{Z}$; the circle group $\mathbb{R}/\mathbb{Z}$; Cayley's theorem. The cube group maps onto the arrangements of its cubies, an image of order $8! \cdot 12!/2$, with a kernel of order $3^7 \cdot 2^{11}$. Images as quotients, and the ring theorem from the group theorem. The article closes the course by tracing its quotients back to the integers.

Looking back: rings and groups

The course began with the integers and their congruence classes. It built three kinds of quotient along the way: $\mathbb{Z}_n$ from the integers, $F[x]/(p(x))$ from polynomials, and $R/I$ from any ring and ideal (Ideals and Quotient Rings). This unit builds the fourth, $G/N$, and with it the two halves of the course, Rings and Groups, meet. The constructions are one construction, applied with two operations or with one:

Rings Groups
structure two operations, addition abelian one operation, often not commutative
substructure subring subgroup
what one can work modulo ideal: absorbs products normal subgroup: absorbs conjugation
classes cosets $a + I$ cosets $aN$
maps ring homomorphisms group homomorphisms
kernels are ideals normal subgroups
image of $f$ $\cong R/\ker f$ (first isomorphism theorem) $\cong G/\ker f$ (first isomorphism theorem)
first example $\mathbb{Z}/(n) = \mathbb{Z}_n$ $\mathbb{Z}/n\mathbb{Z} = \mathbb{Z}_n$

Where the two settings differ is in what the quotient can tell. For rings, the kind of ideal decides the kind of quotient. Prime ideals give integral domains and maximal ideals give fields, which is how the course built fields with 9 and 25 elements. For groups, the size of a subgroup already constrains the group, by Lagrange's theorem. That counting argument has no counterpart for ideals in the course. And because a group operation need not be commutative, the side on which cosets are taken matters. Normality is a genuine condition, where for the additive group of a ring it was automatic.

Both theories rest on the same three steps from the first units:

  • an equivalence relation;
  • its classes;
  • an operation on the classes that does not depend on the representatives.

The unit uses Groups throughout: the subgroups of $\mathbb{Z}_{36}$ and $D_8$, homomorphisms and their kernels, conjugation, and the Rubik's cube group. Lagrange's theorem gives the group-theoretic proof of the theorems of Euler and Fermat from Public-Key Cryptography. The quotient constructions repeat those of Congruence and Modular Arithmetic and Ideals and Quotient Rings.

References

  • Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), Chapter 8, §§8.1 to 8.4, with the simplicity of the alternating groups in §8.5. Brooks/Cole, Cengage Learning. The course text. record · 44 pages
  • Judson, T. W. (2026). Abstract Algebra: Theory and Applications (annual edition, August 2026), Chapters 6, 10 and 11, with §14.1. Free online at judsonbooks.org. record · 44 pages