Simple Groups
Statement
A group is simple if it is nontrivial and its only normal subgroups are and itself. Simple groups are the building blocks of all finite groups in the same way primes are the building blocks of integers.
Key examples:
- is simple for every prime (the only finite abelian simple groups).
- is simple for all (the only nonabelian simple groups in the alternating series).
- The Monster group has order and is simple.
Visualization
Comparison of (not simple) and (simple):
A_4 (order 12) — NOT simple
Normal subgroup: V_4 = {(), (12)(34), (13)(24), (14)(23)}
Subgroup lattice:
A_4
├── V_4 (normal, order 4)
│ ├── ⟨(12)(34)⟩ (order 2)
│ ├── ⟨(13)(24)⟩ (order 2)
│ └── ⟨(14)(23)⟩ (order 2)
├── ⟨(123)⟩ (order 3, not normal)
└── {()} (order 1)
A_5 (order 60) — SIMPLE
Conjugacy classes: 1 + 15 + 20 + 12 + 12 = 60
(sizes must divide 60 and normal subgroups are unions of conjugacy classes + {e})
No subset of {15, 20, 12, 12} sums to 59 → no normal subgroup of order 2–59.
For with : the only subgroups have order dividing 5 (by Lagrange), so orders and . Both are trivial or the whole group — hence simple.
Proof Sketch
Proof that is simple (for prime ):
- By Lagrange's TheoremLagrange's TheoremSubgroup order divides group orderRead more →, any subgroup has dividing .
- Since is prime, , so or .
- is abelian, so every subgroup is normal.
- Therefore has no proper nontrivial normal subgroup — it is simple.
Mathlib handles this via isSimpleGroup_of_prime_card: a group of prime order is simple (since its cardinality is prime, Lagrange forces subgroup orders to be or ).
Connections
Simple groups are the Jordan-Hölder factors in the composition series of any finite group, analogous to prime factors in the Fundamental Theorem of ArithmeticFundamental Theorem of ArithmeticEvery integer greater than 1 has a unique prime factorizationRead more →. The classification of finite simple groups (CFSG) is one of the deepest results in mathematics. being simple is the key step in proving the Impossibility of the Quintic FormulaImpossibility of the Quintic FormulaNo general algebraic formula exists for polynomials of degree 5 or higherRead more → — the absence of a solvable composition series for prevents radical expressions for quintic roots. The Sylow TheoremsSylow TheoremsPrime-power subgroups always exist, are conjugate, and their count is constrainedRead more → are the primary tool for proving a given group is NOT simple.
Lean4 Proof
import Mathlib.GroupTheory.SpecificGroups.Cyclic
/-- ℤ/pℤ is a simple group for any prime p.
Mathlib: `isSimpleGroup_of_prime_card` in
`Mathlib.GroupTheory.SpecificGroups.Cyclic`. -/
theorem zmod_prime_simple (p : ℕ) [hp : Fact p.Prime] :
IsSimpleGroup (ZMod p) :=
isSimpleGroup_of_prime_card (by simp [ZMod.card])Referenced by
- Group PresentationGroup Theory
- Alternating GroupGroup Theory