Abstract
For every flat surface, almost every flat surface in its \(\textsf{SL}(2,\mathbb {R})\) orbit has the following property: the sequence of its saddle connection lengths in non-decreasing order is uniformly distributed in the unit interval.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
1 Introduction
Given a closed Riemann surface X of genus at least two, every non-zero holomorphic one-form \(\omega \) on X has at least one zero. If \(\Sigma \) is the set of zeroes of such an \(\omega \) then on \(X {\setminus } \Sigma \) there is an induced atlas of charts to \(\mathbb {R}^2\) all of whose transition maps are translations. A saddle connection of a holomorphic one-form \(\omega \) is any continuous map \(v: [0,1] \rightarrow X\) such that \(v^{-1}(\Sigma ) = \{0,1\}\) and that v|(0, 1) is a geodesic segment in every chart of the induced atlas on \(X \setminus \Sigma \). Associated to each saddle connection v is its holonomy vector
in \(\mathbb {R}^2\). The group \(\textsf{SL}(2,\mathbb {R})\) is known to act on pairs \((X,\omega )\) via composition with the charts of the atlas. The action takes saddle connections to saddle connections, and is such that \(\textsf{h}(\textsf{g}v) = \textsf{g}\textsf{h}(v)\) for all \(\textsf{g}\in \textsf{SL}(2,\mathbb {R})\) and all saddle connections of \(\omega \).
Enumerating the saddle connections of \(\omega \) as \(n \mapsto v_n\) in such a way that \(n \mapsto |\!|\textsf{h}(v_n) |\!|\) is non-decreasing one can ask about the distribution of this sequence modulo one. In [1] it was proved for every \(\textsf{SL}(2,\mathbb {R})\) invariant and \(\textsf{SL}(2,\mathbb {R})\) ergodic probability measure \(\mu \) on any stratum \({\mathcal {H}}\), that the sequence \(n \mapsto v_n\) is uniformly distributed modulo one for \(\mu \) almost every flat surface. Here we prove the following refined result.
Theorem 1.1
For every flat surface \(\omega _0\) of genus at least two and for almost every \(\textsf{g}\in \textsf{SL}(2,\mathbb {R})\), the sequence \(n \mapsto v_n\) of lengths of saddle connections of \(\textsf{g}\omega _0\) listed in non-decreasing order is uniformly distributed modulo one.
This is an improvement over [1, Theorem 1] in two ways. Firstly, the conclusion is stronger as the result holds for Haar almost-every flat surface in every \(\textsf{SL}(2,\mathbb {R})\) orbit, not just for almost every flat surface with respect to any ergodic \(\textsf{SL}(2,\mathbb {R})\) invariant probability measure on a stratum. Secondly, the use of [6] and the reliance on spectral gap results for the action of \(\textsf{SL}(2,\mathbb {R})\) on a stratum found in the proof of [1, Theorem 1] are replaced with a more direct argument that only makes use of the following quadratic upper bound on the number of saddle connections in a sector extending [2]. The notation is explained after the statement of the theorem.
Theorem 1.2
Fix a stratum \({\mathcal {H}}\) of flat surfaces of genus at least two. There is a constant \(c_4\) with the following property. For every \(\epsilon > 0\) and every flat surface \(\omega \in {\mathcal {H}}\) there is \(C(\omega ,\epsilon ) > 0\) such that
for every arc \(I \subset \textsf{S}^1\). Moreover, for each \(\epsilon > 0\) the constant \(C(\omega ,\epsilon )\) depends continuously on \(\omega \).
The explicit description in (1.3) of how large R must be in terms of the arc length of I is of independent interest. Theorem 1.2 will be proved in “Appendix A”.
We now introduce some notation that will be used throughout the article. Given an arc \(I \subset \textsf{S}^1\) write \(\textsf{Sec}(I)\) for the subset of \(\mathbb {R}^2\) that projects radially to I. Given \(\alpha < \beta \) with \(\beta - \alpha < 2\pi \) write \(\textsf{Sec}(\alpha ,\beta )\) for the sector \(\{ u \in \mathbb {R}^2: \alpha \le \arg (u) < \beta \}\). Given \(0 \le A < B\) write \(\textsf{Ann}(A,B)\) for the annulus \(\{ u \in \mathbb {R}^2: A \le |\!|u |\!|\le B \}\). Fix a non-zero holomorphic one-form \(\omega \) on a closed Riemann surface X of genus at least two. Write \(\Lambda (\omega )\) for the set of saddle connections of \(\omega \). For \(R > 0\) write \(\Lambda (\omega ;R)\) for the set of saddle connections of length at most R on \(\omega \). We enumerate \(\Lambda (\omega )\) by \(n \mapsto v_n\) so that \(n \mapsto |\!|\textsf{h}(v_n) |\!|\) is non-decreasing and \(v \mapsto \arg (\textsf{h}(v)) \in [0,2\pi )\) is non-decreasing on each level set of \(n \mapsto |\!|\textsf{h}(v_n) |\!|\). Given \(N \in \mathbb {N}\) write \(\Xi (\omega ;N)\) for \(\{ v_n: n \le N \}\) where \(n \mapsto v_n\) is the same enumeration as before. Lastly, write \(\ell (\omega ;N) = |\!|\textsf{h}(v_N) |\!|\) for the length of the Nth saddle connection on \(\omega \) in terms of the above ordering, and \(\ell (\omega ) = \ell (\omega ;1)\) for the length of the shortest saddle connection on \(\omega \). By an abuse of notation, given \(B \subset \mathbb {R}^2\) we write \(\Lambda (\omega ) \cap B\) for the set of saddle connections of \(\omega \) whose holomony vectors belong to B. We will interpret \(\Lambda (\omega ;R) \cap B\) and \(\Xi (\omega ;N) \cap B\) similarly.
We thank Jon Chaika for suggesting this project and many useful conversations related to it. We also thank the anonymous referee for a very thorough report. Donald Robertson was supported by NSF grant DMS 1703597.
2 Beginning the proof of Theorem 1.1
Here we begin the proof of Theorem 1.1 by reducing it to Theorem 2.8 via the Weyl criterion and a Borel–Cantelli argument. Fix throughout this section a unit-area flat surface \(\omega _0\) of genus at least two. Masur’s work [4, 5] yields constants \(c_1,c_2 > 0\) with
for all \(R > 0\). (The unorthodox expression is for later convenience.)
Write \(\mu \) for Haar measure on \(\textsf{SL}(2,\mathbb {R})\) and \(\textsf{m}\) for Lebesgue measure on \(\mathbb {R}\). For each \(t \in \mathbb {R}\) write
and define \({{\,\mathrm{\textsf{D}}\,}}(T) = \{ \textsf{r}^\theta \textsf{a}^t \textsf{r}^\psi \in \textsf{SL}(2,\mathbb {R}): 0 \le \theta , \psi < 2 \pi , 0 \le t \le T \}\) for all \(T > 0\). We scale \(\mu \) once and for all such that \(\mu ({{\,\mathrm{\textsf{D}}\,}}(2)) = 1\). Write \(\chi _p(x) = \exp (2 \pi i p x)\) for each \(p \in \mathbb {Z}\) and all \(x \in \mathbb {R}\).
Our first reduction is to the following uniform distribution criterion. Although we prove the theorem for all \(\tau > 1\), it suffices for the proof of Theorem 1.1 to do so for a sequence of values \(\tau > 1\) converging to 1.
Theorem 2.2
Fix \(p \in \mathbb {Z}\) and \(\tau > 1\). One has
for \(\mu \) almost-every \(\textsf{g}\in {{\,\mathrm{\textsf{D}}\,}}(1)\).
Proof of Theorem 1.1 assuming Theorem 2.2
Using Weyl’s criterion for uniform distribution and [1, Lemma 5] it suffices for the proof of Theorem 1.1 to produce a sequence \(\tau _1> \tau _2 > \cdots \rightarrow 1\) with the property that
holds for every \(i,p \in \mathbb {N}\) and \(\mu \) almost-every \(\textsf{g}\in \textsf{SL}(2,\mathbb {R})\). Since the \(\textsf{SL}(2,\mathbb {R})\) orbit of \(\omega _0\) is countably covered by sets of the form \({{\,\mathrm{\textsf{D}}\,}}(1) \textsf{g}\omega _0\) it suffices to work over \({{\,\mathrm{\textsf{D}}\,}}(1)\). \(\square \)
Our next reduction will be via a Borel–Cantelli argument similar to the one in [1]. We give full details as there are several salient changes; most notably we average over \(\Xi (\textsf{g}\omega _0; N)\) and \({{\,\mathrm{\textsf{D}}\,}}(1)\) in place of \(\Lambda (\omega ; N^2)\) and a large compact subset of a stratum. For each \(N \in \mathbb {N}\) define
for all \(\textsf{g}\in \textsf{SL}(2,\mathbb {R})\).
Lemma 2.5
For every \(N \in \mathbb {N}\), every \(0 < S \le 1\) and every \(\sigma > 0\) the estimate
holds.
Proof
Fix \(N \in \mathbb {N}\) and \(0 < S \le 1\) and \(\sigma > 0\). Write \(M = \{ \textsf{g}\in {{\,\mathrm{\textsf{D}}\,}}(1): |f_N(\textsf{g})|^2 \ge N^{-\sigma } \}\). Consider the function \(h: \textsf{SL}(2,\mathbb {R}) \rightarrow [0,1]\) defined by
for all \(\textsf{x}\in \textsf{SL}(2,\mathbb {R})\).
Claim. \(\mu \left( \left\{ \textsf{x}\in M: \dfrac{\mu ({{\,\mathrm{\textsf{D}}\,}}(S) \textsf{x}\cap M)}{\mu ({{\,\mathrm{\textsf{D}}\,}}(S/2))} \ge \dfrac{\mu (M)}{2} \right\} \right) \ge \int _{2h \ge \mu (M)} h \,\textrm{d}\mu \)
Proof
If we have \(\textsf{y}\in \textsf{SL}(2,\mathbb {R})\) with \(h(\textsf{y}) \ge \mu (M) / 2\) and \(\textsf{x}\in D(S/2) \textsf{y}\) then
because in this case \({{\,\mathrm{\textsf{D}}\,}}(S) \textsf{x}\cap M \supset {{\,\mathrm{\textsf{D}}\,}}(S/2) \textsf{y}\cap M\). Thus
and, combined with
we have proved the claim. \(\square \)
Since \(M \subset {{\,\mathrm{\textsf{D}}\,}}(1)\) we have \(h = 0\) outside \({{\,\mathrm{\textsf{D}}\,}}(2)\). Thus
and we deduce
from the claim and our scaling of \(\mu \) because the integral of h is \(\mu (M)\) by Fubini. An application of Markov’s inequality then furnishes (2.6). \(\square \)
Proposition 2.7
There is \(C_1 > 0\) such that for every \(N \in \mathbb {N}\), every \(0 < S \le 1\) and every \(\sigma > 0\) we have
Proof
Fix \(N \in \mathbb {N}\) and \(0 < S \le 1\) and \(\sigma > 0\). Write \(M = \{ \textsf{g}\in {{\,\mathrm{\textsf{D}}\,}}(1): |f_N(\textsf{g})|^2 \ge N^{-\sigma } \}\). We have
from Lemma 2.5. The definition of M along with Markov’s inequality gives
and the right-hand integral becomes
upon writing \(\mu \) in terms of the Cartan decomposition of \(\textsf{SL}(2,\mathbb {R})\) as in [3, Proposition 5.28]. The rotation \(\textsf{r}^\varphi \) does not affect the sum and may be removed; the integrals over \(\textsf{r}^{\theta _1}\) and \(\textsf{r}^{\theta _2}\) together form a convolution and may be combined into a single term; we may bound \(\sinh (t)\) by 2 and \(\sinh (s)\) by \(\sinh (S)\). For some constant \(C_1'\) one has
and, together with the above, we have an absolute constant \(C_1 > 0\) with
as desired. \(\square \)
From now on we fix the relationship
between \(N \in \mathbb {N}\) and \(S > 0\), where \(\delta > 0\) is to be determined by future requirements. (Ultimately \(\delta = \tfrac{1}{3}\) will suffice.) We now reduce the proof of Theorem 1.1 to the following statement.
Theorem 2.8
There is \(\eta > 0\) and \(N_0 \in \mathbb {N}\) and a constant \(C > 0\) such that
holds for all \(N \ge N_0\).
Proof of Theorem 1.1 assuming Theorem 2.8
Fix \(p \in \mathbb {Z}\) and \(\tau > 0\). By Theorem 2.2 it suffices to verify (2.3) for \(\mu \) almost-every \(\textsf{g}\in {{\,\mathrm{\textsf{D}}\,}}(1)\). Let \(\eta > 0\) and \(N_0 \in \mathbb {N}\) and \(C > 0\) be as in the hypothesis. Fix \(0< \sigma < \eta \). Whenever \(\lceil \tau ^J \rceil \ge N_0\) and \(\sigma > 0\) we have
by applying Proposition 2.7 and then (2.9). The right-hand side is summable over \(J \in \mathbb {N}\) and the Borel–Cantelli lemma finishes the proof. \(\square \)
There are two major steps in the proof of Theorem 2.8. We outline them here and carry out the details in Sects. 3 and 4 respectively. The steps will be combined to prove Theorem 1.1 in Sect. 5.
Step 1: Annular estimate. We wish to move the action \(\textsf{a}^s\) inside the summation appearing in (2.9). This is not straightforward because \(\Xi (\textsf{a}^s \textsf{r}^\theta \textsf{a}^t \textsf{r}^\phi \omega _0; N)\) and \(\textsf{a}^s \Xi (\textsf{r}^\theta \textsf{a}^t \textsf{r}^\phi \omega _0;N)\) need not agree. Indeed, if for \(\textsf{r}^\theta \textsf{a}^t \textsf{r}^\phi \omega _0\) one knows \(v_N\) is close to the horizontal and \(v_{N + 1}\) is close to the vertical then it may be that \(\textsf{a}^s v_{N + 1}\) is shorter than \(\textsf{a}^s v_N\). To get around this issue it would suffice to find \(\zeta > 0\) such that
holds for all \(s,\theta ,t,\phi \). One can prove such an estimate using the effective count [6] for the number of saddle connections of length at most R as \(R \rightarrow \infty \) but our goal is to avoid the use of spectral gap results. As a replacement we will find constants \(\zeta > 0\) and \(\lambda > 0\) such that
holds for all \(0 \le \phi < 2\pi \). We will do so in Sect. 3 using Theorem 1.2.
Although \(\Xi (\textsf{r}^\theta \textsf{a}^t \textsf{r}^\phi \omega _0; N)\) and \(\textsf{r}^\theta \Xi (\textsf{a}^t \textsf{r}^\phi \omega _0; N)\) may also disagree as sets of saddle connections (because we have decided to order saddle connections of the same length by increasing angle) in this case the summations over the two sets agree because the summands only depend on the lengths of the saddle connections. It is therefore no problem, upon moving \(\textsf{a}^s\) inside in (2.9), to move the action \(\textsf{r}^\theta \) inside as well.
The purpose of the annular estimate is to reduce the verification of (2.9) to the production of some \(\eta > 0\) such that
for every \(0 \le \phi < 2 \pi \).
Step 2: Controlling pairs. To produce \(\eta > 0\) such that (2.10) holds, we apply a linearization to arrive at the quantity
which we need to control for every \(0 \le \phi < 2 \pi \). From the proof of [1, Lemma 12] it suffice to bound
from below by a power of N. Here \(\theta _{v,w}\) is the angle between the holonomy vectors of the saddle connections v and w. This issue will be dealt with in Sect. 4.
3 Annular estimate
In this section we will establish the following theorem.
Theorem 3.1
There are \(\lambda > 0\) and \(\zeta > 0\) and \(N_1 > 0\) such that
holds for all \(N \ge N_1\) and all \(0 \le \phi < 2\pi \).
The proof of Theorem 3.1 will take up the remainder of this section. Recall that \(\delta > 0\) defines \(S = N^{-\delta }\). Below, all requirements that N be large enough depend only on \(\omega _0\) and not on \(\omega \). Throughout this section fix \(0 \le \phi < 2 \pi \) and write \(\omega = \textsf{r}^\phi \omega _0\).
We begin with two lemmas that will be used to relate
with counts for saddle connections in certain annuli.
Lemma 3.2
For every \(\textsf{g}\in \textsf{SL}(2,\mathbb {R})\) one has
for every \(s > 0\) and every \(N \in \mathbb {N}\).
Proof
If a saddle connection v of \(\textsf{g}\omega \) has a length of more than \(e^{2s} \ell (\textsf{g}\omega ;N)\) then \(\textsf{a}^s v\) has a length of more than \(e^s \ell (\textsf{g}\omega ;N)\). The saddle connection \(\textsf{a}^s v\) therefore cannot be amongst the first N saddle connections of \(\textsf{a}^s \textsf{g}\omega \) since \(\textsf{a}^s \Xi (\textsf{g}\omega ;N)\) has cardinality exactly N and all of its members are saddle connections of \(\textsf{a}^s \textsf{g}\omega \) of length at most \(e^s \ell (\textsf{g}\omega ;N)\). \(\square \)
Lemma 3.3
For every \(\textsf{g}\in \textsf{SL}(2,\mathbb {R})\) one has
for every \(s > 0\) and every \(N \in \mathbb {N}\).
Proof
Every saddle connection in \(\textsf{a}^s \Lambda (\textsf{g}\omega ; e^{-2s} \ell (\textsf{g}\omega ;N))\) is a saddle connection of \(\textsf{a}^s \textsf{g}\omega \) with length at most \(e^{-s} \ell (\textsf{g}\omega ;N)\). Moreover, no saddle connection of \(\textsf{g}\omega \) with length greater than \(\ell (\textsf{g}\omega ;N)\) will, under the image of \(\textsf{a}^s\), be shorter than any saddle connection of \(\textsf{a}^s \Lambda (\textsf{g}\omega ;e^{-2s} \ell (\textsf{g}\omega ;N))\). So all saddle connections in \(\textsf{a}^s \Lambda (\textsf{g}\omega ;e^{-2s} \ell (\textsf{g}\omega ;N))\) are amongst the first N saddle connections of \(\textsf{a}^s \textsf{g}\omega \). \(\square \)
If the set
is empty for some \(N \in \mathbb {N}\) then there is nothing to prove for that N. Suppose that t belongs to (3.4) for some \(N \in \mathbb {N}\). We get \(0 \le s \le S\) and \(0 \le \theta < 2\pi \) depending on t such that
holds. Given (3.5) we estimate
from Lemmas 3.2 and 3.3, where we have used \(s \le S\) in deducing the last inequality. Thus, whenever t belongs to (3.4) for some \(N \in \mathbb {N}\), we have
because \(\Lambda (\textsf{r}^\theta \textsf{a}^t \omega ) = \textsf{r}^\theta \Lambda (\textsf{a}^t \omega )\) and \(\textsf{r}^\theta \) does not change the length of the Nth saddle connection. We are led to consider the quantity
defined for all \(0 \le t \le 1\) and all \(v \in \Lambda (\omega )\) and all \(N \in \mathbb {N}\). By its definition we therefore have
whenever t belongs to (3.4). Thus
which, together with Markov’s inequality, gives
so our focus now is to bound
for N large. We begin with the following lemmas, which will allow us to restrict the sums in (3.8) to thin annuli.
Lemma 3.9
There are constants \(c_1,c_2 > 0\) such that for all \(0 \le t \le 1\) we have
for all \(N \ge 2\).
Proof
First, note that
and \(\textsf{B}(0,\frac{1}{e}R) \subset \textsf{a}^{-t} \textsf{B}(0,R) \subset \textsf{B}(0,eR)\) give from (2.1) the bounds \((c_1 R)^2 \le |\Lambda (\textsf{a}^t \omega ;R)| \le (c_2 R)^2\) for all \(0 \le t \le 1\) and all \(R > 0\). Taking \(R = N^{0.5}/c_1\) gives \(N \le |\Lambda (\textsf{a}^t \omega ; N^{0.5}/c_1)|\) whence \(\ell (\textsf{a}^t \omega ;N) \le N^{0.5}/c_1\). Taking \(R = N^{0.5}/c_2 \log N\) gives \(N^{0.5}/ c_2\log N \le \ell (\textsf{a}^t \omega ;N)\). \(\square \)
Lemma 3.10
If \(N^\delta \ge 2\) and \(v \in \Lambda (\omega )\) is outside the annulus
then \(E_N(v;t) = 0\) for all \(0 \le t \le 1\).
Proof
Fix \(N \in \mathbb {N}\) with \(N^\delta \ge 2\) and suppose \(E_N(v;t) = 1\) for some \(0 \le t \le 1\). By Lemma 3.9 we have
whence
because \(e^{2S} \le 2\). Therefore
as \(\textsf{a}^t\) can lengthen vectors by a facor of at most e and shorten them by a facor of at most 1/e. \(\square \)
Thus, for \(N^\delta \ge 2\), only saddle connections of \(\omega \) with holonomy inside (3.11) contribute to the summations in (3.8). We continue by partitioning the annulus (3.11) into sectors as follows. First define
and
where \(\psi = 2N^{-\gamma }\) for some \(\gamma > 0\) yet to be determined. (In fac \(\gamma = \frac{1}{300}\) will suffice.) Put
for some \(\alpha > 0\) yet to be determined. (In fac \(\alpha = \frac{1}{100}\) will suffice.) Decompose
into \(4\kappa \) subsets \(W(1),\ldots ,W(4\kappa )\) each obtained by intersecting W with annular arcs \({\overline{W}}(1),\ldots ,{\overline{W}}(4\kappa )\) of size \((\frac{\pi }{2} - 2\psi )/\kappa \). Given \(1 \le k \le 4\kappa \) let \({\overline{V}}(k)\) be the union of \({\overline{W}}(k)\), its reflections in the other quadrants, and any \({\overline{W}}(i)\) that are adjacent to any of these reflections. (See Fig. 1 for a schematic.) Lastly, put \(V(k) = {\overline{V}}(k) \cap \Lambda (\omega )\).
By Lemma 3.10 the right-hand side of (3.8) is bounded by the sum of the following expressions.
-
\(\sum _{k=1}^{4\kappa } \sum _{v \in W(k)} \sum _{w \in V(k)} \int _0^1 E_N(v;t) E_N(w;t) \,\textrm{d}t\)
-
\(\sum _{v \in Z} \sum _{w \in \Lambda (\omega )} \int _0^1 E_N(v;t) E_N(w;t) \,\textrm{d}t + \sum _{v \in \Lambda (\omega )} \sum _{w \in Z} \int _0^1 E_N(v;t) E_N(w;t) \,\textrm{d}t\)
-
\( \sum _{k=1}^{4\kappa } \sum _{v \in W(k)} \sum _{\begin{array}{c} w \in W\\ w \notin V(k) \end{array}} \int _0^1 E_N(v;t) E_N(w;t) \,\textrm{d}t \)
and our goal now is to obtain power bounds for each of them. This is carried out in the next two subsections: the first two expressions will be bounded via sectorial counts and the third via a separation argument. Both make use of Theorem 1.2.
3.1 Sectorial count
Our goal here is to bound the sums
-
\(\sum _{k=1}^{4\kappa } \sum _{v \in W(k)} \sum _{w \in V(k)} \int _0^1 E_N(v;t) E_N(w;t) \,\textrm{d}t\)
-
\(\sum _{v \in Z} \sum _{w \in \Lambda (\omega )} \int _0^1 E_N(v;t) E_N(w;t) \,\textrm{d}t \)
by powers of N.
Let \(C(\omega ,\epsilon )\) be as in Theorem 1.2. The parameter \(\epsilon > 0\) will be determined later. (In fac \(\epsilon = \frac{1}{100}\) suffices.) Fix \(1 \le k \le 4 \kappa \). With I the appropriate sector of length \(3(\frac{\pi }{2} - 2 \psi )/\kappa \) we have
whenever
holds.
A priori, the occurrence of \(\omega \) in (3.13) means all subsequent statements requiring N to be large enough will depend on \(\omega \). However, since \(\epsilon > 0\) will be fixed and \(\omega \mapsto C(\omega ,\epsilon )\) is then continuous, the relation \(\omega = \textsf{r}^\psi \omega _0\) implies that the apparent dependence on \(\omega \) is in fac only a dependence on \(\omega _0\).
Applying Lemma 3.9 and \(\frac{1}{2} x \le \lfloor {x} \rfloor \le x\) on \([1,\infty )\) to (3.12), we bound \(\kappa \) by
whenever \(N^\gamma \ge 16/\pi \). Thus there is an absolute constant \(c_6 > 0\) such that
whenever
holds, which will be the case for N large enough provided
is in place. We can therefore say, using Lemma 3.10 and (2.1) to bound the first two sums, and bounding the integral by 1, that
holds whenever N is large enough.
For the second sum we again apply Theorem 1.2, this time with \(\epsilon ' > 0\) to be determined (\(\epsilon ' = \frac{1}{100}\) suffices) and I an appropriate arc of size \(2\psi \) giving a constant \(C(\omega ,\epsilon ')\) such that
whenever
holds. Thus
holds provided
is the case. Using Lemma 3.10 and (2.1) to bound the second sum, we can say that
holds for N large enough.
3.2 Separation
In this subsection we control the sum
by a power of N.
Fix \(1 \le k \le 4\kappa \) and fix saddle connections v, w of \(\omega \) with \(v \in W(k)\) and \(w \in W {\setminus } V(k)\). Since \(E_N(u;t)\) is unchanged when u is reflected in either the horizontal or the vertical axis, we may assume that v and w are in the first quadrant. Write \(\theta _u = \arg (u)\). We assume that \(\theta _v > \theta _w\) as the alternative involves identical arguments. The following properties are immediate consequences of that assumption, \(v \in W(k)\) and \(w \in W {\setminus } V(k)\).
- S1:
-
\(\dfrac{1}{2ec_2} \dfrac{N^{0.5}}{\log N} \le |\!|v |\!|, |\!|w |\!|\le \dfrac{2e}{c_1} N^{0.5}\)
- S2:
-
\(\dfrac{2}{N^\gamma } \le \theta _w < \theta _v \le \dfrac{\pi }{2} - \dfrac{2}{N^\gamma }\)
- S3:
-
\(\theta _v - \theta _w > \dfrac{1}{\ell (\omega ;N)^\alpha }\)
Indeed S1 follows from Lemma 3.10, S2 follows from the definitions of \(\psi \) and W, and S3 follows from (3.12) and N being large enough.
With these properties to hand, our goal in this subsection is bounding the Lebesgue measure of the set
by a negative power of N.
Lemma 3.17
For all \(t > 0\) the angle between \(\textsf{a}^t v\) and \(\textsf{a}^t w\) is at least \(\frac{1}{e^{2t}} (\theta _v - \theta _w)\).
Proof
The Cauchy mean value theorem gives
as desired. \(\square \)
We frequently use the estimates
which hold for all \(s \ge 0\) and all u in the first quadrant.
If \(E_N(v;t) E_N(w;t) = 0\) for all \(0 \le t \le 1\) there is no need for a bound as (3.16) will have zero measure. We therefore assume also that there is a time \(0 \le r \le 1\) at which \(E_N(v;r) E_N(w;r) = 1\). The definition of \(E_N\) and Lemma 3.9 give
as \(\sinh (S) \sim S\) as \(N \rightarrow \infty \). Also S3 and Lemmas 3.9, 3.17 give
and our first goal is to deduce from these that there is horizontal and vertical separation of \(\textsf{a}^r v\) from \(\textsf{a}^r w\). Write \(\chi \) for the angular separation \(\theta _{\textsf{a}^r v} - \theta _{\textsf{a}^r w}\) and \(Q = | |\!|\textsf{a}^r v |\!|- |\!|\textsf{a}^r w |\!||\) for the difference in length.
Lemma 3.20
There are constants \(K > 0\) and \(\xi > 0\) such that \((\textsf{a}^r w)_1 - (\textsf{a}^r v)_1 \ge K N^{0.5 - \xi }\) and \((\textsf{a}^r v)_2 - (\textsf{a}^r w)_2 \ge K N^{0.5 - \xi }\) for all N large enough.
Proof
The coordinate \((\textsf{a}^r w)_1\) cannot (cf. Fig. 2) be smaller than \((|\!|\textsf{a}^r v |\!|- Q) \cos (\theta _{\textsf{a}^r v} - \chi )\) so from
we have by (3.18), (3.19) and Lemma 3.10 that
because
for N large. The above is contingent on the inequalities
but provided they are satisfied we conclude there is a constant \(K_1 > 0\) such that
for all N large enough.
Similarly, the largest \((\textsf{a}^r w)_2\) can be is \((|\!|\textsf{a}^r v |\!|+ Q) \sin (\theta _{\textsf{a}^r v} - \chi )\) so from
we have
as above. Provided
we conclude that there is a constant \(K_2 > 0\) such that
for all N large enough.
To conclude take \(K = \min \{ K_1, K_2 \}\) and \(\xi = \gamma + 2 \alpha \) and \(N_2 \ge \max \{ M_1, M_2 \}\) large enough. \(\square \)
Define \(f_{v,w}(t) = |\!|\textsf{a}^t v |\!|- |\!|\textsf{a}^t w |\!|\) for \(t \in \mathbb {R}\). Certainly \(f_{v,w}\) is continuous. Controlling the size of the set of those \(0 \le t \le 1\) where \(|f_{v,w}(t)|\) is small will be enough to bound the Lebesgue measure of (3.16). From Lemma 3.20 and Facts B.4, B.5 in “Appendix B” we conclude that \(f_{v,w}\) is decreasing and has a unique zero. Since \(f_{v,w}\) is continuous and decreasing, (3.18) furnishes \(0 \le r_0 \le 1\) minimal with \(|f_{v,w}(r_0)| \le \frac{8}{c_1} N^{0.5 - \delta }\).
Lemma 3.21
We have
for some \(\varpi > 0\) to be determined. (In fac, one can take \(\varpi = \frac{1}{100}\).)
Proof
Suppose that the contrary holds. Then
for all \(0 \le t \le N^{-\varpi }\). We also have
for some \(\theta _{\textsf{a}^{r_0 + t} w}< \xi < \theta _{\textsf{a}^{r_0 + t} v}\). For N large enough \(r_0 + t\) is at most 2. Therefore both angles are at least \(\frac{2}{e^4} N^{-\gamma }\) and at most \(\frac{\pi }{2} - \frac{2}{e^4} N^{-\gamma }\). This implies
after an application of Lemma 3.17, S3, Lemma 3.9, and the fac that \(r_0 +t \le 2\) for N large enough.
In combination, for all \(0 \le t \le N^{-\varpi }\) we get
and by S1 together with dilation control
so that (B.2) gives
for all \(0 \le t \le N^{-\varpi }\) provided
holds. But then the mean value theorem implies
which, if one has
implies \(|f_{v,w}(r_0 + N^{-\varpi })| > \frac{8}{c_1} N^{0.5 - \delta }\) for N large enough, giving the desired contradiction. \(\square \)
Since \(f_{v,w}\) is strictly decreasing the containment
allows us to conclude that
by trivially bounding the sums using (2.1).
3.3 Proof of Theorem 3.1
If—as they may be—the parameters \(\alpha , \gamma , \delta , \epsilon , \epsilon ', \zeta , \varpi \) are chosen such that all of the requirements (R) above are satisfied then there is \(N_1\) so large that (3.7), (3.14), (3.15), (3.22) together give
and all \(0 \le \phi < 2 \pi \). for all \(N \ge N_1\). If
is satisfied then we can find \(\lambda > 0\) satisfying the hypothesis.
4 Controlling pairs
In this section we wish to establish (2.10) for all \(0 \le \phi < 2 \pi \). Throughout this section, fix \(0 \le \phi < 2\pi \) and write \(\omega = \textsf{r}^\phi \omega _0\). For the quantity
we wish to produce \(\eta > 0\) such that
for all N large enough.
Writing
for any non-zero \(u \in \mathbb {R}^2\), we begin by applying the following linearization.
Lemma 4.3
Whenever \(|\!|u |\!|\le N^{0.5}\) we have
for all \(0 \le s \le S\).
Proof
Using (B.1) the bound
gives the desired result via the Lagrange form of the remainder in Taylor’s theorem. \(\square \)
The requirement
is needed for Lemma 4.3 to be useful. When \(\delta > 0.25\) it suffices for (4.2) to produce \(\eta > 0\) such that the quantity
satisfies
for all N large enough.
The reduction to (4.5) follows from Lipshitz continuity of \(\chi _p\). Indeed, that gives
for all N large enough, whence
for all N large enough.
We now work towards (4.5). Fixing \(0 \le t \le 1\) and fixing a parameter \(\nu > 0\) to be chosen later (\(\nu = \frac{1}{100}\) suffices) we may restrict the summation to those saddle connections v, w for which \(|\!|\textsf{h}(v) |\!|,|\!|\textsf{h}(w) |\!|\ge N^{0.5 - \nu }\) both hold.
We may also discard those w for which the angle between v and w is at most \(N^{-\frac{\alpha }{2}}\) by an application of Theorem 1.2 similar to the one in Sect. 5; if \(C''(\omega ,\epsilon '')\) is the attendant constant (\(\epsilon '' = \frac{1}{100}\) suffices) then the requirement
will allow us to discard as desired.
Fixing v, w satisfying both of these criterion, the quantity
in absolute value is equal to
because rotations do not change the lengths of holonomy vectors.
Define \(A(v,w) \ge 0\) by \(A(v,w)^2 = (\alpha (\textsf{h}(v)) - |\!|\textsf{h}(w) |\!|)^2 + \beta (\textsf{h}(v))^2\). To proceed we quote the following estimate from [1].
Lemma 4.7
We have
for all N large enough.
Proof
The estimate follows by duplicating (with \(R = N^{0.5}\) and \(\epsilon = 1\)) the proof of [1, Lemma 12] up to [1, Equation (24)] and the estimates immediately after [1, Equation (24)]. That much of the proof does not use the hypothesis. \(\square \)
Our assumptions on \(\Vert \textsf{h}(v) \Vert \), \(\Vert \textsf{h}(w) \Vert \) and the angle between v and w give
so that overall
for our vectors v, w. This is satisfacory provided
holds, as we may then take \(\eta = \delta + \nu + \frac{\alpha }{2} - 0.5\) to establish (4.5).
5 Proof of main theorem
In Sect. 2 we reduced (via Theorem 2.8) the proof of Theorem 1.1 to the statement that
for some \(\eta > 0\). We finish here the proof of Theorem 1.1 by establishing (5.1).
Lemma 5.2
In order to prove (5.1) it suffices to prove
for some \(\eta > 0\).
Proof
Let \(\Omega \) be the set (3.4). The conclusion of Theorem 3.1 is that \(\textsf{m}(\Omega ) \ll N^{-\lambda }\). When t does not belong to \(\Omega \) we have
for all \( 0 \le s \le S\) and all \(0 \le \theta < 2\pi \). It follows that \(N^{-\zeta } + N^{-\lambda }\) controls the difference between (5.1) and (5.3). \(\square \)
To apply the material of Sect. 3—which establishes Theorem 3.1—and the material of Sect. 4—which establishes (5.3)—we need to ensure that the requirements (R) above can be satisfied simultaneously. The choices
show that this is possible, concluding the proof of Theorem 1.1.
References
Chaika, J., Robertson, D.: Uniform distribution of saddle connection lengths. J. Mod. Dyn. 15 (2019). With an appendix by Daniel El-Baz and Bingrong Huang, pp. 329–343. ISSN: 1930-t5311
Dozier, B.: Equidistribution of saddle connections on translation surfaces. J. Mod. Dyn 14, 87–120 (2019)
Knapp, A.W.: Representation theory of semisimple groups: an overview based on examples. In: Princeton Landmarks in Mathematics. Reprint of the 1986 original. Princeton University Press, Princeton, NJ, pp. xx+773. ISBN: 0-691-09089-0 (2001)
Masur, H.: Lower bounds for the number of saddle connections and closed trajectories of a quadratic differential. In: Holomorphic Functions and Moduli, vol. I (Berkeley, CA, 1986). vol. 10. Mathematical Sciences Research Institute Publication, pp. 215–228. Springer, New York (1988)
Masur, H.: The growth rate of trajectories of a quadratic differential. Ergod. Theory Dyn. Syst. 10(1), 151–176 (1990)
Nevo, A., Rühr, R., Weiss, B.: Effective counting on translation surfaces. Adv. Math. 360, 106890 (2020)
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.
Appendices
Appendix A: Proof of Theorem 1.2 on counting in sectors by Benjamin Dozier
Theorem 1.2 is a more explicit version of [2, Theorem 1.8]. Getting the explicit version is a matter of keeping careful track of the constants in various proofs in that paper. The first step is to give explicit constants in [2, Proposition 2.1, p. 94].
Proposition A.1
Fix \({\mathcal {H}}\) and \(0< \delta < 1/2\). Define \(\alpha : {\mathcal {H}} \rightarrow \mathbb {R}\) by \(\alpha (\omega ) = 1/\ell (\omega )^{1+\delta }\). There is a constant b such that for any interval \(I \subset \textsf{S}^1\) there is a constant \(c_I = O\left( \frac{1}{|I|^{1-2\delta }}\right) \) such that for any \(\omega \in {\mathcal {H}}\)
for all \(T \ge 0\).
The proof of Proposition A.1 is at the end of the appendix. We first prove Theorem 1.2 assuming Proposition A.1.
Proof of Theorem 1.2 assuming Proposition A.1
From Proposition A.1, we get that \(c_{I'}=c_I = O \left( \frac{1}{|I|^{1-2\delta }}\right) \), where the implied constant depends on only on genus of the surface. We will also use \(\alpha (X) = 1/\ell (X)^{1+\delta }\). For our lower bound on R, we can then take
Since we can choose \(\delta \) as small as we wish (in particular, we can take \(\delta = \epsilon /(2+2\epsilon )\)), we get for every \(\epsilon >0\),
where
We claim that we can take \(C(X,\epsilon )\) to depend continuously on X. It suffices to show that \(\ell (X)\), the length of the shortest saddle connection, depends continuously on X. We claim that \(\ell \) equals the “flat systole function” f, which is defined as the length of the shortest curve or arc (starting/ending at zeros) that is not homotopic to a point (relative to zeros, in the case of an arc). Clearly \(f\le \ell \), since any saddle connection is such an arc. To see that \(\ell \le f\), note that any such curve/arc can be tightened to either (i) a union of saddle connections, or (ii) a closed geodesic, parallel copies of which form a cylinder. In case (i), picking any one of the saddle connections in the union gives a saddle connection that has length at most that of the original curve/arc. In case (ii), there is a saddle connection on the boundary of the cylinder that has length at most that of the original curve/arc. Finally, the flat systole function clearly varies continuously, hence so does \(\ell \). \(\square \)
Proof of Proposition A.1
The result follows from the following modifications to [2].
-
Explicit constants in [2, Proposition 5.5, p.111]: We can take \(c_I = c_I^{(k)} = O_k\left( \frac{1}{|I|^{1-2\delta }}\right) \).
-
Addendum to [2, Proof of Proposition 2.1 assuming Proposition 5.5, p. 111]: Note that by the definition of \(\alpha _i\), we have \(\alpha _1(X) \ge \alpha _i(X)\), for each i and every X (this is because \(\alpha _i(X)\) is defined in terms of the saddle connections on the boundary of a complex of complexity i; any such saddle connection forms a complex of complexity 1, and thus is included in the definition of \(\alpha _1\).) Thus we can replace the sum \(\sum _{j\ge k}\alpha _j(X)\) that we get from [2, Proposition 5.5] with \(M \cdot \alpha _1(X) = M/\ell (X)^{1+\delta }\), where M is the complexity of X (and then we can absorb the constant M into the constant \(c_I)\).
-
Explicit constants in [2, Lemma 5.8, p. 114]: We can take \(t_0 \approx \tau + \log \frac{1}{|I|}\).
-
Addendum to [2, Proof of Proposition 5.5, pp. 116–118]:
-
We can take \(m \approx t_0(\tau ,|I|)/\tau \approx \frac{1}{\tau } \log \frac{1}{|I|}\).
-
We can take \(w_{\tau ,I}^{(k)} = c_{I}^{(k+1)}c_2w_{\tau }\).
-
We can take \(c_{\tau ,m} =\left( e^{-\tau (1-2\delta )}\right) ^{-m+1} + w_{\tau ,I} \cdot e^{\tau (1-2\delta )}.\) From above, we have \(w_{\tau ,I}^{(k)} = c_{I}^{(k+1)}c_2w_{\tau }\). For the maximal possible k, there are no terms from higher complexity, i.e. all the higher \(\alpha _i\) are 0, so, for this k, we get
$$\begin{aligned} c_{\tau ,I}^{(k)} = O_{k}\left( \left( e^{-\tau (1-2\delta )}\right) ^{-m+1} \right) =O_k \left( e^{\tau (1-2\delta )\frac{1}{\tau }\log \frac{1}{|I|}} \right) = O_k \left( \frac{1}{|I|^{1-2\delta }} \right) . \end{aligned}$$Then inducting down by complexity, we get the same result for all k (with different implied constant in the \(O_k\)).
-
\(\square \)
Appendix B: Length function
In this appendix we collect various simple results about the function \(f_v(t) = |\!|\textsf{a}^t v |\!|\) defined on \(\mathbb {R}\) for any vector \(v \in \mathbb {R}^2\) with positive entries, and its relative \(f_{v,w} = f_v - f_w\). We have
and define
for convenience. First note that
from which
follows.
Writing \(V = \textsf{a}^t v\) and \(\theta _V\) for its argument we can write
and
for all \(t \in \mathbb {R}\) from \(2 V_1 V_2 = |\!|V |\!|^2 \sin 2 \theta _V\). These calculations show \(f_v\) is concave everywhere with a global minimum at
where \(\theta _V = \frac{\pi }{4}\).
We now turn to \(f_{v,w}\) assuming \(v \ne w\). We assume without loss of generality that v and w are in the first quadrant. If \(f_{v,w}\) has a zero it must be at
giving the following fac.
Fact B.4
-
If \(w_1 > v_1\) and \(v_2 > w_2\) the function \(f_{v,w}\) has a unique zero.
-
If \(v_1 > w_1\) and \(w_2 > v_2\) the function \(f_{v,w}\) has a unique zero.
-
In no other case does \(f_{v,w}\) have a zero.
Fact B.5
If \(f_{v,w}\) has a zero it is either strictly increasing or strictly decreasing. In other words, if \(f_{v,w}\) has a zero then \(f_{v,w}'\) does not.
Proof
Switching the roles of v and w if necessary, we many assume \(w_1 > v_1\) and \(v_2 > w_2\). We then have
and on the interval (m(w), m(v)] the function \(f_w\) is strictly increasing while on [m(w), m(v)) the function \(f_v\) is strictly decreasing. Thus \(f_{v,w}\) is strictly decreasing on [m(w), m(v)].
Next, note that since \(v_2 > w_2\) we have \(f_{v,w}(t) > 0\) for \(t < r(v,w)\) and \(f_{v,w}(t) < 0\) for \(t > r(v,w)\).
Consider the case that \(m(w) \le r(v,w)\). Thus we have \(|\!|W |\!|\le |\!|V |\!|\) and \(\theta _V > \theta _W \ge \frac{\pi }{4}\) for all \(t \le m(w)\). Accordingly
and \(f_{v,w}'\) is negative on \((-\infty ,m(w)]\) whence \(f_{v,w}\) is strictly decreasing on \((-\infty , m(v)]\).
In the case that \(r(v,w) < m(w)\) then the above argument shows only that \(f_{v,w}'\) is negative on \((-\infty ,r(v,w)]\). On the interval (r(v, w), m(w)) we have \(|\!|W |\!|> |\!|V |\!|\) and \(\theta _V> \theta _W > \frac{\pi }{4}\) giving \(f_v'' < f_w''\) thereon. Thus we may extend negativity of \(f_{v,w}'\) to \((-\infty ,m(w)]\) and \(f_{v,w}\) is again strictly decreasing on all of \((-\infty ,m(v)]\).
The cases \(r(v,w) \le m(v)\) and \(m(v) < r(v,w)\) are similar to the above, and altogether \(f_{v,w}\) is strictly decreasing on all of \(\mathbb {R}\). \(\square \)
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
Robertson, D., Dozier, B. Uniform distribution of saddle connection lengths in all \(\textsf{SL}(2,\pmb {\mathbb {R}})\) orbits. Geom Dedicata 217, 65 (2023). https://doi.org/10.1007/s10711-023-00800-3
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10711-023-00800-3