Axiom Math says its AI swarm automatically verified the 15,000-page CFSG proof
Axiom Math says its AI system automatically formalized the Classification of Finite Simple Groups, a proof of more than 15,000 pages, and finished the check on October 25.
Axiom Math says its AI swarm completed the automatic verification of the Classification of Finite Simple Groups on 25 October. The result is a machine-checked version of a proof that runs to roughly 15,000 pages, which the company describes as widely considered the longest mathematical proof ever written by humans. Founding Mathematician Ken Ono watched the final stage of the check, as IEEE Spectrum reported in its coverage of the work. The result is a Lean formalization of about 43.1 million lines of code, and Axiom has published it.
Part of the proof's difficulty is scale. Finite simple groups are groups of elements that follow an operation with fixed rules, cannot be reduced or simplified further, and have finitely many elements. The theorem says these groups fall into 18 infinite families plus 26 sporadic groups that belong to no family, and the proof confirms that this list is complete. About 100 authors assembled it from more than 500 journal articles over roughly half a century, so no single mathematician can hold all of it in mind. Niels Voss, who led the formalization, said the length was among the hardest problems. Nothing can be checked until every theorem, lemma and definition is machine-readable. The team therefore first processed the literature and traced the network of dependencies in the informal proof. It then split the statement into about 100 milestones, which Voss described as landmark results that can be verified independently, and used them to steer the work.
Axiom's own account gives more detail on how the swarm operated. The project was divided into 108 milestones and about 380 smaller tasks. Agents claimed work through GitHub issues and reported progress in Slack. Early on, the team found that some milestones hid large prerequisites that agents had assumed rather than proved, and it deleted tens of thousands of lines built on those assumptions. A recurring difficulty was that a candidate proof could reach the desired conclusion under extra assumptions that had not been proved. That left the milestone open even though it looked finished. Build times also became a bottleneck, since agents produced proofs faster than Lean could recheck them. The team built a system to distribute cached build results across workers and moved expensive finite calculations into certificates that could be checked separately. The post says this sped up verification by orders of magnitude.
Colva Roney-Dougal of the University of St Andrews, who was not involved in the work, said she had regarded formalizing the classification as something that would be incredibly hard, because she thought the computing it required was unattainable. She said she was really surprised by the announcement. She also said the formal proof found and cleared up several mistakes in the original human proof, and she thinks such a result is critical for formalizing modern group theory. Her reservation concerns what people will learn from it. Because the check was done automatically, she said, few mathematicians may be able to extract information from the proof to share with others. She added that a new generation of mathematicians may have missed a chance to gain knowledge from the doing of it.
The errors the agents found are among the more concrete outputs of the project. Axiom says the translation exposed 34 noteworthy deviations from the published record, most of them minor, such as typographical errors, errors in tables or dropped hypotheses. The post says the largest concerned the Unbalanced Group Theorem. In one case, a lemma in Aschbacher and Smith's quasithin volumes asserted that two numerical quantities were equal, but the agents found a counterexample involving the group SL₂(5), where one quantity was 1 and the equality required 2. Replacing the equality with an inequality fixed the lemma. However, later arguments had used the equality to rule out cases, so the team broadened an earlier argument to cover them. In the Unbalanced Group Theorem, which helps identify a whole group from information about its subgroups, the agents found counterexamples to a closure assertion in John Walter's 1986 argument. Axiom says the counterexamples did not refute the theorem's goal. Completing the formalization required a different justification or a different route, which the team found with help from Richard Lyons and Ronald Solomon.
Axiom's claim has limits that its own material spells out. The formalization targets the first-generation proof, since the second-generation book series remains unfinished. The company reports that Lean's kernel validated the full inference chain. A human still has to confirm that the formal statement matches the intended theorem and to assess the errata.
The company's second project, announced nine days after the first, is the Stacks project, an open-source textbook on algebraic geometry begun in 2005 by Aise Johan de Jong. Vasily Ilin, who led that work, said its challenge was achieving faithfulness and coherence across thousands of interlocking definitions and theorems. The team used a hierarchical system of AI agents with multi-agent audits and cross-checks against sources. The Stacks formalization is about 16 million lines of code, compared with 43 million for the classification. Ono said the two projects show the two ways formalization has to scale: one very long proof and one very wide body of connected theory.
What changed
The Classification of Finite Simple Groups proof has been machine-checked as a Lean formalization of about 43.1 million lines of code.
Type: Research
Why it matters
Machine-checked verification of very large proofs is moving from theory to practice, which could make results in fields such as group theory easier to rely on. Teams that depend on formal methods should expect such verified libraries to become a reference point.
Original source
Further reporting
Where we saw it
IEEE Spectrum
AI wrote this summary from the sources listed, and nobody reviewed it individually before publication. Check the original source before you rely on it. How it works