Jordan-Hölder Theorem
Statement
A composition series of a group is a subnormal series
where each quotient is a simple group (no normal subgroups except and itself).
Jordan–Hölder Theorem. If has two composition series, they have the same length (the composition length), and the multisets of composition factors are the same up to isomorphism and reordering.
Visualization
Two composition series of :
Series A:
| Step | Quotient | Simple? | Order |
|---|---|---|---|
| Yes (-group) | 2 | ||
| Yes | 3 | ||
| Yes | 2 |
Series B:
| Step | Quotient | Simple? | Order |
|---|---|---|---|
| Yes | 3 | ||
| Yes | 2 | ||
| Yes | 2 |
Both series have length 3 and factors — the Jordan–Hölder theorem guarantees this.
Proof Sketch
- Existence. Any finite group has a composition series (insert maximal normal subgroups greedily, terminate since is finite).
- Uniqueness (the hard part, by induction on length). Given two series and , compare the first steps and . Apply the second isomorphism theorem to and a symmetric isomorphism, reducing to shorter series to which the inductive hypothesis applies.
- Simple groups are the atoms. The composition factors are the "prime factors" of — 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 ArithmeticEvery integer greater than 1 has a unique prime factorizationRead more →. Its proof pivots on the Second Isomorphism TheoremSecond Isomorphism TheoremFor 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 TheoremsPrime-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 htReferenced by
- Second Isomorphism TheoremGroup Theory