Convex and metric geometry·OpenAI Math·Result 091·Lean formalisation listed
Logarithmic and Lp Brunn–Minkowski inequalities and the B-conjecture
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
The logarithmic Brunn–Minkowski conjecture
The animation for this result has not been released yet. Subscribe on YouTube to catch it.
What OpenAI claims
Proves the logarithmic Brunn–Minkowski inequality for origin-symmetric convex bodies in every dimension, and the scalar-dilation B-conjecture for all even log-concave Radon measures. For Lebesgue volume it also proves the additive Lp Brunn–Minkowski inequality for full-dimensional origin-symmetric convex bodies throughout 0 < p < 1. (Lean)
Paper
The logarithmic Brunn–Minkowski conjecture
We prove the logarithmic Brunn–Minkowski conjecture for arbitrary origin-symmetric convex bodies in every dimension. The theorem also gives the symmetric Lp Brunn–Minkowski inequality for every 0 < p < 1. Combined with Saroglou's transfer theorem and a support-subspace reduction, it yields the logarithmic inequality for every even log-concave Radon measure and the scalar-dilation (B)-conjecture.
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
- 092The optimal order of convex-body covering densityLean
- 093Dimension-free logarithmic Sobolev inequality for subgaussian log-concave measures
- 094Subpolynomial dimension reduction in LpLean
- 095Hyperbolicity cones without semidefinite liftsLean
- 096The Gaussian propeller conjecture in every dimensionLean
- 097The Euclidean Steinitz–Bergström boundLean