Moments of the Hurwitz zeta function on the critical line
Abstract.
We study the moments of the Hurwitz zeta function on the critical line, with a rational shift . We conjecture, in analogy with the Riemann zeta function, that . Using heuristics from analytic number theory and random matrix theory, we conjecturally compute . In the process, we investigate moments of products of Dirichlet -functions on the critical line. We prove some of our conjectures for the cases .
1. Introduction
Estimating the moments of the Riemann zeta function on the critical line,
is a classical problem in analytic number theory (see [43, Chapter VII]). It is widely believed that for all real , where is a fixed positive constant depending only on . This conjecture is trivial for , was proved by Hardy and Littlewood [20] for , was proved by Ingham [30] for , and is wide open in all other cases.
Despite the history and intractability of the problem, very precise conjectures for the exact value of exist. On the basis of number theoretic calculations, Conrey and Ghosh [13] conjectured the value of for and by a different, but still number theoretic, method Conrey and Gonek [14] conjectured the value of for . Finally, using heuristics modeling by characteristic polynomials of random matrices from the Gaussian unitary ensemble, Keating and Snaith [32] conjectured the value of for all , agreeing with the conjectures from [13] and [14].
The analogy with random matrix theory has led to many fruitful conjectures for moments of -functions; see, for example, [12] and the references therein for details.
A weaker, and hence theoretically more tractable version of the above conjecture is the estimate . By work of Ramachandra [37, 38, 39], and Heath-Brown [28], the lower bound was known conditionally on the Riemann Hypothesis (RH) for , and by work of Radziwiłł and Soundararajan [36], it was known unconditionally for all . Recent work of Heap and Soundararajan [27] establishes the lower bound unconditionally for all .
For the upper bound, Soundararajan [41] had shown on RH that for every and . Harper [21] removed the dependence on , conditionally establishing the sharp upper bound for every . The upper bound was known unconditionally for , due to Heath-Brown [28], and for , due to Bettin, Chandee and Radziwiłł [5]. Recently, Heap, Radziwiłł and Soundararajan [25] subsumed both of these results by proving the upper bound unconditionally for .
The object of this paper is to investigate analogous moments of the Hurwitz zeta function, . For and for , is defined by the series
As with the Riemann zeta function, the Hurwitz zeta function can be continued to a meremorphic function on the entire complex plane with a simple pole at satisfying the Hurwitz relation (an analogue of the functional equation, see [33]). Clearly, and . For these values of , thus, has an Euler product, derived from the usual Euler product for . However, for , , does not have an Euler product, and, in fact, the behaviour of its zeroes is very different from that of . Spira [42] showed that like , may have trivial zeros on the negative real line, and also that is zero-free in the region . However, it is well-known, due to Davenport and Heilbronn [15] for the cases of rational or transcendental , and due to Cassels [11] for the case of algebraic irrational that if , then always has a zero in the strip for every . Voronin showed [45] that for rational , and fixed with , there are infinitely many zeros of satisfying . This result was established also for transcendental by Gonek [18]. Finally, Gonek [19] showed that if with , and , where is Euler’s totient function, then has a positive proportion of its nontrivial zeros off the critical line . All of these are in contrast to the expected behaviour of .
To study the moments of the Hurwitz zeta functions in the critical line, we define in analogy with ,
(1) |
so that . One might expect the following:
Conjecture 1.1.
Let be a fixed rational and be a fixed real number. Then for some constant , we have
as .
When , this is a theorem due to Rane [40, Theorem 2], with . In fact, he proved for (not necessarily rational),
(2) |
uniformly in and with an effective constant . This was improved further by several authors, with the current best error term due to Zhan [48, Theorem 2].
Winston Heap (private communication) has indicated that the above conjecture may not extend to irrational shifts if , and the true behaviour in this case appears quite delicate. Heap and the author are currently exploring the higher moments and distributions of Hurwitz zeta functions with irrational shifts in an ongoing project. A Diophantine problem with a paucity of non-diagonal solutions connected to these moments was considered by Heap, the author, and Wooley in [26] (see also [6, Theorem 26]).
For , the conjecture can be proved using methods for fourth moments of -functions of degree . This was done in an unpublished section of Andersson’s thesis [1, pp. 71-72]. We restate and reprove this result here for convenience:
Theorem 1.2.
Let be fixed integers with , . Then, for ,
as . That is, Conjecture 1.1 is true for and , with
where is the usual proportionality constant for the fourth moment of . More precisely, we have
We show later that this agrees with our conjecture for . In principle, one could also work out the lower order terms in this asymptotic.
Our goal for the rest of the paper is to provide evidence for Conjecture 1.1 when . In this case, can be related to the mean square of products of Dirichlet -functions on the critical line.
To explain this connection, we fix some notation that will be used throughout the paper. We assume with and . Dirichlet characters will be denoted or , and will be modulo unless noted otherwise. We will use bolded, lower case (Greek or Latin) letters such as for tuples of natural numbers indexed by characters modulo . Thus, if is such a tuple, we think of it as a function where is the set of Dirichlet characters modulo . We denote as . Further, we define,
Here, and later, sums and products over or run over . If is clear from context, we suppress it and denote simply as . Finally, we denote by the coefficient of in the Dirichlet series expansion of .
To see how products of the form arise naturally in considering Conjecture 1.1 for , we observe that for , the orthogonality of Dirichlet characters gives
By analytic continuation, this equality holds everywhere. Thus, by the multinomial theorem
(3) |
where are multinomial coefficients, the sums runs over such that , and . In particular, when we integrate both sides from to , the terms of this sum whose phase oscillates will probably not contribute to the main term. The terms that do not have oscillations correspond to the diagonal terms where the phases of each term in the product cancel out, yielding a positive real number. Thus, heuristically,
(4) |
whence, the problem of estimating naturally reduces to studying the mean square of along the critical line.
To study such moments, we will use a hybrid Euler-Hadamard product, a tool introduced originally by Gonek, Hughes and Keating [17] in the context of the Riemann zeta function. Specifically, we will need the following version for Dirichlet -functions in the -aspect:
Theorem 1.3.
Let with and , let be a real parameter, and let be any fixed positive integer. Further, let be a non-negative -function of mass one supported on , and set so that is a non-negative -function of mass one supported on . Set
where is the exponential integral.
Let be a fixed positive integer, and be a Dirichlet character modulo with conductor . Further, suppose that is induced by the primitive character modulo . Then,
where
and
The implied constants are uniform in all parameters including , unless indicated otherwise.
Such a hybrid Euler-Hadamard product was proved by Bui and Keating [9] in their study of moments in the -aspect of Dirichlet -functions at the central point (see [9, Remark 1]). Similar hybrid Euler-Hadamard products have been used in the literature for studying moments in many other contexts such as for for orthogonal and symplectic families of -functions [10]; for [8]; for the Dedekind zeta function of a Galois extension of [23]; for quadratic Dirichlet -functions over function fields [7], [3]; for normalized symmetric square -functions associated with eigenforms [16]; and for quadratic Dirichlet -functions over function fields associated to irreducible polynomials [2].
With and as in Theorem 1.3, we define
We can view as an -function of degree , as an approximation to its Euler product, and as an approximation to its Hadamard product. Roughly, Theorem 1.3 implies that .
As is usually the case with hybrid Euler-Hadamard products, mediates between the primes and zeroes; if we want to take fewer primes in the Euler product we must take more zeroes in the Hadamard product and vice-versa.
For growing relatively slowly with , we expect the two terms in the decomposition to behave like independent random variables due to a separation of scales. This is analogous to the splitting conjecture of Gonek, Hughes and Keating [17, Conjecture 2]. Concretely, we have:
Conjecture 1.4 (Splitting).
Let with . Then, for any tuple of nonnegative integers indexed by characters modulo , we have for ,
On [17, p. 511], it is suggested that this splitting conjecture holds for a much wider range of and with . Recently, Heap [24] has justified this suggestion. He proved on RH that the splitting conjecture for holds for every and a much wider range of provided one requires only an order of magnitude result, instead of an asymptotic. He also established the splitting conjecture for and for wider ranges of both with and without RH.
The mean square of can be computed exactly.
Theorem 1.5.
Let be a fixed integer and be fixed. Let be a tuple of nonnegative integers indexed by characters modulo such that . Finally, suppose that . Then for ,
where and are given by
(5) |
(6) |
where is the Euler-Mascheroni constant, is the coefficient of in the Dirichlet series for , and .
One could prove a similar result uniformly in on any vertical line with given , but we choose not to do so for conciseness. Note that the product over in (6) is conditionally convergent but not absolutely convergent.
For the mean square of , we use random matrix theory to model each -function appearing in the product by random unitary matrices. One expects that the matrices representing distinct -functions behave independently as in [23, Conjecture 2]. This leads to:
Conjecture 1.6.
Suppose that with . Then, for any tuple of nonnegative integers indexed by characters modulo , we have for ,
where is the Barnes G-function, and is the conductor of .
It is clear that one can use Conjectures 1.4 and 1.6 together with Theorem 1.5 to get a conjectural asymptotic for . Precisely, we get,
Theorem 1.7.
Note that for a fixed , the above says that the mean square of a product of Dirichlet -functions grows as . This is known for , and we shall show that in these cases our predicted constant matches up.
Due to the conditional hypotheses, the above theorem is really a conjecture. We note here that Heap made a similar conjecture about moments of products of -functions from the Selberg class (see [23, Section 6]) using the recipe of Conrey, Farmer, Keating, Rubinstein and Snaith [12]. Specializing to Dirichlet -functions, one can recover the above conjecture.
He also discussed how such conjectures could be reproduced by using hybrid Euler-Hadamard products under appropriate hypotheses. However, since he has not worked out the details of this approach in this specific context, we do so here for completeness.
It is evident that our previous discussion about (4) and Theorem 1.7 can together be used to compute the correct value of in Conjecture 1.1.
Theorem 1.8.
Let and be fixed integers with , . If Conjecture 1.4 and Conjecture 1.6 are true for all tuples of nonnegative integers indexed by characters modulo satisfying , then Conjecture 1.1 follows for that value of and with
(7) |
where is the usual proportionality constant for moments of . In other words, under the above hypotheses,
as where is as in (7).
Since the current levels of technology can handle second moments and fourth moments of really well, it is natural to hope that we can prove Conjectures 1.4 and 1.6 for . We define the Kronecker delta by
Then, we can prove:
Theorem 1.9.
The above theorem can almost certainly be extended to the case . This corresponds to , and with and not necessarily distinct characters modulo .
We note first that some of these have already been proved. The case where is the principal character modulo was essentially proved by Gonek, Hughes, and Keating [17, Theorem 3]. More generally, the case where is a (not necessarily primitive) quadratic Dirichlet character modulo was essentially proved by Heap [23, Theorem 3]. To see this, note from (12) that depends only on the primitive character modulo that induces . In particular, one can replace with and with where is a quadratic extension of and is its Dedekind zeta function. Analogues of splitting for these products is precisely what was proven in these papers.
By following both these arguments, one should be able to extend to the general case . To do so, one would need a moment result for the product of two primitive Dirichlet -functions and a short Dirichlet polynomial, generalizing that of [22]. That is, we would need an asymptotic for
(9) |
where and are any primitive characters with conductor dividing , and some sufficiently large. Such asymptotics exist in the special cases of [29, 4] and [22], for any character . Proving (9) and the splitting conjecture for for more general by using the methods of [23], [22] and [17] as outlined above should be possible but long and technical. Thus, we do not pursue this here.
Note that Theorem 1.8 and Theorem 1.9 together establish Conjecture 1.1 with and rational, giving an alternate proof of the leading term of Rane’s asymptotic (2) in this case.
Lastly, as a final piece of evidence for Conjecture 1.1, we prove the following results about upper and lower bounds:
Theorem 1.10.
Let and be fixed integers with , . If the Generalized Riemann Hypothesis (GRH) holds for every Dirichlet -function modulo , then for , and ,
In principle, it should be possible to remove the in the upper bound by using the methods of Harper [21].
The rest of the paper is structured as follows. In Section 2, we sketch a proof of Theorem 1.3; in Section 3, we prove Theorem 1.5; in Section 4, we provide some evidence for Conjecture 1.6; in Section 5, we prove Theorem 1.9; and in Section 6, we prove Theorems 1.2, 1.7, 1.8, and 1.10 and verify our conjectured constants are correct in the known cases (viz. or ).
Acknowledgements
I would like to thank my adviser, Steven Gonek, for introducing me to this problem, for his encouragement and for his helpful comments on an earlier version of this manuscript. I would also like to thank Winston Heap for helpful discussions, and for pointing out that Theorem 1.2 had been proved in Andersson’s thesis [1]. Finally, I would like to thank the anonymous referee for numerous corrections and comments that helped improve this manuscript considerably.
2. Proof of Theorem 1.3
The proof of Theorem 1.3 is very similar to [17, Theorem 1] and [9, Theorem 1]. The main difference lies in the fact that we are not assuming that the character is primitive.
Recall that if and are as in the theorem, then
(10) |
Further, by inspection we see that if and are as in the theorem, then
(11) |
(12) |
3. Proof of Theorem 1.5
We briefly discuss some notation for this section. Recall that is the coefficient of in the Dirichlet series of . is essentially a divisor function ‘twisted’ by the Dirichlet characters modulo . We also use for the true divisor function, i.e., the coefficient of in . In particular, it is immediate from writing out as a convolution that for every . We will use the notation to denote the set of -smooth (also known as -friable) numbers which are coprime to . That is,
We will need as a lemma, Mertens’ theorem for arithmetic progressions:
Lemma 3.1.
Let be a fixed real number, and . Then,
where,
Here is the Euler-Mascheroni constant and is the Kronecker delta in ,
Proof.
Clearly the result for general follows from the case by exponentiating. The latter is precisely Merten’s theorem for arithmetic progressions which was proved by Williams [46]. The expression for the constant , however, is due to Languasco and Zaccagnini [34, Section 6] who also improved the error term to one uniform in . The weaker form suffices for our purposes.
∎
We also have the following, which is immediate from [9, Lemma 3]:
Lemma 3.2.
Let be a tuple of nonnegative integers indexed by characters modulo such that , let
and let
Then, uniformly for and ,
Proof.
For the rest of this section, we will fix . Now, we want to estimate assuming that . Clearly, by Lemma 3.2,
and so it suffices to compute .
From the definition of in Lemma 3.2, it follows that if
(13) |
then is multiplicative and supported on , for all , and finally for and , we have and .
We truncate the sum in (13) at where will be chosen later. Thus,
Applying Rankin’s trick and the estimate to the error term, we see that it is
Using , we see that the product on the right is
Applying the prime number theorem and integrating by parts, we see that since , this is
Hence, we have
(14) |
Now, by the classical mean value theorem for Dirichlet polynomials, we have that
Extending the sum on the right hand side to infinity introduces an error , by the same argument as before. Thus, setting , we see that
(15) |
Using (14) to replace with a short Dirichlet polynomial together with (15) and Cauchy-Schwarz, we conclude that
Thus, it remains to estimate the sum . Since is multiplicative and supported on , we see that
Heuristically, was chosen to approximate . So, we expect that we can replace with on the right with a tolerable multiplicative error. Now, recall that when , and for . Thus, we can replace by if or . Hence, it suffices to bound
However, this is clearly
Thus,
(16) |
Note that we can write the product on the right as
The constraint can be removed from the first product here as that induces a multiplicative error given by
On doing so, the expression now looks like
(17) |
Now, define
In particular, note that and . Further, define,
Clearly is real, and further the definition of as a convolution gives us that
if . In particular, this means that the product in (17) can be divided along congruence classes modulo , giving
where the outside product runs over a set of representatives of all residue classes coprime to . Thus, applying Lemma 3.1, this is
In fact, we have that . To see this, note by orthogonality of characters,
Thus,
Collecting our estimates together proves Theorem 1.5.
4. Heuristics for Conjecture 1.6
We closely follow the arguments in [23, Section 4] and [17, Section 4]. We want to heuristically estimate
for . The factor arises as a partial Hadamard product for , where is the unique primitive character that induces . For a fixed , in the -aspect forms a unitary family, and so we replace each with a unitary matrix chosen uniformly with respect to the Haar measure.
The approximate mean density of the zeros of in the region and is given by
where is the conductor of . The rescaled zeroes of at height are well-modeled by the eigenangles of a uniformly sampled unitary matrix of size .
We now assume the Generalized Riemann Hypothesis for all characters modulo . Thus, the non-trivial zeros of are of the form where runs over a discrete (multi)set of real numbers depending on . Now, consider the trignometric integral
If is the exponential integral as in Theorem 1.3, then .
Hence, using the definition of and ,
where is a non-negative function of mass supported in , as in Theorem 1.3, and we have used GRH. Now, following [23, Equation 4.8], if we define by,
then we see that the above integral is modeled by
where is the th eigenangle of . Here, the expectation is taken against the probability space from which the random matrices are drawn. In particular, we make an independence assumption between the for any finite set of distinct characters , similar to [23]. Thus, the expectation factorises, giving
We can now use [17, Theorem 4] (see also [23, Equation 4.10]), to compute the expectation inside. This gives us
Finally, recall that , completing the heuristic.
5. Proof of Theorem 1.9
We begin this section by observing that to prove Theorem 1.9 for , it suffices to verify Conjecture 1.6 for . To see this note that is the same as . Now, it is well-known (see, for example, Lemma 5.2) that for a fixed ,
Further, putting in Theorem 1.5 gives
provided that . Finally, Conjecture 1.6 for states that for with ,
(18) |
Thus, we see that if we can prove (18), then Theorem 1.9 follows.
Our first step towards proving (18) is the following lemma which is a straightforward corollary of Lemma 3.2:
Lemma 5.1.
Let be a tuple of nonnegative integers indexed by characters modulo such that , define
and define
Then, uniformly for and ,
In view of the previous lemma and Theorem 1.3, to prove (18) we want to show
Furthermore, we can assume without loss of generality that is primitive. To see this, let be the Dirichlet character modulo which induces . Then, and differ only by local factors corresponding to primes dividing but not dividing and similarly for , and also differ only by local factors corresponding to such . In particular, we see that on multiplying these local factors cancel out, giving .
Thus, for primitive, we want to show that
To evaluate a mean square like this, we need a second moment asymptotic for a Dirichlet -function twisted by a short Dirichlet polynomial. We use one proved by Wu [47]:
Lemma 5.2.
Let be a primitive Dirichlet character modulo with , let be a parameter, and let be an arithmetic function satisfying for all . Further, let
and
with . Then,
where the parameter depends on , and when .
Proof.
This is contained in [47, Theorem 1.1]. ∎
Now, writing as a Dirichlet series, we have
where is multiplicative and supported on , , and for and , we have and .
Now, further, define where here is the sole character modulo , and let
Then we see that as defined above is the same as in [17, Section 5], and further it is immediate that for , .
We first compute the main term . Since, , is
Now, note that any estimates [17, pp. 530-531] can be applied to the above, provided we add the restrictions to the sums, and replace with . In particular, following the argument for [17, Equation 34], we conclude that is
Since , the inner sum is
Following the argument for [17, Equation 37] here, we can extend both the summations above to infinity to get that is
By the muliplicativity of and , the sum here can be written as an Euler product
Now, recalling that if , for all and for all , we get that this product is equal to
Thus, since , we see that, in fact
(21) |
Writing (19) with as ,
The first term here is . The last term is since the second moment of is . Finally, by Cauchy-Schwarz and (21), the second term is
6. Evidence for Conjecture 1.1
In this section, we will discuss the proofs of Theorem 1.2, Theorem 1.7, Theorem 1.8 and Theorem 1.10. We will also show that in all cases where our conjectures are known, the constants match up with our predictions. This will complete the presentation of our evidence for Conjecture 1.1.
In several results here, we must assume one of the following two hypotheses:
-
•
The Generalized Riemann Hypothesis holds for for every character modulo . We denote this by .
- •
We introduce the above shorthand for convenience, as many of the results in this section will hold under either hypothesis.
6.1. The Asymptotic Formula for Moments of Products of Dirichlet -functions
In this subsection, we will prove Theorem 1.7. This is straightforward. By Theorem 1.5, we get that assuming we hold and fixed, and let with ,
(22) |
Further, since we are assuming Conjecture 1.6 for , we get that under the same conditions as before,
(23) |
Finally, since we are assuming that Conjecture 1.4 is true for , we get that for as before,
Multiplying (22) and (23) and inserting above, we see that the factors cancel out, and the constants combine to become , giving
as desired.
6.2. Computing
The main result of this subsection is the following proposition which is one way to make the heuristic in (4) rigorous:
Proposition 6.1.
Let be as in (1), and for any Dirichlet character modulo , define by
If either or holds, and with , then
If or , then the above can be proved unconditionally.
We show that this proposition establishes Theorem 1.8. Note that under the hypothesis of Theorem 1.8, holds, and hence so does the conclusion of Theorem 1.7. Thus, for a fixed , and with , we get the asymptotic
Thus, by Proposition 6.1,
which establishes Theorem 1.8 with
(24) |
where the sum runs over all tuples of the form for some character . It remains to simplify the constant. Note that for , , where is the usual divisor function. In particular, this means that , and hence depends only on the modulus of . Further, . Thus,
for every appearing in the sum in (24). We see that is the same as usual constant for , but with a slight change in the local factors in the Euler product corresponding to those primes which divide . That is,
(25) |
Substituting this back into (24),
as desired. This completes the proof of Theorem 1.8 from Proposition 6.1.
We now turn to the proof of Proposition 6.1. By (3), is equal to
(26) |
where . We divide the terms in the sum into four types:
-
•
The primary diagonal terms. These correspond to for some character . For such terms, it is clear that and the integral devolves to .
-
•
The secondary diagonal terms. These correspond to diagonal terms which are not main diagonal terms. Thus, for every character modulo . For such terms, the integral devolves to the mean square of over .
-
•
The major off-diagonal terms. These correspond to and for distinct characters . For these terms, the integral devolves to .
-
•
The minor off-diagonal terms. These correspond to any terms which are not of any of the above three forms.
The primary diagonal terms clearly give rise to the main term in Proposition 6.1. We will show, through a series of lemmata, that all the other terms can be subsumed by the error term, thereby proving the proposition.
The following lemma is a corollary of a result of Milinovich and Turnage-Butterbaugh [35]:
Lemma 6.2.
Suppose that either or holds, and that is tuple of nonnegative integers indexed by the characters modulo satisfying . Then, for and any ,
In particular, if for all characters modulo , then
and hence, the secondary diagonal terms in (26) contribute at most to the sum.
Proof.
First, suppose that holds. Then, the first inequality is trivally true due to Theorem 1.7. Alternatively, suppose that holds. Then, the first inequality follows by applying [35, Theorem 1.1] in the specific case where all the -functions involved are Dirichlet -functions.
Now note that under the constraints and , we have that with equality if and only if the entire weight of is concentrated on a single character. In particular, if for all characters , then and so, . Thus, the second inequality in the lemma follows from the first.
Finally, it is clear that the constant in the the secondary diagonal terms can be subsumed into the implicit constant from the second bound. Taking, for example, shows that each such term is and since there are only such terms it follows that these contribute only .
∎
The minor off-diagonal terms can be handled by Cauchy-Schwarz. This is very far from sharp, but our other error terms are already of size and so this suffices for our purposes.
Lemma 6.3.
Suppose that either or holds and that and are tuples of nonnegative integers characters modulo satisfying . Further, suppose that correspond to a minor off-diagonal term, as defined above. Then, for and any ,
and hence, the minor off-diagonal terms in (26) contribute at most to the sum.
Proof.
Since corresponds to an off-diagonal term, . Further, since it is not a major off-diagonal term we must have that either or is not of the form for some character . Due to symmetry, we can assume without loss of generality that for all characters . Then, by Cauchy-Schwarz and Lemma 6.2, we get for ,
Showing that these terms contribute to the error is similar to the previous lemma, hence we omit the proof.
∎
We note in passing that if , there are no secondary diagonal terms or minor off-diagonal terms, and so the previous two lemmata are unnecessary.
It remains to deal with the major non-diagonal terms. If , then again Cauchy-Schwarz suffices.
Lemma 6.4.
Suppose that either or holds for some and that and are distinct characters modulo . Then, for and any ,
and hence, the major off-diagonal terms in (26) contribute at most to the sum.
Proof.
Note that,
Thus, setting
and
we see by Cauchy-Schwarz and Lemma 6.2 that
proving the desired bound. Showing that these terms contribute to the error is similar to the above lemmata, and hence omitted.
∎
From the discussion above, it remains to deal with the off-diagonal terms when , and to show that the argument can be made unconditional for . We postpone the latter to Section 6.4, as it will be a corollary of the discussion about Theorem 1.2.
For the former, since we also claimed that Proposition 6.1 is unconditional in this case, we cannot use the hypotheses or . For such terms, standard techniques developed to handle the mean square of can be applied. For our purposes, the following lemma suffices:
Lemma 6.5.
Let and be distinct characters modulo . Then, for ,
unconditionally. Hence, if , the off-diagonal terms in (26) contribute only to the sum.
Proof.
The upper bound is [31, Equation 4] with and . Showing that these terms contribute to the error is similar to the previous lemmata, and hence omitted.
∎
6.3. Upper and Lower Bounds for
In order to prove Theorem 1.10, we have to find bounds on conditionally on GRH.
The claimed upper bound follows trivially from the previous subsection, since Proposition 6.1 tells us that on ,
and Lemma 6.2 tells us that on ,
To prove the lower bound, we proceed by reducing the problem to computing lower bounds for the moments of , i.e. lower bounds on . The key fact is the following obvious lemma:
Lemma 6.6.
Let be the principal Dirichlet character modulo . Then,
In particular, this tells us that . By the deep results in the literature about lower bounds for mentioned in the introduction, we can conclude that in fact .
6.4. The Fourth Moment of
The goal here is to compute the asymptotic for , for originally proved (unpublished) in Andersson’s thesis [1, pp. 71-72]. We reprove this here as, in the process, we will be able to verify that our conjectures for the constants and are correct when or . Further, our discussion will imply that the conclusion in Proposition 6.1 is true unconditionally if .
To do this, we make use of a recent result of Topacogullari [44], where he computes the full asymptotic formula for the fourth moments of and the mean-square of with a power saving in the error term, and an explicit dependence on the conductors. We state the weaker result we need as propositions.
Proposition 6.7.
Let be a Dirichlet character modulo . Then, for ,
where is given by
Proof.
This is an immediate corollary of [44, Theorem 1.1]. ∎
Proposition 6.8.
Let and be distinct Dirichlet characters modulo . Then, for ,
where is given by
Proof.
This is a corollary of [44, Theorem 1.3], by setting , , , noting that this implies and noting that . ∎
We note here that the previous two propositions show that the result of Proposition 6.1 can be obtained unconditionally when , which we had not shown previously. This is because the hypotheses or were used only in the proof of Lemma 6.2 and this use can be replaced by the above propositions, which trivially give the bound
for satisfying .
Now, these propositions clearly raise the question of whether the constants in them are consistent with the conjectural constant one obtains in Theorem 1.7 with . Let and be the constants predicted by Theorem 1.7. Then, for , and for , .
To show that and , the plan of attack will be to write everything involved as an Euler product, and then compare what happens on both sides in the local factors for different primes .
In particular, recall Ingham’s result that . Thus, using this, we can suppress the local factors for when showing . Rewriting in Euler product form using a standard formula for , we see that
(27) |
Now since for , we get that , where is the principal character modulo , and hence
Recall that
Thus, we see that
(28) |
In light of (27) and (28), it suffices to note the power series equality
for , as then plugging in and taking products over gives us . To see the above power series equality, note that and hence this follows straightforwardly from the geometric series formula.
Now, we turn to showing . Since for , hence and , where denotes Dirichlet convolution. Because is completely multiplicative, . In particular, it follows that depends only on and not the individual characters and . Thus, also depends only on . By inspection, we see that also depends only on . Thus, without loss of generality, we can assume that . It now suffices to show that for , .
For , we see that . Further, . Finally the product over in the expression for vanishes, since . Thus, we get
(29) |
Now, using the Euler product formulae,
and
where the latter holds because , we see that
(30) |
Comparing the local factors corresponding to primes dividing , we see that for these are , while for , they are
Thus, it remains to check the local factors corresponding to primes which are coprime to . For , these are of the shape
while for , these are of the shape
Thus, to prove it clearly suffices to prove the power series equality
for and , as then plugging in , and multiplying both sides by gives us the desired equality.
To prove this power series equality note that both sides are equal to
(31) |
where the sum over runs through all integers in . For the right hand side, this follows from opening the square; for the left hand side it follows from the geometric series formula.
This discussion shows that the conjectural constants from Theorem 1.7 are correct for where are not necessarily distinct Dirichlet characters modulo . One could, in principle, use Topacogullari’s results from [44] to verify the analoguous constants for products of the form with possibly having distinct moduli.
We now return to the proof of Theorem 1.2. We will set in (26), and use the same classification for the different terms that arise in the right hand side of (26) as from Section 6.2.
We state some lemmata. Their proofs are analogous to the corresponding ones from Section 6.2 and hence the details are omitted.
Lemma 6.9.
Suppose that and are distinct characters modulo . Then, for ,
Proof.
This is analogous to Lemma 6.4. ∎
Lemma 6.10.
Suppose that and are tuples of nonnegative integers indexed by characters modulo satisfying . Further, suppose that and corresponds to a minor off-diagonal term. Then, for ,
Proof.
This is analogous to Lemma 6.3. ∎
We can now prove the theorem. Putting in (26), we get
(32) |
We now use Proposition 6.7 to deal with the terms with the primary diagonal terms (i.e. those corresponding to ). The discussion from Section 6.2 tells us that summing the main terms from Proposition 6.7 over contributes , which gives the main term in Theorem 1.2. Note that this matches up with the conjectural constant from Theorem 1.8 for .
It remains to show that all the remaining terms can be absorbed in the error term in Theorem 1.2. We do this by applying Proposition 6.8, Lemma 6.9 and Lemma 6.10 appropriately to terms in (32), depending on their classification. There are such terms in (32), and they each contribute at most . This completes the proof.
References
- [1] J. Andersson. Summation formulae and zeta functions. PhD thesis, Stockholm University, 2006.
- [2] J. Andrade and A. Shamesaldeen. Hybrid Euler-Hadamard Product for Dirichlet -functions with Prime conductors over Function Fields. preprint, arXiv:1909.08953v1, 2019.
- [3] J. C. Andrade, S. M. Gonek, and J. P. Keating. Truncated product representations for -functions in the hyperelliptic ensemble. Mathematika, 64(1):137–158, 2018.
- [4] S. Bettin, H. M. Bui, X. Li, and M. Radziwiłł. A quadratic divisor problem and moments of the Riemann zeta-function. J. Eur. Math. Soc. (JEMS), 22(12):3953–3980, 2020.
- [5] S. Bettin, V. Chandee, and M. Radziwiłł. The mean square of the product of the Riemann zeta-function with Dirichlet polynomials. J. Reine Angew. Math., 729:51–79, 2017.
- [6] J. Bourgain, M. Z. Garaev, S. V. Konyagin, and I. E. Shparlinski. Multiplicative congruences with variables from short intervals. J. Anal. Math., 124:117–147, 2014.
- [7] H. M. Bui and A. Florea. Hybrid Euler-Hadamard product for quadratic Dirichlet -functions in function fields. Proc. Lond. Math. Soc. (3), 117(1):65–99, 2018.
- [8] H. M. Bui, S. M. Gonek, and M. B. Milinovich. A hybrid Euler-Hadamard product and moments of . Forum Math., 27(3):1799–1828, 2015.
- [9] H. M. Bui and J. P. Keating. On the mean values of Dirichlet -functions. Proc. Lond. Math. Soc. (3), 95(2):273–298, 2007.
- [10] H. M. Bui and J. P. Keating. On the mean values of -functions in orthogonal and symplectic families. Proc. Lond. Math. Soc. (3), 96(2):335–366, 2008.
- [11] J. W. S. Cassels. Footnote to a note of Davenport and Heilbronn. J. London Math. Soc., 36:177–184, 1961.
- [12] J. B. Conrey, D. W. Farmer, J. P. Keating, M. O. Rubinstein, and N. C. Snaith. Integral moments of -functions. Proc. London Math. Soc. (3), 91(1):33–104, 2005.
- [13] J. B. Conrey and A. Ghosh. On mean values of the zeta-function. Mathematika, 31(1):159–161, 1984.
- [14] J. B. Conrey and S. M. Gonek. High moments of the Riemann zeta-function. Duke Math. J., 107(3):577–604, 2001.
- [15] H. Davenport and H. Heilbronn. On the Zeros of Certain Dirichlet Series. J. London Math. Soc., 11(3):181–185, 1936.
- [16] G. Djanković. Euler-Hadamard products and power moments of symmetric square -functions. Int. J. Number Theory, 9(3):621–639, 2013.
- [17] S. Gonek, C. Hughes, and J. Keating. A hybrid Euler-Hadamard product for the Riemann zeta function. Duke Math. J., 136(3):507–549, 2007.
- [18] S. M. Gonek. Analytic properties of zeta and -functions. PhD thesis, University of Michigan, 1979.
- [19] S. M. Gonek. The zeros of Hurwitz’s zeta function on . In Analytic number theory (Philadelphia, Pa., 1980), volume 899 of Lecture Notes in Math., pages 129–140. Springer, Berlin-New York, 1981.
- [20] G. H. Hardy and J. E. Littlewood. Contributions to the theory of the riemann zeta-function and the theory of the distribution of primes. Acta Math., 41(1):119–196, 1916.
- [21] A. Harper. Sharp conditional bounds for moments of the Riemann zeta function. preprint, arXiv:1305.4618, 2013.
- [22] W. Heap. The twisted second moment of the Dedekind zeta function of a quadratic field. Int. J. Number Theory, 10(1):235–281, 2014.
- [23] W. Heap. Moments of the Dedekind zeta function and other non-primitive -functions. Math. Proc. Cambridge Philos. Soc., 170(1):191–219, 2021.
- [24] W. Heap. On the splitting conjecture in the hybrid model for the Riemann zeta function. preprint, arXiv:2102.02092, 2021.
- [25] W. Heap, M. Radziwiłł, and K. Soundararajan. Sharp upper bounds for fractional moments of the Riemann zeta function. Q. J. Math., 70(4):1387–1396, 2019.
- [26] W. Heap, A. Sahay, and T. D. Wooley. A paucity problem associated with a shifted integer analogue of the divisor function. Journal of Number Theory, in press, 2022.
- [27] W. Heap and K. Soundararajan. Lower bounds for moments of zeta and -functions revisited. Mathematika, 68(1):1–14, 2022.
- [28] D. R. Heath-Brown. Fractional moments of the Riemann zeta function. J. London Math. Soc. (2), 24(1):65–78, 1981.
- [29] C. P. Hughes and M. P. Young. The twisted fourth moment of the Riemann zeta function. J. Reine Angew. Math., 641:203–236, 2010.
- [30] A. E. Ingham. Mean-Value Theorems in the Theory of the Riemann Zeta-Function. Proc. London Math. Soc. (2), 27(4):273–300, 1927.
- [31] H. Ishikawa. A difference between the values of and . I. Comment. Math. Univ. St. Pauli, 55(1):41–66, 2006.
- [32] J. P. Keating and N. C. Snaith. Random matrix theory and . Comm. Math. Phys., 214(1):57–89, 2000.
- [33] M. Knopp and S. Robins. Easy proofs of Riemann’s functional equation for and of Lipschitz summation. Proc. Amer. Math. Soc., 129(7):1915–1922, 2001.
- [34] A. Languasco and A. Zaccagnini. A note on Mertens’ formula for arithmetic progressions. J. Number Theory, 127(1):37–46, 2007.
- [35] M. B. Milinovich and C. L. Turnage-Butterbaugh. Moments of products of automorphic -functions. J. Number Theory, 139:175–204, 2014.
- [36] M. Radziwiłł and K. Soundararajan. Continuous lower bounds for moments of zeta and -functions. Mathematika, 59(1):119–128, 2013.
- [37] K. Ramachandra. Some remarks on the mean value of the Riemann zeta function and other Dirichlet series. I. Hardy-Ramanujan J., 1:15, 1978.
- [38] K. Ramachandra. Some remarks on the mean value of the Riemann zeta function and other Dirichlet series. II. Hardy-Ramanujan J., 3:1–24, 1980.
- [39] K. Ramachandra. Some remarks on the mean value of the Riemann zeta function and other Dirichlet series. III. Ann. Acad. Sci. Fenn. Ser. A I Math., 5(1):145–158, 1980.
- [40] V. V. Rane. On the mean square value of Dirichlet -series. J. London Math. Soc. (2), 21(2):203–215, 1980.
- [41] K. Soundararajan. Moments of the Riemann zeta function. Ann. of Math. (2), 170(2):981–993, 2009.
- [42] R. Spira. Zeros of Hurwitz zeta functions. Math. Comp., 30(136):863–866, 1976.
- [43] E. Titchmarsh. The theory of the Riemann zeta-function. The Clarendon Press, Oxford University Press, New York, second edition, 1986. Edited and with a preface by D. R. Heath-Brown.
- [44] B. Topacogullari. The fourth moment of individual Dirichlet -functions on the critical line. Math. Z., 298(1-2):577–624, 2021.
- [45] S. M. Voronin. The zeros of zeta-functions of quadratic forms. Trudy Mat. Inst. Steklov., 142:135–147, 269, 1976. Number theory, mathematical analysis and their applications.
- [46] K. S. Williams. Mertens’ theorem for arithmetic progressions. J. Number Theory, 6:353–359, 1974.
- [47] X. Wu. The twisted mean square and critical zeros of Dirichlet -functions. Math. Z., 293(1-2):825–865, 2019.
- [48] T. Zhan. On the mean square of Dirichlet -functions. Acta Math. Sinica (N.S.), 8(2):204–224, 1992. A Chinese summary appears in Acta Math. Sinica 36 (1993), no. 3, 432.