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 embeds the animation.
In one line: OpenAI reports a proof of Logarithmic and Lp Brunn–Minkowski inequalities and the B-conjecture (convex and metric geometry) in a preprint dated 23 September 2026. It has not been peer reviewed. The channel's animation, Every OpenAI Math Result, Part 1 of 4: Goldfeld's Conjecture and 82 More, is on YouTube.
Chapter 59 of 83 in Every OpenAI Math Result, Part 1 of 4: Goldfeld's Conjecture and 82 More · starts at 20:08 · watch from there on YouTube →
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
OpenAI's abstract 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.
Quick answers
- Is it proven?
- Not independently yet. OpenAI posted a preprint on 23 September 2026; it has not been peer reviewed, so treat the result as OpenAI's claim until other mathematicians have checked it.
- What exactly does OpenAI claim?
- 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)
- Where is the proof?
- In the paper, The logarithmic Brunn–Minkowski conjecture (PDF).
- Is there a video?
- Yes, on YouTube (28:48, chapter 59).
Also in
- Chapter 4 of 10 in Petty's Projection Conjecture, Log Brunn–Minkowski Conjecture and 8 More · starts at 1:03 · watch from there on YouTube →
The video
Every OpenAI Math Result, Part 1 of 4: Goldfeld's Conjecture and 82 More · Compilation · 28:48 · chapter 59 from 20:08 · description, sources and chapters →
Related results in Convex and metric geometry
- 092The optimal order of convex-body covering densityVideoLean
- 093Dimension-free logarithmic Sobolev inequality for subgaussian log-concave measuresVideo
- 094Subpolynomial dimension reduction in LpVideoLean
- 095Hyperbolicity cones without semidefinite liftsVideoLean
- 096The Gaussian propeller conjecture in every dimensionVideoLean
- 097The Euclidean Steinitz–Bergström boundVideoLean