Classification of Finite Simple Groups Formalized in Lean
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.
View Cached Full Text
Cached at: 10/28/26, 01:47 AM
Similar Articles
Formalizing the Enormous Theorem (27 minute read)
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
A formalization of combinatorial game theory in Lean 4, covering games, nimbers, and surreal numbers, based on Conway's work.
@sophiamyang: Introducing Leanstral 1.5 A 119B (6B active) open model for formal proof engineering in Lean 4: 100% on miniF2F 587/672…
Introducing Leanstral 1.5, a 119B parameter (6B active) open model for formal proof engineering in Lean 4, achieving 100% on miniF2F, state-of-the-art scores on PutnamBench and FATE benchmarks, and discovering previously unknown bugs in open-source repositories.
Formalizing statistical learning theory in Lean 4 [R]
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
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.