1. Introduction
Estimating the moments of the Riemann zeta function $\zeta(s)$ on the critical line,
is a classical problem in analytic number theory (see [ Reference Titchmarsh43 , chapter VII]). It is widely believed that $M_k(T) \sim c_k T (\!\log T)^{k^2}$ for all real $k \geqslant 0$ , where $c_k$ is a fixed positive constant depending only on k. This conjecture is trivial for $k = 0$ , was proved by Hardy and Littlewood [ Reference Hardy and Littlewood20 ] for $k = 1$ , was proved by Ingham [ Reference Ingham30 ] for $k = 2$ , and is wide open in all other cases.
Despite the history and intractability of the problem, very precise conjectures for the exact value of $c_k$ exist. On the basis of number theoretic calculations, Conrey and Ghosh [ Reference Conrey and Ghosh13 ] conjectured the value of $c_k$ for $k = 3$ and by a different, but still number theoretic, method Conrey and Gonek [ Reference Conrey and Gonek14 ] conjectured the value of $c_k$ for $k = 3,4$ . Finally, using heuristics modeling $\zeta(s)$ by characteristic polynomials of random matrices from the Gaussian unitary ensemble, Keating and Snaith [ Reference Keating and Snaith32 ] conjectured the value of $c_k$ for all $k > 0$ , agreeing with the conjectures from [ Reference Conrey and Ghosh13 ] and [ Reference Conrey and Gonek14 ].
The analogy with random matrix theory has led to many fruitful conjectures for moments of L-functions; see, for example, [ Reference Conrey, Farmer, Keating, Rubinstein and Snaith12 ] and the references therein for details.
A weaker, and hence theoretically more tractable version of the above conjecture is the estimate $M_k(T) \asymp_k T(\!\log T)^{k^2}$ . By work of Ramachandra [ Reference Ramachandra37 , Reference Ramachandra38 , Reference Ramachandra39 ], and Heath–Brown [ Reference Heath–Brown28 ], the lower bound $M_k(T) \gg_k T(\!\log T)^{k^2}$ was known conditionally on the Riemann Hypothesis (RH) for $k>0$ , and by work of Radziwiłł and Soundararajan [ Reference Radziwiłł and Soundararajan36 ], it was known unconditionally for all $k \geqslant 1$ . Recent work of Heap and Soundararajan [ Reference Heap and Soundararajan27 ] establishes the lower bound unconditionally for all $k > 0$ .
For the upper bound, Soundararajan [ Reference Soundararajan41 ] showed on RH that $M_k(T) \ll_{k,\epsilon} T (\!\log T)^{k^2+\epsilon}$ for every $\epsilon > 0$ and $k > 0$ . Harper [ Reference Harper21 ] removed the dependence on $\epsilon$ , conditionally establishing the sharp upper bound for every $k > 0$ . The upper bound was known unconditionally for $k = 1/n$ , $n \in \mathbb{N}$ due to Heath–Brown [ Reference Heath–Brown28 ], and for $k = 1 + 1/n$ , $n \in \mathbb{N}$ due to Bettin, Chandee and Radziwiłł [ Reference Bettin, Chandee and Radziwiłł5 ]. Recently, Heap, Radziwiłł and Soundararajan [ Reference Heap, Radziwiłł and Soundararajan25 ] subsumed both of these results by proving the upper bound unconditionally for $0 \leqslant k \leqslant 2$ .
The object of this paper is to investigate analogous moments of the Hurwitz zeta function, $\zeta(s,\alpha)$ . For $0 < \alpha \leqslant 1$ and for $\Re s > 1$ , $\zeta(s,\alpha)$ 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 $s = 1$ satisfying the Hurwitz relation (an analogue of the functional equation, see [ Reference Knopp and Robins33 ]). Clearly, $\zeta(s,1) = \zeta(s)$ and $\zeta(s,1/2) = (2^s - 1) \zeta(s)$ . For these values of $\alpha$ , thus, $\zeta(s,\alpha)$ has an Euler product, derived from the usual Euler product for $\zeta(s)$ . However, for $0 < \alpha < 1$ , $\alpha \neq 1/2$ , $\zeta(s,\alpha)$ does not have an Euler product, and, in fact, the behaviour of its zeroes is very different from that of $\zeta(s)$ . Spira [ Reference Spira42 ] showed that, like $\zeta(s)$ , $\zeta(s,\alpha)$ may have trivial zeros on the negative real line, and also that $\zeta(s,\alpha)$ is zero-free in the region $\Re s \geqslant 1 + \alpha$ . However, it is well–known, due to Davenport and Heilbronn [ Reference Davenport and Heilbronn15 ] for the cases of rational or transcendental $\alpha$ , and due to Cassels [ Reference Cassels11 ] for the case of algebraic irrational $\alpha$ , that if $\alpha \neq 1/2,1$ , then $\zeta(s,\alpha)$ always has a zero in the strip $1 < \Re s < 1 + \delta$ for every $\delta > 0$ . Voronin showed [ Reference Voronin45 ] that for rational $\alpha \neq 1/2, 1$ , and fixed $\sigma_1,\sigma_2$ with $1/2 < \sigma_1 < \sigma_2 < 1$ , there are infinitely many zeros of $\zeta(s,\alpha)$ satisfying $\sigma_1<\Re s < \sigma_2$ . This result was established also for transcendental $\alpha$ by Gonek [ Reference Gonek18 ]. Finally, Gonek [ Reference Gonek19 ] showed that if $\alpha = a/q$ with $(a,q) = 1$ , and $\varphi(q) = 2$ , where $\varphi$ is Euler’s totient function, then $\zeta(s,\alpha)$ has a positive proportion of its nontrivial zeros off the critical line $\Re s = 1/2$ . All of these are in contrast to the expected behaviour of $\zeta(s)$ .
To study the moments of the Hurwitz zeta functions in the critical line, we define in analogy with $M_k(T)$ ,
so that $M_k(T;\,1) = M_k(T)$ . One might expect the following:
Conjecture 1·1. Let $0 < \alpha \leqslant 1$ be a fixed rational and $k > 0$ be a fixed real number. Then for some constant $c_k(\alpha)$ , we have
as $T \to \infty$ .
When $k = 1$ , this is a theorem due to Rane [ Reference Rane40 , theorem 2], with $c_1(\alpha) = 1$ . In fact, he proved for $0<\alpha \leqslant 1$ (not necessarily rational),
uniformly in $\alpha$ and T with an effective constant $B(\alpha)$ . This was improved further by several authors, with the current best error term due to Zhan [ Reference Zhan48 , theorem 2].
Winston Heap (private communication) has indicated that the above conjecture may not extend to irrational shifts $\alpha$ if $k \neq 1$ , 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 [ Reference Heap, Sahay and Wooley26 ] (see also [ Reference Bourgain, Garaev, Konyagin and Shparlinski6 , theorem 26]).
For $k = 2$ , the conjecture can be proved using methods for fourth moments of L-functions of degree 1. This was done in an unpublished section of Andersson’s thesis [ Reference Andersson1 , pp. 71-72]. We restate and reprove this result here for convenience:
Theorem 1·2. Let $a,q \geqslant 1$ be fixed integers with $(a,q) = 1$ , $1 \leqslant a \leqslant q$ . Then, for $\alpha = a/q$ ,
as $T \to \infty$ . That is, Conjecture 1·1 is true for $k = 2$ and $\alpha = a/q$ , with
where $c_2 = c_2(1) = 1/(2\pi^2)$ is the usual proportionality constant for the fourth moment of $\zeta(s)$ . More precisely, we have
We show later that this agrees with our conjecture for $c_k(\alpha)$ . In principle, one could also work out the lower order terms in this asymptotic.
Our aim for the rest of the paper is to provide evidence for Conjecture 1·1 when $k\in\mathbb{N}$ . In this case, $M_k(T;\,\alpha)$ can be related to the mean square of products of Dirichlet L-functions on the critical line.
To explain this connection, we fix some notation that will be used throughout the paper. We assume $\alpha = a/q$ with $(a,q) = 1$ and $1 \leqslant a \leqslant q$ . Dirichlet characters will be denoted $\chi$ or $\nu$ , and will be modulo q unless noted otherwise. We will use bolded, lower case (Greek or Latin) letters such as $\boldsymbol{\ell}$ for tuples of natural numbers indexed by characters modulo q. Thus, if $\boldsymbol{\ell}$ is such a tuple, we think of it as a function $\boldsymbol{\ell}\,:\, \mathcal{D}(q) \to \mathbb{N}$ where $\mathcal{D}(q)$ is the set of Dirichlet characters modulo q. We denote $\boldsymbol{\ell}(\chi)$ as $\ell_\chi$ . Further, we define,
Here, and later, sums and products over $\chi$ or $\nu$ run over $\mathcal{D}(q)$ . If $\boldsymbol{\ell}$ is clear from context, we suppress it and denote $\lambda(\boldsymbol{\ell})$ simply as $\lambda$ . Finally, we denote by $d_{\boldsymbol{\ell}}(n)$ the coefficient of $n^{-s}$ in the Dirichlet series expansion of $\mathcal{L}^{\boldsymbol{\ell}}(s)$ .
To see how products of the form $\mathcal{L}^{\boldsymbol{\ell}}(s)$ arise naturally in considering Conjecture 1·1 for $\alpha = a/q$ , we observe that for $\Re{s} > 1$ , the orthogonality of Dirichlet characters gives
By analytic continuation, this equality holds everywhere. Thus, by the multinomial theorem
where $\binom{k}{\boldsymbol{\ell}}=k!/\prod_\chi \ell_\chi!$ are multinomial coefficients, the sums runs over $\boldsymbol{\ell}$ such that $|\boldsymbol{\ell}| = \sum_{\chi} \ell_{\chi} = k$ , and $s(a;\,\boldsymbol{\ell}^{(1)},\boldsymbol{\ell}^{(2)}) = \prod_{\chi} \chi(a)^{\ell^{(2)}_{\chi} - \ell^{(1)}_{\chi}}$ . In particular, when we integrate both sides from $1/2 + iT$ to $1/2 + i2T$ , 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 $\boldsymbol{\ell}^{(1)} = \boldsymbol{\ell}^{(2)}$ where the phases of each term in the product cancel out, yielding a positive real number. Thus, heuristically,
whence, the problem of estimating $M_k(T;\,\alpha)$ naturally reduces to studying the mean square of $\mathcal{L}^{\boldsymbol{\ell}}(s)$ 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 [ Reference Gonek, Hughes and Keating17 ] in the context of the Riemann zeta function. Specifically, we will need the following version for Dirichlet L-functions in the t-aspect:
Theorem 1·3. Let $s = \sigma + it$ with $\sigma \geqslant 0$ and $|t| \geqslant 2$ , let $X \geqslant 2$ be a real parameter, and let K be any fixed positive integer. Further, let f(x) be a non-negative $C^\infty$ -function of mass one supported on $[0, 1]$ , and set $u(x) = Xf(X\log\!(x/e) + 1)/x$ so that u is a non-negative $C^\infty$ -function of mass one supported on $[e^{1 - 1/X},e]$ . Set
where $E_1(z) = \int_z^\infty e^{-w}w^{-1} \,dw$ is the exponential integral.
Let q be a fixed positive integer, and $\chi$ be a Dirichlet character modulo q with conductor $q^*(\chi)$ . Further, suppose that $\chi$ is induced by the primitive character $\chi^*$ modulo $q^*(\chi)$ . Then,
where
and
The implied constants are uniform in all parameters including q, unless indicated otherwise.
Such a hybrid Euler–Hadamard product was proved by Bui and Keating [ Reference Bui and Keating9 ] in their study of moments in the q-aspect of Dirichlet L-functions at the central point $s = 1/2$ (see [ Reference Bui and Keating9 , 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 L-functions [ Reference Bui and Keating10 ]; for $\zeta^{\prime}(s)$ [ Reference Bui, Gonek and Milinovich8 ]; for the Dedekind zeta function $\zeta_{\mathbb{K}}(s)$ of a Galois extension $\mathbb{K}$ of $\mathbb{Q}$ [ Reference Heap23 ]; for quadratic Dirichlet L-functions over function fields [ Reference Bui and Florea7 ], [ Reference Andrade, Gonek and Keating3 ]; for normalised symmetric square L-functions associated with $SL_2(\mathbb{Z})$ eigenforms [ Reference Djanković16 ]; and for quadratic Dirichlet L-functions over function fields associated to irreducible polynomials [ Reference Andrade and Shamesaldeen2 ].
With $P(s,\chi)$ and $Z(s,\chi)$ as in Theorem 1·3, we define
We can view $\mathcal{L}^{\boldsymbol{\ell}}(s)$ as an L-function of degree $|\boldsymbol{\ell}|$ , $\mathcal{P}_X^{\boldsymbol{\ell}}(s)$ as an approximation to its Euler product, and $\mathcal{Z}_X^{\boldsymbol{\ell}}(s)$ as an approximation to its Hadamard product. Roughly, Theorem 1·3 implies that $\mathcal{L}^{\boldsymbol{\ell}}(s) \approx \mathcal{P}_X^{\boldsymbol{\ell}}(s) \mathcal{Z}_X^{\boldsymbol{\ell}}(s)$ .
As is usually the case with hybrid Euler–Hadamard products, X 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 X growing relatively slowly with T, we expect the two terms in the decomposition $\mathcal{L}^{\boldsymbol{\ell}}(s) \approx \mathcal{P}_X^{\boldsymbol{\ell}}(s) \mathcal{Z}_X^{\boldsymbol{\ell}}(s)$ to behave like independent random variables due to a separation of scales. This is analogous to the splitting conjecture of Gonek, Hughes and Keating [ Reference Gonek, Hughes and Keating17 , conjecture 2]. Concretely, we have:
Conjecture 1·4 (Splitting). Let $X, T \to \infty$ with $X \ll_\epsilon (\!\log T)^{2-\epsilon}$ . Then, for any tuple of nonnegative integers $\boldsymbol{\ell}$ indexed by characters modulo q, we have for $s = 1/2 + it$ ,
On [ Reference Gonek, Hughes and Keating17 , p. 511], it is suggested that this splitting conjecture holds for a much wider range of X and T with $X = o(T)$ . Recently, Heap [ Reference Heap24 ] has justified this suggestion. He proved on RH that the splitting conjecture for $\zeta(s)$ holds for every $k>0$ and a much wider range of X provided one requires only an order of magnitude result, instead of an asymptotic. He also established the splitting conjecture for $k = 1$ and $k = 2$ for wider ranges of X both with and without RH.
The mean square of $\mathcal{P}_X^{\boldsymbol{\ell}}(s)$ can be computed exactly.
Theorem 1·5. Let $k \geqslant 0$ be a fixed integer and $\epsilon > 0$ be fixed. Let $\boldsymbol{\ell}$ be a tuple of nonnegative integers indexed by characters modulo q such that $|\boldsymbol{\ell}| = \sum_\chi \ell_\chi = k$ . Finally, suppose that $q^2 < X \ll_\epsilon (\!\log T)^{2 - \epsilon)}$ . Then for $s = 1/2+it$ ,
where $b(\boldsymbol{\ell})$ and $F_X(\boldsymbol{\ell})$ are given by
where $\gamma$ is the Euler–Mascheroni constant, $d_{\boldsymbol{\ell}}(n)$ is the coefficient of $n^{-s}$ in the Dirichlet series for $\mathcal{L}^{\boldsymbol{\ell}}(s)$ , and $\lambda = \sum_\chi \ell_\chi^2$ .
One could prove a similar result uniformly in c on any vertical line $\Re{s}=\sigma$ with $1>\sigma\geqslant c \geqslant 1/2$ given $X \ll_\epsilon (\!\log T)^{1/(1-c+\epsilon)}$ , but we choose not to do so for conciseness. Note that the product over p in (1·6) is conditionally convergent but not absolutely convergent.
For the mean square of $\mathcal{Z}_X^{\boldsymbol{\ell}}(s)$ , we use random matrix theory to model each L-function appearing in the product by random unitary matrices. One expects that the matrices representing distinct L-functions behave independently as in [ Reference Heap23 , conjecture 2]. This leads to:
Conjecture 1·6. Suppose that $X, T \to \infty$ with $X \ll_\epsilon (\!\log T)^{2-\epsilon}$ . Then, for any tuple $\boldsymbol{\ell}$ of nonnegative integers indexed by characters modulo q, we have for $s = 1/2 + it$ ,
where $G({\cdot})$ is the Barnes G-function, and $q^*(\chi)$ is the conductor of $\chi$ .
It is clear that one can use Conjectures 1·4 and 1·6 together with Theorem 1·5 to get a conjectural asymptotic for $\int_T^{2T}|\mathcal{L}^{\boldsymbol{\ell}}(1/2+it)|^2\,dt$ . Precisely, we get,
Theorem 1·7. If Conjecture 1·4 and Conjecture 1·6 are true for a tuple of nonnegative integers $\boldsymbol{\ell}$ indexed by characters modulo q satisfying $|\boldsymbol{\ell}| = k$ , then we have for $s = 1/2 + it$ ,
where $c_{\boldsymbol{\ell}}(q)$ is given by
Here $\lambda$ , and $G({\cdot})$ and $q^*(\chi)$ are the same as above.
Note that for a fixed q, the above says that the mean square of a product of Dirichlet L-functions grows as $\asymp_{k,q} T(\!\log T)^\lambda$ . This is known for $|\boldsymbol{\ell}| \leqslant 2$ , 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 L-functions from the Selberg class (see [ Reference Heap23 , section 6]) using the recipe of Conrey, Farmer, Keating, Rubinstein and Snaith [ Reference Conrey, Farmer, Keating, Rubinstein and Snaith12 ]. Specialising to Dirichlet L-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 (1·4) and Theorem 1·7 can together be used to compute the correct value of $c_k(\alpha)$ in Conjecture 1·1.
Theorem 1·8. Let $k \geqslant 0$ and $a,q \geqslant 1$ be fixed integers with $(a,q) = 1$ , $1\leqslant a\leqslant q$ . If Conjecture 1·4 and Conjecture 1·6 are true for all tuples of nonnegative integers $\boldsymbol{\ell}$ indexed by characters modulo q satisfying $|\boldsymbol{\ell}| = k$ , then Conjecture 1·1 follows for that value of k and $\alpha = a/q$ with
where $c_k = c_k(1)$ is the usual proportionality constant for moments of $\zeta(s)$ . In other words, under the above hypotheses,
as $T \to \infty$ where $c_k(\alpha)$ is as in (1·7).
Since the current levels of technology can handle second moments and fourth moments of $\zeta(s)$ really well, it is natural to hope that we can prove Conjectures 1·4 and 1·6 for $|\boldsymbol{\ell}|\leqslant 2$ . We define the Kronecker delta $\boldsymbol{\delta}^\chi$ by
Then, we can prove:
Theorem 1·9. Conjecture 1·4 and Conjecture 1·6 hold unconditionally for $|\boldsymbol{\ell}| = 1$ . In particular $|\boldsymbol{\ell}| = 1$ if and only if $\boldsymbol{\ell} = \boldsymbol{\delta}^\chi$ for some character $\chi$ , in which case we have that for $s = 1/2 + it$ , and $X,T \to \infty$ with $X \ll_\epsilon (\!\log T)^{2-\epsilon}$ ,
and
The above theorem can almost certainly be extended to the case $|\boldsymbol{\ell}| = 2$ . This corresponds to $\boldsymbol{\ell} = \boldsymbol{\delta}^\chi + \boldsymbol{\delta}^\nu$ , and $\mathcal{L}^{\boldsymbol{\ell}}(s) = L(s,\chi)L(s,\nu)$ with $\chi$ and $\nu$ not necessarily distinct characters modulo q.
We note first that some of these have already been proved. The case $\boldsymbol{\ell} = 2\boldsymbol{\delta}^{\chi_0}$ where $\chi_0$ is the principal character modulo q was essentially proved by Gonek, Hughes and Keating [ Reference Gonek, Hughes and Keating17 , theorem 3]. More generally, the case $\boldsymbol{\ell} = \boldsymbol{\delta}^{\chi_0} + \boldsymbol{\delta}^\chi$ where $\chi$ is a (not necessarily primitive) quadratic Dirichlet character modulo q was essentially proved by Heap [ Reference Heap23 , theorem 3]. To see this, note from (2·3) that $Z_X(s,\chi)$ depends only on the primitive character $\chi^*$ modulo $q^*(\chi)$ that induces $\chi$ . In particular, one can replace $L(s,\chi_0)^2$ with $\zeta(s)^2$ and $L(s,\chi_0)L(s,\chi)$ with $\zeta(s)L(s,\chi^*) = \zeta_{\mathbb{K}}(s)$ where $\mathbb{K}$ is a quadratic extension of $\mathbb{Q}$ and $\zeta_{\mathbb{K}}(s)$ 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 $\boldsymbol{\ell} = \boldsymbol{\delta}^\chi + \boldsymbol{\delta}^\nu$ . To do so, one would need a moment result for the product of two primitive Dirichlet L-functions and a short Dirichlet polynomial, generalising that of [ Reference Heap22 ]. That is, we would need an asymptotic for
where $\chi$ and $\nu$ are any primitive characters with conductor dividing q, and some $0<\theta<1$ sufficiently large. Such asymptotics exist in the special cases of $\zeta(s)^2$ [ Reference Bettin, Bui, Li and Radziwiłł4 , Reference Hughes and Young29 ] and $\zeta(s)L(s,\chi)$ [ Reference Heap22 ], for any character $\chi$ . Proving (1·9) and the splitting conjecture for $\boldsymbol{\ell} = \boldsymbol{\delta}^\chi + \boldsymbol{\delta}^\nu$ for more general $\chi,\nu$ by using the methods of [ Reference Heap23 ], [ Reference Heap22 ] and [ Reference Bui and Florea7 ] 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 $k = 1$ and $\alpha$ rational, giving an alternate proof of the leading term of Rane’s asymptotic (1·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 $k \geqslant 0$ and $a,q \geqslant 1$ be fixed integers with $(a,q) = 1$ , $1\leqslant a\leqslant q$ . If the Generalised Riemann Hypothesis (GRH) holds for every Dirichlet L-function modulo q, then for $\alpha = a/q$ , $s = 1/2 + it$ and $\epsilon>0$ ,
In principle, it should be possible to remove the $\epsilon$ in the upper bound by using the methods of Harper [ Reference Harper21 ].
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. $|\boldsymbol{\ell}| \leqslant 2$ or $k \leqslant 2$ ).
2. Proof of Theorem 1·3
The proof of Theorem 1·3 is very similar to [ Reference Gonek, Hughes and Keating17 , theorem 1] and [ Reference Bui and Keating9 , theorem 1]. The main difference lies in the fact that we are not assuming that the character is primitive.
Recall that if $\chi$ and $\chi^*$ are as in the theorem, then
Further, by inspection we see that if $P(s,\cdot)$ and $Z(s,\cdot)$ are as in the theorem, then
Clearly, (2·1),(2·2) and (2·3) show that we can assume without loss of generality that $\chi$ is a primitive character modulo q.
At this point, one can follow [ Reference Gonek, Hughes and Keating17 , theorem 1] and [ Reference Bui and Keating9 , theorem 1] mutatis mutandis to complete the proof.
3. Proof of Theorem 1·5
We briefly discuss some notation for this section. Recall that $d_{\boldsymbol{\ell}}(n)$ is the coefficient of $n^{-s}$ in the Dirichlet series of $\mathcal{L}^{\boldsymbol{\ell}}(s)$ . $d_{\boldsymbol{\ell}}(n)$ is essentially a divisor function ‘twisted’ by the Dirichlet characters modulo q. We also use $d_k(n)$ for the true divisor function, i.e., the coefficient of $n^{-s}$ in $\zeta(s)^k$ . In particular, it is immediate from writing $d_{\boldsymbol{\ell}}(n)$ out as a convolution that $|d_{\boldsymbol{\ell}}(n)|\leqslant d_k(n)$ for every $n \in \mathbb{N}$ . We will use the notation $\mathscr{S}_q(X)$ to denote the set of X-smooth (also known as X-friable) numbers which are coprime to q. That is,
We will need as a lemma, Mertens’ theorem for arithmetic progressions:
Lemma 3·1. Let $\kappa$ be a fixed real number, and $(c,q) = 1$ . Then,
where
Here $\gamma$ is the Euler–Mascheroni constant and $\delta_q(x,y)$ is the Kronecker delta in $\mathbb{Z}/{q}\mathbb{Z}$ ,
Proof. Clearly the result for general $\kappa \in \mathbb{R}$ follows from the case $\kappa = 1$ by exponentiating. The latter is precisely Merten’s theorem for arithmetic progressions which was proved by Williams [ Reference Williams46 ]. The expression for the constant $H^q_c(1)$ , however, is due to Languasco and Zaccagnini [ Reference Languasco and Zaccagnini34 ], section 6] who also improved the error term to one uniform in q. The weaker form suffices for our purposes.
We also have the following, which is immediate from [ Reference Bui and Keating9 , lemma 3]:
Lemma 3·2. Let $\boldsymbol{\ell}$ be a tuple of nonnegative integers indexed by characters modulo q such that $|\boldsymbol{\ell}| = \sum_\chi \ell_\chi = k$ , let
and let
Then, uniformly for $\sigma \geqslant 1/2$ and $X > q^2$ ,
Proof. From [ Reference Bui and Keating9 , lemma 3], we get that
where $\chi^*$ is the primitive character modulo $q^*(\chi)$ which induces $\chi$ . Since $X > q^2$ , we see that $p \mid q$ implies that $p \leqslant \sqrt{X}$ . Thus, by inspection,
Putting the above two equalities together with (2·2), we get that
The lemma follows by taking a product over characters $\chi$ modulo q.
For the rest of this section, we will fix $s = 1/2 + it$ . Now, we want to estimate $\int_T^{2T} \left|\mathcal{P}_X^{\boldsymbol{\ell}}(s)\right|^2 dt$ assuming that $q^2 < X \ll_\epsilon (\!\log T)^{2-\epsilon}$ . Clearly, by Lemma 3·2,
and so it suffices to compute $\int_T^{2T} \big|\mathcal{P}_X^{*\boldsymbol{\ell}}(s)\big|^2\,dt$ .
From the definition of $\mathcal{P}_X^{*\boldsymbol{\ell}}(s)$ in Lemma 3·2, it follows that if
then $\beta_{\boldsymbol{\ell}}(n)$ is multiplicative and supported on $\mathscr{S}_q(X)$ , $|\beta_{\boldsymbol{\ell}}(n)| \leqslant d_{2k}(n)$ for all n, and finally for $n \in \mathscr{S}_q(\sqrt{X})$ and $p\in \mathscr{S}_q(X)$ , we have $\beta_{\boldsymbol{\ell}}(n) = d_{\boldsymbol{\ell}}(n)$ and $\beta_{\boldsymbol{\ell}}(p) = d_{\boldsymbol{\ell}}(p)$ .
We truncate the sum in (3·1) at $T^\theta$ where $\theta>0$ will be chosen later. Thus,
Applying Rankin’s trick and the estimate $|\beta_{\boldsymbol{\ell}}(n)| \leqslant d_{2k}(n)$ to the error term, we see that it is
Using $\log\!(1-x)^{-1} = O(x)$ , we see that the product on the right is
Applying the prime number theorem and integrating by parts, we see that since $X \ll_\epsilon (\!\log T)^{2-\epsilon}$ , this is
Hence, we have
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 $O_{k,\epsilon,\theta}\left(T^{-\epsilon\theta/2}\right)$ , by the same argument as before. Thus, setting $\theta = 1/2$ , we see that
Using (3·2) to replace $\mathcal{P}_X^{*\boldsymbol{\ell}}(s)$ with a short Dirichlet polynomial together with (3·3) and Cauchy–Schwarz, we conclude that
Thus, it remains to estimate the sum $\sum_{n\in\mathscr{S}_q(X)} {|\beta_{\boldsymbol{\ell}}(n)|^2}/{n}$ . Since $\beta_{\boldsymbol{\ell}}$ is multiplicative and supported on $\mathscr{S}_q(X)$ , we see that
Heuristically, $\beta_{\boldsymbol{\ell}}(n)$ was chosen to approximate $d_{\boldsymbol{\ell}}(n)$ . So, we expect that we can replace $\beta_{\boldsymbol{\ell}}(p^m)$ with $d_{\boldsymbol{\ell}}(p^m)$ on the right with a tolerable multiplicative error. Now, recall that $\beta_{\boldsymbol{\ell}}(n) = d_{\boldsymbol{\ell}}(n)$ when $n \in \mathscr{S}_q(\sqrt{X})$ , and $\beta_{\boldsymbol{\ell}}(p) = d_{\boldsymbol{\ell}}(p)$ for $p \leqslant X$ . Thus, we can replace $\beta_{\boldsymbol{\ell}}(p^m)$ by $d_{\boldsymbol{\ell}}(p^m)$ if $p \leqslant \sqrt{X}$ or $m =1$ . Hence, it suffices to bound
However, this is clearly
Thus,
Note that we can write the product on the right as
The constraint $p\leqslant X$ can be removed from the first product here as that induces a multiplicative error given by
On doing so, the expression now looks like
Now, define
In particular, note that $r_\chi = r_{\overline{\chi}}$ and $r_{\chi_0} = \sum_{\chi} \ell_\chi^2 = \lambda$ . Further, define,
Clearly $\kappa(c)$ is real, and further the definition of $d_{\boldsymbol{\ell}}(n)$ as a convolution gives us that
if $p \equiv c \pmod q$ . In particular, this means that the product in (3·5) can be divided along congruence classes modulo q, giving
where the outside product runs over a set of representatives of all residue classes coprime to q. Thus, applying Lemma 3·1, this is
In fact, we have that $F_X(\boldsymbol{\ell}) = \prod_{(c,q) = 1} H^q_c(\kappa(c))$ . 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 [ Reference Heap23 , section 4] and [ Reference Gonek, Hughes and Keating17 , section 4]. We want to heuristically estimate
for $s = 1/2 + it$ . The factor $Z_X(s,\chi)$ arises as a partial Hadamard product for $L(s,\chi^*)$ , where $\chi^*$ is the unique primitive character that induces $\chi$ . For a fixed $\chi$ , $L(s,\chi^*)$ in the t-aspect forms a unitary family, and so we replace each $Z_X(s,\chi)$ with a unitary matrix chosen uniformly with respect to the Haar measure.
The approximate mean density of the zeros of $L(s,\chi^*)$ in the region $0\leqslant \sigma \leqslant 1$ and $T \leqslant t \leqslant 2T$ is given by
where $q^*(\chi)$ is the conductor of $\chi$ . The rescaled zeroes of $L(s,\chi^*)$ at height T are well-modeled by the eigenangles of a uniformly sampled unitary matrix $\mathfrak{U}(N(\chi))$ of size $N(\chi) = \left\lfloor{\mathfrak{D}(\chi,T)}\right\rfloor$ .
We now assume the Generalised Riemann Hypothesis for all characters modulo q. Thus, the non-trivial zeros of $L(s,\chi^*)$ are of the form $1/2 + i\gamma(\chi)$ where $\gamma$ runs over a discrete (multi)set of real numbers depending on $\chi$ . Now, consider the trignometric integral
If $E_1(z) = \int_z^\infty e^{-w} w^{-1}\, dw$ is the exponential integral as in Theorem 1·3, then $\Re\{E_1(ix)\} = - \textrm{Ci}(|x|)$ .
Hence, using the definition of $\mathcal{Z}_X^{\boldsymbol{\ell}}(s)$ and $Z_X(s,\chi)$ ,
where u(y) is a non-negative function of mass 1 supported in $\left[e^{1-1/X},e\right]$ , as in Theorem 1·3, and we have used GRH. Now, following [ Reference Heap23 , equation 4·8], if we define $\phi(m,\theta)$ by,
then we see that the above integral is modeled by
where $\theta_n(\chi)$ is the nth eigenangle of $\mathfrak{U}(N(\chi))$ . Here, the expectation is taken against the probability space from which the random matrices $\mathfrak{U}(N(\chi))$ are drawn. In particular, we make an independence assumption between the $\mathfrak{U}(N(\chi))$ for any finite set of distinct characters $\chi$ , similar to [ Reference Heap23 ]. Thus, the expectation factorises, giving
We can now use [ Reference Gonek, Hughes and Keating17 , theorem 4] (see also [ Reference Heap23 , equation 4·10]), to compute the expectation inside. This gives us
Finally, recall that $N(\chi) \approx \log\!(q^*(\chi) T)$ , completing the heuristic.
5. Proof of Theorem 1·9
We begin this section by observing that to prove Theorem 1·9 for $|\boldsymbol{\ell}| = 1$ , it suffices to verify Conjecture 1·6 for $|\boldsymbol{\ell}| = 1$ . To see this note that $|\boldsymbol{\ell}| = 1$ is the same as $\boldsymbol{\ell} = \boldsymbol{\delta}^\chi$ . Now, it is well known (see, for example, Lemma 5·2) that for a fixed q,
Further, putting $\boldsymbol{\ell} = \boldsymbol{\delta}^\chi$ in Theorem 1·5 gives
provided that $q^2 < X \ll_\epsilon (\!\log T)^{2-\epsilon}$ . Finally, Conjecture 1·6 for $\boldsymbol{\ell} = \boldsymbol{\delta}^\chi$ states that for $X,T \to \infty$ with $X \ll_\epsilon (\!\log T)^{2-\epsilon}$ ,
Thus, we see that if we can prove (5·1), then Theorem 1·9 follows.
Our first step towards proving (5·1) is the following lemma which is a straightforward corollary of Lemma 3·2:
Lemma 5·1. Let $\boldsymbol{\ell}$ be a tuple of nonnegative integers indexed by characters modulo q such that $|\boldsymbol{\ell}| = \sum_\chi \ell_\chi = k$ , define
and define
Then, uniformly for $\sigma \geqslant 1/2$ and $X > q^2$ ,
Proof. Clearly it suffices to restrict ourselves to $\boldsymbol{\ell} = \boldsymbol{\delta}^\chi$ . Then, by Lemma 3·2,
as desired.
In view of the previous lemma and Theorem 1·3, to prove (5·1) we want to show
Furthermore, we can assume without loss of generality that $\chi$ is primitive. To see this, let $\chi^*$ be the Dirichlet character modulo $q^*(\chi)$ which induces $\chi$ . Then, $L(s,\chi)$ and $L(s,\chi^*)$ differ only by local factors corresponding to primes p dividing q but not dividing $q^*(\chi)$ and similarly for $X > q^2$ , $Q_X(s,\chi)$ and $Q_X(s,\chi^*)$ also differ only by local factors corresponding to such p. In particular, we see that on multiplying these local factors cancel out, giving $L(s,\chi)Q_X(s,\chi) = L(s,\chi^*)Q_X(s,\chi^*)$ .
Thus, for $\chi$ primitive, we want to show that
To evaluate a mean square like this, we need a second moment asymptotic for a Dirichlet L-function twisted by a short Dirichlet polynomial. We use one proved by Wu [ Reference Wu47 ]:
Lemma 5·2. Let $\chi$ be a primitive Dirichlet character modulo q with $\log q = o(\!\log T)$ , let $\theta>0$ be a parameter, and let b(n) be an arithmetic function satisfying $b(n) \ll_\epsilon n^\epsilon$ for all $\epsilon>0$ . Further, let
and
with $C = 2\gamma - 1 + 2\log 2$ . Then,
where the parameter $\varepsilon_\theta$ depends on $\theta$ , and $\varepsilon_\theta > 0$ when $\theta < 17/33$ .
Proof. This is contained in [ Reference Wu47 , theorem 1·1].
Now, writing $Q_X(s,\chi)$ as a Dirichlet series, we have
where $\beta_{-1}(n)$ is multiplicative and supported on $\mathscr{S}_q(X)$ , $|\beta_{-1}(n)|\ll d(n)$ , and for $n \in \mathscr{S}_q(\sqrt{X})$ and $p \in \mathscr{S}_q(X)$ , we have $\beta_{-1}(n) = \mu(n)\chi(n)$ and $\beta_{-1}(p) = \mu(p)\chi(p)$ .
Now, further, define $Q_X(s) = Q_X(s,1)$ where 1 here is the sole character modulo 1, and let
Then we see that $\alpha_{-1}(n)$ as defined above is the same as in [ Reference Gonek, Hughes and Keating17 , section 5], and further it is immediate that for $n \in \mathscr{S}_q(X)$ , $\beta_{-1}(n) = \alpha_{-1}(n)\chi(n)$ .
Mimicking the argument for (3·2), one can show that
for $\epsilon>0$ small enough.
Putting $\theta = 1/20$ , and $b(n) = \alpha_{-1}(n)$ in Lemma 5·2, we get that
with $M = M_{\frac{1}{20}}$ , $M^{\prime} = M^{\prime}_{\frac{1}{20}}$ and $\varepsilon = \varepsilon_{\frac{1}{20}}>0$ .
We first compute the main term $M^{\prime}(T;\,\chi,\alpha_{-1})$ . Since, $[m,n](m,n) = mn$ , $M^{\prime}(\chi,\alpha_{-1},T)$ is
Now, note that any estimates [ Reference Gonek, Hughes and Keating17 , pp. 530–531] can be applied to the above, provided we add the restrictions $(m,q) = (n,q) = (g,q) = 1$ to the sums, and replace $\log T$ with $\log qT$ . In particular, following the argument for [ Reference Gonek, Hughes and Keating17 , equation 34], we conclude that $M^{\prime}(T;\,\chi,\alpha_{-1})$ is
Since $\sum_{\substack{g \mid m \\ g \mid n}} \varphi(g) = (m,n)$ , the inner sum is
Following the argument for [ Reference Gonek, Hughes and Keating17 , equation 37] here, we can extend both the summations above to infinity to get that $M^{\prime}(T;\,\chi,\alpha_{-1})$ is
By the muliplicativity of $\alpha_{-1}$ and $\varphi$ , the sum here can be written as an Euler product
Now, recalling that $\alpha_{-1}(n) = \mu(n)$ if $n \in \mathscr{S}_q(\sqrt{X})$ , $\alpha_{-1}(p) = \mu(p)$ for all $p \leqslant X$ and $\alpha_{-1}(n) \ll d(n)$ for all $n \in \mathscr{S}_q(X)$ , we get that this product is equal to
Thus, since $\log X \ll \log\log T$ , we see that, in fact
Writing (5·2) with $\theta = 1/20$ as $Q_X(1/2+it,\chi) = Q^*_X + O(T^{-\epsilon/200})$ ,
The first term here is $M^{\prime}(T;\,\chi,\alpha_{-1}) + O(T^{-\varepsilon})$ . The last term is $\ll_q T^{-\epsilon/200}$ since the second moment of $L(s,\chi)$ is $\ll_q T\log T$ . Finally, by Cauchy–Schwarz and (5·4), the second term is
Putting these estimates together with (5·4), we get that
for some $\vartheta = \vartheta(\epsilon,\varepsilon_{\frac{1}{20}}) > 0$ , completing the proof of Theorem 1·9.
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:
-
(i) the Generalised Riemann Hypothesis holds for $L(s,\chi)$ for every character $\chi$ modulo q. We denote this by $\textsf{GRH}(q)$ ;
-
(ii) the mean squares of $\mathcal{L}^{\boldsymbol{\ell}}(s)$ on the critical line for all $|\boldsymbol{\ell}| = k$ satisfy Conjecture 1·4 and Conjecture 1·6. We denote this by $\textsf{Sp}(q,k)$ , for splitting conjecture.
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 L-functions
In this subsection, we will prove Theorem 1·7. This is straightforward. By Theorem 1·5, we get that assuming we hold $q, \boldsymbol{\ell}$ and $\epsilon$ fixed, and let $X, T \to \infty$ with $X \ll_\epsilon (\!\log T)^{2-\epsilon}$ ,
Further, since we are assuming Conjecture 1·6 for $\boldsymbol{\ell}$ , we get that under the same conditions as before,
Finally, since we are assuming that Conjecture 1·4 is true for $\boldsymbol{\ell}$ , we get that for X, T as before,
Multiplying (6·1) and (6·2) and inserting above, we see that the $(e^\gamma \log X)^\lambda$ factors cancel out, and the constants combine to become $c_{\boldsymbol{\ell}}(q)$ , giving
as desired.
6·2. Computing $c_k(\alpha)$
The main result of this subsection is the following proposition which is one way to make the heuristic in (1·4) rigorous:
Proposition 6·1. Let $M_k(T;\,\alpha)$ be as in (1·1), and for any Dirichlet character $\chi$ modulo q, define $M_k(T;\,\chi)$ by
If either $\textsf{GRH}(q)$ or $\textsf{Sp}(q,k)$ holds, and $\alpha = a/q$ with $(a,q) = 1$ , then
If $k = 1$ or $k = 2$ , 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, $\textsf{Sp}(q,k)$ holds, and hence so does the conclusion of Theorem 1·7. Thus, for a fixed $q,\chi$ , and with $\boldsymbol{\ell} = k\boldsymbol{\delta}^\chi$ , we get the asymptotic
Thus, by Proposition 6·1,
which establishes Theorem 1·8 with
where the sum runs over all tuples $\boldsymbol{\ell}$ of the form $k\boldsymbol{\delta}^\chi$ for some character $\chi$ . It remains to simplify the constant. Note that for $\boldsymbol{\ell} = k\boldsymbol{\delta}^\chi$ , $d_{\boldsymbol{\ell}}(n) = \chi(n)d_k(n)$ , where $d_k(n)$ is the usual divisor function. In particular, this means that $|d_{\boldsymbol{\ell}}(p^m)|^2 = \chi_0(p^m)d_k(p^m)^2$ , and hence $c_{\boldsymbol{\ell}}(q)$ depends only on the modulus of $\chi$ . Further, $\lambda(\boldsymbol{\ell}) = k^2$ . Thus,
for every $\boldsymbol{\ell}$ appearing in the sum in (6·3). We see that $c_{\boldsymbol{\ell}}(q)$ is the same as usual constant for $\zeta(s)$ , $c_k = c_k(1)$ but with a slight change in the local factors in the Euler product corresponding to those primes p which divide q. That is,
Substituting this back into (6·3),
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 (1·3), $M_k(T;\,\alpha)$ is equal to
where $s = 1/2 + it$ . We divide the terms in the sum into four types:
-
(i) the primary diagonal terms. These correspond to $\boldsymbol{\ell}^{(1)} = \boldsymbol{\ell}^{(2)} = k\boldsymbol{\delta}^{\chi}$ for some character $\chi$ . For such terms, it is clear that $\binom{k}{\boldsymbol{\ell}^{(j)}} = 1$ and the integral devolves to $M_k(T;\,\chi)$ ;
-
(ii) the secondary diagonal terms. These correspond to diagonal terms $\boldsymbol{\ell}^{(1)} = \boldsymbol{\ell}^{(2)}$ which are not main diagonal terms. Thus, $\boldsymbol{\ell} = \boldsymbol{\ell}^{(1)} = \boldsymbol{\ell}^{(2)} \neq k\boldsymbol{\delta}^\chi$ for every character $\chi$ modulo q. For such terms, the integral devolves to the mean square of $\mathcal{L}^{\boldsymbol{\ell}}(1/2+it)$ over [T, 2T];
-
(iii) the major off-diagonal terms. These correspond to $\boldsymbol{\ell}^{(1)} = k\boldsymbol{\delta}^{\chi}$ and $\boldsymbol{\ell}^{(2)} = k\boldsymbol{\delta}^\nu$ for distinct characters $\chi,\nu$ . For these terms, the integral devolves to $\int_T^{2T} L(s,\chi)^k \overline{L(s,\nu)}^k \,dt$ ;
-
(iv) 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 [ Reference Milinovich and Turnage–Butterbaugh35 ]:
Lemma 6·2. Suppose that either $\textsf{GRH}(q)$ or $\textsf{Sp}(q,k)$ holds, and that $\boldsymbol{\ell}$ is tuple of nonnegative integers indexed by the characters modulo q satisfying $|\boldsymbol{\ell}| = k$ . Then, for $\lambda(\boldsymbol{\ell}) = \sum_\chi \ell_\chi^2$ and any $\epsilon>0$ ,
In particular, if $\boldsymbol{\ell} \neq k \boldsymbol{\delta}^\chi$ for all characters $\chi$ modulo q, then
and hence, the secondary diagonal terms in (6·5) contribute at most $o_{q,k}\left(T(\!\log T)^{k^2}\right)$ to the sum.
Proof. First, suppose that $\textsf{Sp}(q,k)$ holds. Then, the first inequality is trivally true due to Theorem 1·7. Alternatively, suppose that $\textsf{GRH}(q)$ holds. Then, the first inequality follows by applying [ Reference Milinovich and Turnage–Butterbaugh35 , theorem 1·1] in the specific case where all the L-functions involved are Dirichlet L-functions.
Now note that under the constraints $\ell_\chi \geqslant 0$ and $\sum_\chi \ell_\chi = k$ , we have that $\lambda = \sum_\chi \ell_\chi^2 \leqslant k^2$ with equality if and only if the entire weight of $\boldsymbol{\ell}$ is concentrated on a single character. In particular, if $\boldsymbol{\ell} \neq k \boldsymbol{\delta}^\chi$ for all characters $\chi$ , then $\lambda(\boldsymbol{\ell}) < k^2$ and so, $\lambda(\boldsymbol{\ell}) \leqslant k^2 - 1$ . Thus, the second inequality in the lemma follows from the first.
Finally, it is clear that the constant $\binom{k}{\boldsymbol{\ell}}^2$ in the the secondary diagonal terms can be subsumed into the implicit constant from the second bound. Taking, for example, $\epsilon = 1/2$ shows that each such term is $o_{q,k}\!\left(T(\!\log T)^{k^2}\right)$ and since there are only $\ll_{q,k} 1$ such terms it follows that these contribute only $o_{q,k}\!\left(T(\!\log T)^{k^2}\right)$ .
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 $\asymp_{q,k} T(\!\log T)^{k^2 -2k + 2}$ and so this suffices for our purposes.
Lemma 6·3. Suppose that either $\textsf{GRH}(q)$ or $\textsf{Sp}(q,k)$ holds and that $\boldsymbol{\ell}^{(1)}$ and $\boldsymbol{\ell}^{(2)}$ are tuples of nonnegative integers characters modulo q satisfying $|\boldsymbol{\ell}^{(1)}|=|\boldsymbol{\ell}^{(2)}| = k$ . Further, suppose that $\boldsymbol{\ell}^{(1)},\boldsymbol{\ell}^{(2)}$ correspond to a minor off-diagonal term, as defined above. Then, for $s = 1/2 + it$ and any $\epsilon>0$ ,
and hence, the minor off-diagonal terms in (6·5) contribute at most $o_{q,k}\left(T(\!\log T)^{k^2}\right)$ to the sum.
Proof. Since $(\boldsymbol{\ell}^{(1)},\boldsymbol{\ell}^{(2)})$ corresponds to an off-diagonal term, $\boldsymbol{\ell}^{(1)} \neq \boldsymbol{\ell}^{(2)}$ . Further, since it is not a major off-diagonal term we must have that either $\boldsymbol{\ell}^{(1)}$ or $\boldsymbol{\ell}^{(2)}$ is not of the form $k \boldsymbol{\delta}^\chi$ for some character $\chi$ . Due to symmetry, we can assume without loss of generality that $\boldsymbol{\ell}^{(1)} \neq k \boldsymbol{\delta}^\chi$ for all characters $\chi$ . Then, by Cauchy–Schwarz and Lemma 6·2, we get for $s = 1/2 + it$ ,
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 $k = 1$ , 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 $k \geqslant 2$ , then again Cauchy–Schwarz suffices.
Lemma 6·4. Suppose that either $\textsf{GRH}(q)$ or $\textsf{Sp}(q,k)$ holds for some $k \geqslant 2$ and that $\chi$ and $\nu$ are distinct characters modulo q. Then, for $s = 1/2 + it$ and any $\epsilon>0$ ,
and hence, the major off-diagonal terms in (6·5) contribute at most $o_{q,k}\left(T(\!\log T)^{k^2}\right)$ 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 $k=1$ , and to show that the argument can be made unconditional for $k = 2$ . 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 $\textsf{GRH}(q)$ or $\textsf{Sp}(q,k)$ . For such terms, standard techniques developed to handle the mean square of $\zeta(s)$ can be applied. For our purposes, the following lemma suffices:
Lemma 6·5. Let $\chi$ and $\nu$ be distinct characters modulo q. Then, for $s = 1/2 + it$ ,
unconditionally. Hence, if $k = 1$ , the off-diagonal terms in (6·5) contribute only $o_q(T\log T)$ to the sum.
Proof. The upper bound is [ Reference Ishikawa31 , equation 4] with $\chi_j = \chi$ and $\chi_k = \nu$ . Showing that these terms contribute to the error is similar to the previous lemmata, and hence omitted.
Proposition 6·1 follows by putting all these lemmata together, thus completing the proof of Theorem 1·8.
6·3. Upper and lower bounds for $M_k(T;\,\alpha)$
In order to prove Theorem 1·10, we have to find bounds on $M_k(T;\,\alpha)$ conditionally on GRH.
The claimed upper bound follows trivially from the previous subsection, since Proposition 6·1 tells us that on $\textsf{GRH}(q)$ ,
and Lemma 6·2 tells us that on $\textsf{GRH}(q)$ ,
To prove the lower bound, we proceed by reducing the problem to computing lower bounds for the moments of $\zeta(s)$ , i.e. lower bounds on $M_k(T)$ . The key fact is the following obvious lemma:
Lemma 6·6. Let $\chi_0$ be the principal Dirichlet character modulo q. Then,
In particular, this tells us that $M_k(T;\,\chi_0) \gg_{q,k} M_k(T)$ . By the deep results in the literature about lower bounds for $M_k(T)$ mentioned in the introduction, we can conclude that in fact $M_k(T;\,\chi_0) \gg_{q,k} T(\!\log T)^{k^2}$ .
Then, by Proposition 6·1, we have conditionally on GRH,
completing the proof.
6·4. The fourth moment of $\zeta(s,\alpha)$
The goal here is to compute the asymptotic for $M_2(T;\,\alpha)$ , for $\alpha \in \mathbb{Q}$ originally proved (unpublished) in Andersson’s thesis [ Reference Andersson1 , pp. 71–72]. We reprove this here as, in the process, we will be able to verify that our conjectures for the constants $c_{\boldsymbol{\ell}}(q)$ and $c_k(\alpha)$ are correct when $|\boldsymbol{\ell}| \leqslant 2$ or $k \leqslant 2$ . Further, our discussion will imply that the conclusion in Proposition 6·1 is true unconditionally if $k = 2$ .
To do this, we make use of a recent result of Topacogullari [ Reference Topacogullari44 ], where he computes the full asymptotic formula for the fourth moments of $L(s,\chi)$ and the mean-square of $L(s,\chi)L(s,\nu)$ 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 $\chi$ be a Dirichlet character modulo q. Then, for $s = 1/2+it$ ,
where $C(\chi)$ is given by
Proof. This is an immediate corollary of [ Reference Topacogullari44 , theorem 1·1].
Proposition 6·8. Let $\chi$ and $\nu$ be distinct Dirichlet characters modulo q. Then, for $s = 1/2 + it$ ,
where $D(\chi,\nu)$ is given by
Proof. This is a corollary of [ Reference Topacogullari44 , theorem 1·3], by setting $\chi_1 = \chi$ , $\chi_2 = \nu$ , $q_1 = q_2 = q$ , noting that this implies $q_1^\star = q_2^\star = 1$ and noting that $\varphi(q^2) = q\varphi(q)$ .
We note here that the previous two propositions show that the result of Proposition 6·1 can be obtained unconditionally when $k=2$ , which we had not shown previously. This is because the hypotheses $\textsf{GRH}(q)$ or $\textsf{Sp}(q,k)$ 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 $\boldsymbol{\ell}$ satisfying $|\boldsymbol{\ell}| = 2$ .
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 $|\boldsymbol{\ell}| = 2$ . Let $C^{\prime}(\chi)$ and $D^{\prime}(\chi,\nu)$ be the constants predicted by Theorem 1·7. Then, $C^{\prime}(\chi) = c_{\boldsymbol{\ell}}(q)$ for $\boldsymbol{\ell} = 2\boldsymbol{\delta}^{\chi}$ , and $D^{\prime}(\chi,\nu) = c_{\boldsymbol{\ell}}(q)$ for $\boldsymbol{\ell} = \boldsymbol{\delta}^\chi + \boldsymbol{\delta}^\nu$ , $\chi \neq \nu$ .
To show that $C(\chi) = C^{\prime}(\chi)$ and $D(\chi,\nu) = D^{\prime}(\chi,\nu)$ , 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 p.
In particular, recall Ingham’s result that $c_2 = {1}/{2\pi^2}$ . Thus, using this, we can suppress the local factors for $p \nmid q$ when showing $C(\chi) = C^{\prime}(\chi)$ . Rewriting $C(\chi)$ in Euler product form using a standard formula for $\varphi(q)/q$ , we see that
Now since $C^{\prime}(\chi) = c_{\boldsymbol{\ell}}(q)$ for $\boldsymbol{\ell} = 2\boldsymbol{\delta}^\chi$ , we get that $\lambda = 2^2 = 4$ , $d_{\boldsymbol{\ell}}(n) = \chi_0(n)d_2(n)$ where $\chi_0$ is the principal character modulo q, and hence
Recall that
Thus, we see that
In light of (6·6) and (6·7), it suffices to note the power series equality
for $|z|<1$ , as then plugging in $z = 1/p$ and taking products over $p \mid q$ gives us $C(\chi) = C^{\prime}(\chi)$ . To see the above power series equality, note that $d_2(p^m) = m+1$ and hence this follows straightforwardly from the geometric series formula.
Now, we turn to showing $D(\chi,\nu) = D^{\prime}(\chi,\nu)$ . Since $D^{\prime}(\chi,\nu) = c_{\boldsymbol{\ell}}(q)$ for $\boldsymbol{\ell} = \boldsymbol{\delta}^\chi + \boldsymbol{\delta}^\nu$ , hence $\mathcal{L}^{\boldsymbol{\ell}}(s) = L(s,\chi)L(s,\nu)$ and $d_{\boldsymbol{\ell}} = \chi*\nu$ , where $*$ denotes Dirichlet convolution. Because $\nu$ is completely multiplicative, $d_{\boldsymbol{\ell}}(n) = \nu(n) \{1*(\chi\overline{\nu})\}(n)$ . In particular, it follows that $|d_{\boldsymbol{\ell}}(n)|^2$ depends only on $\chi\overline{\nu}$ and not the individual characters $\chi$ and $\nu$ . Thus, $D^{\prime}(\chi,\nu)$ also depends only on $\chi\overline{\nu}$ . By inspection, we see that $D(\chi,\nu)$ also depends only on $\chi\overline{\nu}$ . Thus, without loss of generality, we can assume that $\nu = \chi_0$ . It now suffices to show that for $\chi \neq \chi_0$ , $D(\chi,\chi_0) = D^{\prime}(\chi,\chi_0)$ .
For $\boldsymbol{\ell} = \boldsymbol{\delta}^\chi + \boldsymbol{\delta}^{\chi_0}$ , we see that $\lambda = 1^2 + 1^2 = 2$ . Further, $d_{\boldsymbol{\ell}}(n) = \chi_0(n) \{1*\chi\}(n)$ . Finally the product over $\chi$ in the expression for $c_{\boldsymbol{\ell}}(q)$ vanishes, since $G(1)^2/G(3) = 1$ . Thus, we get
Now, using the Euler product formulae,
and
where the latter holds because $\chi \neq \chi_0$ , we see that
Comparing the local factors corresponding to primes p dividing q, we see that for $D^{\prime}(\chi,\chi_0)$ these are $\left(1 - p^{-1}\right)^2$ , while for $D(\chi,\chi_0)$ , they are
Thus, it remains to check the local factors corresponding to primes p which are coprime to q. For $D(\chi,\chi_0)$ , these are of the shape
while for $D^{\prime}(\chi,\chi_0)$ , these are of the shape
Thus, to prove $D(\chi,\chi_0) = D^{\prime}(\chi,\chi_0)$ it clearly suffices to prove the power series equality
for $|z| < 1$ and $|\omega| = 1$ , as then plugging in $z = 1/p$ , $\omega = \chi(p)$ and multiplying both sides by $\left(1 - p^{-1}\right)$ gives us the desired equality.
To prove this power series equality note that both sides are equal to
where the sum over j runs through all integers in $[{-}m,m]$ . 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 $c_{\boldsymbol{\ell}}(q)$ from Theorem 1·7 are correct for $\boldsymbol{\ell} = \boldsymbol{\delta}^\chi + \boldsymbol{\delta}^\nu$ where $\chi,\nu$ are not necessarily distinct Dirichlet characters modulo q. One could, in principle, use Topacogullari’s results from [ Reference Topacogullari44 ] to verify the analoguous constants for products of the form $L(s,\chi)L(s,\nu)$ with $\chi,\nu$ possibly having distinct moduli.
We now return to the proof of Theorem 1·2. We will set $k = 2$ in (6·5), and use the same classification for the different terms that arise in the right-hand side of (6·5) 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 $\chi$ and $\nu$ are distinct characters modulo q. Then, for $s = 1/2 + it$ ,
Proof. This is analogous to Lemma 6·4.
Lemma 6·10. Suppose that $\boldsymbol{\ell}^{(1)}$ and $\boldsymbol{\ell}^{(2)}$ are tuples of nonnegative integers indexed by characters modulo q satisfying $|\boldsymbol{\ell}^{(1)}| = |\boldsymbol{\ell}^{(1)}| = 2$ . Further, suppose that $\boldsymbol{\ell}^{(1)}$ and $\boldsymbol{\ell}^{(2)}$ corresponds to a minor off-diagonal term. Then, for $s = 1/2 + it$ ,
Proof. This is analogous to Lemma 6·3.
We can now prove the theorem. Putting $k = 2$ in (6·5), we get
We now use Proposition 6·7 to deal with the terms with the primary diagonal terms (i.e. those corresponding to $\boldsymbol{\ell}^{(1)} = \boldsymbol{\ell}^{(2)} = 2\boldsymbol{\delta}^\chi$ ). The discussion from Section 6.2 tells us that summing the main terms from Proposition 6·7 over $\chi$ contributes $c_2(\alpha) T(\!\log T)^{4}$ , which gives the main term in Theorem 1·2. Note that this matches up with the conjectural constant from Theorem 1·8 for $k = 2$ .
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 (6·11), depending on their classification. There are $\ll \varphi(q)^4$ such terms in (6·11), and they each contribute at most $\ll_q T(\!\log T)^3$ . This completes the proof.
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 [ Reference Andersson1 ]. Finally, I would like to thank the anonymous referee for numerous corrections and comments that helped improve this manuscript considerably.