This paper explores consequences of Godbersen's conjecture, which posits that certain mixed volumes of a convex body are bounded by binomial coefficients, with equality holding only for simplices. The authors prove several related inequalities, showing that linear combinations of these mixed volumes are maximized for simplices, and that the conjecture holds "on average" for any convex body.
What Problem Does This Paper Address?
The paper tackles Godbersen's conjecture, a significant open problem in convex geometry. This conjecture states that for any convex body $K$ in $n$-dimensional Euclidean space ($\mathbb{R}^n$) with volume 1, and for any integer $j$ between 0 and $n$, the mixed volume $V(K[j], -K[n-j])$ is bounded by $\binom{n}{j}$. Equality is conjectured to hold if and only if $K$ is an $n$-simplex. This conjecture is a generalization of the well-known Rogers-Shephard inequality. While the conjecture itself remains largely unproven, this paper investigates its implications and proves several related results that hold true.
Methods
The authors employ a combination of geometric constructions and algebraic manipulations of mixed volumes. A key technique involves constructing higher-dimensional bodies whose volumes relate to the mixed volumes of the original $n$-dimensional body. For instance, Theorem 4 is proven using a construction of a $(2n+1)$-dimensional body whose volume is related to a weighted sum of mixed volumes of $K$ and $-K$. Lemma 8, crucial for this proof, involves a specific convex hull construction. The proofs also heavily rely on existing inequalities, such as the Rogers-Shephard inequality and the Brunn-Minkowski inequality, and their associated equality conditions. The paper also introduces an "unbalanced covariogram" function, analogous to the standard covariogram used in proving the Rogers-Shephard inequality, to analyze the properties of unbalanced difference bodies.
Datasets
Not discussed in the paper. The paper deals with theoretical results in convex geometry, not empirical studies on datasets.
Key Insights and Ideas
"On Average" Holds: The paper demonstrates that Godbersen's conjecture holds true "on average" for any convex body. This means that if you average the relevant mixed volumes, the inequality holds, providing a weaker but still significant result.
Unbalanced Rogers-Shephard Inequality: A new conjecture, the "Unbalanced Rogers-Shephard inequality," is proposed. This conjecture relates the volume of an "unbalanced difference body" $D_\lambda K = (1-\lambda)K + \lambda(-K)$ to that of a simplex, and the paper shows it's closely related to Godbersen's conjecture.
Geometric Construction for Proofs: The proofs of key theorems (like Theorem 4 and Theorem 7) rely on constructing higher-dimensional bodies whose volumes encode the mixed volumes of the original body. This is a powerful technique for translating geometric inequalities into algebraic ones.
Characterization of Simplices: A new characterization of simplices is introduced (Proposition 10), which is crucial for proving the equality cases in some of the theorems. This characterization relates to the homothety of certain intersections of scaled bodies.
Key Results
Theorem 3: The Unbalanced Rogers-Shephard inequality (Conjecture 2) is proven to hold for dimensions $n \le 5$.
Theorem 4: For any convex body $K \subset \mathbb{R}^n$ and any $\lambda \in [0,1]$, a weighted sum of mixed volumes $\sum_{j=0}^n \lambda^j (1-\lambda)^{n-j} V(K[j], -K[n-j])$ is bounded by $Vol(K)$, with equality if and only if $K$ is an $n$-simplex. This result implies that Godbersen's conjecture holds "on average."
Corollary 5: Integrates the result of Theorem 4 over $\lambda$, showing that the average of normalized mixed volumes is bounded by $Vol(K)$, meaning Godbersen's conjecture holds "on average" over all $j$.
Theorem 7: A generalization of the Rogers-Shephard inequality is proven for unbalanced difference bodies, which also reduces to the $j=1, n-1$ case of Godbersen's conjecture.
Limitations and Future Work
Godbersen's Conjecture Remains Open: While the paper proves several consequences and related inequalities, Godbersen's conjecture itself remains unproven in its full generality.
Conjecture 2's Role: The paper demonstrates that Theorems 4 and 7 would follow directly from Conjecture 2 (the Unbalanced Rogers-Shephard inequality). Proving Conjecture 2 would therefore be a significant step towards understanding Godbersen's conjecture.
Future Directions: The paper suggests that further exploration of unbalanced difference bodies and their geometric properties could lead to new insights. The techniques used, particularly the geometric constructions and the analysis of unbalanced covariograms, are likely to be fruitful for future research in this area.
Summary updated
Abstract
The longstanding Godbersen’s conjecture states that for any convex body <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper K subset-of double-struck upper R Superscript n"> <mml:semantics> <mml:mrow> <mml:mi>K</mml:mi> <mml:mo> ⊂ </mml:mo> <mml:msup> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">R</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msup> </mml:mrow> <mml:annotation encoding="application/x-tex">K \subset \mathbb R^n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of volume <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="1"> <mml:semantics> <mml:mn>1</mml:mn> <mml:annotation encoding="application/x-tex">1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and any <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="j element-of StartSet 0 comma ellipsis comma n EndSet"> <mml:semantics> <mml:mrow> <mml:mi>j</mml:mi> <mml:mo> ∈ </mml:mo> <mml:mo fence="false" stretchy="false">{</mml:mo> <mml:mn>0</mml:mn> <mml:mo>,</mml:mo> <mml:mo> … </mml:mo> <mml:mo>,</mml:mo> <mml:mi>n</mml:mi> <mml:mo fence="false" stretchy="false">}</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">j \in \{0, \ldots , n\}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , the mixed volume <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper V Subscript j Baseline equals upper V left-parenthesis upper K left-bracket j right-bracket comma minus upper K left-bracket n minus j right-bracket right-parenthesis"> <mml:semantics> <mml:mrow> <mml:msub> <mml:mi>V</mml:mi> <mml:mi>j</mml:mi> </mml:msub> <mml:mo>=</mml:mo> <mml:mi>V</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>K</mml:mi> <mml:mo stretchy="false">[</mml:mo> <mml:mi>j</mml:mi> <mml:mo stretchy="false">]</mml:mo> <mml:mo>,</mml:mo> <mml:mo> − </mml:mo> <mml:mi>K</mml:mi> <mml:mo stretchy="false">[</mml:mo> <mml:mi>n</mml:mi> <mml:mo> − </mml:mo> <mml:mi>j</mml:mi> <mml:mo stretchy="false">]</mml:mo> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">V_j = V(K[j], -K[n - j])</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is bounded by <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="StartBinomialOrMatrix n Choose j EndBinomialOrMatrix"> <mml:semantics> <mml:mrow> <mml:mstyle scriptlevel="0"> <mml:mrow class="MJX-TeXAtom-OPEN"> <mml:mo maxsize="1.2em" minsize="1.2em">(</mml:mo> </mml:mrow> </mml:mstyle> <mml:mfrac linethickness="0"> <mml:mi>n</mml:mi> <mml:mi>j</mml:mi> </mml:mfrac> <mml:mstyle scriptlevel="0"> <mml:mrow class="MJX-TeXAtom-CLOSE"> <mml:mo maxsize="1.2em" minsize="1.2em">)</mml:mo> </mml:mrow> </mml:mstyle> </mml:mrow> <mml:annotation encoding="application/x-tex">\binom {n}{j}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , with equality if and only if <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper K"> <mml:semantics> <mml:mi>K</mml:mi> <mml:annotation encoding="application/x-tex">K</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is a simplex. We demonstrate that several consequences of this conjecture are true: certain families of linear combinations of the <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper V Subscript j"> <mml:semantics> <mml:msub> <mml:mi>V</mml:mi> <mml:mi>j</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">V_j</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -s, arising from different geometric constructions, are bounded above by their values when one substitutes <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="StartBinomialOrMatrix n Choose j EndBinomialOrMatrix"> <mml:semantics> <mml:mrow> <mml:mstyle scriptlevel="0"> <mml:mrow class="MJX-TeXAtom-OPEN"> <mml:mo maxsize="1.2em" minsize="1.2em">(</mml:mo> </mml:mrow> </mml:mstyle> <mml:mfrac linethickness="0"> <mml:mi>n</mml:mi> <mml:mi>j</mml:mi> </mml:mfrac> <mml:mstyle scriptlevel="0"> <mml:mrow class="MJX-TeXAtom-CLOSE"> <mml:mo maxsize="1.2em" minsize="1.2em">)</mml:mo> </mml:mrow> </mml:mstyle> </mml:mrow> <mml:annotation encoding="application/x-tex">\binom {n}{j}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> for <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper V Subscript j"> <mml:semantics> <mml:msub> <mml:mi>V</mml:mi> <mml:mi>j</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">V_j</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , with equality if and only if <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper K"> <mml:semantics> <mml:mi>K</mml:mi> <mml:annotation encoding="application/x-tex">K</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is a simplex. One of our results implies that for any
BibTeX
@inproceedings{artsteinavidan2025unbalanced,
author = {Shiri Artstein-Avidan and Eli Putterman},
title = {{On unbalanced difference bodies and Godbersen’s conjecture}},
booktitle = {Proceedings of the American Mathematical Society},
year = {2025},
doi = {10.1090/proc/17428},
}