{"schema":"postcutoff/event@1","as_of":"2026-10-12T07:22:00+02:00","url":"https://postcutoff.com/e/2026-10-09-geometrization-conjecture-lean-formalization/","md":"https://postcutoff.com/e/2026-10-09-geometrization-conjecture-lean-formalization/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"Adam Bicz","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-10-09-geometrization-conjecture-lean-formalization","date":"2026-10-09","date_precision":"day","short_title":"Thurston's geometrization conjecture formalised in Lean","deck":"The Hamilton–Perelman proof machine-checked with GPT-6, Claude and DeepSeek agents (Chow's group)","takeaway":"Twelve days after the Poincaré conjecture, the same group machine-checked the full geometrization theorem, the result Perelman actually proved. The paper names the models: GPT-6 Astra reviews, and GPT-6 Luna, Sol, Astra, Claude Opus 5.5 and DeepSeek V4.1 Flash build.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2610.13897: A Lean Formalization of the Hamilton–Perelman Proof of Thurston's Geometrization Conjecture","url":"https://arxiv.org/abs/2610.13897","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"GitHub: qinz1yang/differential-geometry (release v0.1.5 preview)","url":"https://github.com/qinz1yang/differential-geometry/releases/tag/v0.1.5","type":"code","group":"primary","domain":"github.com"},{"n":3,"title":"Humanize RLAR workflow (humanfia.ai)","url":"https://humanfia.ai/flows/rlar","type":"docs","group":"primary","domain":"humanfia.ai"},{"n":4,"title":"arXiv 2609.33842: the group's Poincaré conjecture formalization","url":"https://arxiv.org/abs/2609.33842","type":"paper","group":"primary","domain":"arxiv.org"}],"official":4,"filed":"2026-10-12","updated":"2026-10-12","orgs":["UC San Diego","Cornell University","Princeton University","Tsinghua University","Amazon AGI","NVIDIA Research","University of Oregon"],"title":"Thurston's geometrization conjecture formalised in Lean: the Hamilton–Perelman proof machine-checked with GPT-6, Claude and DeepSeek agents (Chow's group)","summary":"On 9 Oct 2026 Yuan Liao, Ziyang Qin, Jui-Hui Chung, Ayush Khaitan, Zhengyang Zhang, Hongzhou Lin, Zijian Zhang, Ligeng Zhu, Peng Lu and Bennett Chow posted arXiv 2610.13897, a Lean 4 formalization of the Hamilton–Perelman Ricci-flow proof of Thurston's geometrization conjecture (posed 1982, proved by Perelman in 2003). The Lean endpoint `GC.Endpoint.geometrization` depends only on Lean's three standard axioms, with no `sorry`. The formalization was written by AI agents in the \"Humanize\" builder–reviewer workflow: \"We use GPT-6-Astra as the reviewer\", and builders were chosen among GPT-6 Luna, GPT-6 Sol, GPT-6 Astra, Claude Opus 5.5 and DeepSeek V4.1 Flash. It extends the group's Poincaré formalization of 27 Sept 2026.","key_facts":["Paper: 'A Lean Formalization of the Hamilton–Perelman Proof of Thurston's Geometrization Conjecture', arXiv 2610.13897 [math.DG], 9 Oct 2026; Yuan Liao and Ziyang Qin contributed equally. Affiliations: UC San Diego, Cornell, Princeton AI (Princeton University), Tsinghua University, Amazon AGI, NVIDIA Research, University of Oregon","Theorem formalized: every connected, closed, oriented smooth three-manifold is a connected sum of prime manifolds; each prime factor contains finitely many disjoint, smoothly embedded incompressible tori, and the interior of every piece cut along them carries a complete metric locally isometric to one of the eight Thurston geometries (finite volume in the hyperbolic case)","Scope stated by the authors: the statement 'does not require the cutting tori to form the canonical JSJ family', does not require the family to be minimal and makes 'no uniqueness assertion'; the prime convention allows S³ as a factor","Verification (paper): 'successful endpoint and complete-library builds, a separate consumer of the expanded public statement, and transitive axiom checks'; the four public declarations yield the same axiom set '[propext, Classical.choice, Quot.sound]' and 'contain neither sorryAx nor a project-specific axiom'. The authors add that the 'mathematical interpretation also requires review of the definitions and hypotheses'","AI role (Section 3, 'Agent-assisted formalization with Humanize'): the Humanize RLAR workflow ('Ralph Loop with Agentic Review') separates a builder agent from an independent reviewer. 'We use GPT-6-Astra as the reviewer. For the builder, we choose among GPT-6-Luna, GPT-6-Sol, GPT-6-Astra, Claude-Opus-5.5, and DeepSeek-V4.1-Flash based on their observed generation speed in tokens per second (TPS).' 'Human authors remain responsible for the intended theorem statements, the mathematical interpretation of the formalization, and the final verification claims.'","Mathematical route: Hamilton's Ricci-flow program and Perelman's completion, following Morgan–Tian and Kleiner–Lott; long-time surgery flow, thick-region hyperbolic pieces, the Kleiner–Lott local-collapse argument for graph-manifold pieces, and Hamilton's incompressibility argument (with Mostow–Prasad rigidity). 'A fuller account of the analytic and topological constructions will appear elsewhere.'","Code: github.com/qinz1yang/differential-geometry, release v0.1.5 (preview), published 9 Oct 2026, Lean and Mathlib v4.35.0-rc3, Apache-2.0; the release 'adds Thurston's geometrization conjecture for closed, connected, oriented smooth three-manifolds, and three-dimensional Mostow–Prasad rigidity'. The repository had 74 stars on 12 Oct 2026","Reused sources (paper): the group's Poincaré development, parts of Armstrong and Kempe's DeGiorgi library, Jordan–Schönflies, Classification of Compact Surfaces, Tau Ceti and a canonical-topology development","Funding and access: Khaitan acknowledges the DARPA expMath program; Chow thanks OpenAI 'for providing access to OpenAI models through the ChatGPT for Academic Researchers program'","Not stated in the paper: line counts, cost or time taken. Not found as of 12 Oct 2026: independent re-checks, expert reactions, press or a Hacker News thread"],"key_numbers":[],"tags":["math","lean","formalization","geometrization-conjecture","ricci-flow","thurston","perelman","gpt-6-astra","claude-opus-5-5","deepseek","humanize"],"science":{"field":"mathematics","subfield":"geometric topology / Ricci flow / formal verification","problem":"Formal verification of Thurston's geometrization conjecture (posed 1982; proved by Perelman 2003 via Hamilton's Ricci flow)","result":"Lean 4 formalization of the geometrization theorem for closed, connected, oriented smooth three-manifolds (prime decomposition, incompressible torus cuts, Thurston-geometric pieces), with no sorry and only the three standard axioms.","open_since":"1982","ai_system":["GPT-6 Astra","GPT-6 Luna","GPT-6 Sol","Claude Opus 5.5","DeepSeek V4.1 Flash","Humanize"],"human_role":"Human-led: the authors set the theorem statements and the plan; AI builder agents wrote the Lean code and a GPT-6 Astra reviewer agent checked each round","verification":{"key":"lean-unreviewed","label":"Lean proof, not yet reviewed","text":"Formal proof in Lean (kernel-checked, axiom closure reported by the authors); definitions and statement still need independent human review; unrefereed preprint"},"status":"pending","shock":"Geometrization took the community years to check after 2003; the formalization was posted 12 days after the same group's Poincaré formalization.","short":"Geometrization conjecture in Lean","kind":"formalization"},"body_md":"## What happened\n\nThurston's geometrization conjecture says every closed three-manifold can be cut into pieces that each carry one of eight\nstandard geometries. It contains the Poincaré conjecture as a special case. Grigori Perelman proved it in 2002–03 by completing\nRichard Hamilton's Ricci-flow program, and it took several teams years to write out and check the details.\n\nOn 27 Sept 2026 Bennett Chow's group published a Lean formalization of the Poincaré case. On 9 Oct the group, now ten authors\nincluding researchers at Amazon AGI and NVIDIA Research, posted the full geometrization theorem. The Poincaré case needs only\nfinite-time extinction of the flow. Geometrization needs the flow with surgery for all time, the analysis of the thick\n(hyperbolic) and thin (collapsed) parts, and a proof that the cutting tori are incompressible. The short paper reproduces the\nLean statement, explains its exact scope and lists the checks performed.\n\nThe Lean code was produced with Humanize, a workflow in which a builder agent writes code in rounds and a separate reviewer agent\nchecks progress against the plan. The paper names the models, which the Poincaré paper had not done: GPT-6 Astra reviewed, and the\nbuilder was chosen among GPT-6 Luna, GPT-6 Sol, GPT-6 Astra, Claude Opus 5.5 and DeepSeek V4.1 Flash by generation speed.\n\n## Why it matters\n\nIt is one of the deepest theorems of modern geometry, and the proof is far longer than anything formalized before 2026. The paper\nis also a data point on method: the proof ideas are human and decades old, but the formal text was written by commercial models\nin a builder–reviewer loop. The usual caveat applies. The Lean kernel guarantees the proof of the stated theorem; people still\nhave to confirm that the definitions and the statement say what mathematicians mean. The authors say so themselves, and their\nstatement is weaker than the textbook one in stated ways (no canonical JSJ family, no uniqueness).","disputed":[{"label":"Verification","text":"Formal proof in Lean (kernel-checked, axiom closure reported by the authors); definitions and statement still need independent human review; unrefereed preprint","sources":[]}],"related":[{"id":"2026-10-09-tao-math-2-0-caltech-lecture","url":"https://postcutoff.com/e/2026-10-09-tao-math-2-0-caltech-lecture/","date":"2026-10-09","date_precision":"day","short_title":"Terence Tao's Caltech lecture 'Math 2.0'","deck":"AI has ended 'proof scarcity', and blind problem-solving is now 'actively harmful' to mathematics","takeaway":"Tao is the mathematician most often cited on AI and maths, and this is his fullest public statement after OpenAI's release.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":7,"official":4,"filed":"2026-10-10","updated":"2026-10-10","orgs":["UCLA","Caltech"]},{"id":"2026-10-06-eleven-square-packing-optimality-lean","url":"https://postcutoff.com/e/2026-10-06-eleven-square-packing-optimality-lean/","date":"2026-10-06","date_precision":"day","short_title":"Walter Trump's 1979 packing of 11 unit squares proved optimal, with a full Lean verification (AI involvement reported, unconfirmed)","deck":null,"takeaway":"It settles a well-known open case in packing theory, widely known from xkcd.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":6,"official":5,"filed":"2026-10-07","updated":"2026-10-07","orgs":["Open-source community"]},{"id":"2026-09-27-poincare-conjecture-lean-formalization","url":"https://postcutoff.com/e/2026-09-27-poincare-conjecture-lean-formalization/","date":"2026-09-27","date_precision":"day","short_title":"Perelman's proof of the Poincaré conjecture formalised in Lean, with AI-generated code","deck":null,"takeaway":"After Fermat's Last Theorem (Claude, Sept 2026), this is the second landmark formalization of a famous proof in a month.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":8,"official":6,"filed":"2026-10-01","updated":"2026-10-12","orgs":["UC San Diego","Cornell University","Princeton University"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-12","type":"filed","text":"Created from the arXiv PDF and the GitHub release notes"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-12","run":null,"sources_read":"The arXiv PDF and the GitHub release notes","updated":"2026-10-12","human_review":null,"version":null},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":162,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":101,"in_training_data":false},{"model_id":"gemini-3-8-flash","name":"Gemini 3.8 Flash","cutoff":"2026-03","days_after":192,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":131,"in_training_data":false}],"short_url":"https://postcutoff.com/s/thurston-geometrization"}