{"schema":"postcutoff/event@1","as_of":"2026-11-19T22:11:00+01:00","url":"https://postcutoff.com/e/2026-05-01-borsuk-conjecture-dimension-63/","md":"https://postcutoff.com/e/2026-05-01-borsuk-conjecture-dimension-63/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-05-01-borsuk-conjecture-dimension-63","date":"2026-05-01","date_precision":"month","short_title":"GPT-5.5 Pro-assisted construction lowers the smallest known Borsuk counterexample dimension from 64 to 63","deck":null,"takeaway":"In May 2026 Max Grinsztajn, assisted by OpenAI's GPT-5.5 Pro, built a 321-point set in R^63 that cannot be split into 64 parts of smaller diameter, so Borsuk's conjecture fails in dimension 63 (b(63) ≥ 65).","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":[{"n":1,"title":"GitHub: maaxgrin/borsuk-63-counterexample (paper PDF + verifier)","url":"https://github.com/maaxgrin/borsuk-63-counterexample","type":"code","group":"primary","domain":"github.com"},{"n":2,"title":"Tao et al. optimization constants: constant 28a (Borsuk)","url":"https://teorth.github.io/optimizationproblems/constants/28a.html","type":"docs","group":"primary","domain":"teorth.github.io"},{"n":3,"title":"arXiv 2608.12561: An AI Generated Counterexample to Borsuk Problem in Dimension 63 (withdrawn)","url":"https://arxiv.org/abs/2608.12561","type":"paper","group":"primary","domain":"arxiv.org"},{"n":4,"title":"Wikipedia: Borsuk's conjecture","url":"https://en.wikipedia.org/wiki/Borsuk%27s_conjecture","type":"discussion","group":"reactions","domain":"en.wikipedia.org"},{"n":5,"title":"Wikipedia: List of mathematical discoveries by artificial intelligence","url":"https://en.wikipedia.org/wiki/List_of_mathematical_discoveries_by_artificial_intelligence","type":"discussion","group":"reactions","domain":"en.wikipedia.org"}],"official":3,"filed":"2026-09-29","updated":"2026-10-29","orgs":["OpenAI"],"title":"GPT-5.5 Pro-assisted construction lowers the smallest known Borsuk counterexample dimension from 64 to 63","summary":"In May 2026 Max Grinsztajn, assisted by OpenAI's GPT-5.5 Pro, built a 321-point set in R^63 that cannot be split into 64 parts of smaller diameter, so Borsuk's conjecture fails in dimension 63 (b(63) ≥ 65). The previous smallest known failing dimension, 64, had stood since 2013. A second, independent AI-generated version (GPT-5.6 Sol) was posted to arXiv in August and withdrawn because the result already existed.","key_facts":["Construction: 320-point Jenrich–Brouwer core from the G2(4) strongly regular graph in a codimension-2 subspace of R^63, plus one projected and rescaled point","Result: 321 points, any subset of smaller diameter has at most 5 points, so at least 65 parts are needed (b(63) ≥ 65)","Open range for Borsuk's conjecture moves from 4 ≤ n ≤ 63 to 4 ≤ n ≤ 62","Repository README: 'The construction and proof were obtained with assistance from GPT-5.5 Pro'; exact verification script plus Sage-checkable certificates (no Lean proof)","Recorded in Tao's optimization-constants table (constant 28a) as [Gri2026]","arXiv 2608.12561 (Yibo Ji, 12 Aug 2026): same 321-point set 'generated entirely by ChatGPT using GPT 5.6 Sol'; withdrawn 14 Aug 2026 because the construction had already been published","Yibo Ji's arXiv withdrawal comment (2608.12561v2): 'Just found out that this counterexample had already been posted elsewhere: https://github.com/maaxgrin/borsuk-63-counterexample and https://nickk124.github.io/borsuk/'"],"key_numbers":[],"tags":["math","discrete-geometry","counterexample","borsuk","gpt-5-5-pro"],"science":{"field":"mathematics","subfield":"discrete geometry","problem":"Borsuk's conjecture: smallest dimension where it fails","result":"Counterexample in dimension 63 (321-point three-distance set needing ≥ 65 parts), improving the 2013 record of 64.","open_since":"1933","ai_system":["GPT-5.5 Pro"],"human_role":"AI-assisted: Max Grinsztajn worked with GPT-5.5 Pro; exact computer verification","verification":{"key":"none","label":"Unverified claim","text":"Explicit finite construction with an exact verification script and Sage-checkable certificates (no Lean); listed in Tao's optimization-constants repository; not peer-reviewed"},"status":"confirmed","shock":"A 13-year-old record in a famous geometry problem moved by a single added point that a chatbot helped find."},"body_md":"## What happened\n\nBorsuk asked in 1933 whether every bounded set in R^n can be split into n+1 pieces of smaller diameter. Kahn and Kalai showed in 1993 that the answer is no in high dimensions, and later work pushed the smallest known failing dimension down to 64 (Jenrich, 2013, from Bondarenko's construction). In May 2026 Max Grinsztajn, working with GPT-5.5 Pro, added one carefully projected point to the 320-point Jenrich–Brouwer set and got a 63-dimensional counterexample. His repository ships an exact verification script and certificates.\n\nThe exact day is not known. Wikipedia dates the result to May 2026. In August 2026 Yibo Ji posted the same kind of 321-point construction to arXiv, saying it was \"generated entirely by ChatGPT using GPT 5.6 Sol\". He withdrew it two days later because the result was already published. Secondary sources also mention an independent find by \"Konz\", which we have not verified.\n\n## Why it matters\n\nIt is a clean, checkable improvement to a well-known geometry record. Two separate human+model pairs reached it within a few months, which suggests these gaps are now within easy reach of frontier models.","disputed":[],"related":[{"id":"2026-10-06-openai-borsuk-conjecture-dimension-nine-counterexample","url":"https://postcutoff.com/e/2026-10-06-openai-borsuk-conjecture-dimension-nine-counterexample/","date":"2026-10-06","date_precision":"day","short_title":"Borsuk's conjecture fails in dimension 9 (OpenAI claim, Lean-checked)","deck":null,"takeaway":"A manuscript in OpenAI's 6 Oct 2026 maths release (family 156, dated 23 Sept) claims that the compact set of rank-one projectors onto lines in ℝ⁴, a copy of real projective 3-space in a 9-dimensional space, cannot be cut into ten pieces of smaller diameter. That would make 9 the smallest known dimension in which Borsuk's 1933 conjecture fails. The record had been 63, set in May 2026 with a finite 321-point set. The main theorem has a Lean proof, which a community Comparator run accepted. Gil Kalai called it 'a major progress' and said the topological proof 'looks very beautiful', but added that it still needs careful checking. The example is infinite, so for finite sets the record is still 63. Gábor Damásdi showed that every finite subset of it can be split into eight smaller pieces.","category":"science","category_label":"Science & math","importance":5,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":18,"official":10,"filed":"2026-10-29","updated":"2026-10-29","orgs":["OpenAI"]},{"id":"2026-05-27-sum-product-conjecture-false-over-reals","url":"https://postcutoff.com/e/2026-05-27-sum-product-conjecture-false-over-reals/","date":"2026-05-27","date_precision":"day","short_title":"Erdős–Szemerédi sum-product conjecture shown false over the reals","deck":"A GPT-5.5 Pro agent re-disproves it in 7 of 8 runs","takeaway":"It shows AI ideas spreading into human research and then being reproduced autonomously: a feedback loop between AI and human mathematicians.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":2,"official":2,"filed":"2026-09-29","updated":"2026-10-19","orgs":["OpenAI"]},{"id":"2026-05-12-gaussian-completely-monotone-disproved","url":"https://postcutoff.com/e/2026-05-12-gaussian-completely-monotone-disproved/","date":"2026-05-12","date_precision":"day","short_title":"GPT-5.5 Pro finds counterexample disproving McKean's 1966 conjecture and the Gaussian completely monotone conjecture","deck":null,"takeaway":"It is part of 2026's striking pattern of AI counterexamples: models proved especially good at finding objects that break long-believed conjectures.","category":"science","category_label":"Science & math","importance":3,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":3,"official":2,"filed":"2026-09-29","updated":"2026-10-19","orgs":["OpenAI"]}],"people":[{"id":"terence-tao","name":"Terence Tao","url":"https://postcutoff.com/person/terence-tao/"}],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-29","type":"edit","text":"Related: added [Borsuk's conjecture fails in dimension 9 (OpenAI claim, Lean-checked)](https://postcutoff.com/e/2026-10-06-openai-borsuk-conjecture-dimension-nine-counterexample/) (OpenAI's claimed compact, infinite counterexample in dimension 9; for finite sets 63 remains the smallest known dimension)"},{"date":"2026-10-19","type":"edit","text":"Verification made precise; added Ji's withdrawal comment, which names a second earlier posting"},{"date":"2026-09-29","type":"filed","text":"Created. The tip had mixed up the model and date: the primary result is GPT-5.5 Pro (May 2026), and the August arXiv paper using GPT-5.6 Sol is a withdrawn independent rediscovery."}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-09-29","run":null,"sources_read":null,"updated":"2026-10-29","human_review":null,"version":{"date":"2026-10-29"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":null,"in_training_data":true},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":null,"in_training_data":true},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":null,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":null,"in_training_data":true}],"short_url":null}