The Fourth Moment of Derivatives of Dirichlet $L$-functions in Function Fields
J. C. Andrade, M. Yiasemides

TL;DR
This paper derives the asymptotic main terms for the first, second, and mixed fourth moments of derivatives of Dirichlet L-functions over function fields, extending previous work on moments without derivatives and connecting to conjectures in number fields.
Contribution
It provides the first asymptotic formulas for moments of derivatives of L-functions in the function field setting, including mixed moments, expanding the understanding of their distribution.
Findings
Asymptotic main terms for first, second, and mixed fourth moments obtained.
Extends previous results on moments without derivatives to derivatives.
Supports conjectures relating to moments of derivatives in number fields.
Abstract
We obtain the asymptotic main term of moments of arbitrary derivatives of -functions in the function field setting. Specifically, the first, second, and mixed fourth moments. The average is taken over all non-trivial characters of a prime modulus , and the asymptotic limit is as . This extends the work of Tamam who obtained the asymptotic main term of low moments of -functions, without derivatives, in the function field setting. It also expands on the work of Conrey, Rubinstein, and Snaith who cojectured, using random matrix theory, the asymptotic main term of any even moment of the derivative of the Riemann zeta-function in the number field setting.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Coding theory and cryptography · Advanced Algebra and Geometry
The Fourth Moment of Derivatives of Dirichlet -functions in Function Fields.
J. C. Andrade
and
M. Yiasemides
Department of Mathematics, University of Exeter, Exeter, EX4 4QF, UK
Abstract.
We obtain the asymptotic main term of moments of arbitrary derivatives of -functions in the function field setting. Specifically, the first, second, and mixed fourth moments. The average is taken over all non-trivial characters of a prime modulus , and the asymptotic limit is as . This extends the work of Tamam who obtained the asymptotic main term of low moments of -functions, without derivatives, in the function field setting. It also expands on the work of Conrey, Rubinstein, and Snaith who cojectured, using random matrix theory, the asymptotic main term of any even moment of the derivative of the Riemann zeta-function in the number field setting.
Key words and phrases:
moments of -functions, Dirichlet character, polynomial, function field, derivative
2010 Mathematics Subject Classification:
Primary 11M06; Secondary 11M38, 11M50, 11N36
Contents
- 1 Introduction
- 2 Notation and Results
- 3 Preliminary Results
- 4 First Moments
- 5 Second Moments
- 6 Fourth Moments: Expressing as Manageable Summations
- 7 Fourth Moments: Handling the Summations
- 8 Fourth Moments
1. Introduction
The moments of families of -functions are part of an important area of research in analytic number theory. They are interlinked with the Lindelöf hypothesis and, while the asymptotic behaviour of the second and fourth moments are understood, higher moments have been resistant to breakthroughs for almost 100 years.
In 1916, Hardy and Littlewood [HL16] proved that
[TABLE]
as . In 1926, Ingham [Ing26] expanded on this by proving that
[TABLE]
as . Further results have since been obtained for the second and fourth moments, such as lower-order terms in the asymptotic expansions, but only conjectures have been obtained for higher moments. In 2000, Keating and Snaith [KS00] conjecured, using random matrix theory, the asymptotic main term for all even moments.
Similar results and conjectures hold for families of -functions, and we can work in the function field setting in addition to the classical number field setting. In this paper we look at the first, second and mixed fourth moments of arbitrary derivatives of -functions in the function field setting, where we average over non-trivial Dirichlet characters of a prime modulus , and we consider the asymptotic behaviour as .
This expands the work of Tamam [Tam14] who obtained similar results, but without considering derivatives. There is an error in a part of her proof, but we have addressed that in this paper (see Remark 7.5). Analogies can also be seen between our results and the work of Conrey, Rubinstein, and Snaith [CRS06] who use random matrix theory to conjecture the asymptotic main terms of
[TABLE]
for all non-negative integers .
Acknowledgements: The first author is grateful to the Leverhulme Trust (RPG-2017-320) for the support through the research project grant “Moments of -functions in Function Fields and Random Matrix Theory”. The second author is grateful for an EPSRC Standard Research Studentship (DTP).
2. Notation and Results
For integer prime powers we have a finite field of order , denoted by . The polynomial ring over this finite field is denoted by , but because we are working with general we we can simply write . The subset of monic polynomials is denoted by . The degree of a polynomial is the standard definition, although we do not define it for the zero polynomial. Hence, the range , for any non-negative integer , does not include the case . For we define the norm of as , and for we define .
Generally, we reserve upper-case letters for elements of , and the letters and are reserved for prime polynomials. Note that primality and ireducibility are equivalent as is a unique fatorisation domain. In this paper, the term “prime” is taken to mean “monic prime”. We denote the set of monic primes in by . For we denote the highest common factor and lowest common multiple by and , respectively.
For a subset we define, for all non-negative integers , . We identify with .
Definition 2.1** (Dirichlet Character).**
Let . A Dirichlet character on of modulus is a function satisfying the folowing properties for all :
- (1)
* if ;* 2. (2)
; 3. (3)
* if and only if .*
We denote a sum over all characters of modulus by . Also, note that we can view as a function on , which follows naturally from point 1 above. This will allow us to use expressions such as when .
We say is the trivial character of modulus if for all satisfying , and we denote such characters by (the dependence on the modulus is not shown with this notation, but when used it will be clear what the associated modulus is). We define the even characters to be those characters satisfying for all . Otherwise, we say that the character is odd. It can be shown that there are characters of modulus and even characters of modulus , where is the totient function.
Definition 2.2** (Dirichlet -function).**
Let be a Dirichlet character of modulus . We define the associated Dirichlet -function as follows: For all ,
[TABLE]
This has an analytic continution to for non-trivial characters, and to for trivial characters.
Definition 2.3** (Riemann Zeta-function in ).**
When is the Dirichlet character of modulus , then the associated Dirichlet -function is simply the Riemann zeta-function on , namely
[TABLE]
One may wish to note that in this paper, when expressing asymptotic behaviour, we remove all dependencies that we can from the implied constants. For example, if an implied constant can be taken to be , then we will view this as independent of because for all prime powers .
We prove the following results.
Theorem 2.4**.**
For all positive integers , we have that
[TABLE]
as with being prime.
Theorem 2.5**.**
For all positive integers we have that
[TABLE]
as with being prime.
Theorem 2.6**.**
For all non-negative integers we have that
[TABLE]
as with being prime, where for all non-negative inetegers we define
[TABLE]
These three results are extensions of Tamam’s work [Tam14], where she proves the three theorems above for the cases where . In the number field setting, Conrey, Rubinstein, and Snaith [CRS06] conjectured using random matrix theory that
[TABLE]
where
[TABLE]
and values for are explicitely given. In particular,
[TABLE]
Notice the similarity between these conjectures and the corresponding special cases of our results:
[TABLE]
and
[TABLE]
Furthermore, we prove the following result:
Theorem 2.7**.**
For all non-negative inetgers we define
[TABLE]
We have that
[TABLE]
as .
We note the similarity between our result and a result of Conrey’s [Con88], which states that
[TABLE]
as , where
[TABLE]
Note that the factor of in Conrey’s result corresponds to the factor of in our definition of .
3. Preliminary Results
The following results are well known and, for many, the proofs can be found in Rosen’s book [Ros02].
Lemma 3.1**.**
Let be a non-trivial Dirichlet character modulo . Then,
[TABLE]
Lemma 3.2**.**
Let be an an odd Dirichlet character. Then,
[TABLE]
Lemma 3.3**.**
Let . Then,
[TABLE]
and
[TABLE]
Corollary 3.4**.**
Let . Then,
[TABLE]
and
[TABLE]
Proposition 3.5**.**
We have that
[TABLE]
and this gives an analytic continuation of to . We also have the following Euler product for :
[TABLE]
Proposition 3.5 can be generalised to the following:
Proposition 3.6**.**
Let and let be a Dirichlet character of modulus . If then we have
[TABLE]
If then we have
[TABLE]
We can now see how the analytic continuations given in the introduction are obtained.
Definition 3.7**.**
We will often write
[TABLE]
where
[TABLE]
As shown above, if is a non-trivial character of modulus , then for .
Lemma 3.8**.**
For , we have that
[TABLE]
Proof.
We have that
[TABLE]
From this we easily deduce that
[TABLE]
∎
4. First Moments
To prove Theorem 2.4 we will require the following lemma.
Lemma 4.1**.**
For all positive integers we have that
[TABLE]
as .
Proof.
We have that
[TABLE]
as . ∎
Proof of Theorem 2.4.
We can easily see that
[TABLE]
from which we deduce that
[TABLE]
as . For the second equality we used Lemma 3.3, and for the last equality we used Lemma 4.1 and the fact that (since is prime). ∎
5. Second Moments
Proof of Theorem 2.5.
For positive integers we have that
[TABLE]
and so
[TABLE]
We now apply Corollary 3.4 to obtain that
[TABLE]
For the first term on the RHS we have that
[TABLE]
as , where the final equality uses Faulhaber’s formula. For the second term we have that
[TABLE]
as . The result now follows. ∎
6. Fourth Moments: Expressing as Manageable Summations
Before proceeding to the main part of the proof for the fourth moments, we need to express the fourth moments as more manageable summations.
A generalisation of the following theorem appears in Rosen’s book [Ros02, Theorem 9.24 A].
Theorem 6.1** (Functional Equation for ).**
Let be a non-trivial character modulo a monic prime polynomial . If is an odd character, then satisfies the functional equation
[TABLE]
and if is an even character, then satisfies the functional equation
[TABLE]
where we always have
[TABLE]
Proposition 6.2**.**
Let be an odd character modulo a prime , and let be a non-negative integer. Then,
[TABLE]
where
[TABLE]
Remark 6.3**.**
*The “” in the subscript is to signify that these polynomials apply to the odd character case. It is important to note that g_{O,k}\big{(}\operatorname{deg}A,\operatorname{deg}B,\operatorname{deg}Q\big{)} has degree , whereas
f_{k}\big{(}\operatorname{deg}A,\operatorname{deg}B,\operatorname{deg}Q\big{)} has degree (hence, the later ultimately conributes the higher order term); and that all three polynomials are independent of .*
Proof.
The functional equation gives us that
[TABLE]
Taking the derivative of both sides gives
[TABLE]
Let us now take the squared modulus of both sides, to get
[TABLE]
Both sides of the above are equal to \big{\lvert}L^{(k)}(s,\chi)\big{\rvert}^{2}. By the linear independence of powers of , we have that \big{\lvert}L^{(k)}(s,\chi)\big{\rvert}^{2} is the sum of the terms corresponding to from the LHS and from the RHS. This gives
[TABLE]
We now substitue and simplify the right-hand-side to get
[TABLE]
Finally, we substitute back to obtain the required result. ∎
Definition 6.4**.**
For all and all non-trivial even characters, , of prime modulus we define
[TABLE]
Proposition 6.5**.**
For all non-trivial even characters, , of prime modulus and all non-negative integers we have that
[TABLE]
where, for non-negative integers satisfying , we define the polynomials by
[TABLE]
Remark 6.6**.**
Because for all prime powers , we can see that the polynomials p_{k,i}\Big{(}\frac{q^{\frac{1}{2}}}{q^{\frac{1}{2}}-1}\Big{)} can be bounded independently of (but dependent on and of course). The factors are of course still dependent on , as well as and . These two points are imporant when we later determine how the lower order terms in our main results are dependent on .
Proof.
We prove this by strong induction on . The base case, , is obvious by Definition 6.4. Now, suppose the claim holds for . Differentiating, number of times, the equation (2) gives
[TABLE]
Substituting and rearranging gives
[TABLE]
We now apply the inductive hypothesis to obatin
[TABLE]
The result folows by the definition of the polynomials . ∎
Proposition 6.7**.**
For all non-negative integers , and all non-trivial even characters of prime modulus , we have that
[TABLE]
where
[TABLE]
and g_{E,k}\big{(}\operatorname{deg}A,\operatorname{deg}B,\operatorname{deg}Q\big{)}\;,\;h_{E,k,n}\big{(}\operatorname{deg}A,\operatorname{deg}B,\operatorname{deg}Q\big{)} are polynomials of degrees and , respectively, whose coefficients can be bounded independently of .
Proof.
Let us define , and recall from Definition 3.7 that . We can now define, for ,
[TABLE]
Then, the functional equation for even characters can be written as
[TABLE]
Note that both sides of (3) are equal to . We proceed similar to the odd character case. First we differentiate, number of times, the equation (3); and then we take the modulus squared of both sides. This gives
[TABLE]
Now we take the terms corresponding to from the LHS and from the RHS to obtain
[TABLE]
Substituting and simplifying the RHS gives
[TABLE]
Now, we want factors such as in our expression, as opposed to factors like . To this end, suppose is a finite polynomial. Then,
[TABLE]
Grouping the terms together gives
[TABLE]
In the case where
[TABLE]
we have that
[TABLE]
where is a polynomial of degree whose coefficients can be bounded independently of .
We can now see that (4) becomes
[TABLE]
where is a polynomial of degree whose coefficients can be bounded independently of . Finally, we substitute back to obtain the required result. ∎
7. Fourth Moments: Handling the Summations
We now demonstrate some techniques for handling the summations that we obtained in Section 6.
Lemma 7.1**.**
Let be prime, and let p_{1}\big{(}\operatorname{deg}A,\operatorname{deg}B,\operatorname{deg}Q\big{)} and p_{2}\big{(}\operatorname{deg}A,\operatorname{deg}B,\operatorname{deg}Q\big{)} be finite polynomials (which, for presentational purposes, we will write as and , except when we need to use other variables for the parametres). Then,
[TABLE]
Proof.
This follows by expanding the brackets and applying Corollary 3.4 ∎
Lemma 7.2**.**
Let p\big{(}\operatorname{deg}A,\operatorname{deg}B,\operatorname{deg}C,\operatorname{deg}D,\operatorname{deg}Q\big{)} be a finite homogeneous polynomial of degree . Then,
[TABLE]
as .
Remark 7.3**.**
The subscript in should be interpreted as saying that the implied constant is dependent on the coefficients of , but not dependent on the degree .
Proof.
Consider the function defined by
[TABLE]
with domain . Note that if and only if there exist satisfying and , , , . Hence,
[TABLE]
where the second equality follows by similar means as in the proof of Lemma 3.8.
Now, for we define the operator . For non-negative integers we can apply the operator to (5) and (LABEL:f(t_1_..._t_4)with_degree_FR..._GR) to get
[TABLE]
From this we can deduce that if p\big{(}\operatorname{deg}A,\operatorname{deg}B,\operatorname{deg}C,\operatorname{deg}D,\operatorname{deg}Q\big{)} is a finite homogeneous polyomial of degree , then
[TABLE]
Now, we can extract and sum the coefficients of for which and to get
[TABLE]
as . ∎
Lemma 7.4**.**
Let p\big{(}\operatorname{deg}A,\operatorname{deg}B,\operatorname{deg}C,\operatorname{deg}D,\operatorname{deg}Q\big{)} be a finite polynomial of degree . Then,
[TABLE]
as .
Proof.
Because , we have that
[TABLE]
Hence,
[TABLE]
Now, Lemma 7.10 from [AY19] tells us that for non-negative integers we have
[TABLE]
Hence, for we have
[TABLE]
as . The result follows by applying this to (LABEL:Off-diagonal_z_1,_z_2_split). ∎
Remark 7.5**.**
In her paper, Tamam [Tam14, Lemma 8.5] states a similar result as (8) above. However, in her proof she claims that , which is not the case. Addressing this is non-trivial and was done in [AY19], as stated above.
Lemma 7.6**.**
Let p\big{(}\operatorname{deg}A,\operatorname{deg}B,\operatorname{deg}C,\operatorname{deg}D,\operatorname{deg}Q\big{)} be a finite polynomial of degree . Then,
[TABLE]
Proof.
Because , we have that
[TABLE]
Hence,
[TABLE]
∎
From Lemmas 7.1 to 7.6 we can deduce the following:
Proposition 7.7**.**
Let be prime, and let p_{1}\big{(}\operatorname{deg}A,\operatorname{deg}B,\operatorname{deg}Q\big{)} and p_{2}\big{(}\operatorname{deg}A,\operatorname{deg}B,\operatorname{deg}Q\big{)} be finite homogeneous polynomials of degree and , respectively. Then,
[TABLE]
Similarly, the following can be proved:
Proposition 7.8**.**
Let be prime, and let p_{1}\big{(}\operatorname{deg}A,\operatorname{deg}B,\operatorname{deg}Q\big{)} and p_{2}\big{(}\operatorname{deg}A,\operatorname{deg}B,\operatorname{deg}Q\big{)} be finite homogeneous polynomials of degree and , respectively. Then,
[TABLE]
The proof of Proposition 7.8 is similar to the proof of Proposition 7.7. From [AY19], we use Lemma 7.11 instead of Lemma 7.10.
We can similarly prove the following:
Proposition 7.9**.**
Let be prime, let p_{1}\big{(}\operatorname{deg}A,\operatorname{deg}B,\operatorname{deg}Q\big{)} and p_{2}\big{(}\operatorname{deg}A,\operatorname{deg}B,\operatorname{deg}Q\big{)} be finite homogeneous polynomials of degree and , respectively, and let . Then,
[TABLE]
and
[TABLE]
8. Fourth Moments
We are now equipped to prove the fourth moment result.
Proof of Theorem 2.6.
We have that
[TABLE]
Using Proposition 6.2, we have for the first term on the RHS that
[TABLE]
By using Propositions 7.7 and 7.8, we have that
[TABLE]
as . Strictly speaking, Propositions 7.7 and 7.8 require that the polynomials and are homogeneous, which is not the case. However, these polynomials can be written as sums of homogeneous polynomials, with the terms of highest degree being and , respectively. We can then apply the propositions term-by-term to obtain the result above.
We now have the main term of (LABEL:Odd_char_L^(k)_L^(l)_split). Indeed, for the remaining terms we can apply the Cauchy-Schwarz inequality and Propositions 7.7, 7.8, and 7.9 to see that they are equal to O_{k,l}\Big{(}(\operatorname{deg}Q)^{2k+2l+\frac{7}{2}}\Big{)}. Hence,
[TABLE]
as .
We now look at the second term on the RHS of (LABEL:L^(k)_L^(l)_split_into_odd_and_even_char). By using Proposition 6.7 and similar means as those used to deduce (LABEL:Odd_char_L^(k)_L^(l)_split,_main_and_LO_terms), we can show for all non-negative integers that
[TABLE]
as . Using Proposition 6.5 and the Cauchy-Schwarz inequality, we obtain that
[TABLE]
as .
The proof folllows from (LABEL:L^(k)_L^(l)_split_into_odd_and_even_char), (LABEL:Odd_char_L^(k)_L^(l)_split,_main_and_LO_terms), (LABEL:Even_char_L^(k)_L^(l)_split,_main_and_LO_terms). ∎
We now proceed to prove Theorem 2.7.
Lemma 8.1**.**
Let be a positive integer. For all non-negative we have that
[TABLE]
and for all we have that
[TABLE]
Proof.
By using the Taylor seies for we have that
[TABLE]
Clearly, the RHS is , which proves the first inequality. For the second inequality we use the bounds on to obtain that
[TABLE]
from which the result follows. ∎
Proof of Theorem 2.7.
Let us expand the brackets in (1) and multiply by . One of the terms is the following:
[TABLE]
where we have used the substitutions . On one hand, by using Lemma 8.1, we have that
[TABLE]
On the other hand, by the same lemma, we have that
[TABLE]
So, we see that
[TABLE]
as .
Now, after we expanded the brackets in (1) and multiplied by , there were other terms. These can be seen to tend to [math] as . We prove one case below; the rest are similar.
[TABLE]
where we have used the following: The maximum value that can take subject to the conditions in the integral is at most equal to the maximum value that can take subject to the conditions and . By plotting this range and looking at contours of we can see that the maximum value is . The result follows. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[AY 19] J. C. Andrade, M. Yiasemides; The fourth power mean of Dirichlet L 𝐿 L -functions in m a t h b b F q [ T ] 𝑚 𝑎 𝑡 ℎ 𝑏 𝑏 subscript 𝐹 𝑞 delimited-[] 𝑇 mathbb{F}_{q}[T] ; ar Xiv e-prints; ar Xiv:1901.06295. URL https://ui.adsabs.harvard.edu/#abs/2019 ar Xiv 190106295 A
- 2[Con 88] J. B. Conrey; The Fourth Moment of Derivatives of the Riemann Zeta-Function ; Quartly Journal of Mathematics; vol. 39(1):(1988), 21–36.
- 3[CRS 06] J. B. Conrey, M.O. Rubinstein, N.C. Snaith; Moments of the Derivative of Characteristic Polynomials with an Application to the Riemann Zeta Function ; Communications in Mathematical Physics; vol. 267(3):(2006), 611–629.
- 4[HL 16] G. H. Hardy, J. E. Littlewood; Contributions to the theory of the Riemann zeta-function and the distribution of primes ; Acta Mathematica; vol. 41:(1916), 119–196.
- 5[Ing 26] A. E. Ingham; Mean-value theorems in the theory of the Riemann zeta-function ; Proceedings of the London Mathematical Society; vol. 27:(1926), 273–300.
- 6[KS 00] J. P. Keating, N.C. Snaith; Random Matrix Theory and ζ ( 1 2 + i t ) 𝜁 1 2 𝑖 𝑡 \zeta(\frac{1}{2}+it) ; Communications in Mathematical Physics; vol. 214:(2000), 57–89.
- 7[Ros 02] M Rosen; Number Theory in Function Fields ; Springer Verlag, New York (2002).
- 8[Tam 14] Nattalie Tamam; The Fourth Moment of Dirichlet L 𝐿 L -Functions for the Rational Function Field ; International Journal of Number Theory; vol. 10(1):(2014), 183–218.
