AI Science Tracker

AI-assisted proof establishes a dimension-independent KLS isoperimetric bound

Microsoft Research; independent research collaboration · 4 Oct 2026 · mathematics

Discovery

AI-assisted proof establishes a dimension-independent KLS isoperimetric bound

Zhao Song and Xinzhi Zhang prove a universal, dimension-independent bound for the Kannan–Lovász–Simonovits constant of isotropic log-concave probability measures, resolving the KLS conjecture. Their proof repeatedly refines bounds on polynomial variance and curvature; the authors report that AI tools helped explore more than 100 approaches, obtain the earlier log-star bound, and develop and verify the final proof. Independent researchers also posted proofs, and the paper’s streamlined proof is being formalized in Lean. The 1 October preprint gave a slowly dimension-dependent bound; the 4 October version established the dimension-independent theorem described here.

Technology: GPT-6 Astra; GPT-5.6 Sol; Claude Fable 5; Fable (as named in the paper’s AI disclosure)

Family Claude: profile · models page

Publication: Preprint · Test context: prospective or independent check. Catalog categories, not an evidence grade.

Result, AI contribution and limits

Evidence context (descriptions follow the cited sources; test type is a catalog classification):

  • Publication status: Preprint
  • Test type: prospective or independent check
  • Tested: Zhao Song and Xinzhi Zhang prove a universal, dimension-independent bound for the Kannan–Lovász–Simonovits constant of isotropic log-concave probability measures, resolving the KLS conjecture.
  • Still unknown: The proof is a recent arXiv preprint, not yet journal peer-reviewed in the source reviewed. Independent proofs were posted, and the Microsoft Research author account reports later Lean formalization of a streamlined proof; the paper version and posted revisions should be checked as the work develops. This entry counts the theorem result once, not the intermediate log-star bound separately.
  • AI role: The authors state that they explored candidate approaches collaboratively with AI tools; the tools helped obtain the earlier log-star bound and develop detailed proof steps, while the researchers selected the direction and completed the repeated refinement argument. The authors state they checked the proofs with AI tools and take responsibility for correctness.

Evidence sources: https://arxiv.org/pdf/2610.01447v2 · https://arxiv.org/abs/2610.01447 · https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/

Source checked · editorial details

The source page was checked against this entry. Independent confirmation is not assessed by this label.

Source type: paper. Paper: linked separately.

Review scope and date are not recorded; source checked does not establish full-text review.

Editorial assessment: Impact 4/5 · Validation 4/5 · Novelty 4/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.

Follow-up and relationships

No follow-up recorded; this is not a claim that no follow-up exists.

Follow-up review scope and date are not recorded.

No source-supported relationships recorded.

Open in the full catalog for filters, charts and related discoveries.