On the error term in a mixed moment of -functions
Abstract.
There has recently been some interest in optimizing the error term in the asymptotic for the fourth moment of Dirichlet -functions and a closely related mixed moment of -functions involving automorphic -functions twisted by Dirichlet characters. We obtain an improvement for the error term of the latter.
Key words and phrases:
Dirichlet -functions, modular forms, moments.2020 Mathematics Subject Classification:
11M06, 11M41, 11F11, 11F121. Introduction
Heath-Brown [5] was the first to prove an asymptotic formula for the fourth moment of the Riemann Zeta function on the critical line with a power saving error term. The analogous asymptotic for Dirichlet -functions required new ideas and came much later. Young [14] proved that
(1.1) |
where is prime, restricts the sum to primitive Dirichlet characters, is the number of primitive Dirichlet characters, and is a degree four polynomial. Wu [13] obtained a power saving asymptotic for general moduli with an error term of . Blomer, Fouvry, Kowalski, Michel, and Milićević [1] revisited the problem, and introducing new ideas, they significantly sharpened Young’s error term for prime to . Later Blomer et al. [2] returned to this problem once more and used an idea of Shparlinski and T. Zhang [12] to reduce the error term even further to , and to assuming the Ramanujan Conjecture.111Actually the weaker bound is claimed on the Ramanujan conjecture at the end of section 4 in [2], but this seems to be a calculation mistake. This has also been observed in [15, Theorem 1.1] with and .
In [1], Blomer et al. also considered a related problem which is one step greater in difficulty. They established the mixed moment asymptotic
(1.2) |
for prime , where is a fixed (holomorphic or non-holomorphic) Hecke eigenform for . There has been some interest in improving the error term in this asymptotic as well. Shparlinski [11] improved the error term in (1.2) slightly to . The goal of this paper is to make a more significant improvement to this error term. In fact when is holomorphic, the quality of our error term is almost as good as the error term in the fourth moment of Dirichlet -functions. This is achieved by an idea which simplifies previous approaches to the problem in a critical range.
Theorem 1.1.
Let be an odd prime. Let for a holomorphic Hecke-cusp form, and for a Hecke Maass-cusp form, for . We have
(1.3) |
We also mention that the more difficult related asymptotic
(1.4) |
where and are Hecke eigenforms and , has been obtained by Kowalski, Michel, and Sawin [10] for prime , though no serious attempt has been made to optimize the error term. We refer the reader to [3] for applications of this result.
Acknowledgment
We thank the anonymous referee for their valuable comments.
2. Sketch.
We briefly indicate the main idea behind the improved error term in Theorem 1.1 before proceeding to the proof. After using an approximate functional equation and the orthogonality of characters, the error term is roughly
(2.1) |
where are the Hecke eigenvalues associated to and is the divisor function. This sum is treated using different techniques depending on the the sizes of and .
Suppose that . When is bounded by a reasonably small power of , this is treated by solving a ‘shifted convolution problem’, entailing the spectral theory of automorphic forms. Now suppose is somewhat large, the most difficult case being , or equivalently and when . The congruence in (2.1) is detected using additive characters and then Voronoi summation is applied to the sum (for this step we need a long sum, hence the assumption ). Writing for , this leads to a sum of the shape (after opening up the divisor function)
(2.2) |
An effective way to treat the most difficult case is to use Fouvry, Kowalksi, and Michel’s [4] bounds for bilinear sums of Kloosterman sums, based on their work on algebraic trace functions. To use this, one groups together two of the three variables to form a new variable, which gives a bilinear sum in this new variable and the remaining variable. The bound is non-trivial when one variable is longer than and one is longer than (the so called Pólya-Vinogradov range). However this strategy fails when we have and , for then , and there is no grouping that satisfies the requirements. This troublesome range was treated by a new bound for bilinear sums of Kloosterman sums obtained by Blomer et al. [1, Theorem 5.1, equation (5.3)]. Later, Shparlinski gave a better bound using his own result on sums of Kloosterman sums [11, Theorem 2.1]. The aforementioned bounds for sums of Kloosterman sums are very general because they can be used for arbitrary coefficients in place of . On the other hand, we make gains by using the automorphic nature of these coefficients. We transform the sum of Kloosterman sums using Poisson summation to an additively twisted sum of , and then employ a Wilton type bound giving square-root cancelation. This strategy yields a bound which essentially forces to be close to , thus giving a superior treatment of the critical range and and discussed above. Moreover, this approach is simple in that it completely avoids the consideration of bilinear sums of Kloosterman sums.
The case is somewhat similar after the ‘switching trick’ of Blomer et al. (Voronoi summation) which reduces to sums like (2.1) with typically, but now without the restriction . The lack of this restriction in this case weakens the final bound a bit.
3. Proof of Theorem 1.1
3.1. Preliminaries
Throughout, will denote an odd prime number, and will denote a holomorphic Hecke cusp form or non-holomorphic Hecke-Maass cusp form for , with Hecke eigenvalues . We will follow the convention: that is, will always represent an arbitrarily small positive constant, but not necessarily the same one from one occurrence to another. All implied constants may depend implicitly on and . By a ‘negligible’ quantity, we will mean one which is for any , where the implied constant depends on . Throughout, we will use , possibly with a subscript, to denote a smooth function compactly supported on the interval , with derivatives satisfying
for any , where the implied constant depends on . Such a weight function may differ from one occurrence to the next even when we use the same notation.
We will write to denote . We will use the following elementary orthogonality relation:
(3.1) |
We have the average bound [6, Lemma 1]
For individual bounds, we have
where if is Maass (see [9]) and if is holomorphic.
For smooth sums of Hecke eigenvalues, we note a simple consequence of Voronoi summation: for , we have
(3.2) |
for any . See for example [1, Lemmas 2.3, 2.4], where we can take since the Selberg eigenvalue conjecture is known in level 1.
For (not necessarily smooth) sums of Hecke eigenvalues twisted by additive characters, we have
Lemma 3.1.
Let . We have
The implied constant is uniform in , but depends on .
3.2. Some known bounds
For , define
(3.3) | ||||
Note that is the same as the quantity defined on [1, page 771]. To establish Theorem 1.1, we need to prove
(3.4) |
We begin by recalling some established bounds for , but for later use it will be important to not restrict to .
Lemma 3.2.
Let . We have
(3.5) | ||||
(3.6) |
If , then
(3.7) |
Proof.
The second bound is obtained in [1, Theorem 3.2] by solving a shifted convolution problem using the spectral theory of automorphic forms, with an additional idea required to avoid dependence on the Ramanujan conjecture. However, just reading the statement of that theorem is not enough because it assumes . We look at the proof of [1, Theorem 3.2] and find that the bound (3.6) is contained in the bounds given by [1, equations (3.12), (3.16)], after dividing by the factor in [1, equation (3.4)]. This then gives exactly what is seen in the statement of [1, Theorem 3.2], apart from an extra factor which we retain in (3.6) and which would have been redundant had we been assuming , and a missing term, which is specific to the case of and both cuspidal (see the bottom of [1, page 726]) and therefore does not appear in (3.6).
The third bound (3.7) is obtained in [1, section 6.4] by applying Voronoi summation to both and sums and then bounding trivially using Weil’s bound for the Kloosterman sum. The assumption implies that the condition is vacuous in the sum in the definition (3.3) of . Then may be expressed as [1, equation (6.21)], for which we have the bound given in [1, equation (6.23)] plus the trivial bound for the expression in [1, equation (6.22)]. The latter bound gives the term in (3.7) which does not appear in [1, equation (6.23)] because it is assumed there that , while we do not make this assumption. ∎
3.3. A new bound
Define the sum (closely following the notation in [1, equation (6.26)]) for with and :
We will prove the following simple bound which was not observed in [1] or [11].
Lemma 3.3.
Let and . We have
(3.8) |
for any .
Proof.
Detecting the congruence using additive characters, we have
Now we apply Poisson summation to the sum (more precisely, we write and apply Poisson summation to the sum) to get
(3.9) |
where is the Fourier transform of . By repeated integration by parts, we may restrict the sum to , up to a negligible error.
Consider first the contribution to (3.9) of the terms with , a condition which implies that . This contribution is
(3.10) |
for any . Using (3.1), we see that the sum vanishes unless divides , in which case we must have . But since we are assuming , we cannot have and , so it follows that (3.10) is .
It remains to consider the contribution to (3.9) of the terms with . Evaluating the sum using (3.1) enforces , where denotes the multiplicative inverse of modulo . Thus we have that (3.9) equals
The contribution to the sum of the term is negligible by using (3.2). We estimate the contribution of the terms by bounding the sum using Lemma 3.1 and the rest trivially, to get
∎
In order to use the new bound towards our goal (3.4), we need
Lemma 3.4.
If and , then
(3.11) |
for any .
Proof.
The assumption implies by (3.2) that the sum in the definition (3.3) of is negligible. The assumption implies that the condition is vacuous in the sum in the definition (3.3) of . After removing this condition in , we may open the divisor function and apply smooth partitions of unity, as explained in [1, section 6.4.1], to obtain (3.11). ∎
3.4. The case
Lemma 3.5.
Let and . Define
We have
(3.12) |
Proof.
By applying Voronoi summation to the and sums in (3.3), Blomer et al. [1, page 765] showed222They actually have an additional factor , where , which arises from the use of their Lemma 2.4, but this factor is not needed because we work with Hecke eigenforms of level 1. In this setting, the Selberg eigenvalue conjecture is known, so that we may take in their Lemma 2.4.
(3.13) | ||||
where
The contribution of the diagonal terms in the first sum on the right hand side of (3.13) is bounded absolutely by
We can assume this is or else by (3.6) we have . Thus at the cost of an admissible error term, the diagonal terms can be removed. By (3.2), the second sum on the right hand side of (3.13) is negligible unless . Thus this sum is trivially bounded by
We can assume this is or else by (3.7) we have . The lemma follows. ∎
We will apply Lemma 3.3 and Lemma 3.4 to bound . For this, we need to verify the conditions of these lemmas. Suppose that the condition does not hold. Then by (3.5) and (3.6), we would have
and we would be done by (3.12). So we can assume that holds. Now suppose that the condition does not hold. Then by (3.5) and (3.7), we would have
and we would be done by (3.12). So we can assume that holds. Finally suppose that the condition does not hold. Then by (3.5), we would have , which implies . Then by (3.5), we would have and we would be done by (3.12). So we can assume the condition as well.
Now we are ready to prove
Lemma 3.6.
We have
Proof.
We use Lemma 3.3 and Lemma 3.4 to bound , which implies a bound for via Lemma 3.5. We add our bound to the collection of bounds given in [1]. We need to find the worst case (maximum) of the minimum of all these bounds for and . This leads to a linear optimization problem to maximize the minimum of the exponents of from each bound. Such a problem was solved in [1] by a computer search, and we do the same by simply inserting the exponent of from our bound for , given in (3.8), into the existing Mathematica code from [1, section 7.4.2]. The underlined portion below indicates the new addition to this code. This returns an exponent of for Maass and for holomorphic (in the latter case we also omit the term from the first entry in the existing code, corresponding to the bound (3.5), since ).
In[1] := | Maximize[{Min[(m + n)/2 - 1 + 7m/64, Max[(m - n - 1)/2, (m - n - 1)/4], |
---|---|
(1 + n - m)/2, 7/64(mstar-mprime) + Max[(2 mprime - mstar - nstar + 1)/ 2, | |
(2 n1 + 2 mprime - 2 - mstar - nstar)/2], (n1 - n2)/2, | |
7/64(mstar-mprime) + Max[(mprime + n2 + 1/2 - nstar - mstar)/ 2, | |
(2 mprime + n1 - mstar - nstar)/ 2, (2 n1 + 2 mprime - 2 - mstar - nstar)/2], | |
7/64(mstar-mprime) + mprime + n1 - (mstar + nstar)/2, | |
7/64(mstar-mprime) + Max[Min[2 n1 - (mstar + nstar)/2, | |
2/3 nprime + n1 + 1/2 - 1/6 mprime - n2 - (mstar + nstar)/2], | |
(2 mprime - mstar - nstar)/ 2, (2 mprime + 2 n1 - 2 - mstar - nstar)/2, | |
2 mprime - n2 - (mstar + nstar)/2]], 0 <= n, n <= m, m + n <= 2, | |
nstar == 2 - n, mstar == 2 - m, 0 <= nprime, nprime <= nstar, | |
0 <= mprime, mprime <= mstar, n1 + n2 == nprime, 0 <= n1, n1 <= n2}, | |
{m, n, n1, n2, nprime, nstar, mprime, mstar}] | |
Out[1] := | , |
In[2] := | Maximize[{Min[(m + n)/2 - 1, Max[(m - n - 1)/2, (m - n - 1)/4], |
---|---|
(1 + n - m)/2, 7/64(mstar-mprime) + Max[(2 mprime - mstar - nstar + 1)/ 2, | |
(2 n1 + 2 mprime - 2 - mstar - nstar)/2], (n1 - n2)/2, | |
7/64(mstar-mprime) + Max[(mprime + n2 + 1/2 - nstar - mstar)/ 2, | |
(2 mprime + n1 - mstar - nstar)/ 2, (2 n1 + 2 mprime - 2 - mstar - nstar)/2], | |
7/64(mstar-mprime) + mprime + n1 - (mstar + nstar)/2, | |
7/64(mstar-mprime) + Max[Min[2 n1 - (mstar + nstar)/2, | |
2/3 nprime + n1 + 1/2 - 1/6 mprime - n2 - (mstar + nstar)/2], | |
(2 mprime - mstar - nstar)/ 2, (2 mprime + 2 n1 - 2 - mstar - nstar)/2, | |
2 mprime - n2 - (mstar + nstar)/2]], 0 <= n, n <= m, m + n <= 2, | |
nstar == 2 - n, mstar == 2 - m, 0 <= nprime, nprime <= nstar, | |
0 <= mprime, mprime <= mstar, n1 + n2 == nprime, 0 <= n1, n1 <= n2}, | |
{m, n, n1, n2, nprime, nstar, mprime, mstar}] | |
Out[2] := | , |
∎
3.5. The case
Recall our goal (3.4). Assuming and , we will apply Lemma 3.3 and Lemma 3.4 to bound . For this purpose, we need to verify the conditions and of these lemmas. This is done just as in section 3.4 and is in fact easier. This is because the factor does not occur when using (3.5) because we assume that , and the condition is automatic for large enough by the assumption .
Lemma 3.7.
We have
Proof.
As before, we simply insert our bound from Lemma 3.3 into the existing Mathematica code, this time from [1, section 7.4.1], and compute.
In[3] := | Maximize[{Min[(m + n)/2 - 1, Max[(n - m - 1)/2, (n - m - 1)/4], |
---|---|
(1 + m - n)/2, Max[(m + 1 - n)/2, (2 n1 + m - 2 - n)/2], | |
Max[1/4 - n1/2, (m - n2)/2, (2 n1 + m - n - 2)/2], (m + 2 n1 - n)/ 2, | |
Max[Min[2 n1 - (m + n)/2, n/6 + n1 + 1/2 - n2 - 2 m/3], (m - n)/2, | |
(m + 2 n1 - 2 - n)/2, 3 m/2 - n2 - n/2], If[m + n1prime <= 1, | |
(2 m + 2 n1prime + 2 n2prime - 1 - n1circ - n2circ - m)/2 | |
+ Max[-n2prime/2, 1/4 - (m + n1prime)/2], 10], (n1 - n2)/2, | |
If[m + n2prime <= 2 n1prime, (2 m + 2 n1prime + 2 n2prime - 1 | |
- n1circ - n2circ - m)/2 + 1/4 - 5 n1prime/12 - (m + n2prime)/6, 10]], | |
m >= 0, n >= m, m + n <= 2, n1 + n2 == n, n1 <= n2, n1 >= 0, | |
n1prime >= 0, n1prime <= n1circ, n1circ == 1 - n1, n2prime >= 0, | |
n2prime <= n2circ, n2circ == 1 - n2}, {m, n, n1, n2, n1prime, | |
n2prime, n1circ, n2circ}] | |
Out[3] := | , |
∎
References
- [1] V. Blomer, É. Fouvry, E. Kowalski, P. Michel, and D. Milićević, On moments of twisted -functions, Amer. J. Math. 139 (2017), no. 3, 707–768.
- [2] by same author, Some applications of smooth bilinear forms with Kloosterman sums, Tr. Mat. Inst. Steklova 296 (2017), no. Analiticheskaya i Kombinatornaya Teoriya Chisel, 24–35, English version published in Proc. Steklov Inst. Math. 296 (2017), no. 1, 18–29.
- [3] V. Blomer, É. Fouvry, E. Kowalski, P. Michel, D. Milićević, and W. Sawin, The Second Moment Theory of Families of -Functions: The Case of Twisted Hecke -Functions, Mem. Amer. Math. Soc. 282 (2023), no. 1394.
- [4] É. Fouvry, Emmanuel K., and P. Michel, Algebraic trace functions over the primes, Duke Math. J. 163 (2014), no. 9, 1683–1736.
- [5] D. R. Heath-Brown, The fourth power moment of the Riemann zeta function, Proc. London Math. Soc. (3) 38 (1979), no. 3, 385–422.
- [6] H. Iwaniec, The spectral growth of automorphic -functions, J. Reine Angew. Math. 428 (1992), 139–159.
- [7] by same author, Introduction to the spectral theory of automorphic forms, Biblioteca de la Revista Matemática Iberoamericana. [Library of the Revista Matemática Iberoamericana], Revista Matemática Iberoamericana, Madrid, 1995.
- [8] by same author, Topics in classical automorphic forms, Graduate Studies in Mathematics, vol. 17, American Mathematical Society, Providence, RI, 1997.
- [9] H. H. Kim, Functoriality for the exterior square of and the symmetric fourth of , J. Amer. Math. Soc. 16 (2003), no. 1, 139–183, With appendix 1 by D. Ramakrishnan and appendix 2 by H. Kim and P. Sarnak.
- [10] E. Kowalski, P. Michel, and W. Sawin, Bilinear forms with Kloosterman sums and applications, Ann. of Math. (2) 186 (2017), no. 2, 413–500.
- [11] I. E. Shparlinski, On sums of Kloosterman and Gauss sums, Trans. Amer. Math. Soc. 371 (2019), no. 12, 8679–8697.
- [12] I. E. Shparlinski and T. Zhang, Cancellations amongst Kloosterman sums, Acta Arith. 176 (2016), no. 3, 201–210.
- [13] X. Wu, The fourth moment of Dirichlet -functions at the central value, Math. Ann. (doi:10.1007/s00208-022-02483-9).
- [14] M. P. Young, The fourth moment of Dirichlet -functions, Ann. of Math. (2) 173 (2011), no. 1, 1–50.
- [15] R. Zacharias, Mollification of the fourth moment of Dirichlet -functions, Acta Arith. 191 (2019), no. 3, 201–257.