$n$-level density of the low-lying zeros of primitive Dirichlet $L$-functions
Vorrapan Chandee, Yoonbok Lee

TL;DR
This paper confirms that the low-lying zeros of primitive Dirichlet L-functions statistically match the eigenvalue distribution of the random unitary ensemble, supporting the Katz-Sarnak conjecture through advanced analytical methods.
Contribution
It provides a rigorous confirmation of the Katz-Sarnak conjecture for primitive Dirichlet L-functions, including off-diagonal contributions, using the asymptotic large sieve and random matrix theory formulas.
Findings
Low-lying zeros match random matrix predictions
Includes off-diagonal contributions in the analysis
Uses asymptotic large sieve for density estimation
Abstract
Katz and Sarnak conjectured that the statistics of low-lying zeros of various family of -functions matched with the scaling limit of eigenvalues from the random matrix theory. In this paper we confirm this statistic for a family of primitive Dirichlet -functions matches up with corresponding statistic in the random unitary ensemble, in a range that includes the off-diagonal contribution. To estimate the -level density of zeros of the -functions, we use the asymptotic large sieve method developed by Conrey, Iwaniec and Soundararajan. For the random matrix side, a formula from Conrey and Snaith allows us to solve the matchup problem.
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.
-level density of the low-lying zeros of primitive Dirichlet -functions
Vorrapan Chandee
Mathematics Department
Kansas State University
Manhattan, KS 66503
and
Yoonbok Lee
Department of Mathematics
Research Institute of Basic Sciences
Incheon National University
Incheon, 22012
Korea
[email protected], [email protected]
Abstract.
Katz and Sarnak conjectured that the statistics of low-lying zeros of various family of -functions matched with the scaling limit of eigenvalues from the random matrix theory. In this paper we confirm this statistic for a family of primitive Dirichlet -functions matches up with corresponding statistic in the random unitary ensemble, in a range that includes the off-diagonal contribution. To estimate the -level density of zeros of the -functions, we use the asymptotic large sieve method developed by Conrey, Iwaniec and Soundararajan. For the random matrix side, a formula from Conrey and Snaith allows us to solve the matchup problem.
1. Introduction
Efforts to understand the location of zeros of the Riemann zeta function have played an important role in the development of analytic number theory. Classically, information about the horizontal distribution of these zeros yielded better understanding about the distribution of prime numbers. Moreover, Montgomery [16] calculated statistics of the spacings of zeros along the vertical line; more specifically, he examined the so called pair-correlation function, which is a quantity roughly of the form
[TABLE]
where under the Riemann hypothesis (RH), are non-trivial zeros of the Riemann zeta function, is the number of zeros such that , and is a Schwartz function on . Then assuming the Fourier transform is supported in , he showed that as
[TABLE]
where . Equation (1.1) is expected to be true for any Schwartz function, and this is the Pair Correlation conjecture. Dyson later pointed out to Montgomery that the factor is the same as the distribution of the spacings of eigenvalues of the Gaussian unitary ensemble (GUE) distribution from random matrix theory, which forshadowed a great deal of work later. Indeed, the link between the Riemann zeta function and random matrix theory has led to a better understanding of both moments and zeros of -functions (see for example [13], [14] and [20]).
Özlük [18] studied a -analogue of Montgomery’s pair correlation result under the Generalized Riemann hypothesis (GRH) for Dirichlet -functions. In particular, he considered the pair correlation function of a family of Dirichlet -functions averaging over characters modulo , where . The large size of the family () compared to the conductor () allows for an extension of the support of the Fourier transform of the test function beyond what is readily available. In this undertaking, Özlük dealt with the contribution of certain off diagonal terms, and he was able to succeed with the extra average over the modulus. Recently, the authors in joint work with Liu and Radziwiłł[2] revisited Özlük’s pair correlation function but averaging over primitive characters instead, using an asymptotic large sieve introduced by Conrey, Iwaniec and Soundararajan [4]. As a result, we improved the proportion of simple zeros of primitive Dirichlet -functions.
The pair correlation conjecture has been extended to -level correlation of the zeros of the Riemann zeta function through random matrix theory, which studies statistics involving -tuples of zeros. In support of the conjecture, Rudnick and Sarnak [20] proved the result for some special test functions . To describe their results more precisely, assuming RH, let be nontrivial zeros of the Riemann zeta function. Rudnick and Sarnak studied the sum of the the form
[TABLE]
where and is a rapidly decaying cut-off function. We define the -level correlation density for the GUE model as
[TABLE]
where
[TABLE]
Then assuming the condition
[TABLE]
and a couple of other technical conditions omitted for now, Rudnick and Sarnak showed that
[TABLE]
where is the Dirac-delta function. This result essentially reduces to (1.1) when . To deal with the sum over non-trivial zeros appearing in , they applied the explicit formula, which connects this sum over zeros to a sum over prime powers, basically of the form
[TABLE]
where the factor contains terms involving the Fourier transform of . The restriction of the support of the Fourier transfrom of is required so that the contribution from the off diagonal terms can be ignored. Although it is not hard to evaluate the diagonal terms , it was still a challenge to verify that their answers agree with the conjecture arising from the random matrix theory. Rudnick and Sarnak went through complicated combinatorial arguments involving random walks. Later, Conrey and Snaith presented a new formula for -correlation from the random matrix theory side in [5] and applied it in [6] to straightforwardly match results from both sides. Although this formula looks more intricate than the determinant form in (1.2), it expresses the answer in terms of a test function, where the Fourier transform is supported in any range, and this allows one to naturally match answers from the number theory side.
In analogy with the Pair Correlation conjecture, we expect Rudnick and Sarnak’s result above to hold without any condition on the support of the Fourier transform of , where the off-diagonal terms also contribute. It is worth noting that this type of conjecture is quite powerful and appears currently intractable. In particular, Montgomery’s original Pair Correlation conjecture easily implies that there are infinitely many pairs of zeros of which are far less than the average spacing apart, and this has deep consequences towards Siegel zeros. Typically, even extending the support of the Fourier transform beyond what is currently available is a challenging problem.
Katz and Sarnak [13, appendix] computed the -level density of eigenvalues of various random matrix ensembles and conjectured that the statistics of low-lying zeros of various families of -functions is the same as the corresponding one from the random matrix theory. Rubinstein [19] studied a family of quadratic Dirichlet -functions and proved that the -level density for the family matched with the one for symplectic unitary ensemble in a certain range. Later Gao [10] doubled the allowable range of the support of the Fourier transform of the test function, but he was not able to prove that his answer matched the conjecture from random matrix theory. This was then resolved by Entin, Roditty-Gershon and Rudnick through zeta functions over function fields [8]. Recently, Mason and Snaith [15] presented an alternative proof of this result using a new formula for -level densities of the random symplectic ensemble, analogous to the work of Conrey and Snaith in [5] and [6].
While only a symplectic family is considered in [8], [10] and [19], we consider a family of primitive Dirichlet -functions, which is a unitary case. To be more precise, let be a primitive Dirichlet character modulo , and a Dirichlet -functions associated to it is defined to be
[TABLE]
for Re Throughout this paper, we assume GRH for the Dirichlet -function and write its nontrivial zeros as , , where
[TABLE]
We say that a function has the C4-Property provided that
**P1: **
There exist even functions for such that each function has a Fourier transform with a support contained in an interval and
[TABLE]
**P2: **
and .
We define the -level density function by
[TABLE]
where is a smooth function with a compact support in , the -sum is over primitive Dirichlet characters modulo , the -sum is over distinct indices and throughout this paper
[TABLE]
If , the off-diagonal terms in do not contribute to the main term, and the same method as for proving -correlation of the Riemann zeta function can be applied here, and we do not even need the extra average over . For example, previously, Hughes and Rudnick [11] derived the same result as in Theorem 1.1 when and averaging only over primitive characters of a fixed prime modulus. Otherwise, the off-diagonal terms also contribute to the main term in . In this paper, we use the asymptotic large sieve technique to deal with the off-diagonal terms and evaluate
[TABLE]
The -average is fairly short due to the rapid decay of along the vertical line, and its appearance is to deal with certain unbalanced sums of the prime powers. Thus this average involves points very close to the real axis, and it is expected to have the same asymptotic formula as up to a constant factor. It would be very interesting to develop techniques to evaluate without the additional short average over . The computation of the sixth [3] and eighth moment [1] of Dirichlet -functions, averaging over the same family of primitive characters, also contains a similar -average for the same reason.
Our goal is to prove the following theorem.
Theorem 1.1**.**
Assume GRH for all primitive Dirichlet -functions. Let have the C4-Property as described above. Then
[TABLE]
where
[TABLE]
* is the number of primitive characters mod and is defined in (1.2).*
Note that instead of the C4-Property we may assume in Theorem 1.1 that is even in all variables and is supported in the region by an approximation argument as in Corollary 1.3 of [8].
This is consistent with the -correlation conjecture arising from the GUE model in random matrix theory where we are able to use a test function whose Fourier transform has double the support of the ones appearing in Rudnick and Sarnak’s work. This is the first time for unitary ensemble that the conjecture is verified for a wider range for all .
We note that stronger estimations for without -average were studied and conjectured. For details, see [9] and [11].
The proof contains a number of technical details, so we outline it here. In Section 2, we will apply a combinatorial sieving, which transforms the sum over distinct ordered zeros in to the unrestricted sums. By the explicit formula for a primitive Dirichlet -function, we can express the sum over zeros as a sum over primes. Then, essentially we need to understand the sum in Proposition 5.1. The diagonal term is easy to evaluate, but in our case there is an off-diagonal contribution. To deal with this, we apply the asymptotic large sieve technique developed in [4]. Certain delicate combinatorial arrangements appear in these terms along this process. This phenomena does not occur in the pair correlation work of [2] because it can be easily reduced to cases when and are prime numbers. The details will be covered in Section 5. As a result, the asymptotic formula for (1.4) is given in (5.37).
Finally, we verify that the result agrees with the random matrix conjecture through the new -correlation formula of Conrey and Snaith [5], [6]. The detailed proof will appear in Section 6.
2. Initial Setup for the proof of Theorem 1.1
In this section, we will explain how the sum over distinct ordered zeros in can be deduced from the unrestricted sum by the combinatorial sieving. This sieving is also appeared in [20], but we describe it here for the sake of completeness.
A set partition of is a decomposition of into disjoint nonempty subsets , where . The collection of all set partitions of forms a lattice with the partial ordering given by if every set in is a union of sets in . For example, in . Hence the minimal element of is and the maximal element is .
Lemma 2.1**.**
The Möbius function of the poset is the unique function such that for any functions , satisfying
[TABLE]
we have
[TABLE]
In particular,
[TABLE]
Given a set partition , define an embedding by , where if . For example, when , We also define
[TABLE]
and
[TABLE]
where the -sum is over primitive Dirichlet characters modulo , the -sum is over distinct indices , and
[TABLE]
Then
[TABLE]
and by Lemma 2.1
[TABLE]
We focus on computing Let
[TABLE]
for . Then by Claim 1 of [19] the Fourier transform is supported in with
[TABLE]
and the function has the C4-Property defined in Section 1. Thus, we see that
[TABLE]
Applying the explicit formula in Lemma 3.1, we find that
[TABLE]
where
[TABLE]
[TABLE]
and is defined in (3.2). Let ,…, be a collection of disjoint sets of integers, and let be a set of integers. Here and throughout this paper, means is a disjoint union of . Next we write
[TABLE]
and
[TABLE]
where is the number of elements in
[TABLE]
and
[TABLE]
Then
[TABLE]
We estimate in Sections 4–5. In Section 4 we first prove that the main contribution to comes from the cases and squarefree . As mentioned in the introduction, the main contribution is categorized into two types – diagonal terms (), calculated in Section 4, and off-diagonal terms (), estimated in Section 5.
3. Preliminary lemmas
In this section, we present lemmas required in the proof of Theorem 1.1. Let be a smooth and rapidly decreasing function on with
[TABLE]
Then has an extension to the complex plane that is entire with
[TABLE]
for some . See Theorem 3.3 in [21, p.122] for a proof. Moreover, for any integer and any real number , one can show by partial integrations that
[TABLE]
for and .
Lemma 3.1** (Explicit Formula).**
Let be a primitive Dirichlet character modulo , and be a smooth and rapidly decreasing function with its Fourier transform compactly supported. Assume GRH for . Define
[TABLE]
Then we have
[TABLE]
where and
[TABLE]
Proof.
Define
[TABLE]
Then is an entire function and its zeros are exactly the nontrivial zeros of . By Cauchy’s integral formula
[TABLE]
Note that the contribution from the horizontal lines vanishes by (3.1). We shall estimate first.
[TABLE]
Writing out in term of its Dirichlet series and shifting the contour integration to Re, we have
[TABLE]
[TABLE]
and
[TABLE]
Next we consider . By the functional equation of ,
[TABLE]
(See Section 10.1 of [17] for the detail.) Thus,
[TABLE]
By the same argument as , we obtain that
[TABLE]
[TABLE]
and
[TABLE]
Hence,
[TABLE]
Since , . Moreover, by Stirling’s formula, the integration above is bounded by
[TABLE]
and we then obtain (3.2).
∎
Lemma 3.2** (Large sieve inequality).**
For any complex numbers with , where is a positive integer, we have
[TABLE]
This is a consequence of Theorem 7.13 in [12].
Lemma 3.3**.**
Let be defined as in (1.5). Then
[TABLE]
where is the Mellin transform of and the product is over the prime numbers.
Proof.
By the Mellin inversion formula and
[TABLE]
we have
[TABLE]
Since and , we obtain that
[TABLE]
where
[TABLE]
and it is absolutely convergent when Therefore
[TABLE]
Moving the contour integration to the line , we pick up a simple pole at . Since the Mellin transform of the compactly supported decays faster than any power of , we derive the lemma.
∎
Lemma 3.4**.**
Let be a positive integer. Then for
[TABLE]
where
[TABLE]
For we have , and , where is the number of distinct prime factors of .
Proof.
One can prove the first identity in the lemma by changing the sum to its Euler product. The proof is quite standard and we omit it. To prove the inequalities we see that for
[TABLE]
Note that the infinite products in (3.4) are convergent. ∎
Lemma 3.5**.**
Let be a nonprincipal Dirichlet character modulo . Suppose that . Assume GRH for . Define
[TABLE]
and
[TABLE]
where is defined in (2.2). Let with . Then
[TABLE]
where the implied constant depends on and .
Proof.
Define
[TABLE]
for , and otherwise, . Furthermore, we define
[TABLE]
and
[TABLE]
where , , and are defined in Section 2. It is clear that
[TABLE]
and by Lemma 2.1, we have
[TABLE]
For each , we have
[TABLE]
If , then
[TABLE]
When , is compactly supported in where and it follows that
[TABLE]
Hence
[TABLE]
where is the number of such that When Re, it is known that under GRH,
[TABLE]
(e.g. Chapter 19 in [7]). By Fourier inversion formula, the fact that is supported in , and the integration by parts, we have for ,
[TABLE]
for any nonnegative integer . Because is a non-principal character and using the bound above, we have
[TABLE]
Therefore,
[TABLE]
and the lemma follows from the above and Equation (3.5).
∎
Lemma 3.6**.**
Assume RH and that is smooth and rapidly decreasing with compactly supported. Define
[TABLE]
Then
[TABLE]
for , and
[TABLE]
for .
Proof.
Since , we have for . Therefore it is enough to consider only the negative case.
When , by similar arguments to (3.6), we obtain that
[TABLE]
Now we prove the first assertion. Assume that . By the prime number theorem of the form
[TABLE]
under RH, we have
[TABLE]
∎
Lemma 3.7**.**
Let be complex numbers with . Let be a smooth and rapidly decreasing function with compactly supported . Then
[TABLE]
Proof.
Applying the Fourier inversion formula and then changing the order of integrals, we see that
[TABLE]
For we shift the -integral to ; otherwise, we shift the -integral to . By picking up residues properly, we can conclude the proof of the lemma. ∎
4. Extracting the main contribution of
We recall from Equation (2.5) that
[TABLE]
In this section, we will extract the main contribution of , and the first steps are to show that the main contribution comes from the following terms.
- •
;
- •
;
- •
are squarefree.
This length of and is optimal for the large sieve inequality in Lemma 3.2 as the size of the family of -functions is . We will show how to truncate the sums over in Lemma 4.1. The integration over is an important ingredient to balance the size of . Moreover, we will use the Cauchy-Schwarz inequality and the large sieve inequality to show that the contribution from other terms is small.
Next we extract the main “diagonal” terms:
- •
. (Equation (4.3))
- •
and are not empty sets, and . (Lemma 4.3). These terms are easy to evaluate from the prime number theorem and partial summation.
We will also describe how the main contribution from “off-diagonal” terms looks like, and it will be calculated in the next section.
Lemma 4.1**.**
Let all notations be defined as in Section 2. Then
[TABLE]
where is defined in (3.2).
Proof.
As previously mentioned, each is supported in . Thus, for , for and
[TABLE]
where and . Note that .
The bound in (3.2) is not sufficient to prove the lemma, so we shall use the Fourier inversion formula. The Fourier transform of is
[TABLE]
so for each , we have
[TABLE]
Hence the -integral
[TABLE]
in is a combination of
[TABLE]
with a nonnegative integer , where
[TABLE]
satisfying
[TABLE]
It is known that
[TABLE]
Taking derivative with respect to on both sides, we obtain that
[TABLE]
where is an -degree polynomial function. Therefore
[TABLE]
If for , then . Since , it follows that
[TABLE]
and so
[TABLE]
Hence,
[TABLE]
Inserting the above bound in (4.1) and (2.5), we obtain that the contribution from the terms is
[TABLE]
for some constant . The similar arguments can be applied to the terms , and this concludes the proof of the lemma.
∎
Next, we will show that the main contribution of comes from terms with .
Lemma 4.2**.**
Let all notations be defined as in Section 2. Then
[TABLE]
Proof.
By the bound of in Lemma 3.1, we obtain that each component of the main term of in Lemma 4.1 is bounded above by
[TABLE]
Next, we apply the Cauchy-Schwarz inequality and the large sieve inequality (Lemma 3.2) and have that the above is bounded by
[TABLE]
Hence the contribution from is at most . ∎
Now we focus on the main term of Lemma 4.2. It is clear that the contribution of the case is
[TABLE]
If but , then by (4.2) the contribution from these terms is bounded by
[TABLE]
The same holds for the case and . Thus we can now consider the case .
By repeated uses of the Cauchy-Schwarz inequality and Lemma 3.2, we can add the conditions such as are squarefree with an error . For instance, the contribution of non-squarefree is bounded by
[TABLE]
Then we see that
[TABLE]
Each is supported in prime powers. If is not squarefree, then at least one of the ’s is not squarefree, or all the ’s are squarefree but there are at least two of the ’s having a common prime factor. Thus, we see that the above sum is
[TABLE]
We also see that
[TABLE]
Hence, the contribution of the non-squarefree is .
Therefore, and can be written as products of distinct primes as the following:
[TABLE]
However, might have a common prime divisor. Let for some and . Then there is a unique bijection such that for all . Moreover, since is compactly supported, by the similar arguments to the proof of Lemma 4.1, we can remove the conditions with error term of size O\big{(}e^{-\tfrac{\varepsilon^{2}}{6}(\log Q)^{2}}\big{)}. Hence,
[TABLE]
where
[TABLE]
and Note that the sum over is 1 if and the sum over is 1 if and the sum over is 1 if . When and , one can show that
[TABLE]
by the same method as in (4.4) and its contribution to is . The same holds for the case and . Let be the above sum with the additional conditions and be the above sum with the additional conditions . Then we see that
[TABLE]
The term is so-called “diagonal terms” and the term is “off-diagonal terms”. has a relatively simple representation as
[TABLE]
where . Then we can obtain
[TABLE]
by the following lemma.
Lemma 4.3**.**
Let be a primitive Dirichlet character mod and . Then
[TABLE]
Proof.
By the inclusion-exclusion principle, the prime number theorem and the fact that is uniformly convergent and bounded for and , we have that
[TABLE]
Since the number of primes diving is , the above is
[TABLE]
By the prime number theorem and the partial summation, we obtain that
[TABLE]
Thus the lemma holds.
∎
Therefore, by (4.5), (4.6) and (4.7) we have
[TABLE]
.
5. Calculation of
In this section we will calculate defined in a line ahead of (4.6) using the asymptotic large sieve method. By the definition of and switching summations, it can be written as
[TABLE]
where and denotes
[TABLE]
Note that is the positive integer introduced in Section 1 and let and be positive integers with . Due to the factor , is supported in squarefree positive integers and the number of prime divisors of is less than or equal to . We start by estimating , which is a special case of . It will be apparent that our treatment of can be generalized to deal with .
Proposition 5.1**.**
Define
[TABLE]
where
[TABLE]
Suppose that is supported in for . Also for fixed we assume that , where and . Then
[TABLE]
where
[TABLE]
[TABLE]
* is the Dirac delta function, , , for and .*
In later application, when , as in (2.2) and (2.3). We need new notations to extend Proposition 5.1 to general cases, so we will postpone it and complete the estimation of in Section 5.5.
Outline of the proof of Propotion 5.1
Since there are various techical details in this section, we outline the key points of the proof here. Roughly speaking, after orthogonality relation of Dirichlet characters, we shall study the sum of the form
[TABLE]
where are supported in squarefree numbers defined in (5.3). Then we can divide the sum into two cases: small and big . Thus .
For , the contribution from small , we express the condition as the character sum . The contribution from the principal character, say , is large, and the corresponding terms to non-pricipal characters are negligible. These will be proved in Lemma 5.2. Though is large, it will cancel with one of the main terms from .
For , the key ingredient is the complementary divisor trick, which is (ignoring gcd conditions). We then express the condition as the character sum instead. Note that since is large, and , is small. In the critical range, which is and , we obtain that . The smaller conductor allows us to bound error terms. Note that without integration over , the size of could go up to and the size of would be too large to obtain negligible error terms.
Again the main term of , say , is from the principal character (see Section 5.2). Then we apply the Mellin inversion to write in terms of contour integration of over and as in Lemma 5.4. The main terms come from the residue at (from the factor ) and (from the factors and ). The contribution from the residue at is cancelled out with . Then technical manipulation, e.g. inclusion-exclusion and Fourier transform, in Lemma 5.6 - 5.8 is done to express the contribution of the residue at in the form that will be easily compared with conjectures from random matrix in Section 6.
Proof of Proposition 5.1:
We start from applying the orthogonality relation of Dirichlet characters and obtain that
[TABLE]
Since is supported in products of distinct primes, is supported in products of distinct primes and ,
[TABLE]
We have that
[TABLE]
say, where is the sum over (i.e. is small), and is the sum over (i.e. is big) with for some to be determined later. The remaining part of the proof will be given in Section 5.1 – Section 5.4
5.1. Evaluating
In this section we will prove the following lemma.
Lemma 5.2**.**
Let all notations be as above. Then for any
[TABLE]
where
[TABLE]
and and are defined as in Lemma 3.4.
Proof.
Let
[TABLE]
then
[TABLE]
Replacing the condition by the orthogonality relation of a character sum, we have
[TABLE]
We first evaluate . Since for , we see that
[TABLE]
for . Hence, by writing in terms of its Mellin transform , we have
[TABLE]
Applying Lemma 3.4 to the sum over , we have
[TABLE]
We move the -contour to and encounter a simple pole at Then for any small
[TABLE]
by Lemma 3.4. Note that the -term above depends on . Hence by the support of in Proposition 5.1, we have
[TABLE]
We next consider . Define
[TABLE]
By Lemma 3.5, we obtain that
[TABLE]
for any . We derive the lemma from the fact that
∎
5.2. Evaluating
In this section, we will treat the terms with We write
[TABLE]
where
[TABLE]
The conditions and imply , so that we can remove the condition in the sum. By the identity
[TABLE]
we obtain that
[TABLE]
We substitute the sum over by the sum over through the condition and then write the condition in term of Dirichlet characters. Hence
[TABLE]
where
[TABLE]
and
[TABLE]
We remark that and imply that . Define
[TABLE]
and
[TABLE]
so that
[TABLE]
We first estimate .
Lemma 5.3**.**
Let be defined in (5.8). Then for any
[TABLE]
where and are defined as in Proposition 5.1.
Proof.
We write out as
[TABLE]
If or is greater than for , then
[TABLE]
and
[TABLE]
It then follows that
[TABLE]
Hence, we can restrict the range of up to with an error of size for any positive integers For in this range, we have
[TABLE]
Since is supported in the interval , if
[TABLE]
then
[TABLE]
Therefore we add the condition and then remove the restriction from the sum over with an additional error . Thus,
[TABLE]
By Mellin inversion of and changing the order of sums and integrals we have for
[TABLE]
where is the Mellin transform of . To separate and , we apply the following identity
[TABLE]
where , and . The integral is absolutely convergent due to the product of gamma factors decaying like . To prove (5.9), it is enough to show that
[TABLE]
for , and and it is readily seen by the following two identities. We have
[TABLE]
by shifting the contour to the left and applying the binomial theorem, and
[TABLE]
by shifting the contour to the right. By (5.9), we write
[TABLE]
where
[TABLE]
We choose for . Applying Lemma 3.5 to and and using the fact that (due to support of ), we obtain that
[TABLE]
for any , concluding the proof of the lemma.
∎
5.3. Evaluating
Next, we compute defined in (5.7). Indeed, we will show that one of the main terms from will cancel out with the main term of , which is defined in (5.5). Let be defined as in Proposition 5.1. In this section, we will show the following:
[TABLE]
By applying Mellin inversion, Lemma 3.4 and (5.9), we obtain the following lemma.
Lemma 5.4**.**
We have that
[TABLE]
and
[TABLE]
where each is a small positive number for ,
[TABLE]
[TABLE]
the functions and are defined in Lemma 3.4 and
[TABLE]
Proof.
First we write in (5.7) in terms of the Mellin transform of . For small
[TABLE]
By Lemma 3.4, the sum over is
[TABLE]
where the functions , and are defined in the lemma. Since , , and is multiplicative, it follows that , and
[TABLE]
Moreover, we can drop the condition since and . Then we see that
[TABLE]
By changing the order of summations and applying (5.9) and the fact that , we can find the first identity in the lemma.
The second identity in the lemma follows easily by switching the order of summations in (5.5) and using the coprime conditions.
∎
By estimating using Lemma 2.1, we find the next lemma.
Lemma 5.5**.**
We have
[TABLE]
where for each
[TABLE]
with , , and , and
[TABLE]
[TABLE]
and
[TABLE]
if , and equals to 0 otherwise.
Proof.
Define
[TABLE]
for , where is the sum over distinct primes. Then
[TABLE]
for any . By Lemma 2.1, we have
[TABLE]
By Lemma 5.4 and (5.15), the lemma holds. ∎
We now compute , which will yield the estimation of and , and obtain the following lemma.
Lemma 5.6**.**
Let notations be as defined above. Then we have
[TABLE]
where
[TABLE]
[TABLE]
and
[TABLE]
for and each is defined in (5.20) and (5.21).
Proof.
Define
[TABLE]
for each , then we have
[TABLE]
To estimate (5.13) and (5.14), represents or .
Let in (5.13), then , and . If , then
[TABLE]
When , there are two cases. We find that
[TABLE]
for with and
[TABLE]
for with . Since the sum
[TABLE]
is the main part of , motivated from Lemma 3.6 we define
[TABLE]
for with and
[TABLE]
for with , then we see that
[TABLE]
for . Since is supported in , we have
[TABLE]
To estimate , by Lemma 3.6 we first see that
[TABLE]
for with . Note that the bound does not depend on because , where is defined in Section 1. Thus, by Lemma 3.6 we find that
[TABLE]
If , then we see that
[TABLE]
where and . By the estimations in the previous paragraph, we have
[TABLE]
for , where
[TABLE]
If , then we see that for every and
[TABLE]
Since the integral over in (5.13) is absolutely convergent when , we find that
[TABLE]
where
[TABLE]
and
[TABLE]
for with .
Now we first shift the -integral to . Then for each , each summand of in (5.22) has a factor
[TABLE]
for some with and or a factor
[TABLE]
for some with and . The other factors in (5.22) are bounded by a power of uniformly for and in any given vertical strips. Thus, we see that is rapidly decreasing as by (3.1). Similarly, is also rapidly decreasing as . Thus we see that the multiple integrals in are absolutely convergent and we may change the order of integrals to have
[TABLE]
We next shift the -contour to . Since has a simple pole at with the residue , we obtain
[TABLE]
From the residue theorem
[TABLE]
and by the change of variable
[TABLE]
Therefore
[TABLE]
Since and , it is not difficult to see that the main term of cancels out the residue at of . Therefore, we derive at
[TABLE]
for each .
We split the integral into two such that
[TABLE]
where
[TABLE]
and
[TABLE]
By changing the order of the -integral and the -integral in and substituting by , we see that
[TABLE]
By shifting the -contour to and changing the order of the -integral and -integral, we have
[TABLE]
where is defined in (5.18). Since and , we have . By (5.19) we find that
[TABLE]
for , and and by (3.1), (5.20) and (5.21) we also find that
[TABLE]
for any integer , , and with and the similar inequalities hold for with . By Lemma 3.6, we also have
[TABLE]
for , and . We let
[TABLE]
The function is absolutely convergent when and It is well-known that is the beta function and
[TABLE]
holds for and . Thus, we see that
[TABLE]
holds for and . If contains a set with , then by (5.22)–(5.25), (5.27) and (5.28), we find that
[TABLE]
Therefore, it is enough to consider the case and we have
[TABLE]
where is defined in (5.17).
If satisfies and for some and , then by (5.25) – (5.28), we find that
[TABLE]
Therefore, we prove the lemma. ∎
Lemma 5.7**.**
Let notations be as defined above. Then we have
[TABLE]
for any , where
[TABLE]
for and . Moreover, we have
[TABLE]
Proof.
If satisfies the property that for some and for all , then we estimate in Lemma 5.6 by shifting the -contour to for . The -contour remains on the line . Then by (3.1), (5.20) and (5.21), we see that
[TABLE]
and
[TABLE]
If satisfies the property that for some and for all , then we estimate by shifting the -contour to and the -contour to for . Then by (3.1), (5.20) and (5.21), we see that
[TABLE]
and
[TABLE]
The other ’s satisfy that for some and such that . Hence,
[TABLE]
Now we consider the sum
[TABLE]
We can write as the following product
[TABLE]
where
[TABLE]
We see that
[TABLE]
for and
[TABLE]
for . Hence we have (5.29) and
[TABLE]
The sum over is asymptotic to
[TABLE]
with an error for . Hence,
[TABLE]
for any .
∎
By expanding the products in (5.29) and changing the order of integrals, we have
[TABLE]
where , and are defined in Proposition 5.1. Hence,
[TABLE]
where
[TABLE]
for . We next estimate to derive the following lemma.
Lemma 5.8**.**
Let notations be as defined above. Then we have
[TABLE]
Proof.
To make the multiple integral in (5.30) absolutely convergent for near , we integrate the -integral by parts twice.
[TABLE]
Based on the exponent of in the integrand, we split the domain into the following three subsets :
[TABLE]
Clearly,
[TABLE]
where each is defined analogously to with in place of . We now compute each as follows, expecting that the main contribution comes from the region (Case 1). In each case, we will shift the and contours in a way that the real part of the exponent of in (5.31) is .
Case 1: . The integrand has a double pole at . By shifting the -integral to , we pick up the residue at .
[TABLE]
Since each and its derivatives are compactly supported, by shifting the -integral to the above integral is
[TABLE]
Hence, we see that
[TABLE]
Next we compute the residue at . Since
[TABLE]
as , we have
[TABLE]
The first integral can be estimated by shifting the -integral to as in (5.32) and it is bounded by . For the second integral, we shift the -integral to and pick up the residue at . The shifted integral may be estimated similarly to (5.32). Therefore we find that
[TABLE]
We observe that for , the -integral is
[TABLE]
where is the Dirac delta function. Hence,
[TABLE]
Case 2: . We shift the -contour to the line as in the first case and pick up the residue at . Then we obtain that
[TABLE]
where is in (LABEL:ress1). To estimate we bound the integrals in (LABEL:ress1) trivially and obtain that
[TABLE]
Case 3: . For this case, we shift the -integral to and bound the integral trivially. Then we see that
[TABLE]
Combining Cases 1-3 and the facts that , and , we derive that
[TABLE]
∎
Therefore, we have
[TABLE]
which proves (5.10).
5.4. Conclusion of the proof of Proposition 5.1
By Equations (5.4) and (5.10), and Lemmas 5.2 and 5.3, we have
[TABLE]
for any . Since by letting , the -terms above are . Therefore, we finally have
[TABLE]
5.5. The estimation of
To complete the calculation of , we first evaluate defined in (5.2). We list sets and in increasing order as and . By modifying arguments of Proposition 5.1 we find that
[TABLE]
where
[TABLE]
and
[TABLE]
with . By Equation (5.1) and Lemma 3.3, we have
[TABLE]
Modifying the proof of Lemma 4.3, we can show that
[TABLE]
Therefore, by Equations (2.1), (4.8) and (5.36) we conclude that
[TABLE]
where is defined in Lemma 2.1 and \mathcal{I}\big{(}S_{12},S_{22}\big{)} is defined in (5.35).
6. Comparison with Random Matrix Theory
In this section, we will complete the proof of Theorem 1.1 by comparing (5.37) with the integral
[TABLE]
in (1.4). As mentioned earlier, though this integration is in a nice form, we may need to go through complicated combinatorial arguments to match (5.37) with the integral above. Instead we shall use a new formula from Conrey and Snaith’s work [5]. In particular, we will work with Equation (6.2) for . This composes of two components, say and .
For , corresponds to the sum over in (defined in (6.3)), where . With careful analysis for residues of contour integrations in , it turns out that matches with the diagonal terms of in Equation (4.5) (see Lemma 6.3), and corresponds to the off-diagonal terms of (see Section 6.2). Moreover, each component in the off-diagonal terms corresponds to each component of defined in Equation (6.11) (see Lemma 6.4).
To do this, first we need the following lemma, which expresses the integral as the limit of -correlation of eigenvalues of random unitary matrices of size .
Lemma 6.1**.**
Let be smooth and rapidly decreasing. For an unitary matrix , write its eigenvalues as with . Then
[TABLE]
where is the Haar measure on the group of unitary matrices and is defined in (1.2).
Note that the condition in the above lemma is also required for Theorem 3.4 of [5], which will be used in the proof of Proposition 6.2.
Proof.
By Theorem 3.1 of [5], we have
[TABLE]
where
[TABLE]
It is easy to see that
[TABLE]
Since has a rapid decay, we have
[TABLE]
∎
By the above lemma, Theorem 1.1 is equivalent to
[TABLE]
Let have -property and let be a partition of . Define
[TABLE]
as in (2.2). By combinatorial sieving in Lemma 2.1, we have
[TABLE]
Then Theorem 1.1 can be deduced from Equations (2.1), (6.1) and the following proposition.
Proposition 6.2**.**
Let and be defined in Equations (1.5) and (2.4), respectively. Then
[TABLE]
Proof of Proposition 6.2
We want to apply Theorems 3.3 and 3.4 in [5] to
[TABLE]
Theorem 3.4 in [5] requires the periodicity of each function to cancel the integrals on the horizontal segments in the proof [5, p.499]. In our case, since we are taking the limit , we see that the limits of the integrals on the horizontal segments converge to zero. Thus, we can still apply Theorems 3.3 and 3.4 to find that
[TABLE]
where denotes the path from up to , denotes the path from down to for some , , and .
[TABLE]
where ,
[TABLE]
with , , is the disjoint union of two sets and , and
[TABLE]
The innermost sum of is the sum over all partitions of into singletons or doubletons .
We change the orientation of the -integral in (6.2) for each and this removes the factor . Since is rapidly decreasing, we can extend each vertical integrals. Thus
[TABLE]
Since
[TABLE]
for each ,
[TABLE]
where
[TABLE]
We now consider . When ,
[TABLE]
Combining above with (2.2) and the C4-Property in Section 1, we have
[TABLE]
and the contribution to is
[TABLE]
as . Hence, the main contribution of comes solely from the cases . Let be the contribution from the case for . Then
[TABLE]
Define
[TABLE]
for each , so that
[TABLE]
6.1. Calculation of
In this section, we will show the following lemma.
Lemma 6.3**.**
Let notations be as defined above. Then
[TABLE]
and so it can be easily deduced that
[TABLE]
Proof.
For this case, , and so equals
[TABLE]
for , where
[TABLE]
Notice that is non-zero if and only if every contains one element from and the other element from . Thus, for each partition , there is a natural bijection , defined by
[TABLE]
when for some . Hence equals
[TABLE]
Since
[TABLE]
we have
[TABLE]
The double integrals above is
[TABLE]
We shift the contour right when with the residue at the pole and left when , then the above is
[TABLE]
and this completes the proof of the lemma.
∎
6.2. Calculation of
This is the case in . There exist and such that and . For , we then have
[TABLE]
where for and ,
[TABLE]
and otherwise, . As indicated in Remark 3.2 of [5], even though each term has a singularity on the contour, the integrand has no poles because they cancel. We would like to shift contours in such a way that we avoid singularities of the integrand. If with and with , then define
[TABLE]
for some . After we replace and by and , respectively, changing the order of integrals and summations is legitimate.
We next estimate the integrand of . Define
[TABLE]
Further let a bijection be defined such that for any , for some . Hence,
[TABLE]
We then apply the above identity to , substitute by for all and take the limit . Since
[TABLE]
we find that
[TABLE]
By (6.7)–(LABEL:double_integral_3) and combining the products on and , we have
[TABLE]
where
[TABLE]
The evaluation of follows from the calculation of below.
Lemma 6.4**.**
Let be defined as Equation (5.35). Then
[TABLE]
Proof.
Write with and with . Let and in the above sum. Then
[TABLE]
By Lemma 3.7, becomes
[TABLE]
Note that there is no -integral above. After we expand the products and combine the -integrals together, the above equals
[TABLE]
where is defined analogously to but without the -coordinate. By changing the order of integrals, we see that
[TABLE]
The last integral is nonzero only when . In such a case, we shift the -integral to and obtain that the above equals
[TABLE]
We then interchange the order of integrals again and replace the -integral by . Thus equals
[TABLE]
which is the same as , finishing the lemma.
∎
6.3. Conclusion of the proof of Proposition 6.2
From Equation (4.8) and Lemma 6.3,
[TABLE]
Then from Equations (5.36), (6.10) and Lemma 6.4, we obtain that
[TABLE]
Thus by Equation (6.6), we derive at
[TABLE]
as desired.
7. Acknowledgement
This work was initially suggested by Brian Conrey during the Arithmetic Statistics MRC program at Snowbird. We would like to thank him for his guidance and provide us useful materials. Also we would also like to thank Xiannan Li for helpful editorial comments, and Sheng-Chi Liu and Maksym Raziwiłł for discussion during this project. Part of this work was done while the first author was in residence at the Mathematical Sciences Research Institute (MSRI) in Berkeley, California, during the Spring semester of year 2017, supported in part by the National Science Foundation (NSF) under Grant No. DMS-1440140. She also would like to acknowledge support from AMS-Simons Travel grant. The second author has been supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government(MSIP) (No. 2016R1C1B1008405). Lastly we are grateful to the anonymous referees, whose comments and suggestions were most helpful in improving the paper.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] V. Chandee and X. Li, The eighth moment of Dirichlet L 𝐿 L -functions , Adv. Math. 259 (2014), 339 - 375.
- 2[2] V. Chandee, S. Liu, Y. Lee and M. Radziwiłł, Simple zeros of primitive Dirichlet L 𝐿 L -functions and the asymptotic large sieve , Q. J. of Math. 65 (2014), 63–87.
- 3[3] B. Conrey, H. Iwaniec and K. Soundararajan, The sixth power moment of Dirichlet L 𝐿 L -functions , Geom. Funct. Anal. 22 :5 (2012), 1257 - 1288.
- 4[4] B. Conrey, H. Iwaniec and K. Soundararajan, Asymptotic large sieve , arxiv:1105.1176.
- 5[5] B. Conrey and N. Snaith, Correlations of eigenvalues and Riemann zeros , Commun. Number Theory Phys., 2 , (2008), no. 3, 477–536.
- 6[6] B. Conrey and N. Snaith, In support of n 𝑛 n -correlation , Commun. Math. Phys., 330 , (2014), 639–653.
- 7[7] H. Davenport, Multiplicative Number Theory, vol 74, Springer-Verlag (GTM), New York, 2000.
- 8[8] A. Entin, E. Roditty-Gershon and Z. Rudnick, Low-lying zeros of quadratic Dirichlet L 𝐿 L -functions, hyper-elliptic curves and random matrix theory , Geom. Funct. Anal. 23 (2013), no. 4, 1230–1261.
