🔢 mathematics

The many-body Blaschke-Santaló type inequality via optimal transport

This paper proves the sharp many-body Blaschke-Santaló inequality for origin-symmetric sets under a specific pairwise inner product constraint, characterizes all equality cases using multi-marginal optimal transport and pseudo-Euclidean volume estimates, and extends the result to a functional version.

Original authors: Shibing Chen, Yuanyuan Li, Dongmeng Xi, Zhe-Feng Xu

Published 2026-06-30

📖 5 min read🧠 Deep dive

CC0 1.0

Original authors: Shibing Chen, Yuanyuan Li, Dongmeng Xi, Zhe-Feng Xu

Original paper dedicated to the public domain under CC0 1.0 (http://creativecommons.org/publicdomain/zero/1.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you have a group of friends, each holding a shape (like a balloon or a piece of clay) in a multi-dimensional room. These shapes are all centered around the same spot (the origin). Now, imagine there's a strict rule about how these friends can interact: if you pick one point from each friend's shape and look at how they "push" against each other, the total amount of that pushing force cannot exceed a specific limit.

This paper is about a mathematical rule that limits how much "space" (volume) these shapes can take up together, given that strict interaction rule.

Here is the breakdown of the story the authors tell:

1. The Old Rule (The Two-Person Dance)

For a long time, mathematicians knew a famous rule about two shapes. If you have two shapes that are "polar opposites" (like a circle and a square that fit perfectly inside each other in a specific way), there is a maximum limit to the product of their sizes. If they reach this maximum size, they must be perfect circles (or ellipses). This is like a dance where two partners can only move so far apart before they hit an invisible wall.

2. The New Challenge (The Group Hug)

The authors asked: What happens if we have three or more shapes (a "many-body" problem) instead of just two?

The Setup: We have $k$ shapes ( $K_1, K_2, \dots, K_k$ ).
The Rule: For any point you pick from shape 1, shape 2, up to shape $k$ , the sum of their "inner pushes" (mathematically, the sum of their dot products) must stay below a certain number.
The Question: What is the maximum total volume these shapes can have combined?

3. The Big Discovery

The authors proved a sharp limit: The product of the volumes of all these shapes cannot exceed the volume of a perfect ball raised to the power of $k$ .

The Twist: The behavior changes completely depending on the number of people in the group.
- If there are 2 people: The shapes can be any stretched-out ellipses (like a squashed circle), as long as they are "polar opposites" of each other. The system is flexible.
- If there are 3 or more people: The system becomes incredibly rigid. The only way to reach the maximum size is if every single shape is a perfect, round ball (a sphere), and they are all exactly the same size. You cannot stretch them or squish them; they must be perfect spheres.

4. How They Solved It (The Magic Map)

To prove this, the authors used a powerful tool called Optimal Transport.

The Analogy: Imagine you have a pile of sand (one shape) and you want to move it to match the shape of another pile of sand (another shape) using the least amount of energy. The "best" way to do this is like a map that tells every grain of sand exactly where to go.
The Multi-Group Map: The authors extended this idea to move sand from one central source to multiple destinations simultaneously.
The Hidden Geometry: When they looked at the path these "grains of sand" take, they discovered a hidden geometric structure. It's like looking at a 3D object through a special pair of glasses that turns the space into a "pseudo-Euclidean" world (a space where some directions act like distance and others act like time).
The Result: In this special geometric world, the collection of all these optimal paths forms a "spacelike graph." The authors then proved that the volume of this graph is limited by the size of a perfect ball. This geometric limit forced the original shapes to be perfect balls if they wanted to be as big as possible.

5. The Functional Version (The Shadow Play)

The paper also translates this geometric rule into a "functional" version.

Instead of solid shapes, imagine you have "clouds" of probability (like fog) that are denser in the middle and thinner at the edges.
The rule says: If the product of the densities of these $k$ clouds at any set of points is limited by a specific formula, then the total amount of "fog" (the integral) is also limited.
The Conclusion: Just like with the solid shapes, if you have 3 or more clouds and they hit the maximum limit, they must all be perfectly round, identical clouds.

Summary

In simple terms, this paper proves that in a group of three or more, perfection is the only way to maximize size.

With two partners, you can be flexible and stretchy.
With three or more, the constraints of the group force everyone to be a perfect, identical sphere to achieve the maximum possible size.

The authors used advanced math involving "moving sand" (optimal transport) and "special geometry" (pseudo-Euclidean spaces) to prove that this rigidity is unavoidable.

Technical Summary: The Many-Body Blaschke–Santaló Type Inequality via Optimal Transport

Problem Statement
The paper addresses a sharp upper bound for the "many-body" volume product of origin-symmetric measurable sets in $\mathbb{R}^n$ . Specifically, given $k$ sets $K_1, \dots, K_k \subset \mathbb{R}^n$ with finite volume, the authors investigate the constraint where the sum of pairwise inner products is bounded:
$\sum_{1 \le i < j \le k} \langle x_i, x_j \rangle \le C_k, \quad \forall x_i \in K_i, x_j \in K_j,$
where $C_k = \binom{k}{2}$ . The goal is to prove the conjectured inequality:
$\prod_{i=1}^k |K_i| \le |B_n|^k,$
where $|B_n|$ is the volume of the Euclidean unit ball. Furthermore, the paper aims to characterize the equality cases, distinguishing between the two-body case ( $k=2$ ) and the many-body case ( $k \ge 3$ ). This problem arises as a geometric counterpart to functional inequalities proposed by Kolesnikov and Werner and Kalantzopoulos and Saroglou.

Methodology
The proof synthesizes tools from multi-marginal optimal transport and pseudo-Euclidean geometry. The methodology proceeds through the following logical steps:

Convexification: The problem is first reduced from general measurable sets to origin-symmetric convex bodies by replacing sets with their closed convex hulls, preserving the interaction constraint.
Optimal Transport Formulation: The authors utilize the quadratic multi-marginal optimal transport problem. They consider the equal-weight Wasserstein barycenter $\nu$ of the uniform measures on $K_i$ . By Brenier's theorem, there exist optimal transport maps $T_i = \nabla \phi_i$ from $\nu$ to the uniform measures on $K_i$ .
Pseudo-Euclidean Structure: The support of the optimal plan $\gamma = (T_1, \dots, T_k)_\# \nu$ is analyzed. The authors define a bilinear form $B$ on $(\mathbb{R}^n)^k$ such that $B(X, X) = 2 \sum_{i<j} \langle x_i, x_j \rangle$ . This form induces a pseudo-Euclidean metric of signature $(n, n(k-1))$ .
Graph Representation: Using Kantorovich duality and cyclical monotonicity, the support $\Gamma$ of the optimal plan is shown to be the graph of an odd, 1-Lipschitz map $f: A \to \mathbb{R}^{n(k-1)}$ defined on a subset $A \subset \mathbb{R}^n$ . The polarity condition translates to a "spacelike" condition: $|x|^2 - |f(x)|^2 \le 2C_k$ .
Volume Estimates:
- Lower Bound: Derived from the Monge–Ampère equations governing the barycenter maps. The authors establish a sharp determinant inequality relating the Jacobians of the transport maps to the pseudo-volume of the graph $\Gamma$ .
- Upper Bound: Derived from a pseudo-Euclidean volume estimate for spacelike graphs. The authors adapt Li's Dirichlet theory for maximal submanifolds to show that the pseudo-volume of such a graph is bounded by the volume of a pseudo-ball determined by the constraint $C_k$ .

Key Contributions and Results

Proof of the Geometric Inequality (Theorem 1.1): The authors prove that for any origin-symmetric measurable sets satisfying the pairwise interaction constraint, the product of their volumes is bounded by $|B_n|^k$ .
Rigidity of Equality Cases: The paper establishes a sharp distinction between $k=2$ $k = 2$ and $k \ge 3$ $k \geq 3$ :
- Case $k=2$ : Equality holds if and only if $K_1$ and $K_2$ are polar dual ellipsoids (i.e., $K_1 = A B_n$ and $K_2 = A^{-\top} B_n$ for some $A \in GL(n)$ ). This recovers the classical affine invariance of the Blaschke–Santaló inequality.
- Case $k \ge 3$ : Equality holds if and only if all sets are identical Euclidean balls ( $K_1 = \dots = K_k = B_n$ ). The pairwise constraints impose additional rigidity that eliminates the affine freedom present in the two-body case.
Functional Inequality (Theorem 1.2): Using the geometric-functional equivalence established by Kalantzopoulos and Saroglou, the paper extends these results to a functional setting. It proves that for even integrable functions $f_i$ satisfying a pointwise product constraint involving the interaction term $S_2$ , the product of their integrals is bounded. The equality cases are characterized similarly: for $k \ge 3$ , the functions must be identical Gaussian-type profiles (scaled by the interaction kernel).
New Geometric Tool: The paper introduces a sharp pseudo-Euclidean volume estimate for spacelike graphs (Lemma 4.1), utilizing a monotonicity argument for maximal spacelike submanifolds.

Significance
The paper claims significance in resolving a conjecture regarding the many-body volume product, demonstrating that the structure of equality becomes "rigid" when the number of bodies exceeds two. This rigidity contrasts with the classical two-body case, where affine transformations preserve equality. The work bridges the gap between optimal transport theory (specifically multi-marginal problems with quadratic costs) and affine isoperimetric inequalities. By identifying the optimal support as a spacelike graph in a pseudo-Euclidean space, the authors provide a novel geometric framework for analyzing many-body interactions, offering a unified approach to both geometric and functional versions of the Blaschke–Santaló inequality. The results confirm that the "many-body" extension of this classical inequality is strictly more restrictive than the classical case, forcing the extremizers to be Euclidean balls rather than general ellipsoids.