Mathematics

The Classification of Finite Simple Groups: The Enormous Theorem

We survey the Classification of Finite Simple Groups — the monumental theorem that catalogs every possible finite simple group — covering its structure, history, and significance as perhaps the longest proof in the history of mathematics.

Algebra Group Theory

The Theorem

Classification of Finite Simple Groups (CFSG)

Every finite simple group is isomorphic to one of the following:

A cyclic group $\mathbb{Z}/p\mathbb{Z}$ of prime order
An alternating group $A_n$ for $n \geq 5$
A group of Lie type (16 families of matrix groups over finite fields)
One of 26 sporadic groups

This is sometimes called the Enormous Theorem — the proof spans roughly 10,000 to 15,000 pages across hundreds of journal articles by over 100 mathematicians, developed over approximately 50 years (1950s–2004).

What Is a Simple Group?

A group $G$ is simple if $|G| > 1$ and its only normal subgroups are $\{e\}$ and $G$ itself.

Simple groups are the "atoms" of group theory. Every finite group can be built from simple groups via extensions (the Jordan-Hölder theorem guarantees that the composition factors are unique up to order and isomorphism). Classifying simple groups is therefore analogous to finding the periodic table of elements.

Examples

$\mathbb{Z}/p\mathbb{Z}$ is simple for every prime $p$ (the only subgroups of a group of prime order are trivial).
$A_5$ , the alternating group on 5 elements (order 60), is the smallest non-abelian simple group.
$A_4$ is not simple: it has a normal subgroup isomorphic to $\mathbb{Z}/2\mathbb{Z} \times \mathbb{Z}/2\mathbb{Z}$ .
$\mathrm{PSL}_2(\mathbb{F}_7)$ , the projective special linear group over $\mathbb{F}_7$ (order 168), is simple.

The Four Families

1. Cyclic Groups of Prime Order

$\mathbb{Z}/p\mathbb{Z} \qquad (p \text{ prime})$

These are the abelian simple groups. They are the simplest possible.

2. Alternating Groups

$A_n \qquad (n \geq 5)$

The alternating group $A_n$ consists of all even permutations of $\{1, \ldots, n\}$ and has order $n!/2$ . It is simple for $n \geq 5$ — a fact proved by Galois and used crucially in proving that the general quintic equation has no solution by radicals.

3. Groups of Lie Type

These are the "bulk" of the classification — 16 infinite families of groups defined as matrix groups over finite fields. They include:

Classical groups: $\mathrm{PSL}_n(q)$ , $\mathrm{PSU}_n(q)$ , $\mathrm{PSp}_{2n}(q)$ , $\mathrm{P\Omega}_n^\pm(q)$
Exceptional groups: $G_2(q)$ , $F_4(q)$ , $E_6(q)$ , $E_7(q)$ , $E_8(q)$
Twisted groups: ${}^2\!A_n(q)$ , ${}^2\!D_n(q)$ , ${}^2\!E_6(q)$ , ${}^3\!D_4(q)$ , ${}^2\!B_2(q)$ , ${}^2\!G_2(q)$ , ${}^2\!F_4(q)$

Here $q = p^f$ is a prime power. These groups arise as automorphism groups of Lie algebras over finite fields and form the vast majority of known finite simple groups.

4. The 26 Sporadic Groups

These are the "exceptional" simple groups that do not fit into any infinite family. They range from the Mathieu groups (discovered in the 1860s) to the Monster group (predicted in the 1970s, constructed by Griess in 1982).

Some notable sporadic groups:

Group	Order	Year
$M_{11}$	7920	1861
$M_{12}$	95040	1861
$M_{24}$	244823040	1861
$J_1$ (Janko)	175560	1965
$\mathrm{Co}_1$ (Conway)	$\approx 4.2 \times 10^{18}$	1968
$\mathbb{M}$ (Monster)	$\approx 8.08 \times 10^{53}$	1982
$\mathbb{B}$ (Baby Monster)	$\approx 4.15 \times 10^{33}$	1977

The Monster Group

The Monster $\mathbb{M}$ is the largest sporadic simple group, with order:

$|\mathbb{M}| = 2^{46} \cdot 3^{20} \cdot 5^9 \cdot 7^6 \cdot 11^2 \cdot 13^3 \cdot 17 \cdot 19 \cdot 23 \cdot 29 \cdot 31 \cdot 41 \cdot 47 \cdot 59 \cdot 71$

$\approx 8.08 \times 10^{53}$

Its smallest faithful representation is a $196,883$ -dimensional matrix representation. The Monster connects to deep areas of mathematics and physics:

Monstrous moonshine (Conway and Norton, 1979): the character table of the Monster is related to the Fourier coefficients of the $j$ -invariant $j(\tau)$ , a modular function.
Borcherds's proof (1992): Richard Borcherds proved the moonshine conjecture using vertex operator algebras and the "Monster Lie algebra," earning the Fields Medal.

History of the Proof

Early Discoveries

Galois (1832): Proved $A_n$ is simple for $n \geq 5$ ; discovered $\mathrm{PSL}_2(\mathbb{F}_p)$ .
Jordan (1870): Systematic study of permutation groups and composition series.
Mathieu (1861–1873): Discovered the five Mathieu groups $M_{11}, M_{12}, M_{22}, M_{23}, M_{24}$ — the first sporadic groups.
Chevalley (1955): Unified construction of groups of Lie type over arbitrary fields.

The Systematic Classification (1950s–2004)

The classification program was largely organized by Daniel Gorenstein, who outlined a 16-step strategy in the 1970s. Key contributors include:

Feit-Thompson (1963): Proved the Odd Order Theorem — every group of odd order is solvable (hence not simple unless cyclic of prime order). The paper is 255 pages long and was a turning point.
Aschbacher, Gorenstein, Lyons, Solomon, Thompson, and many others carried out the classification over decades.
The proof was announced as complete in 1983, but gaps were found. The last major gap was closed by Aschbacher and Smith in 2004.

The Feit-Thompson Theorem

Feit-Thompson Theorem (Odd Order Theorem, 1963)

Every finite group of odd order is solvable.

Since a non-abelian simple group is not solvable, this means every non-abelian simple group has even order. Equivalently, every non-abelian simple group contains an element of order $2$ (an involution). The analysis of involutions became the central technique of the classification.

The Jordan-Hölder Theorem

Jordan-Hölder Theorem. Every finite group $G$ has a composition series:

$\{e\} = G_0 \triangleleft G_1 \triangleleft G_2 \triangleleft \cdots \triangleleft G_k = G$

where each quotient $G_{i+1}/G_i$ is simple. The multiset of composition factors $\{G_{i+1}/G_i\}$ is unique (up to permutation and isomorphism).

This theorem makes the CFSG meaningful: knowing all simple groups tells us the "building blocks" of all finite groups.

Open Questions

Despite the classification being complete, important questions remain:

Simplification. The proof is impossibly long for any single person to verify. A major ongoing project (the "GLS project" by Gorenstein, Lyons, and Solomon) aims to produce a unified, readable second-generation proof. As of 2024, 8 of the planned 12 volumes have been published.
Why these groups? Is there a deeper structural reason why exactly 26 sporadic groups exist? The moonshine connections hint at hidden structure, but no complete explanation exists.
Applications. The CFSG is used as a "black box" in many areas — computational group theory, combinatorics, coding theory, and cryptography. Understanding its applications continues to be an active area.

Summary

\begin{aligned} &\text{Every finite simple group is:} \\[6pt] &\quad \mathbb{Z}/p\mathbb{Z} \quad \text{(prime cyclic)} \\[4pt] &\quad A_n \quad (n \geq 5) \quad \text{(alternating)} \\[4pt] &\quad \text{A group of Lie type (16 families)} \\[4pt] &\quad \text{One of 26 sporadic groups} \\[10pt] &\text{Proof: } \sim 10,000\text{+ pages, 100+ authors, 50 years} \end{aligned}

References

Gorenstein, D., Finite Simple Groups: An Introduction to Their Classification, Springer, 1982.
Aschbacher, M., Finite Group Theory, 2nd edition, Cambridge University Press, 2000.
Wilson, R., The Finite Simple Groups, Springer Graduate Texts in Mathematics, 2009.
Wikipedia — Classification of finite simple groups
Wikipedia — Monster group
Numberphile — "The Monster" (YouTube)

Back to all posts