1. Introduction
A considerable amount of work in the literature has been done on moments of central values of families of -functions, due to rich
arithmetic meanings these central values have. In this paper, we focus on the family of Dirichlet -functions to a fixed modulus. It is
widely believed that (see [R&Sound]) for all real and large integers (so that primitive Dirichlet
characters modulo exist),
(1.1) |
|
|
|
where we denote (respectively, ) for a Dirichelt character (respectively, the number of primitive characters) modulo ,
the numbers are explicit constants and we denote throughout the paper for the sum over primitive Dirichlet characters
modulo .
The formula given in (1.1) is well-known for and is a conjecture due to K. Ramachandra [Rama79] for when the sum
in (1.1) is being replaced by the sum over all Dirichlet characters modulo a prime . For all most all , D. R. Heath-Brown
[HB81] established (1.1) for and K. Soundararajan [Sound2007] improved the result to be valid for all . An
asymptotic formula with a power saving error term was further obtained in this case for being prime numbers by M. P. Young
[Young2011]. The main terms in Young’s result agree with a conjectured formula provided by J. B. Conrey, D. W. Farmer, J. P. Keating,
M. O. Rubinstein and N. C. Snaith in [CFKRS] concerning the left side of (1.1) for all positive integral values of .
Subsequent improvements on the error terms in Young’s result are given in [BFKMM1] and [BFKMM]. See also [Wu2020] for an
extension of Young’s result to general moduli.
Other than the asymptotic relations given in (1.1), much is known on upper and lower bounds of the conjectured order of magnitude
for moments of the family of -functions under consideration. To give an account for the related results, we assume that is a prime
number in the rest of the paper. In [Sound01], under the assumption of the generalized Riemann hypothesis (GRH), K. Soundararajan
showed that
|
|
|
for all real positive and any . These bounds are optimal except for the powers. The optimal upper bounds
are later obtained by D. R. Heath-Brown in [HB2010] unconditionally for with a positive integer and for all
under GRH. Using a sharpening of the method of Soundararajan by A. J. Harper in [Harper], one may also establish the optimal upper
bounds for all real under GRH. In [Radziwill&Sound], M. Radziwiłł and K. Soundararajan enunciated a principle that
allows one to establish sharp upper bounds for moments of families of -functions unconditionally and used it to study the moments of
quadratic twists of -functions attached to elliptic curves. This principle was then applied by W. Heap, M. Radziwiłł and K.
Soundararajan in [HRS] to establish unconditionally the -th moment of the Riemann zeta function on the critical line for all real
.
In the opposite direction, a simple and powerful method developed by Z. Rudnick and K. Soundararajan in [R&Sound1] shows that
|
|
|
for all rational . A modification of a method of M. Radziwiłł and K. Soundararajan in [Radziwill&Sound1] may allow one
to establish such lower bounds for all real . In [C&L], V. Chandee and X. Li obtained the above lower bounds for rational
.
In [H&Sound], W. Heap and K. Soundararajan developed another principle which allows one to study lower bounds of families of
-functions. This principle can be regarded as a companion to the above principle of M. Radziwiłł and K. Soundararajan
[Radziwill&Sound] concerning upper bounds. Although Heap and Soundararajan only studied moments of the Riemann zeta function on the
critical line, they did point out that their principle may be applied to study moments of families of -functions, including the one we
consider in this paper. In fact, the density conjecture of N. Katz and P. Sarnak concerning low-lying zeros of families of -functions
indicates that the underlying symmetry for the family of Dirichlet -functions to a fixed modulus is unitary, and that the behaviour of
this family resembles that of the Riemann zeta function on the critical line. Thus, one expects to obtain sharp lower bounds for moments of
the above unitary family of -functions using the principle of Heap and Soundararajan. The aim of this paper is to first carry out this
principle explicitly to achieve the desired lower bounds in the following result.
Theorem 1.1.
For large prime and any real number , we have
(1.2) |
|
|
|
Next, we apply the dual principle of M. Radziwiłł and K. Soundararajan [Radziwill&Sound] to establish sharp upper bounds for a
restricted range of as follows.
Theorem 1.2.
For large prime and any real number such that , we have
(1.3) |
|
|
|
Note that we can combine Theorem 1.1 and 1.2 together to obtain the following result concerning the order
of magnitude of our family of -functions.
Theorem 1.3.
For large prime and any real number such that , we have
(1.4) |
|
|
|
We notice that such a result in (1.4) is already implied by the above mentioned result of D. R. Heath-Brown [HB2010] and
that of V. Chandee and X. Li [C&L]. In particular, the case of (1.4) is explicitly given in [C&L]. Moreover,
the result is shown to be valid for as well by H. M. Bui, K. Pratt, N. Robles and A. Zaharescu [BPRZ, Theorem 1.4]. This case
is achieved by employing various tools including a result on a long mollified second moment of the corresponding family of -functions
given in [BPRZ, Theorem 1.1]. In our proofs of Theorems 1.1 and 1.2, we also need to evaluate certain
twisted second moments for the same family. The lengths of the corresponding Dirichlet polynomials are however short so that the main
contributions come only from the diagonal terms. Hence, only the orthogonality relation for characters is needed to complete our work. We
also point out here that as it is mentioned in [BPRZ] that one may apply the work of B. Hough [Hough2016] or R. Zacharias
[Z2019] on twisted fourth moment for the family of Dirichlet -functions modulo to obtain sharp upper bounds on all moments
below the fourth. We decide to use the twisted second moment here to keep our exposition simple by observing that it is needed for
obtaining both the lower bounds and the upper bounds.
3. Outline of the Proofs
We may assume that is a large prime number and we note that in this case we have . As the case for both
(1.2) and (1.3) is known, we may assume in our proofs that is a fixed positive real number and let be two large natural numbers depending on only and and denote for a sequence of even natural
numbers such that and for , where is
defined to the largest natural number satisfying . We may assume that is so chosen so that we have for all and this further implies that we have
(3.1) |
|
|
|
We denote for the set of odd primes not exceeding and
for the set of primes lying in the interval for . For each , we
write
|
|
|
where we define for and for . We further define .
We define for any non-negative integer and any real number ,
|
|
|
Further, we define for each and any real number ,
|
|
|
Before we proceed to our discussions below, we would like to point out here without further notice that in the rest of the paper, when we use
or the -symbol to estimate various quantities needed, the implicit constants involved only depend on and are uniform with
respect to . We shall also make the convention that an empty product is defined to be .
We now present the needed versions in our setting of the lower bounds principle of W. Heap and K. Soundararajanand in [H&Sound] and the
upper bounds principle of M. Radziwiłł and K. Soundararajan in [Radziwill&Sound] in the following two lemmas. We choose to state our results suitable for our proofs of Theorems 1.1 and 1.2 only. One may easily adjust them to study moments for various other families of -functions.
Our first lemma corresponds to the lower bounds principle.
Lemma 3.1.
With notations as above. For , we have
(3.2) |
|
|
|
For , we have
(3.3) |
|
|
|
The implied constants in (3.2) and (3.3) depend on only.
Proof.
We assume first and apply Hölder’s inequality to see that the left side of (3.2) is
(3.4) |
|
|
|
Notice that we have for with ,
(3.5) |
|
|
|
where the last estimation above follows from the observation that
(3.6) |
|
|
|
We apply (3.5) with and to see that when ,
|
|
|
|
Similarly, we have
|
|
|
|
The above estimations then allow us to see that when ,
(3.7) |
|
|
|
|
On the other hand, we notice that when ,
|
|
|
Observe that the same bound above also holds for . It follows from these estimations that when , we have
|
|
|
|
Applying the above together with (3.4) and (3.7) allows us to establish the estimation given in
(3.2).
It remains to consider the case and we apply Hölder’s inequality again to see that the left side of (3.3) is
(3.8) |
|
|
|
We apply (3.5) this time with and arguing as above to see that when , we have
(3.9) |
|
|
|
Similarly, when , we have
(3.10) |
|
|
|
We then deduce the estimation given in (3.3) readily from (3.8), (3.9) and (3.10).
This completes the proof of the lemma.
∎
Our next lemma corresponds to the upper bounds principle. Instead of the form used for obtaining upper bounds given in [Radziwill&Sound], we decide to adapt one that resembles what is given in Lemma 3.1 above and also derive it via a similar fashion. One may compare our next lemma with [Radziwill&Sound, Proposition 3] and [HRS, Proposition 2.1].
Lemma 3.2.
With notations as above. We have for ,
(3.11) |
|
|
|
where the implied constants depend on only.
Proof.
Note first that using arguments similar to those in the proof of Lemma 3.1, we have that when ,
(3.12) |
|
|
|
where the implied constants are uniformly bounded for all .
Now, if there exists an integer such that whenever , but with , we deduce from the above and the observation that when
that
|
|
|
If no such exists, then we must have for all so that the estimation
(3.12) is valid for all and we have
|
|
|
In either case, we conclude that
|
|
|
We then deduce from this that
|
|
|
|
|
|
|
|
Applying Hölder’s inequality to the last expression above leads to the estimation given in (3.11) and this completes the proof of the lemma.
∎
In what follows, we may further assume that by noting that the case of Theorem 1.1 can be obtained using
(3.3) in Lemma 3.1 and applying the arguments in the paper. We then deduce from Lemma 3.1 and Lemma 3.2 that in order to prove Theorem 1.1 and
1.2 for the case , it suffices to establish the following three propositions.
Proposition 3.3.
With notations as above, we have
|
|
|
Proposition 3.4.
With notations as above, we have
|
|
|
Proposition 3.5.
With notations as above, we have
|
|
|
We shall prove the above propositions in the rest of the paper.
4. Proof of Proposition 3.3
Denote for the number of distinct prime powers dividing and for the multiplicative function such that
for prime powers . Let be functions such that when is
composed of at most primes, all from the interval . Otherwise, we define . We use these notations to see that for
any real number ,
(4.1) |
|
|
|
Note that each is a short Dirichlet polynomial since unless . It follows from this that and are short Dirichlet
polynomials whose lengths are both at most by (3.1). Moreover, it is readily
checked that we have for each modulo (including the case , the principal character modulo ),
(4.2) |
|
|
|
|
We note further that it is shown in [R&Sound] that for ,
|
|
|
We deduce from the above that
|
|
|
|
|
|
|
|
|
|
|
|
where the last estimation above follows from (4.2). Applying (4.2) one more time, we see that the main term above
equals
|
|
|
|
|
|
|
|
where we write for simplicity
|
|
|
We now consider the contribution from the terms with above (note that as , we can not have in our
case). As this implies that , we deduce together with the observation that that the total
contribution from these terms is
|
|
|
|
We now set to see that we can ignore the contributions from various error terms above to deduce that
|
|
|
where the last equality above follows from the observation that .
Notice that
(4.3) |
|
|
|
where the last equality above follows by noting that implies that for all .
We consider the sum above over for a fixed in (4.3). Note that the factor restricts to have
all prime factors in such that . If we remove the restriction on , then the sum becomes
(4.4) |
|
|
|
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 so that we deduce from Lemma 2.1 that
(4.5) |
|
|
|
We then deduce from this, (4.4) and Lemma 2.1 that we have
|
|
|
This completes the proof of the proposition.
5. Proof of Proposition 3.4
As the sum over converges, we see that it suffices to show that for a fixed integer such that , we have
|
|
|
We define the function such that or , and we have if and only if is composed of exactly primes (counted with multiplicity), all from the interval . We use this together with the notations in Section 4 to write that
(5.1) |
|
|
|
|
where we recall that when . We then apply the above to write
|
|
|
Here we observe that is a short Dirichlet polynomial whose length is at most
|
|
|
Note also that we have for all .
We evaluate the sum of over all primitive characters over by splitting the sum into
sums over even and odd characters separately. As the treatments are similar, we only consider the sum over even characters here. From
(2.1) and Lemma 2.3, we have that
(5.2) |
|
|
|
We now apply (3.6) and the definition of to see that
(5.3) |
|
|
|
|
It follows from this that the error term in (5.2) is
|
|
|
We next estimate the contribution of the terms in the last expression of (5.2). By the rapid decay of
given in Lemma 2.2, we may assume that . Using and (5.3), we see that these terms contribute
|
|
|
To estimate the expression above, we may consider the case without loss of generality. We may also assume that
so that on writing , we have that which implies that . Moreover, we have that and that implies that , so that we have . It
follows that
|
|
|
It remains to consider the terms in the last expression of (5.2). We write and apply (5.3) to see that these terms are
(5.4) |
|
|
|
|
To evaluate the last sum above, we set and apply the definition of given in Lemma 2.2 to
see that
|
|
|
We evaluate the integral above by shifting the line of integration to . We encounter a double pole at in the
process. The integration on the new line can be estimated trivially using the convexity bound for (see [iwakow, Exercise 3, p.
100]) as
|
|
|
and the rapid decay of when . We also evaluate the corresponding residue to see that
(5.5) |
|
|
|
|
where are some constants depending on , satisfying .
We apply (5.5) to evaluate (5.4) to see that we may ignore the contribution of the error term from (5.5) so
that the expression in (5.4) is
|
|
|
As the estimations are similar, it suffices to give an estimation on the sum
(5.6) |
|
|
|
We now estimate the sum last sum above for fixed . Without loss of generality, we may assume that . We then define for ,
|
|
|
For ,
|
|
|
Also,
|
|
|
Then one checks that
(5.7) |
|
|
|
As in the proof of Proposition 3.3, when , we remove the restriction of on and on to see that the last sum in (5.7) becomes
|
|
|
|
|
|
|
|
Further, we notice that in this case we have if . Thus, we apply Rankin’s
trick to see that the error introduced this way is
|
|
|
|
We may take large enough so that it follows from (4.5) that when , the error is
|
|
|
|
On the other hand, when , we apply (4.5) again to see that
|
|
|
We then deduce that in this case
|
|
|
|
|
|
|
|
|
|
|
|
Similar estimations carry over to the sums over for in (5.7). 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.8) |
|
|
|
We now apply (4.5) and the observation to see that
(5.9) |
|
|
|
It follows from (5.9) that the last expression in (5.8) is
|
|
|
We then conclude from this, (5.6) and Lemma 2.1 that
|
|
|
This completes the proof of the proposition.