{"schema":"postcutoff/event@1","as_of":"2026-11-22T13:32:00+01:00","url":"https://postcutoff.com/e/2026-10-02-epsilon-dvoretzky-conjecture-klartag-moshe/","md":"https://postcutoff.com/e/2026-10-02-epsilon-dvoretzky-conjecture-klartag-moshe/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-02-epsilon-dvoretzky-conjecture-klartag-moshe","date":"2026-10-02","date_precision":"day","short_title":"Klartag and Moshe prove the ε-Dvoretzky conjecture","deck":"The key probabilistic idea came from a ChatGPT discussion","takeaway":"On Oct 2, 2026 Boaz Klartag and Shahar Moshe posted a short proof that the dependence on the accuracy ε in Dvoretzky's theorem is polynomial in 1/ε, not exponential.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2610.03204: A polynomial bound in Dvoretzky's theorem","url":"https://arxiv.org/abs/2610.03204","type":"paper","group":"primary","domain":"arxiv.org"}],"official":1,"filed":"2026-10-05","updated":"2026-10-05","orgs":["Tel Aviv University","Weizmann Institute of Science","OpenAI"],"title":"Klartag and Moshe prove the ε-Dvoretzky conjecture (polynomial dependence on ε); the key probabilistic idea came from a ChatGPT discussion","summary":"On Oct 2, 2026 Boaz Klartag and Shahar Moshe posted a short proof that the dependence on the accuracy ε in Dvoretzky's theorem is polynomial in 1/ε, not exponential. Their bound is n ≥ (C/ε)^((ℓ+1)/2)·|log ε| for an ℓ-dimensional section ε-close to an ellipsoid, through any interior point of any convex body. This settles a conjecture going back to V. Milman. The authors write that the idea of their new probability distribution on the Grassmannian \"stemmed from a discussion between ChatGPT and the second named author\".","key_facts":["arXiv 2610.03204 (math.FA), 'A polynomial bound in Dvoretzky's theorem', Oct 2, 2026","Theorem 1.1: if n ≥ (C/ε)^((ℓ+1)/2)·|log ε|, every convex body K ⊂ R^n with 0 in its interior has an ℓ-dimensional section with F ⊆ K∩E ⊆ (1+ε)F for a centred ellipsoid F; Theorem 1.2 gets a Euclidean ball with the same bounds up to the constant","Previous best (centrally symmetric case only): exp(Cℓ|log ε|/ε) (Paouris–Valettas, improving Schechtman and Gordon); all proofs since Milman's 1971 concentration-of-measure approach had exponential dependence on 1/ε already for ℓ = 3","Example: a 3-dimensional section within ε = C·√(log n / n) of an ellipsoid, instead of C·log log n / log n","Proof: probabilistic but simple, using a new random model on the Grassmannian, Brunn–Minkowski in the space of operators and a union bound; also a simultaneous version for finitely many bodies","AI disclosure (acknowledgements): 'The idea to use the above probability distribution on the Grassmannian stemmed from a discussion between ChatGPT and the second named author. ChatGPT was additionally used for finding references, for inspecting and improving the proofs and for language editing.'"],"key_numbers":[],"tags":["math","convex-geometry","functional-analysis","dvoretzky","chatgpt","ai-for-math"],"science":{"field":"mathematics","subfield":"convex geometry / asymptotic geometric analysis","problem":"ε-Dvoretzky conjecture: polynomial dependence on 1/ε in Dvoretzky's theorem (V. Milman; Klartag–Novikov)","result":"Polynomial bound n ≥ (C/ε)^((ℓ+1)/2)|log ε| for nearly ellipsoidal ℓ-dimensional sections of arbitrary (not necessarily symmetric) convex bodies, and a Euclidean-ball version.","open_since":"","ai_system":["ChatGPT"],"human_role":"Human-led. The key idea (the probability distribution on the Grassmannian) came out of a discussion between ChatGPT and Shahar Moshe; ChatGPT also checked and improved proofs.","verification":{"key":"preprint","label":"Preprint only","text":"Unrefereed preprint (Tel Aviv University / Weizmann Institute authors)"},"status":"pending","shock":"A central quantitative question about Dvoretzky's theorem fell to a short proof whose key idea the authors trace to a ChatGPT conversation."},"body_md":"## What happened\n\nDvoretzky's theorem (around 1960, conjectured by Grothendieck) says that high-dimensional convex bodies have almost-Euclidean sections.\nFor more than fifty years, every proof needed the ambient dimension to grow exponentially in 1/ε for a fixed section dimension. Klartag\nand Moshe give a short probabilistic proof with polynomial dependence that works for every convex body, symmetric or not. They name the\nsource of the key idea, a new random model for choosing the subspace, in their acknowledgements: a conversation between ChatGPT and\nMoshe.\n\n## Why it matters\n\nThis is a classical problem in asymptotic geometric analysis, and the preprint comes from Boaz Klartag (Tel Aviv University and Weizmann Institute), a leading researcher in the field. The AI\ncontribution is stated modestly, but it concerns the central idea rather than editing. As of Oct 5 we found no Hacker News or press\ncoverage; the model version is not named.","disputed":[{"label":"Verification","text":"Unrefereed preprint (Tel Aviv University / Weizmann Institute authors)","sources":[]}],"related":[{"id":"2026-09-30-ai-assisted-conjecture-wave-summer-2026","url":"https://postcutoff.com/e/2026-09-30-ai-assisted-conjecture-wave-summer-2026/","date":"2026-09-30","date_precision":"day","short_title":"Summer 2026 flood: dozens of named conjectures settled on arXiv with disclosed AI help","deck":null,"takeaway":"This entry catalogues about 50 of them, with the AI role as the authors state it.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":11,"official":5,"filed":"2026-09-30","updated":"2026-10-19","orgs":["OpenAI","Anthropic","Google DeepMind","various mathematicians"]}],"people":[{"id":"boaz-klartag","name":"Boaz Klartag","url":"https://postcutoff.com/person/boaz-klartag/"}],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-05","type":"filed","text":"Created (AI disclosure read in the PDF)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-05","run":null,"sources_read":"AI disclosure read in the PDF","updated":"2026-10-05","human_review":null,"version":{"date":"2026-10-06"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":124,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":94,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":185,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":124,"in_training_data":false}],"short_url":"https://postcutoff.com/s/klartag-moshe-prove-epsilon"}