oai-math-revised beta

Browse › Convex and metric geometry › 101 The sharp simplex conjecture for isotropic constants

A sharp entropy bound and the simplex inequality for isotropic constants

OpenAI · October 5, 2026

Open PDFCite Report a problem Add a reference or comment Interested in working on this Start a discussion

Edit NOTES.md · Existing issues · Source on GitHub

Abstract

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)\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.

If the PDF does not display here, open it directly: Open PDF.

Notes

No notes yet. Add a reference, a comment or your name with the buttons above, or edit NOTES.md on GitHub.

Automatically collected notes (unreviewed)

work in progress

Collected automatically by AI tools (Claude Opus 5.5 and GPT-6 Astra, 2026-10-21) and not checked by a person. May be wrong or incomplete. Report an error.

Follow-up works

Possibly relevant literature (found by the agent, not checked)

Digests and expositions

Elsewhere

Independent sites; their content is not reviewed here.

Cite

@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}
}

From OpenAI's README for this paper:

Verification

The scalar certificate checker uses only Python 3's standard library and exact rational arithmetic. From this paper's root directory, run:

python3 verification/verify_scalar.py

A successful run exits with status zero and ends with ALL CHECKS PASSED. It checks the rational bounds used in the scalar estimates; the analytic inputs are proved in the paper's appendix.

Family 101: 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.

This is the only paper in this family.