EHZ Capacity in Symplectic Topology
- EHZ capacity is a numerical invariant defined via the minimum action of closed characteristics on a symplectic domain, capturing its maximal 'size'.
- It features both variational and combinatorial formulations that reduce complex infinite-dimensional problems to finite, yet NP-hard, computations.
- This capacity is pivotal in understanding symplectic rigidity and periodic orbits, with applications in embedding problems and Hamiltonian dynamics.
The Ekeland–Hofer–Zehnder (EHZ) capacity is a fundamental numerical invariant in symplectic topology and Hamiltonian dynamics, quantifying the maximal “size” of a symplectic manifold or domain in terms of Hamiltonian dynamics. It is defined via action-minimizing closed characteristics and provides essential insight into the existence of periodic orbits and symplectic rigidity. The invariant encapsulates both global symplectic geometry (as in embedding problems) and fine dynamical properties, and comes in several variants, including coisotropic, relative, and generalized settings. The following sections elaborate on formal definitions, key properties, combinatorial and variational formulations, relations to other capacities, computational aspects, and major applications.
1. Formal Definition and Variational Characterization
The Ekeland–Hofer–Zehnder capacity of a compact convex domain is defined as the minimum action of closed characteristics on . For smooth ,
where , with the Liouville 1-form.
A fully variational characterization—via a minimax principle—also exists:
- The Ekeland–Hofer capacity for a Hamiltonian is
where is the action functional defined on an appropriate Sobolev space of loops.
- The Hofer–Zehnder capacity for an open set with symplectic form is
In convex domains, , and both coincide with the minimal action of a closed characteristic on (Gluskin et al., 2015, Haim-Kislev, 2017, Irie, 2019).
2. Combinatorial Formulas and Computational Complexity
A critical advance is the existence of explicit combinatorial formulas for , especially when is a convex polytope. Haim-Kislev’s formula for a convex polytope with outer facet normals and facet heights reads
where is the set of nonnegative weights satisfying normalization and equilibrium constraints. Alternatively, the minimum is taken over all collections : This formulation reduces the infinite-dimensional variational problem to finite combinatorics on facet data (Haim-Kislev, 2017, Shi et al., 2019).
However, the computational problem remains fundamentally hard: computing the capacity of a polytope is NP-hard, even in the case of simplices (Leipold et al., 15 Feb 2024). The reduction proceeds by encoding the feedback arc set problem in bipartite tournaments into the maximization problem of the capacity via the combinatorial formula, implying the absence of efficient general algorithms.
3. Relationships with Other Symplectic Capacities
In the landscape of symplectic capacities, occupies a central role:
- On convex centrally symmetric bodies, is asymptotically equivalent (up to dimension-independent constants) to the displacement energy, cylindrical, and linearized capacities:
where is the operator norm of the complex structure from the polar norm (Gluskin et al., 2015).
- The symplectic homology capacity coincides with for convex subsets of , as established via loop space homology isomorphisms (Irie, 2019).
- A “coisotropic” version localizes the capacity to measure the “symplectic size” relative to a coisotropic submanifold, with corresponding combinatorial formulas and (super)additivity properties in the presence of hyperplane cuts (Lisi et al., 2013, Shi et al., 2019).
4. Additivity, Inequalities, and Extremal Properties
Subadditivity and Brunn–Minkowski Type Inequalities
The capacity displays a subadditivity property for polytopes cut by hyperplanes: where are the resulting pieces (Haim-Kislev, 2017, Irie, 2019). This generalizes, via convex hulls, to more general sets. Furthermore, an analogue of the classical Brunn–Minkowski inequality holds for : providing a symplectic counterpart to convex geometry (Kerman et al., 2020). Notably, this property does not extend to higher-index capacities, which can violate such concavity.
Extremal Examples and Minimal Capacity
Among centrally symmetric convex bodies, a sharp lower bound is known (Berezovik, 2023): Construction of symplectically self-polar polytopes attaining equality demonstrates optimality.
Local maximizers of the normalized higher Ekeland–Hofer capacities on star-shaped domains in dimension four are precisely rational ellipsoids corresponding to “jump indices” determined by the Reeb flow period multiplicities (Baracco et al., 2023).
5. Generalizations and Relative Capacities
Several significant generalizations stretch the notion of EHZ capacity:
- Ψ-relative capacities: For a symplectomorphism , relabeling , one obtains “Ψ-Ekeland–Hofer–Zehnder” capacities with corresponding min–max and representation formulas, detecting generalized characteristics and leafwise intersection points. For convex domains,
(Jin et al., 2019, Shi et al., 2019).
- Coisotropic and Relative Capacities: Modifying admissibility to focus on leafwise return times enables the definition of capacities measuring the symplectic size “relative to” a coisotropic submanifold. These play a role in refined non-squeezing theorems and the existence theory for leafwise chords (Lisi et al., 2013, Shi et al., 2019).
- Symmetry Constraints: For convex domains invariant under an anti-symplectic involution , the -symmetrical EHZ capacity equals the classical EHZ capacity, as both select the minimal action in the symmetric class (Shi et al., 2020).
6. Applications, Impact, and Computational Directions
The EHZ capacity is instrumental in symplectic embedding problems, providing both upper and lower bounds for the “size” of sets under symplectic transformations; this includes non-squeezing and rigidity phenomena. Combinatorial formulas enable, in principle, explicit computation for polytopes, though NP-hardness places practical limitations on high-dimensional cases (Leipold et al., 15 Feb 2024). The capacity also encodes dynamical information, such as the threshold energy for the existence of (contractible or noncontractible) periodic orbits, connects to systolic inequalities, and informs systolic rigidity for metrics on surfaces (Benedetti et al., 2020, Bimmermann, 2020).
In toric symplectic manifolds, combinatorial invariants (toric width) derived from Delzant polytopes give effective lower bounds for , and hence in favorable circumstances (Liu, 2023). These provide computational tools via lattice point enumeration and facet combinatorics.
Most importantly, the EHZ capacity is the unique capacity (up to normalization and asymptotic equivalence) on centrally symmetric convex bodies in high dimensions, coinciding with the displacement energy and cylindrical capacities up to a universal constant (Gluskin et al., 2015).
7. Open Problems and Future Research
Substantial questions remain open regarding:
- The explicit computation of beyond low-dimensional or highly symmetric bodies, due to inherent NP-hardness.
- Volume-capacity inequalities and their role in Mahler’s and Viterbo’s conjectures (Berezovik, 2023).
- The algebraic and analytic structure of symplectic capacities, in particular, minimal generating sets and representability (Joksimović et al., 2020).
- Extension to infinite-dimensional (PDE) settings and further interactions with Floer and symplectic homology.
A plausible implication is that, while and its relatives encode deep symplectic properties and exhibit powerful rigidity, their full computational and dynamical landscape is governed by complex combinatorial and geometric structures whose complete classification remains open.