{"schema":"postcutoff/event@1","as_of":"2026-11-19T22:11:00+01:00","url":"https://postcutoff.com/e/2026-11-16-axiom-minimal-model-program-fourfolds-lean/","md":"https://postcutoff.com/e/2026-11-16-axiom-minimal-model-program-fourfolds-lean/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-11-16-axiom-minimal-model-program-fourfolds-lean","date":"2026-11-16","date_precision":"day","short_title":"Axiom: fourfold minimal model program in Lean","deck":null,"takeaway":"The AxiomMath/MMP repository (16 Nov) states continuation and termination of the minimal model program for projective log canonical fourfolds with rational boundary in characteristic zero, with no sorry and only Lean's standard axioms. The four-dimensional theorem follows OpenAI's 2026 manuscript; the library includes the cone and contraction theorems and resolution of singularities.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"AxiomMath/MMP: The Minimal Model Program in Lean","url":"https://github.com/AxiomMath/MMP","type":"code","group":"primary","domain":"github.com"},{"n":2,"title":"AxiomMath/Stacks: the Stacks Project in Lean","url":"https://github.com/AxiomMath/Stacks","type":"code","group":"primary","domain":"github.com"}],"official":2,"filed":"2026-11-17","updated":"2026-11-17","orgs":["Axiom","OpenAI"],"title":"Axiom publishes a Lean formalization of the minimal model program for log canonical fourfolds, following OpenAI's termination manuscript; about 2,270 agent-written modules, kernel-checked but not yet reviewed by humans","summary":"On 16 Nov 2026 Axiom (AxiomMath) published github.com/AxiomMath/MMP, \"a Lean 4 (v4.35.0) formalization of the minimal model program for log canonical pairs in dimension at most four\", built on Mathlib and Axiom's Lean Stacks Project. Its main theorem says every maximal MMP program from a projective log canonical fourfold pair with rational boundary over an algebraically closed field of characteristic zero has finitely many birational steps and ends with K + B nef or with a Mori fibre space. \"The four-dimensional theorem follows OpenAI, Termination for projective log canonical fourfolds with rational boundary (2026).\" The README says the roughly 2,270 modules were written by AI agents and \"the code has not yet been reviewed by humans\". No announcement post found by 17 Nov.","key_facts":["Main theorem (README): MMP.Fourfold.Program.IsMaximal.isNefOnCurves_or_isMoriFibreSpace; continuation (every (K+B)-negative extremal ray has a contraction and a permitted next step) and termination (finitely many birational steps); 'Neither ℚ-factoriality nor pseudo-effectivity of K + B is assumed'","Also proved: the relative MMP for ℚ-factorial dlt pairs of dimension at most three over ℂ (MMP.Fourfold.projectiveLowerLogMMP_three)","Background formalized (README): cone and contraction theorems, Kawamata–Viehweg vanishing, basepoint-free theorem, resolution of singularities in characteristic zero, klt/plt/dlt/lc singularities, construction of flips, Borel–Moore homology, cycle class map, GAGA for projective schemes","Checks: 'There is no sorry, no native_decide and no added axiom'; #print axioms lists propext, Classical.choice, Quot.sound","Caveat (README, verbatim): 'about 2,270 modules written by AI agents. Every proof is kernel-checked; the code has not yet been reviewed by humans'","Source of the mathematics: OpenAI's termination manuscript (openai/math family 056, entry 2026-10-06-openai-log-abundance-nonvanishing-claim); classical background from Kollár–Mori and Flips and Abundance for Algebraic Threefolds"],"key_numbers":[],"tags":["math","algebraic-geometry","birational-geometry","minimal-model-program","lean","formalization","axiom","openai","agents"],"science":{"field":"mathematics","subfield":"birational geometry","problem":"Termination of the minimal model program for log canonical fourfolds","result":"Lean formalization of continuation and termination of the MMP for projective lc fourfolds with rational boundary in characteristic zero, following OpenAI's manuscript","open_since":"","ai_system":["Axiom agents","OpenAI internal model (manuscript)"],"human_role":"Library written by AI agents; humans have not yet reviewed the code","verification":{"key":"lean","label":"Lean-verified","text":"Formal proof in Lean (kernel-checked; statements not yet human-reviewed)"},"status":"pending","shock":""},"body_md":"## What happened\n\nAxiom, which released Lean formalizations of the Stacks Project (4 Nov) and the Weil conjectures (6 Nov), pushed a repository\nformalizing the minimal model program up to dimension four. The four-dimensional termination theorem follows one of the\nmanuscripts in OpenAI's October release, so the repository is also the first machine check of that claim.\n\n## Why it matters\n\nTermination of flips for log canonical fourfolds in general was open before OpenAI's claim; earlier results covered special cases. A\nkernel-checked proof turns an unrefereed AI manuscript into a verified theorem, provided the Lean definitions match the usual\nones; that is what the human review the README says has not yet happened would establish.","disputed":[{"label":"Verification","text":"Formal proof in Lean (kernel-checked; statements not yet human-reviewed)","sources":[]}],"related":[{"id":"2026-11-17-ai-assisted-results-november-17-listing","url":"https://postcutoff.com/e/2026-11-17-ai-assisted-results-november-17-listing/","date":"2026-11-17","date_precision":"day","short_title":"AI-assisted results, 17 Nov","deck":null,"takeaway":"The sweep listed 407 arXiv papers with AI statements (262 new on 17 Nov), 82 conjecture papers without one, 72 Hexagon works, 17 result-repo commits and 4 watched repos. Every line was read; PDFs were checked at the AI statement. Eight results got their own entries, five existing entries were extended, and 127 arXiv papers and 44 Hexagon works where AI supplied proofs, constructions, code or Lean are listed here. All are unrefereed.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"partly","labels":["Partly confirmed"]},"sources":9,"official":9,"filed":"2026-11-17","updated":"2026-11-17","orgs":["OpenAI","Anthropic","Google","Axiom","various researchers"]},{"id":"2026-11-06-axiom-weil-conjectures-lean-formalization","url":"https://postcutoff.com/e/2026-11-06-axiom-weil-conjectures-lean-formalization/","date":"2026-11-06","date_precision":"day","short_title":"Axiom: the Weil conjectures proved in Lean","deck":null,"takeaway":"On 6 Nov 2026 Axiom Math published AxiomMath/Weil, a kernel-checked Lean 4 proof of rationality, the functional equation, the Riemann hypothesis (Deligne) and the Betti-number statement, following Freitag–Kiehl. About 980 modules were written by AI agents; the code has not been reviewed by humans.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":3,"official":3,"filed":"2026-11-07","updated":"2026-11-08","orgs":["Axiom Math"]},{"id":"2026-11-04-axiom-stacks-project-lean-formalization","url":"https://postcutoff.com/e/2026-11-04-axiom-stacks-project-lean-formalization/","date":"2026-11-04","date_precision":"day","short_title":"Axiom: the Stacks Project formalized in Lean","deck":null,"takeaway":"On 4 Nov 2026 Axiom Math released AxiomMath/Stacks, a Lean 4 formalization of 'every tag of the Stacks Project with formalizable content' (about 63,000 modules), with an agent-written StacksFrontier tier and a human-reviewed StacksCore tier. Axiom's X post had 6.9M views.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":4,"official":3,"filed":"2026-11-07","updated":"2026-11-09","orgs":["Axiom Math"]},{"id":"2026-10-06-openai-log-abundance-nonvanishing-claim","url":"https://postcutoff.com/e/2026-10-06-openai-log-abundance-nonvanishing-claim/","date":"2026-10-06","date_precision":"day","short_title":"OpenAI claims the abundance conjecture; Jihao Liu raises priority","deck":null,"takeaway":"A manuscript in OpenAI's 6 Oct 2026 math release, 'Log abundance in characteristic zero' (dated 24 Sept), claims the log abundance conjecture in every dimension in characteristic zero, and with it canonical nonvanishing for smooth projective varieties. Both are central open problems of the minimal model program, proved only up to dimension three. Companion papers claim Iitaka's subadditivity conjecture and related results. On 7 Oct Jihao Liu (Peking University) submitted a human-led proof that nonvanishing implies abundance. arXiv announced it only on 28 Oct. His comment line says he was 'forced to submit here due to an announcement of the proof of the abundance conjecture by OpenAI'. In a remark he suggests that an earlier draft, sent to 'codex chat' before July 2026, may have fed OpenAI's work. No birational geometer has assessed the claims publicly, there is no Lean proof, and OpenAI has not responded.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":8,"official":5,"filed":"2026-10-29","updated":"2026-10-29","orgs":["OpenAI","Peking University"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-11-17","type":"filed","text":"Created (science agent; README read)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-11-17","run":null,"sources_read":"Science agent; README read","updated":"2026-11-17","human_review":null,"version":{"date":"2026-11-17"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":169,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":139,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":230,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":169,"in_training_data":false}],"short_url":"https://postcutoff.com/s/axiom-fourfold-minimal-program"}