Abstract
We rigorously state the connection between the EHZ-capacity of convex Lagrangian products \(K\times T\subset \mathbb {R}^n\times \mathbb {R}^n\) and the minimal length of closed (K, T)-Minkowski billiard trajectories. This connection was made explicit for the first time by Artstein–Avidan and Ostrover under the assumption of smoothness and strict convexity of both K and T. We prove this connection in its full generality, i.e., without requiring any conditions on the convex bodies K and T. This prepares the computation of the EHZ-capacity of convex Lagrangian products of two convex polytopes by using discrete computational methods.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction and Main Result
Simply put, this paper is about the connection between the symplectic size of certain convex bodies in \(\mathbb {R}^{2n}\), \(n\ge 1\), and the length of certain minimal periodic billiard trajectories on that convex bodies, more precisely, it is about the connection between the EHZ-capacity of convex Lagrangian products
and the minimal \(\ell _T\)-length of closed (K, T)-Minkowski billiard trajectories.
Let us first introduce these two quantities one by one.
1.1 The EHZ-Capacity of Convex Lagrangian Products
The EHZ-capacity of a convex set \(C\subset \mathbb {R}^{2n}\) is
where a closed characteristic on \(\partial C\) is an absolutely continuous loop in \(\mathbb {R}^{2n}\) satisfying
where is the symplectic matrix, \(\partial \) the subdifferential-operator, and
the Minkowski functional. By \(\mathbb {A}(x)\) we denote the loop’s action given by
We remark that the above definition of the E(keland)H(ofer)Z(ehnder)-capacity is the outcome of a historically grown study of symplectic capacities. More precisely, it is the generalization (to the non-smooth case) by Künzle in [14] of a symplectic capacity that originally represented the coincidence of the Ekeland–Hofer- and Hofer–Zehnder-capacities constructed in [9] and [13], respectively.
Let us clarify the notion of Lagrangian products in \(\mathbb {R}^{2n}\).
On \(\mathbb {R}^{2n}\) there exists a natural symplectic structure such that \(x\in \mathbb {R}^{2n}\) can be written as
where \(q=(q_1,..,q_n)\) represent the local and \(p=(p_1,...,p_n)\) the momentum coordinates in the classical physical phase space
This phase space is equipped with the standard symplectic 2-form \(\omega _0\) which satisfies
The Hamiltonian “vector” field
of the Hamiltonian differential inclusion (1) is determined by
and the action of a closed curve \(\gamma \) by
Now, a product \(K\times T\subset \mathbb {R}^{2n}\) is called Lagrangian if \(K\subset \mathbb {R}^n_q\) and \(T\subset \mathbb {R}^n_p\).
1.2 Minkowski billiards
Minkowski billiards are the natural extensions of Euclidean billiards to the Finsler setting.
Euclidean billiards are associated to the local Euclidean billiard reflection rule: The angle of reflection equals the angle of incidence (assuming that the relevant normal vector as well as the incident and the reflected ray lie in the same two-dimensional affine flat). This local Euclidean billiard reflection rule follows from the global least action principle. For a reflection on a hyperplane this principle means that a billiard trajectory segment \((q_{j-1},q_j,q_{j+1})\) minimizes the Euclidean length in the space of all paths connecting \(q_{j-1}\) and \(q_{j+1}\) via a reflection at this hyperplane.
In Finsler geometry, the notion of length of vectors in \(\mathbb {R}^n\) is given by a convex body \(T\subset \mathbb {R}^n\), i.e., a compact convex set in \(\mathbb {R}^n\) which has the origin in its interior (in \(\mathbb {R}^n\)). The Minkowski functional \(\mu _T\) determines the distance function, where we recover the Euclidean setting when T is the n-dimensional Euclidean unit ball. Then, heuristically, billiard trajectories are defined via the global least action principle with respect to \(\mu _T\), because in Finsler geometry, there is no useful notion of angles.
Here, convexity of \(T\subset \mathbb {R}^n\) means that for every boundary point \(z\in \partial T\) there is a hyperplane H with its associated open half spaces \(\mathring{H}^+\) and \(\mathring{H}^-\) of \(\mathbb {R}^n\) such that either \(T\cap \mathring{H}^+=\emptyset \) or \(T\cap \mathring{H}^-=\emptyset \). We call \(T\subset \mathbb {R}^n\) strictly convex if for every boundary point \(z\in \partial T\) and every unit vector in the outer normal cone
the hyperplane H in \(\mathbb {R}^n\) containing z and normal to n satisfies \(H\cap T =\{z\}\).
Let us precisely define Minkowski billiard trajectories. As we have shown in [16], it makes sense to differentiate between weak and strong Minkowski billiard trajectories.
Definition 1
(Weak Minkowski billiard trajectories) Let \(K\subset \mathbb {R}^n\) be a convex body. Let \(T\subset \mathbb {R}^n\) be another convex body and
its polar body. We say that a closed polygonal curveFootnote 1 with vertices \(q_1,...,q_m\), \(m\in \mathbb {N}_{\ge 2}\), on the boundary of K is a closed weak (K, T)-Minkowski billiard trajectory if for every \(j\in \{1,...,m\}\), there is a K-supporting hyperplane \(H_j\) through \(q_j\) such that \(q_j\) minimizes
over all \(\bar{q}_j\in H_j\) (see Fig. 1). We encode this closed weak (K, T)-Minkowski billiard trajectory by \((q_1,...,q_m)\) and call its vertices bouncing points. Its \(\ell _T\)-length is given by
We call a boundary point \(q\in \partial K\) smooth if there is a unique K-supporting hyperplane through q. We say that \(\partial K\) is smooth if every boundary point is smooth (we also say K is smooth while we actually mean \(\partial K\)).
We remark that, in general, the K-supporting hyperplanes \(H_j\) in Definition 1 are not uniquely determined. One can prove that this is only the case for smooth and strictly convex T (see [16]).
We note that the weak Minkowski billiard reflection rule does not only generalize the Euclidean billiard reflection rule to Finsler geometries, it also extends the classical understanding of billiard trajectories–which are usually understood as trajectories with bouncing points in smooth boundary points (billiard table cushions) while they terminate in non-smooth boundary points (billiard table pockets)–to non-smooth billiard table boundaries. To the author’s knowledge, the papers [5] (’89), [10] (’04), and [6] (’09) were among the first suggesting a detailed study of these generalized billiard trajectories.
In the case when \(T^\circ \) is smooth and strictly convex, Definition 1 yields a geometric interpretation of the billiard reflection rule: On the basis of Lagrange’s multiplier theorem, one derives the condition
where \(\mu _j>0\), since the strict convexity of \(T^\circ \) implies
and where \(n_{H_j}\) is the outer unit vector normal to \(H_j\). This implies that the weak Minkowski billiard reflection rule can be illustrated as within Fig. 2. For smooth, strictly convex, and centrally symmetric \(T^ \circ \subset \mathbb {R}^n\), this interpretation is due to [11, Lemma 3.1, Corollary 3.2 and Lemma 3.3] (this interpretation has also been referenced in [2]). For the extension to just smooth and strictly convex \(T^\circ \subset \mathbb {R}^n\), it is due to [7, Lemma 2.1]. However, from the constructive point of view, this interpretation has its limitations.
Definition 2
(Strong Minkowski billiards) Let \(K,T\subset \mathbb {R}^n\) be convex bodies. We say that a closed polygonal curve q with vertices \(q_1,...,q_m\), \(m\in \mathbb {N}_{\ge 2}\), on \(\partial K\) is a closed strong (K, T)-Minkowski billiard trajectory if there are points \(p_1,...,p_m\) on \(\partial T\) such that
is satisfied for all \(j\in \{1,...,m\}\). We call \(p=(p_1,...,p_m)\) a closed dual billiard trajectory in T. We denote by \(M_{n+1}(K,T)\) the set of closed (K, T)-Minkowski billiard trajectories with at most \(n+1\) bouncing points.
Definition 2 appeared implicitly in [11, Theorem 7.1], then later the first time explicitly in [3]. It yields a different interpretation of the billiard reflection rule. Without requiring a condition on T, the billiard reflection rule can be represented as within Fig. 3. From the constructive point of view, this interpretation is much more appropriate in comparison to the one for weak Minkowski billiards.
The natural follow-up question concerns the relationship between weak and strong Minkowski billiards. In [16, Theorem 1.3], we have shown the following for convex bodies \(K,T\subset \mathbb {R}^n\): Every closed strong (K, T)-Minkowski billiard trajectory is a weak one. If T is strictly convex, then every closed weak (K, T)-Minkowski billiard trajectory is a strong one. This is a sharp result in the following sense: One can construct convex bodies \(K,T\subset \mathbb {R}^n\) (where T is not strictly convex) and a closed weak (K, T)-Minkowski billiard trajectory which is not a strong one (see Example A in [16]).
In the following–if the risk of confusion is excluded–we will call strong Minkowski billiards trajectories just Minkowski billiard trajectories.
1.3 Main Result
For a convex body \(K\subset \mathbb {R}^n\), we define the set \(F_{n+1}^{cp}(K)\) as the set of all closed polygonal curves \(q=(q_1,...,q_m)\) with \(m\le n+1\) that cannot be translated into \(\mathring{K}\).
Our main result concerning the connection between the minimal \(\ell _T\)-length of closed (K, T)-Minkowski billiard trajectories and the EHZ-capacity of convex Lagrangian products \(K\times T\) reads:
Theorem 1
Let \(K,T\subset \mathbb {R}^n\) be convex bodies such that \(K\times T\subset \mathbb {R}^{2n}\) is a convex Lagrangian product. Then, we have
We note that under the condition of strict convexity of T, the statement of Theorem 1 also holds for \(\ell _T\)-minimizing closed weak (K, T)-Minkowski billiard trajectories. In the general case, this is not true. When T is not strictly convex, then one can have
(see [16, Example E], where \(q=(q_1,q_2,q_3)\) is a closed weak Minkowski billiard trajectory which is shorter than any closed strong Minkowski billiard trajectory), and it even can happen that there is no \(\ell _T\)-minimizing closed weak (K, T)-Minkowski billiard trajectory at all (see [16, Example G]; while in Example E instead, there exists a minimizer).
In order to classify Theorem 1 against the background of current research, we note that the relationship between action-minimizing closed characteristics on \(\partial (K\times T)\) and \(\ell _T\)-minimizing closed (K, T)-Minkowski billiard trajectories was made explicit for the first time by Artstein-Avidan and Ostrover in [3]. However, two points in particular must be taken into account here: First, they showed this relationship only under the assumption of smoothness and strict convexity of both K and T. In particular, if one intends to compute the length-minimizing trajectories (as we have described in [16] for the 4-dimensional case), this is not so effective, since for this, one would typically use convex polytopes, which are neither smooth nor strictly convex. Secondly, their definition of closed (K, T)-Minkowki billiard trajectories slightly differed from ours. They used the notion of closed Minkowski billiard trajectories for closed trajectories which arised within their characterization of closed characteristics on \(\partial (K\times T)\). As consequence, they had to take trajectories into account, for example, which intuitively had no relation to billiard trajectories and could produce ugly behaviour (see [12])–they called them gliding billiard trajectories. As part of our approach, we were able to avoid considering such trajectories, allowing us to focus entirely on trajectories that are commonly understood as billiard trajectories and which, in the case of strict convexity of T, i.e., when weak and strong Minkowski billiards coincide, in fact can be traced back to the classical least action principle.
Besides what has been proved by Artstein-Avidan and Ostrover, Alkoumi and Schlenk indicated in [2] Theorem 1 for the case \(K,T\subset \mathbb {R}^2\), where T is additionally assumed to be smooth and strictly convex. Balitskiy showed in [4] the first equality of the statement in Theorem 1 under the assumption of smoothness of T.
We note that the generality of Theorem 1 is central to understand the different characterizations of action-minimizing closed characteristics in more detail. For instance, it will be our starting point when analyzing Viterbo’s conjecture for Lagrangian products in [17]. The generality of this theorem is essential for being able to apply it on convex polytopes, what would not be possible based on the lesser general statement in [3], but which is essential in order to develope an algorithm for the computation of the EHZ-capacity of convex Lagrangian products.
Let us briefly give an overview of the structure of this paper: In Sect. 2, we recall useful results from [16]. In Sect. 3, we prove Theorem 1 by mainly stating three theorems, whose proofs we outsourced in Sects. 4, 5, and 6.
2 Preliminaries
We recall statements from [16] which will be used within the following proofs.
Proposition 1
(Proposition 3.4 in [16]) Let \(K,T\subset \mathbb {R}^n\) be convex bodies. Let \(q=(q_1,...,q_m)\) be a closed (K, T)-Minkowski billiard trajectory with closed dual billiard trajectory \(p=(p_1,...,p_m)\) in T. Then, we have
Proposition 2
(Proposition 3.5 in [16]) Let \(K,T\subset \mathbb {R}^n\) be convex bodies and T is additionally assumed to be strictly convex and smooth. Let \(q=(q_1,...,q_m)\) be a closed (K, T)-Minkowski billiard trajectory with its closed dual billiard trajectory \(p=(p_1,...,p_m)\) in T. Then, p is a closed \((T,-K)\)-Minkowski billiard trajectory with
as closed dual billiard trajectory on \(-K\).
For the following proposition, we denote by F(K), \(K\subset \mathbb {R}^n\) convex body, the set of all sets in \(\mathbb {R}^n\) that cannot be translated into \(\mathring{K}\).
Proposition 3
(Proposition 3.9 in [16]) Let \(K,T\subset \mathbb {R}^n\) be convex bodies. Let \(q=(q_1,...,q_m)\) be a closed (K, T)-Minkowski billiard trajectory with closed dual billiard trajectory \(p=(p_1,...,p_m)\). Then, we have
Theorem 2
( Theorem 3.12 in [16]) Let \(K,T\subset \mathbb {R}^n\) be convex bodies, where T is additionally assumed to be strictly convex. Then, every \(\ell _T\)-minimizing closed (K, T)-Minkowski billiard trajectory is an \(\ell _T\)-minimizing element of \(F_{n+1}^{cp}(K)\), and, conversely, every \(\ell _T\)-minimizing element of \(F_{n+1}^{cp}(K)\) can be translated in order to be an \(\ell _T\)-minimizing closed (K, T)-Minkowski billiard trajectory.
Especially, one has
3 Proof of Theorem 1
The proof of Theorem 1 relies on the following three theorems which we will prove in Sects. 4, 5, and 6, respectively.
Theorem 3
Let \(K\subset \mathbb {R}^n\) be a convex polytope and \(T\subset \mathbb {R}^n\) a strictly convex body. We consider \(K\times T\subset \mathbb {R}^{2n}\) as convex Lagrangian product. Then, for every closed/action-minimizing closed characteristic x on \(\partial (K\times T)\), there is a closed characteristic \(\widetilde{x}=(\widetilde{x}_q,\widetilde{x}_p)\) on \(\partial (K\times T)\) which is a closed polygonal curve and where \(\widetilde{x}_q\) is a closed/an \(\ell _T\)-minimizing closed (K, T)-Minkowski billiard trajectory with \(\widetilde{x}_p\) as its closed dual billiard trajectory on T and
Conversely, for every closed/\(\ell _T\)-minimizing closed (K, T)-Minkowski billiard trajectory \(q=(q_1,...,q_m)\) with closed dual billiard trajectory \(p=(p_1,...,p_m)\) on T, \(x=(q,p)\) (after a suitable parametrization of q and p) is a closed/an action-minimizing closed characteristic on \(\partial (K\times T)\) with
Especially, one has
Theorem 4
Let \(K,T\subset \mathbb {R}^n\) be convex bodies. Then, every \(\ell _T\)-minimizing closed (K, T)-Minkowski billiard trajectory is an \(\ell _T\)-minimizing element of \(F_{n+1}^{cp}(K)\), and, conversely, for every \(\ell _T\)-minimizing element of \(F_{n+1}^{cp}(K)\), there is an \(\ell _T\)-minimizing closed (K, T)-Minkowski billiard trajectory with \(\le n+1\) bouncing points and with the same \(\ell _T\)-length.
Especially, one has
We note that Theorem 4 is the generalization of (4) without requiring the strict convexity of T. So far, in contrast to Theorem 2, it is not clear whether the minimizers in (4) coincide (even not up to translation).
For the next theorem we introduce the Hausdorff-distance \(d_H\) between two sets \(U,V\subset \mathbb {R}^n\). It is given by
Theorem 5
-
(i)
If \(T\subset \mathbb {R}^n\) is a strictly convex body and \((K_i)_{i\in \mathbb {N}}\) a sequence of convex bodies in \(\mathbb {R}^n\) that \(d_H\)-converges to some convex body \(K\subset \mathbb {R}^n\), then there is a strictly increasing sequence \((i_j)_{j\in \mathbb {N}}\) and a sequence \((q^{i_j})_{j\in \mathbb {N}}\) of \(\ell _T\)-minimizing closed \((K_{i_j},T)\)-Minkowski billiard trajectories which \(d_H\)-converges to an \(\ell _T\)-minimizing closed (K, T)-Minkowski billiard trajectory.
-
(ii)
If \(K\subset \mathbb {R}^n\) is a convex body and \((T_i)_{i\in \mathbb {N}}\) a sequence of strictly convex bodies in \(\mathbb {R}^n\) that \(d_H\)-converges to some convex body \(T\subset \mathbb {R}^n\), then there is a strictly increasing sequence \((i_j)_{j\in \mathbb {N}}\) and a sequence \((q^{i_j})_{j\in \mathbb {N}}\) of \(\ell _{T_{i_j}}\)-minimizing closed \((K,T_{i_j})\)-Minkowski billiard trajectories which \(d_H\)-converges to an \(\ell _T\)-minimizing closed (K, T)-Minkowski billiard trajectory.
We come to the proof of Theorem 1:
Proof (Proof of Theorem 1)
Let \(K,T\subset \mathbb {R}^n\) be convex bodies such that \(K\times T\subset \mathbb {R}^{2n}\) is a convex Lagrangian product. We first prove
We can find a sequence of convex polytopes \((K_i)_{i\in \mathbb {N}}\) in \(\mathbb {R}^n\) that \(d_H\)-converges to K for \(i\rightarrow \infty \) and a sequence of strictly convex bodies \((T_j)_{j\in \mathbb {N}}\) in \(\mathbb {R}^n\) that \(d_H\)-converges to T for \(j\rightarrow \infty \). Applying Theorem 3, we conclude
Because of the \(d_H\)-continuity of \(c_{EHZ}\) (see, e.g., [1, Theorem 4.1(v)]) and Theorem 5(i), for the limit \(i\rightarrow \infty \), we get
Again using the \(d_H\)-continuity of \(c_{EHZ}\) and this time Theorem 5(ii), for the limit \(j\rightarrow \infty \), we get
By Theorem 4, this implies (6).
It remains to prove
Let \((T_j)_{j\in \mathbb {N}}\) be a sequence of strictly convex and smooth bodies in \(\mathbb {R}^n\) converging to T for \(j\rightarrow \infty \). Then, for every \(j\in \mathbb {N}\), one has
where the first and third equality follows from Theorem 4, the second from Propositions 1 and 2 (requires strict convexity and smoothness of \(T_j\)), and the last from the following consideration: one has the equivalence
and therefore
Using (6), summarized, for every \(j\in \mathbb {N}\), we can conclude
Due to the \(d_H\)-continuity of \(c_{EHZ}\) and the generality of (6), for \(j\rightarrow \infty \), one has
\(\square \)
We remark that the proof of Theorem 1 implies the following relationships:
for general convex bodies \(K,T\subset \mathbb {R}^n\), and
when either T or K is additionally assumed to be strictly convex and smooth.
4 Proof of Theorem 3
Let \(K\subset \mathbb {R}^n\) be a convex polytope and \(T\subset \mathbb {R}^n\) a strictly convex body. We start by investigating properties of closed characteristics on the boundary of the Lagrangian product
For this, we split \(x\in \mathbb {R}^{2n}\) into q- and p-coordinates: \(x=(x_q,x_p)\). Then, we observe
what for
means
(see Fig. 4). A straight forward calculation yields
for the case (7) and
for the case \(x(t)\in \partial K\times \partial T\). Because of
this yields almost everywhere
for \((\alpha ,\beta )\ne (0,0)\) and \(\alpha , \beta \ge 0\).
We notice that in the case \(x(t)\in \mathring{K}\times \partial T\), there is just moving \(x_q\), while in the case \(x(t)\in \partial K\times \mathring{T}\), there is just moving \(x_p\). For the case \(x(t)\in \partial K\times \partial T\), it is apriori not clear whether \(x_q\) and \(x_p\) are never moving at the same time. However, this fact is guaranteed by the strict convexity of T:
Proposition 4
We can reduce (8) to
Proof
We assume
for
and \(\alpha ,\beta >0\).
We split the proof into two parts.
Supposing \(x_q([a',b'])\), \(a\le a'<b' \le b\), is a subset of the interior of a facet, i.e., an \((n-1)\)-dimensional face, \(K_{n-1}\) of K, then \(N_K(x_q(t))\) is for every \(t\in [a',b']\) one-dimensional, which implies because of
that \(x_p([a',b'])\) is a subset of a one-dimensional straight line. However, together with \(x_p([a',b'])\subset \partial T\) this is a contradiction to the strict convexity of T.
Supposing \(x_q([a',b'])\), \(a\le a'<b'\le b\), is a subset of the interior of a j-face \(K_j \subset \partial K\), \(1\le j \le n-2\), then \(N_K(x_q(t))\) is \((n-j)\)-dimensional for every \(t\in [a',b']\) (see Fig. 5). Considering
we conclude that \(x_p([a',b'])\) is a subset of the intersection of an \((n-j)\)-dimensional plane \(T_{n-j}\) (orthogonal to \(K_j\)) and \(\partial T\). Note that because of the strict convexity of T, \(T_{n-j}\) necessarily has a nonempty intersection with the interior of T. From this, we conclude
where by \((T_{n-j})^{\perp ,\mathbb {R}^n_p}\) we denote the orthogonal complement to \(T_{n-j}\) in \(\mathbb {R}^n_p\).
Indeed, let \(t\in [a',b']\). If
then one has
and
Since
there is a \(z_0\in \mathring{T}\cap T_{n-j}\) which due to (11) implies
and due to (12)
a contradiction. This implies (10).
Considering
we get
which ends up in a contradiction since by construction of \(T_{n-j}\), we have
where by \(K_{j,0}\) we denote the in the origin translated \(K_j\) (how exactly, is not relevant), and therefore
\(\square \)
Let x be a closed characteristic. We denote its changing points, i.e., the points where the movement of \(x_q\), respectively of \(x_p\), goes over to the movement of \(x_p\), respectively of \(x_q\), by
and conclude from (9) that they satisfy
for all \(j\in \{1,...,m\}\). We compute their respective trajectory segments’ contributions to the action of x (denoted by \(\mathbb {A}_{x'\rightarrow x''}\) for a trajectory segment from \(x'\) to \(x''\)) as follows: Suppose, we have
for \(a<b<c\), then
and
We note that the action of x only depends on the consecutive changing points in (13), no matter what happens between them. Therefore, it makes sense to think of the following equivalence relation on closed characteristics:
Representatives of the same equivalence class have the same action, i.e.,
Then, by (9), there is a closed characteristic \(\widetilde{x}=(\widetilde{x}_q,\widetilde{x}_p)\) in the equivalence class of x, which is a closed polygonal curve consisting of the straight line segments connecting the changing points in (13). Consequently, using
and [16, Proposition 2.2], we have
\(\widetilde{x}_q\) is a closed polygonal curve with vertices \(q_1,...,q_m\) on \(\partial K\). Without loss of generality, we can assume \(q_{j+1}\ne q_j\) and \(p_{j+1}\ne p_j\) for all \(j\in \{1,...,m\}\).
Otherwise, if \(q_{j+2}=q_{j+1}\), then the changing points
can be replaced by
Indeed, because of
we have
and because of
we have
Therefore, the changing points in (15) are in the sense of (9). If \(p_{j+1}=p_j\), then again, (14) can be replaced by (15) by similar reasoning. In both cases the lengths of the respective associated closed characteristics remain unchanged.
As consequence, without loss of generality, we can assume that \(\widetilde{x}_q\) is a closed polygonal curve with vertices \(q_1,...,q_m\) on \(\partial K\), where \(q_{j+1}\ne q_j\) and \(q_j\) not contained in the line segment connecting \(q_{j-1}\) and \(q_{j+1}\) for all \(j\in \{1,...,m\}\) (otherwise, if \(q_j\) is contained in the line segment connecting \(q_{j-1}\) and \(q_{j+1}\), then \(N_T(p_{j-1})=N_T(p_j)\), and by the strict convexity of T, \(p_{j-1}=p_j\), but then the corresponding segment again can be removed), i.e., q is a closed polygonal curve in the sense of Footnote 1. Therefore, by the definition of Minkowski billiard trajectories, \(\widetilde{x}_q\) is a closed (K, T)-Minkowski billiard trajectory with closed dual billiard trajectory \(\widetilde{x}_p\) and with \(\ell _T\)-length equal to the action of x.
Summarized, we proved that for every closed characteristic x on \(\partial (K\times T)\), there is a closed characteristic \(\widetilde{x}=(\widetilde{x}_q,\widetilde{x}_p)\) on \(\partial (K\times T)\) which is a closed polygonal curve and where \(\widetilde{x}_q\) is a closed (K, T)-Minkowski billiard trajectory with \(\widetilde{x}_p\) as closed dual billiard trajectory on T and
And conversely, for every closed (K, T)-Minkowski billiard trajectory \(q=(q_1,...,q_m)\) with closed dual billiard trajectory \(p=(p_1,...,p_m)\) on T, \(x=(q,p)\) (after a suitable parametrization of q and p) is a closed characteristic on \(\partial (K\times T)\) with
Since these relations remain uneffected by minimizing the action/length, we have
and consequently proved Theorem 3.
5 Proof of Theorem 4
The structure of the proof of Theorem 4 is similar to the structure of the proof of Theorem 2.
Proof (Proof of Theorem 4)
It is sufficient to prove the following two points:
-
(i)
Every closed (K, T)-Minkowski billiard trajectory is either in \(F_{n+1}^{cp}(K)\) or there is an \(\ell _T\)-shorter closed polygonal curve in \(F_{n+1}^{cp}(K)\).
-
(ii)
For every \(\ell _{T}\)-minimizing element of \(F_{n+1}^{cp}(K)\), there is a closed (K, T)-Minkowski billiard trajectory with \(\le n+1\) bouncing points and the same \(\ell _T\)-length.
Ad (i): Let \(q=(q_1,...,q_m)\) be a closed (K, T)-Minkowski billiard trajectory. From Proposition 3, we conclude \(q\in F(K)\). For \(m\le n+1\), we then have \(q \in F_{n+1}^{cp}(K)\). If \(m> n+1\), then, by [15, Lemma 2.1(i)], there is a selection
such that the closed polygonal curve
is in \(F_{n+1}^{cp}(K)\). One has
Ad (ii): Let \(q=(q_1,...,q_m)\) be an \(\ell _T\)-minimizing element of \(F^{cp}_{n+1}(K)\). Further, let \((T_i)_{i\in \mathbb {N}}\) be a sequence of strictly convex bodies in \(\mathbb {R}^n\) that \(d_H\)-converges to T. For all \(i\in \mathbb {N}\), let
be an \(\ell _{T_i}\)-minimizing closed \((K,T_i)\)-Minkowski billiard trajectory. Then, by Theorem 2, \(q^{i,m_i}\) is an \(\ell _{T_i}\)-minimizing closed polygonal curve in \(F_{n+1}^{cp}(K)\) for all \(i\in \mathbb {N}\) (therefore \(m_i\le n+1\) for all \(i\in \mathbb {N}\)). We conclude
where R is chosen sufficiently large. Since \((F_{n+1}^{cp,*_R}(K),d_H)\) is a compact metric subspace of the complete metric space \((P(\mathbb {R}^n),d_H)\) (see the proof of Theorem 2), via a standard compactness argument, we find a strictly increasing sequence \((i_j)_{j\in \mathbb {N}}\) and a closed polygonal curve \(q^*\in F_{n+1}^{cp,*_R}(K)\) such that
We show that \(q^*\) is a closed (K, T)-Minkowski billiard trajectory. Without loss of generality, we assume
Otherwise, we neglect \(q_k^{i_j}\) and continue with
We do exactly the same in the case \(\lim _{j\rightarrow \infty }q_k^{i_j}\) is contained in the line segment connecting
These cases are responsible for possibly having \(\widetilde{m}<m\). From now on, we can assume \(\widetilde{m}=m\). Then, due to (16), we have that
and because of the strict convexity of \(T_{i_j}\) (for strictly convex body \(\widetilde{T}\) one has that \(p_i\ne p_j\) is equivalent to \(N_{\widetilde{T}}(p_i)\cap N_{\widetilde{T}}(p_j)=\{0\}\)), there is a unique \(p_k^{i_j}\in \partial T_{i_j}\) with
Then, since \(q_{k+1}^{i_j}-q_k^{i_j}\) converges for \(j\rightarrow \infty \), this is also true for \(p_k^{i_j}\): we write
This can be argued for every \(k\in \{1,...,m\}\). Since
by possibly going to a subsequence and by specifying the meaning of the limits by: a sequence of cones \((C_i)_{i\in \mathbb {N}}\) converges to some convex cone if the sequence
\(d_H\)-converges to \(C\cap B_1^n(0)\), we get
Therefore, \(q^*\) is a closed (K, T)-Minkowski billiard trajectory.
It remains to show that
For that, we show that \(q^*\) is an \(\ell _T\)-minimizing element in \(F_{n+1}^{cp}(K)\). We assume by contradiction that there is a \(\bar{q}\) in \(F_{n+1}^{cp}(K)\) with
Since for all \(j\in \mathbb {N}\), \(q^{i_j,m_{i_j}}\) is an \(\ell _{T_{i_j}}\)-minimizing element of \(F_{n+1}^{cp}(K)\), it follows that
Using the \(d_H\)-convergence of \((T_i)_{i\in \mathbb {N}}\) to T and [16, Proposition 3.11(vi)], this implies
Then, using [16, Proposition 3.11(v)], we obtain
a contradiction to (18). Therefore, \(q^*\) is an \(\ell _T\)-minimizing element of \(F_{n+1}^{cp}(K)\). This implies (17). \(\square \)
So far, in the general case, it is not known whether there is an example in order to sharpen the statement of this theorem, i.e., whether every minimizer \(\ell _T\)-minimizing element of \(F^{cp}_{n+1}(K)\) has a translate which is an \(\ell _T\)-minimizing closed (K, T)-Minkowski billiard trajectory.
6 Proof of Theorem 5
Proof (Proof of Theorem 5)
\(\underline{\mathrm{Ad (i)}:}\) For all \(i\in \mathbb {N}\), let \(q^i\) be an \(\ell _{T}\)-minimizing closed \((K_i,T)\)-Minkowski billiard trajectory. Then, by Theorem 2 (or Theorem 4), for all \(i\in \mathbb {N}\), \(q^i\) is an \(\ell _T\)-minimizing closed polygonal curve in \(F_{n+1}^{cp}(K_i)\).
Since \((K_i)_{i\in \mathbb {N}}\) \(d_H\)-converges to K, for all \(\varepsilon >0\), there is an \(i_0=i_0(\varepsilon )\in \mathbb {N}\) such that
This means by [16, Proposition 3.11(i)] (which also holds for proper inclusions) that
By (19) and the fact that, for all \(i\in \mathbb {N}\), \(q^i\) is an \(\ell _T\)-minimizing element of \(F_{n+1}^{cp}(K_i)\), for \(\varepsilon >0\) and \(i_0=i_0(\varepsilon )\) big enough, we have that
where by \(B_R^n(0)\) we denote the n-dimensional ball in \(\mathbb {R}^n\) of sufficiently large radius \(R>0\) that contains K. Via a standard compactness argument (see the proof of Theorem 2), there is a strictly increasing sequence \((i_j)_{j\in \mathbb {N}}\) and a closed polygonal curve
such that \((q^{i_j})_{j\in \mathbb {N}}\) \(d_H\)-converges to q and every \(q^{i_j}\) has \(m\le n+1\) vertices/bouncing points (we note that, in general, the \(q^i\)s can have a varying number of vertices/bouncing points).
We show that q is an \(\ell _{T}\)-minimizing element of \(F_{n+1}^{cp}(K)\). Since the aforementioned is true for any \(\varepsilon >0\), we have
where the last inclusion follows from the fact that any closed polygonal curve with at most \(n+1\) vertices that can be translated into \(\mathring{K}\) can also be translated into \((1-\varepsilon )\mathring{K}\) for \(\varepsilon >0\) small enough. Therefore, q is in \(F_{n+1}^{cp}(K)\). It remains to show that q is \(\ell _{T}\)-minimizing. We assume by contradiction that there is a \(\widetilde{q}\in F_{n+1}^{cp}(K)\) with
We choose \(\varepsilon >0\) such that
Then, by [16, Proposition 3.11(ii)],
From (19), it follows for j big enough that
and hence
since \(q^{i_j}\) is an \(\ell _T\)-minimizing element of \(F_{n+1}^{cp}(K_{i_j})\). Passing to the limit in j and using [16, Proposition 3.11(v)], we obtain
a contradiction to (20). Therefore, q is an \(\ell _{T}\)-minimizing element of \(F_{n+1}^{cp}(K)\).
We show that q is an \(\ell _T\)-minimizing closed (K, T)-Minkowski billiard trajectory. Since \((q^{i_j})_{j\in \mathbb {N}}\) \(d_H\)-converges to q, under the assumption that q also has m vertices \(q_1,...,q_m\) (satisfying \(q_k\ne q_{k+1}\) and the condition that \(q_k\) is not contained in the line segment connecting \(q_{k-1}\) and \(q_{k+1}\) for all \(k\in \{1,...,m\}\); see Footnote 1), it follows that \((q_k^{i_j})_{j\in \mathbb {N}}\) converges to \(q_k\) for all \(k\in \{1,...,m\}\) (see again the aforementioned identification given in the proof of Theorem 2). Then, from the \(d_H\)-convergence of \((K_i)_{i\in \mathbb {N}}\) to K and \(q_k^{i_j}\in \partial K_{i_j}\) for all \(k\in \{1,...,m\}\) and all \(j\in \mathbb {N}\), it follows that \(q_k\in \partial K\) for all \(k\in \{1,...,m\}\). By referring to Theorem 2 (T is strictly convex; here Theorem 4 would not be enough), q then satisfies all the conditions in order to be an \(\ell _T\)-minimizing closed (K, T)-Minkowski billiard trajectory. If q has less than m vertices, i.e., if
or \(\lim _{j\rightarrow \infty } q_k^{i_j}\) is contained in the line segment connecting
then, without loss of generality, we can neglect the k-th vertex of \(q^{i_j}\) for all \(j\in \mathbb {N}\), but get the same result: all the vertices of q are on \(\partial K\) and q satisfies all other conditions in order to be an \(\ell _T\)-minimizing closed (K, T)-Minkowski billiard trajectory.
\(\underline{\mathrm{Ad (ii)}:}\) We can copy completely the proof of point (ii) within the proof of Theorem 4. \(\square \)
Data Availability Statement
The datasets generated during and/or analysed during the current study are available from the corresponding author on reasonable request.
Notes
For the sake of simplicity, whenever we talk of the vertices \(q_1,...,q_m\) of a closed polygonal curve, we assume that they satisfy \(q_j\ne q_{j+1}\) and \(q_j\) is not contained in the line segment connecting \(q_{j-1}\) and \(q_{j+1}\) for all \(j\in \{1,...,m\}\). Furthermore, whenever we settle indices 1, ..., m, then the indices in \(\mathbb {Z}\) will be considered as indices modulo m.
References
Abbondandolo, A., Majer, P.: A non-squeezing theorem for convex symplectic images of the Hilbert ball. Calc. Var. Partial Differ. Equ. 54, 1469–1506 (2015)
Alkoumi, N., Schlenk, S.: Shortest closed billiard orbits on convex tables. Manuscr. Math. 147, 365–380 (2015)
Artstein-Avidan, S., Ostrover, Y.: Bounds for Minkowski billiard trajectories in convex bodies. Int. Math. Res. Not. IMRN 1, 165–193 (2014)
Balitskiy, A.: Equality cases in Viterbo’s conjecture and isoperimetric Billiard inequalities. Int. Math. Res. Not. 2020(7), 1957–1978 (2020)
Bezdek, K., Conelly, R.: Covering curves by translates of a convex set. Am. Math. Mon. 96, 789–806 (1989)
Bezdek, D., Bezdek, K.: Shortest billiard trajectories. Geom. Dedic. 141, 197–206 (2009)
Blagojevic, P., Harrison, M., Tabachnikov, S., Ziegler, G.M.: Counting periodic trajectories of Finsler billiards SIGMA, p. 16 (2020)
Clarke, F.: A classical variational principle for periodic Hamiltonian trajectories. Proc. Am. Math. Soc. 76, 186–188 (1979)
Ekeland, I., Hofer, H.: Symplectic topology and Hamiltonian dynamics. Math. Zeitschrift 200(3), 355–378 (1989)
Ghomi, M.: Shortest periodic billiard trajectories in convex bodies. Geom. Funct. Anal. 14, 295–302 (2004)
Gutkin, E., Tabachnikov, S.: Billiards in Finsler and Minkowski geometries. J. Geom. Phys. 40, 277–301 (2002)
Halpern, B.: Strange Billiard tables. Trans. Am. Math. Soc. 232, 297–305 (1977)
Hofer, H., Zehnder, E.: A New Capacity for Symplectic Manifolds. Analysis, et Cetera, pp. 405–427. Academic Press, Boston (1990)
Künzle, A.F.: Singular Hamiltonian systems and symplectic capacities. Singular. Differ. Equ. 33, 171–187 (1996)
Krupp, S., Rudolf, D.: A regularity result for shortest generalized billiard trajectories in convex bodies in \({\mathbb{R} }^n\). Geom. Dedicata 216, 55 (2022)
Krupp, S., Rudolf, D.: Shortest Minkowski billiard trajectories on convex bodies (2022). arXiv:2203.01802
Rudolf, D.: Viterbo’s conjecture for Lagrangian products in \({\mathbb{R}}^4\) symplectomorphisms to the Euclidean ball (2022). arXiv:2203.02294v5
Funding
Open Access funding enabled and organized by Projekt DEAL.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
There are no conflicts of interest related to the work in this manuscript.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This research is partly supported by the SFB/TRR 191 ’Symplectic Structures in Geometry, Algebra and Dynamics’, funded by the ’German Research Foundation’ (DFG).
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Rudolf, D. The Minkowski Billiard Characterization of the EHZ-Capacity of Convex Lagrangian Products. J Dyn Diff Equat 36, 2773–2791 (2024). https://doi.org/10.1007/s10884-022-10228-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10884-022-10228-0