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.
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:
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.
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.
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.
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.