1. Introduction
Evaluating asymptotically moments of -functions at the central point is an important subject in analytical number theory as these moments have many arithmetic applications. In this paper, we are interested in the families of twisted modular -functions to a fixed modulus. For simplicity, we fix a holomorphic Hecke eigenform of weight of level . The Fourier expansion of
at infinity can be written as
|
|
|
where we denote for . Here the coefficients are real and satisfy and for with being the divisor function of . We fix a modulus and assume that throughout so that primitive Dirichlet characters modulo exist and denote for a primitive Dirichlet character modulo .
For , we define the twisted modular -function by
|
|
|
|
In [Stefanicki], T. Stefanicki obtained asymptotic formulas for the first and second moment of over all primitive characters. The result given in [Stefanicki] concerning the second moment is only valid for a restricted values of and this was later improved by P. Gao, R. Khan and G. Ricotta [GKR] to hold for almost all . Subsequent work with improvements on the error term can be found in [BM15, BFKMM, KMS17].
In [BM15], V. Blomer and D. Milićević not only studied the second moments of various modular -functions
in a much broader sense but also obtained sharp lower bounds for the second moment of mixed product of twisted modular -functions.
It is mentioned in [BM15] that the method carries over to treat the -th moment for any integer as well
and this was later achieved by G. Chen and X. He [CH].
The aim of this paper is to establish sharp lower and upper bounds for the -th moments of central values of twisted modular -functions to a fixed prime power modulus for real . Throughout the paper, we denote for the number of primitive characters modulo and for the sum over primitive Dirichlet characters
modulo . For lower bounds, we have the following result.
Theorem 1.1.
With notations as above. Let where is a large prime number and . For any real number , we have
(1.1) |
|
|
|
For upper bounds, our result is as follows.
Theorem 1.2.
With notations as above. Let where is a large prime number and . For any real number such that , we have
(1.2) |
|
|
|
Our strategy of proofs for the above results largely follows from the lower bounds principle of W. Heap and K. Soundararajan [H&Sound] as well as the upper bounds principle of M. Radziwiłł and K. Soundararajan [Radziwill&Sound] concerning moments of general families of -functions. These principles require one to be able to evaluate twisted moments. For our case, we shall employ the method in [Stefanicki] to treat the twisted first moment and apply the tools developed in [BM15] to treat the twisted second moment. Especially, an estimation for certain off-diagonal terms in [BM15, Section 12] plays a crucial role in our treatment for the twisted second moment.
Combining Theorem 1.1 and 1.2, we have the following result concerning the order of magnitude of our family of -functions.
Theorem 1.3.
With notations as above. Let where is a large prime number and . For any real number such that , we have
|
|
|
Our results above are in agreement with the conjectured formulas for these moments following from the general philosophy in the work of J. P. Keating and N. C. Snaith [Keating&Snaith2000].
3. Outline of the Proofs
As the case is trivial and the case for
(1.1)-(1.2) is known from [BM15], we may assume in our proofs that is a fixed positive real number.
We let be two large natural numbers depending on only and define a sequence of even natural
numbers such that and for
, where we set to be the largest natural number satisfying . We shall choose large enough so that we have for all and we note that this implies that
(3.1) |
|
|
|
We define to be the set of odd primes not exceeding and
to be the set of primes lying in the interval for . For each , we
write
|
|
|
where we define
(3.2) |
|
|
|
We also define .
For any non-negative integer and any real number , we denote
|
|
|
We further define for each and any real number ,
|
|
|
We point out here that in the rest of the paper, when we use
or the -symbol to estimate various quantities presented, the implicit constants involved depend on only and are uniform with
respect to . We shall also make the convention that an empty product is defined to be .
The following two lemmas present in our setting the lower bounds principle of W. Heap and K. Soundararajan in [H&Sound] and the
upper bounds principle of M. Radziwiłł and K. Soundararajan in [Radziwill&Sound], respectively.
The first one corresponds to the lower bounds principle.
Lemma 3.1.
With notations as above. For , we have
(3.3) |
|
|
|
For , we have
(3.4) |
|
|
|
The implied constants in (3.3) and (3.4) depend on only.
Proof.
We consider the case first and we apply Hölder’s inequality to see that the left side of (3.3) is
|
|
|
As in the proof of [Gao2021-3, Lemma 3.4], we have for with ,
(3.5) |
|
|
|
Setting and in (3.5) then implies that when
,
|
|
|
|
Similarly, we have
|
|
|
|
We apply the above estimations to to see that when and , then
|
|
|
We then conclude that when ,
(3.6) |
|
|
|
|
On the other hand, we notice that when ,
|
|
|
It follows that when , we have
(3.7) |
|
|
|
|
We apply (3.6) and (3.7) to deduce that when , we have
|
|
|
where the last estimation above follows by noting that
|
|
|
Next, we consider the case and we apply Hölder’s inequality again to see that the left side of (3.4) is
(3.8) |
|
|
|
We argue similar to above to see that when ,
(3.9) |
|
|
|
Similarly, when , we have
|
|
|
Combining (3.8), (3.9) and arguing as above, we readily deduce the estimation given in (3.4).
This completes the proof of the lemma.
∎
Our next lemma corresponds to the upper bounds principle.
Lemma 3.2.
With notations as above. We have for ,
(3.10) |
|
|
|
where the implied constants depend on only.
Proof.
Using arguments similar to those in the proof of Lemma 3.1, we see that when ,
(3.11) |
|
|
|
If there exists an integer such that for all and that , we deduce from the above and the observation that when
that
|
|
|
If no such exists, then for all . Thus the estimation
(3.11) holds for all and we have
|
|
|
In either case, we conclude that
|
|
|
It follows from this that we have
|
|
|
|
|
|
|
|
Applying Hölder’s inequality to the last expression above leads to the estimation given in (3.10) and this completes the proof of the lemma.
∎
We apply Lemma 3.1 and Lemma 3.2 to see that in order to prove Theorem 1.1 and Theorem
1.2, it suffices to establish the following three propositions.
Proposition 3.3.
With notations as above. We have for ,
|
|
|
Proposition 3.4.
With notations as above. We have for ,
|
|
|
Proposition 3.5.
With notations as above. We have for ,
|
|
|
We shall prove the above propositions in the rest of the paper.
4. Proof of Proposition 3.3
We define to be the completely multiplicative function on primes , we also
define to be the multiplicative function such that
for prime powers .
We further denote for the number of prime powers dividing and let be functions such that only takes
values or and if and only if and the primes dividing are all from the interval .
We use these notations to write as
(4.1) |
|
|
|
Note that each is a short Dirichlet polynomial since unless . We then deduce that both and are short Dirichlet
polynomials whose lengths are both at most by (3.1).
Note further that we have since and restricts
to satisfy . This observation allows us to also write as
(4.2) |
|
|
|
where we have, for some constant depending on only,
|
|
|
We apply (4.2) to write for simplicity that
|
|
|
where for some constant depending on only, we have
(4.3) |
|
|
|
The last estimation above follows from (3.1).
We now deduce from Lemma 2.2 that
(4.4) |
|
|
|
We denote for the Möbius function and note the following relation (see [Stefanicki, (2.3)])
(4.5) |
|
|
|
|
In particular, setting above implies that
(4.6) |
|
|
|
|
We apply (4.5) to see that the right side expression in (4.4) equals to
|
|
|
We evaluate the last summation above by applying the definition of to see that
|
|
|
where is the Kloosterman’s sum defined by
|
|
|
It follows from the well-known Weil’s bound for Kloosterman’s sum (see [iwakow, Corollary 11.20]) that we have
|
|
|
We then deduce from this that
|
|
|
The above then implies that we have
(4.7) |
|
|
|
|
It remains to evaluate
(4.8) |
|
|
|
We first consider the contribution from the terms with above (note that we may take large enough
so that we can not have in our case). By the rapid decay of given in (2.5), we may assume that . This then implies that , so that we deduce together with the observation that that the total
contribution from these terms is
(4.9) |
|
|
|
|
We now set to see from (4.4), (4.6)-(4.9) that we have
|
|
|
where the last equality above follows from the observation that .
Notice that
(4.10) |
|
|
|
where the last equality above follows by noting that implies that for all .
We consider the sum above over for a fixed in (4.10). Note that the factor restricts to have
all prime factors in such that . If we remove the restriction on , then the sum becomes
(4.11) |
|
|
|
On the other hand, using Rankin’s trick by noticing that if , we see that the error
introduced this way does not exceed
|
|
|
where the last estimation above follows by taking large enough and the
bound (which is a consequence of Lemma 2.1) that
(4.12) |
|
|
|
We then deduce from this, (4.11) and Lemma 2.1 that we have
|
|
|
This completes the proof of the proposition.
5. Proof of Proposition 3.4
Observe that for a fixed integer such that , we have
|
|
|
Since the sum over converges, we deduce from the above that it remains to show that
|
|
|
Recall the definition of given in (3.2). We further define the function such that or , and that if and only if and all the prime factors of are from the interval . Using these together with the notations in Section 4, we see that
(5.1) |
|
|
|
|
Note that is a short Dirichlet polynomial whose length does not exceed
|
|
|
We apply (4.1), (5.1) and the above observation to write for simplicity that
|
|
|
Similar to (4.3), we note that for all ,
(5.2) |
|
|
|
We apply (2.4) to see that
(5.3) |
|
|
|
We now consider the contribution of the terms in the last expression of (5.3). Due to the rapid decay of given in (2.5), we may assume that . We apply [BFKMM, Lemma 1.6] to see that there exist two non-negative function supported on , satisfying
(5.4) |
|
|
|
Moreover, we have the following smooth partition of unity:
|
|
|
We also note the estimations
(5.5) |
|
|
|
It follows from this and the definition of given in Section 3 that we have
(5.6) |
|
|
|
Applying the above, the definition of given in Lemma 2.2 and the estimations given in (5.2), we see that the terms in the last expression of (5.3) contributes
(5.7) |
|
|
|
where
|
|
|
Due to the rapid decay of on the vertical line, we may truncate the integral in (5.7) to with a negligible error. This implies that the bounds given in (5.4) are also satisfied by and that the expression in (5.7) can be further bounded by
|
|
|
where , and that
|
|
|
We are thus led to estimate for integers and functions satisfying (5.4).
In fact, this work has already been done in [BM15, Section 12] and
it follows from the result given in the first display below [BM15, (12.7)] that we have upon setting there that . This implies that the contribution of the terms in the last expression of (5.3) is negligible.
It remains to consider the terms in the last expression of (5.3). We write and apply the estimation in (5.6) to see that these terms are
(5.8) |
|
|
|
|
To evaluate the last sum above, we first recall that the Rankin-Selberg -function of of is defined for by (see [iwakow, (23.24)])
|
|
|
It is known (see [iwakow, p. 132]) that has a simple at . In fact, we have (see [iwakow, (5.97)])
|
|
|
where is the symmetric square -function of defined for by (see [iwakow, (25.73)])
|
|
|
|
It follows from a result of G. Shimura [Shimura] that the corresponding completed -function
|
|
|
|
is entire and satisfies the functional equation
.
Combining this with [iwakow, (5.8)] and apply the convexity bounds (see [iwakow, Exercise 3, p.
100]) for -functions, we deduce that
(5.9) |
|
|
|
Note also the following convexity bound for :
(5.10) |
|
|
|
We now evaluate the last sum in (5.8) by setting there and applying the definition of given in Lemma 2.2 to obtain that
(5.11) |
|
|
|
|
where , with
|
|
|
We evaluate the integral in (5.11) by shifting the line of integration to . We encounter a double pole at in the
process. Note that on the new line, we have for some constant ,
|
|
|
where the last estimation above can be obtained using arguments that lead to (4.3).
Combining the above with (5.9), (5.10) and the rapid decay of when , we deduce that the integration on the new line is
|
|
|
Applying this in (5.8) and taking note of the definition of given in Section 3, we see that the contribution of the integration on the new line to the right side of (5.8) is
|
|
|
We now evaluate the corresponding residue to see that
(5.12) |
|
|
|
|
where are some constants depending on only, satisfying .
We apply (5.12) to evaluate (5.8) to see that we may ignore the contribution of the error term in (5.12) so
that the expression in (5.8) is
|
|
|
|
|
|
|
|
As the estimations are similar, it suffices to treat the sum
(5.13) |
|
|
|
We now consider the last sum above for fixed . Without loss of generality, we may assume that . We then define for ,
|
|
|
For ,
|
|
|
Also,
|
|
|
Then one checks that
(5.14) |
|
|
|
As in the proof of Proposition 3.3, we remove the restriction of on
and on to see that the sum on the right side in (5.14) for becomes
|
|
|
|
|
|
|
|
Further, we notice that in this case we have for . Thus, we apply Rankin’s
trick to see that the error introduced this way is
|
|
|
|
We then deduce that
|
|
|
|
|
|
|
|
|
|
|
|
Similar estimations carry over to the sums over for in (5.14). To treat the sum over , we apply Rankin’s trick again to see that the sum is
|
|
|
|
By taking large enough, we deduce from this that
|
|
|
It follows from the above discussions that we have
(5.15) |
|
|
|
We now apply (4.12) and the observation to see that
(5.16) |
|
|
|
It follows from (5.16) that the last expression in (5.15) is
|
|
|
We then conclude from the above, (5.13), Lemma 2.1 and the observation that that
|
|
|
This completes the proof of the proposition.