Z/pZ and composition series — factoring groups into simple pieces
The cyclic group Z/nZ consists of the integers {0, 1, 2, …, n−1} with addition modulo n. By Lagrange's theorem, the order of any subgroup of Z/nZ must divide n. If n = p is prime, then the only divisors of p are 1 and p itself, so the only subgroups are {0} and the whole group. Since Z/pZ is abelian, every subgroup is automatically normal, and having no proper non-trivial subgroups at all means Z/pZ is simple. This is the most elementary infinite family of simple groups.
Conversely, if n is composite — say n = ab with 1 < a, b < n — then the cyclic subgroup generated by a has order n/a = b, giving a proper non-trivial subgroup. Since Z/nZ is abelian, this subgroup is normal, and Z/nZ is not simple. This tight connection between primality and simplicity for cyclic groups is the foundation of the analogy between prime numbers and simple groups.
It is a remarkable fact that the cyclic groups of prime order are the only abelian simple groups. The proof is straightforward: if G is abelian and simple, pick any non-identity element g ∈ G. The cyclic subgroup ⟨g⟩ is normal (since G is abelian), so by simplicity ⟨g⟩ = G. Thus G is cyclic. If |G| = n were composite, G would have a proper non-trivial (normal) subgroup, contradicting simplicity. Therefore |G| must be prime, and G ≅ Z/pZ.
A composition series for a finite group G is a chain of subgroups G = G₀ ⊵ G₁ ⊵ G₂ ⊵ ··· ⊵ Gₙ = {e} where each Gᵢ₊₁ is a maximal proper normal subgroup of Gᵢ, making each successive quotient Gᵢ/Gᵢ₊₁ a simple group. These quotients are called the composition factors of G. The Jordan-Holder theorem guarantees that while the chain itself may not be unique, the multiset of composition factors is — exactly paralleling the uniqueness of prime factorization.
Consider the cyclic group Z/12Z. One composition series is Z/12Z ⊵ ⟨2⟩ ≅ Z/6Z ⊵ ⟨4⟩ ≅ Z/3Z ⊵ {0}. The composition factors are Z/12Z / Z/6Z ≅ Z/2Z, then Z/6Z / Z/3Z ≅ Z/2Z, then Z/3Z / {0} ≅ Z/3Z. So the composition factors of Z/12Z are{Z/2Z, Z/2Z, Z/3Z} — exactly reflecting the prime factorization 12 = 2 × 2 × 3. Another valid composition series might produce the factors in a different order (say Z/3Z, Z/2Z, Z/2Z), but the multiset is the same.
For abelian groups, the composition factors are always cyclic of prime order, and the prime factorization of |G| tells us exactly which primes appear and with what multiplicity. But for non-abelian groups, the composition factors can be non-abelian simple groups — alternating groups, groups of Lie type, or sporadic groups. Understanding which simple groups appear as composition factors of a given group is a central question in the structural theory of finite groups.
Use the interactive demonstration below to construct composition series for various groups. Watch how each group decomposes step by step into simple factors, and verify the Jordan-Holder theorem by finding multiple composition series for the same group — the factors always match.
The Jordan-Hölder theorem guarantees these factors are unique (up to order) — like prime factorization, but for groups.
Key insight: The composition series of Z/nZ always produces cyclic factors of prime order matching the prime factorization of n. But non-abelian groups like S₄ have non-abelian composition factors: its series includes both Z/2Z and Z/3Z (from the abelian parts) and the non-abelian simple group A₄/V₄ ≅ Z/3Z. The symmetric group S₅ famously has A₅ as a composition factor — the simplest non-abelian simple group.
The parallel between prime factorization of integers and composition series of groups is both illuminating and limited. In both cases, there is a notion of "atoms" (primes or simple groups) and a uniqueness theorem (Fundamental Theorem of Arithmetic or Jordan-Holder). In both cases, the atoms themselves have been classified: primes are the integers greater than 1 with no non-trivial divisors, and finite simple groups fall into the four families described by the classification theorem.
However, the analogy breaks down when it comes to reconstruction. Given the prime factorization of an integer, you can reconstruct the integer uniquely by multiplication. But given the composition factors of a group, you generally cannot reconstruct the group uniquely. There may be many non-isomorphic groups with the same composition factors. For example, both Z/4Z and Z/2Z × Z/2Z have composition factors {Z/2Z, Z/2Z}, but they are not isomorphic. The extension problem — determining all groups with given composition factors — is vastly more complex than multiplication of integers.
Despite this limitation, the classification of finite simple groups is still enormously powerful. Knowing the complete list of "primes" constrains what finite groups can exist and provides the foundation for structural results about arbitrary finite groups. Many theorems in group theory proceed by reducing to the simple case and then checking the result against the classification — a strategy that would be impossible without a complete list.