Low-lying Geodesics in an Arithmetic Hyperbolic Three-Manifold
Katie McKeon

TL;DR
This paper investigates the properties of closed geodesics in a specific hyperbolic three-manifold, establishing a link with quadratic forms and demonstrating the existence of infinitely many fundamental geodesics within a compact set.
Contribution
It introduces a novel connection between geodesics, continued fractions, and quadratic forms in an arithmetic hyperbolic 3-manifold, proving the abundance of fundamental geodesics.
Findings
Existence of infinitely many fundamental geodesics in a compact set
Establishment of a correspondence between geodesics and quadratic forms
Application of sieve theory and symbolic dynamics techniques
Abstract
We examine closed geodesics in the quotient of hyperbolic three space by the discrete group of isometries SL(2,Z[i]). There is a correspondence between closed geodesics in the manifold, the complex continued fractions originally studied by Hurwitz, and binary quadratic forms over the Gaussian integers. According to this correspondence, a geodesic is called fundamental if the associated binary quadratic form is. Using techniques from sieve theory, symbolic dynamics, and the theory of expander graphs, we show the existence of a compact set in the manifold containing infinitely many fundamental geodesics.
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.
Taxonomy
TopicsGeometric and Algebraic Topology · Mathematical Dynamics and Fractals · Topological and Geometric Data Analysis
Low-lying Geodesics in an Arithmetic Hyperbolic Three-Manifold
Katie McKeon
(Date: 7/1/2019)
Abstract.
We examine closed geodesics in the quotient of hyperbolic three space by the discrete group of isometries SL(2,Z[i]). There is a correspondence between closed geodesics in the manifold, the complex continued fractions originally studied by Hurwitz, and binary quadratic forms over the Gaussian integers. According to this correspondence, a geodesic is called fundamental if the associated binary quadratic form is. Using techniques from sieve theory, symbolic dynamics, and the theory of expander graphs, we show the existence of a compact set in the manifold containing infinitely many fundamental geodesics.
Contents
- 1 Introduction
- 2 Closed Geodesics and Dirichlet Forms
- 3 A Symbolic Encoding of Geodesics
- 4 Counting Geodesics via Thermodynamic Formalism
- 5 Counting Geodesics with Congruence Conditions
- 6 The Growth Parameter
- 7 Construction of the Multilinear Sifting Set
- 8 Small Divisors
- 9 Large Divisors
- 10 Sieve Theorem
- 11 Final Estimates
1. Introduction
1.1. Closed Geodesics on the Modular Surface
In [Duk88], Duke showed that closed geodesics on the modular surface equidistribute when grouped by discriminant, see also [CU04]. In [ELM*+*09] Einsiedler, Lindenstrauss, Michel, and Venkatesh gave a modern treatment of Linnik’s approach to this problem using the ergodic method. A key step is ruling out other potential weak- limits of closed geodesics. This raises the basic question on what other weak- limits could arise. Because the geodesic flow is a shift map (see Chapter 3) this question is trivial without more restrictions. They asked whether there is an infinite collection of closed geodesics having fundamental discriminant and being trapped in a compact subset of the modular surface. That is they don’t visit the cusp, or are “low-lying.” Bourgain and Kontorovich [BK17] showed an abundance of fundamental low-lying geodesics on the modular surface, answering the question above in a quantitative sense.
We will attack the corresponding problem in the Picard -manifold . However, the solution is not as simple as applying the machinery from [BK17] to a ‘thin semi-group’ with well-established growth properties. For one, continued fractions in the complex plane are much more complicated to work with versus simple continued fractions on the real line. In particular, our symbolic encoding of closed geodesics does not display a semigroup structure because the shift map is restricted. We also have to develop in this setting much of the machinery (Chapters 3-6) which was already available to [BK17] for the modular surface.
1.2. The Main Theorem
We must establish some terminology before stating the main result. Consider the upper half space model of hyperbolic three-space:
[TABLE]
equipped with the line element
[TABLE]
where an element in the group of isometries acts by
[TABLE]
When is embedded as a subset of Hamilton’s quaternions, this expression simplifies as . Since extends to a simply transitive action on the frame bundle , we can identify an element in with where it moves some representative reference frame. We can also identify and
[TABLE]
Geodesic flow on under this identification is represented by right-multiplication by the one parameter group generated by . There is a correspondence between conjugacy classes of primitive hyperbolic matrices in and closed geodesics.
To restrict to “low-lying” geodesics,we only consider those in the standard fundamental domain lying in a certain region . See for example, the figure below which depicts the standard fundamental domain for and the cutoff .
Once we have developed a symbolic encoding of closed geodesics, it is trivial to manufacture infinitely many geodesics which are low-lying by enumerating periodic points (with restricted orbits) of a map analogous to the Gauss map for continued fractions. Adding the condition that geodesics be fundamental places the requirement that the geodesic , as a loxodromic element of , has which satisfies certain conditions (see Section 2.0.5), a sufficient one being that it is square-free. If is the set of distinct geodesics with discriminant and denotes the norm of a Gaussian integer, then we will show the following quantitative result:
Theorem 1**.**
For any , there is a compact region and a set of fundamental discriminants such that
[TABLE]
and for all ,
[TABLE]
Of course, qualitatively, this solves the problem of producing infinitely many fundamental low-lying geodesics in the Picard -manifold.
1.3. Strategy of the Proof
Our three main tools come from symbolic dynamics, expander graphs, and sieve theory.
1.3.1. Thermodynamic Formalism and Renewal Theorems
After converting the study of closed geodesics to periodic points of an analogue of the ‘Gauss map’, we are led to study the dynamics of a subshift of finite type. In particular, define
[TABLE]
where is some finite alphabet (see Chapter 3), and is a binary matrix conveying transition rules (i.e. if can be followed by and otherwise). The shift map on is defined as . Choosing the appropriate and following the work of [Pol94], gives an essentially one-to-one correspondence between closed geodesics lying in a compact set (corresponding to the choice of ) and periodic points of under . Denote the set of closed geodesics associated to via this correspondence as and
[TABLE]
The methods of Lalley in [Lal89] are straightforward to apply to our situation and lead to the following:
Theorem 2**.**
For fixed , there is a so that
[TABLE]
as .
It will be crucial in a later argument that the set above is large.
Theorem 3**.**
The growth parameter given by Theorem 2 satisfies
[TABLE]
Finally, we will need local information about closed geodesics. This is where expander graphs are used crucially. We follow the work of [BGS11] together with [BKM]. For , set .
Theorem 4**.**
For each , there is some absolute spectral gap and absolute constants such that for all square-free and we have the estimate
[TABLE]
as , where
[TABLE]
1.3.2. A First Attempt via the Affine Sieve
Theorem 4 allows us to follow the affine sieve procedure (see [BGS10], [SGS13], or [Kon14]) up to a level of distribution where the exponent and show for sufficiently large that
[TABLE]
Since factors as , any Gaussian prime dividing must divide one of its linear factors. This fact allows us to conclude from the “almost prime” estimate above that
[TABLE]
See the proof of Theorem 24 on page 24 for details.
Comparing the two estimates, we would have our main result if only we could show that
[TABLE]
It seems that making near 2 (as in Theorem 3) suffices. However, the shared dependence of and on cannot at this time be decoupled, so this attack fails, and we must use something more than expansion.
1.3.3. Beyond Expansion
To have stronger control on the exponent of distribution, we create bilinear (in fact, multilinear) forms, replacing by a specially constructed subset , see Chapter 7. We analyze the set
[TABLE]
via abelian harmonic analysis (on ). The characters of small order up to some intermediate level can be handled by expansion. The characters of larger order are now dealt with by appealing to bilinear forms techniques, namely Cauchy-Schwarz and estimating exponential sums. Our methods allow us to sieve up to the absolute level of distribution from which Theorem 1 follows.
2. Closed Geodesics and Dirichlet Forms
We express the upper half space model of hyperbolic -space as a subset of Hamilton’s quaternions, i.e.
[TABLE]
where and . The group acts on by
[TABLE]
The inverse above should be interpreted as the Hamiltonian inverse. Considering the action of on the boundary gives a correspondence with Möbius transformations.
2.0.1. The Picard Group
Inside of , we have the discrete subgroup , sometimes referred to as the Picard group. We can express
[TABLE]
and this allows us to write the fundamental Dirichlet domain for the quotient as
[TABLE]
2.0.2. Closed Geodesics
Write
[TABLE]
A geodesic which is closed in is identified by . Since commutes with , this translates to
[TABLE]
for some , . More explicitly, we may write
[TABLE]
for some .
2.0.3. Properties of Closed Geodesics
- •
Trace and Eigenvalues:
By the equation above, we infer that is diagonalized by with eigenvalues . Following Beardon, we call hyperbolic if and strictly loxodromic if . The term loxodromic (referring to transformations with fixed points in ) encompasses both. The trace of is
[TABLE]
On the other hand, we can express the eigenvalue as
[TABLE]
and this gives us a way to determine the closed geodesic associated to an arbitrary loxodromic transformation in .
- •
Length and Primitivity:
The length of the geodesic is given by . Note that any powers of satisfy , which would suggest that their length is . However, indicates that we are traversing the same closed geodesic times. So, we call primitive when it is not a power of another element in the Picard group.
- •
Equivalent geodesics:
Technically, a closed geodesic is an element of the quotient satisfying . We chose a particular representative , but any conjugation where would give the same geodesic. Hence, geodesics are equivalent if they are in the same conjugacy class.
- •
Fixed points, visual points:
The loxodromic transformation has two fixed points in which can be found by solving
[TABLE]
In other words, the fixed points are roots of the (homogenized) binary quadratic form with coefficients in . Solving this, we get
[TABLE]
On the other hand, if we have we can calculate
[TABLE]
A similar statement (as ) gives the reverse direction of the geodesic. These points are referred to as the visual points of the geodesic.
2.0.4. Dirichlet Forms
Many of the observations above suggest a correspondence between closed geodesics and binary quadratic forms with coefficients in , also known as Dirichlet forms. We have
[TABLE]
modulo the greatest common divisor of , , and and up to choice of unit. This correspondence is explained further in [Sar83]. We associate the discriminant of the Dirichlet form with the closed geodesic corresponding to .
2.0.5. Fundamental Discriminants for Dirichlet Forms
Note that a discriminant of a Dirichlet form must be a square mod 4 and hence . Moreover, each with a square residue mod is a discriminant of some form. We call a discriminant fundamental if it cannot be expressed as where is a non-unit and is also a discriminant. This is equivalent to another other common definition which states that is fundamental if any form with discriminant must be primitive (i.e. .) Note that this also agrees with the work of Hilbert, i.e. that is fundamental if and only if is the relative discriminant of the extension of over .
A geodesic is fundamental if its associated discriminant is fundamental. We will sieve down to geodesics with square-free discriminant, only catching the case.
3. A Symbolic Encoding of Geodesics
We now describe the results of Pollicott in [Pol94]. Denote a circle of radius about a center as . Consider the region in exterior to the three circles and where we have the removed vertical lines and horizontal lines . The region is shown in blue in the figure below.
For each there is a unique closest (in Euclidean distance) Gaussian integer, which we denote . The map will move to the unit square centered about the origin by first subtracting . If , then rotates about the origin by . Finally, the involution is performed to return to . Formally, we define as
[TABLE]
Define and on . Note that , the image of under , is contained within . Pollicott proves the following:
Theorem 5**.**
There is a bijection between closed geodesics and the periodic points of .
Furthermore, [Pol94] shows that admits a Markov partition. This will allow us to study the system via a simplified encoding. The naive choice of partition of into connected regions between the grid lines is almost correct. We must introduce two more circles, and and separate each region intersecting the boundary of either of the circles. The figure below illustrates the partition which we denote . Each connected region after removing , and the -spaced grid is a part in the partition.
For each part , we associate a distinct label . The set of all labels is the alphabet for our shift map. Since is a Markov partition, gives a symbolic representation of where
[TABLE]
and is the shift operator, i.e. . More precisely, for any finite admissible word (meaning occurs as a subword of some ) we define the cylinder set as
[TABLE]
Since , we have that the diameter of is at most . We also have . Therefore the map
[TABLE]
is well-defined. Since the interiors of distinct cylinders of length (i.e. the cylinder defined on a word of length ) are disjoint, is one-to-one. The image of is all of up to a set of Lebesgue measure [math] (the orbit of the grid under must be removed) and the following diagram commutes:
[TABLE]
In particular, we have a bijection between the periodic points of and the periodic points of . This allows us to study closed geodesics by analyzing the system .
From the correspondence between periodic orbits in and closed geodesics, we can measure how close a geodesic is to the cusp in by determining the minimum distance from origin to a point in the orbit of the associated periodic point. So define by only allowing parts from if they lie completely inside the ball of radius centered at the origin. Recall that the parts were defined for the conjugate system and so the images of parts in under fall outside a small ball centered at the origin. The figure below has the parts included in shaded.
Our corresponding symbolic encoding is
[TABLE]
The new system is now a subshift of finite type as its alphabet is finite. The problem of counting low-lying geodesics translates into a problem of counting periodic points of in .
4. Counting Geodesics via Thermodynamic Formalism
The asymptotic for geodesics derived in this chapter is a straightforward application of the work of Lalley in [Lal89]. We summarize the ideas which give rise to the method in the next section towards an asymptotic for geodesics counted by congruence classes.
For , we define the distortion function . The -th Birkhoff sum for the distortion function is then where . If and in particular is a visual point corresponding to a closed geodesic, then where is the length of the geodesic. This gives some indication that the following function will be useful in counting geodesics. For and Lalley’s renewal function is defined as
[TABLE]
Partitioning the sum by the preimage , we arrive at the following recursive relation, known as the renewal equation
[TABLE]
In order to analyze the renewal function, we are led to study its Laplace transform and a certain transfer operator.
For a continuous function defined on and , we define
[TABLE]
Then is the space of Hölder continuous functions which is a Banach space with norm . The transfer operator, depending on , acts on as follows:
[TABLE]
First note that is a bounded linear operator. Additionally, when the coefficients in the sum are all positive. For real , would like to compare the spectrum of to that of an positive matrix. In particular, we would like to apply an analogue of the Perron-Frobenius theorem. In order to do so, we must establish a few more properties of the system .
Recall that a matrix is irreducible if for each position there is some power of such that the -th entry is positive. In analogy, we say that is irreducible if for each two states there is some finite admissible word beginning with and ending in .
Lemma 1**.**
* is irreducible as long as .*
Proof.
By our definition of , a finite subword of the form must satisfy . In other words, we must show that for each part in that there is some such that .
One may recall from the diagrams in the previous section that for any part , the image under contains at least one of the following regions
Each region contains at least one square part. The image of a square part under is either the union of the even regions or the odd regions. In either case, the next iterate of is the union of all regions. Hence for any . ∎
A state is periodic of period if any finite admissible word beginning and ending in must have length divisible by . The period of the system is the greatest common factor of the periods of all of its states and a system is said to be aperiodic if this greatest common factor is 1.
Lemma 2**.**
* is aperiodic as long as .*
Proof.
Since we already established irreducibility, we only need to show that one state is aperiodic. Take the square part to the left of , i.e. . Its image under is the union of the even regions (refer to the previous figure) and hence . Therefore, the orbit of a point in may return to after any number of iterates of . ∎
4.1. Properties of the Spectrum of
We are now in a position to cite Ruelle’s Perron-Frobenius theorem (see [PP90] for proof):
Theorem 6**.**
For the spectrum of has the following properties:
- (1)
* has a simple maximal positive eigenvalue with corresponding eigenfunction which can be chosen to be positive.* 2. (2)
The remainder of the spectrum is contained in a disc of radius less than . 3. (3)
There is a unique probability measure on such that . 4. (4)
* uniformly for all continuous if is normalized so that .*
Consider as a family in and define the pressure functional as . The pressure is increasing in and there is a unique solution to . Since is featured in our main asymptotic, it will be necessary to determine the dependence of on in a later section. Our next step is to consider the family for .
Theorem 7**.**
For , the spectrum of is contained in a disc centered at zero of radius (the maximal eigenvalue of ).
Proof.
We summarize the proof provided by Lalley in section 11 of [Lal89].
There are two cases: either is lattice in which case the spectral radius of is strictly smaller than the radius on the real axis or it is nonlattice in which case has spectral radius equal to at regularly spaced intervals along the vertical line . See Lalley for the precise definition of a lattice function. In order to show that is non-lattice we relate it to a function known to be non-lattice.
is cohomologous to , a height function on suspension of restricted geodesic flow.
It suffices to show that for periodic of period , i.e. , we have . If is the period of , we will show that both th Birkhoff sums give times the length of the closed geodesic associated with :
[TABLE]
On the other hand, also corresponds to a mobius function . Say is the fixed point of .
[TABLE]
So .
If is lattice then the suspension flow is not mixing for any invariant measure, but [Rud82] proves otherwise. ∎
4.2. A Renewal Theorem for the Counting Function
Perturbation estimates ( for ) imply that the eigenvalue map , the lead eigenfunction map and the invariant measure map are all holomorphic functions in a small neighborhood of . This leads to the local decomposition where is a holomorphic family of bounded operators. The first term in the local decomposition about contributes the main term in Lalley’s estimate:
Theorem 8**.**
For any ,
[TABLE]
Proof.
We summarize the proof, ignoring issues of convergence which are addressed in section of of Lalley. First, define the following Laplace transform of the renewal function
[TABLE]
and input the renewal equation to get
[TABLE]
So applied to the Laplace transform of the renewal function gives . Now it is clear how information about the spectrum of yields information about the renewal function. In particular, where the resolvent exists we have
[TABLE]
Theorems 6 and 7 and the decomposition of in a neighborhood of imply
[TABLE]
where is holomorphic in . Integrating a smoothed version of along a vertical line and pulling the contour to we get that the pole in contributes the main term
[TABLE]
as . ∎
4.3. An Asymptotic for Closed Geodesics
Finally, we relate dynamics on to a geodesic count. Define the set of finite admissible words (plus the empty word ) as
[TABLE]
There is a bijection between aperiodic words in and closed geodesics. Specifically, to a closed geodesic we associate the element in that corresponds to the period of an orbit under . A periodic word in corresponds to the a geodesic traversed multiple times. We define where denotes hyperbolic distance between any two points in and is the local definition of restricted to . The identity (see [EGM13] for a proof specific to ) will eventually lead us to the final counts for matrices in a norm ball. The shift operator extends in a natural way to act on however we need to resolve the ambiguity of for words of length less than :
[TABLE]
We are now ready to define the finite version of the renewal function
[TABLE]
satisfies a renewal equation similar to and so we are tempted to treat the finite renewal function analogously. However, finding an appropriate Banach space of functions for the transfer operators to act on is elusive.
In order to model after we introduce a new state [math] and for any append an infinite tail of [math]’s to achieve an infinite word. The empty word maps to the infinite string of zeros and the action of is well-defined between the finite model of and the infinite one. The space of Hölder continuous functions satisfies the same properties (with the same norm) as previously. However, the addition of the new ‘0’-state means that the system is no longer irreducible and hence Ruelle’s Perron-Frobenius theorem does not immediately apply to the spectrum of the transfer operators defined on . Since we are only after an asymptotic for and long words in may be approximated reasonably well (in the product topology) by words in , we can use what we have already shown about the transfer operators on to prove the following:
Theorem 9**.**
If is the leading eigenfunction of then
[TABLE]
Proof.
Our first claim is that for and which are in the same -cylinder in (i.e. for ) and for
[TABLE]
Let be the periodic word with period . We claim that . Recall from the proof of Theorem 7 that for any geodesic with period , where is the length of . We can also write
[TABLE]
On the other hand, by bounded distortion (see Lemma 3 which is more easily understood with the notation in the next section) . This proves the first claim.
From the previous claim it follows that for and which are in the same -cylinder and
[TABLE]
for .
Then iterating the renewal equation times, one has
[TABLE]
As second line does not change. For each summand in the first line we can find to sandwich between the two terms
[TABLE]
Send and use the continuity of to get the statement of the theorem. ∎
If is the leading eigenfunction for the transfer operator in then the leading eigenfunction of agrees with on . This is Lemma 6.1 of Lalley.
The theorem follows from a sandwiching argument of the renewal function between with appropriate parameters. A similar argument will appear in the next section.
Combining the asymptotic for with the identity yields Theorem 2 which we restate here:
Theorem 10**.**
For fixed , there is a so that
[TABLE]
as .
5. Counting Geodesics with Congruence Conditions
Here we combine the work of Bourgain, Gamburd, Sarnak in [BGS11] with the expansion idea of Bourgain, Kontorovich, Magee in [BKM] to estimate
[TABLE]
for some (recall that ).
In order to detect congruence classes we introduce a new space of functions . If , defined on , is continuous in each variable, we can define
[TABLE]
Then with norm is a Banach space.
Before defining the action of the transfer operators on this space, we must explain how the action of extends to . Recall the definition of in
[TABLE]
Locally, i.e. when restricting to the interior of a part , we may represent the action of as a fractional linear transformation:
[TABLE]
where reflects whether rotation is necessary for the image to be in the upper half-plane. Moreover, the inverse of is well-defined and represented by a fractional linear transformation in .
We now introduce some notation and operations on in order to describe the preimages of an element under . Let
[TABLE]
be the set of admissible words of length . We denote concatenation of two finite words with , i.e. for and ,
[TABLE]
If and satisfy the subshift rules, then we say the concatenation is an admissible one. Concatenations of the form are also well-defined for as long as is a finite word. In order to describe finite words which give admissible concatenations we set
[TABLE]
While may be an infinite word, we must have a finite word for the definition above.
For , we now write and for each denote the inverse branch of at as . In other words, satisfies and
We are now ready to describe the congruence transfer operators:
[TABLE]
5.1. Bounding in the Supremum Norm
We will exhibit cancellation in the iterates of the transfer operator
[TABLE]
by treating the prefix and suffix of separately. Let and for any define
[TABLE]
where . In order to decouple and , we need a lemma which reassures us that the value of does not change much for fixed and varying . We first establish a property of the system called bounded distortion.
Lemma 3**.**
For fixed there is some so that for any
[TABLE]
Proof.
From the definition
[TABLE]
we have that both and . Since we have fixed all of the parts in lie in an annulus (bounded away from [math]), the bound follows. ∎
Bounded distortion leads to the following estimate for Birkhoff sums
Lemma 4**.**
For any two and we have
[TABLE]
Proof.
For both and are in the same cylinder which has diameter at most .
The Mean Value Theorem combined with bounded distortion yields
[TABLE]
∎
Returning to our estimation of the measure , we pick an arbitrary and the lemma gives
[TABLE]
5.1.1. Expressing as a convolution
Now for a divisor of , break each into subwords of length , i.e. write each where . Then
[TABLE]
For each , we will further decompose the word as a long prefix (of length ) and a short suffix. Write . In order to separate dependence on the suffixes, we replace with where is some arbitrary admissible choice based on . Since we will be replacing many of the weights in , we need to sharpen the estimate from the previous lemma. In particular, since and are in the same cylinder for we have
[TABLE]
Hence making the substitution for each of the subwords (no substitution is necessary for ) gives
[TABLE]
Instead of decomposing into subwords of length , we would like to start with subwords and determine which concatenations are admissible. We may choose in the following way:
- (1)
select and for the remaining . 2. (2)
select and for the remaining .
The effect is to separate the sum into an outer sum depending on the prefixes of length and an inner sum of the suffixes of length . We will also distribute the product into the convolution:
[TABLE]
Define
[TABLE]
as a distribution on . Our first observation about the measures is that the ratio of any two coefficients is bounded. For two admissible
[TABLE]
The two cylinders may be disjoint. However, the distance between them is still bounded since they lie in . So an application of the Mean Value Theorem gives that the second term in the inequality is less than some universal constant. In other words,
[TABLE]
So the coefficients of the sum defining are nearly flat. In order to establish an expansion result for , we will also need the following:
Lemma 5**.**
For any , pairs of admissible suffixes of of length generate all of . Specifically, for any two letters , we have
[TABLE]
where .
The lemma is proved by finding admissible expansions of the four canonical generating matrices for ,
[TABLE]
via matrices the form
[TABLE]
An automated search through all sufficiently small expressions with restricted coefficients yields the required matrix expansions.
5.1.2. Expansion via Selberg’s Theorem
We are now ready to prove the expansion theorem for the ’s defined on page 5.1.1. For each square-free , we have the product representation which gives rise to the following decomposition for functions defined on :
[TABLE]
where
[TABLE]
We first treat one at a time, and then assemble them using Fourier-Walsh decomposition (see Section 5.3 on page 5.3).
Theorem 11**.**
If , then
[TABLE]
.
Proof.
First, we retrace the standard steps to rewrite in terms of a convolution operator. By definition,
[TABLE]
where we have
[TABLE]
Expanding the square gives
[TABLE]
(Recall that and .) We reorder the following sums as
[TABLE]
Now, from Lemma 5 and the analogue of Selberg’s theorem for congruence subgroups of (see [Sar83] or Theorem 6.1 in [EGM13]) we deduce that for any there is some choice of so that
[TABLE]
The law of cosines gives
[TABLE]
and so
[TABLE]
We separate the term from the rest of the sum as follows
[TABLE]
Since we established earlier that , this gives
[TABLE]
∎
Apply Theorem 11 to each and we have
Corollary 1**.**
For
[TABLE]
Next, we exploit quasi-randomness of to get a bound for .
Theorem 12**.**
For with as defined previously on page 5.1, we have
[TABLE]
for any .
Proof.
Recall
[TABLE]
Define
[TABLE]
We established earlier that . Corollary 1 and bounded distortion yield the following bound for :
[TABLE]
and therefore .
Define as the convolution operator . First note that acts on since it’s a linear combination of convolutions with delta functions. Since is self adjoint, we have .
[TABLE]
where and a similar definition applies to . The multiplicity of equal to the dimension of the eigenspace is at least by the Fobenius lemma. So
[TABLE]
We bound by introducing . Observe and .
[TABLE]
Since , we can choose to get ∎
5.1.3. Applying Theorem 12
Now we would like to use the previous bound on our congruence transfer operators defined on page 5. Rewrite as
[TABLE]
where is arbitrarily chosen as long as is admissible. We will frequently use the fact that for and the transfer operators defined in the non-congruence setting we have
[TABLE]
Filling this in for the second term in our bound for the congruence transfer operator gives
[TABLE]
If , then we are in position to use the bound for :
[TABLE]
For any ,
[TABLE]
Apply this bound for each summand in ,
[TABLE]
5.2. Bounding in Variation
Now, we need to bound . Suppose and ,
[TABLE]
For the first term, we note that and agree in the first letters so
[TABLE]
For the second term, we will use a similar approach as before. Decompose into and decouple:
[TABLE]
For the error term, we estimate
[TABLE]
For the first term, we use the eigenvalue bound. For the second, we use the fact that and are in the same cylinder combined with bounded distortion (i.e. .) This gives
[TABLE]
5.2.1. Applying Theorem 12 Again
For each define
[TABLE]
The same proof as before follows through for , as long as , to yield the following for :
[TABLE]
Referring to the proof, we note that the ’s have slightly different coefficients in the corresponding ’s:
[TABLE]
However, the important property of ‘nearly flat coefficients’ (i.e. that the constant for each summand varies by at most a constant ratio) is preserved. Returning to the bound for , we have
[TABLE]
For each we have
[TABLE]
So finally we have
[TABLE]
Recall also our bound for :
[TABLE]
We assume because we needed and . Thus, we have
[TABLE]
Further, take and we have
[TABLE]
Iterating the inequality yields
[TABLE]
5.3. Fourier-Walsh Decomposition
We would like to extrapolate from the previous bound (valid for ) a bound for any of the non-constant level subspaces. In particular, recall that . We temporarily denote inside of as in order to compare with . This decomposition extends to one for , namely
[TABLE]
- (1)
preserves the subspaces because
[TABLE]
and is an automorphism of for each . So the right hand side is a linear combination of functions in . 2. (2)
The natural projection from to extends to the subspaces and . In particular, and the corresponding satisfy
[TABLE]
and if we denote the norm on we have
[TABLE] 3. (3)
, i.e. the projection is equivariant under the appropriate congruence transfer operators.
These three properties allow us to decompose a function where and apply our bound as if is in . Assume , i.e. is orthogonal to the constant function.
5.3.1. Small Imaginary Part
For small imaginary part ()
[TABLE]
where we used that and that the number of divisors of is at most .
5.3.2. Large Imaginary Part
For large imaginary part , we have
[TABLE]
To bound the sum, observe
[TABLE]
We have shown the following:
Theorem 13**.**
For orthogonal to the constant functions, there is some so that
[TABLE]
Now, in order to find the region of analyticity of , we recall that is holomorphic in a small neighborhood of and . In particular, this means there is some such that for all . We can also find so that for satisfying we have
[TABLE]
For in both regions, we have that (restricted to the space orthogonal to constant functions) is holomorphic and bounded by
[TABLE]
5.4. Fourier Analysis of the Renewal Function
Similar to the previous chapter, we introduce a counting function which satisfies a functional equation relating it to the resolvent of the congruence transfer operator on . To incorporate the congruence aspect, we define
[TABLE]
where is a function on , is a function on , , and . The renewal equation is
[TABLE]
where denotes the right regular representation of . In particular
[TABLE]
The Laplace transform
[TABLE]
satisfies
[TABLE]
Observe that is linear in and so is its Laplace transform. The main contribution to comes from the constant term and this analysis is a straightforward extension of the previous chapter since
[TABLE]
The contribution from functions orthogonal to constants is bounded using Theorem 13.
As in [BGS11], we can choose a smooth nonnegative function on such that , with the following bound for its Fourier transform
[TABLE]
For some small parameter , we define
[TABLE]
Note that .
Inserting the smoothing function gives
[TABLE]
Theorem 13 allows us to shift the contour by
[TABLE]
and gives
Theorem 14**.**
For with ,
[TABLE]
5.5. The Finite Renewal Function
As in the previous chapter, the geodesic count comes from an analysis of a lattice point counting function which is close to our renewal function for large sequences. The strategy is analogous to [Lal89] or [MOW17].
We define
[TABLE]
where (see Section 4.3 for the definition of the space and .) To count geodesics with congruence conditions, it suffices to provide an asymptotic for
[TABLE]
Iterating the finite renewal equation yields
[TABLE]
As , the second line does not change. For each summand corresponding to in the first line we can find to sandwich between the two terms
[TABLE]
So, it suffices to analyze (sending to get the final theorem). Let and write
[TABLE]
where . Then we have
[TABLE]
Observe where is the renewal function defined in the previous section. We established in the previous section that
[TABLE]
when and are in the same -cylinder. So the first term is . Since is increasing in , we have
[TABLE]
Sending and appealing to Theorem 14 gives
[TABLE]
After renaming constants, we have shown Theorem 4 from the introduction:
Theorem 15**.**
For each , there is some absolute spectral gap and absolute constants such that for all square-free and we have the estimate
[TABLE]
as , where
[TABLE]
6. The Growth Parameter
Recall from Chapter 4 that we proved the following asymptotic
[TABLE]
The exponent was the unique solution to the pressure equation
[TABLE]
In other words, the function (where is the maximal eigenvalue of on ) is strictly decreasing in and .
We will make use of the fact that is arbitrarily close to as in a later section. Therefore, we now show that as . In order to proceed, we need to consider the action of the transfer operators on a different space where it becomes easier to compare for varying .
Previously, we have considered transfer operators on the subshift of finite type . In order to show that as , we will need to compare the dynamics in to that of the subshift on a countable alphabet .
Recall the set of admissible words in the countably infinite alphabet is
[TABLE]
We work in the space of Hölder continuous functions with the norm
[TABLE]
Also let be the space of continuous functions endowed with the sup norm. Consider the infinite transfer operator
[TABLE]
where the distortion function is the same as before: . In order to establish that is a bounded linear operator, we need that is summable, i.e.
[TABLE]
In the interior of each one-cylinder, is defined as and so . This bounds our weights by
[TABLE]
For each lattice point in falling in , we have between two and six adjacent one-cylinders. This gives
[TABLE]
So, for to be summable, it suffices that
In place of the irreducible and periodic properties of the finite subshifts , we must now have that is finitely primitive. In other words, there exists some and finite subset such that for each there is some such that is admissible. This is clear from the proof we provided for the irreducibility of . We divided the one-cylinders into eight regions, each containing a full square. The image of each under contained two squares which in turn maps to the full region. Thus, we can choose of size .
With these properties, we may apply the Perron-Frobenius theory for subshifts on a countable alphabet. See [MU01] or [MU03] for proof of the following theorem
Theorem 16**.**
For the infinite transfer operator , as long as , we have
- (1)
The spectral radius of acting on either or is 2. (2)
* is a simple eigenvalue and has a corresponding eigenfunction which is positive.* 3. (3)
The remainder of the spectrum on is in a disc centered at [math] with radius strictly smaller than .
where denotes the pressure function:
[TABLE]
Note that the topological pressure is increasing in and there is a unique 0. Combining [Sul84] with [Ser81], we have that this value is the critical exponent which is equal to the Hausdorff dimension of the limit set of which is 2 (since the limit set has non-zero Lebesgue measure). Thus, .
Information about will follow from Keller-Liverani Perturbation Theorem (see Appendix A of [PU18] or [LV98] for proof.)
We will work in the setting of the two norms in the Banach space . Define
[TABLE]
and consider a family of operators compared to some ‘limit operator’ . The next theorem will require the four following conditions:
- (1)
There are such that for all ,
[TABLE]
. 2. (2)
There are such that for all ,
[TABLE]
. 3. (3)
If , then is not in the residual spectrum of . 4. (4)
as .
Although the full Keller-Liverani Perturbation Theorem provides more refined information about the spectrum of and , we only need the following
Theorem 17**.**
Assume the family and satisfy conditions (1)-(4) above. If is a simple, isolated eigenvalue of , then for every sufficiently large , there exists a unique simple eigenvalue of such that
[TABLE]
We will apply the theorem to the following family: . In other words, we’ll only sum over the one-cylinders in . Conditions (1) and (2) follow from and . Condition (3) is automatically satisfied by our choice of in . In particular, the unit ball in is -compact by Ascoli’s theorem (see [PP90].) Therefore, we must now only establish property (4).
6.0.1. Perturbation estimates for large alphabets
Assuming , we have
[TABLE]
So the Keller-Liverani perturbation theorem implies as when . Since and is analytic in for fixed we have that the solution to lies in an epsilon neighborhood of for large enough .
Finally, we must relate the eigenvalues of on to those of on . It suffices to show that
[TABLE]
since the left hand side is the log of the lead eigenvalue for on and the right hand side is the log of the lead eigenvalue of on
Combining the fact that the diameter of an cylinder is at most with bounded distortion, we have
[TABLE]
where the bound is uniform over for fixed . Inserting this into gives
[TABLE]
For and , bounded distortion yields . So,
[TABLE]
7. Construction of the Multilinear Sifting Set
Recall from Chapter 3, that the set of finite admissible words
[TABLE]
represents closed geodesics in . Specifically, when we restrict to aperiodic words in we have an exact correspondence. In order to detect whether a geodesic is fundamental, we will need to use the correspondence between closed geodesics and hyperbolic matrices in . We define
[TABLE]
where is the cylinder and , the Pollicott map, acts as a fractional linear transformation locally on that cylinder. Therefore, we may express the correspondence between and closed geodesics (as primitive hyperbolic matrices in ) as
[TABLE]
In order to develop an asymptotic estimate for
[TABLE]
we will use the multilinear structure coming from .
In order to construct a large set of geodesics with the desired expansion properties, we specify the general expansion result from a previous chapter, so that we have a fixed radius and corresponding spectral gap :
Theorem 18**.**
There is an absolute (fixed throughout the remaining sections) and such that for any square-free
[TABLE]
as where
[TABLE]
We also have from Chapter 4 that . In order to increase the size of the sifting set, we embed inside a larger subset of geodesics. In particular, define
[TABLE]
while
[TABLE]
We would like to construct a set which is the product of , and such that any combination of three elements from the respective sets gives a unique geodesic. To this end, we recall the notation from page 5. Specifically, if denotes the admissible concatenation of two finite words. There are two possible issues we must address:
- (1)
For each , , , the concatenation may not be admissible. 2. (2)
For each , , , the concatenation may not be unique. Since the length of words in may vary it is possible that the same product may occur at different concatenation spots.
To avoid (2), we establish a uniform length of the words in and . For (1), we will add a universal transition between and as well as and .
In , wordlength is commensurate with the log of the norm. Specifically, for we have . Since
[TABLE]
there is some so that
[TABLE]
has size . Similarly, we can find and
[TABLE]
of size .
Finally, we address the issue that may not be an admissible concatenation in . Recall from Chapter 3 that is irreducible and aperiodic as long as . In the course of proving these properties, we showed that for any two states in . Therefore for any two words there is a word of length such that . Note that only depends on the final letter of and the first letter of . So we can arbitrarily choose a dictionary of three letter words such that is admissible and abbreviate the new word as . Thus, we define our sifting set as
[TABLE]
Since there is some universal such that where .
Write
[TABLE]
where is a sum over real and ranges over all characters of of order . We will now separate the sum into characters of small and large order.
8. Small Divisors
We estimate
[TABLE]
Expand from the definition of the sifting set and partition into residues classes in :
[TABLE]
Now, using Theorem 18 from page 18 we write where
[TABLE]
First, we address :
[TABLE]
Back to , we want to sum over all divisors of , not only the small ones. So, we reintroduce the large divisors by writing where
[TABLE]
Observe that we collapsed the sums over and since they only reindex the sum over .
Now, define
[TABLE]
Lemma 6**.**
For ,
[TABLE]
Proof.
We may as well assume , the case when is similar. We partition into two cases according to whether or not :
- (1)
: In this case, we must have hence . This only happens when has a root in . Examining the discriminant, we see that there is exactly one solution. So, there’s only one choice for and . There are choices for . 2. (2)
: There are nonzero choices of . In this case, there are choices for after which is determined. The determinant equation implies .
Combining the two cases, we have total matrices in with trace . ∎
Therefore, we have
[TABLE]
We can rewrite
[TABLE]
Above, we used the Chinese Remainder Theorem to count satisfying . As long as we will have are distinct which gives two solutions to . If , then we only have one solution.
Finally, we bound . Note that so
[TABLE]
Then .
9. Large Divisors
We first need to establish the existence of a smooth cutoff function which will allow us to extend sums over and to all of .
9.1. Spectral Theory of the Laplace Operator
The Laplacian acts on . There are a finite number of discrete eigenvalues in :
[TABLE]
In , there is the continuous spectrum as well as the remaining part of the discrete spectrum (see [Sel56] or [Sar83].) For the congruence subgroup we have the analogue of Selberg’s -Theorem: (see [Sar83] or Theorem 6.1 of [EGM13] for proof.) In other words, .
Denote , ,
[TABLE]
where is a complementary series representation of parameter and does not weakly contain any complementary series representation of parameter .
The following is standard, see [BK14] or [KO11].
Theorem 19**.**
Let and be a unitary representation of G which does not weakly contain any complementary series representation with parameter . Then for any right -invariant vectors
[TABLE]
as .
We pick a nonnegative smooth bump function satisfying . The support of is in a ball about the identity of (tiny) radius . For large , we define our indicator function on as
[TABLE]
With small enough, we have
[TABLE]
Since the support of is within a ball of radius , we have the following
[TABLE]
Now, we wish to establish that assigns roughly equal weights to residue classes in .
Proposition 1**.**
For squarefree and , we have
[TABLE]
We follow along with the proof found in [BK14].
Proof.
[TABLE]
Define
[TABLE]
so that we have the following identity (via a standard folding and unfolding argument):
[TABLE]
Where denotes the inner product on . Now, decompose the matrix coefficient into the following
[TABLE]
where denotes projection onto the old forms and is orthogonal.
Claim 1:
If denote the oldforms for the spectrum below , then we can rewrite them as normalizations of the eigenfunctions at level one:
[TABLE]
The rest follows from folding and unfolding.
Claim 2:
Since is fixed and has ’bounded’ support, we have (and similar for ). So, Theorem 19 gives
[TABLE]
Thus, we have shown
[TABLE]
When we use the same argument, setting , the theorem follows from
[TABLE]
∎
9.2. Character Sums
Proposition 2**.**
Suppose is a rational prime and lies over , has order and satisfies (component-wise.) We have
[TABLE]
Proof.
We may as well assume , otherwise we could alter the following argument on .
We now partition all into two cases, either or . If , then implies and is anything. Since ranges over all , we have
[TABLE]
On the other hand if , then we can pick any which imply so
[TABLE]
Now, note that
[TABLE]
Hence
[TABLE]
Now, since , we have a nontrivial Kloosterman sum (or perhaps a Ramanujan sum if .) Regardless of whether is split or inert, we have
[TABLE]
When splits, this is just the Weil bound. When is inert, see Theorem 5.45 of [LN97]. ∎
From Proposition 2, we have the following
Corollary 2**.**
For square-free , a character of of order and , we have
[TABLE]
Proof.
Pontryagin duality allows us to express as a product of characters of prime order. Apply Proposition 2 to each term. ∎
Now, we combine this bound with our indicator function :
Proposition 3**.**
For square-free and a character of order , we have
[TABLE]
Proof.
Partition over residue classes over and apply Proposition 1:
[TABLE]
∎
9.3. Large Divisors
Define
[TABLE]
Our goal is to bound
[TABLE]
where the sum ranges over square-free Gaussian ideals up to norm and captures the argument of . In order to interchange the order of and in we introduce
[TABLE]
for real and . Insert into :
[TABLE]
where the sum is over all square-free .
We now restrict our attention to short intervals in and fixed , i.e.
[TABLE]
where we introduced to capture the absolute value of each term. Now apply Cauchy-Schwarz in the parameter:
[TABLE]
The support of is within , so we replace sequences in with matrices in as follows
[TABLE]
where we have replaced the trace of with the dot product since
[TABLE]
Opening the square, we have
[TABLE]
We would like to combine and . Let be the least common multiple and , be the primes distinct to and respectively. If and we have
[TABLE]
If , then we may not have . So, remove common factors to get . If represents all the factors we removed from , then notice
[TABLE]
Multiply (on the left) by to remove . Take determinants of both sides and since , we get
[TABLE]
Now, so . Similarly, . So, we can find some such that
[TABLE]
which satisfies by the squared congruence relation above - there are only such . We also have .
Back to our estimate of , partition the sum over and via their least common multiple as follows:
[TABLE]
Since the support of is in , we replace the second sum over with one over via :
[TABLE]
Now, we apply our bounds for the smoothing function :
[TABLE]
There are at most choices for and then choices for . Therefore,
[TABLE]
Now, we use the fact that and similarly to insert and :
[TABLE]
So, we get the following
Theorem 20**.**
[TABLE]
Summing over and gives
Theorem 21**.**
[TABLE]
10. Sieve Theorem
We have
[TABLE]
where
[TABLE]
Recall that , and are fixed constants coming from Theorem 18 page 18. By our construction of the sifting set (in which and depend on but does not), as we send we can get arbitrarily close to 2 while , , and remain constant.
For and we need , and , where . For we need
[TABLE]
Observe from the last inequality that taking near and near , we must have . In order to achieve this level of distribution, we set and assume for now that . In order to have we set .
For the remaining parameters, we set
[TABLE]
so that . Moreover if we have
[TABLE]
Hence the three inequalities for are satisfied. We get a power savings in each error term except where we save an arbitrary power of log. This proves the level of distribution for the following
Theorem 22**.**
For sufficiently small , there is a large enough so that has level of distribution . In other words, there exists a multiplicative function satisfying
[TABLE]
for any and a decomposition
[TABLE]
so that for all
[TABLE]
Moreover, when
[TABLE]
we have
[TABLE]
Proof.
We must show that the sieve dimension is 2. The following summation formulas for primes in arithmetic progressions are consequences of Mertens work in [Mer74]:
[TABLE]
For Gaussian primes, we only need the first equality:
[TABLE]
Since for all , we have
[TABLE]
The second exponential is negligible since
[TABLE]
where we have defined
[TABLE]
Since converges and partial summation gives . Hence
[TABLE]
∎
From Theorem 22 and the Fundamental Lemma of sieve theory (see Lemma 6.3 of [IK04]) we have the following:
Theorem 23**.**
Define
[TABLE]
We have
[TABLE]
11. Final Estimates
We have the lower bound
[TABLE]
On the other hand,
[TABLE]
We will examine the last term
[TABLE]
more closely. If , then we can find a prime with . On one hand, factors as so . On the other hand, implies . Therefore,
[TABLE]
where we trivially bounded the trace multiplicity, i.e.
[TABLE]
So, as long as , we have:
Theorem 24**.**
There is an such that as we have
[TABLE]
We now select discriminants which contribute the most to the count above. Define
[TABLE]
and
[TABLE]
Proposition 4**.**
For any there is a large enough so that
[TABLE]
Proof.
The previous theorem gives
[TABLE]
where is a parameter of our choice. Trivially, we have . So,
[TABLE]
Now, set and the claim follows. ∎
For any , we can find small and large so that
[TABLE]
The choice of gives our compact region (geodesics do not visit the cusp when their symbolic encodings have small entries.) We define
[TABLE]
which gives a subset of all fundamental discriminants. The previous claim gives us a lower bound for the number of these discriminants:
[TABLE]
Moreover, for each discriminant ,if then
[TABLE]
Thus, after renaming constants we have proved Theorem 1, which we restate here:
Theorem 25**.**
For any , there is a compact region and a set of fundamental discriminants such that
[TABLE]
and for all ,
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BGS 10] Jean Bourgain, Alex Gamburd, and Peter Sarnak. Affine linear sieve, expanders, and sum-product. Inventiones mathematicae , 179(3):559–644, 2010.
- 2[BGS 11] Jean Bourgain, Alex Gamburd, and Peter Sarnak. Generalization of Selberg’s 3 / 16 3 16 3/16 -theorem and affine sieve. Acta mathematica , 207(2):255–290, 2011.
- 3[BK 14] Jean Bourgain and Alex Kontorovich. The affine sieve beyond expansion I: Thin hypotenuses. International Mathematics Research Notices , 2015(19):9175–9205, 2014.
- 4[BK 17] Jean Bourgain and Alex Kontorovich. Beyond expansion II: low-lying fundamental geodesics. Journal of the European Mathematical Society , 19(5):1331–1359, 2017.
- 5[BKM] J Bourgain, A Kontorovich, and M Magee. Thermodynamic expansion to arbitrary moduli, 2015. ar Xiv preprint ar Xiv:1507.07993 , 9.
- 6[CU 04] Laurent Clozel and Emmanuel Ullmo. Equidistribution des points de Hecke, contributions to automorphic forms, geometry, and number theory, 193254, 2004.
- 7[Duk 88] William Duke. Hyperbolic distribution problems and half-integral weight Maass forms. Inventiones mathematicae , 92(1):73–90, 1988.
- 8[EGM 13] Jürgen Elstrodt, Fritz Grunewald, and Jens Mennicke. Groups acting on hyperbolic space: Harmonic analysis and number theory . Springer Science & Business Media, 2013.
