Volume-Constrained Euclidean Geometries

• Volume-Constrained Euclidean Geometries (VCEGs) are geometric frameworks defined by fixed-volume constraints on projections and subregions within Euclidean spaces.
• They underpin studies in projection-volume inequalities, low-dimensional volume-preserving embeddings, and continuous combinatorial geometry theorems with actionable metric insights.
• VCEGs extend to quantum gravity by constraining gravitational instantons, linking fixed-volume principles to partition functions and semiclassical gravitational analyses.

Volume-Constrained Euclidean Geometries (VCEGs) are geometric frameworks in which constraints are imposed on the volumes of projections, subregions, or entire manifolds in Euclidean or related metric spaces. These constraints drive rigorous analyses of feasibility, embedding, partitioning, and action principles across convex geometry, computational topology, Riemannian geometry, and quantum gravity. VCEGs are central to multiple research threads: characterizing constructible regions of projection-volumes, defining and bounding low-dimensional volume-preserving embeddings, designing quantitative combinatorial geometry theorems for continuous parameters, and constructing gravitational instanton solutions subject to fixed-volume constraints in semiclassical quantum gravity.

1. Constructible Regions and Projection-Volume Inequalities

Let $n \in \mathbb{N}$ and $T \subseteq \mathbb{R}^n$ compact. For each nonempty $S \subseteq [n] = \{1, \ldots, n\}$, denote $T_S$ as the orthogonal projection of $T$ onto the subspace spanned by axes in $S$. The log-projection vector $\pi(T) \in \mathbb{R}^{2^n-1}$ is

$\pi(T)_S = \log \operatorname{vol}(T_S),$

where $\operatorname{vol}(T_S)$ is the $|S|$-dimensional Lebesgue volume. A vector $\pi \in \mathbb{R}^{2^n-1}$ is said to be constructible if there exists some compact $T \subseteq \mathbb{R}^n$ with $\pi(T) = \pi$. The set of all such constructible vectors forms the constructible region $\Psi_n$.

The structure of $\Psi_n$ is governed by linear inequalities. Bollobás and Thomason established in 1995 that every constructible $\pi$ must satisfy uniform-cover inequalities. For a $k$-cover $\mathcal{A}$ of $S \subseteq [n]$, where each $x \in S$ appears exactly $k$ times among the sets in $\mathcal{A}$, one has

$k \pi_S \le \sum_{A \in \mathcal{A}} \pi_A.$

The cone of vectors satisfying all such inequalities is denoted BT, and always satisfies $\Psi_n \subseteq \text{BT}$ (Tan et al., 2014).

A generalization, the nonuniform-cover (NC) inequalities, considers paired multi-families $\mathcal{A} = \{A_1, \ldots, A_k\}$, $\mathcal{B} = \{B_1, \ldots, B_m\}$; with conditions on element multiplicities and inclusion relations, one has

$\sum_{i=1}^k \pi_{A_i} \ge \sum_{j=1}^m \pi_{B_j}.$

NC contains BT, with $\Psi_n \subseteq \text{NC} \subseteq \text{BT}$. A key result is that any valid homogeneous linear inequality for $\Psi_n$ is a nonnegative combination of NC-inequalities (Tan et al., 2014).

2. Non-Convexity and Combinatorial Counterexamples

The constructible region $\Psi_n$ is not convex for $n \ge 4$; thus, no finite or infinite family of linear inequalities—neither NC nor BT—defines $\Psi_n$ exactly. This is demonstrated by constructing points in the NC-cone on certain faces that cannot be realized by any compact set. Skeleton and union-of-two-box combinatorial constructions explicitly refute subclasses of NC-inequalities lying strictly outside BT (Tan et al., 2014).

These findings establish the strict containments:

$$\text{RF} = \text{NC} \subsetneq \Psi_n \subsetneq \operatorname{Conv}(\Psi_n) \subsetneq \text{BT},$$

where RF represents the rectangular-flower cone (cornered sets with axis-aligned projections).

3. Conjectured Characterization and Structural Implications

While $\Psi_n$ itself is non-polyhedral and non-convex, its convex hull is conjectured to be the BT cone: $\operatorname{Conv}(\Psi_n) = \text{BT}$ (Tan et al., 2014). This suggests that every linear inequality valid for all constructible $\pi$ is a nonnegative combination of uniform-cover (BT) inequalities. Thus, linear feasibility and constraint systems for projection-volumes can be fully understood via BT, if the conjecture is affirmed.

A plausible implication is that further nonlinear or combinatorial conditions will be required to fully characterize actual constructible projection-volume vectors for $n \ge 4$.

4. Low-Dimensional Volume-Preserving Embeddings

Volume constraints arise in dimension reduction and embedding problems: given $n$ points in $\mathbb{R}^N$, what is the minimal distortion of simplex volumes under linear projection to $\mathbb{R}^d$? For $d \ge 3$, there exists a linear mapping $f : P \to \mathbb{R}^d$ such that for all $S \subseteq P$, $|S| \le \lfloor d/2 \rfloor$,

$$1 \le \left( \frac{\operatorname{Vol}(f(S))}{\operatorname{Vol}(S)} \right)^{1/(|S|-1)} \le c_4 n^{2/d} \sqrt{\ln n \ln \ln n}$$

with $c_4 > 0$ an absolute constant (Zouzias, 2010). This worst-case distortion bound and its random Gaussian construction generalize the Johnson–Lindenstrauss lemma to higher-order volumes. The guarantee only holds for subsets with $|S| \le \lfloor d/2 \rfloor$, with collapse of larger simplices inevitable.

Such embeddings are used in discrete geometry, computational topology, and data analysis, wherever the preservation of higher-order geometric invariants (simplicial volumes, orientations) under projection is required.

5. Quantitative Combinatorial Geometry with Volume Constraints

Quantitative analogues of Carathéodory’s, Helly’s, and Tverberg’s theorems extend classical combinatorial geometry into continuous, volume-constrained settings (Loera et al., 2016). For example:

• Carathéodory: For each convex $K \subset \mathbb{R}^d$ and $\varepsilon > 0$, there exists a polytope $P \subset K$ with $O((d/\varepsilon)^{(d-1)/2})$ vertices and $$\operatorname{Vol}(P) \ge (1-\varepsilon)\operatorname{Vol}(K)$$.
• Helly: For any finite family of convex sets in $\mathbb{R}^d$, if every subfamily of size $n^*(d, \varepsilon)d$ has intersection with volume at least $1$, then the full intersection has volume $\ge 1/(1+\varepsilon)$.
• Tverberg: Partitioning sufficiently many point sets, each containing a unit ball, into $m$ parts yields convex hulls whose intersection contains a ball of radius $r(d) = \frac{\pi}{e^2}d^{-2d-2}$.

These theorems enable sensor-placement, robust coverage, and fair-division problems in VCEG settings, where volume (or other continuous metrics) controls resources or guarantees.

Major open problems include sharpening $n(d, \varepsilon)$ and $n^*(d, \varepsilon)$ asymptotics, removing prime-power restrictions, and extending quantitative analogues to other geometric functionals (surface-area, mean-width).

6. Euclidean Volume Growth in Riemannian Manifolds

Volume constraints are fundamental in estimating geodesic-ball growth in Riemannian geometry. For a complete $n$-manifold $(M^n, g)$,

$\operatorname{Vol}(B(p, r)) \leq C r^n$

holds under various curvature and spectral hypotheses (Carron, 2020). Bishop-Gromov monotonicity under Ricci $\geq 0$, integral bounds on negative Ricci part $\operatorname{Ric}_-$, conformal scalar or $Q$-curvature control, and nonnegativity of operators like $\Delta_g + \lambda K_g$ are among the conditions yielding such estimates.

The volume-growth law underpins upper bounds in geometric analysis, singularity formation, parabolicity, and the sharpness of volume-preservation in embeddings.

7. Gravitational Partition Functions and Volume Constraints

The gravitational Euclidean action with fixed-volume constraint produces new classes of volume-constrained Euclidean geometries (Wu et al., 13 Dec 2025). In $D = d+2$ dimensions, constraining the spatial slice volume leads to Einstein equations with an effective “pressure” and builds a variational bridge to gravitational thermodynamics:

$$S_E[g, \lambda] = -\frac{1}{16\pi} \int_M d^Dx \sqrt{g} R - \int d\tau \lambda(\tau) \left( \int_{\Sigma_\tau} d^{D-1}x \sqrt{\gamma} - V \right) - \frac{1}{8\pi} \int_{\partial M} d^{D-1}x \sqrt{h} K$$

Solving yields massless and massive VCEG branches, single- and two-horizon solutions, and explicit relations between the on-shell Euclidean action and horizon areas:

$S_E = -\frac{1}{4} \mathcal{A}_{\text{hor}},$

with the two-horizon “extended VCEGs” satisfying

$S_E = -\frac{1}{4}(\mathcal{A}_c + \mathcal{A}_e).$

Conical singularities are present except at a critical mass $m^*$, leading to the “critical extended VCEG”—a regular, two-horizon instanton. These constrained instantons contribute to the gravitational partition function and semiclassical decay amplitudes, and closely mirror the structure of Euclidean Schwarzschild–de Sitter solutions, with the volume constraint playing a role analogous to a cosmological constant.

A plausible implication is that, in quantum gravity, fixed-spatial-volume VCEGs broaden the instanton landscape and may affect semiclassical transition amplitudes and microcanonical ensemble formulations.

---

The study of VCEGs lies at the interface of combinatorial geometry, metric analysis, embedding theory, and quantum gravity, with each domain shaped by rigorous volume constraints at the foundational level.