Toward the Classification of Finite Groups

We survey the landscape of finite group theory. After stating the classification of finite simple groups, we introduce the sporadic simple groups (including the Monster), discuss the Feit--Thompson theorem, and reflect on what abstract algebra has achieved and what remains open.

Folio Official

March 1, 2026

1 The Two Fundamental Problems

The structural theory of finite groups revolves around two central questions:

The classification problem: Determine all finite simple groups.
The extension problem: Given simple groups, construct all groups having them as composition factors.

By the Jordan–Hö— the simple groups — and (2) understanding all the ways they can be assembled — the theory of group extensions.

2 The Families of Finite Simple Groups

The finite simple groups fall into four broad families:

Theorem 1 (Classification of Finite Simple Groups).

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

A cyclic group of prime order $Z / p Z$ .
An alternating group $A_{n}$ for $n \geq 5$ .
A group of Lie type (belonging to one of $16$ infinite families).
One of the $26$ sporadic simple groups.

This classification theorem is one of the crowning achievements of twentieth-century mathematics. Its proof was assembled over roughly fifty years, beginning around 1955, through the combined work of scores of mathematicians. The complete proof spans tens of thousands of pages across hundreds of journal articles.

3 Cyclic Groups of Prime Order

The simplest finite simple groups are the cyclic groups $Z / p Z$ of prime order $p$ . Having prime order, they possess no non-trivial proper subgroups, and hence are simple. These are the abelian simple groups, and every abelian simple group belongs to this family.

Proposition 2.

If a finite simple group is abelian, then it is isomorphic to

Z / p Z

for some prime

p

Proof.

Let

G

be a finite abelian simple group. Pick

g \neq = e

. Since

G

is abelian,

⟨ g ⟩ ⊴ G

. Simplicity forces

⟨ g ⟩ = G

, so

G

is cyclic. If

∣ G ∣ = n

were composite, say

n = ab

with

1 < a, b < n

, then

⟨ g^{a} ⟩

would be a non-trivial proper normal subgroup, contradicting simplicity. Hence

∣ G ∣

is prime. □

4 Simplicity of the Alternating Groups

Theorem 3.

For

n \geq 5

, the alternating group

A_{n}

is simple.

Proof.

One first shows that

A_{n}

(

n \geq 5

) is generated by

3

-cycles. Let

N ⊴ A_{n}

with

N \neq = {e}

. The goal is to show that

N

contains some

3

-cycle; since all

3

-cycles in

A_{n}

are conjugate, this would force

N = A_{n}

Take

σ \in N

with

σ \neq = e

and examine its cycle decomposition. Using the fact that

n \geq 5

, one can always find a conjugate

τ

such that the commutator

[σ, τ] = σ^{- 1} τ^{- 1} σ τ \in N

is a "shorter" permutation than

σ

. Iterating this reduction eventually produces a

3

-cycle in

N

. □

Remark 4.

A_{4}

is not simple: the Klein four-group

V_{4} ⊴ A_{4}

. The group

A_{5}

, of order

60

, is the smallest non-abelian simple group.

5 Groups of Lie Type

The groups of Lie type are obtained by developing the theory of Lie algebras — algebraic structures that describe continuous symmetries — over finite fields rather than the real or complex numbers.

Example 5 (Projective special linear groups).

The group

PSL (n, q) = SL (n, F_{q}) / Z (SL (n, F_{q}))

is defined as the quotient of the special linear group over the finite field

F_{q}

(

q = p^{k}

p

prime) by its center. For

(n, q) \neq = (2, 2)

and

(n, q) \neq = (2, 3)

, the group

PSL (n, q)

is simple.

There are interesting overlaps: $PSL (2, 4) ≅ PSL (2, 5) ≅ A_{5}$ .

The $16$ families of groups of Lie type are:

Classical groups: $A_{n} (q) = PSL (n + 1, q)$ , $B_{n} (q) = PΩ (2 n + 1, q)$ , $C_{n} (q) = PSp (2 n, q)$ , $D_{n} (q) = PΩ^{+} (2 n, q)$ .
Exceptional groups: $G_{2} (q)$ , $F_{4} (q)$ , $E_{6} (q)$ , $E_{7} (q)$ , $E_{8} (q)$ .
Twisted groups: $\null^{2} A_{n} (q)$ , $\null^{2} D_{n} (q)$ , $\null^{3} D_{4} (q)$ , $\null^{2} E_{6} (q)$ , $\null^{2} B_{2} (q)$ (Suzuki groups), $\null^{2} G_{2} (q)$ (Ree groups), $\null^{2} F_{4} (q)$ .

6 The Sporadic Simple Groups

The $26$ sporadic simple groups are the "exceptional" simple groups that do not belong to any of the infinite families above.

Definition 6.

A sporadic simple group is a finite simple group that is not isomorphic to any cyclic group of prime order, any alternating group, or any group of Lie type.

Among the most notable sporadic groups:

The Mathieu groups $M_{11}, M_{12}, M_{22}, M_{23}, M_{24}$ : the first sporadic groups to be discovered (Mathieu, 1861 and 1873). The largest, $M_{24}$ , has order $244823040 = 2^{10} \cdot 3^{3} \cdot 5 \cdot 7 \cdot 11 \cdot 23$ and acts as a $5$ -transitive permutation group.
The Janko groups $J_{1}, J_{2}, J_{3}, J_{4}$ .
The Conway groups $Co_{1}, Co_{2}, Co_{3}$ : arising from the symmetries of the Leech lattice.
The Fischer groups $Fi_{22}, Fi_{23}, Fi_{24}^{'}$ .
The Monster group $M$ : the largest sporadic simple group, with order
$∣ M ∣ = 2^{46} \cdot 3^{20} \cdot 5^{9} \cdot 7^{6} \cdot 1 1^{2} \cdot 1 3^{3} \cdot 17 \cdot 19 \cdot 23 \cdot 29 \cdot 31 \cdot 41 \cdot 47 \cdot 59 \cdot 71 \approx 8.08 \times 1 0^{53} .$
The Baby Monster $B$ : the second-largest sporadic group.

Of the $26$ sporadic groups, $20$ appear as subquotients of the Monster and are collectively known as the Happy Family. The remaining $6$ — $J_{1}$ , $J_{3}$ , $Ru$ , $J_{4}$ , $Ly$ , and $Th$ — are called the Pariahs.

7 Significance and Structure of the Classification

Theorem 7 (Feit–Thompson Theorem, 1963).

Every finite group of odd order is solvable.

This theorem was proved in a single paper of $255$ pages. Since the composition factors of a solvable group are all cyclic of prime order, the theorem can be restated as: every non-abelian finite simple group has even order. This reduces the classification of simple groups to the case of even order.

The broad strategy of the classification proof is as follows:

By the Feit–Thompson theorem, every non-abelian simple group has even order.
A group of even order contains an element of order $2$ (an involution).
One classifies groups by analyzing the centralizer $C_{G} (t)$ of an involution $t$ (the Brauer program).
In each case, one shows that the group is isomorphic to a known simple group.

8 The Extension Problem

Knowing the composition factors does not determine the group uniquely.

Example 8.

The two groups of order

4

—

Z /4 Z

and

V_{4} = Z /2 Z \times Z /2 Z

— share the same composition factors

{Z /2 Z, Z /2 Z}

yet are not isomorphic.

Definition 9 (Group extension).

Given groups

N

and

Q

, a group

G

is an extension of

N

Q

N ⊴ G

and

G / N ≅ Q

The extension problem is formidable in general and is classified by the second cohomology group $H^{2} (Q, N)$ . When the composition factors include non-abelian simple groups, however, the number of extensions is often manageable.

9 Finite Group Theory Today

Although the classification theorem is complete, many active research directions remain:

Simplification of the classification: The "second-generation proof" by Gorenstein, Lyons, and Solomon is an ongoing project to produce a more streamlined and unified proof.
Representation theory: Linear representations of finite groups have deep applications in physics (crystallographic groups, particle physics) and coding theory.
Asymptotic group theory: The asymptotic behavior of the function $f (n)$ counting groups of order at most $n$ . The enumeration of $p$ -groups is especially challenging; it is estimated that $f (p^{n}) \sim p^{(2/27) n^{3}}$ .
Computational group theory: Algorithms for computing with groups are implemented in systems such as GAP and Magma.
Monstrous Moonshine: A deep and unexpected connection between the representation theory of the Monster group and modular functions. The $j$ -function has the Fourier expansion
$j (τ) = q^{- 1} + 744 + 196884 q + 21493760 q^{2} + \dots (q = e^{2 πi τ})$
whose coefficients can be expressed as sums of dimensions of irreducible representations of the Monster. The remarkable numerology $196884 = 196883 + 1$ , where $196883$ is the dimension of the smallest non-trivial irreducible representation of $M$ , was first observed by McKay. The Moonshine conjecture of Conway and Norton was proved by Borcherds, earning him the Fields Medal in 1998.

10 Summary

Let us look back at the ground covered in this series:

Groups: definitions and basic properties— the group axioms, subgroups, cyclic groups.
Cosets and Lagrange's theorem— the fundamental counting principle.
Normal subgroups and quotient groups— the operation of "dividing" a group.
Homomorphisms and the isomorphism theorems— structure-preserving maps and three fundamental isomorphism theorems.
Group actions and the class equation— groups acting on sets, counting via orbits.
The Sylow theorems— precise structural results on $p$ -subgroups of finite groups.
Direct and semidirect products— building new groups from known ones.
The structure of finite abelian groups— a complete classification.
Composition series and the Jordan–Hölder theorem— the "prime factorization" of groups and its uniqueness.
Toward the classification of finite groups— the classification of simple groups and open problems.

Group theory is the language of symmetry, and it occupies a central place in algebra. Its theoretical framework provides a universal scaffolding that spans algebraic structure theory, number theory, geometry, and physics.

Group Theory Algebra Textbook Classification Simple Groups Finite Groups

Folio Official

Mathematics "between the lines" — exploring the intuition textbooks leave out, written in LaTeX on Folio.

1 followers·105 articles

Toward the Classification of Finite Groups

1 The Two Fundamental Problems

2 The Families of Finite Simple Groups

3 Cyclic Groups of Prime Order

4 Simplicity of the Alternating Groups

5 Groups of Lie Type

6 The Sporadic Simple Groups

7 Significance and Structure of the Classification

8 The Extension Problem

9 Finite Group Theory Today

10 Summary

Share your expertise with the world

More from Folio Official

Monetizing Your Articles — How to Earn Revenue Safely with Stripe Connect

Mastering Theorem Environments — theorem, definition, proof, and Friends

Combinatorial Designs and Latin Squares: Balanced Arrangements

Burnside's Lemma and P\'olya Enumeration: Counting Under Symmetry