Patterns of primes in the Sato-Tate conjecture
Nate Gillman, Michael Kural, Alexandru Pascadi, Junyao Peng, Ashwin, Sah

TL;DR
This paper proves bounded gaps between primes where the normalized Frobenius traces of a non-CM elliptic curve fall within certain intervals, extending classical prime gap results to the Sato-Tate distribution context.
Contribution
It establishes bounded gaps for primes in the Sato-Tate distribution and generalizes the Green-Tao theorem to these primes, supported by a Bombieri-Vinogradov type theorem.
Findings
Bounded gaps for primes in the Sato-Tate distribution for most intervals.
Extension of Green-Tao theorem to Sato-Tate primes.
Development of a Bombieri-Vinogradov type theorem for these primes.
Abstract
Fix a non-CM elliptic curve , and let denote the trace of Frobenius at . The Sato-Tate conjecture gives the limiting distribution of within . We establish bounded gaps for primes in the context of this distribution. More precisely, given an interval , let denote the th prime such that . We show for all for "most" intervals, and in particular, for all with . Furthermore, we prove a common generalization of our bounded gap result with the Green-Tao theorem. To obtain these results, we demonstrate a Bombieri-Vinogradov type theorem for Sato-Tate primes.
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.
\newfloatcommand
capbtabboxtable[][\FBwidth]
Patterns of primes in the Sato–Tate conjecture
Nate Gillman
Wesleyan University, Middletown, CT 06459, USA
,
Michael Kural
Massachusetts Institute of Technology, Cambridge, MA 02139, USA
,
Alexandru Pascadi
University of California, Los Angeles, CA 90095, USA
,
Junyao Peng
Massachusetts Institute of Technology, Cambridge, MA 02139, USA
and
Ashwin Sah
Massachusetts Institute of Technology, Cambridge, MA 02139, USA
Abstract.
Fix a non-CM elliptic curve , and let denote the trace of Frobenius at . The Sato–Tate conjecture gives the limiting distribution of within . We establish bounded gaps for primes in the context of this distribution. More precisely, given an interval , let denote the th prime such that . We show for all for “most” intervals, and in particular, for all with . Furthermore, we prove a common generalization of our bounded gap result with the Green–Tao theorem. To obtain these results, we demonstrate a Bombieri–Vinogradov type theorem for Sato–Tate primes.
1. Introduction
Let be an elliptic curve without complex multiplication (CM), and for each prime , let denote the trace of the Frobenius endomorphism of . The Sato–Tate conjecture for , recently proven by Barnet-Lamb, Geraghty, Harris, and Taylor [2], states that the distribution of is governed by the Sato–Tate measure . Explicitly, for , we have
[TABLE]
One can now study the distribution of primes with constraints on their trace of Frobenius. Namely, we choose an interval and consider the set of primes such that .
There have been several important recent advances in the study of gaps between primes. Building on the seminal work of Goldston, Pintz, and Yıldırım [13], Zhang [37] proved that
[TABLE]
where denotes the th prime. Shortly thereafter, using more combinatorial methods, Maynard [19] synthesized the GPY framework with -dimensional variant of the Selberg sieve, which allowed him to prove that for every . He also strengthened Zhang’s result to . Independently, Tao (unpublished) developed the same variant of the Selberg sieve, but arrived at a slightly different conclusion. (Soon after, Polymath 8b [26] improved this bound to .) Various authors have adapted the Maynard framework to establish bounded gaps between primes in distinguished subsets, such as primes in Beatty sequences [1], and primes with a given Artin symbol [34].
In this paper, we synthesize the Sato–Tate conjecture and the aforementioned work on gaps between primes. Our main result is too technical to state here, so for now we state a special case for the sake of simplicity.
Theorem 1.1**.**
Let be a non-CM elliptic curve, and let be a closed interval such that . Denote by the set of all primes satisfying , and let be the th prime in . There is a constant (independent of ) such that for any positive integer , we have that
[TABLE]
Remark*.*
As Theorem 3.3 will show, there exist intervals with for which our result still applies. In fact, as justified in Lemma A.3, our more general theorem holds for over of intervals , if the endpoints are sampled according to the Sato–Tate distribution.
Example**.**
Consider , which has Sato–Tate measure . For any non-CM elliptic curve , we have
[TABLE]
This explicit bound is computed using Theorem 3.3 in Example A.2.
In the spirit of the Green–Tao theorem, which states that subsets of the primes with positive upper density contain arbitrarily long arithmetic progressions, we can prove a refinement of Theorem 1.1 by adapting methods of Pintz [23, 24, 25] and Vatwani and Wong [35]. Again, we shall only state a special case of our result; a more general version is given in Theorem 4.5. To state this result, recall that a set of nonnegative integers is admissible if, for any prime , there exists an integer such that for all .
Theorem 1.2**.**
If is a non-CM elliptic curve, and is a closed interval such that , then there is a constant (independent of ) such that for all the following holds. Given any admissible set of size , there exists an -element subset of such that there are arbitrarily long arithmetic progressions in the set
[TABLE]
Remark*.*
By a slight alteration of our argument, one can show that Theorem 1.1 and Theorem 1.2 hold in the more general setting when the traces come from a non-CM holomorphic newform of positive even integer weight.
1.1. Overview of argument
The approach of Maynard to proving bounded gaps between primes involves the careful estimation of weighted counts of primes. In the Sato–Tate setting, there is a further constraint: we require that the normalized traces of the primes lie in . To control the indicator function , one might first note that the set of Chebyshev polynomials of second kind is an orthonormal basis of . Thus, considering the Fourier expansion of with respect to this basis, one might analyze the basis elements individually. However, this strategy faces substantial difficulties due to a lack of understanding of the symmetric power -functions associated to .
As we will see in Section 5, we need to know that these -functions are automorphic in order to carry through the estimates. Currently, automorphy has only been proven for when , although it is conjectured to hold for all . The case of is precisely the modularity theorem established by the combined work of Wiles [36]; Taylor and Wiles [33]; Diamond [9]; Conrad, Diamond, and Taylor [6]; and Breuil, Conrad, Diamond, and Taylor [3]. The values follow from automorphy lifting theorems for symmetric powers of cuspidal automorphic representations of : is due to Gelbart and Jacquet [12], to Kim and Shahidi [17], to Kim [16], and to Clozel and Thorne [4, 5]. (In contrast, potential automorphy is known for all [2].)
Accordingly, for an unconditional result, we can only afford to use an approximation of by polynomials of degree up to . We will choose this approximation to be a minorant . The idea of using such a polynomial minorant to obtain unconditional results appears in [18]. Because of these considerations, we establish our results unconditionally precisely for those intervals such that is minorizable by a polynomial of degree at most with positive average against . (Appendix A gives a more technical discussion of minorizing indicator functions by polynomials with these constraints.) Assuming automorphy for all , our results hold for all intervals .
We now explain the structure of our paper. In Section 2, we first state the number-theoretic results that are required to adapt the general frameworks of Maynard and Pintz to the Sato–Tate setting; namely, we need versions of the prime number theorem and the Bombieri–Vinogradov theorem for Sato–Tate primes. We will assume these inputs in Section 3 to establish a more general version of Theorem 1.1, our bounded gaps result. Similarly, in Section 4 we prove a more general version of Theorem 1.2, the synthesis of our bounded-gap result with the Green–Tao theorem, assuming the results of Section 2.
All the subsequent sections are dedicated to proving the theorems in Section 2. Towards this, in Section 5 we begin our technical discussion of symmetric power -functions. Section 6 discusses bounds on coefficients and values of -functions, estimates required for proving our analogues of the Siegel–Walfisz and Bombieri–Vinogradov theorems. Section 7 establishes the Siegel–Walfisz theorem in the Sato–Tate setting, using a zero-free region and an analogue of Siegel’s theorem for symmetric power -functions, which follows from the work of Molteni [20]. Finally, in Section 8 we complete the proof of our Bombieri–Vinogradov type estimate, adapting methods of Murty and Murty [21].
1.2. Conventions
Throughout this paper we shall use the following notation. We will use the variable to index primes in sums and products. Given two functions , we say that , or , if there exists a constant such that ; the subscript versions , imply that the constant may depend on . Similarly, we may use , or to denote constants that depend on . For a positive integer , its radical is defined as , and denotes the smallest prime divisor of . As usual, is the Möbius function, is the Euler totient function, and is the prime counting function. Additionally, denotes the indicator function of a set .
2. Number-theoretic inputs to bounded gaps
Let be a fixed elliptic curve without CM. For each prime , has a trace of Frobenius , where . We consider primes with , where is a fixed, closed subinterval of ; we denote this set of primes by .
As discussed in Section 1.1, we consider a minorizing polynomial of bounded degree, following [18]. This will suffice for our applications on bounded gaps, as we will see in our adaptation of the Maynard framework in Section 3. We shall expand with respect to the basis of Chebyshev polynomials of the second kind, which are defined as
[TABLE]
We use these polynomials due to their relationship to symmetric power -functions, detailed in Section 5; specifically, is the coefficient of in for not dividing the conductor of . One can easily show that is a polynomial of degree , and that . Also, the Chebyshev polynomials form an orthonormal family with respect to the Sato–Tate measure; in particular, we have
[TABLE]
so that integration against picks up the coefficient of in the representation of a polynomial in a basis of ’s. Now if our minorizing polynomial has degree , we can write it as
[TABLE]
where . The Sato–Tate average of will show up in the factor of the main terms in our analogues of the prime number theorem and the Bombieri–Vinogradov theorem, and ultimately in the choice of a positive parameter; therefore we require that . This condition is central to our argument, hence we formalize it in the following definition.
Definition 2.1**.**
For , we say111This notation is introduced in [18]. that a closed interval is -minorizable if there exists some polynomial of degree at most with and which lower bounds in the range .
To extract estimates involving from its corresponding -function for , we make the following assumption, which justifies Definition 2.1.
Assumption 2.2**.**
The symmetric power -functions of a non-CM elliptic curve are automorphic for .
Remark*.*
Recall from Section 1.1 that 2.2 has been proven for .
We shall now state the necessary number-theoretic results with weights given by the Chebyshev polynomials , and then take linear combinations to obtain analogous results about . The following analogue of the prime number for Chebyshev polynomials of the second kind is a consequence of [15, Theorem 5.13], as detailed in Section 7.
Theorem 2.3**.**
Let be a non-CM elliptic curve and . Assuming that is automorphic, we have
[TABLE]
This implies the following prime number theorem for .
Corollary 2.4**.**
Under 2.2, we have that
[TABLE]
Proof that Theorem 2.3 implies Corollary 2.4.
By 2.2 we have
[TABLE]
which gives the desired estimate. ∎
Next, we state an analogue of the Bombieri–Vinogradov theorem for the Chebyshev polynomials of second kind, to be proven in Section 8.
Theorem 2.5**.**
Let be a non-CM elliptic curve and . Assume that is automorphic. Then for any , and for all , we have
[TABLE]
This allows us to deduce a similar estimate for minorizing functions of suitable intervals.
Corollary 2.6**.**
Under 2.2, we have that for any and for all , we have
[TABLE]
Proof that Theorem 2.5 implies Corollary 2.6.
By 2.2, we have
[TABLE]
Taking the supremum over and averaging over moduli less than , we can bound the first term using the original Bombieri–Vinogradov theorem, and the second using Theorem 2.5. ∎
In the next two sections, we will use these estimates to derive our results on bounded gaps between primes from a Sato–Tate interval, and on patterns of such primes in the context of the Green–Tao theorem. Subsequently, it will only remain to prove Theorems 2.3 and 2.5 (see Section 7, respectively Section 8).
3. Bounded gaps for Sato–Tate
In this section, we adapt the work of Maynard [19] in order to establish bounded gaps among the primes in , for suitable intervals. Following the notation in Section 2, let be a minorizing polynomial of an interval , with Sato–Tate average and degree . Let be a non-CM elliptic curve with normalized traces , and suppose that it satisfies 2.2.
Fix an admissible set . We define
[TABLE]
for nonnegative weights to be chosen. Note that although we have not defined when is not prime, its value does not matter unless is prime, due to the presence of the indicator function ; hence we use the notation above for brevity. By our choice of , we have:
[TABLE]
Our goal is to show that for sufficiently large . This would imply that there are infinitely many such that at least of the are prime and, in fact, lie in .
Now define and ; note that by the prime number theorem, . Take large enough such that for all , . By admissibility of , we can choose such that for all . We define our weights by
[TABLE]
where we choose in Proposition 3.1. Then we let
[TABLE]
so that . Towards showing that this difference is positive for large , we have the following estimates, analogous to those in [19, Proposition 4.1].
Proposition 3.1**.**
Suppose that 2.2 holds true, and let . Let for some small fixed . Let be a smooth function supported on , and define
[TABLE]
In particular, unless is at most , coprime with , and squarefree. Then we have that
[TABLE]
where and are iterated integrals defined in [19, Proposition 4.1], and we assume that they are positive.
Remark*.*
Since coincides with Maynard’s notation [19], only the estimate for our is new.
Remark*.*
The errors in the asymptotics of and above are in fact with an absolute implied constant, and in this section we take . However, the terms are valid even when is a large enough constant depending only on and ; we will need this different choice in Section 4.
Proof.
In light of [19, Proposition 4.1], it suffices to consider . The implied constants in what follows will depend on and . Also, we will often write and instead of and respectively, for brevity. Let us decompose , where we define
[TABLE]
As in the proof of [19, Proposition 4.1], the sum restricts to the case when are all coprime. In that case, by the Chinese remainder theorem, the sum can be rewritten with lying in a single residue class mod . Moreover, the inner sum (weighted by ) is seen to vanish unless , and in that case must be coprime with . For such and , the inner sum becomes
[TABLE]
Note that one has
[TABLE]
since is finite and is bounded (it is a polynomial on a compact interval). We denote
[TABLE]
Putting these together, we have
[TABLE]
Plugging this into and using the multiplicativity of , this implies
[TABLE]
where denotes the restriction that all are pairwise coprime.
We first bound the error term using Corollary 2.6. As in [19, (5.9)] we have , where and is defined as in [19, Lemma 5.1]. This gives a bound for , and we can restrict the range of possible ’s to squarefree . But for any given squarefree , there are at most choices of such that , where is the number of ways to write as a product of positive integers. Thus we get an error term of
[TABLE]
By Cauchy–Schwarz, as well as the trivial bound , we get an error of
[TABLE]
Note that . The middle factor is bounded by . By Corollary 2.6, we have that the last factor is bounded by for all . So the total error is , concluding our analysis of the error term. But the main term in our expression of is exactly the same as [19, (5.18)]. Hence, our asymptotic for is precisely
[TABLE]
This finishes the proof. ∎
Next, we obtain a result analogous to [19, Proposition 4.2], which is the final technical result before proving bounded gaps in Sato–Tate intervals.
Proposition 3.2**.**
Suppose that an interval is -minorizable for some by a polynomial with average against . Assume the hypothesis and notation of Proposition 3.1, and let be an admissible set. Denote by the set of all Riemann-integrable real functions supported on . Define
[TABLE]
Then there are infinitely many integers such that at least of the numbers lie in .
Proof.
This is the same argument as in [19, Proposition 4.2] mutatis mutandis, where one must account for the extra factor of coming from the estimate of . ∎
Using the last two propositions, we are ready to prove Theorem 3.3, our main result on bounded gaps in Sato–Tate intervals.
Theorem 3.3**.**
Suppose that an interval is -minorizable, for some , by a polynomial with average against . Let be a non-CM elliptic curve, and assume that is automorphic for all . Define . Then for every positive integer , we have
[TABLE]
where the implied constant is absolute.
Proof.
By Proposition 3.2, it suffices to find an admissible tuple and choose some such that
[TABLE]
for some with . In particular, it suffices to choose and some , depending on , such that . On the other hand, by [26, Theorem 23] there is an absolute, effective constant such that for all . In light of this, we choose
[TABLE]
We can take by letting contain the first primes greater than . It follows that
[TABLE]
hence we have bounded gaps of size
[TABLE]
for all . ∎
Proof of Theorem 1.1.
Choose , so that is automorphic for all and for all non-CM elliptic curves [5]. By the computations in Lemma A.4, all intervals with can be minorized as in the hypothesis of Theorem 3.3. Hence Theorem 1.1 follows for large enough (note that and only depends on ). ∎
4. Green–Tao for patterns of Sato–Tate primes
Our goal in this section is to prove Theorem 1.2, an analogue of the Green–Tao theorem in the setting of Sato–Tate primes in bounded gaps, assuming the results in Section 2. In fact, we will prove a more general version of this result, stated in Theorem 4.5. Our proof relies on methods developed by Pintz [23] and Vatwani and Wong [35].
We recall our setup. We fix , a non-CM elliptic curve over , and , a closed interval in which is minorized by the polynomial 2.2 with , where satisfies 2.2. We choose as the “level of distribution of ”, and is a small constant. We fix an admissible set. For a positive integer , let . Let , and be defined as in Proposition 3.1, taking to satisfy the same hypotheses. However, will be chosen as a sufficiently large constant depending only on , rather than .
We first state a theorem of Pintz which characterizes a sufficient condition for the existence of arithmetic progressions of arbitrary length.
Theorem 4.1** ([23, Theorem 5]).**
Let be an admissible set, and suppose that a set of positive integers satisfies the two conditions
[TABLE]
for some constants . Then for every positive integer , contains infinitely many -term arithmetic progressions.
In light of Theorem 4.1, the proof of Theorem 4.5 now reduces to finding a suitable subset of size as well as that satisfies all conditions of this theorem. Our approach follows that of Vatwani and Wong [35], replacing Chebotarev sets of primes with Sato–Tate prime sets . Recalling the definitions of and in 3.1, we define, for a constant , the following sub-sums:
[TABLE]
In other words, is the contribution to coming from those terms such that some has a prime factor less than .
We now provide a roadmap for the remainder of this section. Following this paragraph we state Lemma 4.2, which will help bound and . These estimates will imply that the main contribution to the sums come from those terms such that has large prime factors for all . In this way, we will be able to bound from below the quantity of with . Subsequently, Propositions 4.3 and 4.4 will lead to a suitable choice of and which satisfy the hypotheses of Theorem 4.1. Finally, we will conclude this section with a proof of Theorem 4.5.
Lemma 4.2**.**
Given any , define . For any and any prime , we have for sufficiently large (in terms of ) that
[TABLE]
Remark*.*
The function here, which satisfies the hypotheses of Proposition 3.1, must in fact be smooth on all of . Note we can later choose to be sufficiently close to the choice in Maynard [19] and Polymath 8b [26], since these smooth functions well-approximate Riemann-integrable functions supported on the simplex.
Proof.
Note that if then the sum is in fact empty by definition of . We now assume . Without loss of generality, let . By definition, we have
[TABLE]
where indicates that we are restricting the sum such that for and for all . We do this because it can be checked that these are precisely the conditions (beyond the support restrictions on ) necessary to have the inner sum furthest to the right of the top line be nonempty and resolve into a single residue class. We are implicitly using the lower bound on .
Since and , while as in Maynard [19], this error term is negligible. Let the sum in the main term be denoted . Now define , supported only on squarefree integers, such that on those values. We can easily check that is multiplicative, and for prime . Hence define for prime , extending via multiplicativity and letting it be zero on non-squarefree integers. We see that always, and that if is squarefree, then . Thus, since the support is restricted to squarefree (with bounded product and relatively prime to ), we see
[TABLE]
using the same technique as in Maynard [19]. Here means that only the condition for is maintained.
We now restrict the to be coprime to and , since terms with not coprime to or give zero by the support restrictions. Similarly, we can restrict to coprime to when and . Furthermore, note that for means that all , so we restrict in this way as well. Denote summation over with these restrictions by . Furthermore, since when , and since for by the other restrictions above, we can restrict the summation over so that for all . This allows us to compute as follows.
[TABLE]
where , , and where we define the quantity
[TABLE]
which is supported only on such that is less than , squarefree, and coprime to .
Note that division by factors of (which are potentially zero) is not invalid here, as we have restricted summation appropriately. Additionally, we used that and agree on squarefree numbers relatively prime to . This also implies that if , in we can turn the into a without consequence.
Now we bound the remaining sum Section 4 by
[TABLE]
where . Now we compute in terms of , recalling that we chose in the proof of Proposition 3.1 by choosing
[TABLE]
to be
[TABLE]
for such that is at most , squarefree, and relatively prime to ; otherwise. Here is our chosen smooth function. For define
[TABLE]
where is the vector of length with coordinates . We compute for that
[TABLE]
Noting that is the identity for squarefree numbers not divisible by , we now have for that
[TABLE]
We now return to the bounding. Since is smooth and compactly supported, by the mean value theorem we obtain
[TABLE]
[TABLE]
Hence, our sum is bounded in absolute value as
[TABLE]
Thus our original expression is bounded as
[TABLE]
as desired. ∎
The next proposition estimates the part of the difference for which has large prime factors, which we will see comprises the dominant behavior.
Proposition 4.3**.**
Assume the notation and hypotheses from Lemma 4.2. Let be a positive integer such that , where the constant is absolute. Then there exists a choice of only depending on and and a choice of sufficiently small such that
[TABLE]
where and .
Proof.
This follows from Lemma 4.2 and the remark following Proposition 3.1. We use the same arguments as in [35, Lemmas 5.2, 5.3, and 5.4], the key points being that
[TABLE]
and that for all and . Working out the constants, this means that we can choose an appropriately large , depending only on and , and then can take small enough to ensure that the contribution from , and hence also , is small. ∎
Proposition 4.4**.**
Given and , there exists chosen sufficiently small so that the following holds: if we define
[TABLE]
then we have
[TABLE]
for some constant .
Proof.
Note first that
[TABLE]
for all positive integers . Define
[TABLE]
By the definition of , the condition implies that for each , at least of are in , so . Summing the previous inequality for different values of , we get
[TABLE]
Now suppose is such that P^{-}\bigl{(}\prod_{i=1}^{k}(n+h_{i})\bigr{)}\geq n^{c_{1}(k)} (e.g., this is true for ). Then each has all prime factors bounded below by , so that ; this puts an upper bound of the number of prime factors of , depending only on and . This yields
[TABLE]
But by our previous choice of in Proposition 3.1 we have
[TABLE]
Hence, we obtain
[TABLE]
for all such that has prime factors . Combining this with our previous bound from 4.2, we have that
[TABLE]
The second inequality above follows directly from the characterization of , since the integers with P^{-}\bigl{(}\prod_{i=1}^{k}(n+h_{i})\bigr{)}\geq n^{c_{1}(k)} that do not lie in have a nonpositive contribution to the latter sum. Now we are in a position to apply Proposition 4.3, which gives that
[TABLE]
for our large enough (chosen) value of . Recall that , so for some small . Hence we for our choice of (which depends only on ) we can write
[TABLE]
completing our proof. ∎
Now we can prove our main result on a combination of bounded gaps with Green–Tao theorem, generalizing Theorem 1.2.
Theorem 4.5**.**
Suppose that an interval is -minorizable, for some , by a polynomial with average against . Let be an admissible set. Let be a non-CM elliptic curve, and suppose that is automorphic for all . Define , and let be a positive integer with
[TABLE]
where is an absolute constant. Then there exists an -element subset of with the following property: for every positive integer , there exist infinitely many nontrivial -term arithmetic progressions of integers such that for all .
Proof.
By Proposition 4.4, the set
[TABLE]
satisfies the conditions in Theorem 4.1, hence there exist arithmetic progressions in of arbitrary length.
Let be an arithmetic progression in , where is a positive integer to be determined. By definition of , for each , there exists such that for all . We associate with the set . There are only finitely many such sets associated with the , so we can think of the situation as having the labeled by finitely many “colors”.
Since there are only finitely many colors, by van der Waerden’s theorem, for any integer , there exists sufficiently large such that there is a monochromatic arithmetic progression of length . Then for all , is associated to the same set , which is of size . Now, is also an arithmetic progression, which satisfies for all and . Finally, choose be such that appears infinitely many times in the sequence . Then satisfies Theorem 4.5, as desired. ∎
Proof of Theorem 1.2.
This is similar to the proof that Theorem 3.3 implies Theorem 1.1. ∎
5. Symmetric power -functions for elliptic curves
It now remains to prove the prime number theorem and Bombieri–Vinogradov type estimate from Section 2. Towards this, we shift our attention to symmetric power -functions for non-CM elliptic curves over . Many of the formulas in this section are concisely stated in the case of squarefree conductor in [30, Section 1].
Let be a non-CM elliptic curve over with conductor . The th symmetric power -function associated to is defined as
[TABLE]
where and are the local roots for at primes not dividing ; explicitly, and . At primes , the Satake parameters are given in [8, Appendix A.3] and have absolute value at most . When divides , the coefficient of in is given by , where is the th Chebyshev polynomial of the second kind, defined in 2.1. Moreover, taking the logarithmic derivative, we find that the coefficient of in is given by when .
Let be a Dirichlet character of modulus . The twisted -functions are defined in the usual way via Rankin–Selberg convolution:
[TABLE]
In the above formula, we shall denote the Euler factor corresponding to a general prime by
[TABLE]
It is conjectured that for all values of , can be associated to a cuspidal automorphic representation, that is, the -function is automorphic. This is known in general for , and for for suitable fields, including , as mentioned in Section 1.1. Knowing automorphy for a given value of implies the following conjecture for that , adapted from [30, Conjecture 1.1].
Conjecture 5.1**.**
Let be an integer, a non-CM elliptic curve, and a primitive Dirichlet character of modulus . Denote the conductors of and by and , respectively. Then the function
[TABLE]
is entire of order one, and there exists a complex number of modulus 1 such that
[TABLE]
where
- •
* is a positive integer satisfying and ;*
- •
* is a positive integer satisfying , , and ;*
- •
The factor is
[TABLE]
for certain constants satisfying .
Remark*.*
Assuming automorphy of , the bounds on and from 5.1 follow using [29, Section 5] and [8, Appendix A]. The local roots at primes have magnitude at most , since the local roots of both and satisfy the same bounds (see e.g. [32, (2.6)]).
Remark*.*
As mentioned earlier, 5.1 is known for .
6. Phragmén–Lindelöf and -function bounds
Here we shall derive several bounds on quantities related to symmetric power -functions, which will be essential in the proofs of Section 7 and Section 8. Throughout this section, fix and assume that is automorphic; hence 5.1 holds true in our case.
6.1. Bounds on coefficients of -functions
As described in 5.1, we have a completed function satisfying the functional equation 5.1. Rearranging this gives
[TABLE]
where is some combination of gamma factors. Since , we have
[TABLE]
Since the local Euler factors of at primes do not necessarily split into desired forms, it will be more convenient to work with the unramified part of the symmetric power -function, defined as follows:
[TABLE]
We also define the unramified part for the twisted symmetric power -function as
[TABLE]
using that for . Thus we find
[TABLE]
Then we can define
[TABLE]
noting that and are independent of . The functional equation for is
[TABLE]
where we define
[TABLE]
It will be useful to find upper bounds for and . From the form of the local roots of , one easily obtains
[TABLE]
where is the number of ways to write as an ordered product of positive integers. We will need to bound partial sums of powers of these generalized divisor functions. We have the following lemma, due to Norton [22].
Lemma 6.1** ([22, Lemma 2.5]).**
Let be a real-valued multiplicative function such that for all primes and . Then for and , we have
[TABLE]
By using and the Mertens estimate on , it is easy to use this result to bound sums of products of generalized divisor functions as expressions of the type . Combining this with partial summation will allow us to estimate very general number-theoretic sums.
6.2. Bounds on values of -functions and their derivatives
We will need bounds for the quantities and , as well as their derivatives, for some suitable ranges of . We shall bound and first. Noting that and , as well as and , only differ by some (Euler) factors at primes , we can immediately obtain the bounds of and from their counterparts.
Using Stirling’s formula and the explicit form of the gamma factors from 5.1, we find for that
[TABLE]
Now we bound the log derivative of for . A similar method yields the estimate
[TABLE]
Combining the two inequalities gives a bound for
To obtain some estimates for the sizes of the relevant -functions on vertical strips, we shall apply the Phragmén–Lindelöf theorem. The following version is from Rademacher [27].
Theorem 6.2** (Phragmén–Lindelöf).**
Write . Suppose is a holomorphic function of finite order in the strip . Suppose further there are constants such that
[TABLE]
Then for all we have that
[TABLE]
We now bound and in the critical strip .
Proposition 6.3**.**
We have for that
[TABLE]
Proof.
From splitting the Euler product into terms and expanding, we find that
[TABLE]
Using the functional equation and our bounds on , we see that
[TABLE]
if . Note that does not have a pole, even when is trivial, as and it is order by assumption of automorphy. Thus by Theorem 6.2, we see that
[TABLE]
Choosing and using , we conclude that
[TABLE]
as desired.
Now we do the same for . By considering , using the functional equation, and multiplying, we can bound on and , and then apply the Phragmén–Lindelöf theorem. The fact that introduces an extra factor of . ∎
Remark*.*
The above bounds on and allow us to compute bounds for and , as well as and . By bounding the Euler factors at primes , if we see for any that
[TABLE]
so long as . Similar results can be obtained for the derivatives.
7. The Siegel–Walfisz theorem for symmetric powers
Following the notation from [15, Section 5], define
[TABLE]
where is the coefficient of in , equal to
[TABLE]
at prime powers and [math] elsewhere. Since, as noted, the local roots have magnitude bounded by , we have the bound
[TABLE]
where is the usual von Mangoldt function.
Lemma 7.1**.**
Let be a non-CM elliptic curve, and let be a primitive Dirichlet character of modulus . If we assume automorphy of , where , then we have whenever
[TABLE]
except possibly for one real Siegel zero when is real. This zero satisfies
[TABLE]
for any fixed .
Proof.
The zero-free region holds by [14, Theorem A.1] for and the cuspidal automorphic representation associated to . To bound , note that we have
[TABLE]
for all by [20, Theorem 2.3.2] for the -function in the -class of irreducible automorphic representations of . The hypotheses of the theorem hold (since the local roots of are bounded in magnitude by , which implies the same for ; see, for example, [31, (A.12)]). This lower bound, along with the upper bound for established in Proposition 6.3 (and the inequality from Section 6), implies the desired inequality for by the mean value theorem (as in, for example, [7, Ch. 21]). ∎
We have the following analogue of the Siegel–Walfisz theorem, which estimates .
Theorem 7.2**.**
Let be a non-CM elliptic curve, and be a primitive Dirichlet character of modulus . For any and any , assuming automorphy of , there exists a constant such that
[TABLE]
in the range .
Proof.
Given our zero-free region from Lemma 7.1, [15, Theorem 5.13] provides an analogue of the prime number theorem depending on . Adapting the cited theorem for (whose -function has no pole at by [15, p. 136]), we get
[TABLE]
for , where the term depending on should be neglected if there is no Siegel zero. Note that a stronger version of the bound on required by [15, Theorem 5.13] is true in our case, namely 7.2. Combining the domain restriction with the bound on from Lemma 7.1 implies the desired result. ∎
In particular, by taking in our analogue of the Siegel–Walfisz theorem and using partial summation, we can establish Theorem 2.3.
Proof of Theorem 2.3.
Taking to be the trivial character in Theorem 7.2, we conclude that
[TABLE]
We rewrite the left hand side as
[TABLE]
Using 7.2, the second term in the right-hand side above is bounded by
[TABLE]
which is absorbed by the error term in the estimate of . By a standard partial summation argument, we then establish that
[TABLE]
Finally, by adding back the terms corresponding to finitely many primes dividing , as well as using , we may remove the restriction and conclude our proof. ∎
8. Weighted Bombieri–Vinogradov for Sato–Tate
In this section we prove our Bombieri–Vinogradov type estimate in the sense of Theorem 2.5. The structure of our approach is similar to that of Murty and Murty [21]. First, we reduce the statement of the theorem to a similar estimate on a certain sum involving the twisted unramified part of the symmetric power -function , defined in 6.1. After this, we use Gallagher’s method to split the sum into three parts. Within the sum, some parts can be directly estimated using large sieve inequalities. The parts involving and will be further decomposed using Ramachandra’s method and estimated separately. Finally, we shall choose suitable parameters and combine all the estimates to conclude the proof of Bombieri–Vinogradov in the setting of Sato–Tate.
8.1. Initial reductions
In what follows, we will sometimes drop the dependence on and when it is clear. In order to establish Theorem 2.5, we reduce the inequality to an analogous result for log-weighted Chebyshev functions. We define
[TABLE]
We see that these are related by the orthogonality relation
[TABLE]
First we reduce Theorem 2.5 to a traditional Chebyshev function version of Bombieri–Vinogradov.
Proposition 8.1**.**
Fix and suppose we have automorphy of the th symmetric power of , where . Then for any , and for all , we have that
[TABLE]
Proof that Proposition 8.1 implies Theorem 2.5.
A standard exercise in partial summation. ∎
Note that we do not care about the dependence of this inequality on and , and it will in fact end up being ineffective due to the use of Siegel–Walfisz for Sato–Tate from Theorem 7.2. We show that if is fixed depending on , and if we have a Bombieri–Vinogradov type bound for , then we can deduce the above Proposition 8.1.
Proposition 8.2**.**
Fix and suppose we have automorphy of the th symmetric power of , where . Fix any . Then there exists an so that for all we have that
[TABLE]
Proof that Proposition 8.2 implies Proposition 8.1.
The argument is similar to the analogous result in [21], with some alterations due to positivity issues. In order to work with a nonnegative functions, we look at , where we define
[TABLE]
and then relate and as in [21]. To finish the argument, we use the regular Bombieri–Vinogradov theorem to show that the contribution of the terms does not greatly affect the estimates involved. ∎
The remainder of this section is dedicated to proving Proposition 8.2. From now on we will take and to be fixed. We will choose later. With foresight, we will take for some small .
Let denote the contour for . Using Mellin inversion, we have for any that
[TABLE]
the error coming from the contribution of the primes dividing .
8.2. Gallagher’s method and the large sieve
We use the version of the large sieve of Gallagher [11]. From now on, denotes a sum over all Dirichlet characters and a sum over all primitive characters .
Lemma 8.3** (Large sieve).**
If and , we have that
[TABLE]
We will use this to estimate certain sums related to Bombieri–Vinogradov. They will be used to handle the averaging and cancellation that is expected in the regime of large values. Write the following partial sums, defined for :
[TABLE]
Then we can write
[TABLE]
where we are suppressing the dependence. Hence, for and , we have
[TABLE]
where shifting the contour is acceptable since are holomorphic and . We thus see that the right side is an upper bound for , with an error of .
Using the large sieve, Lemma 6.1, bounds on , and partial summation to bound the resulting sums yields
[TABLE]
8.3. Ramachandra’s method for mean square estimates
It remains to bound
[TABLE]
We use a method of Ramachandra [28]. We first estimate
[TABLE]
The key identity is the following.
[TABLE]
where and , . With foresight, we choose
[TABLE]
We split the second term of (8.4) into two parts, based on whether or . The part with is holomorphic, so we can move the contour to with . This gives
[TABLE]
when , using the functional equation. We will truncate integrals to the height , as chosen above. Hence, the truncated integral of is, by Cauchy–Schwarz inequality,
[TABLE]
Let the right-hand side be . Sum over primitive characters and , and write the resulting right-hand side as in the obvious way. We use the large sieve inequality and use bounds on (see the remark following Proposition 6.3). After that, using Lemma 6.1 and partial summation, we find that
[TABLE]
We also need to bound the integral from to . We have , and thus we find
[TABLE]
Combining the above estimates and choosing as in 8.5, we obtain
[TABLE]
Now we move on to estimating
[TABLE]
The method is essentially the same. Differentiating (8.3) and split now into five terms analogous to the above. The Phragmén–Lindelöf estimate Proposition 6.3 for is bigger by a factor of ; this contributes an extra factor of , when squared, to the integral from to . Similar terms are added in to the other factors. So overall we have that
[TABLE]
8.4. Concluding Bombieri–Vinogradov for Sato–Tate
Combining (8.3), (8.7), and (8.8), we obtain
[TABLE]
Now we take with . Then if lies within the following range,
[TABLE]
we have that
[TABLE]
(If we can take without issue.) Using Theorem 7.2 and integration to convert from to , we can prove this result for as well. In our application of Theorem 7.2, we must note that the difference between and due to primes is bounded by as in Section 8.1. Thus, the following result holds.
Proposition 8.4**.**
Given hypotheses in Theorem 2.5, suppose satisfies
[TABLE]
Then we have that
[TABLE]
Now we prove a conversion result that allows us to transform this into a more manageable statement of Bombieri–Vinogradov type.
Proposition 8.5**.**
Fix and . Then for any , we have that
[TABLE]
Proof.
Similar to [21, Proposition 1.8]. ∎
Proof of Proposition 8.2.
Combining Propositions 8.4 and 8.5, and choosing small enough depending on , we immediately obtain the result. ∎
Acknowledgements
The authors wish to thank Professor Ken Ono and Professor Jesse Thorner for their guidance and suggestions. We are grateful for the support of Emory University, the Asa Griggs Candler Fund, the NSA (grant H98230-19-1-0013), the NSF (grants 1557960 and 1849959), and the Spirit of Ramanujan Talent Initiative.
Appendix A Minorization of indicator functions
Lemma A.1**.**
Let . We consider the following polynomials:
- (1)
, 2. (2)
.
If for some choice of we have for some , then is -minorizable.
Proof.
This is clear from the definition of -minorization. ∎
Example A.2**.**
Let . Then and can be -minorized by the polynomial with corresponding . To achieve bounded gaps, by Proposition 3.2, we need , i.e., . By the bound on given in [34, Proposition 4.5], we want such that
[TABLE]
so it suffices to pick and take to be the first prime numbers greater than . By [10], for , the th prime number satisfies the bound
[TABLE]
In particular, this shows that the number of primes is at most
[TABLE]
Therefore, the largest number in is at most , hence we have
[TABLE]
Lemma A.3**.**
If we sample endpoints of an interval according to the Sato–Tate measure, then with at least a chance, can be -minorized.
Proof.
We use a brute-force computer program that provides a lower bound on the proportion of intervals which satisfy the hypothesis of Lemma A.1. The idea behind our program is to use the two forms of polynomials described in Lemma A.1 as candidate minorizations of . Our implementation is as follows, with and . The notation means that the value is assigned to the variable .
Initialize and . 2. 2.
Augment each parameter , and by in nested loops from to , until one of the following cases happens:
- a.
All reach . If , set , reset for all , and repeat step 2. If , then set and reset for all , and then set . Then repeat step 2.
- b.
The assumptions of Lemma A.1 are satisfied for the current values of , and . Accordingly, increment by the quantity if . Then increment and reset and . Then repeat step 2. 3. 3.
When reaches , return the final value of .
Here, is a lower bound for the proportion of all closed subintervals in Sato–Tate measure that are -minorizable. (As we only consider the case when ; such a sample space has Sato–Tate measure .) ∎
Lemma A.4**.**
If has Sato–Tate measure , then is -minorizable.
Proof.
Modify the algorithm in the proof of Lemma A.3 as follows:
Each time that the assumptions of Lemma A.1 are satisfied for the current values of , and , we replace by the quantity if . 2. 2.
Return the final value of .
Here, is the measure of the smallest interval (in our search space) which is -minorizable. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Roger C. Baker and Liangyi Zhao. Gaps between primes in Beatty sequences. Acta Arith. , 172(3):207–242, 2016.
- 2[2] Tom Barnet-Lamb, David Geraghty, Michael Harris, and Richard Taylor. A family of Calabi-Yau varieties and potential automorphy II. Publ. Res. Inst. Math. Sci. , 47(1):29–98, 2011.
- 3[3] Christophe Breuil, Brian Conrad, Fred Diamond, and Richard Taylor. On the modularity of elliptic curves over ℚ ℚ \mathbb{Q} : wild 3-adic exercises. J. Amer. Math. Soc. , 14(4):843–939, 2001.
- 4[4] Laurent Clozel and Jack A. Thorne. Level raising and symmetric power functoriality, II. Ann. of Math. (2) , 181(1):303–359, 2015.
- 5[5] Laurent Clozel and Jack A. Thorne. Level-raising and symmetric power functoriality, III. Duke Math. J. , 166(2):325–402, 2017.
- 6[6] Brian Conrad, Fred Diamond, and Richard Taylor. Modularity of certain potentially Barsotti-Tate Galois representations. J. Amer. Math. Soc. , 12(2):521–567, 1999.
- 7[7] Harold Davenport. Multiplicative number theory . Graduate Texts in Mathematics, Vol. 74. Springer, 2nd edition, 1982.
- 8[8] C. David, A. Gafni, A. Malik, N. Prabhu, and C. Turnage-Butterbaugh. Extremal primes of elliptic curves without complex multiplication. ar Xiv:1807.05255, to appear in Proc. Amer. Math. Soc.
