---
title: Hanner Polytopes in Convex Geometry
url: https://www.emergentmind.com/topics/hanner-polytopes
type: topic
---

# Hanner Polytopes in Convex Geometry

A Hanner polytope is a centrally symmetric convex polytope in $\mathbb{R}^d$ constructed recursively from the segment $[-1,1]$ using two fundamental operations: the Cartesian product and a direct-sum (or join) operation that interchanges with polarity. This class plays a central role in the extremal geometry of convex bodies, saturating several conjectured bounds—including Mahler’s volume product minimality and the minimal face-count ($3^d$) among centrally symmetric polytopes. Hanner polytopes underpin key themes in asymptotic convex geometry, combinatorics, and symplectic geometry.

## 1. Recursive Definition and Equivalent Characterizations

Let $K \subset \mathbb{R}^k$ and $L \subset \mathbb{R}^l$ be centrally symmetric convex bodies. One defines two direct sums in $\mathbb{R}^{k+l}$:
- **The $\ell_1$-sum** ($K \oplus_1 L$): unit ball of the norm $\Vert (x,y)\Vert_{K\oplus_1L} = \Vert x\Vert_K + \Vert y\Vert_L$, i.e.,
  \[
  K\oplus_1L = \{(x,y)\in \mathbb{R}^k\times\mathbb{R}^l : \Vert x\Vert_K + \Vert y\Vert_L \le 1\}
  \]
- **The $\ell_\infty$-sum** ($K \oplus_\infty L$): unit ball of the norm $\max\{\Vert x\Vert_K, \Vert y\Vert_L\}$, i.e.,
  \[
  K\oplus_\infty L = \{(x,y)\in \mathbb{R}^k\times\mathbb{R}^l : \max\{\Vert x\Vert_K, \Vert y\Vert_L\} \le 1\}
  \]

**Recursive construction**:  
- Base case: $n=1$, $H=[-1,1]$
- Inductive step: if $K \subset \mathbb{R}^k$ and $L \subset \mathbb{R}^l$ are Hanner polytopes, then both $K\oplus_1L$ and $K\oplus_\infty L$ are Hanner polytopes in $\mathbb{R}^{k+l}$.

Equivalently, a Hanner polytope in $\mathbb{R}^d$ is any 0-symmetric polytope obtained from $[-1,1]$ by a finite sequence of Cartesian products and (dually) convex hull sums, or by closing under products and polarity [1409.5782, 2308.02909]. The cube and cross-polytope represent extremal cases in this class.

## 2. Structural and Geometric Properties

Hanner polytopes exhibit several structural features:
- **Self-Duality:** The polar of a Hanner polytope is again a Hanner polytope, with $(K\oplus_1L)^\circ = K^\circ \oplus_\infty L^\circ$, $(K\oplus_\infty L)^\circ = K^\circ \oplus_1 L^\circ$ [1409.5782].
- **Central Symmetry and Unconditionality:** Every Hanner polytope, and each of its faces, is centrally symmetric. In coordinate presentations, Hanner polytopes are unconditional—i.e., invariant under reflection in any coordinate hyperplane [2308.02909].
- **Product Structure of Face Lattice:** The nonempty faces of a product $P_1\times P_2$ are direct products of faces, while those of a sum (join) $P_1\oplus P_2$ are joins of faces. The face lattice is recursively generated, forming a distributive, relatively complemented lattice generalizing the Boolean lattice of the cube [2308.02909].
- **Facet Structure:** Facets of $K\oplus_\infty L$ are either $F_K\times L$ or $K\times F_L$; facets of $K\oplus_1L$ are $\mathrm{conv}(F_K\times\{0\} \cup \{0\} \times F_L)$ [1409.5782].
- **Graph-Theoretic Characterization:** In combinatorial settings, Hanner polytopes can be identified with perfect graphs having no induced 4-vertex paths (cographs), and explicit bijections are established in certain locally anti-blocking or Hansen polytope constructions [1201.5790, 2507.22284].

## 3. Combinatorics: Face Numbers, Flags, and Extremality Results

Hanner polytopes play a central role in minimal face-number phenomena:
- **Kalai’s $3^d$ Conjecture:** Every centrally symmetric $d$-polytope has at least $3^d$ faces; this minimal value is realized exactly by Hanner polytopes [2308.02909]. For Hanner polytopes, the sum $s(P) = \sum_{i=0}^d f_i(P) = 3^d$, where each operation in the recursive construction multiplies the total by 3 [2308.02909]. Individual face numbers vary (e.g., cube vs cross-polytope), but the total is always $3^d$.
- **Flag-face Inequality and Full-Flag Count:** For locally anti-blocking centrally symmetric polytopes, the number of full face-flags satisfies $f_{[d]}(P) \ge 2^d d!$, with equality only for (generalized) Hanner polytopes [2507.22284].
- **Explicit Formulas:** For the $d$-cube, $f_i = 2^{d-i}\binom{d}{i}$; for the cross-polytope, $f_i = 2^{i+1}\binom{d}{i+1}$ [2507.22284, 2603.03861].
- **Extremality in Hansen Polytopes:** Among Hansen polytopes (twisted prisms of stable set polytopes of split graphs), the Hanner polytopes are precisely those associated to threshold graphs, and have $3^d$ faces, saturating Kalai’s conjecture [1201.5790].

## 4. Mahler’s Conjecture and Volume Product Minimality

Hanner polytopes are tightly connected to Mahler’s conjecture regarding the minimal volume product of centrally symmetric convex bodies:
- **Volume Product Formula:** For $H$ a Hanner polytope in $\mathbb{R}^n$, the product $\mathrm{vol}(H)\mathrm{vol}(H^\circ) = 4^n/n!$, which matches that of the $n$-cube and $n$-cross-polytope [1409.5782, 1212.2544].
- **Global and Local Minimality:** Every Hanner polytope attains the conjectured minimum of the Mahler product among symmetric convex bodies. Moreover, Hanner polytopes are strict local minimizers for the volume product in the Banach–Mazur topology: if a symmetric convex body is sufficiently close to a Hanner polytope, its volume product exceeds that of the Hanner polytope by a uniform margin [1212.2544].
- **Combinatorial and Dynamical Evidence:** The structural features and billiard-dynamical sharpness (discussed below) further underpin their uniqueness as extremal cases for the volume product.

## 5. Closed Billiard Trajectories, Symplectic Geometry, and Equality Cases

A profound connection between Hanner polytopes and symplectic/integrable geometry emerges via billiard dynamics:
- **Shortest Closed Billiard Trajectories:** In the geometry defined by a Hanner polytope $H$ and its polar, the shortest classical billiard orbit in $H$ with $H^\circ$-reflection law is always a centrally symmetric $2n$-periodic path of length 4 (with $n=\dim H$) [1409.5782].
- **Symplectic Capacity:** The length of the shortest closed trajectory equals the Hofer–Zehnder capacity $c_{HZ}(H\times H^\circ) = 4$. This is precisely matched to the minimal Mahler volume product, reflecting an equivalence between dynamical and mixed-volume extremality [1409.5782].
- **Viterbo’s and Mahler’s Inequalities:** These dynamical and volumetric properties demonstrate that Hanner polytopes are the unique cases realizing equality in both conjectures. This provides a symplectic-geometric proof strategy for identifying extremals.

## 6. Asymptotics, Applications, and Further Examples

Recent work extends the combinatorial investigations to asymptotic dimensions and functional bounds:
- **Asymptotic Growth of Face Numbers:** Certain parametric families $P_n^a$ of Hanner polytopes interpolate between the cube and cross-polytope. For dimension $d=2^n$ and $k\sim d^\delta$, the exponential growth rate of the number of $k$-faces satisfies
  \[
  \log f_k(P_n^a) \sim d^{\,a + \delta(1-a)}
  \]
  for rational $a \in (0,1)$, with analogous bounds for irrational $a$ [2603.03861].
- **Saturation of Functional Inequalities:** Sections of Hanner polytopes nearly saturate the Figiel–Lindenstrauss–Milman (FLM) inequality for choices of parameters governing the relationship of face numbers, facet numbers, and geometric ratios [2603.03861].
- **Explicit Cases:** The construction includes all standard centrally symmetric polytopes as special cases, with the $d$-cube and $d$-cross-polytope providing combinatorially extreme ends of the family [2308.02909, 2603.03861].

## 7. Open Problems and Perspectives

Hanner polytopes serve as test cases for several outstanding conjectures and structural questions:
- **Universality of $3^d$ Bound and Flag-Minimality:** Kalai’s $3^d$ conjecture and its strengthened flag-variant predict that all centrally symmetric polytopes have at least as many faces (or flags) as a Hanner polytope in the same dimension, with equality only for Hanner polytopes. Full proofs remain open in generality [2308.02909, 2507.22284].
- **Classification of Extremals and Stability:** The precise extent to which proximity to the Hanner class is necessary for (near-)minimal face counts, and what polytopes lie strictly above the $3^d$ threshold, remain active research directions [1212.2544].
- **Combinatorial Realizations and Generalized Constructions:** Alternative combinatorial and graph-theoretic characterizations, including cograph representation and connection to threshold and split graphs, illuminate the structure of Hanner polytopes within broader polytope families [1201.5790, 2507.22284].

The centrality of Hanner polytopes in the intersection of convex, discrete, and symplectic geometry continues to motivate further investigations into extremal and stability phenomena in high-dimensional convex analysis.

Source: https://www.emergentmind.com/topics/hanner-polytopes