conv.

All stories
ScienceQuiet 11d · day 12

Finite Simple Groups Classification Formalized in Lean, Gaps Found

A complete formalization of one of mathematics' greatest proofs uncovers errors in the original literature.

What to know

  • A complete formal proof in Lean of the classification of finite simple groups—a landmark 1,000+ page proof by ~100 mathematicians over decades—has been released with every step verified by Lean's kernel.
  • The formalization process discovered a gap in the published proof of the Unbalanced Group Theorem; researchers developed an alternative argument and are compiling errata with mathematicians.
  • The project used AI agents to extract and integrate formalization from over 500 sources, facing challenges in reconciling multiple formalizations of the same informal concepts.

The dispute Whether complete automated formalization of all mathematical literature is practical given the combinatorial explosion of equivalent formalizations for the same concepts, or whether curated human-guided assembly is necessary. · positions read across 17 posts and comments

many voices

This is valuable work filling documented gaps, showing what AI should be used for rather than rushing novel research.

  • “Note they found one gap (and filled it) in the previously accepted 1,000+ page proof. So that's pretty cool.”

    vessenes · Hacker News ↗
some voices

Formalization at scale faces real challenges in reconciling multiple ways of expressing the same mathematical concepts.

  • “One challenge is assembling everything into a coherent whole, since the same informal concept can be formalised in slightly different but incompatible ways.”

    jonath_laurent · Hacker News ↗
some voices

Large-scale automated formalization of all math textbooks may be feasible with frontier models but remains uncertain in practice.

  • “Out of curiosity: is it possible to take a frontier model and just let it loose on all math textbooks out there, converting each and every proof/theorem/lemma/etc. into Lean?”

    mlmonkey · Hacker News ↗

Dean Cureton Core contributor to Lean formalizationVasily Ilin Core contributor to Lean formalizationBhavik Mehta Core contributor to Lean formalizationNiels Voss Core contributor to Lean formalizationAxiom MTS Organization leading the formalization project

How it unfolded 2 developments, newest first · click a bar or a number to jump articlespostscomments

Peak 8 pieces in 3h at Oct 27, 11 AM; 20 pieces over 12 days (1 article · 2 posts · 17 comments) Oct 27, 11 AM — 8 pieces · 1 article · 1 post · 6 comments — Hacker News 7, Newswires 1Oct 27, 2 PM — 3 pieces · 3 comments — Hacker News 3Oct 27, 5 PM — 5 pieces · 5 comments — Hacker News 5Oct 27, 8 PM — quietOct 27, 11 PM — quietOct 28, 2 AM — 1 piece · 1 post — Mastodon 1Oct 28, 5 AM — 1 piece · 1 comment — Hacker News 1Oct 28, 8 AM — 1 piece · 1 comment — Hacker News 1Oct 28, 11 AM — 1 piece · 1 comment — Hacker News 1Oct 28, 2 PM — quietOct 28, 5 PM — quietOct 28, 8 PM — quietOct 28, 11 PM — quietOct 29, 2 AM — quietOct 29, 5 AM — quietOct 29, 8 AM — quietOct 29, 11 AM — quietOct 29, 2 PM — quietOct 29, 5 PM — quietOct 29, 8 PM — quietOct 29, 11 PM — quietOct 30, 2 AM — quietOct 30, 5 AM — quietOct 30, 8 AM — quietOct 30, 11 AM — quietOct 30, 2 PM — quietOct 30, 5 PM — quietOct 30, 8 PM — quietOct 30, 11 PM — quietOct 31, 2 AM — quietOct 31, 5 AM — quietOct 31, 8 AM — quietOct 31, 11 AM — quietOct 31, 2 PM — quietOct 31, 5 PM — quietOct 31, 8 PM — quietOct 31, 11 PM — quietNov 1, 1 AM — quietNov 1, 4 AM — quietNov 1, 7 AM — quietNov 1, 10 AM — quietNov 1, 1 PM — quietNov 1, 4 PM — quietNov 1, 7 PM — quietNov 1, 10 PM — quietNov 2, 1 AM — quietNov 2, 4 AM — quietNov 2, 7 AM — quietNov 2, 10 AM — quietNov 2, 1 PM — quietNov 2, 4 PM — quietNov 2, 7 PM — quietNov 2, 10 PM — quietNov 3, 1 AM — quietNov 3, 4 AM — quietNov 3, 7 AM — quietNov 3, 10 AM — quietNov 3, 1 PM — quietNov 3, 4 PM — quietNov 3, 7 PM — quietNov 3, 10 PM — quietNov 4, 1 AM — quietNov 4, 4 AM — quietNov 4, 7 AM — quietNov 4, 10 AM — quietNov 4, 1 PM — quietNov 4, 4 PM — quietNov 4, 7 PM — quietNov 4, 10 PM — quietNov 5, 1 AM — quietNov 5, 4 AM — quietNov 5, 7 AM — quietNov 5, 10 AM — quietNov 5, 1 PM — quietNov 5, 4 PM — quietNov 5, 7 PM — quietNov 5, 10 PM — quietNov 6, 1 AM — quietNov 6, 4 AM — quietNov 6, 7 AM — quietNov 6, 10 AM — quietNov 6, 1 PM — quietNov 6, 4 PM — quietNov 6, 7 PM — quietNov 6, 10 PM — quietYesterday, 1 AM — quietYesterday, 4 AM — quietYesterday, 7 AM — quietYesterday, 10 AM — quietYesterday, 1 PM — quietYesterday, 4 PM — quietYesterday, 7 PM — quietYesterday, 10 PM — quietToday, 1 AM — quietToday, 4 AM — quietToday, 7 AM — quietToday, 10 AM — quiet 1–2
Oct 28Oct 29Oct 30Oct 31Nov 1Nov 2Nov 3Nov 4Nov 5Nov 6now · 12:38 PM ET
  1. 2

    Researcher describes use of swarm of AI agents to assemble formalization from 500+ sources

    Jonath Laurent from Axiom MTS explains that the formalization was approached using agents tasked with processing sources scattered across more than 500 articles and books. A key challenge was assembling everything into a coherent whole, since the same informal concept can be formalized in slightly different but incompatible ways.

    “What you describe is pretty close to how we formalised this proof, which is scattered across more than 500 articles and books: a swarm of agents was tasked with going through all these sources.”
    — jonath_laurent
    • we are moving forward steadily :) https://github.com/marcinjangrzybowski/cubical-bis/blob/inte... (see table in the middle of doc) mind, that it is fully constructive implementation, you can get arbitrary precision aproximation to every real expression. for now WIP, but soon will be aviable in cubical-library :) also our related TYPES2026…

      m_j_gHacker News11d agoview on Hacker News ↗
    2 more of the top 3 · 15 posts in this stretch
    • _If_ you have formalized a provable theorem in Lean, a simple bread-first search can prove it. It will take lots (and lots, and lots, and lots…) of time, though (https://en.wikipedia.org/wiki/General_Problem_Solver).LLMs can do smarter searches, and will likely find proofs for most of them, but are not guaranteed to find a proof.

      SomeoneHacker News11d agoview on Hacker News ↗
    • Groups were my gateway drug into abstract algebra. A friend clued me into symmetry being everywhere and Groups are how symmetry is formalized, and it’s been a crazy journey understanding all that. The frontier models can tie those abstract concepts to plain English examples and answer questions decently well, it’s never been a better time to pick…

      compacct27Hacker News11d agoview on Hacker News ↗
    all of them →
  2. 1

    Formalization process uncovers error in published Unbalanced Group Theorem proof

    While formalizing the first-generation proof, the team found counterexamples to a closure assertion used in a published route to the Unbalanced Group Theorem. They developed an alternative argument using Solomon's 1976 theory of maximal 2-components, with Theorem 2.3 on preservation of simple tops as the key step.

    “While formalizing the first-generation proof, we found counterexamples to a closure assertion used in a published route to the Unbalanced Group Theorem.”
    — Axiom MTS / cfsg.axiommath.ai
    • Out of curiosity: is it possible to take a frontier model and just let it loose on all math textbooks out there, converting each and every proof/theorem/lemma/etc. into Lean? A frontier model should be able to do that, right? And it's a one-time task: do it once and it's there for eternity, available as a library to be used in other proofs.Maybe…

      mlmonkeyHacker News12d agoview on Hacker News ↗
    1 more of the top 2 · 2 posts in this stretch
    • This seems like a very good use of auto-formalization, because in the past mathematicians have incorrectly believed that they were finished with the classification only discover a missing class/sporadic group.The original proof was a collaboration of ~100 mathematicians, if Tao is correct then we should expect to see more such collaborations in…

      sebzim4500Hacker News12d agoview on Hacker News ↗
    all of them →
  3. background

    Complete Lean formalization of finite simple groups classification released — A team led by Dean Cureton, Vasily Ilin, Bhavik Mehta, and Niels Voss, with 26 other contributors, publicly releases a fully formalized Lean proof of the classification of finite simple groups. Every logical step is checked by Lean's kernel, covering all cases: cyclic of prime order, alternating, Lie type, and 26 sporadic groups.

What people are saying 12 voices from 1 site · best of 17 · verbatim

Still unanswered
  • Can frontier AI models realistically formalize all mathematics textbooks at scale, or does the problem of multiple incompatible formalizations of the same concept make this intractable?
  • How many other gaps or errors might exist in other major formalized proofs?