Post-Cutoff.com
  1. Home
  2. Timeline
  3. 2026
  4. Perelman's proof of the Poincaré conjecture formalised in…

Perelman's proof of the Poincaré conjecture formalised in Lean, with AI-generated code (Chow, Qin, Liao, Khaitan)

★★★★after cutoffscienceUC San DiegoCornell UniversityPrinceton Universityconfidence: medium

On Sept 27, 2026 Ziyang Qin, Yuan Liao, Ayush Khaitan and Ricci-flow expert Bennett Chow posted a Lean 4 formalization of the Hamilton–Perelman proof of the 3D Poincaré conjecture. Via the Moise smoothing theorem it covers both the smooth and the topological versions, and it proves the statement Mathlib had marked `proof_wanted`. The axiom check shows no `sorry` and no project axioms. The paper says "automated assistance was used for proofs and prose". Secondary reports say about 2.7M of 4.7M Lean lines were produced in the last two weeks with ChatGPT/Codex and Claude. It is the first machine-checked proof of a solved Millennium Prize problem.

Key facts

Science result

Field
mathematics / geometric topology / Ricci flow / formal verification
Problem
Formal verification of the Poincaré conjecture (Clay Millennium Prize problem, solved by Perelman 2002–03) (open since 1904)
Result
Complete Lean 4 formalization of the smooth and topological 3D Poincaré conjecture via Ricci flow with surgery, with no sorry or extra axioms.
AI system
Codex, ChatGPT (GPT-6 Astra, reported), Claude (Fable 5.1, reported)
Human role
Human-led (Chow's group) with heavy AI code generation; the paper discloses automated assistance for proofs and prose
Verification
Formal proof in Lean (kernel-checked; definitions still need human review)
Status
pending
Why surprising
A proof once considered among the hardest to check, which took experts years to verify, was machine-checked within months by a four-person team leaning on AI coding agents.

What happened

Bennett Chow (UCSD), a leading Ricci-flow researcher, and three younger collaborators released a Lean 4 library that formalizes the whole Hamilton–Perelman proof: short-time existence via DeTurck, singularity analysis, surgery and finite-time extinction. With the Moise smoothing theorem it yields the topological Poincaré conjecture. The paper is short (it points to the code) and includes axiom-check commands that anyone can rerun.

The paper discloses AI help in one sentence. The scale (millions of lines in months) and the model names come from secondary reports, and confidence is medium until the authors or the labs confirm them.

Why it matters

After Fermat's Last Theorem (Claude, Sept 2026), this is the second landmark formalization of a famous proof in a month. Perelman's proof needed years of expert refereeing in 2003–06. A kernel-checked version suggests that AI-generated Lean at scale now reaches the hardest parts of geometric analysis. Experts still have to check that the Lean definitions match the mathematics.

Changelog

  • 2026-10-01: created (leads run, 07:40 completion)

Related events

  1. Claude produces the first complete machine-checked proof of Fermat's Last Theorem in Lean, in 11 days ★★★★★
  2. Math Inc's Gauss formalises Viazovska's sphere-packing proofs in dimensions 8 and 24, fixing errors in the originals ★★★★
  3. Lean Pool: an AI-maintained archive of Lean formalizations grows past 3 million lines ★★
  4. OpenAI claims a Millennium Prize problem: 10,000 AI agents prove forced Navier–Stokes blow-up; priority dispute erupts ★★★★★
  5. Mistral releases Leanstral 1.5, an open-weights Lean 4 proof agent that saturates miniF2F and solves 587/672 PutnamBench problems ★★★

Sources (6)

id: 2026-09-27-poincare-conjecture-lean-formalization · updated 2026-10-01 · open in the interactive timeline