Full Lean Formalization of the Geometrization Conjecture Proof Completed
soumitrashukla9 · x · 2026-10-10
Researchers announce a complete Lean formalization of the Hamilton–Perelman proof of Thurston's Geometrization conjecture, generalizing earlier work that only covered the Poincaré conjecture. Ben, Yuan, Ziyang and the author completed it in collaboration with NVIDIA's Humanfia team, giving three-manifold topology's central theorem a fully machine-verifiable proof.
Related event: Thurston Geometrization Conjecture Fully Formalized in Lean(2 posts)→
More from Research
- Inferring goals from failure: online Bayesian goal inference for boundedly-rational agents — xuanalogue · 2026-10-11
- Alignment researcher points to Rohin Shah's value learning sequence and IRL model misspecification — xuanalogue · 2026-10-11
- Looped LM paper: 1.6B model matches full-cache baseline with 3x smaller KV cache — rupspace · 2026-10-11
- Pure RL discovers superhuman robot strategies in sim, transfers zero-shot to real hardware — KyleMorgenstein · 2026-10-11
- Softmax picks probabilities, cross-entropy picks the target: a 3-class walkthrough — techNmak · 2026-10-11
- PartLLM brings LLM-powered 3D mesh part segmentation to SIGGRAPH Asia with code released — Promptmethus · 2026-10-11