Bilinear forms in Weyl sums for modular square roots and applications
Introduction
Our motivation begins in the early 20th century. This is when I. M. Vinogradov initiated the study of the distribution of both quadratic residues and non-residues modulo a prime q. This remains a central theme in classical analytic number theory.
Several fundamental conjectures are still unresolved. Vinogradov's least quadratic non-residue conjecture asserts that where denotes the least non-quadratic residue modulo q ( is necessarily prime). The best unconditional bounds known are largely due to Burgess' bounds for character sums [11] and ideas of Vinogradov.
It is also natural to consider the least prime quadratic residue modulo q. The best unconditional result is due to Linnik and Vinogradov [53], where they showed Much of the above discussion can be generalised to prime residues and non-residues of an arbitrary Dirichlet character χ of order k. One can see the work of Norton [43] for the analogue of (1.1) and of Elliot [21] for the analogue of (1.2).
Given the existence of a small prime quadratic residue and non-residue, the next natural question to ask is how many such quadratic residues and non-residues exist in a given interval . Making use of reciprocity relations and the sieve, Benli and Pollack [4] have results in this direction for quadratic, cubic and biquadratic residues. For general Dirichlet characters one can see work of Pollack [44] and also a more recent work of Benli [3]. The impact and links of results of this type stretch far beyond analytic number theory. For example, Bourgain and Lindenstrauss [10, Theorem 5.1] are motivated by links with the Arithmetic Quantum Unique Ergodicity Conjecture. They have shown that for any , there exists some , such that for any sufficiently large D, the set satisfies When one relaxes the condition that a non-residue be prime, one does much better, as in the case of Banks, Garaev, Heath-Brown and Shparlinski [1], who show that for each and , the proportion of quadratic non-residues modulo q in the interval is bounded away from 0 when q is large enough.
Furthermore, if is a large prime, then quadratic reciprocity tells us that the following two Legendre symbols are equal: . Thus counting quadratic residues modulo q is equivalent to counting small rational primes that split in the imaginary quadratic field . In particular, throughout this paper, defined via the Jacobi symbol, always denotes the character attached to F, and denotes the Dirichlet L-function attached to χ. Let denote the number of rational primes that split in F.
A good reference point for the strength of our results is what the Generalised Riemann Hypothesis (GRH) implies. It is well known that under the GRH for that we have for for some absolute constants , see, for example, [42, Section 13.1, Excercise 5(a)].
Furthermore, a result of Heath-Brown [33, Theorem 1] immediately implies the following. For any fixed , for all but primes , we have for , as .
The second theme which we develop in this paper concerns bounds of certain bilinear sums closely related to correlations between values of Salié sums see [45]. We emphasise that this is closely related to recent work of the first and fourth authors [19], who have computed a second moment for L-functions attached to a half-integral weight Kohnen newform, averaged over all primitive characters modulo a prime. Power savings in the error term for such a moment come in part from savings in the bound on correlations between Salié sums (1.3). Our argument gives a direct improvement of [19, Theorem 1.2], see Appendix C. It remains to investigate whether this improvement propagates into a quantitative improvement in the error term of [19, Theorem 1.1] for the second moment of the above L-functions.
Let be two positive real numbers and and be complex weights supported on dyadic intervals and , where indicates . Let be some function, usually called a kernel. A bilinear form involving K is a sum of the shape Bounds of such sums also have key automorphic and arithmetic applications.
In a series of two recent breakthrough papers using deep algebro–geometric techniques, Kowalski, Michel and Sawin [37], [38] have established non-trivial estimates for bilinear forms with Kloosterman sums in [37] and generalised Kloosterman sums in [38]. In particular, their estimates apply below the Pólya–Vinogradov range, that is, when the ranges of summation are ; this is where completion and Fourier theoretic methods breakdown. Such bounds are a crucial ingredient to the evaluation of asymptotic moments of L-functions over primitive Dirichlet characters, with power saving error (as well as many more automorphic applications), see [7], [37], [38], [55] and references therein.
It is important to note that the bilinear sums we study here do not fall under the umbrella of the results of [38]. The initial approach of [38] (Vinogradov's ab shifting trick and the Riemann Hypothesis for algebraic curves over a finite field) can be used. However, our approach leads to a much stronger result, for comparison see Appendix B. For an alternative treatment of bilinear forms in classical Kloosterman sums using the sum-product phenomenon, see [47].
The above two themes:
- •
lower bounds on the number of prime quadratic residues and non-residues;
- •
bounds of bilinear sums with modular square roots;
We remark that it is natural to attempt to improve the error term on the average square of some L-functions from [19]. This however requires substantial effort with optimisation and balancing a number of estimates and so falls outside of the scope of this paper.
We are now ready to state some of the results in this paper. A high level sketch of the ideas and methodology in the proofs is deferred to Section 2.
Our first result is an unconditional lower bound for , but with ineffective constant. Theorem 1.1 For any fixed , any sufficiently large prime q, and any P with , we have where depends only on ε.
Remark 1.2 As with the results on quadratic residues of Benli and Pollack [3], [4], [44], Siegel's theorem is used in the proof of Theorem 1.1, and so the constant is ineffective.
Observe that for small and fixed [44, Theorem 1.3] guarantees that for some constant that depends only on ε and A. Theorem 1.1 above improves this to a small power of q, that is, This was also proved independently by Benli [3] (taken with ) very recently. Theorem 1.1 also substantially improves the lower bound established by Benli and Pollack [4, Theorem 3] and in particular, implies for any , provided that q is large enough.
Our next result is an unconditional bound for , with effective constant. Theorem 1.3 Suppose is prime with . Then
Since we see from Theorem 1.3 that there is an effectively computable absolute constant such that for we have In fact one can get a better constant by estimating certain quantities more carefully.
Remark 1.4 Unfortunately the argument of the proof of Theorem 1.3 does not scale to estimate with . However it actually increases its strength for , which is still a meaningful range in the problem of estimating . We do not consider this case as small values of P are of our principal interest.
Many famous unsolved conjectures are known to hold under the assumption of a Siegel zero [26]. This is because one can sometimes break the parity problem of the sieve with this hypothesis. A notable example is Heath-Brown's proof [32] of the twin prime conjecture assuming Siegel zeros. Continuing this tradition, we prove an essentially sharp lower bound for under the assumption that has a mild Siegel zero.
Theorem 1.5 Suppose is a large prime and Then for any fixed and P with , we have where is the class number of and depends only on ε.
Remark 1.6 The constant in Theorem 1.5 is ineffective.
Counting small split primes in general number fields is a notoriously difficult and fundamental problem. Ellenberg and Venkatesh [20] have established a direct connection between counts for small split primes and bounds for ℓ-torsion in general class groups.
We also refer to [28], [29], [30] for results and references on lower bounds on class numbers of imaginary quadratic fields.
We recall that means . Given two real numbers and complex weights we denote and similarly for β.
For we consider bilinear forms in Weyl sums for square roots We notice that this is equivalent to studying bilinear forms with Salié sums, given by (1.3), thanks to the evaluation in [45], see also [35, Lemma 12.4] and [46, Lemma 4.4]: where if and if (note that if , the Salié sum vanishes). The tuple of characters is Kummer induced (cf. [38, Section 2]), and so the results of [38] do not apply to (1.6).
Our goal is to improve the trivial bound in the Pólya–Vinogradov range. In arithmetic applications the case when weights satisfy is most important. However, our bounds are valid for more general weights. Making use of weighted additive energies, and some ideas from [9] and [12], we prove the following result.
Theorem 1.7 For any positive integers and any weights α and β as in (1.5), we have and
When the weights α and β satisfy (1.8), we can re-write the bounds of Theorem 1.7 in the following simplified form and Power savings in the error term of an asymptotic formula for a second moment of certain L-functions [19] comes from savings in the bound on in the Pólya–Vinogradov range, as well as other ranges in which spectral techniques are used. Additional ideas are also needed in [19] to make the asymptotic formula unconditional, because and are coefficients of a fixed normalised Kohnen newform. It is not known yet that they satisfy (1.8) (in this context, the condition (1.8) is the Ramanujan–Petersson conjecture, also equivalent to the Lindelöf hypothesis for the twisted L-function attached to the Shimura lift). The best known bound is due to Conrey and Iwaniec [13].
We now outline the arithmetic applications of Theorem 1.7.
We recall that the discrepancy of a sequence in is defined as where denotes the cardinality of (if it is finite), see [15], [39] for background. For positive integers P and R, denote the discrepancy of the sequence (multiset) of points by . Combining the bound (1.9) with the classical Erdős–Turán inequality, see Lemma 3.1 below, we derive an equidistribution of the modular square roots of products of two primes.
Corollary 1.8 For we have
Our next application is to a relaxed version of the still open problem of Erdős, Odlyzko and Sárközy [22] on the representation of all reduced classes modulo an integer m as the products pr of two primes . This question has turned out to be too hard even for the Generalised Riemann Hypothesis, thus various relaxations have been considered, see [48] for a short overview of currently available results in this direction.
Here we obtain the following variant about products of two small primes and a small square. To simplify the result we assume that . In this case, using the bound (1.10) one easily derives similarly to Corollary 1.8 the following result.
Corollary 1.9 Let be real numbers such that the interval contains of both prime quadratic residues and non-residues. If is a real number such that then any reduced residue class modulo q can be represented as for two primes , with some real and a positive integer .
In particular, if then the result of Corollary 1.9 is nontrivial if , while for we need .
For a positive integer P we denote the discrepancy of the sequence (multiset) of points by .
Theorem 1.7 in combination with the classical Erdös–Turán inequality (see Lemma 3.1) and the Heath-Brown identity [31] yield the following result on the equidistribution of square roots of primes. Since we are mostly interested in the values of P which are as small as possible, we use only the first bound of Theorem 1.7. For large values of P one can get a better result but using the second bound as well or both, see also Remark 7.1 below.
Theorem 1.10 For any we have
If the interval contains prime quadratic residues, which is certainly expected and is known under the GRH, see Sections 1.1 and 1.2, then Theorem 1.10 is nontrivial for with some fixed .
We also point out that the equidistribution here is the opposite situation considered in [17], [18], [34], [41], [50], where the modulus is prime and varies.
Section snippets
High level sketch of the methods
Here we outline the main ideas and methods behind the proofs in this paper, without paying too much attention to technical detail. Let . The starting point in Theorem 1.1 is a certain linear combination of logarithms that biases split primes. In particular, consider where , and is the number of representations of n by a complete set of inequivalent positive definite quadratic forms of discriminant −q.
The behaviour of the character
Notation
Throughout the paper, the notation , and are equivalent to for some positive constant c, which throughout the paper may depend on a small real positive parameter ε.
For any quantity we write (as ) to indicate a function of V which satisfies for any , provided V is large enough.
For a real we write to indicate that a is in the dyadic interval .
For , and we denote We also use to denote the
Preparations
Here we recall an asymptotic formula due to Pollack [44, Proposition 3.1] that builds on some work of Linnik and Vinogradov [53, Theorem 2]. It is used extensively in the proofs of Theorem 1.1, Theorem 1.5. Recalling that , let
Lemma 4.1 For each , there is a constant for which the following holds: if , then the sum where the implied constant depends only on ε.
Thus by Lemma 4.1 and [35, Equations (22.14) and (22.22)] we have
Values of quadratic forms free of small prime divisors
Suppose is a binary quadratic form with discriminant we refer to [35, Section 22.1] for a general background. Suppose the form is reduced, that is, This implies that . Hence
Let be any number such that . For each consider We still have Thus the reduction of modulo each odd prime p is non-zero. Only could be a
Geometry of numbers and congruences
The following is Minkowski's second theorem, for a proof see [49, Theorem 3.30].
Lemma 6.1 Suppose is a lattice of determinant , a symmetric convex body of volume and let denote the successive minima of Γ with respect to . Then we have
A proof of the following is given in [6, Proposition 2.1].
Lemma 6.2 Suppose is a lattice, a symmetric convex body and let denote the successive minima of Γ with respect to . Then we have
Using
Preliminary transformations
For , let be the set of primes , , such that p is a quadratic residue modulo q. To study the discrepancy of the roots of these quadratic congruences, we introduce the exponential sum (where the term accounts for which has possibly been added to the sum). We see that Lemma 3.1 reduces the discrepancy question to estimating the sums .
In fact, following the standard principle, we also introduce the sums
Acknowledgment
The authors thank the anonymous referee for their meticulous comments on the manuscript. The authors are also very grateful to Bruce Berndt, Moubariz Garaev, Paul Pollack, George Shakan and Asif Zaman for their comments on a preliminary version of the manuscript. The authors also thank Paul Pollack for the information about the work of Benli [3].
The work of A.D. was supported on a UIUC Campus Research Board Grant RB18121. The work of B.K. was supported by the Academy of Finland Grant 319180.
References (57)
- et al.
Elliptic curves and lower bounds for class numbers
J. Number Theory
(2020) On the discrepancy of uniformly distributed roots of quadratic congruences
J. Number Theory
(2008)- et al.
Density of non-residues in burgess-type intervals and applications
Bull. Lond. Math. Soc.
(2008) - et al.
Congruences with intervals and arbitrary sets
Arch. Math.
(2020) Small prime kth power residues
Proc. Am. Math. Soc.
(2020)- et al.
Small prime kth power residues for : a reciprocity laws approach
Proc. Am. Math. Soc.
(2019) - et al.
Gauss and Jacobi Sums
(1998) - et al.
Successive-minima-type inequalities
Discrete Comput. Geom.
(1993) - et al.
On moments of twisted L-functions
Am. J. Math.
(2017) On exponential sums in finite fields
Am. J. Math.
(1966)
On congruences with products of variables from short intervals and applications
Proc. Steklov Inst. Math.
Entropy of quantum limits
Commun. Math. Phys.
The distribution of quadratic residues and non-residues
Mathematika
Points on curves in small boxes and applications
Mich. Math. J.
The cubic moment of central values of automorphic L-functions
Ann. Math.
Multiplicative Number Theory
Sequences, Discrepancies and Applications
Hyperbolic distribution problems and half-integral weight Maass forms
Invent. Math.
Equidistribution of roots of a quadratic congruence to prime moduli
Ann. Math.
Weyl sums for quadratic roots
Int. Math. Res. Not.
The twisted second moment of modular half integral weight L-functions
Reflection principles and bounds for class group torsion
Int. Math. Res. Not.
The least prime k-th-power residue
J. Lond. Math. Soc.
On the residues of products of prime numbers
Period. Math. Hung.
Über die Ausnahmenullstelle der Heckeschen L-Funktionen
Acta Arith.
Sur le probléme des diviseurs de Titchmarsh
J. Reine Angew. Math.
Algebraic trace functions over the primes
Duke Math. J.
What is … the parity phenomenon?
Not. Am. Math. Soc.
Cited by (17)
Energy bounds, bilinear forms and their applications in function fields
2022, Finite Fields and their ApplicationsENERGY BOUNDS FOR MODULAR ROOTS AND THEIR APPLICATIONS
2024, Journal of the Institute of Mathematics of JussieuOn the distribution of modular square roots of primes
2024, Mathematische ZeitschriftProducts of primes in arithmetic progressions
2024, Journal fur die Reine und Angewandte MathematikRECONSTRUCTING POINTS OF SUPERELLIPTIC CURVES OVER A PRIME FINITE FIELD
2024, Advances in Mathematics of CommunicationsBounds on bilinear forms with Kloosterman sums
2023, Journal of the London Mathematical Society