Fourier dimension and spectral gaps for hyperbolic surfaces
Jean Bourgain, Semyon Dyatlov

TL;DR
This paper establishes a spectral gap for convex co-compact hyperbolic surfaces, linking the gap to the limit set's dimension, using fractal uncertainty principles and Fourier decay bounds of Patterson-Sullivan measures.
Contribution
It introduces a new Fourier decay bound for Patterson-Sullivan measures, advancing the understanding of spectral gaps in hyperbolic geometry.
Findings
Spectral gap depends only on the limit set's dimension
Finitely many zeros of the Selberg zeta function above a certain line
Fourier decay bound may be of independent interest
Abstract
We obtain an essential spectral gap for a convex co-compact hyperbolic surface which depends only on the dimension of the limit set. More precisely, we show that when there exists such that the Selberg zeta function has only finitely many zeroes with . The proof uses the fractal uncertainty principle approach developed by Dyatlov-Zahl [arXiv:1504.06589]. The key new component is a Fourier decay bound for the Patterson-Sullivan measure, which may be of independent interest. This bound uses the fact that transformations in the group are nonlinear, together with estimates on exponential sums due to Bourgain which follow from the discretized sum-product theorem in .
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.
Fourier dimension and spectral gaps
for hyperbolic surfaces
Jean Bourgain
Institute for Advanced Study, Princeton, NJ 08540
and
Semyon Dyatlov
Department of Mathematics, Massachusetts Institute of Technology, 77 Massachusetts Ave, Cambridge, MA 02139
Abstract.
We obtain an essential spectral gap for a convex co-compact hyperbolic surface which depends only on the dimension of the limit set. More precisely, we show that when there exists such that the Selberg zeta function has only finitely many zeroes with .
The proof uses the fractal uncertainty principle approach developed in Dyatlov–Zahl [DZ16]. The key new component is a Fourier decay bound for the Patterson–Sullivan measure, which may be of independent interest. This bound uses the fact that transformations in the group are nonlinear, together with estimates on exponential sums due to Bourgain [Bou10] which follow from the discretized sum-product theorem in .
Let be a (noncompact) convex co-compact hyperbolic surface. The Selberg zeta function is a product over the set of all primitive closed geodesics
[TABLE]
and extends meromorphically to . Patterson [Pa76] and Sullivan [Su79] proved that has a simple zero at the exponent of convergence of Poincaré series, denoted , and no other zeroes in . Naud [Na05], using the method originating in the work of Dolgopyat [Do98], showed that for , has only finitely many zeroes in for some depending on the surface. (See also Petkov–Stoyanov [PS10], Stoyanov [St11], and Oh–Winter [OW16].)
Our result removes the dependence of the improvement on the surface:
Theorem 1**.**
Let be a convex co-compact hyperbolic surface with . Then there exists depending only on such that has only finitely many zeroes in .
Remarks. 1. The proof of Theorem 1 uses the results of Dyatlov–Zahl [DZ16] and thus gives a resonance free strip with a polynomial resolvent bound, see [DZ16, (1.3)]. In the terminology used in [DZ16], Theorem 1 gives an essential spectral gap of size , improving over the Patterson–Sullivan gap .
-
The Selberg zeta function has only finitely many zeroes in ; that is, has an essential spectral gap of size 0. Therefore, Theorem 1 only gives new information when for a small global constant . In [BD16] the authors proved that there exists (depending on the surface ) such that only has finitely many zeroes in . The latter result is only interesting when . Therefore [BD16] and the present paper overlap only when , and in the latter case the present paper gives a stronger result (since depends only on ). In view of the methods used in [BD16] a higher-dimensional extension of that result seems difficult at the present. See Figure 1.
-
The constant can be chosen increasing in , and thus can be made continuous in – see the paragraph preceding §1.1.
In the more general setting of scattering on manifolds with hyperbolic trapped sets, the Patterson–Sullivan gap is replaced by the pressure gap, established by Ikawa [Ik88], Gaspard–Rice [GR89], and Nonnenmacher–Zworski [NZ09]. See the reviews of Nonnenmacher [No11] and Zworski [Zw17] for the history of the spectral gap question and [DZ16, DJ17] for an overview of more recent developments.
- Dyatlov–Jin [DJ17] gave a bound on depending only on and the regularity constant (that is, the constant in Lemma 2.12), proving a fractal uncertainty principle for more general Ahlfors–David regular sets. Our proof removes the dependence of on by using the nonlinear nature of the transformations in the group . In fact, the earlier work of Dyatlov–Jin [DJ16, Proposition 3.17] gives examples of Cantor sets with which are invariant under a group of linear transformations and do not satisfy the fractal uncertainty principle we derive for hyperbolic limit sets here (Propositions 4.1 and 4.3).
The key new component of the proof of Theorem 1, established in §3, is the following generalized Fourier decay bound for the Patterson–Sullivan measure:
Theorem 2**.**
Let be as in Theorem 1 and denote by the Patterson–Sullivan measure on the limit set . Assume that
[TABLE]
are functions satisfying the following bounds for some constant :
[TABLE]
Then there exists depending only on and there exists depending on such that
[TABLE]
Remarks. 1. By taking , on , we obtain the Fourier decay bound . This implies that the Fourier dimension is positive, specifically . The nonlinearity of transformations in is crucial for obtaining Fourier decay, since there exist limit sets of linear transformations (for instance, the mid-third Cantor set) whose Fourier dimension is equal to zero – see [Ma95, §12.17]. Previously Jordan–Sahlsten [JS13] used a similar nonlinearity property to obtain Fourier decay for Gibbs measures for the Gauss map which have dimension greater than . (The method of the present paper can be adapted to prove [JS13, Theorem 1.3] without the dimensional assumption.)
-
The key tool in the proof of Theorem 2 is an estimate on decay of exponential sums established by the first author [Bou10], see Proposition 3.1 and the following remark. In particular our proof relies on the discretized sum-product theorem for .
-
The constant can be chosen an increasing function of . Indeed, it is determined by the constants from Proposition 3.1, see (3.28) and the proof of Proposition 3.2. However, Proposition 3.1 holds for same and all larger values of since the condition (3.1) is stronger for larger values of and we apply this proposition with .
Given Theorem 2, we establish a fractal uncertainty principle for the limit set , see Propositions 4.1 and 4.3. Then Theorem 1 follows by combining the fractal uncertainty principle with the results of [DZ16], see §4. The value of in Theorem 1 can be any number strictly less than , where is obtained in Theorem 2, and thus can be chosen increasing as a function of .
1.1. Extensions to higher dimensional situations
While we do not pursue the case of higher-dimensional convex co-compact hyperbolic quotients in this paper, we briefly discuss a possible generalization of Theorem 1 to the case of three-dimensional quotients with a Kleinian group.
The limit set is contained in and it is invariant under the action of on by complex Möbius transformations. The Patterson–Sullivan measure is equivariant under similarly to (2.29).
Linearizing Möbius transformations leads to complex multiplication and the need of a complex analogue of our main tool, Proposition 3.1. In this analogue the measure is supported on the annulus , the box dimension estimate (3.1) is replaced by
[TABLE]
and the conclusion (3.2) is replaced by
[TABLE]
This complex analogue of Proposition 3.1 can be shown by following the proof of [Bou10, Lemma 8.43] and replacing the real version of the sum-product theorem [Bou10, Theorem 1] by its complex version established in [BG12, Proposition 2].
However, the box dimension bound (1.3) is more subtle than in the case of surfaces. Indeed, in the case of a hyperbolic cylinder (i.e. when is a co-compact subgroup of , with ) the limit set is equal to and the Patterson–Sullivan measure equals the Poisson measure . In this case, both (1.3) and the Fourier decay bound (1.2) fail.
In fact, for hyperbolic cylinders the specific fractal uncertainty principle [DZ16, Definition 1.1] used to establish the spectral gap still holds (and does recover the correct size of the spectral gap, equal to ), however the general fractal uncertainty principle (Proposition 4.1) fails if we take the phase function which restricts to 0 on but has nondegenerate matrix of mixed derivatives .
2. Structure of the limit set
In this section, we study limit sets of convex co-compact quotients, as well as the associated group action and Patterson–Sullivan measure, establishing their properties which form the basis for the proof of the Fourier decay bound in §3.
Let be a convex co-compact hyperbolic surface. Here is the upper half-plane model of the hyperbolic plane and is a convex co-compact (in particular, discrete) subgroup of acting isometrically on by Möbius transformations:
[TABLE]
The action of extends continuously to the compactified hyperbolic plane
[TABLE]
See for instance the book of Borthwick [Bor16, Chapter 2] for more details.
We assume that is nonelementary and noncompact and introduce the following notation:
- •
, the exponent of convergence of Poincaré series, see [Bor16, §2.5.2];
- •
, the limit set of the group , see [Bor16, §2.2.1];
- •
, the Patterson–Sullivan measure (centered at ) which is a probability measure on supported on , see [Bor16, §14.1].
2.1. Schottky groups
A Schottky group is a convex co-compact subgroup constructed in the following way (see [Bor16, §15.1] and Figure 2):
- •
Fix nonintersecting closed half-disks centered on the real line. Here and for the nonelementary cases studied here, we have .
- •
Put and for each , denote
[TABLE]
- •
Fix transformations such that for all ,
[TABLE]
- •
Let be the free group generated by .
Each convex co-compact group can be represented in the above way for some choice of , , see [Bor16, Theorem 15.3]. We henceforth fix a Schottky structure for .
Notation: In the rest of the paper, denotes constants which only depend on the Schottky data , whose exact value may differ in different places. The elements of are indexed by words on the generators . We introduce some useful combinatorial notation:
- •
For , define , the set of words of length , by
[TABLE]
Denote by the set of all words, and for , put . Denote the empty word by and put . For , put . If , put . Note that forms a tree with root and each having parent .
- •
For , we write if either at least one of is empty or . Under this condition the concatenation is a word.
- •
For , we write if is a prefix of , that is for some .
- •
For , we write if . Note that when , the concatenation is a word of length .
- •
A finite set is called a partition if there exists such that for each with , there exists unique such that .
For each , define the group element by
[TABLE]
Note that each element of is equal to for a unique choice of and , when .
To study the action of on , consider the intervals
[TABLE]
For each , define the interval as follows (see Figure 2):
[TABLE]
By (2.1), we have when and when , . The limit set is given by
[TABLE]
A finite set is a partition if and only if
[TABLE]
Denote by the size of an interval . The following contraction property is proved in §2.3:
[TABLE]
Note that (2.4) implies the bound
[TABLE]
which gives exponential decay of the sizes of the intervals :
[TABLE]
We finally describe the collection of words discretizing to a certain resolution. For , let be defined as follows:
[TABLE]
where we put . It follows from (2.6) that is a partition. See Figure 3.
2.2. Distortion estimates for Möbius transformations
Let be a long word. Recall that . In §2.3 below we study how the derivative varies on the interval , in particular how much it deviates from its average value . The results of §2.3 rely on several statements about general Möbius transformation which are proved in this section.
Let and assume that for some intervals . Define the distortion factor of on by
[TABLE]
If , then we put . The transformation can be described in terms of , , and as follows:
[TABLE]
Here are the unique affine transformations such that , . To see (2.9), it suffices to note that
[TABLE]
See Figure 4. The formula (2.9) implies the following identity:
[TABLE]
Our first lemma states that as long as the distortion factor is controlled, the derivatives at different points of do not differ too much from each other and from the average:
Lemma 2.1**.**
Assume that as above. Then we have for all
[TABLE]
Proof.
We estimate for each
[TABLE]
which together with (2.10) implies (2.11). Next, we have
[TABLE]
which gives
[TABLE]
Combined with (2.10), this implies (2.12). ∎
As a corollary of (2.11) and the change of variable formula, we immediately obtain
Lemma 2.2**.**
Assume that as above and let be a Borel subset. Then, denoting by the Lebesgue measure on the line, we have
[TABLE]
The next lemma shows that transformations with different distortion factors have significantly different derivatives. It is an essential component of the proof of Theorem 2 which takes advantage of the nonlinearity of Möbius transformations.
Lemma 2.3**.**
Assume that and are intervals such that . Let be an interval. Then the set of points satisfying
[TABLE]
is contained in an interval of size
[TABLE]
Proof.
Denote . For each we have by (2.10)
[TABLE]
Therefore, (2.14) corresponds to the set of all such that
[TABLE]
where is some interval with . We compute
[TABLE]
We then have for all
[TABLE]
It follows that the set of satisfying (2.15) is an interval of size no more than
[TABLE]
which finishes the proof. ∎
2.3. Distortion estimates for Schottky groups
We now return to the setting of Schottky groups introduced in §2.1. We start by estimating the distortion factors of transformations in :
Lemma 2.4**.**
We have
[TABLE]
Proof.
We may assume that . Let . By (2.1), . Moreover, since . It remains to recall the definition (2.8) and put
[TABLE]
Lemma 2.4 together with (2.11), (2.12), and (2.13) immediately gives
Lemma 2.5**.**
For all and , we have
[TABLE]
Moreover, if is a Borel set, then
[TABLE]
Armed with Lemma 2.5, we give
Proof of (2.4).
We write . With denoting the Lebesgue measure on the line, we compute
[TABLE]
Recall that . Using (2.19), we obtain the lower bound
[TABLE]
finishing the proof. ∎
We next show several estimates on the sizes and positions of the intervals :
Lemma 2.6** (Parent-child ratio).**
We have
[TABLE]
Proof.
Denote and note that where . Then (2.20) follows from (2.19). ∎
Lemma 2.7** (Concatenation).**
We have
[TABLE]
Proof.
This follows from (2.19) similarly to Lemma 2.6, using that . ∎
Lemma 2.8** (Reversal).**
We have
[TABLE]
Proof.
Without loss of generality, we may assume that . We write and denote , so that . Since and , it suffices to show that
[TABLE]
Denote
[TABLE]
and remark that and thus we have equality of cross ratios
[TABLE]
Now, and . Therefore,
[TABLE]
Since we similarly bound . Then (2.23) follows from (2.24) and the fact that , . ∎
Lemma 2.9** (Separation).**
Assume that and , . Then
[TABLE]
Proof.
Since , , there exist
[TABLE]
Without loss of generality we may assume that and write . Then
[TABLE]
Since the distance between and is bounded below by and both these intervals are contained in , we get by (2.17)
[TABLE]
finishing the proof. ∎
We finally obtain estimates on the elements of the partition defined in (2.7):
Lemma 2.10**.**
For all and , we have
[TABLE]
Proof.
Let . Without loss of generality we may assume that . We have and by Lemma 2.6, . This gives (2.26). Now (2.27) follows from (2.22), and (2.28) follows from (2.17). ∎
2.4. Patterson–Sullivan measure
The Patterson–Sullivan measure is equivariant under the group : for any bounded Borel function on ,
[TABLE]
where is the derivative of as a map of the ball model of the hyperbolic space:
[TABLE]
See for instance [Bor16, Lemma 14.2]. Next, (2.29) implies
[TABLE]
where the weight is defined by
[TABLE]
The Patterson–Sullivan measure of an interval is estimated by the following
Lemma 2.11**.**
We have
[TABLE]
Proof.
The formula (2.30) implies that for all , , we have
[TABLE]
Since is a probability measure, this implies that
[TABLE]
Denote . From (2.30) we have
[TABLE]
By (2.17) we have
[TABLE]
and (2.32) follows. ∎
Using Lemma 2.11, we give a self-contained proof of Ahlfors–David regularity of (see [Bor16, Lemma 14.13] for another proof):
Lemma 2.12**.**
Let be an interval. Then
[TABLE]
If additionally and is centered at a point in , then
[TABLE]
Proof.
We first show the upper bound (2.33). Since is supported on , replacing with the intersections we may assume that for some . Shrinking without changing , we may also assume that its endpoints lie in . If consists of one point, then by (2.2) we can find arbitrarily long words such that ; by (2.6) and (2.32), we have .
Assume now that . By (2.6) there exists the longest word such that . Then , for two different such that , . By Lemma 2.9, the distance between and is bounded below by , therefore . Now (2.33) follows from (2.32):
[TABLE]
We next show the lower bound (2.34) where is an interval of size centered at some . Using (2.6), take the shortest word such that . If , then by (2.32) . Assume now that .
Since and , we have and thus by (2.20) . Now (2.34) follows from (2.32):
[TABLE]
As another corollary of Lemma 2.11, we estimate the number of elements in the partition defined in (2.7):
Lemma 2.13**.**
For we have
[TABLE]
Proof.
Since is a partition, we have by (2.3)
[TABLE]
By (2.26) and (2.32), we have for all
[TABLE]
which implies (2.35). ∎
The following is an analogue of the upper bound of Lemma 2.11 where instead of the measure we estimate the number of intervals of length at least in the subtree with root :
Lemma 2.14**.**
Assume that , . Then
[TABLE]
Proof.
We may assume that since otherwise the left-hand side of (2.37) equals 0. By (2.6), the following sets are finite:
[TABLE]
Then is a disjoint collection of subintervals of . Therefore by (2.32)
[TABLE]
On the other hand, by (2.20) and (2.32)
[TABLE]
Therefore, the number of elements in is bounded as follows:
[TABLE]
Next, forms a tree with root , where the parent of is given by . Moreover, is the set of leaves of this tree and each element of has exactly children, where is the number of intervals in the Schottky structure. The number of edges of the tree is equal to both and , which implies
[TABLE]
Combining this with (2.38), we obtain (2.37). ∎
Arguing similarly to the proof of (2.33), we obtain from Lemma 2.14 the following
Lemma 2.15**.**
For all intervals and all we have
[TABLE]
Proof.
Without loss of generality we may assume that is contained in for some . Consider the finite set
[TABLE]
Then forms a tree with root in the sense that implies .
Take the longest word with the following property: for each , we have or . Then cannot have exactly one child in , leaving the following two options:
- (1)
has no children in . Then all satisfy . By (2.5), we estimate the number of elements such that by . 2. (2)
There exist , , , , such that . By Lemma 2.9 the distance between and is bounded below by , and both these intervals intersect , therefore
[TABLE]
By (2.37), the number of elements such that is bounded above by . All other elements have to satisfy , and arguing similarly to the previous case we see that the number of these with is bounded above by .∎
We finally use Lemma 2.3 to obtain the following statement, which gives the positive box dimension estimate required in §3.3. This is the only statement which uses both Lemma 2.8 (via (2.27)) and the full power of Lemma 2.15. Recall the notation from §2.1. We introduce the following additional piece of notation:
[TABLE]
Lemma 2.16**.**
Fix and for each let be the center of . Then we have for
[TABLE]
Proof.
Without loss of generality, we may assume that is small enough so that for all . For each such that , we have
[TABLE]
Indeed, denoting , we have . Also, by (2.27) and (2.21). Therefore, the left-hand side of (2.42) is bounded by
[TABLE]
Now (2.42) follows from (2.39).
By (2.42) and (2.35), the triples with contribute at most to the left-hand side of (2.41). Therefore, it remains to show that for each such that , and
[TABLE]
we have
[TABLE]
Denote by the last letter of ; we may assume it is also the last letter of , since otherwise the left-hand side of (2.44) is zero.
By (2.26) and (2.21) we have and . By (2.17) this gives and on . Thus it suffices to show that for any given constant depending only on the Schottky data,
[TABLE]
By (2.4), (2.8), and (2.43), we have
[TABLE]
By Lemma 2.3, there exists an interval of size depending on such that for each on the left-hand side of (2.45), the point lies in and thus . Then by (2.39) and (2.26) we obtain (2.45), finishing the proof. ∎
2.5. Transfer operators
For a partition , define the operator
[TABLE]
where denotes the space of all bounded Borel functions on , as follows:
[TABLE]
Here the weight is defined in (2.31). The Patterson–Sullivan measure is invariant under the adjoint of :
Lemma 2.17**.**
Assume that is a partition. Then we have for all ,
[TABLE]
Proof.
Since is a partition, we have by (2.3)
[TABLE]
which together with (2.30) gives (2.46). ∎
We will use the following corollary of Lemma 2.17:
[TABLE]
Note that is given by the formula
[TABLE]
3. Fourier decay bound
3.1. Key combinatorial tool
The key tool in the proof of Theorem 2 is the following result [Bou10, Lemma 8.43] (more precisely, its version in Proposition 3.3 below):
Proposition 3.1**.**
For all , there exist and such that the following holds. Let be a probability measure on and let be a large integer. Assume that for all
[TABLE]
Then for all , ,
[TABLE]
Remark. The main component of the proof of [Bou10, Lemma 8.43] is the discretized sum-product theorem [Bou10, Theorem 1]. Roughly speaking it states that for a finite set of -separated points which has box dimension , either the sum set or the product set has size at least , where depends only on . The box dimension condition is analogous to (3.1). We refer the reader to the papers by the first author [Bou03, Bou10] for history and applications of the sum-product theorem. For the passage from the sum-product theorem to the estimate (3.2) in the cleaner case of prime fields see Bourgain–Glibichuk–Konyagin [BGK06, Theorem 5]. See also the expository article of Green [Gr09].
The following is an adaptation of Proposition 3.1 to the case of several different measures with slightly relaxed assumptions:
Proposition 3.2**.**
Fix . Then there exist , depending only on such that the following holds. Let and be Borel measures on such that . Let , , and assume that for all \sigma\in\big{[}C_{0}|\eta|^{-1},C_{0}^{-1}|\eta|^{-\varepsilon_{2}}\big{]} and
[TABLE]
Then there exists a constant depending only on such that
[TABLE]
Proof.
We may assume that is large depending on . By breaking into pieces supported on where and rescaling , we reduce to the case when each is supported on .
Put , choose as in Proposition 3.1, and put
[TABLE]
We henceforth replace (3.3) with the following assumption:
[TABLE]
which follows from (3.3) since .
We next claim that it suffices to consider the case . Indeed, denote
[TABLE]
For , put
[TABLE]
If satisfy (3.5), then the measure satisfies (3.5) as well (with replaced by ). Then the version of Proposition 3.2 for the case implies that for some depending only on
[TABLE]
Since is a polynomial of degree , we have for some depending only on
[TABLE]
giving (3.4) in the general case.
We henceforth assume that . We consider two cases:
- (1)
: define the probability measure on by
[TABLE]
Choose an integer such that . By (3.5) we have
[TABLE]
Same is true for by applying (3.5) to . Then (3.4) follows from Proposition 3.1. 2. (2)
: the bound (3.4) follows from the triangle inequality.∎
In the discrete probability case Proposition 3.2 gives the following statement which is used in the key step of the proof of Theorem 2 at the end of §3.3:
Proposition 3.3**.**
Fix . Then there exist , depending only on such that the following holds. Let and be finite sets such that . Take some maps
[TABLE]
Let , , and consider the sum
[TABLE]
Assume that satisfy for all \sigma\in\big{[}|\eta|^{-1},|\eta|^{-\varepsilon_{2}}\big{]} and
[TABLE]
Then we have for some constant depending only on
[TABLE]
Proof.
It suffices to apply Proposition 3.2 to the measures defined by
[TABLE]
3.2. A combinatorial description of the oscillatory integral
We now begin the proof of Theorem 2. We fix a Schottky representation for as in §2.1. In this section denotes constants which depend only on and the Schottky data.
Put and choose , from Proposition 3.3, depending only on . Let be the frequency parameter in (1.2). Without loss of generality we may assume that . Define the small number by
[TABLE]
Let be the partition defined in (2.7) and be the associated transfer operator, see §2.5. Recall from (2.35) that
[TABLE]
Moreover, by (2.28) and (2.31) we have for each ,
[TABLE]
We introduce some notation used throughout this section:
- •
we denote
[TABLE]
- •
we write if and only if for all ;
- •
if , then we define the words and ;
- •
denote by the last letter of ;
- •
for each , denote by the center of ;
- •
for and such that , define
[TABLE]
and note that by the chain rule and (2.28).
Using the functions from the statement of Theorem 2, define
[TABLE]
By (2.47) and (2.48) the integral in (1.2) can be written as follows:
[TABLE]
We use Hölder’s inequality and approximations for the weight and the amplitude to get the following bound. Note that (2.28) and (3.8) imply that the function below oscillates at frequencies .
Lemma 3.4**.**
We have
[TABLE]
Proof.
Take arbitrary , then
[TABLE]
Now, lies in , which by (2.7) is an interval of size no more than . By (2.18)
[TABLE]
Moreover, by (3.10) and the chain rule
[TABLE]
Recall that by (1.1). Since , by (2.7) we have
[TABLE]
Put
[TABLE]
Combining (3.15)–(3.17), we obtain
[TABLE]
[TABLE]
Using Hölder’s inequality, (3.9), and (3.16), we get
[TABLE]
Combining (3.18) and (3.19) finishes the proof. ∎
To handle the first term on the right-hand side of (3.14), we estimate using (3.10)
[TABLE]
The next statement bounds the integral by an expression which can be analyzed using Proposition 3.3, by linearizing the phase . Recall the definition (3.11) of .
Lemma 3.5**.**
Denote
[TABLE]
where is sufficiently large. Then
[TABLE]
Proof.
Fix . Take and put
[TABLE]
Assume that . Since , , we have
[TABLE]
By the chain rule, for each there exist , , such that
[TABLE]
By (2.7), we have . Then by (1.1) and (2.18), we have for all
[TABLE]
Since and , it follows that
[TABLE]
Denote
[TABLE]
and note that by (1.1) and (2.28)
[TABLE]
We have by Lemma 3.4, (3.20), (3.22), and (3.9), recalling that by (3.8)
[TABLE]
Now, we remark that by (2.33), for each fixed constant
[TABLE]
Therefore, the double integral above can be taken over such that , which for large enough implies that . This finishes the proof. ∎
3.3. End of the proof of Theorem 2
To apply Proposition 3.3 to the sum in Lemma 3.5, we need a positive box dimension estimate. To state it we recall the notation from (2.40) and the constant fixed at the beginning of §3.2.
Lemma 3.6**.**
Define the set of regular sequences as follows: if and only if for all and we have
[TABLE]
Then most sequences are regular, more precisely
[TABLE]
Proof.
For with , define as the set of pairs such that
[TABLE]
For each , there exists such that . By (3.11),
[TABLE]
It suffices to show that for each we have
[TABLE]
By Chebyshev’s inequality the left-hand side of (3.25) is bounded above by
[TABLE]
By Lemma 2.16 this is bounded above by
[TABLE]
This gives (3.25), finishing the proof. ∎
We are now ready to finish the proof of Theorem 2. Using Lemma 3.5 and estimating the sum over by Lemma 3.6, we obtain
[TABLE]
We estimate the first term on the right-hand side using Proposition 3.3. Fix and define
[TABLE]
By (2.35),
[TABLE]
Fix . Recall that . By (3.21) and (3.23) we have for all and \sigma\in\big{[}|\eta|^{-1},|\eta|^{-\varepsilon_{2}}\big{]}
[TABLE]
Therefore, condition (3.6) is satisfied. We also recall from (3.11) that .
Applying Proposition 3.3, we obtain for all and
[TABLE]
From (3.26) and (3.27) we have
[TABLE]
Recalling (3.8) and the definition (3.12) of , this gives Theorem 2 with
[TABLE]
4. Fractal uncertainty principle
In this section, we deduce Theorem 1 from Theorem 2 by establishing a fractal uncertainty principle (henceforth denoted FUP) and using the results of [DZ16]. Throughout this section we assume that are as in Theorem 2.
4.1. FUP for the Patterson–Sullivan measure
We first use Theorem 2 to obtain a fractal uncertainty principle with respect to the Patterson–Sullivan measure :
Proposition 4.1**.**
Assume that:
- •
* is an open set and is compact;*
- •
* and , , satisfy for some constant *
[TABLE]
Define for the operator by
[TABLE]
Let be the constant from Theorem 2. Then
[TABLE]
where the constant depends only on .
Proof.
We denote by constants which depend only on . As in §2.1, we view as a subset of . Using a partition of unity for , we reduce to the case
[TABLE]
for some intervals . To prove (4.3) suffices to show that
[TABLE]
Note that is an integral operator:
[TABLE]
where
[TABLE]
By Schur’s inequality, to show (4.4) it suffices to prove the bound
[TABLE]
For , define the functions , on as follows:
[TABLE]
Then
[TABLE]
It follows from (4.1) that
[TABLE]
and we extend to compactly supported functions on so that
[TABLE]
this is possible since is compact.
Applying Theorem 2 and using (4.6) we get the bound
[TABLE]
It remains to split the integral in (4.5) into two parts. The integral over is bounded by by (2.33). The integral over is bounded by by (4.7). ∎
4.2. FUP for the Lebesgue measure
We now deduce from Proposition 4.1 a fractal uncertainty principle with respect to Lebesgue measure on a neighborhood
[TABLE]
of . We use the following
Lemma 4.2**.**
For , define the function as the convolution of the Patterson–Sullivan measure with the rescaled uniform measure on :
[TABLE]
Then for some constant depending only on ,
[TABLE]
Proof.
Let . Then there exists such that . We have and by (2.34). Therefore . ∎
Our fractal uncertainty principle for the Lebesgue measure is the following
Proposition 4.3**.**
Let be the constant from Theorem 2. Assume that are as in Proposition 4.1. Define the operator by
[TABLE]
Fix . Then
[TABLE]
Proof.
Let be the function defined in (4.8), with replaced by . By (4.9), it is enough to show the following estimate for each bounded Borel function on :
[TABLE]
Define the shift operator on functions on by
[TABLE]
Then for each bounded Borel function on ,
[TABLE]
Moreover
[TABLE]
where
[TABLE]
By Proposition 4.1, we have for all ,
[TABLE]
Then
[TABLE]
which gives (4.12). ∎
4.3. Proof of Theorem 1
We use [DZ16, Theorem 3]. It suffices to show that satisfies the fractal uncertainty principle with exponent in the sense of [DZ16, Definition 1.1].
The paper [DZ16] uses the Poincaré disk model of the hyperbolic plane and the limit set there is a subset of the circle . To relate to our model, we use the standard transformation from the upper half-plane model to the disk model,
[TABLE]
Note that, with denoting the Euclidean norm on , we have for
[TABLE]
Let satisfy , and be the operator defined in [DZ16, (1.6)]. For the purpose of satisfying [DZ16, Definition 1.1] we may assume that is supported near , in particular the pullback of to by the square of the map (4.13) is supported in a compact subset of . Then the operator has the form (4.10) with
[TABLE]
and we have on ,
[TABLE]
It remains to apply Proposition 4.3 to see that the fractal uncertainty principle [DZ16, Definition 1.1] holds, finishing the proof.
Acknowledgements. JB is partially supported by NSF grant DMS-1301619. This research was conducted during the period SD served as a Clay Research Fellow.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Bor 16] David Borthwick, Spectral theory of infinite-area hyperbolic surfaces, second edition, Birkhäuser, 2016.
- 2[Bou 03] Jean Bourgain, On the Erdős–Volkmann and Katz–Tao ring conjectures, Geom. Funct. Anal. 13 (2003), 334–365.
- 3[Bou 10] Jean Bourgain, The discretized sum-product and projection theorems, J. Anal. Math. 112 (2010), 193–236.
- 4[BD 16] Jean Bourgain and Semyon Dyatlov, Spectral gaps without the pressure condition, preprint, ar Xiv:1612.09040 .
- 5[BG 12] Jean Bourgain and Alexander Gamburd, A spectral gap theorem in SU ( d ) SU 𝑑 \mathrm{SU}(d) , J. Eur. Math. Soc. 14 (2012), 1455–1511.
- 6[BGK 06] Jean Bourgain, Alexei Glibichuk, and Sergei Konyagin, Estimates for the number of sums and products and for exponential sums in fields of prime order, J. London Math. Soc. (2) 73 (2006), 380–398.
- 7[Do 98] Dmitry Dolgopyat, On decay of correlations in Anosov flows, Ann. Math. (2) 147 (1998), 357–390.
- 8[DJ 16] Semyon Dyatlov and Long Jin, Resonances for open quantum maps and a fractal uncertainty principle, Comm. Math. Phys., published online.
