Moments of zeta and correlations of divisor-sums: V
Brian Conrey, Jonathan P. Keating

TL;DR
This paper advances the understanding of the moments of the Riemann zeta-function by analyzing Type II sums using circle method techniques to derive precise asymptotics for divisor sum correlations.
Contribution
It completes the analysis of Type II sums, providing a comprehensive framework for calculating lower order terms in zeta moments using divisor correlations.
Findings
Derived asymptotic formulas for divisor sum correlations
Completed the analysis of Type II sums in zeta moments
Enhanced methods for calculating moments of the zeta-function
Abstract
In this series of papers we examine the calculation of the th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper completes the general study of what we call Type II sums which utilize a circle method framework and a convolution of shifted convolution sums to obtain all of the lower order terms in the asymptotic formula for the mean square along of a Dirichlet polynomial of arbitrary length with divisor functions as coefficients.
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.
Moments of zeta and correlations of divisor-sums: V
Brian Conrey
American Institute of Mathematics, 360 Portage Ave, Palo Alto, CA 94306, USA and School of Mathematics, University of Bristol, Bristol BS8 1TW, UK
and
Jonathan P. Keating
School of Mathematics, University of Bristol, Bristol BS8 1TW, UK
Abstract.
In this series of papers we examine the calculation of the th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper completes the general study of what we call Type II sums which utilize a circle method framework and a convolution of shifted convolution sums to obtain all of the lower order terms in the asymptotic formula for the mean square along of a Dirichlet polynomial of arbitrary length with divisor functions as coefficients.
We gratefully acknowledge support under EPSRC Programme Grant EP/K034383/1 LMF: -Functions and Modular Forms. Research of the first author was also supported by the American Institute of Mathematics and by a grant from the National Science Foundation. JPK is grateful for the following additional support: a Royal Society Wolfson Research Merit Award, a Royal Society Leverhulme Senior Research Fellowship, a grant from the Air Force Office of Scientific Research, Air Force Material Command, USAF (number FA8655-10-1-3088), and ERC Advanced Grant 740900 (LogCorRM). He is also pleased to thank the American Institute of Mathematics for hospitality during two visits when work on this project was conducted. Finally, we are grateful to the referees for their careful reading of the manuscript and for extremely helpful comments and suggestions.
1. Introduction
This paper is part V of a sequence devoted to understanding how to conjecture all of the integral moments of the Riemann zeta-function from a number theoretic perspective. The method is to approximate by a long Dirichlet polynomial and then to compute the mean square of the Dirichlet polynomial (c.f. [GG]). There are many off-diagonal terms and it is the care of these that is the concern of these papers. In particular it is necessary to treat the off-diagonal terms by a method invented by Bogomolny and Keating [BK1, BK2]. Our perspective on this method is that it is most properly viewed as a multi-dimensional Hardy-Littlewood circle method.
In previous papers [CK1, CK3] we have developed a general method to calculate what were called type-I off-diagonal contributions in [BK1, BK2]; these are the off-diagonal terms usually considered in number-theoretic computations, e.g. in [GG]. In parts II [CK2] and IV [CK4] we considered the simplest of the type-II off-diagonal terms (in the terminology of [BK1, BK2]). These, somewhat unexpectedly, give a significant contribution in certain cases. They have not previously been analysed systematically. Our purpose here is to develop a general method for computing all type-II off-diagonal terms.
The formula we obtain is in complete agreement with all of the main terms predicted by the recipe of [CFKRS] (and in particular, with the leading order term conjectured in [KS]).
2. Shifted moments
Let and be two sets of cardinality containing “shifts” which may be thought of as parameters of size where is the basic large parameter near where we want to know the average of a product of -functions. Let
[TABLE]
this implicitly defines the arithmetic functions . A basic question (the moment problem) is to evaluate
[TABLE]
where is a smooth function with compact support, say , and . The technique we are developing in this sequence of papers is to approach the moment problem through long Dirichlet polynomials. To this end we let
[TABLE]
be the truncated Dirichlet series for . By Perron’s formula for we have
[TABLE]
where
[TABLE]
In this sequence of papers we consider
[TABLE]
for various ranges of . The expectation is that if then this will be asymptotically equal to .111In the earlier papers we did not include the terms and because their contributions were negligible since was not large. In general these terms do not create extra difficulties and so they will be ignored here as well.
We calculate this average in two different (conjectural) ways: the first is via the recipe and the second is via the delta method applied to the correlations of shifted divisor functions. We show that these two methods produce identical detailed main terms.
To use the recipe of [CFKRS] to conjecture a formula for , we start with
[TABLE]
so that
[TABLE]
where
[TABLE]
i.e. the set but with all its elements shifted by . From the recipe [CFKRS] we expect that
[TABLE]
where
[TABLE]
We have used an unconventional notation here; by we mean the following: start with the set and remove the elements of and then include the negatives of the elements of . We think of the process as “swapping” equal numbers of elements between and ; when elements are removed from and put into they first get multiplied by . We keep track of these swaps with our equal-sized subsets and of and ; and when we refer to the “number of swaps” in a term we mean the cardinality of (or, since they are of equal size, of ). We insert this conjecture and expect that
[TABLE]
We have done a little simplification here: instead of writing we have written and changed the exponent of accordingly.
Notice that there is a factor in the previous equation. As mentioned above we refer to as the number of “swaps” in the recipe, and now we see more clearly the role it plays; in the terms above for which we move the path of integration in or to so that the factor and the contribution of such a term is 0. Thus, the size of determines how many “swaps” we must keep track of. To account for this we introduce a parameter defined by
[TABLE]
Then the above may be rewritten as
[TABLE]
where we have restricted the sum to at most swaps.
Now we turn to the second approach via divisor correlations with the goal of obtaining this formula in a completely different way. In [CK1] and [CK3] we accomplished this in the situations where there were 0 or 1 swaps (i.e. when ). In [CK2] we considered two swaps but in a special case. In [CK4] we looked at the general case of two swaps. In this paper, which is the final paper of the sequence, we look at the general case with any number of swaps.
As an extension of the ideas in these papers, we have also begun to explore the analogous calculations for averages of ratios of the zeta function, specifically in the context of zero correlations [CK5, CK6].
The second method to obtain a conjecture for will involve an intricate study of convolutions of shifted divisor problems and will occupy the rest of this paper. We begin that calculation by integrating term-by-term to obtain
[TABLE]
where because of the support of ). Now let us assume that where is defined above. We partition and into non-empty sets and . Then and are convolutions: and . For any such partition, the right hand side of (2) is equal to
[TABLE]
In other words as long as and are the disjoint unions of the and . Now we want to define a refinement of this sum. We impose a pairing with and analyze this sum according to rational approximations to . In this way, the ordering of the sets now matters. The eventual evaluation of will involve a sum of these pairings, which we describe in detail in the next section.
3. Type II convolution sums
There are various ways to decompose and and various ways to “pair” divisor functions and in preparation for the delta method.
More importantly, however, it turns out that there are various stratifications that also present themselves; basically one for each rational “direction.” If we ignore these then a simple application of the expected main terms from the delta-method analysis will lead us to the wrong main terms.
At first sight it seems that when we do this we are counting the same terms repeatedly. However, we believe that our situation is an example of Manin’s stratified subvarieties wherein counting solutions to high dimensional diophantine equations often involves identifying a collection of subvarieties on each of which the solutions are counted separately (by the delta method for example). The point is that the main terms of the delta method do not always count all of the solutions. This phenomenon was first identified in [FMT]; see, for example, [B] and [LT] for reviews of the subject.
Given and , the number of ways to pair each with a so that all are paired off is . Let us consider the pairing of with . Now we think of as being approximated by a rational number with a small denominator for each of where . In this way we get subvarieties indexed by the rational directions with . We will use all directions subject to the natural conditions and
[TABLE]
We sum over all of the terms with close to . We introduce variables where, for a given and , we define
[TABLE]
The rapid decay of governs the ranges of all of the variables; see below.
We have
[TABLE]
so that for we have
[TABLE]
and
[TABLE]
The error term is negligible so we can arrange the sum as
[TABLE]
where
[TABLE]
We can replace in the denominator by . Thus we are led to define
[TABLE]
Also, we define
[TABLE]
where the weight factor
[TABLE]
in will be explained in a later section. Note that is defined in terms of and , so its inclusion in the notation is redundant. Now we can state
Conjecture 1**.**
Suppose that and . Then for some ,
[TABLE]
One way to view this paper is that it gives evidence for this conjecture. In particular, in the next few sections we will conjecturally understand by replacing the shifted divisor sums by what the delta-method leads us to expect for them. Then we evaluate the result and prove the rigorous theorem that our evaluation is precisely the quantity on the right-hand side of (2).
4. The case where
Let us first look at the situation where none of the is 0. The idea is to evaluate by replacing the by real variables while the and remain integer-valued variables (and the are determined by the equations ).
To do this we will replace the convolution sums by their averages, i.e.
[TABLE]
where is the Ramanujan sum (usually denoted ) and
[TABLE]
where
[TABLE]
(In the above few lines we have replaced a sum by an integral where (in the handy physics notation) denotes the average of when (the instantaneous rate of change of a good approximation to with respect to ). In our context this may be expressed using and defining where we sum the residues at all of the poles of near . )
Thus, we believe that
[TABLE]
is, up to a power savings, equal to
[TABLE]
To further analyze this quantity, we make the changes of variable and bring the sums over the to the inside; implies that
[TABLE]
We detect this condition using Perron’s formula in an integral over . Then the above is
[TABLE]
where . We simplify this a bit. We combine the middle two lines into a single product over and gather together all of the like variables (note that the sums over below are now restricted to the positive integers) :
[TABLE]
At this point we can rigorously identify with the terms on the right of (2), through our key identity:
Theorem 1**.**
[TABLE]
where denotes a set of cardinality with precisely one element from each of and similarly denotes a set of cardinality with precisely one element from each of .
5. Preliminary reductions
Lemma 1**.**
[TABLE]
Proof.
The case of this identity may be found in [CK1]. We may prove the general case by working our way from the inside out and using the technique of that proof. For example, with fixed we have that the integral over is
[TABLE]
We split this into two double integrals, one with and the other with . The first we rotate the -path onto the positive imaginary axis, and the second we rotate the path onto the negative imaginary axis. By absolute convergence, we may now interchange the order of integration to arrive at a sum of two -integrals inside a -integral. We evaluate the integrals using the definition of the gamma-function. Then we repeat the process to evaluate the sum over of the integral over for a fixed . And so on. ∎
6. Poles
We have
[TABLE]
where is a multiplicative function for which
[TABLE]
with . With , this leads to
[TABLE]
where
[TABLE]
Inserting this into we have
[TABLE]
where with and with . Now we sum over the to get factors . Thus,
[TABLE]
If we move the path of integration in to the line with , then we cross the poles of the at . These contribute an amount that cancels the contribution of the .
Next, we apply the lemma of Section 5 to evaluate the integral over the and obtain a factor of . Then using the functional equation for we have . Thus, the -integrand without the in LHS becomes
[TABLE]
our goal is to prove that this is equal to
[TABLE]
This further reduces to proving for each that
[TABLE]
7. Local considerations
We shall find it convenient to state our main theorem as an identity of the Euler factor at a prime . We begin by introducing a set-theoretic notation. First of all, since is fixed for this discussion we will often suppress it. In fact we write for and mostly consider power series in . We take the unusual step of suppressing not only the prime but the divisor function and so we write in place of . Also, for a set we let
[TABLE]
A further piece of notation: . We have two important identities. The first is
[TABLE]
This is a special case of
[TABLE]
The other identity is
[TABLE]
which follows by repeated application of the first identity.
For arbitrary sets , we let
[TABLE]
Also, we let
[TABLE]
We begin with sets and numbers for . We consider
[TABLE]
where
[TABLE]
Our identity is
Theorem 2**.**
[TABLE]
By the results of the previous section, Theorem 1 follows from Theorem 2 with in place of , in place of , and in place of .
7.1. Some lemmas
Because of the condition we consider and . We have
Lemma 2**.**
[TABLE]
and
[TABLE]
We defer the proof to later.
The result of the lemma leads us to consider
[TABLE]
We will prove
Lemma 3**.**
We have
[TABLE]
The right-hand side of Theorem 2 may be expanded. This leads to
Lemma 4**.**
For let
[TABLE]
We have
[TABLE]
where and .
The combination of these three lemmas easily leads to a proof of Theorem 2.
7.2. Proof of Theorem 2
Proof.
By Lemma 1 the left side of the identity in Theorem 2 may be written as
[TABLE]
By Lemma 2 this is
[TABLE]
and by Lemma 3 this is
[TABLE]
which is the right side of the identity in Theorem 2.
∎
7.3. Proof of first lemma
Proof.
Expanding the -sum, we have
[TABLE]
We split this into the terms with and those with . We have
[TABLE]
The sum over telescopes so that this is
[TABLE]
Next we consider
[TABLE]
We replace by and have
[TABLE]
Now the sum over and telescopes and we have
[TABLE]
We recognize a convolution in the first term and rewrite this as
[TABLE]
The middle term here may be written as
[TABLE]
The second term of this cancels with and so we have
[TABLE]
This may be rewritten as
[TABLE]
∎
By symmetry
[TABLE]
7.4. Proof of second lemma
Proof.
We prove more generally that
[TABLE]
where the , and are any functions on the natural numbers (i.e. sequences) and just means the usual Cauchy convolution one encounters when multiplying power series together. It suffices to prove
[TABLE]
as then our desired result follows upon integrating from 0 to 1 upon taking . But now the left hand side is a product
[TABLE]
and the right hand side is a product
[TABLE]
Therefore, it suffices to prove that
[TABLE]
To do this, we consider the right hand side and order the double sum according to the minimum, call it , of and . The right hand side may be rewritten as
[TABLE]
Replacing by and by , we see that this is exactly the left hand side. ∎
7.5. Proof of third lemma
Proof.
Recall that
[TABLE]
Using this we see that
[TABLE]
In the last line we can replace and by and since and similarly for . Multiplying out the last line and combining it with the line above we have
[TABLE]
Now the idea is to apply this to each . We have
[TABLE]
We end up with
[TABLE]
which is equal to
[TABLE]
∎
8. Terms with some
Suppose that we are in the situation where
[TABLE]
Then for each we have
[TABLE]
Since this implies that
[TABLE]
for some . Then, our sum is
[TABLE]
where
[TABLE]
Now, as before, we replace the convolution sums (*) by their averages, i.e.
[TABLE]
where is defined by
[TABLE]
here . We expect by the delta-method [DFI] that
[TABLE]
with
[TABLE]
So, we are led to
[TABLE]
We make the changes of variable for and bring the sums over the to the inside; implies that
[TABLE]
We detect this condition using Perron’s formula in an integral over . Then the above is
[TABLE]
where the arise from taking account of the signs of the . We now simplify this a bit. We combine the middle two lines into a single product over and we gather together all of the like variables:
[TABLE]
Now we have another key identity:
Theorem 3**.**
[TABLE]
where denotes a set of cardinality with precisely one element from each of and similarly denotes a set of cardinality with precisely one element from each of .
9. Preliminary reductions, again
The result of Section 5 implies that
[TABLE]
10. Poles, again
As before we use
[TABLE]
Inserting this into we have
[TABLE]
Now we sum over the to get factors ; these pair up with the factors which turned into after collecting the residues and that arose from the integral over . Then using the functional equation for we have . Thus, the -integrand without the in becomes
[TABLE]
where and . Our goal is to prove that the residue of this at is equal to
[TABLE]
This further reduces to proving that
[TABLE]
11. Local considerations, again
Again we convert the above to an identity about the Euler factor of each side at a prime .
With arbitrary sets and numbers for , we consider
[TABLE]
where
[TABLE]
as before.
Our identity is
Theorem 4**.**
[TABLE]
By the results of the previous section, Theorem 3 follows from Theorem 4 with in place of for and with , and in place of , , and , respectively, for .
11.1. Recall lemmas
Our earlier lemma implies that if then
[TABLE]
So, we can replace the s in the formula for by this expression.
Thus, we have
[TABLE]
Now, the critical observations are that
[TABLE]
as before, and
[TABLE]
where and .
These together imply Theorem 4.
12. Multiplicities
12.1. How many times is a given swap repeated?
Now we need to give an accounting of what we have so far. Each time we split and up into subsets and we accumulate terms that correspond to all swaps of and . For a fixed decomposition of into subsets we clearly do not get ALL swaps of -sized subsets of and . Our solution to this dilemma is that we consider all decompositions of into disjoint non-empty subsets and similarly for . Then every pair of sized subsets will indeed appear in the swaps. However, now two different decompositions will often lead to the same swap. So how do we account for the overcounting?
How many times will a given -sized swap for occur? This is equivalent to asking how many ways can be split into subsets where contains ? If has elements then there are elements that can be distributed arbitrarily into sets. This can happen in ways. Similarly for . Taking into account permutations we end up with a multiplicity of .
12.2. How many times does the same lead to a solution of a -system?
Our original problem is to evaluate
[TABLE]
Note that if and then
[TABLE]
We split into and into ; this is equivalent to splitting into where and also where . Then and . Now after this splitting we count the and according to our -system:
[TABLE]
where . Now let’s say we have a solution of the -system as above and let’s take a collection of divisors of the and . For simplicity, let’s suppose that and for . Let’s write
[TABLE]
The question is: How many ways are there to do this? If we multiply the th equation in our system by , where and , then we have a new equation
[TABLE]
where
[TABLE]
If then the common factor can be divided out and out of . Note that
[TABLE]
Thus, we have a new system but it corresponds to exactly the same and as in the old one. The number of ways to construct these -systems is just the number of ways to compose the as products of the available and the from the . But this is exactly for the and the same for the . Then we take into account the ordering of the and of the ; this gives a factor of . In this way we arrive at a multiplicity for each solution of our -system which is the same as the multiplicity counted in the swaps of -sets.
Note that the same argument applies whether any of the are 0 or not. We need to divide out this multiplicity.
This explains the weight factor in (6).
12.3. Conclusion
We have found that can be conjecturally evaluated by two different methods which produce the same answer. One way is to use the recipe of [CFKRS]. The other way is to let be defined by . Then partition and into subsets and evaluate a convolution of shifted divisor sums
[TABLE]
by a conjectural approach that involves the delta-method of [DFI]. A rigorous theorem identifying two Euler products proves that the result of the above agrees with some of the terms arising from the recipe. The terms with all correspond to -swap terms from the recipe. The terms with of the non-zero and of the equal to 0 give swap-terms. Finally, if we sum over all possible partitions of and into non-empty subsets and account for multiplicities we achieve the desired equality between the two approaches.
A natural direction for further research is to consider other families of L-functions, for example quadratic Dirichlet L-functions, and to determine an arithmetic basis for the relevant moment conjectures.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BK 1] E.B. Bogomolny and J.P. Keating. Random matrix theory and the Riemann zeros I: three- and four-point correlations. Nonlinearity 8 (1995), 1115–1131.
- 2[BK 2] E.B. Bogomolny and J.P. Keating. Random matrix theory and the Riemann zeros II: n 𝑛 n -point correlations. Nonlinearity 9 (1996), 911–935.
- 3[B] T. D. Browning. Quantitative arithmetic of projective varieties. Volume 277 of Progress in Mathematics. Birkhäuser Verlag, Basel, 2009.
- 4[CFKRS] J.B. Conrey, D.W. Farmer, J.P. Keating, M.O. Rubinstein and N.C. Snaith. Integral moments of L 𝐿 L -functions. Proc. Lond. Math. Soc. 91 (2005) 33–104.
- 5[CK 1] J.B. Conrey and J.P. Keating. Moments of zeta and correlations of divisor-sums: I. Phil. Trans. R. Soc. A 373 (2015), 20140313; ar Xiv:1506.06842
- 6[CK 2] J.B. Conrey and J.P. Keating. Moments of zeta and correlations of divisor-sums: II. In Advances in the Theory of Numbers – Proceedings of the Thirteenth Conference of the Canadian Number Theory Association, Fields Institute Communications (Editors: A. Alaca, S. Alaca & K.S. Williams), 75–85 (2015, Springer); ar Xiv:1506.06843
- 7[CK 3] J.B. Conrey and J.P. Keating. Moments of zeta and correlations of divisor-sums: III. Indagationes Mathematicae 26 (2015), no. 5, 736–747; ar Xiv:1506.06844
- 8[CK 4] J.B. Conrey and J.P. Keating. Moments of zeta and correlations of divisor-sums: IV. Res. Number Theory (2016) 2:24; ar Xiv:1506.06844
