{"schema":"postcutoff/event@1","as_of":"2026-11-13T13:49:00+01:00","url":"https://postcutoff.com/e/2026-11-11-talagrand-ultimate-matching-conjecture-gpt-6/","md":"https://postcutoff.com/e/2026-11-11-talagrand-ultimate-matching-conjecture-gpt-6/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-11-talagrand-ultimate-matching-conjecture-gpt-6","date":"2026-11-11","date_precision":"day","short_title":"Talagrand's Ultimate Matching Conjecture: GPT-6 proof (Hexagon)","deck":null,"takeaway":"Three specialists in random matching say GPT-6 found the critical-exponent proof of a research problem from Talagrand's book and then the endpoint answer; the text is mostly model-written and the authors promise a digested version.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"Hexagon 2611.00294: The Ultimate Matching Theorem (Goldman, Grotto, Trevisan)","url":"https://hexagonmath.org/abs/2611.00294","type":"paper","group":"primary","domain":"hexagonmath.org"},{"n":2,"title":"GitHub: grottofrancesco/UltimateMatchingTheorem","url":"https://github.com/grottofrancesco/UltimateMatchingTheorem","type":"code","group":"primary","domain":"github.com"},{"n":3,"title":"arXiv 2609.08717: Exact asymptotics for the 2D Euclidean random matching problem","url":"https://arxiv.org/abs/2609.08717","type":"paper","group":"primary","domain":"arxiv.org"},{"n":4,"title":"Hexagon 2611.00270: Quartic exponential matching in the unit square (Kohlmeyer et al.)","url":"https://hexagonmath.org/abs/2611.00270","type":"paper","group":"primary","domain":"hexagonmath.org"}],"official":4,"filed":"2026-11-12","updated":"2026-11-12","orgs":["OpenAI","CNRS","University of Pisa"],"title":"Goldman, Grotto and Trevisan post a GPT-6-found proof of Talagrand's Ultimate Matching Conjecture for all finite critical exponents, and show it fails at the endpoints","summary":"Hexagon 2611.00294 (dated 10 Nov, published 11 Nov 2026) by Michael Goldman (CNRS, Université Gustave Eiffel), Francesco Grotto and Dario Trevisan (Pisa) proves Talagrand's Ultimate Matching Conjecture (Research Problem 17.1.2 in his book on stochastic processes) for every pair of finite exponents α₁, α₂ > 2 with 1/α₁ + 1/α₂ = 1/2, and shows the conjecture fails at the endpoints (2, ∞) and (∞, 2). The authors write that GPT-6 found the critical-case and endpoint proofs; the text is \"mostly generated\" by LLMs and unrefereed.","key_facts":["Statement: n uniform points in the unit square can be matched to an evenly spread grid (or to a second random sample) by one permutation whose coordinate displacements are controlled in exponential Orlicz norms of exponents α₁, α₂ at scale √(log N / N), with probability tending to one","Endpoints: at (2, ∞) and (∞, 2) 'the conjecture fails: a Brownian local-time construction shows that the normalized optimal matching cost diverges in probability'","Use of AI (paper): 'Intense interactions with LLMs spanning several weeks led to a first proof … in the subcritical case'; 'Somewhat unexpectedly to us, a solution for the critical finite exponent case was finally found during another round of exploration'; 'After this GPT-6 quickly obtained the exact asymptotic for the endpoint cases'","Hexagon provenance: 'Primarily AI-generated'; human understanding 'some'; 'The authors have an overall understanding of the proofs and intend to provide a fully digested version in the near future'","Code and original 'monolithic' proofs: GitHub grottofrancesco/UltimateMatchingTheorem (created 10 Nov), described as an 'AI assisted solution of Talagrand's Ultimate Matching Conjecture for all exponents'","Background: builds on the authors' earlier work with V. Armegioiu, 'Exact asymptotics for the 2D Euclidean random matching problem' (arXiv 2609.08717)","Related deposit the same day: Kohlmeyer, Howe, Huffman and Kruer (Hexagon 2611.00270) prove a quartic exponential matching bound; its provenance says it is 'the revised exposition prepared following Michel Talagrand's request for a clearer presentation' (Codex, Lean for supporting lemmas)","Status: Hexagon preprint, no Lean; no expert reaction found by 12 Nov (HN, web search)"],"key_numbers":[],"tags":["math","probability","random-matching","optimal-transport","talagrand","gpt-6","hexagon"],"science":{"field":"mathematics","subfield":"probability / random matching / optimal transport","problem":"Talagrand's Ultimate Matching Conjecture (Research Problem 17.1.2 in 'Upper and Lower Bounds for Stochastic Processes')","result":"Claimed proof for all finite critical exponent pairs α₁, α₂ > 2 with 1/α₁ + 1/α₂ = 1/2; claimed failure at the endpoints (2, ∞), (∞, 2)","open_since":"","ai_system":["GPT-6"],"human_role":"AI-assisted: specialists steered weeks of LLM interaction; GPT-6 found the critical and endpoint proofs; text mostly LLM-written","verification":{"key":"preprint","label":"Preprint only","text":"Unrefereed Hexagon preprint; LLM proof-checking only"},"status":"pending","shock":""},"body_md":"## What happened\n\nThree analysts who work on random matching deposited \"The Ultimate Matching Theorem\" on Hexagon. It claims Talagrand's conjecture\nfor all finite critical exponents and a counterexample mechanism at the two endpoints. Their AI statement says the critical case\nwas solved \"somewhat unexpectedly\" during a round of LLM exploration and that GPT-6 then settled the endpoints; the posted text was\nwritten mostly by LLMs while the authors tried to understand the original \"monolithic\" proofs, which are in a GitHub repository.\n\n## Why it matters\n\nTalagrand, Abel Prize laureate 2024, set this as a research problem in his book on stochastic processes; it sharpens the\nAjtai–Komlós–Tusnády matching theorem to its conjectured optimal form. If correct, it is another named problem solved with a\ngeneral model, with specialists on the paper. The authors themselves say they have only an \"overall understanding\" so far.","disputed":[{"label":"Verification","text":"Unrefereed Hexagon preprint; LLM proof-checking only","sources":[]}],"related":[{"id":"2026-11-11-ai-assisted-results-november-11-listing","url":"https://postcutoff.com/e/2026-11-11-ai-assisted-results-november-11-listing/","date":"2026-11-11","date_precision":"day","short_title":"AI-assisted results, 11 Nov: arXiv and Hexagon","deck":null,"takeaway":"Own entries today: Smale's constant = 4 (Goel, Lean), Talagrand's Ultimate Matching Conjecture (GPT-6), the Benson–Etingof–Ostrik conjecture (GPT-6 Astra), large triangles in planar dense sets (GPT-6 Astra Pro) and explicit RIP matrices (GPT-6 Astra). Below: the rest, quoted from Hexagon provenance and arXiv PDFs; nothing here is refereed.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":113,"official":113,"filed":"2026-11-12","updated":"2026-11-12","orgs":["OpenAI","Anthropic","various researchers"]},{"id":"2026-10-30-mezard-parisi-formula-panchenko-proof-found-by-chatgpt-astra","url":"https://postcutoff.com/e/2026-10-30-mezard-parisi-formula-panchenko-proof-found-by-chatgpt-astra/","date":"2026-10-30","date_precision":"day","short_title":"Mézard–Parisi formula: Panchenko's proof 'found by ChatGPT Astra'","deck":null,"takeaway":"Dmitry Panchenko (Toronto), a leading probabilist of spin glasses, posted a proof of the Mézard–Parisi formula on 29–30 Oct 2026. The formula gives the free energy of random K-SAT and diluted p-spin models with even p. Franz and Leone had proved the upper bound; Panchenko's paper claims the matching lower bound. His AI statement says: 'The proof in this paper was found by ChatGPT Astra.' A companion note was 'written by ChatGPT Astra'. He adds that OpenAI released another proof a few days later, which 'appears to follow a different approach'. OpenAI's version is family 221 of its maths repository. Both are unrefereed.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":4,"official":4,"filed":"2026-10-31","updated":"2026-10-31","orgs":["OpenAI","University of Toronto"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-11-12","type":"filed","text":"Created (science agent; Hexagon record)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-11-12","run":null,"sources_read":null,"updated":"2026-11-12","human_review":null,"version":{"date":"2026-11-12"}},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":195,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":134,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":225,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":164,"in_training_data":false}],"short_url":"https://postcutoff.com/s/talagrand-ultimate-matching"}