Klartag and Moshe prove the ε-Dvoretzky conjecture
The key probabilistic idea came from a ChatGPT discussion
Event confirmedAwaiting review
Importance: major (4 of 5)The 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.
Status
- Claim
Event confirmedAwaiting review
- Our reporting
- High confidence
- Verification
- Preprint only
- Importance
- Major (4 of 5)
- Last verified
- 5 October 2026
Your AI and this story
- GPT-6.2 Astra124 days after its cutoff
- Claude Opus 5.594 days after its cutoff
- Gemini 4 Hydrogen185 days after its cutoff
- Grok 4.7124 days after its cutoff
None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 94 days before it.
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.’
What happened
Dvoretzky’s theorem (around 1960, conjectured by Grothendieck) says that high-dimensional convex bodies have almost-Euclidean sections. For more than fifty years, every proof needed the ambient dimension to grow exponentially in 1/ε for a fixed section dimension. Klartag and Moshe give a short probabilistic proof with polynomial dependence that works for every convex body, symmetric or not. They name the source of the key idea, a new random model for choosing the subspace, in their acknowledgements: a conversation between ChatGPT and Moshe.
Why it matters
This 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 contribution is stated modestly, but it concerns the central idea rather than editing. As of Oct 5 we found no Hacker News or press coverage; the model version is not named.
What is disputed or not yet verified
| Verification | Unrefereed preprint (Tel Aviv University / Weizmann Institute authors) |
|---|
Sources
1 source from 1 site. Numbers match the chips in the text.
1 source: 1 primary
Primary
- arXiv 2610.03204: A polynomial bound in Dvoretzky’s theoremarxiv.org, paper
Changes
- Filed (AI disclosure read in the PDF)