Explicit spectral gaps for random covers of Riemann surfaces
Michael Magee, Fr\'ed\'eric Naud

TL;DR
This paper establishes probabilistic bounds on the absence of new resonances and eigenvalues in random covers of hyperbolic surfaces, providing explicit spectral gap estimates with high probability as the cover degree grows.
Contribution
It introduces a permutation model for random covers of hyperbolic surfaces and proves new spectral gap results for resonances and eigenvalues in these covers.
Findings
No new resonances in a specified strip with high probability
Explicit spectral gap for new eigenvalues when Hausdorff dimension exceeds 1/2
High probability absence of new resonances near the critical line
Abstract
We introduce a permutation model for random degree covers of a non-elementary convex-cocompact hyperbolic surface . Let be the Hausdorff dimension of the limit set of . We say that a resonance of is new if it is not a resonance of , and similarly define new eigenvalues of the Laplacian. We prove that for any and , with probability tending to as , there are no new resonances of with and . This implies in the case of that there is an explicit interval where there are no new eigenvalues of the Laplacian on . By combining these results with a deterministic `high frequency' resonance-free strip result, we obtain the corollary that there is an such that with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Explicit spectral gaps for random covers of Riemann surfaces
Michael Magee and Frédéric Naud
Abstract.
We introduce a permutation model for random degree covers of a non-elementary convex-cocompact hyperbolic surface . Let be the Hausdorff dimension of the limit set of . We say that a resonance of is *new *if it is not a resonance of , and similarly define new eigenvalues of the Laplacian.
We prove that for any and , with probability tending to as , there are no new resonances of with and . This implies in the case of that there is an explicit interval where there are no new eigenvalues of the Laplacian on . By combining these results with a deterministic ‘high frequency’ resonance-free strip result, we obtain the corollary that there is an such that with probability as , there are no new resonances of in the region .
Contents
-
5 The expectation of the Hilbert-Schmidt norm of the transfer operator
-
5.3 Majorization of the expectation of the Hilbert-Schmidt norm
1. Introduction
This paper is about spectral gaps for random Riemann surfaces. More specifically, we are interested in various notions of spectral gap for random covers of a fixed Schottky Riemann surface. This is in close analogy to questions about the spectral gap of a random regular graph, and this analogy informs our model for random coverings, so we begin with a discussion on graphs.
Let be a -regular graph on vertices. Then the adjacency matrix of has real eigenvalues in and appears as an eigenvalue with multiplicity equal to the number of connected components of . Denoting by
[TABLE]
the eigenvalues of , the spectral gap of is . If is connected, then and the spectral gap is related to the exponential rate at which the random walk on converges to the uniform measure. As such, it is an important quantity in theoretical computer science, and accordingly, there has been a great deal of interest in the spectral gap of a random regular graph. Alon’s conjecture [Alo86], now a theorem due to Friedman [Fri08], says that for any , as , the probability that tends to zero, when is sampled uniformly at random from -regular graphs with vertices. The relevance of the quantity is that for any -regular graph with vertices, a result of Alon-Boppana [Nil91] says that , so is an asymptotically optimal lower bound for , often called the Ramanujan bound after [LPS88].
The model of a random graph described above chooses random graphs according to a uniform distribution. Another popular model for a random -regular graph is called the *permutation model *and is the one we wish to focus on in the sequel. Let be a free group on generators, , and let denote the symmetric group on letters, and be a random homomorphism from to , sampled uniformly from all possible homomorphisms. Since is free, a homomorphism is described simply by choosing the images of the generators of independently and uniformly from . Then let be the random graph with vertex set and with an edge between and if there is a generator such that . We will adapt this model to a model of a random Riemann surface.
Let be a connected, non-elementary, non-compact, convex co-compact hyperbolic surface. Then where is the hyperbolic upper half plane and is a free subgroup of . We view as fixed throughout the paper. We let be the random -cover of obtained as a fibered product . More precisely, is the quotient of by the diagonal action of
[TABLE]
If is a set of representatives for the orbits of on via , and is the stabilizer of , then is isomorphic to the disjoint union of (connected) covers , i.e.
[TABLE]
Notice that we have
[TABLE]
We say that a property of the random holds asymptotically almost surely (a.a.s.) if as , the probability that holds tends to . It is an elementary calculation111For a concrete reference, this statement follows from [BS87, Thm.13]. One can also prove by elementary combinatorial arguments that the probability that is connected as is bigger than , where is a constant depending only on . that a.a.s. acts transitively on via and hence, a.a.s. is connected. This also follows from the main theorems below. Although we do not assume is connected at any point, it would not hurt to assume this on a first reading.
We now discuss the spectral theory of and . The group acts properly discontinuously on but for any point , the orbit accumulates on and the accumulation set of this orbit is called the *limit set of *and denoted by . This is a perfect nowhere dense fractal and has an associated Hausdorff dimension . By a result of Lax and Phillips [LP81], the spectrum of the Laplacian is discrete in the range , and Patterson [Pat76] proved that if , then the lowest eigenvalue of is . If then there are no eigenvalues of . The same is true for , with the same (although will be simple if and only if is connected). More generally, if is any eigenvalue of , then by lifting eigenfunctions through the covering map, is an eigenvalue for with at least as large multiplicity.
The first main theorem of our paper is the following.
Theorem 1.1**.**
Assume that . Then for any , a.a.s.
[TABLE]
and the multiplicities on both sides are the same.
Remark 1.2*.*
This theorem implies that a.a.s. the have a uniform spectral gap, and this spectral gap only depends on and the gap between the first two eigenvalues of .
Remark 1.3*.*
If then since has no eigenvalues in by a result of Lax and Phillips [LP81], Theorem 1.1 implies that a.a.s. has no new eigenvalues.
Remark 1.4*.*
Theorem 1.1 can be viewed as a significant sharpening of a result of Brooks and Makover [BM04], albeit in the infinite area setting. See 1.1 for a more detailed discussion of this comparison.
Remark 1.5*.*
We point out that it is possible for to not be connected, and in this case, there is no spectral gap. Even further, it is easy to see that can be a connected cyclic cover of , and by results of [JNS19], these have no uniform spectral gap.
Remark 1.6*.*
In the limit as , the range of forbidden eigenvalues in (1.1) becomes . This is interestingly the same range covered by Selberg’s Theorem [Sel65] on the spectral gap of congruence covers of the modular surface This should also be compared to the deterministic result of Gamburd [Gam02] for congruence covers of infinite index geometrically finite subgroups of : assuming , he shows that the spectrum remains the same in the range . See also [Mag15] for a generalization of this result to higher dimensions.
We write for the Euler characteristic of . It has recently been proved by Ballmann, Matthiesen, and Mondal [BMM17] that if , has at most eigenvalues. If then this means the only possible eigenvalue of is at and thus Theorem 1.1 yields
Corollary 1.7**.**
Assume that . If is topologically a pair of pants, or a torus with one hole, then for any , a.a.s.
[TABLE]
and is a simple eigenvalue of .
We now turn to what we can say about general . In the case , and will have no discrete spectrum, so one must consider a more subtle notion of spectral gap.
For any non-elementary convex co-compact hyperbolic with (e.g. , ) the resolvent
[TABLE]
is, a priori, a meromorphic family of bounded operators in the right half plane with poles precisely at real such that is an eigenvalue of By work of Mazzeo-Melrose [MM87], it can be meromorphically continued to a family of bounded operators from that is meromorphic in . In the case of hyperbolic surfaces, a simpler proof of the meromorphic continuation is due to Guillopé and Zworski [GZ95], see also the book [Bor16].
The poles of the meromorphically continued resolvent are called resonances of **. In the sequel we write for the multi-set of resonances, repeated according to multiplicities222Following [Bor16, Def. 8.2], the multiplicity of a resonance of is given by where is an anticlockwise oriented circle enclosing and no other resonance of . . Resonances, unlike -eigenvalues, correspond to a non self-adjoint spectral problem and are therefore notoriously difficult to study. There is however a clear analog of the spectral gap in this setting. The ‘bass resonance’ is located at and by a result of Naud [Nau05a] if is connected then there exists a constant such that
[TABLE]
We call the existence of such a resonance free strip a spectral gap for . The spectral gap on hyperbolic surfaces has numerous applications, from prime geodesic theorems [Nau05b] to local -asymptotics of waves [GN09]. A recent breakthrough of Bourgain-Dyatlov [BD18] showed that there always exists an “essential spectral gap” past the line , i.e. there exists such that
[TABLE]
is a finite set. The proof is based on the general phenomenon of “fractal uncertainty principle”, see [Dya19]. We point out that can be made explicit, see Jin-Zhang [JZ17] and also Dyatlov-Jin [DJ18]. For a broader view and a state of the art survey on the mathematical theory of resonances including hyperbolic manifolds and related conjectures, we recommend to read [Zwo17]. Our next main result is the following.
Theorem 1.8**.**
Fix any and , and let
[TABLE]
Then a.a.s.
[TABLE]
where the multiplicities on both sides are the same.
Remark 1.9*.*
Because all eigenvalues of with give a resonance of at , with the same multiplicity, and the same is true for , Theorem 1.8 implies Theorem 1.1 and extends it to resonances in rectangles of explicit width and any bounded height . We point out that Theorem 1.8 actually yields new information on low frequency resonances past the line when .
This leaves the question of how to deal with resonances with large imaginary part. For this we have the following theorem that applies to arbitrary covers. Note that here there is no randomness involved.
Theorem 1.10**.**
Assume that is a non-elementary convex co-compact group. Then there exist and such that for all finite index subgroups , we have for ,
[TABLE]
Remark 1.11*.*
From the work of Bourgain and Dyatlov [BD17], we know that there exists , depending only on and thus uniform on covers such that
[TABLE]
is a finite set. However the result of Bourgain and Dyatlov does not provide any information on the finite set of resonances in this uniform strip. *Theorem 1.10 *shows that new resonances can only appear in a compact region.
Combining Theorem 1.8 with Theorem 1.10 yields the following corollary.
Corollary 1.12**.**
A.a.s. the random cover has a uniform spectral gap. In particular, above each non elementary surface , one can produce an infinite family of covers with degree and having a uniform spectral gap.
Remark 1.13*.*
When , Corollary 1.12 follows from a mild extension of [BGS11, Thm. 1.2] together with results on random graphs as explained in 1.1. However, when , to our knowledge, Corollary 1.12 is completely new: the only result of that type so far is for congruence covers of convex co-compact subgroups of , see Oh-Winter [OW16] and the discussion below.
1.1. Prior work
**Brooks and Makover. **Brooks and Makover in [BM04] consider a similar model for random finite area Riemann surfaces. In this model, random surfaces are modeled by random 3-regular oriented graphs sampled according to a refinement of the Bollobás ‘bin model’ introduced in [Bol88]. Then Brooks and Makover [BM04] construct from a random oriented graph on vertices a Riemann surface , tiled by a specific hyperbolic triangle with one vertex at . They then consider a compactification of the cusped surface . Thus is a random compact Riemann surface; the genus of is however not deterministic333By a result of Gamburd [Gam06], if , then as , converges to a Poisson-Dirichlet distribution. The function coincides with the number of cusps of .. Brooks and Makover proved in (ibid.)
Theorem 1.14** (Brooks-Makover).**
There is some constant such that a.a.s. the first non-zero eigenvalue of is .
Although our main theorems deal instead with infinite area Riemann surfaces, they offer two improvements over Theorem 1.14:
- •
The range of new forbidden eigenvalues and resonances in Theorems 1.1 and 1.8 are explicit,
- •
Moreover, we have an entire moduli space of random families (parameterized by the modulus of ) and the range of forbidden eigenvalues and resonances only depends on in a very mild way, through the Hausdorff dimension of the limit set.
*The Brooks-Burger transfer principle. ***Also relevant to the current work is the following transfer principle for small eigenvalues developed independently by Brooks and Burger in [Bro86, Bur88].
Theorem 1.15** (Brooks-Burger).**
Let be any compact Riemannian manifold with . There is a constant and a finite subset such that the following hold. Let be any finite index subgroup of , with associated Riemannian covering space of . Let be such that Let be the Schreier coset graph of acting on . Then
[TABLE]
Theorem 1.15 was extended to Galois covers of non-elementary convex co-compact hyperbolic surfaces by Bourgain, Gamburd and Sarnak in [BGS11, Thm. 1.2] where the left hand side of (1.2) is replaced by the gap between and the next eigenvalue of the -Laplacian. This extends to non-Galois covers and therefore applies in the setting of this paper as follows.
Let us assume that is connected, for simplicity, although the argument can be adapted to the general case. For fixed , the Schreier coset graphs of acting on are precisely the random regular graphs of the permutation model, and a.a.s. these have a uniform spectral gap by [BS87, Fri08]. Hence by the extension of [BGS11, Thm. 1.2] the have a uniform spectral gap between and the next -eigenvalue. Importantly, in all versions of Theorem 1.15, the constant depends on in a complicated way. Because of this, it is unlikely such an argument would lead to e.g. Theorem 1.1. However, this argument does lead to Corollary 1.12 when (cf. Remark 1.13).
It is also worth mentioning that a variant of Theorem 1.15 has also been developed for resonances in [BGS11, OW16, MOW17], for specific congruence coverings of where is an infinite index subgroup of . Besides only dealing with Galois covers, the key reason that these methods cannot prove Corollary 1.12 when is the following. The state of the art method [MOW17, Appendix] of dealing with low frequency resonances (a la Theorem 1.8) involves bounds on the dimensions of non-trivial irreducible representations of finite groups that are polynomial in . The relevant groups in our setting are , and the issue is that has non-trivial irreducible representations of dimensions that are sub-logarithmic in .
Finally we point out that the methods of [BGS11, OW16, MOW17] are not well adapted to efficiently tracking constants and hence likely not suitable for producing explicit resonance free regions as in Theorem 1.8.
1.2. Overview of proofs and paper organization
All the proofs of the paper rely on a Schottky encoding of the action of on that is presented in 2.1. To control resonances (and eigenvalues) we rely on the connection between resonances and zeros of the Selberg zeta function due to Patterson and Perry [PP01]. This connection is explained in 2.2. We then pass to dynamical considerations by the relationship between Selberg zeta functions and dynamical zeta functions explained in The relevant dynamical zeta functions are Fredholm determinants of certain transfer operators on vector valued functions, twisted by (random) unitary representations of . These are introduced in 2.2. The relevance of these representations is that the zeros of the -twisted Selberg zeta function of correspond to new resonances of (see 4.1). These are precisely the objects we wish to control.
**Theorems 1.1 and 1.8. **Since Theorem 1.8 implies Theorem 1.1 it suffices to discuss the former.
So far we have not been precise about the transfer operators we use. To prove Theorem 1.8 we do not use the ‘standard’ twisted transfer operators used for example in [BGS11, OW16, MOW17], but rather, we base our twisted operators on the refined transfer operators introduced by Bourgain and Dyatlov in [BD17]. The operators are denoted by and defined precisely in 2.2. The parameter is a frequency parameter, and the parameter is a ‘discretization parameter’ that is taken to be . If we do not use this operator in the definition of the dynamical zeta function, but rather, an iterate of the standard one, without the built in parameter , then one can still follow the strategy of this paper to obtain resonance-free regions. However, these will depend on subtle features of the graph of the pressure functional defined in 2.1. It is the use of refined transfer operators that allows us to improve on this, and is a key idea in the paper. The functional spaces we use are Bergman spaces, and this gives us crucial access to trace techniques.
To control zeros of the dynamical zeta function in a rectangle, we use Jensen’s formula with a circle enclosing the rectangle (cf. Figure 6.1). The strategy is to prove that the expected number of zeros in the region decays as a polynomial in , so by Markov’s inequality, a.a.s. there are none. There are two terms in Jensen’s formula we need to control. The first is when is the center of the circle. As shown in Proposition 4.8, this term decays provided the center of the circle is a sufficiently large real number, which can be arranged. The second term in Jensen’s formula is the integral over in the circle of |. A convenient property of Jensen’s formula is that it is an integral formula, and we can take expectations inside the integral. Using Weyl’s inequality, and taking expectations, we reduce to bounding the expectation of the squared Hilbert-Schmidt norm of for on the circle. We need to prove these all decay uniformly and polynomially in . This estimate is at the core of the proof, is stated precisely in Proposition 5.1, and its proof takes up .
We now discuss the proof of Proposition 5.1. The first step is a formula for . This uses a deterministic expression for involving a Bergman kernel and given in Lemma 4.7. The formula for is a complex weighted sum of random variables , where and are elements of . By linearity of expectations we obtain an expression for as a weighted sum of expectations
[TABLE]
By passing to a majorant, in Lemma 5.4 we reduce our task to estimating a sum of the form
[TABLE]
where is a set of words in the generators of , and is with the last letter removed.
The strategy is to insert good bounds for (1.3) into (1.4) to obtain the decay we want. This is analogous to the *trace method *used to bound the spectral gap of a random graph, where would be replaced by the trace of a power of the adjacency matrix. Indeed, the bounds we use for (1.3) go back to the paper of Broder and Shamir [BS87] who used the trace method to show that the second largest eigenvalue of a -regular random graph in the permutation model is a.a.s. . So the appearance of in Theorems 1.1 and 1.8 is similar to (ibid.).
In *(ibid.) *Broder and Shamir proved, roughly speaking, that has a trivial bound if is the identity, a better bound if is a proper power of another element in , and an even better bound if does not fall in one of the previous two cases. We need a two sided estimate for (1.3) that can be deduced from more recent work of Puder [Pud15] and is stated in Theorem 5.2. According to the three cases above, we partition the range of summation in (1.4) into three different sets.
The hardest of these to deal with in (1.4) is the set that consists of such that is a proper power in . We need to show that the contribution of this set to (1.4) has polynomial decay. We give a precise bound on in Proposition 5.6; this proposition is at the core of the paper so we now explain the ideas of its proof.
Throughout the paper we work with real quantities , where is a word in the generators of . These are defined in 3. Roughly speaking, measures the size of the derivative of the associated group element , and the set is the set of words such that . This means that estimating is roughly the same as estimating the sum
[TABLE]
the choice of the exponent optimizes the result we can get from this method. The key combinatorial observation we use to estimate (1.5) is that if is a proper power, after performing an absolutely bounded finite number of the following operations
- •
cutting the sequences and ,
- •
possibly replacing some cut sequence with its ‘mirror’,
- •
and regluing
one can form a long identical pair of sequences. This idea is performed rigorously in 5.4. The result of these operations on the is to introduce a bounded multiplicative constant, since is roughly multiplicative (Lemma 3.4) and behaves well with respect to mirrors (Lemma 3.5). The result of obtaining the long identical pair of sequences is that we get bounds on (1.5) from the relationship between sums of and the pressure functional (Lemma 3.10).
**Theorem 1.10. **The proof of Theorem 1.10 is given in 7. It is based on uniform Dolgopyat estimates for arbitrary unitary representations of . We use the main result of Bourgain and Dyatlov [BD17] on Patterson-Sullivan measures and Fourier decay to provide a short and completely general proof of the uniform Dolgopyat estimates without having to rely on the more difficult technique from [Nau05a], which was also used in [OW16, MOW17].
1.3. Notation
If we write for the closure of . We write for the natural numbers and .
1.4. Acknowledgments
We thank Benoît Collins and Doron Puder for helpful conversations related to this project. Both authors thank Semyon Dyatlov for discussions around this subject and the hospitality of IAS while attending the conference “Emerging Topics: Quantum Chaos and Fractal Uncertainty Principle” in Fall 2017. FN is supported by Institut Universitaire de France. We thank the anonymous referee for several comments that have improved the paper.
2. Preliminaries
In this paper we use the notational system for Schottky groups that is used in the papers of Dyatlov and Bourgain [BD17] and Dyatlov and Zworski [DZ17] since it is very convenient for the analysis in the sequel. We follow these papers closely in our development.
2.1. Words, encodings of Schottky groups, and pressure
Let and . If , then we write . The setup of our paper is that we are given for each an open444This is a difference from the notation of [BD17] that we make the reader aware of. disc in with center in . The closures of the discs for are assumed to be disjoint from one another. We let , an open interval. We write for the union of the discs.
We consider the usual action of by Möbius transformations on the extended complex plane . We are given for each a matrix with the properties
[TABLE]
We write for the group generated by the . Since the are disjoint, the Ping-Pong Lemma shows that is a free subgroup of . Any group obtained by this construction is called a *Schottky group. *It is a result of Button [But98] that if is a connected convex co-compact Riemann surface as in our main theorems, then is a Schottky group; we now fix and assume it arises from the above construction.
The elements of can be encoded by words in the alphabet as follows. A *word *is a finite sequence
[TABLE]
such that for . We say that is the* length* of and denote this by . We write for the collection of all words, for the words of length , and for the words of length . We write for the empty word and write . For we write
- •
if and .
- •
if either of or is empty, or else , in which case is in and we write for this concatenation.
- •
if and , which case is in .
If then we associate to the group element ; here The map is a one-to-one encoding of . We write and call this the mirror of . Note that . If we let
[TABLE]
and write for the length of the open interval .
The Bowen-Series map is given by
[TABLE]
The Bowen-Series map is eventually expanding [Bor16, Prop. 15.5]; this will be made explicit below so we do not give the general definition now. The limit set of , defined in the Introduction, coincides with the non-wandering set of :
[TABLE]
The limit set is a compact -invariant subset of . Given a Hölder continuous map , the topological pressure can be defined through the variational formula:
[TABLE]
where the supremum is taken over all -invariant probability measures on , and stands for the measure-theoretic entropy. A celebrated result of Bowen [Bow79] says that the map
[TABLE]
is convex555Convexity follows obviously from the variational formula above. , strictly decreasing and vanishes exactly at , the Hausdorff dimension of the limit set . In addition, it is not difficult to see from the variational formula that tends to as . For simplicity, we will use the notation in place of . The pressure will play a role in some of the estimates in the sequel.
2.2. Functional spaces and transfer operators
Let be any Hilbert space. If is any open subset of the complex numbers , we consider the Bergman space that is the space of -valued holomorphic functions on with finite norm with respect to the given inner product
[TABLE]
Here is Lebesgue measure on . If is separable, then is a separable Hilbert space; in this paper will always be finite dimensional.
Of particular interest is . This splits as an orthogonal direct sum
[TABLE]
If is any orthonormal basis of , and , then the sum
[TABLE]
converges and the resulting kernel is called the *Bergman kernel of . *It is given by the explicit formula (cf. [Bor16, pg. 378])
[TABLE]
where are the radius and center of .
Throughout the sequel, will be a unitary representation of the Schottky group . If is any finite subset of words, then we define
[TABLE]
The complex power is defined by analytic continuation using that is positive on and never a negative real on . One has . Certain particular choices of are made throughout the paper. The basic type of transfer operator that is considered corresponds to the choice . We write . This operator can be written as
[TABLE]
In the following we follow Dyatlov and Zworski [DZ17, §2.4].
Definition 2.1**.**
A subset is a partition if there is such that for all with , there is a unique that is a prefix of .
One particular family of partitions, introduced by Bourgain and Dyatlov [BD17], plays an important role in this paper. For any we define
[TABLE]
It is shown by Dyatlov and Zworski [DZ17, eqs (2.7), (2.15)] that this is indeed a partition. Not only is the partition important to us, but so too is its mirror set
[TABLE]
The reason for introducing this mirror set is to make Lemma 4.5 below work. Note that may not be a partition, although this will not matter. We write .
2.3. The representations appearing in this paper
In this paper we consider particular types of representations as follows. We consider and the family of symmetric groups on letters. Let . The group has a standard representation where acts by precomposition on functions . This representation is not irreducible, but splits as an orthogonal direct sum where is an irreducible representation of dimension . We write for the corresponding homomorphism of the symmetric group.
We now build a representation from a homomorphism . Since is free, is described simply by choosing the images of a generating set of , which may be taken to be the with . We consider
[TABLE]
These depend on the choice of . Later in the paper we will view as a random homomorphism; its law is described by choosing the with independently and uniformly at random with respect to the uniform measure on . This gives random representations and . We write to refer to expectations of random variables with repect to the random representation . For example, if , then is a real random variable and we write for its expectation. At other times we view , , as fixed and coupled to one another; it will be clear from the context whether we make probabilistic or deterministic statements.
2.4. Selberg zeta functions
If is any convex co-compact hyperbolic surface (not necessarily connected), then the Selberg zeta function of is defined for by
[TABLE]
where is the collection of primitive666Primitive here means it is not an iterate of a shorter closed geodesic. closed geodesics on , and is the length of such a geodesic. The function analytically continues to an entire function [Gui92, GLZ04]. One has the following theorem due to Patterson and Perry [PP01, Theorem 1.5] relating resonances of the Laplacian to the Selberg zeta function.
Theorem 2.2** (Patterson-Perry).**
If is any non-elementary convex co-compact hyperbolic surface, then any resonance of is a zero of . Conversely, if is a zero of with then is a resonance of . In all cases, the order of the zero of is equal to the multiplicity of the corresponding resonance.
We will also have a use for twisted Selberg zeta functions. If is any finite dimensional unitary representation of then we let
[TABLE]
This converges to a holomorphic function in and extends to an entire function by results in [FP17].
3. Estimates for derivatives
The following section contains certain technical but either easy or well-known estimates for derivatives of that will be used in the sequel. The fundamental estimates for derivatives of elements of are the following:
Lemma 3.1**.**
**Uniform contraction: **
There are and such that for all , with , and ,
[TABLE]
**Bounded distortion I: **
There is such that for all , such that and all ,
[TABLE]
**Bounded distortion II: **
There is a constant such that for , with and , ,
[TABLE]
Proof.
The first two properties can be found in [Nau14, §2]. The last part is trivial if . Otherwise, if we can write with and . Then for we have
[TABLE]
We have by (3.1) and since now and are in , (3.2) gives
[TABLE]
The equation (3.3) now follows. ∎
In the rest of the paper, for any , we define
[TABLE]
We set . For , we have
[TABLE]
since . Therefore there is such that for any
[TABLE]
We next recall some useful results of Bourgain-Dyatlov from [BD17, §2].
Lemma 3.2**.**
There is a constant such that for any and
[TABLE]
Proof.
For this is [BD17, Lemma 2.5, (20)]. The more general result here follows by combining [BD17, Lemma 2.5] with the bounded distortion estimate (3.3). ∎
The following lemma is [BD17, Lemma 2.10, (30)].
Lemma 3.3**.**
There is a constant such that for , for any we have
[TABLE]
The next lemma says that is coarsely multiplicative.
Lemma 3.4**.**
There is a constant such that for all with
[TABLE]
and for with
[TABLE]
Proof.
The first set of inequalities is [BD17, Lemma 2.7]. If either or is , then (3.6) is trivially true with . So assume . Then (3.6) follows by combining [BD17, Lemmas 2.6 and 2.7]. ∎
We also have the following ‘mirror’ estimate for .
Lemma 3.5** (Mirror estimate, [BD17, Lemma 2.8]).**
There is a constant such that for any
[TABLE]
We now state some lemmas about the set .
Lemma 3.6**.**
There is a constant such that for , for any we have
[TABLE]
Proof.
This follows by combining Lemmas 3.2 and 3.3. ∎
Given Lemma 3.6, we can make the following estimate on the word lengths of elements
Lemma 3.7**.**
There are constants and such that if , then
[TABLE]
Proof.
Write . Pick . By Lemma 3.6 we have
[TABLE]
and combining this with (3.1) gives
[TABLE]
Since , this gives the result after taking logarithms and rearranging. ∎
We now note
Lemma 3.8**.**
There is such that for , .
Proof.
This is a direct consequence of Lemma 3.7. ∎
Throughout the sequel, will always be the parameter given by Lemma 3.8. It will also be useful to know roughly how many elements there are in . This is given by [BD17, Lemma 2.13] (noting that ).
Lemma 3.9**.**
There is such that for
[TABLE]
To conclude this section, we record that certain sums of derivatives are related to the pressure functional.
Lemma 3.10**.**
For all such that there is a constant such that for all and we have
[TABLE]
and
[TABLE]
Proof.
The estimate (3.7) is a standard estimate that appears in [Nau14, Lemma 3.1]. The estimate (3.8) follows by combining (3.7) with Lemma 3.2 and increasing . ∎
4. Transfer operators and zeta functions
4.1. Zeta functions
Lemma 4.1**.**
For any , and any finite dimensional unitary representation of , the operator is trace class on .
Proof.
The proof is an easy adaptation of [Bor16, Lemma 15.7]. The condition rules out having any summand that acts as the identity on some . ∎
Corollary 4.2**.**
Let be any finite dimensional unitary representation of .
- (1)
The operator is trace class on . 2. (2)
For , the operator is trace class on .
Given Corollary 4.2 we can define zeta functions
[TABLE]
The determinants that appear here are Fredholm determinants. The reason that we have used in the definition of is that it will later allow us to estimate in terms of the Hilbert-Schmidt norm of rather than the trace norm (cf. (6.3)). On the other hand, we do not square in the definition of so that we can access known results about .
By the general theory of Fredholm determinants we have
Lemma 4.3**.**
Let be any finite dimensional unitary representation of .
- (1)
The function is an entire function of and
[TABLE] 2. (2)
If then is an entire function of and
[TABLE]
The relevance of the zeta functions are the following:
Proposition 4.4**.**
Let be a fixed homomorphism, and the unitary representation corresponding to via (2.2). Let be the -cover of corresponding to .
- (1)
We have . 2. (2)
We have
Proof.
*Proof of Part 1. *A special case of a result of Jakobson, Naud, and Soares [JNS19, Prop. 2.2] for arbitrary finite-dimensional unitary representations gives
[TABLE]
where both sides are entire functions of .
If is connected, then for some and , the induction of the trivial representation from to . In this case the Venkov-Zograf type induction formula proved by Fedosova and Pohl in [FP17, Thm. 6.1(ii)] (cf. [VZ82]) gives
[TABLE]
If is not connected, let denote its connected components, and let with . If we let then we have . Then
[TABLE]
where the first equality is by definition of the Selberg zeta functions, the second equality uses the induction formula [FP17, Thm. 6.1(ii)] and the last inequality uses the factorization formula [FP17, Thm. 6.1(i)]. Thus we have proved . This proves Part 1.
*Proof of Part 2. *Using [JNS19, Prop. 2.2] again gives
[TABLE]
Since , we have
[TABLE]
where the first equality used Part 1 of the lemma, the second used the factorization formula [FP17, Thm. 6.1(i)], and the third used (4.1). This proves Part 2. ∎
The following lemma adapts (a special case of) [DZ17, Lemma 2.4] to our vector-valued setting. The proof is essentially the same.
Lemma 4.5**.**
*For all sufficiently small , if is such that , then
.*
Corollary 4.6**.**
For all sufficiently small , if and , then .
Proof.
If , , then by Proposition 4.4, Part 2, Then by Lemma 4.3, Part 1, there is such that . By Lemma 4.5, this implies that , and hence . Then by Lemma 4.3, Part 2, . ∎
4.2. The Hilbert-Schmidt norm of the transfer operator
Corollary 4.6 reduces controlling zeros of the Selberg zeta function of that do not come from to controlling zeros of . To do this, we will use Jensen’s formula, but before doing so, we collect some estimates. The first will be a pointwise lower bound on when is a sufficiently large real number (cf. 4.3). The other will be an estimate for the expectation of the squared Hilbert-Schmidt norm for . One input to the latter result is a deterministic (non-random) expression for that we give now.
Lemma 4.7**.**
Let be any finite dimensional unitary representation of We have for any and
[TABLE]
Here and henceforth we write to mean that both and .
Proof.
This is similar to arguments given by Jakobson and Naud in [JN16, pgs. 466-467]. For , let be an orthonormal basis for and let be an orthonormal basis for . Then is an orthonormal basis for . We have
[TABLE]
The final application of Fubini’s theorem is justified since we assume , so , and each maps into a compact subset of , coupled with the fact that the convergence of to is uniform on compact subsets of (see, for example, [Bor16, Proof of Thm. 15.7]). ∎
4.3. A pointwise estimate for the
modulus of a zeta function
Proposition 4.8** (Pointwise bound for ).**
There is and with such that if , if , and is any finite dimensional unitary representation of , we have
[TABLE]
Remark 4.9*.*
A crucial restriction in Proposition 4.8 is that results from the presence of in the definition of .
Proof of Proposition 4.8.
We can write
[TABLE]
whenever the series inside the exponential is absolutely convergent. We have if
[TABLE]
Carefully applying the Lefschetz fixed point formula [Bor16, Lemma 15.9] now gives
[TABLE]
where is the unique attracting fixed point of . Let denote the last letter of .
By using Lemmas 3.2 and 3.4 ( times) we obtain
[TABLE]
Now using Lemma 3.3 we obtain
[TABLE]
for some . We now assume
[TABLE]
so that given we have
[TABLE]
We may also use the simple estimate . Putting this together gives
[TABLE]
Hence by Lemma 3.9 we obtain
[TABLE]
Choose such that and
[TABLE]
with the effect of obtaining when . Now decrease , if necessary, to ensure
[TABLE]
Note that , so this is indeed possible. The result of our choices is that when and
[TABLE]
so
[TABLE]
∎
5. The expectation of the Hilbert-Schmidt norm of the transfer operator
5.1. Statement of the main probabilistic estimate
The main estimate we wish to prove in this Section 5 is the following.
Proposition 5.1**.**
Given , , and there are constants , and such that if , , with and we have
[TABLE]
5.2. The expected value of the trace of a word
The key probabilistic estimate for that we use in this paper is essentially due to Broder-Shamir [BS87], and in the stronger form that we use it can be deduced from the work of Puder [Pud15]. We will explain how to deduce the result below.
Theorem 5.2** (Broder-Shamir, Puder).**
Let have reduced word length . Then for any
[TABLE]
Here is the number of divisors of .
Remark 5.3*.*
Broder and Shamir [BS87] only prove upper bounds for , whereas it is crucial for us to have upper and lower bounds, since we deal with *complex *weighted sums of the random variables .
Deduction of Theorem 5.2.
Let be an element of the non-abelian free group with reduced word length . Note that Theorem 5.2 is trivial if so we assume this is not the case. Puder proves in [Pud15, pg. 885] that for one has an absolutely convergent Laurent series
[TABLE]
where each . Puder associates to a quantity called the primitivity777For good reasons, ‘primitivity’ in the setting of [Pud15] does not coincide with the notion of primitive closed geodesics, although they are related. However, this is not relevant to the current proof.* rank* of *. *For our purposes, the only thing we need to know is that if and only if , and if and only if is a proper power. Puder also considers a certain finite set of subgroups of the free group. Again, the only thing we need to know is that if if , and maximal, then [PP15, pg. 67].
The following facts are proven by Puder in [Pud15, pp. 885-887]:
- •
We have , unless , in which case
[TABLE]
- •
If then
[TABLE]
- •
If then
[TABLE]
- •
For any
[TABLE]
Since , if , and maximal, we have from (5.1)
[TABLE]
If is neither a proper power nor the identity then the estimate is similar, but there is no term since . ∎
5.3. Majorization of the expectation of the Hilbert-Schmidt norm
Lemma 5.4**.**
Given there is a constant such that if and with and ,
[TABLE]
Proof.
Suppose we are given as in the statement of the lemma. Taking the expectation of the expression given in Lemma 4.7 gives
[TABLE]
We wish to estimate the modulus of all quantities appearing in the integral on the right hand side. Firstly the assumption that ensures , and so each maps into a compact subset of . It then follows from the explicit expression for the Bergman kernel in (2.1) that there is such that
[TABLE]
for all as in (5.3).
By definition, if ,
[TABLE]
where is the principal value of the argument, . Hence
[TABLE]
Therefore by Lemma 3.6 for some we have for
[TABLE]
for all , in (5.3), and the same for in place of . Hence applying the triangle inequality to (5.3) and using (5.4) and (5.5), together with the fact that the have finite Lebesgue measure gives
[TABLE]
for some whenever and . ∎
The next step is to input the estimates of Theorem 5.2 into the estimate of Lemma 5.4. To organize the result we introduce, for each , the set
[TABLE]
and
[TABLE]
Notice that in the above, . We will show
Lemma 5.5**.**
Given , there are constants and such that if and with , , and , we have
[TABLE]
Proof.
We will input Theorem 5.2 into Lemma 5.4. For this to be valid we need to control the word lengths of elements of . By Lemma 3.7, all have , so if with ,
[TABLE]
for sufficiently large, say In this case, if the reduced word length of is
[TABLE]
so we may apply Theorem 5.2 to . Moreover, if is the reduced word length of , we have so for any , we have
[TABLE]
when , after increasing if necessary. Finally, in the case is a power in the free group , with we must have and so for any and (here we increase again if necessary).
With these estimates in hand, we partition the range of the sum of the right hand of (5.2) according to the following three cases:
- •
is the identity; if this is the case then . We observe that implies , but since the map is one-to-one, this forces . Therefore the number of pairs of this type is by Lemma 3.9. So in total, these pairs contribute at most
[TABLE]
to the bound for given in (5.2).
- •
is a th power with maximal, . In this case, Theorem 5.2 gives
[TABLE]
for . The total number of these pairs (for all possible ) is so in total, these pairs contribute at most
[TABLE]
to (5.2).
- •
If is not the identity and not a proper power, then Theorem 5.2 gives
[TABLE]
We overestimate how many pairs of this kind there are by counting all pairs, of which there are by Lemma 3.9. So in total, these pairs contribute at most
[TABLE]
to (5.2).
Summing up the bounds (5.6), (5.7), and (5.8) gives the result. ∎
In the next section, we will estimate .
5.4. Estimating the size of ()
Our goal is now to prove the following proposition controlling the size of .
Proposition 5.6**.**
For any , there is such that for
[TABLE]
In the remainder of this 5.4 we prove Proposition 5.6.
We decompose as follows. We introduce integer parameters , , and . For such parameters, let \mathrm{PowerPairs}(\text{\tau,}L,M_{1},M_{2},R;q) be the subset of consisting of those with
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Since every element of belongs to some \mathrm{PowerPairs}(\text{\tau,}L,M_{1},M_{2},R;q), we have
[TABLE]
We will estimate |\mathrm{PowerPairs}(\text{\tau,}L,M_{1},M_{2},R;q)| in the following lemma.
Lemma 5.7**.**
*There are constants and depending only on such that
\mathrm{PowerPairs}(\text{\tau,}L,M_{1},M_{2},R;q) is empty unless*
[TABLE]
and
[TABLE]
Under the same assumptions as Proposition 5.6, and assuming (5.10) holds, there is a constant such that
[TABLE]
Proof.
For the first statement of the lemma, if (\mathbf{a},\mathbf{b})\in\mathrm{PowerPairs}(\text{\tau,}L,M_{1},M_{2},R;q), since , , and , Lemma 3.7 implies (5.10) must hold; therefore
\mathrm{PowerPairs}(\text{\tau,}L,M_{1},M_{2},R;q) is empty if (5.10) does not hold. Moreover since , after doubling and , (5.11) must hold also.
Now we prove (5.12) assuming (5.10) holds. For (\mathbf{a},\mathbf{b})\in\mathrm{PowerPairs}(\text{\tau,}L,M_{1},M_{2},R;q) we have
[TABLE]
where , , and . Therefore
[TABLE]
Since is a th power, with maximal, is also a th power, with maximal, as they are conjugate in . Since the first letters of and are not the same, and the last letters of and are not the same, we have , in other words, the word is cyclically reduced. It now follows that there is some with and (i.e. is also cyclically reduced) such that
[TABLE]
is repeated copies of . Therefore
[TABLE]
with and
[TABLE]
[TABLE]
Our estimates will crucially rely on the observation that for fixed , choosing specifies and and hence specifies and except for their last letters.
We will use the shorthand for . From (5.13), using Lemma 3.4 three times gives
[TABLE]
and using the same estimate in addition to the mirror estimate of Lemma 3.5 gives
[TABLE]
Therefore, now using Lemma 3.4 in the opposite direction together with (5.14) we obtain
[TABLE]
To exploit these estimates, we note that by Lemma 3.3, we have
[TABLE]
where the last inequality is by (3.4). Let
[TABLE]
so we have
[TABLE]
By (5.15)
[TABLE]
By Lemma 3.10 there is some such that
[TABLE]
To deal with , we write
[TABLE]
where if is odd and if is even. Now using Lemma 3.4 twice and the uniform bound for from (3.5) we obtain
[TABLE]
Therefore
[TABLE]
where the final inequality is by Lemma 3.10 and is the constant provided there. Therefore in total, inputting our bounds (5.18) and (5.19) into (5.17) we get
[TABLE]
for . Hence by (5.16)
[TABLE]
for some . ∎
Now we can prove Proposition 5.6.
Proof of Proposition 5.6.
Combining (5.9) with Lemma 5.7 we obtain for constants
[TABLE]
for any and sufficiently small. ∎
5.5. Proof of Proposition 5.1
Suppose we are given parameters as in Proposition 5.1. We assume , , and . Let
[TABLE]
Let and let . Let be such that for , where is the one provided by Proposition 5.6 for the current , and is at least the one provided by Lemma 5.5 for the current and .
Combining Proposition 5.6 and Lemma 5.5 gives for
[TABLE]
after possibly increasing . This completes the proof of Proposition 5.1.
6. Proof of Theorems 1.1 and 1.8
As explained in the Introduction, Theorem 1.8 implies Theorem 1.1, so we will prove Theorem 1.8. A direct proof of Theorem 1.1 would use most of the same ideas and not be significantly shorter.
Let , be a random homomorphism , and be the random representation described in 2.3. Let be the random convex co-compact hyperbolic surface described in the Introduction.
Let and be the number given in the assumptions of Theorem 1.8. Let and be the constants provided by Proposition 4.8 and choose such that the open disc contains . We let .
Since as varies in and runs over all homomorphisms from , the countable collection of holomorphic functions have amongst them all, a countable number of zeros in the closed disc , it is possible to find a such that
- •
no has a zero with and
- •
the open disc contains the closed rectangle
We pick such a Now we let
[TABLE]
We will shortly apply Proposition 5.1 with , as is it is in the current context, and . Let and be the positive constants provided by these inputs to Proposition 5.1. We pick such that for , . This sets up all the constants for the proof.
If for , is an resonance for , and is either not a resonance of or a resonance of with a lower multiplicity, then by Theorem 2.2 combined with Corollary 4.6, . *Therefore it suffices to show that a.a.s. there are no zeros of in . *
Let be the number of zeros of in . Note that . By Jensen’s formula [Bor16, Thm. A.2] applied to the translate of by we have
[TABLE]
The star on the sum means zeros are repeated according to their multiplicity. Note that so Proposition 4.8 ensures , and the choice of ensures is never zero. These conditions were needed for Jensen’s formula. Now (6.1) implies
[TABLE]
Next we majorize . By Weyl’s inequality (cf. [Bor16, (A36)]) we have for any
[TABLE]
where and stand for the trace and Hilbert-Schmidt norms, respectively. This was the reason for the square in the definition of . Also, by Proposition 4.8 we have
[TABLE]
since . Using (6.3) and (6.4) gives
[TABLE]
Combining (6.2) and (6.5) and taking expectations gives
[TABLE]
By Proposition 5.1 we have for all Hence
[TABLE]
for . By Markov’s inequality, the probability that has at least one zero in is bounded by the right hand side of (6.6); since this as , a.a.s. has no zeros in . Hence by the previous arguments, a.a.s.
[TABLE]
and the multiplicities on both sides are the same.
7. Proof of Theorem 1.10 about high frequency resonances
This part is largely independent from the previous sections. Although we use the technique of induced representations to keep track of resonances in covers, we prove a spectral estimate on transfer operators twisted by any unitary representation which implies Theorem 1.10 via induced representations. We will prove the following completely general fact. Let be a unitary representation of on a complex Hilbert888We do not assume that it is finite dimensional here. space . Here is the set of unitary operators on . Recall that . Let denote the Banach space of -valued functions, on , endowed with the norm ()
[TABLE]
where as usual
[TABLE]
where is the Hilbert space norm on . We recall that the action of the “basic” transfer operator , now on the function space , is given by
[TABLE]
We will use the notation . Given the previously defined notations and , we have for all and ,
[TABLE]
We mention here that we could also alternatively use the “refined” transfer operator here in place of , but it wouldn’t change the final result, nor it would make the size of the gap explicit. We will need in this section some standard distortion estimates. Some of them (bounded distortion) have already been used in previous sections, but we recall them for the convenience of the reader.
- •
(Uniform hyperbolicity). There exists and such that for all and all such that , then for all we have
[TABLE]
- •
(Bounded distortion). There exists such that for all and all ,
[TABLE]
- •
(Bounded distortion for the third derivatives). There exists such that for all and all ,
[TABLE]
Notice that the “bounded distortion for the third derivatives” follows directly from differentiating two times , and using bounded distortion and uniform hyperbolicity several times, see for example [BV05, §3] for a previous occurrence of this condition in the literature. We now state the Ruelle-Perron-Frobenius Theorem, which will be used below. The statement of this theorem in the symbolic setting can be found in [PP90, Thm. 2.2]. The version we use can be obtained via the work of Liverani [Liv95] as in [Nau05a, Thm. 5.1].
Theorem 7.1**.**
Set where is real and means the trivial one-dimensional representation.
- (1)
The spectral radius of on is which is a simple eigenvalue associated to a strictly positive eigenfunction in . 2. (2)
The operator on is quasi-compact with essential spectral radius smaller than for some . 3. (3)
There are no other eigenvalues on . Moreover, the spectral projector on is given by
[TABLE]
where is the unique probability measure on that satisfies , and the eigenfunction is normalized so that
[TABLE]
We continue with a basic a priori estimate.
Lemma 7.2**.**
Fix some , then there exists such that for all , all unitary representations and all with , we have
[TABLE]
Proof.
Differentiate the formula for : since the representation factor is locally constant, we don’t need to differentiate it. Use the bounded distortion property plus the uniform contraction, combined with the pressure estimate in Lemma 3.10. Uniformity with respect to follows from triangle inequality plus the fact that for all , we have . ∎
The main fact of this section is the following. It is essentially a vector-valued version of a result stated in [JNS19]. This type of estimate is called a *Dolgopyat estimate *by reference to Dolgopyat’s work on Anosov flows [Dol98] where these type of bounds appeared for the first time.
Proposition 7.3**.**
There exist , and such that for all with satisfying and , we have
[TABLE]
All the constants here are uniform with respect to .
A particular case of this estimate was proved in [OW16, MOW17] for the case of congruence subgroups, where
[TABLE]
is obtained after reduction mod via the regular representation of . The proof was an adaptation of the arguments of [Nau05a]. We will present below a shorter, more direct version of this estimate which allows to prove this generalization without much effort.
Let us first briefly explain why this actually implies Theorem 1.10. We set , where is an arbitrary, finite index subgroup of , and is the induced representation to of the trivial representation of . We work by contradiction. Assume that , then according to the induction formula of Venkov-Zograf [VZ82, FP17], we have for ,
[TABLE]
for some . We can definitely normalize so that . Write , where is given by Proposition 7.3. Take . Using the triangle inequality for and unitarity of , we have (by Cauchy-Schwarz) and the pressure estimate (Lemma 3.10),
[TABLE]
We need to estimate the -norm of on . Since we work with a Hilbert norm, the square of the norm is differentiable and we can compute
[TABLE]
and use the -valued Lasota-Yorke estimate from Lemma 7.2 and Cauchy-Schwarz to obtain
[TABLE]
Using the Ruelle-Perron-Frobenius Theorem (Theorem 7.1), and the fact that , we get
[TABLE]
with . Assuming that and , we can apply Proposition 7.3 and set to get
[TABLE]
We then take large enough and fix close enough to so that and we get
[TABLE]
for some . The same calculation can be performed to obtain similarly
[TABLE]
and we reach a contradiction for all large since Once again, all the constants are uniform with respect to .
The proof of the key Proposition 7.3 will rest on the following result of Bourgain-Dyatlov [BD17].
Theorem 7.4**.**
There exist constants such that the following holds. Given and , consider the integral
[TABLE]
If we have
[TABLE]
and , then for all , we have
[TABLE]
where does not depend on .
For comments on this version of the Bourgain-Dyatlov decay estimate, see [JNS19]. Let us just mention that , up to a smooth density, is the Patterson-Sullivan measure, see [JNS19]. To be able to use this estimate, we will use the following fact from [JNS19], which is referred there as the “uniform-non-integrability property” (UNI), see Proposition 4.10.
Proposition 7.5**.**
(UNI) For all set
[TABLE]
There exist constants and such that for all and all with , we have for all ,
[TABLE]
For a proof of that fact, see [JNS19, §4]. We are now ready to conclude this section by the proof of Proposition 7.3. Pick . We set and we assume that is close to . Let us write
[TABLE]
with
[TABLE]
and
[TABLE]
Notice that is indeed a function on a neighborhood of . By using the bounded distortion property and Cauchy-Schwarz we have easily:
[TABLE]
Differentiating inside the inner product and using the bounded distortion plus the uniform contraction (with Cauchy-Schwarz again) gives also
[TABLE]
Both estimates (7.1) and (7.2) can be combined to yield
[TABLE]
We also observe that , and that by using the bounded distortion for the second and third derivatives we have for some uniform ,
[TABLE]
The plan is now to split as
[TABLE]
with the “near-diagonal” sum
[TABLE]
and the “off-diagonal“ sum
[TABLE]
with . We now assume that and , with with . We fix large enough so that stays uniformly bounded as , and pick small enough such that , so that we can apply Theorem 7.4. Combining estimate (7.3) with the pressure bound from Lemma 3.10, we get
[TABLE]
On the other hand we have
[TABLE]
which by using Proposition 7.5 and the pressure estimate combined with the uniform hyperbolicity (the lower bound) gives
[TABLE]
because as , we can definitely pick so that for all , we have
[TABLE]
for some uniform and . This ends the proof.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Alo 86] N. Alon. Eigenvalues and expanders. Combinatorica , 6(2):83–96, 1986. Theory of computing (Singer Island, Fla., 1984).
- 2[BD 17] J. Bourgain and S. Dyatlov. Fourier dimension and spectral gaps for hyperbolic surfaces. Geom. Funct. Anal. , 27(4):744–771, 2017.
- 3[BD 18] J. Bourgain and S. Dyatlov. Spectral gaps without the pressure condition. Ann. of Math. (2) , 187(3):825–867, 2018.
- 4[BGS 11] J. Bourgain, A. Gamburd, and P. Sarnak. Generalization of Selberg’s 3 16 3 16 \frac{3}{16} theorem and affine sieve. Acta Math. , 207(2):255–290, 2011.
- 5[BM 04] R. Brooks and E. Makover. Random construction of Riemann surfaces. J. Differential Geom. , 68(1):121–157, 2004.
- 6[BMM 17] W. Ballmann, H. Matthiesen, and S. Mondal. Small eigenvalues of surfaces of finite type. Compos. Math. , 153(8):1747–1768, 2017.
- 7[Bol 88] B. Bollobás. The isoperimetric number of random regular graphs. European J. Combin. , 9(3):241–244, 1988.
- 8[Bor 16] D. Borthwick. Spectral theory of infinite-area hyperbolic surfaces , volume 318 of Progress in Mathematics . Birkhäuser/Springer, [Cham], second edition, 2016.
