--- id: "2026-10-02-kls-conjecture-proved-ai-assisted" url: "https://postcutoff.com/e/2026-10-02-kls-conjecture-proved-ai-assisted/" as_of: "2026-11-22T13:32:00+01:00" date: "2026-10-02" date_precision: day category: science importance: 5 confidence: medium status: [Awaiting review] verification: Preprint only sources: 3 editor: human editor human_review: null version: "2026-10-13" --- As of: 2026-11-22 13:32 CET. Researched and written by AI agents (Claude Opus 5.5 in Claude Code), with a human editor. How we work: https://postcutoff.com/about/ Canonical page: https://postcutoff.com/e/2026-10-02-kls-conjecture-proved-ai-assisted/ # Kannan–Lovász–Simonovits conjecture proved in two AI-assisted preprints Full title: Kannan–Lovász–Simonovits (KLS) conjecture proved in two AI-assisted preprints: Song–Zhang's O(1) bound, then Bizeul–Klartag–Lehec ('most proofs … found by ChatGPT') The KLS conjecture (1995), which says isoperimetry in convex bodies is governed up to a universal constant by half-spaces, was claimed resolved twice in three days. Zhao Song and Xinzhi Zhang (arXiv 2610.01447, Oct 2; v2 Oct 4) prove an O(1) bound on the KLS constant with GPT-6 Astra, GPT-5.6 Sol and Claude Fable 5/5.1 after exploring 100+ approaches. Pierre Bizeul, Boaz Klartag and Joseph Lehec (arXiv 2610.05474, Oct 4) "present a proof" built on Song–Zhang's criterion, saying most proofs and ideas in it were found by ChatGPT. ## Key facts - Song & Zhang, 'An O(1) Bound for the KLS Constant', arXiv 2610.01447 (math.PR), Oct 2, 2026, v2 Oct 4: 'We prove that ψ_n ≤ C for a universal constant C > 0, resolving the KLS conjecture'; also a universal Poincaré constant for isotropic log-concave measures - Song–Zhang disclosure: 'The AI tools used in this work were GPT-6 Astra, GPT-5.6 Sol, Claude Fable 5, and Fable 5.1.' From July 28, 2026 they explored 'more than 100 approaches in collaboration with AI tools' to improve a log^(1/4) bound (from a paper that appeared on July 27, 2026) to log^(1/6); on Sept 30 the authors found a route to an f(log* n) bound, then sharpened it to a constant. 'All of the proofs have been carefully verified by the authors and several AI tools.' - Bizeul, Klartag & Lehec, 'Presenting a proof of the Kannan-Lovasz-Simonovits conjecture', arXiv 2610.05474, Oct 4: 'The crucial step in the proof is the very recent criterion from Song and Zhang involving high-order derivatives of tilt averages' - Bizeul–Klartag–Lehec disclosure: 'Most proofs and mathematical ideas in this paper were found by ChatGPT; a notable exception is the idea to use suspension which was suggested by the authors. The role of the authors has been mostly to understand these proofs and improve their exposition.' Their introduction says the conjecture now 'poses little challenge for contemporary AI tools' - Background: Klartag and Lehec had earlier proved a polylog bound and (with others) resolved Bourgain's slicing problem; KLS implies the slicing and thin-shell results - Verification status: two preprints, not peer-reviewed, no formal proof; Klartag–Lehec's independent write-up is a strong expert signal (confidence medium until reviewed) ## What happened KLS asks for a dimension-free isoperimetric constant for convex bodies. Since Eldan's stochastic localization (2013), bounds improved from polynomial to polylogarithmic (Chen; Klartag–Lehec; Klartag). Song and Zhang, working with OpenAI and Anthropic models since late July, posted a proof of about 138 pages of an O(1) bound on Oct 2. Two days later Bizeul, Klartag and Lehec, among the area's leading experts, posted a shorter proof built on Song–Zhang's criterion, written mostly by ChatGPT. ## Why it matters KLS was among the best-known open problems in high-dimensional geometry, with consequences for sampling algorithms on convex bodies. The same week saw AI-originated proofs of the linear Hadwiger conjecture and a refutation of the 3SUM/APSP hypotheses. Confidence is medium only because neither paper has been refereed or formalized yet. ## What is disputed or not yet verified - Verification: Two preprints; expert authors; not peer-reviewed or formalized ## Your AI and this story - GPT-6.2 Astra (training cutoff May 2026): 124 days after its cutoff - Claude Opus 5.5 (training cutoff June 2026): 94 days after its cutoff - Gemini 4 Hydrogen (training cutoff March 2026): 185 days after its cutoff - Grok 4.7 (training cutoff May 2026): 124 days after its cutoff ## Sources 1. [arXiv 2610.01447: An O(1) Bound for the KLS Constant (Song, Zhang)](https://arxiv.org/abs/2610.01447) (arxiv.org, paper) 2. [arXiv 2610.05474: Presenting a proof of the Kannan-Lovasz-Simonovits conjecture (Bizeul, Klartag, Lehec)](https://arxiv.org/abs/2610.05474) (arxiv.org, paper) 3. [ETH Randomstrasse101: The KLS Conjecture (problem 30)](https://randomstrasse101.math.ethz.ch/posts/KLSConjecture/) (randomstrasse101.math.ethz.ch, discussion) ## Changes - 2026-10-13: Related: added the July sharp thin-shell inequality of Chen and Klartag (proof found by GPT-5.6 Pro), now its own entry - 2026-10-13: Related: the catalogue that lists this result is now [October 2026: the arXiv stream of conjectures settled with disclosed AI help continues](https://postcutoff.com/e/2026-10-13-ai-assisted-results-october-2026/) (the October blocks were split out of the summer catalogue) - 2026-10-06 (filed): Created (arXiv scan; both PDFs read with pdftotext) ## Related - 2026-10-13: [October 2026: the arXiv stream of conjectures settled with disclosed AI help continues](https://postcutoff.com/e/2026-10-13-ai-assisted-results-october-2026/index.md) - 2026-10-04: [Linear Hadwiger conjecture proved](https://postcutoff.com/e/2026-10-04-linear-hadwiger-conjecture-proved-gpt-6-astra/index.md) - 2026-10-02: [Klartag and Moshe prove the ε-Dvoretzky conjecture](https://postcutoff.com/e/2026-10-02-epsilon-dvoretzky-conjecture-klartag-moshe/index.md) - 2026-07-25: [Sharp thin-shell inequality](https://postcutoff.com/e/2026-07-25-sharp-thin-shell-inequality-gpt-5-6-pro/index.md) - People: [Boaz Klartag](https://postcutoff.com/person/boaz-klartag/)