Convex and metric geometry·OpenAI Math·Result 093
Dimension-free logarithmic Sobolev inequality for subgaussian log-concave measures
One of the 372 results in OpenAI's public mathematics catalogue, filed under convex and metric geometry: 1 preprint, the latest dated 23 September 2026. This page quotes OpenAI's own summary of the claim, links the paper and abstract, and will embed the animation.
Latest paper
A dimension-free logarithmic Sobolev inequality for subgaussian log-concave measures
The animation for this result has not been released yet. Subscribe on YouTube to catch it.
What OpenAI claims
Proves a dimension-free logarithmic Sobolev inequality for centered log-concave densities with uniformly subgaussian linear marginals, with constant bounded by a universal multiple of the squared linear subgaussian parameter.
Paper
A dimension-free logarithmic Sobolev inequality for subgaussian log-concave measures
We prove that every centered log-concave probability measure with a Lebesgue density on ℝn and linear subgaussian parameter a satisfies Ent μ(f2) ≤ Ca2∫|Df|2 dμ for compactly supported smooth f, with one universal constant C. This resolves positively the dimension-free logarithmic Sobolev conjecture for subgaussian log-concave measures.
Status
Preprint. The paper has not been independently reviewed. Treat the result as OpenAI's claim until other mathematicians have checked it. If a video exists, it illustrates the statement; it is not the proof.
Related results in Convex and metric geometry
- 094Subpolynomial dimension reduction in LpLean
- 095Hyperbolicity cones without semidefinite liftsLean
- 096The Gaussian propeller conjecture in every dimensionLean
- 097The Euclidean Steinitz–Bergström boundLean
- 098Compact counterexamples to bi-Lipschitz dimension reductionLean
- 099The sharp exponential scale of edit-distance distortionLean