Abstract
We study lengthminimizing closed generalized Euclidean billiard trajectories in convex bodies in \(\mathbb {R}^n\) and investigate their relation to the inclusion minimal affine sections that contain these trajectories. We show that when passing to these sections, the lengthminimizing closed billiard trajectories are still billiard trajectories, but their lengthminimality as well as their regularity can be destroyed. In light of this, we prove what weaker regularity is actually preserved under passing to these sections. Based on the results, we develop an algorithm in order to calculate lengthminimizing closed regular billiard trajectories in convex polytopes in \(\mathbb {R}^n\).
Introduction
In this paper, we analyze closed billiard trajectories in convex bodies in \(\mathbb {R}^n\). The billiard trajectories are meant to be Euclidean what for bouncing points locally means: the angle of reflection equals the angle of incidence (here, we assume that normal vector as well as incident and reflected rays lie in the same twodimensional affine flat). This local reflection rule can be seen as consequence of the global least action principle. For a reflection in a hyperplane this principle means that a billiard trajectory segment \((p_{j1},p_j,p_{j+1})\) minimizes the Euclidean length in the space of all paths connecting \(p_{j1}\) and \(p_{j+1}\) via a reflection at this hyperplane.
From the geometric optics point of view, Euclidean billiards describe the wave propagation in a medium which is not only homogeneous and isotropic but also contains perfectly reflecting mirrors.
There is generally much interest in the study of billiards: Problems in various mathematical fields can be related to problems in mathematical billiards; see for example [9, 10], and [17] for comprehensive surveys. Euclidean billiard trajectories in the plane have been investigated intensively. Nonetheless, so far, not much is known about Euclidean billiard trajectories on higherdimensional “tables”.
Let us precisely define closed Euclidean billiard trajectories on convex bodies in \(\mathbb {R}^n\) based on the above mentioned least action principle (see Fig. 1).
Definition 1
Let \(T\subset \mathbb {R}^n\) be a convex body, i.e., a compact convex set with nonempty interior, which from now on we call the billiard table. We say that a closed polygonal curve^{Footnote 1} with vertices \(p_1,...,p_m\), \(m\geqslant 2\), on the boundary of T (denoted by \(\partial T\)) is a closed billiard trajectory on T if for every \(j\in \{1,...,m\}\) there is a Tsupporting hyperplane \(H_j\) through \(p_j\) such that \(p_j\) minimizes
over all \(\bar{p}_j\in H_j\). We encode this closed billiard trajectory by \(( p_1,...,p_m )\) and call its vertices bouncing points. Its length^{Footnote 2} is given by
We call a boundary point \(p_j\in \partial T\) smooth if there is a unique Tsupporting hyperplane through \(p_j\). We say that \(\partial T\) is smooth if every boundary point is smooth. We call a closed billiard trajectory regular if all its bouncing points are smooth boundary points of the billiard table boundary.
We remark that the notion of billiard trajectories is usually used for classical trajectories, i.e., for trajectories with bouncing points in smooth boundary points (billiard table cushions) while they terminate in nonsmooth boundary points (billiard table pockets). Definition 1 generalizes this classical billiard reflection rule to nonsmooth boundaries. To the authors’ knowledge, the papers [6] (’89), [8] (’04), and [7] (’09) were among the first suggesting a detailed study of these generalized billiard trajectories.
Definition 1 implies the local billiard reflection rule: the hyperplane associated to the corresponding normal vector within the local formulation is the one appearing within the minimization of (1). Since a Tsupporting hyperplane through nonsmooth boundary points of the billiard table T is not unique, from a constructive point of view, the billiard reflection rule may produce different bouncing points following two already known consecutive ones.
The main interest we pursue in the first part of this paper is the investigation of lengthminimizing closed billiard trajectories on a convex body \(T\subset \mathbb {R}^n\) in relation to the inclusion minimal affine sections that contain these trajectories. Its relevance is given against the background of the development of an algorithm for computing lengthminimizing closed billiard trajectories which we will discuss in the second part of this paper.
In a nutshell, our result can be summarized as follows: We show that when passing to the inclusion minimal affine section that contains the lengthminimizing billiard trajectory, this lengthminimizing billiard trajectory is still a billiard trajectory, but almost every other property (e.g., lengthminimality, regularity) can be destroyed (see examples (B) and (C) in Section 4). In light of this observation, we prove (see Theorem 1) what weaker regularity is actually preserved under passing to the inclusion minimal affine section. Briefly, this weaker regularity can be described as follows: for a lengthminimizing billiard trajectory the billiard reflections are uniquely determined if restricted to the inclusion minimal affine section that contains this trajectory; that is, the billiard reflection rule is unambigious provided that the reflected ray lies in the inclusion minimal affine section.
In order to state this weaker regularity result, let
be the outer normal cone of T at the point \(p\in \partial T\). Then, our result reads as follows:
Theorem 1
Let \(T\subset \mathbb {R}^n\) be a billiard table and \(p=(p_1,...,p_m)\) a lengthminimizing closed billiard trajectory on T. Further, let \(U\subseteq \mathbb {R}^n\) be the convex cone spanned by the normal vectors related to the billiard reflection rule and let \(V\subseteq \mathbb {R}^n\) be the affine subspace such that \(T\cap V\) is the inclusion minimal affine section of T that contains p. Then, it follows that
and
for all \(j\in \{1,...,m\}\), where \(V_0\) is the linear subspace that is parallel to the affine subspace V satisfying \(\mathrm{dim}\,V_0 = \mathrm{dim}\,V\).
From
it follows that
Furthermore,
implies that p is maximally spanning by what we mean
In fact, (3) is a regularity result: If \(m=n+1\), meaning that \(V=V_0=\mathbb {R}^n\), then (3) becomes
i.e., p is regular. For \(n=2\) this means that every lengthminimizing closed billiard trajectory on T has either two or three bouncing points, while in the latter case all of them are smooth boundary points of T.
Some special cases of Theorem 1 were already known: For lengthminimizing closed billiard trajectories it has been proven in [7] that m is bounded from above by \(n+1\). The twodimensional case has been shown in [2], while in [1], it has been proven that every lengthminimizing closed billiard trajectory with \(n+1\) bouncing points is regular.
We remark that in our upcoming paper [12] we extend Theorem 1 from the Euclidean setting to the more general Finsler/Minkowski setting.
The relevance of Theorem 1 lies especially in its sharpness (which is ensured by example (C) in Section 4): It refutes the presumption, which at first appears to be intuitively correct, that every lengthminimizing closed billiard trajectory with more than two bouncing points is regular within the inclusion minimal affine section of T that contains this trajectory, i.e., that it is relatively regular with respect to this inclusion minimal affine section. The latter could have been expected as higher dimensional generalization of the twodimensional regularity result in [2].
The algorithm which we develop in the second part of this paper can be seen as one of the first steps in a direction towards tackling certain originally geometrical/dynamical problems arising in the field of symplectic geometry/dynamics computationally. This results from the following relationships: As was already pointed out in [2], the search for lengthminimizing closed generalized billiard trajectories is related to the EkelandHoferZehnder capacity of the 4dimensional Lagrangian product
in the standard symplectic space \(\mathbb {R}^4\), where we denote by \(B^2_1(0)\subset \mathbb {R}^2\) the Euclidean unit ball. In relation to the volume, the aforementioned in turn is related to so far not solved isoperimetriclike/systolic billiard inequalities (see [4]) as well as to certain configurations in light of Viterbo’s conjecture from symplectic geometry (see [18]), which, due to [3], is related to the famous Mahler conjecture from convex geometry (see [13]). Another interesting relationship is with Wetzel’s problem from geometry (see [19]), on which we will elaborate in an upcoming paper in more detail (see [15]).
Let us briefly present the structure of this paper: In Section 2, we discuss properties of closed generalized billiard trajectories in convex bodies in \(\mathbb {R}^n\). In Section 3, we prove Theorem 1. In Section 4, we present relevant examples which, i.a., provide the sharpness of Theorem 1; and, finally, in Section 5, we discuss the algorithm in order to calculate lengthminimizing closed regular billiard trajectories in convex polytopes in \(\mathbb {R}^n\).
Properties of closed billiard trajectories
For a convex body \(T\subset \mathbb {R}^n\), we define
where by \(\mathring{T}\) we denote the interior of T in \(\mathbb {R}^n\) and by \(\mathcal {P}(\mathbb {R}^n)\) the power set of \(\mathbb {R}^n\). Based on that, we recall the following lemma from [7]:
Lemma 1
(Lemmata 2.1, 2.2, and 2.3 in [7])

(i)
Let \(T\subset \mathbb {R}^n\) be a convex set and F a finite set of at least \(n+1\) points in \(\mathbb {R}^n\). Then, there is a translate of T that covers F if and only if every selection of \(n+1\) points of F can be covered by a translate of T.

(ii)
Let \(T\subset \mathbb {R}^n\) be a convex body and F a set of points \(p_1,...,p_m\in \mathbb {R}^n\). Then, \(F\in F(T)\) is equivalent to: there is a translate \(T'\) of T, a selection \(\{i_1,...,i_{\widetilde{m}}\}\subseteq \{1,...,m\}\), and there are closed halfspaces \(H_{i_1}^+,...,H_{i_{\widetilde{m}}}^+\) of \(\mathbb {R}^n\) such that

\(p_{i_j}\in \partial H_{i_j}^+\) for all \(j\in \{1,...,\widetilde{m}\}\),

\(T'\subseteq H_{i_j}^+\) for all \(j\in \{1,...,\widetilde{m}\}\),

\(\bigcap _{j=1}^{\widetilde{m}} H_{i_j}^+\) is nearly bounded, i.e. it lies between two parallel hyperplanes.


(iii)
Let \(T\subset \mathbb {R}^n\) be a billiard table and \(p=(p_1,...,p_m)\) a closed billiard trajectory on T. Then, we have \(p\in F(T)\).
We note that Lemma 1(i) can be equivalently (by contraposition applied to \(\mathring{T}\)) expressed by: a set F of at least \(n+1\) points in \(\mathbb {R}^n\) is in F(T) if and only if there is a selection of \(n+1\) points out of F that is in F(T).
Furthermore, we recall the following characterization of lengthminimizing closed billiard trajectories:
Theorem 2
(Theorem 1.1 and Lemma 2.4 in [7]) Let \(T\subset \mathbb {R}^n\) be a billiard table. Then, every lengthminimizing closed billiard trajectory on T has at most \(n+1\) bouncing points. Moreover, every lengthminimizing closed billiard trajectory on T is a lengthminimizing closed polygonal curve in F(T) and, conversely, every lengthminimizing closed polygonal curve in F(T) can be translated to a lengthminimizing closed billiard trajectory on T.
We note that Theorem 2 is an existence result for closed billiard trajectories on arbitrary billiard tables: Let \(T\subset \mathbb {R}^n\) be any billiard table. Then, there is a closed billiard trajectory on T (with at most \(n+1\) bouncing points). This can be easily concluded by a compactness argument applied to the set of closed polygonal curves in F(T) combined with the \(d_H\)continuity, i.e., continuity with respect to the Hausdorff distance \(d_H\), of the lengthfunctional.
We continue by stating the following property of closed billiard trajectories:
Proposition 1
Let \(T\subset \mathbb {R}^n\) be a billiard table, \(p=(p_1,...,p_m)\) a closed billiard trajectory on T, and \(V\subseteq \mathbb {R}^n\) an affine subspace such that \(T\cap V\) is an affine section of T that contains p. Then, p is a closed billiard trajectory in \(T\cap V\).
Proof
Since \(p=(p_1,...,p_m)\) is a closed billiard trajectory on T, there are Tsupporting hyperplanes \(H_1,...,H_m\) in \(\mathbb {R}^n\) through \(p_1,...,p_m\) such that \(p_j\) minimizes
over all \(\bar{p}_j\in H_j\) for all \(j\in \{1,...,m\}\). Since \(T\cap V\) contains p, it follows that \(p_j\) minimizes (4) over all \(\bar{p}_j\in H_j\cap V\) for all \(j\in \{1,...,m\}\). This implies that p is a billiard trajectory in \(T\cap V\).
Clearly, the converse is not true: We can imagine an affine subspace \(V\subseteq \mathbb {R}^n\) such that the section \(T\cap V\) of T can be translated into \(\mathring{T}\). Then, every closed billiard trajectory p in \(T\cap V\) can be translated into \(\mathring{T}\). But by Lemma 1(iii), then, p cannot be a closed billiard trajectory on T.
In Section 4, we will see that, generally, the lengthminimality of a closed billiard trajectory on T is not invariant under going to (inclusion minimal) affine sections of T that contain the closed billiard trajectory.
For what follows, it will be useful to reformulate the billiard reflection rule in the sense of the following Proposition 2. For that, we denote the \((n1)\)dimensional unit sphere of \(\mathbb {R}^n\) by \(S^{n1}\).
Proposition 2
Let \(T\subset \mathbb {R}^n\) be a billiard table. A closed polygonal curve with vertices \(p_1,...,p_m\) on \(\partial T\) is a closed billiard trajectory on T if and only if there are vectors \(n_1,...,n_m\in S^{n1}\) such that
is satisfied for all \(j\in \{1,...,m\}\) (see Fig. 2).
Proof
Let \(p=(p_1,...,p_m)\) be a closed polygonal curve with vertices on \(\partial T\). Let us assume there are vectors \(n_1,...,n_m\in S^{n1}\) which together with p satisfy (5). Then, for all \(j\in \{1,...,m\}\) there is a unit vector \(n_T(p_{j+1})\in N_T(p_{j+1})\) such that
holds. We define \(H_1,...,H_m\) to be the Tsupporting hyperplanes in \(\mathbb {R}^n\) through \(p_1,...,p_m\) which are normal to \(n_T(p_1),...,n_T(p_m)\). Then, the following holds for all \(j\in \{1,...,m\}\):
Therefore, for all \(j\in \{1,...,m\}\), \(p_j\) extremizes
over all \(\bar{p}_j\in H_j\) near \(p_j\). Since for all \(j\in \{1,...,m\}\), (6) is a convex function with respect to \(\bar{p}_j\), it follows for all \(j\in \{1,...,m\}\) that \(p_j\) is a global minimizer of (6) over all \(\bar{p}_j\in H_j\). Therefore, the billiard reflection rule is satisfied in \(p_j\) for all \(j\in \{1,...,m\}\). Eventually, p is a closed billiard trajectory on T.
Conversely, let us assume \(p=(p_1,...,p_m)\) is a closed billiard trajectory on T. Then, there are Tsupporting hyperplanes \(H_1,...,H_m\) in \(\mathbb {R}^n\) through \(p_1,...,p_m\) such that for all \(j\in \{1,...,m\}\), \(p_j\) minimizes (6) over all \(\bar{p}_j\in H_j\). By Lagrange’s multiplier theorem, this means
where \(n_T(p_j)\) is the outer unit vector normal to \(H_j\), for all \(j\in \{1,...,m\}\). Taking inner product with \(n_T(p_j)\) gives \(\mu _j>0\) for all \(j\in \{1,...,m\}\). If we define
and consider \(n_T(p_j)\in N_T(p_j)\) for all \(j\in \{1,...,m\}\), then (5) is satisfied for p together with the unit vectors \(n_1,...,n_m\) defined in (7).
The proof of Proposition 2 shows even more: A closed polygonal curve with vertices \(p_1,...,p_m\) on \(\partial T\) is a closed billiard trajectory on T with \(H_1,...,H_m\) as Tsupporting hyperplanes that are associated to the billiard reflection rule if and only if there are vectors \(n_1,...,n_m\in S^{n1}\) such that
is satisfied for all \(j\in \{1,...,m\}\), where we denoted the outer unit normal vectors at \(H_1,...,H_m\) by \(n_{H_1},...,n_{H_m}\).
The following rather obvious proposition is needed within the proof of Theorem 1. It follows immediately from within the proof of Proposition 2.
Proposition 3
Let \(T\subset \mathbb {R}^n\) be a billiard table and \(p=(p_1,...,p_m)\) a closed billiard trajectory on T. Then, for every \(j\in \{1,...,m\}\) there is only one Tsupporting hyperplane through \(p_j\) for which the billiard reflection rule in \(p_j\) is satisfied.
Proof
This claim follows from the fact that the outer unit vector \(n_T(p_j)\) that is normal to \(H_j\) is uniquely determined by the condition
which arises from Lagrange’s multiplier theorem as within the converse implication of the proof of Proposition 2.
The next two propositions relate the positions of the hyperplanes which determine the billiard reflection rule.
Proposition 4
Let \(T\subset \mathbb {R}^n\) be a billiard table, \(p=(p_1,...,p_m)\) a closed billiard trajectory on T, and \(V\subseteq \mathbb {R}^n\) the affine subspace such that \(T\cap V\) is the inclusion minimal affine section of T that contains p. Further, let \(V_0\) be the linear subspace parallel to V satisfying \(\mathrm{dim}\,V_0 = \mathrm{dim}\,V\) and let \(H_1,...,H_m\) be the Tsupporting hyperplanes through \(p_1,...,p_m\) which are associated to the billiard reflection rule. Then, the convex cone spanned by the outer unit vectors
is \(V_0\).
Proof
Since p is a closed billiard trajectory on T and \(T\cap V\) is an affine section of T that contains p, the vectors
are all in \(V_0\). Since \(T\cap V\) is the inclusion minimal affine section that contains p, it follows that the convex cone spanned by the vectors in (8) actually is \(V_0\).
Indeed, it is
For
we then also have
Since
it follows that 0 lies in the relative interior of
But this implies that the convex cone spanned by the vectors (8) is a linear subspace of \(\mathbb {R}^n\), more precisely, the inclusion minimal linear subspace of \(\mathbb {R}^n\) that contains the vectors (8), i.e., \(V_0\).
From the proof of Proposition 2 it follows that there are \(n_1,...,n_m\in S^{n1}\) (see (7) for the definition) such that
holds for all \(j\in \{1,...,m\}\). From
for all \(j\in \{1,...,m\}\) it follows that the convex cone spanned by \(n_1,...,n_m\) is \(V_0\). By the above argumentation, the convex cone spanned by the vectors
also is a linear subspace of \(\mathbb {R}^n\) and, therefore, equal to \(V_0\). Then,
for all \(j\in \{1,...,m\}\) implies that the convex cone spanned by the normal vectors
is \(V_0\).
Proposition 5
Let \(T\subset \mathbb {R}^n\) be a billiard table, \(p=(p_1,...,p_m)\) a closed billiard trajectory on T, and \(V\subseteq \mathbb {R}^n\) the affine subspace such that \(T\cap V\) is the inclusion minimal affine section of T that contains p. Let \(H_1,...,H_m\) be the Tsupporting hyperplanes through \(p_1,...,p_m\) which are related to the billiard reflection rule and let \(H_1^+,...,H_m^+\) be the halfspaces of \(\mathbb {R}^n\) that contain T and which are bounded by \(H_1,...,H_m\). Further, let W be the orthogonal complement to V in \(\mathbb {R}^n\). Then, we can write
for all \(j\in \{1,...,m\}\) and have that
Proof
By Proposition 4, the convex cone spanned by the outer unit vectors normal to \(H_1,...,H_m\) is the linear subspace \(V_0\) that underlies the affine subspace V. This implies, on the one hand, that we can write
for all \(j\in \{1,...,m\}\) and, on the other hand, that
is bounded in V. The latter fact implies that there are parallel hyperplanes H and \(H+d\), \(d\in V_0\), in V such that (10) lies in between. With (9) this implies that
lies between the parallel hyperplanes
in \(\mathbb {R}^n\) and therefore is nearly bounded in \(\mathbb {R}^n\).
Considering Lemma 1(ii), we note that with Proposition 5 we have subsequently provided a proof of Lemma 1(iii).
The following proposition is a preparation for the proof of Theorem 1.
Proposition 6
Let \(T\subset \mathbb {R}^n\) be a billiard table, \(p=(p_1,...,p_m)\) a closed billiard trajectory on T, and \(V\subseteq \mathbb {R}^n\) the affine subspace such that \(T\cap V\) is the inclusion minimal affine section of T that contains p. Then, there is a selection
such that
Proof
If \(\mathrm{dim}\,V=n\), then the claim follows immediately by Lemma 1(i) & (iii). This is also the case when \(m=\mathrm{dim}\,V+1\).
Let
Since p is a closed billiard trajectory on T, there are Tsupporting hyperplanes \(H_1,...,H_m\) through \(p_1,...,p_m\) for which the billiard reflection rule is satisfied. Proposition 5 implies, on the one hand, that we can write
for all \(j\in \{1,...,m\}\), where W is the orthogonal complement to V and
are the closed halfspaces of \(\mathbb {R}^n\) defined by
for all \(j\in \{1,...,m\}\), and, on the other hand, that
is bounded in V. By Lemma 1(ii), this implies that
Then, by Lemma 1(i), there is a selection
such that
Referring again to Lemma 1(ii), there are \(\bigcap _{j=1}^m \left( H_j^+\cap V\right) \)supporting hyperplanes^{Footnote 3}
in V through
such that
is nearly bounded in V with
where \(\widetilde{H}_j^+\) is the halfspace within V which is bounded by \(\widetilde{H}_j\) and contains \(T\cap V\) for all \(j\in \{1,...,\mathrm{dim}\,V +1\}\) (see Fig. 3).
Then, this implies that
is nearly bounded in \(\mathbb {R}^n\) with
and
By using Lemma 1(ii), this yields
Proof of Theorem 1
In order to prove Theorem 1, it will be useful to formulate the following lemma:
Lemma 2
Let \(H_1^+,...,H_k^+\) be halfspaces of \(\mathbb {R}^{d\geqslant 2}\) such that
is bounded in \(\mathbb {R}^d\) (therefore, \(k\geqslant d+1\)). Let \(n_1,...,n_k\) be the outer (with respect to \(H_1^+,...,H_k^+\)) unit vectors normal to
The following holds for every \(j\in \{1,...,k\}\): There is an \(\varepsilon _j>0\) such that
is bounded in \(\mathbb {R}^d\) for all
whose outer unit normal vector is an element of
where by \(B_{\varepsilon _j}^d(n_j)\) we denote the ddimensional ball of radius \(\varepsilon _j\) centred at \(n_j\).
Proof
The statement is equivalent to the following one: Let
be unit vectors with 0 in the interior of the convex hull
Then, for every \(j\in \{1,...,k\}\) there is an \(\varepsilon _j>0\) such that 0 is in the interior of
for every
But this is clear since for every \(j\in \{1,...,k\}\) the fact
is invariant under small perturbations of \(n_j\).
Indeed, without loss of generality we can assume \(j=1\). If 0 is in the interior of (11), then there are \(s_1,...,s_k > 0\) such that
Let
be a small perturbation of \(n_1\). Then, since 0 is in the interior of (11), we can find \(\alpha _2,...,\alpha _k \in \mathbb {R}\) such that
We define
Then,
and
where \(\widetilde{s}_j >0\) for all \(j\in \{1,...,k\}\) since \(\varepsilon _1\) can be chosen so small that \(\alpha _1,...,\alpha _k\) are sufficiently small. This implies that 0 is in the interior of the convex hull
For the proof of Theorem 1 we finally need the following lemma.
For that, for a point \(q\in \partial (T\cap V)\), where T is a convex body in \(\mathbb {R}^n\), V a section of T, and \(V_0\) the linear subspace parallel to V satisfying \(\mathrm{dim}\,V_0 = \mathrm{dim}\,V\), we define
Lemma 3
Let \(T\subset \mathbb {R}^n\) be a convex body and \(\{p_1,...,p_m\}\) a set of boundary points of T such that the outer normal unit vectors
lie in \(V_0\) by which we denote the linear subspace parallel to the inclusion minimal affine section V of T that contains \(\{p_1,...,p_m\}\) satisfying \(\mathrm{dim}\,V_0 = \mathrm{dim}\,V\). Then, we have
for all \(j\in \{1,...,m\}\).
Proof
From
for all \(j\in \{1,...,m\}\) it follows
for all \(j\in \{1,...,m\}\).
Let \(j\in \{1,...,m\}\) be arbitrarily chosen. Let n be a nonzero vector in
Then,
and \(n\in V_0\). Because of
this implies
From that, we conclude
and, therefore,
Consequently,
for all \(j\in \{1,...,m\}\).
We come to the proof of Theorem 1:
Proof of Theorem 1
Let \(p=(p_1,...,p_m)\) be a lengthminimizing closed billiard trajectory on T and \(V\subseteq \mathbb {R}^n\) the affine subspace such that \(T\cap V\) is the inclusion minimal affine section that contains p, i.e.,
Then, by Proposition 6, there is a selection
with
Without loss of generality, we can assume
and define the closed polygonal curve
For
it follows
But with Theorem 2, this is a contradiction to the minimality of p. Therefore, it follows
Let us denote by \(H_1^+,...,H_m^+\) the closed halfspaces of \(\mathbb {R}^n\) defined by
for all \(j\in \{1,...,m\}\), where by \(H_1,...,H_m\) we denote the Tsupporting hyperplanes through \(p_1,...,p_m\) which are related to the billiard reflection rule in these points. By Proposition 5, we conclude that we can write
for all \(j\in \{1,...,m\}\), where W is the orthogonal complement to V in \(\mathbb {R}^n\), and that
Let \(n_1,...,n_m\) be the outer unit vectors normal to \(H_1,...,H_m\). Then, it follows by (12) that
and, therefore,
for all \(j\in \{1,...,m\}\).
Let us assume there is an \(i\in \{1,...,m\}\) such that
Then, using Lemma 3, i.e.,
it follows
and, because of Lemma 2 (for \(d=m1\) and \(k=m\)), we can find a unit vector
such that
remains bounded in V, where we denote by \(H_{i,V}^{pert,+}\) the closed halfspace of V that contains \(T\cap V\) and which is bounded by \(H_{i,V}^{pert}\) which is the hyperplane in V through \(p_i\) that is normal to \(n_i^{pert}\). Since by Proposition 3 the billiard reflection rule in \(p_i\) (as bouncing point of the closed billiard trajectory p in \(T\cap V\); see Proposition 1) is no longer satisfied with respect to the perturbed hyperplane \(H_{i,V}^{pert}\), the bouncing point \(p_i\) can be moved along \(H_{i,V}^{pert}\), say to \(p_i^*\), in order to reduce the length of the polygonal curve segment
We define the closed polygonal curve
for which with the boundedness of (14) in V we conclude
by Lemma 1(ii). Now, we argue that \(\widetilde{p}\in F(T)\): With the boundedness of (14) in V it follows with
and (12) the nearly boundedness of
in \(\mathbb {R}^n\).
Indeed, when the intersection in (14) is bounded in V, then there is a hyperplane H in V such that the intersection lies between H and \(H+d\) for an appropriate \(d\in V_0\). Then, it follows with (12) and (15) that
lies between the hyperplanes
Since \(H_i^{pert}\) is a Tsupporting hyperplane through \(p_i\) (what follows from the fact that by (13) its outer unit normal vector \(n_i^{pert}\) is an element of \(N_T(p_i)\)), we conclude that T is a subset of the intersection in (16). Then, it follows from the nearly boundedness (in \(\mathbb {R}^n\)) of the intersection in (16) together with Lemma 1(ii) that
By referring to Theorem 2, from
we derive a contradiction to the minimality of p.
Therefore, it follows
Examples
In what follows, we discuss three relevant examples showing:

(A)
The statement of Proposition 6 is not true when requiring p just to be a closed polygonal curve in F(T) (and not a closed billiard trajectory on T).

(B)
Let \(T\subset \mathbb {R}^n\) be a billiard table and \(p=(p_1,...,p_m)\) a lengthminimizing closed billiard trajectory on T. Let \(T\cap V\) be the inclusion minimal affine section of T that contains p. Then, p may not even locally minimize the length of closed polygonal curves in \(F(T\cap V)\).

(C)
A lengthminimizing closed billiard trajectory in \(T\subset \mathbb {R}^n\) may not be regular within the inclusion minimal affine section of T that contains the billiard trajectory. This can even appear for the unique lengthminimizing closed billiard trajectory.
Ad (A): We consider the following example^{Footnote 4} in \(\mathbb {R}^5\): We start from four convex bodies \(K_1,K_2,K_3,K_4\) in \(\mathbb {R}^3\) with the following two properties:

(a)
the intersection of all of them is empty;

(b)
the intersection of any three of them has nonempty interior.
One has these examples because Helly’s theorem is sharp. Then, we consider the four vertices of a square in \(\mathbb {R}^2\):
Now, let T be the convex hull in
of the union of the following four sets:
T projects onto the square, but (a) implies that each section of T that is parallel to \(\mathbb {R}^2\times \{0\}\) has area smaller than 1.
Indeed, we take any \(w\in \mathbb {R}^3\) and look at the section
By the definition of T, the points in this section are of the form (v, w) with
where \(w_j\) is in \(K_j\) and the \(\lambda _j\)s are positive and add up to one. In particular, this section is contained in \(Q \times {w}\), where Q denotes the square with vertices \(v_j\). This section cannot contain all the four points \((v_j,w)\). In fact, assume that it contains the point \((v_1,w)\). Then, (18) and the fact that \(v_1\) is an extremal point of Q imply that w belongs to \(K_1\), as all the \(\lambda _j\)s with \(j>1\) must vanish in (18). Since any given w in \(\mathbb {R}^3\) belongs to at most three of the \(K_j\)s, the claim is proven. Being a closed set that is contained in \(Q \times {w}\) and does not contain \((v_j,w)\) for at least one j, the section (17) has area strictly smaller than 1. Since the area of the intersection of a convex body with \(\mathbb {R}^2 \times {w}\) is an upper semicontinuous function of w, all the sections of T by planes parallel to \(\mathbb {R}^2 \times \{0\}\) have area less than A for some \(A<1\).
We choose as \(p_1,p_2,p_3,p_4\) the points
for \(t>0\) so small that the area of the square with the vertices \(p_1,p_2,p_3,p_4\) is larger than A (while smaller than 1). Then,
because any translation of these points will enclose a square that is too big to be contained in a section of T parallel to \(\mathbb {R}^2\times \{0\}\). However, any triplet from \(\{p_1,p_2,p_3,p_4\}\) is not in F(T): Consider without loss of generality the triplet \(\{p_1,p_2,p_3\}\). By (b), there is a point w in the interior of
Then, the section \(\mathbb {R}^2\times \{w\}\) contains a translated copy of the triangle with vertices \(v_1,v_2,v_3\) and \(\{p_1,p_2,p_3\}\) can be translated into the interior of such triangle, and, hence, into the interior of T. This proves the claim.
We remark that the proof of Proposition 6 does not apply to this example due to the lack of applicability of Proposition 5 which itself goes back to Proposition 4 (for which being a closed billiard trajectory is essential beyond the sole being of a closed polygonal curve that cannot be translated into the interior of T.)
Ad (B): Let \(T\subset \mathbb {R}^3\) be the convex hull of the points
One checks that \(p=(p_1,p_2,p_3)\) with
is a lengthminimizing closed billiard trajectory on T: It is the Fagnano triangle of the affine section \(T\cap X_{1,3}\) translated by \((0,1,0)\), where, in general, we denote by \(X_{i,j}\) the \((x_i,x_j)\)plane of \(\mathbb {R}^3_{(x_1,x_2,x_3)}\). If we define
then \(T\cap V\) is the inclusion minimal affine section of T that contains p. One checks that
is a lengthminimizing closed billiard trajectory in \(T\cap V\) (with \(\widetilde{p}\notin F(T)\)) but
Therefore, p is not a lengthminimizing closed billiard trajectory in \(T\cap V\) (see Fig. 4).
The closed billiard trajectory p may not even locally minimize the length of closed polygonal curves in \(F(T\cap V)\). To see this, we slightly move \(p_2\) clockwise along \(\partial (T\cap V)\). We denote this slightly perturbed \(p_2\) by
The closed polygonal curve
satisfies
and \(\bar{p}^\delta \) converges with respect to the Hausdorff distance to p for \(\delta \rightarrow 0\).
Ad (C): Let \(T_\varepsilon \subset \mathbb {R}^3\), \(\varepsilon >0\) small, be the convex polytope given by the vertices
We claim that for sufficiently small \(\varepsilon >0\), the unique lengthminimizing closed billiard trajectory in \(T_\varepsilon \) is given by \(p=( p_1,p_2,p_3)\) with
Moreover, we claim that p is not regular within the inclusion minimal affine section of \(T_\varepsilon \) that contains p (see Fig. 5).
Indeed, p is contained in the affine section \(T_\varepsilon \cap V\) with
\(T_\varepsilon \cap V\) is given by the vertices
and is subset of the equilateral triangle \(\Delta _1\) given by the vertices
The closed billiard trajectory p is coinciding with the Fagnano triangle of \(\Delta _1\) which is the unique lengthminimizing closed billiard trajectory in \(\Delta _1\) (with length \(\frac{3}{2}\)). By construction, p is a closed billiard trajectory in \(T_\varepsilon \) as well as in \(T_\varepsilon \cap V\): The hyperplanes in \(\mathbb {R}^3\), respectively in V, related to the billiard reflection rule are the one which are normal to the bisectors of the polygonal curve segments
Let \(F_1\) be the facet of \(T_\varepsilon \) given by the vertices
and \(F_2\) the facet of \(T_\varepsilon \) given by the vertices
Then, p uniquely minimizes the length over all closed billiard trajectories in \(T_\varepsilon \) which are contained in the affine sections
(we note: \(V^1=V\)) as consequence of the tilt of \(F_1\) and \(F_2\). Because of this, all bouncing points of closed billiard trajectories in \(T_\varepsilon \cap V^a\) have to be on the boundary of the equilateral triangle \(\Delta _1^a\) given by the vertices
(we note: \(\Delta _1^{1}=\Delta _1\)) and the lengthminimizing closed billiard trajectories in \(\Delta _1^a\) are its Fagnano triangles. However, we have to be careful since there are closed billiard trajectories on \(T_\varepsilon \) which lie within the affine sections \(T_\varepsilon \cap V^a\) with bouncing points on \(\Delta _1^a\), but which have the property that they are in
This is for instance the case for the closed billiard trajectories given by the bouncing points
However, the length of the billiard trajectories of this kind converges to
for \(\varepsilon \rightarrow 0\).
We show that all other closed billiard trajectories in \(T_\varepsilon \) have a length greater than \(\frac{3}{2}\): For that, we first notice that whenever we consider a closed billiard trajectory in \(T_\varepsilon \) with one bouncing point on the front facet
and another one on the back facet
of \(T_\varepsilon \), then it has a length greater or equal than 4. Every other closed billiard trajectory in \(T_\varepsilon \) either has two bouncing points, one on \(\mathring{F}_1\) or \(\mathring{F}_2\) and the other on the back or front facet, respectively, or it has one bouncing point on \(\mathring{F}_1\) and another on \(\mathring{F}_2\) while it has nonempty intersection either with the front or with the back facet. This follows from the fact that whenever we have a closed billiard trajectory with bouncing point on \(\mathring{F}_1\) (\(\mathring{F}_2\)) and no other on \(\mathring{F}_2\) (\(\mathring{F}_1\)), then at least one of the previous and following bouncing points is on the front and back facet (or the other way round), respectively. In the case of a closed billiard trajectory \(p'\) with two bouncing points, one on \(\mathring{F}_1\) or on \(\mathring{F}_2\) and the other on the back or the front facet, respectively, we have
or
respectively, where we denote by \(G_1\) the line segment from
and by \(G_2\) the line segment from
since
In the case of a closed billiard trajectory \(p'\) with one bouncing point on \(\mathring{F}_1\) and another on \(\mathring{F}_2\) while it has nonempty intersection either with the front or with the back facet, we have
where we denote by G the line segment from
The closed billiard trajectory p is not regular in \(T_\varepsilon \cap V\) since the normal cone
is twodimensional, i.e., \(p_3\) is a nonsmooth boundary point of \(T_\varepsilon \cap V\).
We clearly see why the argument used in the proof of Theorem 1 does not apply to this example. The \(T_\varepsilon \)supporting hyperplane through \(p_3\) for which the billiard reflection rule is satisfied is
The only way of perturbing \(H_3\) to \(H_3^{pert}\) as required within the proof of Theorem 1 is by tilting it around the axis through the points
But in any case,
cannot be nearly bounded in \(\mathbb {R}^3\) (when \(H_1\) and \(H_2\) denote the uniquely determined \(T_\varepsilon \)supporting hyperplanes through \(p_1\) and \(p_2\)). Therefore, it is not possible to construct a closed polygonal curve
while guaranteeing
We remark that \(T_\varepsilon \) is a convex polytope. Nevertheless, it can be made strictly convex without losing the relevant properties.
Constructing closed billiard trajectories
Constructing closed regular billiard trajectories
Throughout this section, we let \(T \subset \mathbb {R}^n\) be a convex polytope that plays the role of the billiard table. In this section, we will concentrate on closed regular billiard trajectories on P. Regular billiard trajectories are especially interesting given the fact that they are the classical ones, i.e., billiard trajectories with bouncing points on the billiard table cushions while not running into the billiard table pockets (of course, here we mean its higher dimensional generalizations, where we identify every jface of P for \(j<n+1\) as a pocket and every facet of P as a cushion of the billiard table P).
By doing this, we extend the approach of finding closed regular billiard trajectories on two dimensional convex polytopes described in [2] to higher dimensions. Therein, the main tool was the property of the so called Fagnano triangles representing the uniquely determined closed regular billiard trajectories in acute triangles. Since there are no higherdimensional analogues of the Fagnano triangles for the extension, we though have to generalize the approach: it will turn out that we can make use of the reformulation of the billiard reflection rule in Proposition 2.
We note that in higher dimensions, it is much more complicated to construct closed nonregular billiard trajectories. However, the special case of closed nonregular billiard trajectories with two bouncing points is not a challenge. For that, we refer to the algorithm described in [2], where the higher dimensional generalization is straightforward. For the case when the polytope is acute (what means that all dihedral angles are acute), we refer to the following result shown in [1]: every lengthminimizing closed billiard tarajectory on an acute convex polytope is maximally spanning, regular, and has exactly \(n+1\) bouncing points. Therefore, for this case, it suffices to just consider the closed regular billiard trajectories with \(n+1\) bouncing points.
The following is a sketch of the algorithm that produces lengthminimizing closed regular billiard trajectories.

For \(m \in \{2,\ldots , n+1\}\) do:

Choose m pairwise different facets \(F_1,\ldots ,F_m\) of T. For every \(j \in \{1,\ldots ,m\}\) we let \(u_j = n_T(p_{j+1})\) for some point \(p_{j+1}\) in the relative interior of \(F_{j+1}\). Note that \(u_j\) does not depend on the choice of \(p_{j+1}\).

Find \(n_1,\ldots , n_m \in S^{n1}\cap \mathrm{span}\{u_1,...,u_m\}\) such that \(n_{j+1}  n_{j} = \mu _j u_{j}\) with \(\mu _j > 0\) holds for every \(j \in \{1,\ldots , m\}\).

Find \(p_j \in F_j\) for \(j\in \{1,\ldots ,m\}\) such that \(p_{j+1}  p_{j} = \lambda _j n_{j}\) with \(\lambda _j > 0\) holds for every \(j \in \{1,\ldots , m\}\).

Calculate the length of the closed polygonal curve and store it, if it is smaller than any such closed polygonal curve found so far.


Output the stored closed polygonal curve and its length.
Proposition 2 ensures that any closed polygonal curve found by the algorithm is indeed a closed billiard trajectory. More precisely, if \(p_1,\ldots ,p_m\) are the vertices of the closed polygonal curve, then (5) is satisfied by construction. We will now examine this algorithm in more detail.
We start by letting \(F_1,\ldots , F_m\) and \(u_1,\ldots , u_m\) be as described above. Let U be the \((n \times m)\)matrix that contains \(u_1,\ldots , u_m\) as columns. Then it follows from Theorem 1 that
is a necessary condition if we search for a lengthminimizing closed billiard trajectory. Therefore, some choices of \(F_1,\ldots , F_m\) can be discarded immediately. We note that (19) also implies that
has up to scaling a unique solution \(\mu _1,\ldots , \mu _m >0\). Consequently, there is (up to scaling) only one closed polygonal curve that can be constructed by using negative multiples of \(u_1 \ldots , u_m\) in order.
To find suitable \(n_1,\ldots ,n_m \in S^{n1}\cap \mathrm{span}\{u_1,...,u_m\}\), we let \(\gamma = (\gamma _1,\ldots , \gamma _m)\) be this closed polygonal curve, encoded by its m vertices. The task is now to scale (only using a positive scalar factor) and translate \(\gamma \) such that the vertices of \(\gamma \) lie on \(S^{n1}\cap \mathrm{span}\{u_1,...,u_m\}\). We take \(n_1,\ldots ,n_m\) as these vertices
Note that in the remainder of the algorithm it is required to form another closed polygonal curve using only positive multiples of \(n_1,\ldots ,n_m\) in order, i.e.,
If this property is true, then one says that \(n_1,\ldots ,n_m\) are a totally cyclic vector configuration. Following [20], we can find an equivalent property by using Farkas’ lemma. This property states that for every vector \(v \in \mathbb {R}^n\), one of the following conditions hold:

(a)
\(\left\langle n_j , v \right\rangle < 0\), for some \(j \in \{1,\ldots , m\}\),

(b)
\(\left\langle n_j , v \right\rangle = 0\), for all \(j \in \{1,\ldots , m\}\).
Hence, if \(n_1,\ldots ,n_m\) are a totally cyclic vector configuration, it follows that
This property is less restrictive than (20), but is still sufficient for the upcoming arguments.
While there might be multiple possibilities to scale and translate \(\gamma \) such that its vertices lie on \(S^{n1}\), there is at most one possibility such that \(\gamma \)’s vertices \(n_1,...,n_m\) on \(S^{n1}\) are a totally cyclic vector configuration (and this would also guarantee that the vertices of \(\gamma \) lie not only on \(S^{n1}\), but on \(S^{n1}\) intersected with \(\mathrm{span}\{u_1,...,u_m\}\)).
Proposition 7
Let
and
be given. If \(n_1,... ,n_m\in S^{n1}\) satisfy (21), where
for every j, then
Proof
We show that the existence of \((\widetilde{\mu },\widetilde{t}\,) \in S_\gamma \) with \(\widetilde{\mu } > \mu ^*\) yields a contradiction. For \(j\in \{1,\ldots ,m\}\) we have
where
Because of \((\mu ^*,t^*), (\widetilde{\mu },\widetilde{t}) \in S_\gamma \) we get
Since \(n_1,\ldots ,n_m\) satisfy (21), there is some \(i \in \{1,\ldots ,m\}\) such that \(\left\langle t' , n_i \right\rangle \leqslant 0\). Note that this is obviously true if \(t' = 0\). Therefore,
which is a contradiction.
We point out that the maximum in Proposition 7 is indeed a maximum because the unit ball is compact and hence
is compact as well. Proposition 7 implies that if the vertices of
are totally cyclic vector configurations (and hence satisfy (21)) then they are scaled by the same factor, i.e. \(\mu _1 = \mu _2\). However, we also need \(t_1 = t_2\) to make sure that there is only one suitable way to scale and translate \(\gamma \). The next Proposition shows that this is indeed the case.
Proposition 8
Let
\(S_\gamma \) as in Proposition 7, and
Further, let
be defined by
for every \(j \in \{1,\ldots ,m\}\). If \(n_1,\ldots ,n_m\) satisfy (21), then
i.e., \(n_j=n_j'\) for every \(j \in \{1,\ldots ,m\}\).
Proof
From Proposition 7 we have \(\mu _1 = \mu _2\) and therefore for every \(j\in \{1,\ldots , m\}\):
Similar to the calculation in the proof of Proposition 7, we get
Hence, the term \(\left\langle n_j , t_2t_1 \right\rangle \) does not depend on j. Because of (21), one can find \(i,j \in \{1,\ldots , m\}\) such that
Since these terms don’t depend on the index of n, we get
for every \(j\in \{1,\ldots , m\}\). Further, we get
and so \(t_1 = t_2\).
Assume we found some \(n_1,\ldots , n_m\in S^{n1}\) by scaling and translating the polygonal curve \(\gamma \) as described above. Recall that, by construction of \(\gamma \), we have
for some \(\mu _j > 0\) for every \(j\in \{1,\ldots ,m\}\). This implies
and, consequently,
Because \(\mu _j\) is positive, we have
and
for every \(j \in \{1,\ldots ,m\}\). Therefore, if any of the vectors \(n_1,\ldots , n_m\) is known, the remaining ones can be calculated easily. For what follows, we choose to search for \(n_1\). This search can be carried out by a secondorder cone program (SOCP). An SOCP is a convex optimization problem, where one is looking for an element of the secondorder cone
such that some linear constraints are satisfied and a linear objective function is optimized. An SOCP in standard form looks like this:
where \(c,a_i \in \mathbb {R}^n\), \(s, r_i, b_i\in \mathbb {R}\) and I is some index set. It is well known that SOCPs can be solved efficiently (see [5]).
Before we state the SOCP, we need the following identity:
where I is the \(n\times n\) identity matrix. This identity holds for \(1\leqslant j \leqslant m\). Two types of constraints are necessary for the SOCP. First, we need to make sure that
is satisfied:
Second, we require
for every \(j \in \{1,\ldots ,m\}\). Here, we can replace the strict inequality by \(\leqslant \). The reason for this is the observation made earlier, that the polygonal curve \(\gamma \) is unique up to scaling. So, if any solution of the SOCP yields \(\mu _i =0\) for some i, then every solution yields \(\mu _i =0\) and no closed regular billiard trajectory \(p=(p_1,\ldots ,p_m)\) with \(p_j\in F_j\) for \(j \in \{1,\ldots ,m\}\) exists.
For the objective of the SOCP we note that
The vectors \(n_1,\ldots ,n_m\) are required to be vertices of \(\mu \gamma + t\) for some \((\mu ,t)\in S_\gamma \). Proposition 7 states that the only possible way for \(n_1,\ldots ,n_m\) to be a totally cyclic vector configuration is if \(\mu \) is maximal. Hence, we would like to choose \(n_1\) such that (22) is as big as possible. Thus, we obtain the following SOCP:
If this SOCP has an optimal solution \(x^*\), we pick \(n_1=x^*\). It is easy to see that this way \(n_1\) lies on \(S^{n1}\). If we assume
then \(x^*/x^*\) would be feasible as well, but would have a greater objective value (unless the optimal value is 0 in which case \(\mu _j=0\) for every j. But then, there is no closed regular billiard trajectory for the given choice of facets). This contradicts the optimality of \(x^*\).
We now have a way to find \(n_1\) and, hence, also \(n_2,\ldots ,n_m\). These vectors are unique by Proposition 8. We proceed in a similar fashion as before in order to find the bouncing points \(p_1,\ldots ,p_m\) of a closed regular billiard trajectory. (5) states that
needs to hold for every \(j \in \{1,\ldots , m\}\), where \(\lambda _j > 0\). Thus, just like \(u_1,\ldots ,u_m\), we have that \(n_1,\ldots ,n_m\) are not linearly independent:
We would like to have that the \((n\times m)\)matrix \((n_1,\ldots , n_m)\) has rank \(m1\). Then, the closed polygonal curve which can be constructed by positive multiples of \(n_1,\ldots , n_m\) is unique up to scaling. Indeed, considering (23), this is the case as direct consequence of Theorem 1 and an argument from within the proof of Proposition 4.
For what follows, we let \(\xi = (\xi _1,\ldots ,\xi _m)\) be such a closed polygonal curve, i.e.,
with \(\lambda '_j>0\) for \(j\in \{1,\ldots ,m\}\). The task is now to find \(\lambda > 0\) and \(s \in \mathbb {R}^n\) such that
for every j. This can be done via a linear program (LP).
Just like an SOCP, an LP is a convex optimization with a linear objective function and linear constraints. As opposed to an SOCP, where the goal is to find an optimal member of \(\mathcal {L}^{n+1}\), an LP asks for an optimal member of the nonnegative orthant \(\mathbb {R}^n_{\geqslant 0}\). An LP in standard form looks as follows:
where \(c \in \mathbb {R}^n, b \in \mathbb {R}^r, A \in \mathbb {R}^{r\times n}\). Here, r is the number of linear constraints. Linear programming is a special case of secondorder cone programming. In particular, it is not surprising that LPs can be solved efficiently as well (see [16]).
For \(j \in \{1,\ldots ,m\}\) let
be the unique supporting hyperplane of T which contains \(F_j\). Then we require
Additionally, we would like to make sure that (if possible) the resulting closed billiard trajectory
is regular. Thus, we maximize the inclusion minimal slack of the form
This leads us to the following LP with \(n+2\) variables:
Note that any solution of the LP satisfies \(\lambda > 0\). If otherwise \(\lambda = 0\), then the equality constraints state that \(s\in H_j\). This means that all supporting hyperplanes which contain a face of T intersect at a common point. This is not possible. If a solution exists, we let
for \(j\in \{1,\ldots ,m\}\). If the optimal solution satisfies \(\rho > 0\), then \(p = (p_1,\ldots ,p_m)\) is a closed regular billiard trajectory which is potentially lengthminimizing (meaning that it satisfies the condition in Theorem 1). To ensure that we don’t miss any potentially lengthminimizing closed regular billiard trajectories, we are going to prove that it suffices to find one such closed billiard trajectory per choice of \(F_1,\ldots , F_m\).
Proposition 9
Let \(F_1,\ldots ,F_m\) be facets of some fulldimensional polytope T and let \(p_j,p_j' \in F_j\) for every j. Assume
are closed regular billiard trajectories in T. Then,
Proof
According to Proposition 2, there are \(n_1,\ldots ,n_m, n_1',\ldots ,n_m'\) such that:
As has been discussed earlier in this section, \(n_1,\ldots ,n_m\) are unique and only depend on \(n_T(p_1),\ldots , n_T(p_m)\). Therefore, we have \(n_j' = n_j\) for \(j \in \{1,\ldots , m\}\). Now, one has natural projection maps from \(H_1\) to \(H_2\) along \(n_1\), from \(H_2\) to \(H_3\) along \(n_2\), and so on, where we denote by \(H_j\) the Tsupporting hyperplane that contains \(F_j\). Their composition \(H_1\rightarrow H_1\) is an affine map that decreases the lengths of vectors in \(H_1\cap \mathrm{span}\{n_i\}\); hence, it cannot have more than one fixed point.
For each choice of \(F_1,\ldots ,F_m\), the algorithm needs to solve the following tasks: Calculate the rank of an \((n\times m)\)matrix, solve an SOCP with \(n+m+1\) constraints and \(n+1\) variables, solve an \((n+1)\times m\) system of linear equations, and solve an LP with mf constraints and \(n+2\) variables, where f is the number of facets of T. All these tasks are solvable in polynomial time (with respect to the dimension n and the number of facets of T); see for instance [14]. However, there are
possibilities to choose at least 2 but at most \(n+1\) facets, respecting their order. We can slightly improve this number since a cyclic shift of the chosen facets \(F_1,\ldots ,F_m\) will yield a similar (but shifted) result. This leaves us with
possibilities. The calculations for each of these possibilities are independent of each other. Therefore, we utilize parallel computing to accelerate the algorithm.
In Table 1, the running time of the algorithm can be seen. Each time, the billiard table is a polytope T with dimension 2, 3, or 4 which we generated in the following way: First, we chose some normally distributed random vectors. We scaled each of these vectors by some scalar between 1 and 3 (we decreased the length of this range if the amount of random vectors became too large). Afterwards, we received T as the convex hull of these vectors. Instead of a total running time, the table shows the time needed to compute a lengthminimizing closed regular billiard trajectory with 2, 3, 4, and 5 bouncing points, respectively. The table suggests that the calculations for m bouncing points with \(m < d+1\) terminate very quickly. The reason for this is that many iterations are cancelled early when the rank of \((u_1,\ldots , u_m)\) is checked. All calculations have been done on a Dell Latitude E6530 laptop with Intel Core i73520M processor, 2.9 GHz (capable of running four threads). The algorithm has been implemented in Python and mainly utilizes the NumPy library. The LPs and SOCPs are solved via the software Mosek. The algorithm and a detailed description on how to choose the input is available on the website www.github.com/SKrupp/EHZcapacityofpolytopes (cf. also the description in [11]).
Constructing closed nonregular billiard trajectories
We already noted that it is much more complicated to construct closed nonregular billiard trajectories (with more than two bouncing points and on higher dimensional tables). From Theorem 1 we know that the lengthminimizing closed billiard trajectories are maximally spanning and have at most \(n+1\) bouncing points, but they do not have to be relatively regular, i.e., they do not have to be regular within the inclusion minimal affine section that contains themselves. This makes it difficult to reduce the problem of searching for lengthminimizing closed billiard trajectories to the problem of searching for suitable closed billiard trajectories within affine sections of the billiard table.
One way to overcome this problem is to set a condition on the billiard tables that are permitted such that the possibility of having lengthminimizing closed billiard trajectories which are not relatively regular is excluded. With a look at the proof of Theorem 1, this can be achieved by requiring the convex bodies \(T\subset \mathbb {R}^n\) to satisfy the following condition: for every affine section \(T\cap V\) of T that contains a set of points on \(\partial T\) that is in F(T), we have
where W is the \((n\mathrm{dim}\,V)\)dimensional linear subspace orthogonal to V^{Footnote 5}. We call the set of convex bodies in \(\mathbb {R}^n\) satisfying (24) \(\mathcal {C}^{c}(\mathbb {R}^n)\) and conclude the following corollary:
Corollary 1
Let \(T\in \mathcal {C}^c(\mathbb {R}^n)\) be a billiard table and \(p=(p_1,...,p_m)\) a lengthminimizing closed billiard trajectory on T. Further, let \(U\subseteq \mathbb {R}^n\) be the convex cone spanned by the normal vectors related to the billiard reflection rule and let \(V\subseteq \mathbb {R}^n\) be the affine subspace such that \(T\cap V\) is the inclusion minimal affine section of T that contains p. Then, one has \(U=V_0\), where \(V_0\) is the linear subspace underlying V, and p is maximally spanning and relatively regular.
One can easily see from the last part of the proof of Theorem 1 (when arguing that the constructed closed polygonal curve \(\widetilde{p}\) is in F(T)) that the condition \(T\in \mathcal {C}^c(\mathbb {R}^n)\) allows one to replace (3), i.e.,
by
Let \(P\in \mathcal {C}^c(\mathbb {R}^n)\) now be a convex polytope. Now, using Corollary 1, our aim is to construct closed billiard trajectories on P which come into question to minimize the length. More precisely, we construct maximally spanning and relatively regular closed billiard trajectories on P with j bouncing points for \(j\in \{3,...,n+1\}\).
For that, we first introduce the following useful characterization of affine sections of P: We call an affine section \(P\cap V\) of P essential if
By Lemma 1(ii), this can be equivalently expressed by: \(P\cap V\) is essential if there are Psupporting halfspaces of \(\mathbb {R}^n\) through points on \(\partial (P\cap V)\) such that its intersection is nearly bounded.
Expressed in pseudo code, we then do the following steps for every essential \((j1)\)dimensional affine section \(P\cap V\) of P (an explanation follows–also concerning whether this produces an endless loop):

(a)
Choose j facets \(F_1,...,F_j\) of \(P\cap V\) (considering the order) such that the cone spanned by the associated outer normal unit vectors \(n_{F_1},...,n_{F_j}\) (within V) is \(V_0\).

(b)
Construct the uniquely determined (up to scaling and translation) closed polygonal curve \((\gamma _1,...,\gamma _j)\), where the \(\gamma _{i+1}\gamma _i\) are given by negative multiples of the \(n_{F_i}\) for all \(i\in \{1,...,j\}\).

(c)
If possible: Find \(\lambda >0\) and \(c\in \mathbb {R}^n\) such that
$$\begin{aligned} \lambda \{\gamma _1,...,\gamma _j\}+c\subset S^{n1}\cap V_0.\end{aligned}$$Otherwise: If possible: Go back to step (a) and start with a choice not yet made. Otherwise: End.

(d)
Define unit vectors \(n_1,...,n_j\) by
$$\begin{aligned} n_i:=\lambda \gamma _i+c \quad \forall i\in \{1,...,j\}.\end{aligned}$$Construct the uniquely determined (up to scaling and translation) closed polygonal curve \((\xi _1,...,\xi _j)\), where the \(\xi _{i+1}\xi _i\) are given by positive multiples of the \(n_{i+1}\) for all \(i\in \{1,...,j\}\). Otherwise: If possible: Go back to step (a) and start with a choice not yet made. Otherwise: End.

(e)
If possible: Find \(\mu >0\) and \(e\in \mathbb {R}^n\) such that
$$\begin{aligned} \mu \xi _i+e\in \mathring{F}_i\quad \forall i\in \{1,...,j\}.\end{aligned}$$Otherwise: If possible: Go back to step (a) and start with a choice not yet made. Otherwise: End.

(f)
We define a closed polygonal curve \(p=(p_1,...,p_j)\) by
$$\begin{aligned} p_i:=\mu \xi _i+e\quad \forall i\in \{1,...,j\}.\end{aligned}$$By construction: p is a maximally spanning and relatively regular closed billiard trajectory on P with j bouncing points. Add p to the set \(B_{j}(P)\).

(g)
If possible: Go back to step (a) and start with a choice not yet made. Otherwise: End.
For every \(j\in \{2,...,n+1\}\) the set \(B_{j}(P)\) contains all maximally spanning and relatively regular closed billiard trajectories on P with j bouncing points whose length can be easily calculated by (2). The final task is to find at least one minimizer in every \(B_j(P)\), and consequently one global minimizer.
Let us sketchily explain the idea behind the above steps: The main idea is to use Proposition 2. More precisely, for every \(j\in \{3,...,n+1\}\), we first select j facets of each essential \((j1)\)dimensional affine section of P which by Proposition 4 (which is also reflected within Theorem 1 and Corollary 1) have to satisfy \(U=V_0\), where U is the convex cone spanned by the corresponding normal vectors, and check whether the choice of the facets (considering their order) makes the existence of closed billiard trajectories with bouncing points in the interiors of these facets possible. We check this implicitly by first using the second condition in (5) to determine the unit vectors in (5). By a geometrical argument, we then draw conclusions from the first condition in (5) as to whether the above mentioned closed billiard trajectories can exist. All of this can be done for each choice of j facets (considering their order) of each essential \((j1)\)dimensional affine section of P so that after a finite number of steps we have constructed all regular closed billiard trajectories with j bouncing points within each essential \((j1)\)dimensional affine section of P.
Starting with the selection of essential \((j1)\)dimensional affine sections of P, stems from Lemma 1(iii), i.e., from the fact that every closed billiard trajectory on P is in F(P). We, however, note that there can be an infinite number of essential affine sections of P. Nevertheless, since P is a convex polytope, from the qualitative perspective, there are only finitely many different essential affine sections. With a clever implementation, one should be able to avoid qualitativelyequal choices of essential affine sections. This would prevent the algorithm to produce endless loops.
Let us now turn to the explanation of the individual steps:
Ad (a): If there is a maximally spanning and relatively regular closed billiard trajectory with j bouncing points contained in an essential affine section \(P\cap V\), then we know together with Proposition 4, i.e., with \(U=V_0\), that the bouncing points lie in the interiors of j different facets of \(P\cap V\) while the cone spanned by the corresponding outer unit normal vectors is \(V_0\). This implies by Proposition 5 that the intersection of the halfspaces which contain P and support these facets is nearly bounded in \(\mathbb {R}^n\). By Lemma 1(ii), this ensures that a closed polygonal curve with vertices on these facets cannot be translated into the interior of P (which by 1(iii) is a necessary condition for closed billiard trajectories on P). This justifies to start with essential affine sections of P as necessary condition for the existence of closed billiard trajectories which come into question to minimize the length.
Ad (b): Since the cone spanned by \(n_{F_1},...,n_{F_j}\) is \((j1)\)dimensional, solving a system of linear equations yields a uniquely determined (up to scaling and translation) jtuple \((\gamma _1,...,\gamma _j)\in (\mathbb {R}^n)^j\) and a uniquely determined (up to scaling) jtuple \((\alpha _1,...,\alpha _j)\in (\mathbb {R}_{<0})^j\) satisfying
for all \(i\in \{1,...,j\}\). We understand the jtuple \((\gamma _1,...,\gamma _j)\) as a closed polygonal curve.
Ad (c): There is at most one combination \((\lambda ,c)\in \mathbb {R}_{>0}\times \mathbb {R}^n\) such that
This is guaranteed by the fact that the underlying linear subspace \(V_0\) of V is unique.
Ad (b) & (c): If we define unit vectors \(n_1,...,n_j\) by
for all \(i\in \{1,...,j\}\) while it is the case that the condition in step (c) holds for \((\lambda ,c)\in \mathbb {R}_{>0}\times \mathbb {R}^n\), then these unit vectors are candidates to be the unit vectors in (5) associated to a possibly existing closed billiard trajectory on P with bouncing points in the interiors of \(F_1,...,F_j\). However, the second condition in (5) is already guaranteed. In what follows, it has to be checked whether there really is an associated closed billiard trajectory on P with bouncing points in the interiors of \(F_1,...,F_j\).
Ad (d): The cone spanned by the unit vectors \(n_1,...,n_j\) is \(V_0\). Therefore, as in step (b), solving a system of linear equations yields a uniquely determined (up to scaling und translation) jtuple \((\xi _1,...,\xi _j)\in (\mathbb {R}^n)^j\) and a uniquely determined (up to scaling) jtuple \((\beta _1,...,\beta _j)\in (\mathbb {R}_{>0})^j\) satisfying
for all \(i\in \{1,...,j\}\). We understand the jtuple \((\xi _1,...,\xi _j)\) as a closed polygonal curve.
Ad (e) & (f): Similar to step (c), there is at most one combination \((\mu ,e)\in \mathbb {R}_{>0}\times \mathbb {R}^n\) such that
By checking whether
we make sure that the closed polygonal curve \(p=(p_1,...,p_j)\) defined by
for all \(i\in \{1,...,j\}\) has its vertices in the interiors of the facets \(F_1,...,F_j\). The closed polygonal curve is a closed billiard trajectory on P since \(p=(p_1,...,p_j)\) is fulfilling (5) together with the jtuple of unit vectors \((n_2,...,n_j,n_1)\) and
Indeed, we have
Additionally, p is maximally spanning and relatively regular by construction. Therefore, p is a maximally spanning and relatively regular closed billiard trajectory on P which is contained in the essential affine section \(P\cap V\).
Tasks we left for further research are the theoretical clarification of the individual steps as in Section 5.1, the implementation of the algorithm (which includes to develop a technique in order to find only finitely many qualitativelydifferent essential affine sections), and a criteria for deciding whether a convex body/polytope is in \(\mathcal {C}^c(\mathbb {R}^n)\). This last task seems to be challenging since, obviously, not every convex body can be approximated by convex polytopes in \(\mathcal {C}^c(\mathbb {R}^n)\). For instance, one easily checks that for Example (C) in Section 4 this is not possible. It remains the question how big \(\mathcal {C}^c(\mathbb {R}^n)\) is in \(\mathcal {C}(\mathbb {R}^n)\).
Data Availability
The datasets generated during and/or analyzed during the current study are available from the corresponding authors on reasonable request.
Notes
For the sake of simplicity, whenever we talk of the vertices \(p_1,...,p_m\) of a closed polygonal curve, we assume that they satisfy \(p_j\ne p_{j+1}\) and \(p_j\) is not contained in the line segment connecting \(p_{j1}\) and \(p_{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.
In what follows, this is the way how we measure the length of closed polygonal curves in general.
It does not necessarily have to be \(\widetilde{H}_j=H_{i_j}\cap V\). Further, note that due to this special situation it is not necessary to proceed to an even finer selection of \(\{i_1,...,i_{\mathrm{dim}\,V +1}\}\) (and even if that were necessary, it would not impede the following argument).
This example arose from the hints of A. Abbondandolo.
We remark that one could weaken the condition by requiring that for every affine section \(T\cap V\) of T that contains a (lengthminimizing) closed billiard trajectory we have (24). However, this condition is not so easy to check apriori, because we are just searching for (lengthminimizing) closed billiard trajectories.
References
Akopyan, A., Balitskiy, A.: Billiards in convex bodies with acute angles. Isr. J. of Math. 216, 833–845 (2016)
Alkoumi, N., Schlenk, F.: Shortest closed billiard orbits on convex tables. Manuscr. Math. 147, 365–380 (2015)
ArtsteinAvidan, S., Karasev, R., Ostrover, Y.: From symplectic measurements to the Mahler conjecture. Duke Math. J. 163(11), 2003–2022 (2014)
Balitskiy, A.: Equality Cases in Viterbo’s Conjecture and Isoperimetric Billiard Inequalities. Int. Math. Res. Not. 7, 1957–1978 (2018)
BenTal, A., Nemirovski, A.: Lectures on modern convex optimization: Analysis. Algorithms and Engineering Applications. MPSSIAM Ser. on Optim, SIAM, Philadelphia (2001)
Bezdek, K., Conelly, R.: Covering curves by translates of a convex set. Amer. Math. Mon. 96, 789–806 (1989)
Bezdek, D., Bezdek, K.: Shortest billiard trajectories. Geom. Dedic. 141, 197–206 (2009)
Ghomi, M.: Shortest periodic billiard trajectories in convex bodies. Geom. Funct. Anal. 14, 295–302 (2004)
Gutkin, E.: Billiard dynamics: An updated survey with the emphasis on open problems. Chaos 026116 (2012)
Katok, A.: The billiard table as a mathematician’s playground. Mosc. Cent. for Cont. Math, Educ (2002)
Krupp, S.: Calculating the EHZ Capacity of Polytopes. Dissertation to download: https://kups.ub.unikoeln.de/36196/, Universität zu Köln (2021)
Krupp, S., Rudolf, D.: Shortest Minkowski billiard trajectories on convex bodies. arXiv:2203.01802 (2022)
Mahler, K.: Ein Übertragungsprinzip für konvexe Körper. Časopis Pěst. Mat. Fys. 68, 93–202 (1939)
Nesterov, Y., Nemirovski, A.: Interior point polynomial methods in convex programming. SIAM Publ, Philadelphia (1994)
Rudolf, D.: Viterbo’s conjecture as a worm problem. arXiv:2203.02043 (2022)
Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons Inc, Newyork (1998)
Tabachnikov, S.: Geometry and billiards. Americ. Math, Soc (2005)
Viterbo, C.: Metric and isoperimetric problems in symplectic geometry. Journal of the American Mathematical Society 13 (2000)
Wetzel, J.E.: Sectorial covers for curves of constant length. Canad. Math. Bull. 16(3), 367–375 (1973)
Ziegler, G.M.: Lectures on polytopes, Grad. Texts in Math. 152, Springer, New York Berlin Heidelberg (1995)
Acknowledgements
This research was carried out under the supervision of Alberto Abbondandolo and Frank Vallentin. The authors are thankful to the supervisors’ support and thank Alexey Balitskiy for his remarks on a previous draft of this paper. The authors also thank the unknown referee for the useful comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This research is 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., Krupp, S. A regularity result for shortest generalized billiard trajectories in convex bodies in \(\mathbb {R}^n\). Geom Dedicata 216, 55 (2022). https://doi.org/10.1007/s10711022007173
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10711022007173
Keywords
 Euclidean Billiard
 Generalized Billiards
 Shortest Periodic Orbit
 Polytopes
 Algorithmic Geometry
Mathematics Subject Classification
 37D50
 3704