{"schema":"postcutoff/event@1","as_of":"2026-11-19T22:11:00+01:00","url":"https://postcutoff.com/e/2026-11-13-graph-minors-series-lean-formalization-hajiaghayi-jafariraviz/","md":"https://postcutoff.com/e/2026-11-13-graph-minors-series-lean-formalization-hajiaghayi-jafariraviz/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-13-graph-minors-series-lean-formalization-hajiaghayi-jafariraviz","date":"2026-11-13","date_precision":"day","short_title":"Graph Minors series in Lean","deck":null,"takeaway":"A public repo claims a sorry-free Lean 4 proof of every numbered result (838) of Robertson and Seymour's Graph Minors I–XXII, including the graph minor theorem, the structure theorem and the O(n³) disjoint-paths algorithm. The formalization found 30 statement mistakes, 60 proof gaps and 106 places needing a missing argument, none affecting a main result. A sibling repo by the same group (Strong Perfect Graph Theorem) says its Lean code 'was written with AI agents'; the Graph Minors README does not describe its method. Not yet reviewed by others.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"GraphMinor: Lean 4 formalization of Graph Minors I–XXII (GitHub)","url":"https://github.com/mahdi-jfri/GraphMinor","type":"code","group":"primary","domain":"github.com"},{"n":2,"title":"GraphMinorPapers: the papers with corrections marked (GitHub)","url":"https://github.com/hajiaghayi/GraphMinorPapers","type":"code","group":"primary","domain":"github.com"},{"n":3,"title":"StrongPerfectGraphTheorem: complete Lean proof of Chudnovsky–Robertson–Seymour–Thomas (GitHub)","url":"https://github.com/mahdi-jfri/StrongPerfectGraphTheorem","type":"code","group":"primary","domain":"github.com"},{"n":4,"title":"arXiv 2606.31134: Beyond the Library: An Agentic Framework for Autoformalizing Research Mathematics","url":"https://arxiv.org/abs/2606.31134","type":"paper","group":"primary","domain":"arxiv.org"},{"n":5,"title":"Ross Kang on Mathstodon (18 Nov 2026)","url":"https://mathstodon.xyz/@kangmeister/117636746102480305","type":"discussion","group":"reactions","domain":"mathstodon.xyz"}],"official":4,"filed":"2026-11-19","updated":"2026-11-19","orgs":["University of Maryland"],"title":"All 22 Graph Minors papers formalized in Lean: Hajiaghayi and JafariRaviz's repo proves the graph minor theorem and lists 30 false statements in Robertson–Seymour","summary":"github.com/mahdi-jfri/GraphMinor (made public 13 Nov 2026), by MohammadTaghi Hajiaghayi and Mahdi JafariRaviz: a Lean 4 / Mathlib formalization of the whole Graph Minors series (1983–2012), with the graph minor theorem (Wagner's conjecture), the structure theorem for graphs excluding a non-planar minor and the disjoint-paths algorithm stated in Challenge.lean and proved in Solution.lean, checked with comparator, leanchecker and the independent kernel nanoda. It also proves the outside results the papers cite and the surface topology they use. A sibling repo with the Strong Perfect Graph Theorem (5 Nov) states that the code was written by AI agents under the authors' direction, using their 'Beyond the Library' framework (arXiv 2606.31134).","key_facts":["Scope (README): 'Every numbered result of the twenty-two papers, 838 in all, has a Lean proof. No proof assumes a result that is not itself proved in the library, and the library uses only Lean's standard axioms'","Errors found: '30 statement mistakes (results or claims that are false as printed), 14 degenerate cases …, 60 proof gaps and 119 misprints. None of them changes a main result of the series'; in 106 places the Lean proof 'needed an argument that the paper does not give'; corrections are in corrections/ and marked copies of the papers in github.com/hajiaghayi/GraphMinorPapers","Also proved: Menger, Kruskal's tree theorem, Higman's lemma, Mader, Wagner's K5 theorem (new proof), Thomason's minor bound for every p ≥ 1 (Thomason gave 2.68 only for large p), the Jordan curve and Schoenflies theorems and the classification of compact surfaces with boundary; Shiloach's two-paths algorithm replaced by a new O(nm) crossing extractor and a linear-time planarity test","Checks: comparator (statement match, axioms propext, Classical.choice, Quot.sound only), leanchecker --fresh, nanoda; no sorry, axiom, native_decide or unsafe outside the challenge files; full build about 40 minutes","How it was made: the GraphMinor README is silent; the group's Strong Perfect Graph Theorem repo (Soltani Moakhar, Gholami, Springer, JafariRaviz, Hajiaghayi; 5 Nov) says 'The Lean code was written with AI agents, under the direction of the authors' and 'No human expert has yet reviewed the whole library line by line'","Reaction: Ross Kang on Mathstodon (18 Nov) was 'disturbed at the lack of openness and clarity on the methods used' but found it 'astonishing that this kind of foundational consolidation … is now a reality, at a previously unimaginable scale'","Same author, same week: Hajiaghayi's sixth-power excluded grid theorem with a Lean companion (2026-11-12 entry)"],"key_numbers":[],"tags":["math","graph-theory","graph-minors","lean","formalization","autoformalization","ai-agents"],"science":{"field":"mathematics","subfield":"graph theory (graph minors), formal verification","problem":"Machine-checked proof of the Robertson–Seymour Graph Minors series (graph minor theorem, structure theorem, disjoint paths algorithm)","result":"Claimed complete, sorry-free Lean 4 formalization of all 838 numbered results, with 30 false-as-printed statements and 60 proof gaps corrected","open_since":"","ai_system":["AI agents (unnamed)"],"human_role":"Authors directed the project; the sibling repo states the Lean code was written by AI agents in the authors' framework; method not stated in the GraphMinor README","verification":{"key":"lean-unreviewed","label":"Lean proof, not yet reviewed","text":"Lean kernel, leanchecker and nanoda as reported by the authors; no independent human review of the library yet"},"status":"pending","shock":"The series spans twenty-two papers published between 1983 and 2012; a full machine check of it had not been reported before."},"body_md":"## What happened\n\nOn 13 November 2026 a repository by MohammadTaghi Hajiaghayi (University of Maryland) and Mahdi JafariRaviz appeared on GitHub\nwith a Lean 4 formalization of Robertson and Seymour's Graph Minors series. It states the three main theorems in a short challenge\nfile and proves them, together with every numbered result of the twenty-two papers and the external results they cite. A\ncompanion folder documents each correction; a second repo holds copies of the papers with the corrections marked. The project was\nfound on 19 November through a Mathstodon post by the combinatorialist Ross Kang, not through any announcement.\n\nThe same group had posted a complete Lean proof of the Strong Perfect Graph Theorem on 5 November, whose README says the Lean code\nwas written by AI agents and that no human expert has reviewed the whole library line by line.\n\n## Why it matters\n\nIf it holds up, it is one of the largest formalizations of research mathematics so far, and the error count gives a concrete\npicture of how many printed statements in a celebrated series are slightly wrong. The proofs are machine-checked, so trust rests\non the challenge statements matching the theorems; the open questions are about that match and about method, which the main\nREADME does not describe.","disputed":[{"label":"Verification","text":"Lean kernel, leanchecker and nanoda as reported by the authors; no independent human review of the library yet","sources":[]}],"related":[{"id":"2026-11-19-ai-assisted-results-november-19-listing","url":"https://postcutoff.com/e/2026-11-19-ai-assisted-results-november-19-listing/","date":"2026-11-19","date_precision":"day","short_title":"AI-assisted results, 19 Nov","deck":null,"takeaway":"The sweep listed 379 arXiv papers with AI statements (253 new on 19 Nov), 72 conjecture papers without one (20 new), 71 Hexagon works, 6 result-repo commits and 1 watched repo. Every new line was read and its AI statement checked in the PDF or the Hexagon provenance record. Four results got their own entries, a fifth (Graph Minors in Lean) came from Mathstodon, seven existing entries were extended, and 112 arXiv papers and about 45 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":8,"official":8,"filed":"2026-11-19","updated":"2026-11-19","orgs":["OpenAI","Anthropic","Google DeepMind","various researchers"]},{"id":"2026-11-12-grid-minor-sixth-power-hajiaghayi-astra","url":"https://postcutoff.com/e/2026-11-12-grid-minor-sixth-power-hajiaghayi-astra/","date":"2026-11-12","date_precision":"day","short_title":"Grid-minor exponent 6 in polynomial time (Hajiaghayi with Astra)","deck":null,"takeaway":"Robertson and Seymour's grid-minor theorem is central to graph minors and bidimensionality; Chuzhoy and Tan's g⁹ bound (2021) was the best. Two AI-assisted claims now go below it: Édouard Bonnet's Lean-checked g⁸·polylog with Codex, and Hajiaghayi's g⁶·polylog with a polynomial-time algorithm, developed with OpenAI Astra.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":3,"official":3,"filed":"2026-11-13","updated":"2026-11-13","orgs":["OpenAI","University of Maryland","various researchers"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-11-19","type":"filed","text":"Created (science agent; found via Ross Kang's Mathstodon post; READMEs of both repos read)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-11-19","run":null,"sources_read":"Science agent; found via Ross Kang's Mathstodon post; READMEs of both repos read","updated":"2026-11-19","human_review":null,"version":null},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":166,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":136,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":227,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":166,"in_training_data":false}],"short_url":"https://postcutoff.com/s/graph-minors-series-lean"}