
TL;DR
This paper investigates the distribution and variance of angles associated with Gaussian primes, extending classical results and proposing a conjecture supported by a function field analogue and random matrix models.
Contribution
It introduces a conjecture for the variance of angles of Gaussian primes in short arcs, supported by a proven analogue in function fields and connections to random matrix theory.
Findings
Angles are uniformly distributed as primes vary.
A conjecture for the variance in short arcs is proposed.
Asymptotic form of the variance is proved in the function field case.
Abstract
Fermat showed that every prime p = 1 mod 4 is a sum of two squares: . To any of the 8 possible representations (a,b) we associate an angle whose tangent is the ratio b/a. In 1919 Hecke showed that these angles are uniformly distributed as p varies, and in the 1950's Kubilius proved uniform distribution in somewhat short arcs. We study fine scale statistics of these angles, in particular the variance of the number of such angles in a short arc. We present a conjecture for this variance, motivated both by a random matrix model, and by a function field analogue of this problem, for which we prove an asymptotic form for the corresponding variance.
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.
Angles of Gaussian primes
Zeév Rudnick and Ezra Waxman
Raymond and Beverly Sackler School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel
[email protected], [email protected]
Abstract.
Fermat showed that every prime is a sum of two squares: . To any of the possible representations we associate an angle whose tangent is the ratio . In 1919 Hecke showed that these angles are uniformly distributed as varies, and in the 1950’s Kubilius proved uniform distribution in somewhat short arcs. We study fine scale statistics of these angles, in particular the variance of the number of such angles in a short arc. We present a conjecture for this variance, motivated both by a random matrix model, and by a function field analogue of this problem, for which we prove an asymptotic form for the corresponding variance.
Contents
1. Introduction
1.1. Angles of Gaussian primes
An odd prime is a sum of two squares if and only if , and in that case there are exactly representations. Each representation corresponds to a Gaussian integer . We wish to understand the statistics of the resulting angles.
It is useful to formulate the results in terms of prime ideals of the ring of Gaussian integers , which is the ring of integers of the imaginary quadratic field . The basic infra-structure that we need is complex conjugation , the norm map , , and the norm one elements
[TABLE]
For a Gaussian number , we have a direction vector given by
[TABLE]
so that , .
Let be a prime ideal in . If is generated by the Gaussian integer , we associate a direction vector . Since all generators of the ideal differ by multiplication by a unit , the direction vector is well-defined on ideals, while the angle is only defined modulo . We can choose to lie say in , corresponding to taking , with , .
Hecke [5] showed that as varies over prime ideals of , the angles become uniformly distributed in : For a fixed sector, defined by an interval ,
[TABLE]
where is the length of the interval .
The validity of (1.1) for shrinking sectors was studied by Kubilius and his school [11, 12, 10, 14, 15, 16], obtaining that (1.1) holds for any sector as long as for some . See also [4] for existence of prime angles in somewhat smaller sectors without the full force of (1.1). Assuming the Generalized Riemann Hypothesis (GRH), we know that (1.1) holds for intervals with . This regime is the limit of what can be expected to hold for individual sectors, because it is easy to see that there are no Gaussian integers (let alone primes) in the sector . Hence for smaller sectors we can only hope for a statistical theory, rather than individual results.
To formulate the theory, we introduce some notation: Given , let be the number of prime ideals of norm at most :
[TABLE]
where the asymptotic holds by the Prime Ideal Theorem for . Given an interval of length centered at , define a sector
[TABLE]
of radius and opening angle defined by .
Given , we divide the interval into disjoint arcs , , of equal length, which in turn define disjoint sectors , and study the number of prime angles falling into each such sector. If the sectors are too small, in the sense that the number of sectors is larger than the number of angles involved, then the typical such sector will not contain any Gaussian prime. We want to show that in the range , almost all sectors with opening angles of size contain at least one angle , . We can do so assuming GRH (for the family of Hecke L-functions):
Theorem 1.1**.**
Assume GRH. Then almost all arcs of length contain at least one angle for a prime ideal with .
Unconditionally, one may use zero-density theorems as in [16] to obtain a result with for some small .
It is surprising that something like Theorem 1.1 does not seem to have been considered long ago. It has come up independently in the recent work of Ori Parzanchevski and Peter Sarnak [17].
1.2. The number variance
One way to obtain such an “almost-everywhere” result is by computing the variance of a suitable counting function. The study of the structure of the variance is the main point of this paper.
Let
[TABLE]
be the number of angles in .
The expected number is
[TABLE]
We wish to study the number variance
[TABLE]
If , then for almost all intervals, we do not have any angles in the interval . We can easily compute the variance in this “trivial” regime:
[TABLE]
For the interesting range, when , we expect:
Conjecture 1.2**.**
For
[TABLE]
For random angles ( uniform independent points in ), the variance would be . Thus we expect the Gaussian angles to display a marked deviation from randomness, in that there is a crossover from purely random behaviour for very short intervals (), to a saturation for moderately short intervals (), where the variance is smaller than that of random angles, so one can say that they display some measure of rigidity. See Figure 1 for numerical evidence. For an explanation of the underlying rigidity present here and for other deviations from randomness, see §2.
A related saturation effect was previously observed by Bui, Keating and Smith [2], in the context of computing the variance of sums in short intervals of coefficients of a fixed L-function of higher degree.
One of our main goals is to justify Conjecture 1.2. In § 3 we define a suitably smoothed version of the counting function and express the corresponding variance in terms of zeros of a family of Hecke L-functions. This enables us, in § 4, to use GRH to give an upper bound for this variance and consequently deduce the almost-everywhere result of Theorem 1.1. Moreover, in § 5 we go on to develop a suitable random matrix theory model of this result, which gives a result corresponding to Conjecture 1.2. We now turn to formulating a similar problem in a function field setting, where we can prove an analogue of Conjecture 1.2.
1.3. A function field analogue
Let be a finite field of cardinality , from now on assumed to be odd. We want to write prime (irreducible monic) polynomials as
[TABLE]
with , which is equivalent to the constant term being a square in (see e.g. [1]). If additionally , then there are exactly four such representations, obtained from (1.3) by changing the signs of and . This decomposition gives a factorization in as
[TABLE]
and the corresponding factorization of the ideal into a pair of conjugate prime ideals of . The number of such prime polynomials of degree with satisfies
[TABLE]
by the Prime Polynomial Theorem in .
Denote by and consider the quadratic extension , which is still rational (genus zero). Let be the ring of formal power series. It is equipped with the Galois involution
[TABLE]
and the norm map
[TABLE]
We denote
[TABLE]
the formal power series with constant term and unit norm. This is a group, which is our analogue of the unit circle. It is important to note that since is odd, Hensel’s Lemma tells us that the square map is an automorphism of , and in particular each element of admits a unique square root .
We put an absolute value on , where . We then divide into “sectors”
[TABLE]
We denote by
[TABLE]
the elements of unit norm and constant term unity in \Big{(}\mathbb{F}_{q}[S]/(S^{k})\Big{)}^{\times}. The group parameterizes the different sectors. The order of is
[TABLE]
where
[TABLE]
We next want to define the notion of direction (essentially an angle) for any nonzero polynomial . To motivate the definition below, recall that for a nonzero complex number , we have . To any nonzero which is coprime to , we associate a norm-one element via the map
[TABLE]
Note that since , has constant term one, lies in , and has unit norm, that is , and hence exists and is unique. Moreover, for all scalars , so that if then only depends on the ideal generated by .
We want to count the number of prime ideals with , whose directions lie in a given sector. For , let
[TABLE]
The mean value is clearly
[TABLE]
For we can show (see Corollary 6.5) that as ,
[TABLE]
which gives an asymptotic result if . For larger values of , there are sectors which do not contain prime directions, as in the number field case, see Remark 6.6.
Our main result is the computation, in the large limit, of the number variance
[TABLE]
Theorem 1.3**.**
Assume that , or if that . Then as ,
[TABLE]
where if is even, and [math] otherwise.
To compare it to our number field conjecture, here the number of sectors is , the number of directions (the number of Gaussian prime ideals of degree ) is , so that the expected value is , and the variance satisfies, as ,
[TABLE]
Our conjecture 1.2 for the number-field variance is
[TABLE]
which is analogous to the above.
Acknowledgments We thank Steve Lester, for his help in the beginning of the project, and to Jon Keating, Corentin Perret-Gentil and Peter Sarnak for their comments.
The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC grant agreement n 320755.
2. Repulsion between angles
2.1. Repulsion and its consequences
Let be a nonzero ideal in . If is generated by the Gaussian integer , we associate a direction vector . Since all generators of the ideal differ by multiplication by a unit , the direction vector is well-defined on ideals, while the angle is only defined modulo . We can choose to lie say in , corresponding to taking , with , . If for non-zero , then .
Lemma 2.1**.**
i) If then
[TABLE]
*ii) If are ideals with distinct angles then *
[TABLE]
Proof.
i) Write with . Then
[TABLE]
Since we may assume that , we have which gives our claim.
ii) Write , , with and , . Consider the triangle having vertices at the origin, and . Since , its area is positive and being a lattice triangle, its area is at least .
On the other hand, its area is given in terms of the angle between the sides and as
[TABLE]
Thus we find
[TABLE]
and hence
[TABLE]
∎
Lemma 2.1 implies that the interval will contain no angles for , so that the number of prime angles in this interval is zero. Hence we cannot expect an asymptotic formula to hold for all intervals if , while it does hold (assuming GRH) for larger intervals. Theorem 1.1 guarantees that almost all intervals will contain angles if .
2.2. Deviations from randomness
The existence of a “big hole” as above displays a striking deviation from randomness of the angles, when compared to random angles in . For these, the maximal gap is almost surely of order , while Lemma 2.1(i) guarantees a much larger gap, of size .
Another statistic which indicates that Gaussian angles behave differently than random points is the minimal spacing statistic: For random angles in as above, the smallest gap is almost surely of size [13]. In contrast, the minimal gap between the angles is by Lemma 2.1
[TABLE]
which is much bigger than the random case.
2.3. The variance in the trivial regime
We want to study fluctuations in the number of angles falling in “random” short intervals. Take the interval length , equivalently the number of intervals, is much larger than the number of angles: . Then for almost all intervals, we do not have any angles in the interval . Nonetheless we can compute the variance in this “trivial” regime.
Proposition 2.2**.**
If then
[TABLE]
Proof.
We recall definition (1.2): Given an interval of length centered at , let111We abuse notation and use the same symbol for the interval and its indicator function.
[TABLE]
be the number of prime angles in . We will take the center of the interval to be random, that is uniform in .
We compute the second moment of using its definition
[TABLE]
where throughout we use
[TABLE]
The contribution of pairs of inert primes, where , , , , is
[TABLE]
Note that and
[TABLE]
Moreover, the number of , is . Hence the contribution of pairs of inert primes is O\Big{(}\frac{x}{K(\log x)^{2}}\Big{)}.
If and at least one of , is not inert, so that , then Lemma 2.1 gives
[TABLE]
For the integral to be nonzero, it is necessary that there be some so that both , which forces the distance between the two angles to be at most :
[TABLE]
Hence if then such off-diagonal pairs contribute nothing.
We conclude that the second moments of is essentially given by the sum of the diagonal terms
[TABLE]
We can now compute the variance:
[TABLE]
Since we find
[TABLE]
as claimed. ∎
3. Almost all sectors contain an angle
3.1. A smooth count
Our goal in this section is to prove Theorem 1.1, which claims (assuming GRH) that in the non-trivial range , almost all arcs of size contain at least one angle , . We can do so assuming GRH (for the family of Hecke L-functions).
To count the number of angles lying in a short segment of , pick a window function , which we take to be even and real valued, and for define
[TABLE]
which is -periodic, and localized on a scale of . The Fourier expansion of is
[TABLE]
where the Fourier transform is normalized as . Note that since is even and real valued, the same holds for .
Let . Now set
[TABLE]
the sum over all prime ideals of , which gives a smooth count of prime angles lying in a smooth window defined around . We also define
[TABLE]
the sum over all powers of prime ideals, with the von Mangoldt function if is a power of a prime ideal , and equal to zero otherwise.
We next compute the mean value.
Lemma 3.1**.**
The mean values of and are asymptotically
[TABLE]
Moreover,
[TABLE]
Proof.
The mean value is
[TABLE]
We can evaluate this using the Prime Ideal Theorem to obtain:
[TABLE]
and likewise for . If in addition we use GRH, we obtain a remainder term of for both.
We bound the difference by
[TABLE]
which shows that the mean values are close. ∎
Note that the inert primes give angle , but that so that in , we get a contribution of size if . This is significantly larger than the mean value if .
3.2. Variance in the trivial regime
The variance of in the trivial regime is:
[TABLE]
where
[TABLE]
Indeed, if then the same argument of repulsion between angles as in § 2.3 allows us to compute the second moment as asymptotically equal to the sum over the diagonal pairs
[TABLE]
By Parseval’s theorem, we have
[TABLE]
and
[TABLE]
by the Prime Ideal Theorem. This gives the second moment as
[TABLE]
and since , we obtain (3.3) for . The argument for is identical.
3.3. An upper bound
We give an upper bound on the variance of in the non-trivial regime , assuming GRH.
Theorem 3.2**.**
Assume GRH. Then
[TABLE]
From this bound we easily deduce Theorem 1.1: We use Chebyshev’s inequality and Theorem 3.2 to deduce
[TABLE]
Taking we find that for almost all ,
[TABLE]
is nonzero. Therefore the sum defining is non-empty, and since it is a sum over prime ideals giving angles in the arc of length around , we find that for almost all , such arcs contain an angle for a prime ideal with . ∎
The proof of Theorem 3.2 will be presented in § 4.4.
4. Relation to zeros of Hecke L-functions
4.1. Hecke characters and their L-functions
The Hecke characters , , give well defined functions on the ideals of . In terms of the angles associated to ideals, we have .
To each such character Hecke [5] associated its L-function
[TABLE]
Note that . Hecke showed that if , these functions have an analytic continuation to the entire complex plane, and satisfy a functional equation:
[TABLE]
The completed L-function has all its zeros in the critical strip (the non-trivial zeros of ), and the Generalized Riemann Hypothesis asserts that they all lie on the critical line . The growth of the number of nontrivial zeros of in a fixed rectangle is
[TABLE]
in other words, the density of zeros is .
Lemma 4.1**.**
[TABLE]
and
[TABLE]
Proof.
Inserting the Fourier expansion (3.1) of gives
[TABLE]
Now note that is the Hecke character, to obtain (4.4). The same argument gives (4.3). ∎
The zero mode in (4.4) is the mean value (3.2). The same holds for .
4.2. An Explicit Formula
Proposition 4.2**.**
Let , and
[TABLE]
be its Mellin transform. Then for and ,
[TABLE]
where the sum on the RHS is over all non-trivial zeros of .
Proof.
We abbreviate . Using Mellin inversion we obtain
[TABLE]
In terms of the completed L-function , the logarithmic derivative of is
[TABLE]
Inserting into the above gives
[TABLE]
We shift the contour in the integral to , picking up the poles of , which are all simple poles with residue at the non-trivial zeros of , giving
[TABLE]
Changing variables gives
[TABLE]
The functional equation (4.1) of implies
[TABLE]
which gives
[TABLE]
Returning to the incomplete L-function gives
[TABLE]
By Mellin inversion,
[TABLE]
which vanishes for as is compactly supported in . Likewise,
[TABLE]
since each term vanishes for (independently of , since ).
Collecting terms, we find
[TABLE]
as claimed. ∎
Lemma 4.3**.**
For ,
[TABLE]
Proof.
Note that the integrand is analytic in , so we may shift the contour of integration to . Let
[TABLE]
The integral is essentially times the Fourier transform , that is
[TABLE]
We can estimate the derivatives of by using Stirling’s formula and the rapid decay of as being bounded by
[TABLE]
Hence integration by parts shows that the Fourier transform of is bounded by
[TABLE]
which proves the Lemma. ∎
From Lemma 4.1, Proposition 4.2 and Lemma 4.3 we deduce:
Corollary 4.4**.**
Assume GRH. Then
[TABLE]
Averaging Corollary 4.4 over we find
Corollary 4.5**.**
Assume GRH. Then
[TABLE]
Corollary 4.6**.**
Assume GRH. Then
[TABLE]
Proof.
We use GRH to obtain so that
[TABLE]
We use a standard bound for the number of zeros of in an interval (see [6, Proposition 5.7]):
[TABLE]
Note that decays rapidly in vertical strips, say
[TABLE]
which together with (4.6) gives
[TABLE]
Inserting (4.7) into Corollary 4.5 gives
[TABLE]
as claimed. ∎
4.3. Primes vs prime powers
We pass from a sum over prime ideals to a sum over all prime powers:
Lemma 4.7**.**
Assume GRH. For such that ,
[TABLE]
Proof.
We denote
[TABLE]
and
[TABLE]
Assuming GRH, we have
[TABLE]
Indeed, from the Explicit Formula (Proposition 4.2), Lemma 4.3 and GRH we have
[TABLE]
on using the density of zeros of (4.2).
Next we crudely bound the contribution to of the higher prime powers , :
[TABLE]
Therefore we obtain a crude a priori bound on the contribution of primes:
[TABLE]
We now seek a more refined estimate. In the sum over all prime power, we separately treat the contributions of primes, of squares of primes, and of higher powers:
[TABLE]
where
[TABLE]
and
[TABLE]
By definition,
[TABLE]
where . Therefore inputting the a priori bound (4.8) (which uses GRH to get cancellation) gives
[TABLE]
For the contribution of higher powers, we use
[TABLE]
Thus we obtain
[TABLE]
which gives us the result since . ∎
Lemma 4.8**.**
Assume GRH. Then
[TABLE]
Proof.
We use Lemma 4.1 to write
[TABLE]
The term is the difference between mean values, which by Lemma 3.1 is . Hence
[TABLE]
say. Hence it suffices to show that .
We have
[TABLE]
By Lemma 4.7, the sum over non prime is (assuming ), and therefore
[TABLE]
as desired. ∎
4.4. Proof of Theorem 3.2
We want to show that
[TABLE]
where
[TABLE]
is the standard norm on .
Using the triangle inequality, we have
[TABLE]
By Lemma 4.8
[TABLE]
by Corollary 4.6,
[TABLE]
and by Lemma 3.1, the mean values are close:
[TABLE]
Thus we obtain
[TABLE]
hence
[TABLE]
which proves Theorem 3.2. ∎
5. A random matrix theory model
In this section we present a conjecture for the variance of the smooth count :
Conjecture 5.1**.**
[TABLE]
where
[TABLE]
Note that Conjecture 5.1 coincides with our result (3.3) in the trivial regime range .
To recover Conjecture 1.2 from Conjecture 5.1, we can (at a heuristic level) pass to an actual count with sharp cutoffs: Take and , and replace the weight by throughout, and ignore the contribution of higher powers of primes.
We use Corollary 4.5 with for , and note that since is even, and , we can pass to a sum over positive ’s, to obtain
[TABLE]
the inner sums over all non-trivial zeros of ; we have ignored the remainder term in Corollary 4.5 as it can be seen to be by using (4.7).
Let
[TABLE]
and
[TABLE]
Since the density of zeros of is about , the sum in is over zeros.
Conjecture 5.1 is clearly implied by
Conjecture 5.2**.**
Fix . Then as ,
[TABLE]
5.1. The model
We model the sum by replacing the zeros of by the eigenvalues of a fictitious (diagonal) unitary matrix
[TABLE]
We may want to require that be symplectic222or orthogonal, in which case is even and the eigenphases will come in conjugate pairs , .
We choose so that the density of angles, namely , matches the density of zeros of by requiring
[TABLE]
We replace by a periodic function , to get a linear statistic
[TABLE]
Expanding in a Fourier series we obtain
[TABLE]
We obtain the following model for the sum (5.3):
[TABLE]
where the unitary matrices are picked uniformly and independently from a certain subgroup of unitary matrices, , say is the full unitary group, or the symplectic group (possible only when is even).
We now replace the discrete average by the continuous average with respect to the Haar probability measure on , with chosen so that the two averages coincide when the test function is constant, that is
[TABLE]
(recalling that is even and real valued). Therefore we model (5.3) by the matrix integral
[TABLE]
where grows linearly with the matrix size , precisely so that under the correspondence (5.4) and (5.2), is assumed to be an integer.
We claim that for all the classical groups ( U, USp, O) under these conditions the answer is
Proposition 5.3**.**
For , , , and , as
[TABLE]
Therefore we are led to conjecture 5.2, once we understand the analogue of : Recall that corresponded to , which we can write in terms of as
[TABLE]
Hence corresponds to
[TABLE]
Thus we obtain Conjecture 5.2
[TABLE]
5.2. Proof of Proposition 5.3
Proof.
We use the Fourier expansion (5.5) to obtain
[TABLE]
We trivially have , and since and is rapidly decreasing, only the terms with say contribute anything non-negligible. Thus
[TABLE]
The unitary case :
We use Dyson’s lemma [3]
[TABLE]
In particular only the diagonal terms contribute. In our case, are nonzero, hence we get
[TABLE]
Since varies very little around , we can replace by with negligible error to obtain
[TABLE]
by Plancherel.
The symplectic case :
The expected values for the symplectic group () are [8, Lemma 2]
i) If then
[TABLE]
ii) If
[TABLE]
and in particular, if (and neither is zero) then
[TABLE]
while for we obtain
[TABLE]
so that
[TABLE]
The second term is , while the first is as in the unitary case, so that again we recover
[TABLE]
For the orthogonal group with even, we have the same result because (5.7), (5.8) are still valid (see [8, Lemma 2]). ∎
6. A function field model
6.1. The group of sectors
Our goal in this section is to formulate and prove an analogue of Conjecture 1.2 and of Conjecture 5.1 in the setting of the ring of polynomials over a finite field of elements ( odd), in the limit of large . Using the notation in the Introduction, we denote by333Katz [7, §2] denotes , and .
[TABLE]
the elements of unit norm and constant term in \Big{(}\mathbb{F}_{q}[S]/(S^{k})\Big{)}^{\times}, and
[TABLE]
the subgroup of even polynomials.
Lemma 6.1**.**
[7, Lemma 2.1]** i) We have a direct product decomposition
[TABLE]
ii) The order of is
[TABLE]
where , so that
[TABLE]
Proof.
i) is stated in [7] for even, but the proof is valid for arbitrary .
ii) The order of is
[TABLE]
since we can write any element of as
[TABLE]
and the number of such elements is clearly . Since the order of \Big{(}\mathbb{F}_{q}[S]/(S^{k})\Big{)}^{\times} is , we obtain that the order of is
[TABLE]
as claimed. ∎
We put an absolute value on , where . We then divide into “sectors”
[TABLE]
so that by definition, for
[TABLE]
Consequently, the sectors are in bijection with the group , and their number is
[TABLE]
Expanding in :
[TABLE]
and likewise for , we see that is equivalent to
[TABLE]
We have a modular version of the homomorphism from (1.4)
[TABLE]
whose kernel is . Note that as it has unit norm and constant term , and in the square root is well defined since has odd order.
Lemma 6.2**.**
The homomorphism U_{k}:\Big{(}\mathbb{F}_{q}[S]/(S^{k})\Big{)}^{\times}\to\mathbb{S}^{1}_{k} is surjective.
Proof.
The kernel of U_{k}:\Big{(}\mathbb{F}_{q}[S]/(S^{k})\Big{)}^{\times}\to\mathbb{S}^{1}_{k} is because the kernel of is, by definition, , and the square root map is an automorphism of . According to Lemma 6.1(i), the map is therefore onto. ∎
6.2. Super-even characters and their L-functions
A super-even character modulo is a Dirichlet character
[TABLE]
which is trivial on . In particular, is even (trivial on the scalars ). These are the analogues of Hecke characters in § 4.1. The group of super-even characters mod is the character group of \Big{(}\mathbb{F}_{q}[S]/(S^{k})\Big{)}^{\times}/H_{k}\simeq\mathbb{S}^{1}_{k}. Hence by general orthogonality relations for characters of a finite Abelian group, the super-even characters separate the cosets of , that is the elements of .
Proposition 6.3**.**
For f\in\Big{(}\mathbb{F}_{q}[S]/(S^{k})\Big{)}^{\times}, and , the following are equivalent:
- (i)
** 2. (ii)
** 3. (iii)
4. (iv)
* for all super-even characters mod .*
Proof.
For we have and so combining with (6.1) we find that is equivalent to .
According to Lemma 6.2, the map is onto. Therefore, since the kernel of is , we obtain that is equivalent to in \Big{(}\mathbb{F}_{q}[S]/(S^{k})\Big{)}^{\times}.
Using the orthogonality relations for characters of (super-even characters) we obtain the final equivalence. ∎
The Swan conductor of an even nontrivial character mod is the maximal integer such that is nontrivial on the subgroup
[TABLE]
Then is a primitive character modulo . For a super-even character, the Swan conductor is necessarily odd, since super-even characters are automatically trivial on for even.
Let be a nontrivial even character modulo . The L-function associated to is:
[TABLE]
which for nontrivial even is a polynomial in of degree exactly (the Swan conductor of ), including a trivial zero at . Thus we write for any non-trivial super-even character
[TABLE]
for a unitary matrix ().
For any nontrivial super-even character mod , let
[TABLE]
be the sum over all monic polynomials of degree , with being the von Mangoldt function. The Explicit Formula (obtained by comparing the logarithmic derivative of (6.2) and (6.3), see e.g. [9]) shows that for nontrivial super-even , the sum over prime powers is a sum over zeros of the L-function associated to :
[TABLE]
6.3. A weighted count
We introduce a weighted count in terms of the von Mangoldt function on , defined as if for some prime and and scalar , and otherwise. Set
[TABLE]
the sum over monic with and .
We want to average over all directions . The mean value is
[TABLE]
By definition, the sum is just the sum over all monic (with ), that is
[TABLE]
by the Prime Polynomial Theorem in .
We use Proposition 6.3 to pick out prime powers lying in a given sector, and obtain a formula for the sum in terms of super-even characters.
Lemma 6.4**.**
[TABLE]
the sum being over all nontrivial super-even characters mod .
Proof.
From Proposition 6.3 and the orthogonality relations we find
[TABLE]
which gives
[TABLE]
with the sum over all monic of degree . Hence
[TABLE]
The contribution of the trivial character is
[TABLE]
Inserting the Explicit Formula (6.4) gives
[TABLE]
on using the orthogonality relations in the form
[TABLE]
∎
We use for to obtain
Corollary 6.5**.**
As ,
[TABLE]
Hence for , we obtain an asymptotic formula.
By a standard argument, this implies that .
Remark 6.6*.*
Note that for , it is no longer necessarily the case that , in fact there may not be any polynomials of degree with direction . As an example, assume that is odd, and take
[TABLE]
and suppose that satisfies
[TABLE]
By Proposition 6.3, this is equivalent to . Reducing modulo gives , so that . But hence , that is is an even polynomial, hence . But then , a contradiction.
6.4. The variance of
The variance of is
[TABLE]
Theorem 6.7**.**
Assume is odd, and , or that and additionally . Then as ,
[TABLE]
In other words, if we denote the number of all monics of degree , then
[TABLE]
This is to be compared with conjecture 5.1. Note that the range is the “trivial regime”, where there are more sectors than directions; in that case the result is elementary, but of little interest.
Lemma 6.8**.**
[TABLE]
the sum over all nontrivial super-even characters mod .
Proof.
Inserting (6.5) we find
[TABLE]
We use the orthogonality relations in the group of super-even characters, which is the character group of :
[TABLE]
This gives
[TABLE]
Set . From Lemma 6.4 we obtain, on denoting by the average over all , that
[TABLE]
Using the orthogonality relations, the averages over are
[TABLE]
since , and
[TABLE]
Substituting into our formula gives
[TABLE]
Finally we use for to get our claim. ∎
Hence we get an inequality (for all and )
Corollary 6.9**.**
[TABLE]
This is analogous to Theorem 3.2. To do better, we invoke an equidistribution result for the zeros of these L-functions.
6.5. Proof of Theorem 6.7
We use Lemma 6.8. We separate the characters according to their Swan conductor, which is necessarily an odd integer , whose maximal value is (recall or ). Characters with such maximal conductor make up all primitive super-even characters modulo . As in [9], the contribution of characters with smaller Swan conductor is negligible, and up to lower order terms one finds
[TABLE]
the average over all primitive super-even characters modulo .
Katz [7, Theorem 5.1] showed that for any sequence of odd444In [7, Theorem 5.1] is allowed to be even for . , the Frobenii
[TABLE]
become uniformly distributed in the unitary symplectic group provided , and that the same holds for if the are co-prime to (i.e. the characteristic of is not or ). Katz’s equidistribution theorem allows us to replace the average over primitive super-even characters in (6.6) by the corresponding continuous average over the unitary symplectic group , to get
[TABLE]
The matrix integral equals, for [8, Lemma 2],
[TABLE]
where for even, and equals [math] for odd. This proves Theorem 6.7.
6.6. Relation between variance of and
We can now proceed to prove Theorem 1.3, which follows from Theorem 6.7 once we establish the following relation between the variance of and of :
Proposition 6.10**.**
Under the conditions of Theorem 6.7,
[TABLE]
as .
Let be the indicator function of the sector . We write
[TABLE]
with the sums over monic polynomials, where
[TABLE]
We subtract the expected value of , which is
[TABLE]
where we write for the average over all sectors . Compare this with the expected value of , which is
[TABLE]
by the Prime Polynomial Theorem. Therefore
[TABLE]
We claim that the mean square of is bounded by
Lemma 6.11**.**
[TABLE]
This bound is certainly negligible compared to the variance of , which by Theorem 6.7 is of order . Using (6.7) gives
[TABLE]
and we obtain
[TABLE]
Hence by Theorem 6.7
[TABLE]
as .
6.7. Proof of Lemma 6.11
To prove Lemma 6.11 we write
[TABLE]
We compute
[TABLE]
By Proposition 6.3, the condition is equivalent to for all super-even characters modulo , that is
[TABLE]
Therefore
[TABLE]
where
[TABLE]
We will show below that if , then
[TABLE]
and if , then
[TABLE]
Assuming (6.9) and (6.10), we use the expansion (6.8) for , and insert the bounds (6.9) for , and (6.10) for to obtain
[TABLE]
proving Lemma 6.11.
It remains to prove (6.9) and (6.10). We set
[TABLE]
so that
[TABLE]
The trivial bound for is
[TABLE]
This gives (6.9), because
[TABLE]
since the largest divisor which is smaller than is not larger than .
If then we have a better bound:
[TABLE]
Indeed, write , and then use the trivial bound (6.9): and (6.4): , to obtain (6.12).
Next, we use the expansion (6.11) of to write
[TABLE]
To bound the contribution of divisors with , note that the order of divides , so that if but then necessarily , where with an odd prime (since is odd). Hence using the trivial bound gives
[TABLE]
Now if , then so , and we obtain
[TABLE]
We bound the contribution of divisors with , using (6.12), by
[TABLE]
again using that the largest divisor which is smaller than is not larger than . Thus we find that for ,
[TABLE]
which proves (6.10) since .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] L. Bary-Soroker, Y. Smilansky, A. Wolf, On the Function Field Analogue of Landau’s Theorem on Sums of Squares , Finite Fields Appl. 39 (2016) 195–215.
- 2[2] H. M Bui, J. P. Keating and D. J. Smith, On the variance of sums of arithmetic functions over primes in short intervals and pair correlation for L-functions in the Selberg class . J. Lond. Math. Soc. (2) 94 (2016), no. 1, 161–185.
- 3[3] F.J. Dyson, Statistical theory of the energy levels of complex systems , I, II and III. J. Math. Phys. 3, 140–175 (1962).
- 4[4] G. Harman and P. A. Lewis, Gaussian primes in narrow sectors , Mathematika 48 (2001), no. 1-2, 119–135 (2003).
- 5[5] E. Hecke, Eine neue Art von Zetafunktionen und ihre Beziehungen zur Verteilung der Primzahlen . I. , Math. Z. 1 (1918), 357-376. II, Math. Z. 6 (1920), 11–51
- 6[6] H. Iwaniec and E. Kowalski, Analytic number theory. American Mathematical Society Colloquium Publications, 53. American Mathematical Society, Providence, RI, 2004.
- 7[7] N. M. Katz, Witt Vectors and a Question of Rudnick and Waxman . Int. Math. Res. Not. IMRN, Vol. 2016, No. 00, pp. 1–36 doi: 10.1093/imrn/rnw 130
- 8[8] J.P. Keating and B.E. Odgers, Symmetry transitions in random matrix theory & \& L-functions . Comm. Math. Phys. 281 (2008), no. 2, 499–528.
