The Jordan–Hölder theorem
ProvedFamousTheorems.jordan_holderThe Jordan–Hölder theorem. Any two composition series with the same first and last terms are equivalent: they have the same length, and their successive factors agree up to a permutation and isomorphism.
For a finite group, the multiset of composition factors (simple groups) is therefore an invariant. The same holds for modules of finite length. It underlies the programme of classifying finite groups via finite simple groups and the notion of length in module theory.
Formalization note. Mathlib's CompositionSeries.jordan_holder, proved for a lattice with an abstract JordanHolderLattice structure (a notion of maximal step and of isomorphism of intervals satisfying the second isomorphism law). Subgroup and submodule lattices are the intended instances. s₁.Equivalent s₂ means the series have the same length and some bijection of steps matches isomorphic factors.
import Mathlib
namespace FamousTheorems
theorem jordan_holder {X : Type*} [Lattice X] [JordanHolderLattice X] (s₁ s₂ : CompositionSeries X)
(hb : RelSeries.head s₁ = RelSeries.head s₂) (ht : RelSeries.last s₁ = RelSeries.last s₂) :
s₁.Equivalent s₂ := by sorry
end FamousTheorems