Math-2283 · mathematics · Analysis

Math-2283

Logarithmic Brunn–Minkowski inequality and equality cases

Status Partially solved · unsolvedmath.comLLM status Open unverified

Top Open Problems unknownunknown Not reported cataloguedPartially solvedOpen

Statement

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 origin-symmetric convex bodies $K,L\subseteq\mathbb R^n$ with support functions $h_K,h_L$, define \[tK+_0(1-t)L=\bigcap_{u\in S^{n-1}}\{x:\langle x,u\rangle\leq h_K(u)^th_L(u)^{1-t}\}.\] Must its volume be at least $|K|^t|L|^{1-t}$ for $0\leq t\leq1$? The stated equality question asks whether equality occurs only for $K=L$ or for parallelograms with parallel sides.

Formulation references: [S1], [S2].

Short English statement

For origin-symmetric convex bodies $K,L\subseteq\mathbb R^n$ with support functions $h_K,h_L$, define \[tK+_0(1-t)L=\bigcap_{u\in S^{n-1}}\{x:\langle x,u\rangle\leq h_K(u)^th_L(u)^{1-t}\}.\] Must its volume be at least $|K|^t|L|^{1-t}$ for $0\leq t\leq1$? The stated equality question asks whether equality occurs only for $K=L$ or for parallelograms with parallel sides.

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 1

Math-2283-A1 · Literature report · LLM-generated · unknown ·

OpenAI claim summary for Math-2283

The symmetric volume inequality is asserted, but this record also requires its particular equality classification. An inequality theorem alone does not give that classification; distinct homothetic non-parallelograms already prevent importing the stated narrow equality list.

Logarithmic Brunn–Minkowski inequality and equality cases

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

Go to contribution →