Classification of finite simple groups formalized in Lean
A project site at cfsg.axiommath.ai presents what it calls a complete formalization in Lean of the Classification of Finite Simple Groups. The formalization follows the first-generation proof, and every logical step is checked by Lean's kernel.
The page frames the classification as one of the great collective achievements of mathematics. Its first-generation proof spans thousands of journal pages, written by about a hundred mathematicians over several decades. The result says that every finite simple group is cyclic of prime order, alternating, of Lie type, or one of 26 sporadic groups.
The formalization also produced new mathematics. While formalizing the first-generation proof, the team found counterexamples to a closure assertion used in a published route to the Unbalanced Group Theorem. A 35-page accompanying paper, listed on the page as Hexagon 2610.00575, explains the obstruction. It also gives an alternative argument for the simple-group case. That argument is built on Solomon's 1976 theory of maximal 2-components, and its key step is Theorem 2.3, the preservation of simple tops. The alternative route is the one used in the team's proof.
The team says it is working with group theorists to compile the errata it found in the literature, and will publish them on the page. The page also says more papers will appear there, and refers readers to a blog post that tells the full story. The site credits a list of other contributors that includes Ken Ono and Colin Defant, and offers a zoomable view of each formalized statement.
Key facts
- The project page presents a complete Lean formalization of the Classification of Finite Simple Groups, following the first-generation proof, with every logical step checked by Lean's kernel.
- The first-generation proof spans thousands of journal pages and was written by about a hundred mathematicians over several decades; the theorem sorts finite simple groups into cyclic of prime order, alternating, Lie type, or one of 26 sporadic groups.
- While formalizing, the team found counterexamples to a closure assertion used in a published route to the Unbalanced Group Theorem.
- A 35-page paper (Hexagon 2610.00575) explains the obstruction and gives an alternative argument for the simple-group case, built on Solomon's 1976 theory of maximal 2-components, with Theorem 2.3 (preservation of simple tops) as the key step.
- The team plans to publish errata found in the literature, compiled with group theorists, and says more papers will follow.
Why it matters
The classification is a result whose proof is spread across thousands of journal pages and about a hundred authors. A machine-checked version, with every logical step verified by Lean's kernel, is a different kind of assurance from human refereeing of such a sprawling argument. The formalization has already produced a concrete mathematical return: counterexamples to a closure assertion in a published route to the Unbalanced Group Theorem, and a new argument for the simple-group case.
Who it affects
Group theorists are the most direct audience, since the team says it is working with them to compile errata found in the literature. Researchers in formal verification and proof assistants can see how far Lean has been taken on a very large, multi-author proof. Anyone relying on the published route to the Unbalanced Group Theorem now has a paper that discusses its obstruction and an alternative.
How to use it
Read the project page, which offers a zoomable view of each formalized statement, and the accompanying 35-page paper on the Unbalanced Group Theorem (Hexagon 2610.00575). The page also points to a blog post that tells the full story. The errata list and further papers are promised on the same page but are not published yet.
How solid is it
The central claim comes from the project's own page, written in the first person by the team, and rests on Lean's kernel checking every logical step. The page names Ken Ono and Colin Defant among its other contributors. No size of the Lean formalization (lines of code, number of theorems, compute or time spent) is given, and no reaction from group theorists or the wider mathematical community is reported. The page does not say the issue was fixed by anyone other than the team.
Risks and caveats
The source does not say which published route to the Unbalanced Group Theorem was flawed or who wrote it, and it does not say the classification theorem itself is in doubt. It says counterexamples to a closure assertion were found, not that the original published argument is wrong in all cases. The errata are a stated intention, not yet published, and the full account sits in a blog post whose content is not part of the page text.
“Here we present a complete formalization in Lean following the first-generation proof, with every logical step checked by Lean’s kernel.”
— Project page, cfsg.axiommath.ai