Classification of Finite Simple Groups Formalized in Lean

Hacker News Top Papers

Summary

A complete formalization of the Classification of Finite Simple Groups in Lean 4, with every logical step checked by Lean's kernel, spanning 43.1M lines of Lean and following the first-generation proof. Along the way, the team discovered an issue in a published argument for the Unbalanced Group Theorem and devised an alternative route.

No content available
Original Article
View Cached Full Text

Cached at: 10/28/26, 01:47 AM

# The Classification of Finite Simple Groups, formalized in Lean Source: [https://cfsg.axiommath.ai/](https://cfsg.axiommath.ai/) The classification of finite simple groups is 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\. It shows that every finite simple group is cyclic of prime order, alternating, of Lie type, or one of 26 sporadic groups\. Here we present a complete formalization in Lean following the first\-generation proof, with every logical step checked by Lean’s kernel\. Along the way, we found an issue in a published argument for the Unbalanced Group Theorem\.[The accompanying paper](https://cfsg.axiommath.ai/papers)explains the issue and the alternative route used in our proof\.[Our blog post](https://axiommath.ai/research/the-enormous-theorem-formalized/)tells the full story\. Lines of Lean43\.1MDeclarations2\.05MMilestones100Papers and books715Core contributorsDean Cureton\*†, Vasily Ilin†, Bhavik Mehta\*†, Niels Voss† Other contributorsRafael Cabral†, Colin Defant\*, Erik Gregory†, Aaron Hill†, Letong Hong◇, Qinheping Hu†, Dustin Jamner†, Albert Jiang†, Tadeusz Jordan†, Andranik Kurghinyan†, Kenny Lau\*†, Jonathan Laurent†, David Liang†, Jannis Limperg†, Simon Mahns†, Brian Nugent\*, Connor Olson†, Ken Ono\*, Eric Paul†, Dhruv Rajan†, Karun Ram†, Charlie Ray†, Ho Chung Siu†, Ashvin A\. Swaminathan\*†, Jesse Thorner\*, Aleksey Tsaplin†, Chenkai Wang† \*Mathematical contributors†Engineering contributors◇Principal investigator ### Cite this work ``` @misc{axiom-cfsg, author = {Cureton, Dean and Ilin, Vasily and Mehta, Bhavik and Voss, Niels and Cabral, Rafael and Defant, Colin and Gregory, Erik and Hill, Aaron and Hong, Letong and Hu, Qinheping and Jamner, Dustin and Jiang, Albert and Jordan, Tadeusz and Kurghinyan, Andranik and Lau, Kenny and Laurent, Jonathan and Liang, David and Limperg, Jannis and Mahns, Simon and Nugent, Brian and Olson, Connor and Ono, Ken and Paul, Eric and Rajan, Dhruv and Ram, Karun and Ray, Charlie and Siu, Ho Chung and Swaminathan, Ashvin A. and Thorner, Jesse and Tsaplin, Aleksey and Wang, Chenkai}, title = {Lean formalization of the classification of finite simple groups}, year = {2026}, howpublished = {\url{https://github.com/AxiomMath/CFSG}}, note = {Interactive proof map at \url{https://cfsg.axiommath.ai}} } ``` This is the Agent Blueprint, the initial blueprint we gave the agents\. For the Lean code itself, see the[Lean Repo](https://cfsg.axiommath.ai/#) ### The corpus*139 source works* 18701950197019902026 Each block is a paper or book, sized by the statements it supplies\. Hover to find its statements\. ### Milestones*108*

Similar Articles

Formalizing the Enormous Theorem (27 minute read)

TLDR AI

Axiom Math released the first complete computer-checked proof of the Classification of Finite Simple Groups in Lean, using swarms of dozens of AI agents over 24 days to produce ~43.1 million lines of code, while also surfacing 34 deviations from the published record and a new result in group theory.

Combinatorial Games in Lean

Hacker News Top

A formalization of combinatorial game theory in Lean 4, covering games, nimbers, and surreal numbers, based on Conway's work.

Formalizing statistical learning theory in Lean 4 [R]

Reddit r/MachineLearning

FormalSLT is a Lean 4 library that formally proves finite-sample statistical learning theory results (ERM, VC bounds, Rademacher bounds, PAC-Bayes, etc.) with explicit assumptions and zero sorry statements, providing a machine-checked foundation for ML theory.

A Formally Verified Library of Mathematical Finance in Lean 4

Hugging Face Daily Papers

This paper describes a formally verified library of mathematical finance in Lean 4, containing over 200 theorems covering measure-theoretic foundations through derivative pricing, and includes a faithfulness audit to classify results by how their Lean statement relates to the claimed mathematics.