The $L_p$ Brunn–Minkowski Conjecture
Status Open · unsolvedmath.comLLM status Open unverified
Top Open Problems unknownunknown Not reported cataloguedOpenOpenStatement
Definitions and mathematical statement
Shared notation.
$\mathbb N$, $\mathbb Z$, $\mathbb Q$, $\mathbb R$, and $\mathbb C$ denote the natural numbers, integers, rationals, reals, and complex numbers, respectively. All additional parameters and hypotheses are specified in the question.Statement recorded in the supplied source.
For $0\leq p<1$, origin-symmetric convex bodies $K,C\subseteq\mathbb R^n$, and every $\lambda\in[0,1]$, is$$V\left((1-\lambda)K+_p\lambda C\right)\geq V(K)^{1-\lambda}V(C)^\lambda,$$
where $+_p$ denotes the $L_p$-linear combination?
Formulation references: [S1], [S2].
Short English statement
For $0\leq p<1$, origin-symmetric convex bodies $K,C\subseteq\mathbb R^n$, and every $\lambda\in[0,1]$, is$$V\left((1-\lambda)K+_p\lambda C\right)\geq V(K)^{1-\lambda}V(C)^\lambda,$$
where $+_p$ denotes the $L_p$-linear combination?
Sources
- S1 ULAM.AI and the UnsolvedMath Contributors, UnsolvedMath: A Curated Collection of Open Mathematics Problems, record 30004029 (OWR-16637-008). Catalogue attribution under CC BY 4.0. https://huggingface.co/datasets/ulamai/UnsolvedMath.
- S2 Original problem formulation and mathematical context. https://doi.org/10.4171/owr/2018/54.
Statement licence: CC-BY-SA-4.0 · Source file
Contributions 1
OpenAI claim summary for Math-2451
The result supplies the conclusion in this problem with its displayed hypotheses and quantifiers. The broader statements and applications in the manuscript are kept separate from the particular question above. The supporting result is manuscript 1 (family 091; 2026-09-23). The manuscript also gives additional strength beyond the requested conclusion; that excess is not required for this problem's solved-claim label.
The \$L_p\$ Brunn–Minkowski Conjecture
OpenAI's claim
OpenAI presents the following claims relevant to this question, with manuscript numbers following paper order in Sources. In manuscript 1 (family 091; 2026-09-23), the asserted result is that symmetric convex bodies satisfy logarithmic Brunn--Minkowski in all dimensions, with the stated $L_p$, even-measure, and dilation consequences.Mathematical statement of the claimed result
Manuscript 1.
For a full-dimensional origin-symmetric convex body $K\subset\mathbb R^n$, write $h_K(u)=\sup_{x\in K}x\cdot u$, and for a positive function $g$ on the unit sphere define $W[g]=\{x:x\cdot u\le g(u)\text{ for every unit }u\}$. For every integer $n\ge1$, every such pair $K,L$, and every $\lambda\in[0,1]$, the claim is \[ |W[h_K^{1-\lambda}h_L^{\lambda}]|\ge |K|^{1-\lambda}|L|^{\lambda}. \] Its stated consequence, for every $0<p<1$, is \[ \left|W[((1-\lambda)h_K^p+\lambda h_L^p)^{1/p}]\right|^{p/n} \ge(1-\lambda)|K|^{p/n}+\lambda|L|^{p/n}. \] Volumes are Lebesgue volumes, and central symmetry is an assumption in both assertions.Outline of the argument
For manuscript 1 (family 091; 2026-09-23), symmetric polytopes are approximated by smooth even-power weights. Logarithmic concavity of their integrals follows from a variance estimate in moment coordinates, and limits first remove the power smoothing and then the Gaussian regularization.Formal verification
For manuscript 1 (family 091; 2026-09-23), OpenAI lists Lean statements for this assertion: symmetric convex bodies satisfy logarithmic Brunn--Minkowski in all dimensions, with the stated $L_p$, even-measure, and dilation consequences.This coverage does not establish a formal proof of the complete problem as stated here.
The linked family Comparator checks are LogBrunnMinkowski.lean.
Their named declarations include OAI.LogBrunnMinkowski.main.
This site has not executed the Lean code. Described statement coverage is not an independent proof check.
Status caveat
The manuscripts were produced by an internal OpenAI model. OpenAI cautions that results without formalization can contain mistakes. This site has not independently checked the proofs; the label records the scope of OpenAI's claim.Sources
- OpenAI, The logarithmic Brunn–Minkowski conjecture, 2026-09-23; citation key
OAI:The-logarithmic-Brunn-Minkowski-conjecture-September-23-2026. PDF (GitHub); PDF (direct); Manuscript page and citation; Latest version; Statement source: cor:lp, eq:lp; Statement source: thm:main, eq:main. - Family 091: Lean scope.
- Comparator LogBrunnMinkowski.json.
- Comparator LogBrunnMinkowski.lean.
- OpenAI catalogue entry.