contents
§20

Normal subgroups & quotient groups

Lagrange tells us how a subgroup slices G; but cosets generally don't form a group. Only when the subgroup is normal does the set of cosets inherit a group structure — giving the quotient group . This is among the deepest ideas in abstract algebra.

Definition 20.1 — normal subgroup
A subgroup N ⊂ G is normal (written ) if it is invariant under conjugation:Equivalently, left cosets and right cosets coincide: .
Theorem 20.2 — quotient group
If , the coset set forms a group underIts order is .

20.1 Where do normal subgroups come from? Kernels of homomorphisms

Every group homomorphism has a kernelwhich is automatically normal in G. Conversely (First Isomorphism Theorem), every normal subgroup is the kernel of some homomorphism; moreover

This ties §17's homomorphisms, §5's invariants, and §20's normal subgroups together: the three conservation laws are three homomorphisms G → small Abelian groups. Their kernels are three special normal subgroups of G:

20.2 Interactive: pick N, see G/N

States with Σco ≡ 0 form a normal subgroup; the quotient is ℤ/3.
[g0]
~1.442 × 1019 elts
[g1]
~1.442 × 1019 elts
[g2]
~1.442 × 1019 elts

20.3 Commutator subgroup [G,G] and abelianization

The commutator subgroup is generated by all commutators . It is always normal in G. The quotient is called the abelianization — the "largest Abelian quotient" of G.

For the cube, it is known that . The only Abelian shadow of G is the sgn homomorphism — half of G dies in [G,G]; only one bit (sign) survives. G is extremely non-Abelian.

20.4 Composition series & simple groups

Iteratively factoring G by normal subgroups gives a composition serieswhere each quotient is simple (no proper non-trivial normal subgroup). Jordan–Hölder guarantees that, up to reordering, this sequence is unique.

For the cube group, the simple factors are— essentially a restatement of the structure theorem from §6. A₈ and A₁₂ are members of an infinite family of non-Abelian finite simple groups.

20.5 Second & third isomorphism theorems

Theorem 20.4 — Second isomorphism (diamond)
Let , . Then is a subgroup of G, , andDrawn as a diamond lattice (vertices ), the two diagonals give isomorphic quotients.
Theorem 20.5 — Third isomorphism (quotient of a quotient)
Let (K also normal in G). Then"Quotient by K, then by N/K, equals quotient by N."

A clean cube application: take (states reachable using only U and D), and (states of even parity). Then consists of all "⟨U,D⟩-states with arbitrary parity adjust," and by the second isomorphism theorem

The right-hand index [⟨U,D⟩ : ⟨U,D⟩ ∩ [G,G]] = 2, because each of U and D is itself an odd permutation. So HN partitions over [G,G] into exactly two cosets — a direct proof of the "⟨U,D⟩-based parity detector" used in many BLD methods.

Theorem 20.6 — Correspondence (lattice) theorem
Let , the natural projection. Then gives an order-preserving bijection between subgroups of G containing N and all subgroups of G/N:Normal subgroups correspond to normal subgroups; indices are preserved.

Application on the cube: with , . ℤ/2 has only two subgroups ({e} and itself), so there are exactly two subgroups of G containing [G,G]: namely [G,G] and G. This precisely says "no intermediate subgroup sits strictly between [G,G] and G" — the sgn bit is indivisible.

The four isomorphism theorems (first, second, third, lattice) lock "homomorphisms ↔ normal subgroups ↔ quotients ↔ subgroup lattice" together into a single diagram. The densest verse in abstract algebra: every line says that "taking a quotient" is just "re-naming the same object."
cuberoot.me · Rubik's Cube as a Group · 2026