Project formalizes classification of finite simple groups in Lean, reports flaw in published proof route

Machine-checked reconstruction of the landmark proof uncovered counterexamples in a route to the Unbalanced Group Theorem; the team proposes an alternative argument and is compiling errata

By LineZotpaper AI staff

Published27 October 2026

Read Time2 min

Follow this storyHear when it moves

Illustration: Project formalizes classification of finite simple groups in Lean, reports flaw in published proof route

Mathematicians report completing a machine-checked formalization of the classification of finite simple groups in the Lean proof assistant, and say the work uncovered a flaw in a published route to the Unbalanced Group Theorem.

The project presents a complete formalization of the classification of finite simple groups in Lean, following the original first-generation proof, and says the proof has been checked at every logical step by Lean's kernel.

The classification, which the project describes as one of the great collective achievements of mathematics, shows that every finite simple group is cyclic of prime order, alternating, of Lie type, or one of 26 sporadic groups. The first-generation proof spans thousands of journal pages and was written by about a hundred mathematicians over several decades.

While formalizing that proof, the team found counterexamples to a closure assertion used in a published route to the Unbalanced Group Theorem, a key component of the classification. A 35-page paper explains the obstruction and gives an alternative argument for the simple-group case, built on Solomon's 1976 theory of maximal 2-components, whose key step is Theorem 2.3, the preservation of simple tops. The paper also reports a new group theory result that came out of the formalization project.

The team says it is working with group theorists to compile the errata it found in the literature and will publish them. More papers from the project are expected to appear, and the team's blog post sets out the full story.

RSS

The Daily Edition

The front page in your inbox each weekday morning: the lead, the picks, and why each one earned its place.

Analysis

Why This Matters

A proof that took about a hundred mathematicians several decades and thousands of journal pages can now be verified step-by-step by a machine, changing how trust in such results is established.
The discovery of counterexamples to a published closure assertion shows formalization can catch gaps in the literature that human readers missed.
The project reports that the work produced new mathematics, including an alternative argument for the simple-group case of the Unbalanced Group Theorem, with further results expected.

Background

Finite simple groups are the indivisible building blocks of finite groups, in a sense analogous to prime numbers in arithmetic, so classifying them is a foundational result of modern algebra. Because the first-generation proof is enormous and scattered across the work of many authors, checking it completely has been a long-standing challenge. Lean is an interactive proof assistant in which statements and proofs are written so that a computer kernel can verify each inference.

What to Watch

Whether group theorists accept the alternative route to the Unbalanced Group Theorem built on Solomon's theory of maximal 2-components, and how the published counterexample is handled.
The errata list the team says it is compiling with group theorists, and where the literature corrections land.
The further papers the project says are coming, and whether its findings feed back into the wider group theory literature.

Sources

Classification of Finite Simple Groups Formalized in Lean · Hacker News

Checked

12 claims in this story checked against 1 source: 1 supported.

Show each claim

Not in the sourcesThe project reports a flaw in a published proof route to the Unbalanced Group Theorem.Hacker News: Front Page: “Classification of Finite Simple Groups Formalized in Lean.”
SupportedThe classification of finite simple groups has been formalized in Lean.Hacker News: Front Page: “Classification of Finite Simple Groups Formalized in Lean.”
Partly supportedMathematicians completed a machine-checked reconstruction of the landmark proof.Hacker News: Front Page: “Classification of Finite Simple Groups Formalized in Lean.”
Not in the sourcesThe team found counterexamples to a closure assertion used in a published route to the Unbalanced Group Theorem.Hacker News: Front Page: “Classification of Finite Simple Groups Formalized in Lean.”
Not in the sourcesThe team proposes an alternative argument for the simple-group case.Hacker News: Front Page: “Classification of Finite Simple Groups Formalized in Lean.”
Not in the sourcesLean's kernel checked the proof at every logical step.Hacker News: Front Page: “Classification of Finite Simple Groups Formalized in Lean.”
Not in the sourcesThe classification says every finite simple group is cyclic of prime order, alternating, of Lie type or one of 26 sporadic groups.Hacker News: Front Page: “Classification of Finite Simple Groups Formalized in Lean.”
Not in the sourcesThe first-generation proof spans thousands of journal pages and was written by about a hundred mathematicians over several decades.Hacker News: Front Page: “Classification of Finite Simple Groups Formalized in Lean.”
Not in the sourcesA 35-page paper explains the obstruction and gives the alternative argument, based on Solomon's 1976 theory of maximal 2-components.Hacker News: Front Page: “Classification of Finite Simple Groups Formalized in Lean.”
Not in the sourcesThe paper reports a new group theory result arising from the formalization project.Hacker News: Front Page: “Classification of Finite Simple Groups Formalized in Lean.”
Not in the sourcesThe team is working with group theorists to compile errata and will publish them.Hacker News: Front Page: “Classification of Finite Simple Groups Formalized in Lean.”
Not in the sourcesMore papers from the project are expected, and the team's blog post sets out the full story.Hacker News: Front Page: “Classification of Finite Simple Groups Formalized in Lean.”