{"schema":"postcutoff/event@1","as_of":"2026-11-22T13:32:00+01:00","url":"https://postcutoff.com/e/2026-10-04-linear-hadwiger-conjecture-proved-gpt-6-astra/","md":"https://postcutoff.com/e/2026-10-04-linear-hadwiger-conjecture-proved-gpt-6-astra/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-10-04-linear-hadwiger-conjecture-proved-gpt-6-astra","date":"2026-10-04","date_precision":"day","short_title":"Linear Hadwiger conjecture proved","deck":"K_t-minor-free graphs are O(t)-colourable; proof found by GPT-6 Astra (Norin & Steiner), Lean-verified by Codex","takeaway":"On Oct 4, 2026 Sergey Norin (McGill) and Raphael Steiner (ETH Zurich) posted arXiv 2610.05291, proving the linear Hadwiger conjecture: there is a constant C such that every graph with no K_t minor is Ct-colourable.","category":"science","category_label":"Science & math","importance":5,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2610.05291: A Proof of the Linear Hadwiger Conjecture","url":"https://arxiv.org/abs/2610.05291","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"GitHub: snorin239/LinearHadwiger (Lean 4 formalization)","url":"https://github.com/snorin239/LinearHadwiger","type":"code","group":"primary","domain":"github.com"}],"official":2,"filed":"2026-10-06","updated":"2026-10-19","orgs":["OpenAI","McGill University","ETH Zurich"],"title":"Linear Hadwiger conjecture proved: K_t-minor-free graphs are O(t)-colourable; proof found by GPT-6 Astra (Norin & Steiner), Lean-verified by Codex","summary":"On Oct 4, 2026 Sergey Norin (McGill) and Raphael Steiner (ETH Zurich) posted arXiv 2610.05291, proving the linear Hadwiger conjecture: there is a constant C such that every graph with no K_t minor is Ct-colourable. The authors say the proof \"was found by GPT-6 Astra, following the directions by the authors\", and that almost none of their own proof ideas survived. A Lean 4 formalization of the main theorem, produced by OpenAI Codex (6 Sol and Astra), builds with no sorries.","key_facts":["Paper: 'A Proof of the Linear Hadwiger Conjecture', Sergey Norin and Raphael Steiner, arXiv 2610.05291 (math.CO), Oct 4, 2026","Result: ∃ C ∈ ℕ such that K_t-minor-free graphs are Ct-colourable (Hadwiger's 1943 conjecture asks for t−1 colours; the linear version had been a major open weakening; best prior general bound was O(t log log t), Delcourt–Postle)","Disclosure: 'The proof presented in this paper was developed by OpenAI's ChatGPT model Astra 6, following research directions and feedback supplied by the authors. The authors suggested several possible approaches, but almost none of their specific proof ideas were retained in the final argument.'","Process: asked first for the very dense case (v(G) ≤ C′t), which the model proved 'after only a couple of hours and some encouragement'; then an explicit dependence gave the conjecture for v(G) ≤ t(log t)^(1/2−o(1)); asked for 'an original idea to bridge the gap', it produced the bootstrap argument that closes it using Delcourt–Postle's reduction","Ingredients: Reed–Seymour fractional linear Hadwiger, Delcourt–Postle reduction and chromatic separability, Pippenger–Frankl–Rödl matching theorem, LP duality, Liu–Luo-style contractions; the authors: the proof is 'contained in the convex hull of existing results. Yet it does not lie on a low-dimensional face of it'","Lean 4: github.com/snorin239/LinearHadwiger formalizes Theorem 1 (plus Reed–Seymour, Theorem 4, Corollary 24), produced by 'OpenAI Codex versions 6 Sol and Astra, following guidance from the paper's authors'; no sorries, standard axioms only; release v0.1.0","Verification status: preprint + Lean-verified main theorem; not yet peer-reviewed","AI disclosure (abstract, arXiv 2610.05291): 'The proof was found by GPT-6 Astra, following the directions by the authors.'"],"key_numbers":[],"tags":["mathematics","graph-theory","hadwiger","gpt-6-astra","lean","formal-verification","ai-discovery"],"science":{"field":"mathematics","subfield":"graph theory / graph colouring","problem":"Linear Hadwiger conjecture (K_t-minor-free graphs have chromatic number O(t))","result":"Proved: a universal C with χ(G) ≤ Ct for all K_t-minor-free G","open_since":"1943","ai_system":["GPT-6 Astra","OpenAI Codex (6 Sol, Astra)"],"human_role":"AI-generated proof under human direction: authors set the strategy and sub-goals; GPT-6 Astra wrote essentially all of the proof; Codex produced the Lean formalization","verification":{"key":"lean-unreviewed","label":"Lean proof, not yet reviewed","text":"Unrefereed preprint by specialists (Norin, Steiner); main theorem formally verified in Lean 4 (no sorries, standard axioms; formal statement written with the authors, not independently audited)"},"status":"pending","shock":"A central graph-colouring conjecture, the subject of decades of incremental bounds, was settled with a proof the human experts say they did not write."},"body_md":"## What happened\n\nHadwiger's conjecture (1943) links graph minors and colouring; even its \"linear\" weakening, that O(t) colours suffice, resisted work\nby Reed, Seymour, Norin, Postle, Delcourt and others, whose best bounds were slightly superlinear. Norin, one of the field's main\ncontributors, and Steiner directed GPT-6 Astra toward what they saw as the missing dense case. The model solved it quickly and, when\npushed for a new idea, found a bootstrap argument that finishes the proof. Codex then formalized the main theorem in Lean.\n\n## Why it matters\n\nWith the 3SUM/APSP refutation and the KLS proofs posted the same week, it marks a step change in AI-originated mathematics: famous problems\nnow fall with proofs largely written by models and checked by machines. Original Hadwiger (t−1 colours) remains open. Reactions had not\nbeen found at 07:30 CEST on Oct 6.","disputed":[{"label":"Verification","text":"Unrefereed preprint by specialists (Norin, Steiner); main theorem formally verified in Lean 4 (no sorries, standard axioms; formal statement written with the authors, not independently audited)","sources":[]}],"related":[{"id":"2026-10-13-ai-assisted-results-october-2026","url":"https://postcutoff.com/e/2026-10-13-ai-assisted-results-october-2026/","date":"2026-10-13","date_precision":"day","short_title":"October 2026: the arXiv stream of conjectures settled with disclosed AI help continues","deck":null,"takeaway":"In the first nine days of October 2026 the stream did not slow down: each arXiv listing brought several named conjectures with a disclosed AI role, and two new patterns appeared.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":17,"official":17,"filed":"2026-10-13","updated":"2026-10-29","orgs":["OpenAI","Anthropic","Google DeepMind","various mathematicians"]},{"id":"2026-10-05-claude-refutes-3sum-apsp-hypotheses","url":"https://postcutoff.com/e/2026-10-05-claude-refutes-3sum-apsp-hypotheses/","date":"2026-10-05","date_precision":"day","short_title":"Claude discovers an algorithm that refutes the 3SUM and APSP hypotheses","deck":"Truly subquadratic 3SUM and truly subcubic APSP (Alman & Vassilevska Williams, Lean-verified)","takeaway":null,"category":"science","category_label":"Science & math","importance":5,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":4,"official":3,"filed":"2026-10-06","updated":"2026-10-13","orgs":["Anthropic","Columbia University","MIT"]},{"id":"2026-09-03-gpt-6-astra","url":"https://postcutoff.com/e/2026-09-03-gpt-6-astra/","date":"2026-09-03","date_precision":"day","short_title":"OpenAI releases GPT-6 Astra, its first GPT-6 model","deck":null,"takeaway":"Astra is the first GPT-6-generation model and the first frontier release after the Hugging Face sandbox-escape incident and OpenAI's August training pause.","category":"model-release","category_label":"Model releases","importance":5,"confidence":"high","status":{"key":"confirmed","labels":["Confirmed"]},"sources":20,"official":11,"filed":"2026-09-29","updated":"2026-10-19","orgs":["OpenAI"]}],"people":[{"id":"raphael-steiner","name":"Raphael Steiner","url":"https://postcutoff.com/person/raphael-steiner/"},{"id":"sergey-norin","name":"Sergey Norin","url":"https://postcutoff.com/person/sergey-norin/"}],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-19","type":"edit","text":"Fixed ai_system (unquoted comma); verification made precise; added the abstract's AI sentence"},{"date":"2026-10-13","type":"edit","text":"Related: the catalogue that lists this result is now [October 2026: the arXiv stream of conjectures settled with disclosed AI help continues](https://postcutoff.com/e/2026-10-13-ai-assisted-results-october-2026/) (the October blocks were split out of the summer catalogue)"},{"date":"2026-10-06","type":"filed","text":"Created (arXiv scan of the Oct 5 listing; disclosure quoted from the PDF)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-06","run":null,"sources_read":null,"updated":"2026-10-19","human_review":null,"version":{"date":"2026-10-19"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":126,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":96,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":187,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":126,"in_training_data":false}],"short_url":"https://postcutoff.com/s/linear-hadwiger-conjecture"}