Jordan-Hölder Theorem

lean4-proofgroup-theoryvisualization
{0}H1G and {0}K1G give the same factors\{0\} \subset H_1 \subset \cdots \subset G \text{ and } \{0\} \subset K_1 \subset \cdots \subset G \text{ give the same factors}

Statement

A composition series of a group GG is a subnormal series

{e}=GnGn1G1G0=G\{e\} = G_n \triangleleft G_{n-1} \triangleleft \cdots \triangleleft G_1 \triangleleft G_0 = G

where each quotient Gi/Gi+1G_i/G_{i+1} is a simple group (no normal subgroups except {e}\{e\} and itself).

Jordan–Hölder Theorem. If GG has two composition series, they have the same length nn (the composition length), and the multisets of composition factors {Gi/Gi+1}\{G_i/G_{i+1}\} are the same up to isomorphism and reordering.

Visualization

Two composition series of Z/12\mathbb{Z}/12:

Series A: {0}Z/2Z/6Z/12\{0\} \subset \mathbb{Z}/2 \subset \mathbb{Z}/6 \subset \mathbb{Z}/12

StepQuotientSimple?Order
Z/2/{0}\mathbb{Z}/2 / \{0\}Z/2\mathbb{Z}/2Yes (pp-group)2
Z/6/Z/2\mathbb{Z}/6 / \mathbb{Z}/2Z/3\mathbb{Z}/3Yes3
Z/12/Z/6\mathbb{Z}/12 / \mathbb{Z}/6Z/2\mathbb{Z}/2Yes2

Series B: {0}Z/3Z/6Z/12\{0\} \subset \mathbb{Z}/3 \subset \mathbb{Z}/6 \subset \mathbb{Z}/12

StepQuotientSimple?Order
Z/3/{0}\mathbb{Z}/3 / \{0\}Z/3\mathbb{Z}/3Yes3
Z/6/Z/3\mathbb{Z}/6 / \mathbb{Z}/3Z/2\mathbb{Z}/2Yes2
Z/12/Z/6\mathbb{Z}/12 / \mathbb{Z}/6Z/2\mathbb{Z}/2Yes2

Both series have length 3 and factors {Z/2,Z/2,Z/3}\{\mathbb{Z}/2, \mathbb{Z}/2, \mathbb{Z}/3\} — the Jordan–Hölder theorem guarantees this.

Proof Sketch

  1. Existence. Any finite group has a composition series (insert maximal normal subgroups greedily, terminate since G|G| is finite).
  2. Uniqueness (the hard part, by induction on length). Given two series {Gi}\{G_i\} and {Hj}\{H_j\}, compare the first steps G1GG_1 \triangleleft G and H1GH_1 \triangleleft G. Apply the second isomorphism theorem to G1H1/G1H1/(G1H1)G_1 H_1 / G_1 \cong H_1 / (G_1 \cap H_1) and a symmetric isomorphism, reducing to shorter series to which the inductive hypothesis applies.
  3. Simple groups are the atoms. The composition factors are the "prime factors" of GG — a decomposition that cannot be refined further.

Connections

The Jordan–Hölder theorem is the group analogue of unique prime factorization from the Fundamental Theorem of ArithmeticFundamental Theorem of Arithmeticn=p1a1p2a2pkakn = p_1^{a_1} \cdot p_2^{a_2} \cdots p_k^{a_k}Every integer greater than 1 has a unique prime factorizationRead more →. Its proof pivots on the Second Isomorphism TheoremSecond Isomorphism TheoremHN/NH/(HN)HN/N \cong H/(H \cap N)For subgroups H and normal N of G, the quotient HN/N is isomorphic to H/(H ∩ N).Read more → (the "diamond" isomorphism) to relate two adjacent composition series steps. The composition factors of finite groups are ultimately classified by the enormous Classification of Finite Simple Groups — see Sylow TheoremsSylow TheoremspkG    HG,  H=pkp^k \mid |G| \implies \exists H \leq G,\; |H| = p^kPrime-power subgroups always exist, are conjugate, and their count is constrainedRead more → for a piece of that structure.

Lean4 Proof

/-- The Jordan-Hölder theorem: any two composition series with the same endpoints
    are equivalent (same length, isomorphic factors up to reordering).
    Mathlib: `CompositionSeries.jordan_holder` in `Mathlib.Order.JordanHolder`. -/
theorem jordan_holder_thm {X : Type*} [Lattice X] [JordanHolderLattice X]
    (s₁ s₂ : CompositionSeries X)
    (hb : s₁.head = s₂.head) (ht : s₁.last = s₂.last) :
    CompositionSeries.Equivalent s₁ s₂ :=
  CompositionSeries.jordan_holder s₁ s₂ hb ht