Result 101, Convex and metric geometry

The sharp simplex conjecture for isotropic constants

Proves that simplices uniquely maximize the isotropic constant among convex bodies in every dimension, resolving the strong isotropic constant conjecture. Also establishes the sharp entropy lower bound for log-concave probability densities, with equality precisely for invertible affine images of products of one-sided exponential laws.

Proof

The bigger picture

Why it matters

Triangles and their higher-dimensional counterparts may be the most extreme convex shapes for a volume-adjusted measure of spread. The unreviewed manuscript claims to identify all maximizers and establish a related sharp bound on probability distributions.

What changes?

In every dimension, it claims that simplices, the higher-dimensional versions of triangles, uniquely maximize the isotropic constant among convex bodies: compact convex sets with nonempty interior. This constant measures the spread of uniform mass relative to volume, unchanged by invertible affine transformations. For every log-concave probability density in dimension m, meaning one with a concave logarithm, it also claims that differential entropy is at least m plus half the natural logarithm of the determinant of its covariance matrix.

What does that help mathematicians do?

The entropy bound quantifies how little uncertainty a log-concave distribution can have once its covariance, which records spread and correlations, is fixed. The stated equality cases are exactly invertible affine images of products of one-sided exponential laws. Researchers could therefore identify every extremal distribution, not just estimate a lower bound. On the geometric side, the uniqueness claim rules out every nonsimplex convex body as a maximizer.

Are there practical applications?

The immediate value is foundational: sharp benchmarks for comparing convex bodies and log-concave probability models. The entropy statement connects geometric spread to information-theoretic uncertainty and could guide further mathematical inequalities. This is a structural connection between geometry and probability, rather than a demonstrated computational method or applied performance improvement.

This section was generated by GPT-6 Astra Medium. This explanation is based on the result summary and manuscript abstracts below. This context is separate from OpenAI's source text.

Manuscript

A sharp entropy bound and the simplex inequality for isotropic constants

October 5, 2026 42 pages

We prove the strong isotropic constant conjecture: in each dimension, simplices are the unique maximizers of the isotropic constant among convex bodies. We also prove the sharp entropy bound h(f)≥m+12log⁡det⁡Cov(f)h(f)\ge m+\tfrac12\log\det\mathop{\mathrm{Cov}}\nolimits (f) for every log-concave probability density on ℝm, with equality precisely for invertible affine images of products of one-sided exponential laws.

PDF LaTeX source
Cite (BibTeX) 
@misc{OAI:A-sharp-entropy-bound-and-the-simplex-inequality-for-isotropic-constants-October-5-2026,
  author = {{OpenAI}},
  title = {{A sharp entropy bound and the simplex inequality for isotropic constants}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/A-sharp-entropy-bound-and-the-simplex-inequality-for-isotropic-constants-October-5-2026/isotropic-simplex.pdf}{OAI:A-sharp-entropy-bound-and-the-simplex-inequality-for-isotropic-constants-October-5-2026}},
  year = {2026}
}

Data from github.com/openai/math at commit adc7f12, committed October 6, 2026 at 21:58 UTC, last checked for changes about 8 hours ago. Titles, subjects, summaries, abstracts and Lean notes are OpenAI's; page counts are read from the PDFs. The map, related results, search, kinds of results and the named-problem index are Emergent Mind's, built with text embeddings and an LLM, and may contain errors.

An Emergent Mind Labs project. Emergent Mind is not affiliated with OpenAI. None of these results has been peer reviewed. Cite the manuscripts themselves, using the BibTeX on each result's page.