clopen.solutions

A sharp entropy bound and the simplex inequality for isotropic constants

Recorded by the registry's curators from GitHub; the authors did not submit it here.

OpenAI

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\Cov(f)$ for every log-concave probability density on $\R^m$, with equality precisely for invertible affine images of products of one-sided exponential laws.

Claims

SOLUTION CLAIMED OP-00716 — Simplices maximize the isotropic constant
Full resolution · fidelity not yet established

Files and sources

Paper
math @ 1581d4c, manuscript/main.tex ↗
Posted on GitHub
6 October 2026

No verification run is on record for this version.