{"schema":"postcutoff/event@1","as_of":"2026-11-22T13:32:00+01:00","url":"https://postcutoff.com/e/2026-11-19-sharp-topological-overlap-every-dimension-norin-gpt-6-astra/","md":"https://postcutoff.com/e/2026-11-19-sharp-topological-overlap-every-dimension-norin-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-11-19-sharp-topological-overlap-every-dimension-norin-gpt-6-astra","date":"2026-11-19","date_precision":"day","short_title":"Sharp topological overlap (GPT-6 Astra)","deck":null,"takeaway":"On 19 November 2026 Sergey Norin (McGill) posted a proof that, for continuous and for affine maps of an n-simplex to R^d, some point lies in the images of a (d+1)!/(d+1)^(d+1) fraction of the d-dimensional faces, and that this is optimal in every dimension.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2611.26229: Sharp topological overlap in every dimension (Norin)","url":"https://arxiv.org/abs/2611.26229","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"GitHub snorin239/SharpTopologicalOverlap (Lean)","url":"https://github.com/snorin239/SharpTopologicalOverlap","type":"code","group":"primary","domain":"github.com"}],"official":2,"filed":"2026-11-22","updated":"2026-11-22","orgs":["OpenAI"],"title":"Sergey Norin and GPT-6 Astra determine the sharp topological overlap constant in every dimension, confirming the Bukh–Matoušek–Nivasch conjecture","summary":"On 19 November 2026 Sergey Norin (McGill) posted a proof that, for continuous and for affine maps of an n-simplex to R^d, some point lies in the images of a (d+1)!/(d+1)^(d+1) fraction of the d-dimensional faces, and that this is optimal in every dimension. The affine case confirms a conjecture of Bukh, Matoušek and Nivasch; the topological case sharpens Gromov's overlap theorem. The abstract says \"The proof was found by GPT-6 Astra, following the directions of the author\", and GPT-6.1 Sol produced a Lean formalization of the main theorem.","key_facts":["Claim (arXiv 2611.26229, 19 Nov 2026): c_d^top = c_d^aff = (d+1)!/(d+1)^(d+1) for every d; in the plane this is the classical 2/9 of Boros–Füredi","The equality c_d^aff = (d+1)!/(d+1)^(d+1) confirms the conjecture of Bukh, Matoušek and Nivasch, who proved it as an upper bound; the topological constant is the sharp form of Gromov's topological overlap","AI disclosure: Norin had optimal bounds in two dimensions via his 'high-dimensional bramble lemma' and, with Zdeněk Dvořák, suboptimal bounds in three; he 'tasked GPT-6 Astra with obtaining a common strengthening of the bramble and Gromov's approaches'; after 'Astra was encouraged to abandon numerical optimization and prioritize elegant conceptual approaches', it 'found a proof of the optimal bound in three dimensions, which immediately extended to every dimension'","Human role: 'The author rewrote the proof, restructuring it and improving the presentation'; Claude Opus 5.5 produced the figure","Lean: 'GPT-6.1 Sol produced a Lean formalization of Theorem 1.1 and a strengthening of Theorem 1.2, based on an earlier draft', at github.com/snorin239/SharpTopologicalOverlap","Earlier: Norin and Raphael Steiner's linear Hadwiger proof (Oct 2026) was also found by GPT-6 Astra"],"key_numbers":[],"tags":["math","combinatorics","discrete-geometry","topological-overlap","gromov","gpt-6-astra","lean","unverified"],"science":{"field":"mathematics","subfield":"discrete geometry / topological combinatorics","problem":"Optimal overlap constants for maps of the simplex to R^d (Gromov's topological overlap; Bukh–Matoušek–Nivasch conjecture for affine maps)","result":"c_d^top = c_d^aff = (d+1)!/(d+1)^(d+1) in every dimension, matching the Bukh–Matoušek–Nivasch upper bound.","open_since":"","ai_system":["GPT-6 Astra","GPT-6.1 Sol","Claude Opus 5.5"],"human_role":"AI-assisted: the author set the strategy and steered; GPT-6 Astra found the proof; the author rewrote it; GPT-6.1 Sol formalized the main theorem in Lean","verification":{"key":"lean","label":"Lean-verified","text":"Preprint; main theorem formalized in Lean by the author's AI pipeline; not refereed"},"status":"pending","shock":"A sharp constant in every dimension came out of a three-dimensional attempt once the model was told to drop numerical optimization.","short":"Sharp topological overlap"},"body_md":"## What happened\n\nNorin's single-author paper was announced in the 20 November arXiv listing (math.CO). Its AI disclosure explains that the project\ngrew from his earlier two-dimensional argument and a three-dimensional collaboration with Dvořák, and that GPT-6 Astra found the\noptimal three-dimensional bound, which then extended to all dimensions. Norin rewrote the proof; a Lean formalization of the main\ntheorem produced by GPT-6.1 Sol is public.\n\nThe sweep first listed the paper on 22 November; earlier runs had treated its line as an already-read re-listing.\n\n## Why it matters\n\nGromov's overlap theorem is a central result in topological combinatorics, and the exact constants beyond the plane had been open.\nIf correct, the paper settles them in every dimension at once and confirms the conjectured affine value. It is unrefereed; the\nLean files cover the main theorem. We found no public reaction by 22 November.","disputed":[{"label":"Verification","text":"Preprint; main theorem formalized in Lean by the author's AI pipeline; not refereed","sources":[]}],"related":[{"id":"2026-11-22-ai-assisted-results-november-22-listing","url":"https://postcutoff.com/e/2026-11-22-ai-assisted-results-november-22-listing/","date":"2026-11-22","date_precision":"day","short_title":"AI-assisted results, 22 Nov","deck":null,"takeaway":"arXiv published nothing new over the weekend, but the 127 uncited arXiv lines dated 14–19 Nov, which runs since 19 Nov had treated as already-read re-listings, had never been read: they held Google's autonomous Gemini proof of a polynomial sample compression bound, Norin's sharp topological overlap, the El-Zahar–Erdős disproof and Stafford's 1978 conjecture. All 252 disclosure lines and 49 conjecture lines were read in the PDFs; 6 own entries, 5 extended entries, 60 arXiv papers, 29 Hexagon works, 10 Zenodo records and 8 backlog works listed here; 187 disclosure lines dropped as editorial, no AI or AI only as topic or reference, 50 conjecture papers had no AI statement, 4 Hexagon works dropped. All unrefereed.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"partly","labels":["Partly confirmed"]},"sources":39,"official":38,"filed":"2026-11-22","updated":"2026-11-22","orgs":["Google","OpenAI","Anthropic","various researchers"]},{"id":"2026-10-04-linear-hadwiger-conjecture-proved-gpt-6-astra","url":"https://postcutoff.com/e/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":"With the 3SUM/APSP refutation and the KLS proofs posted the same week, it marks a step change in AI-originated mathematics: famous problems now fall with proofs largely written by models and checked by machines.","category":"science","category_label":"Science & math","importance":5,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":2,"official":2,"filed":"2026-10-06","updated":"2026-10-19","orgs":["OpenAI","McGill University","ETH Zurich"]}],"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-11-22","type":"filed","text":"Created (science agent; arXiv PDF read, AI disclosure quoted)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-11-22","run":null,"sources_read":"Science agent; arXiv PDF read, AI disclosure quoted","updated":"2026-11-22","human_review":null,"version":null},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":172,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":142,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":233,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":172,"in_training_data":false}],"short_url":"https://postcutoff.com/s/sharp-topological-overlap-gpt-6"}