Elsevier

Advances in Mathematics

Volume 375, 2 December 2020, 107369
Advances in Mathematics

Bilinear forms in Weyl sums for modular square roots and applications

Dedicated to Bruce Berndt and his penchant for Gauss sums, on the occasion of his 80th birthday
https://doi.org/10.1016/j.aim.2020.107369Get rights and content

Abstract

Let q be a prime, P1 and let Nq(P) denote the number of rational primes pP that split in the imaginary quadratic field Q(q). The first part of this paper establishes various unconditional and conditional (under existence of a Siegel zero) lower bounds for Nq(P) in the range q1/4+εPq, for any fixed ε>0. This improves upon what is implied by work of Pollack and Benli–Pollack.

The second part of this paper is dedicated to proving an estimate for a bilinear form involving Weyl sums for modular square roots (equivalently Salié sums). Our estimate has a power saving in the so-called Pólya–Vinogradov range, and our methods involve studying an additive energy coming from quadratic residues in Fq.

This bilinear form is inspired by the recent automorphic motivation: the second moment for twisted L-functions attached to Kohnen newforms has recently been computed by the first and fourth authors. So the third part of this paper links the above two directions together and outlines the arithmetic applications of this bilinear form. These include the equidistribution of quadratic roots of primes, products of primes, and relaxations of a conjecture of Erdős–Odlyzko–Sárközy.

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 thatnqqo(1), where nq denotes the least non-quadratic residue modulo q (nq is necessarily prime). The best unconditional bounds known arenqq1/(4e)+o(1), largely due to Burgess' bounds for character sums [11] and ideas of Vinogradov.

It is also natural to consider the least prime quadratic residue rq modulo q. The best unconditional result is due to Linnik and Vinogradov [53], where they showedrqq1/4+o(1). 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 [2,P]. 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 ε>0, there exists some δ>0, such that for any sufficiently large D, the setR:={pprime:DδpD1/4+ε,(Dp)=1} satisfiespR1p12ε. 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 ε>0 and Nq1/4e+ε, the proportion of quadratic non-residues modulo q in the interval [1,N] is bounded away from 0 when q is large enough.

Furthermore, if q3(mod4) is a large prime, then quadratic reciprocity tells us that the following two Legendre symbols are equal: (q/p)=(p/q). Thus counting quadratic residues modulo q is equivalent to counting small rational primes pP that split in the imaginary quadratic field F:=Q(q). In particular, throughout this paper,χ():=(q) defined via the Jacobi symbol, always denotes the character attached to F, and L(s,χ) denotes the Dirichlet L-function attached to χ. Let Nq(P) denote the number of rational primes pP 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 L(s,χ) that we have Nq(P)c1P/logP for Pc2(logq)2 for some absolute constants c1,c2>0, 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 ε>0, for all but o(Q/logQ) primes q[Q,2Q], we have Nq(P)=(1/2+o(1))P/logP for Pqε, as Q.

The second theme which we develop in this paper concerns bounds of certain bilinear sums closely related to correlations between values of Salié sumsS(m,n;q)=xFq(xq)eq(mx+nx), 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 M,N be two positive real numbers and α=(αm)mM and β=(βn)nN be complex weights supported on dyadic intervals mM and nN, where aA indicates a[A,2A). Let K:FqC be some function, usually called a kernel. A bilinear form involving K is a sum of the shapemMnNαmαnK(mn). 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 M,Nq1/2; this is where completion and Fourier theoretic methods breakdown. Such bounds are a crucial ingredient to the evaluation of asymptotic moments of GL2(AQ) 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;

come together in the third direction which we pursue here: the distribution of square roots modulo q of primes pP. Indeed, in the asymptotic formula we obtain, the main term is controlled by the counting function of prime quadratic residues, while the error term is given by the discrepancy, and depends on the quality of our bounds for certain bilinear sums we estimate in this paper.

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 Nq(P), but with ineffective constant.

Theorem 1.1

For any fixed ε>0, any sufficiently large prime q, and any P with qPq1/4+ε, we haveNq(P)c(ε)min{P1/2qε/2,Pq1/42ε/3}, where c(ε)>0 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 c(ε) is ineffective.

Observe that for ε>0 small and A>0 fixed [44, Theorem 1.3] guarantees thatNq(q1/4+ε)c(ε,A)(logq)A, for some constant c(ε,A)>0 that depends only on ε and A. Theorem 1.1 above improves this to a small power of q, that is,Nq(q1/4+ε)c(ε)qε/3. This was also proved independently by Benli [3] (taken with k=2) very recently. Theorem 1.1 also substantially improves the lower boundNq(P)P1/25q1/50,q1/2+εPq, established by Benli and Pollack [4, Theorem 3] and in particular, impliesN(q1/2+ε)q1/4, for any ε>0, provided that q is large enough.

Our next result is an unconditional bound for Nq:=Nq(q), with effective constant.

Theorem 1.3

Suppose q67 is prime with q3(mod16). ThenNq>(2log(32))23q/4logq.

Since(2log(32))34=0.2402, we see from Theorem 1.3 that there is an effectively computable absolute constant c0 such that for qc0 we haveNq>0.24qlogq. 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 Nq(P) with P<q. However it actually increases its strength for P>q, which is still a meaningful range in the problem of estimating Nq(P). 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 Nq(P) under the assumption that L(s,χ) has a mild Siegel zero.

Theorem 1.5

Suppose q3(mod4) is a large prime andL(1,χ)=O(1/(logq)10). Then for any fixed ε>0 and P with q1/2+εPq, we haveNq(P)c(ε)h(q)Pq(logq)2, where h(q) is the class number of F=Q(q) and c(ε)>0 depends only on ε.

Remark 1.6

The constant c(ε) 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 aA means a[A,2A). Given two real numbers M,N and complex weightsα=(αm)mMandβ=(βn)nN, we denoteα:=maxmM|αm|andασ:=(mM|αm|σ)1σ, and similarly for β.

For a,hFq× we consider bilinear forms in Weyl sums for square rootsWa,q(α,β;h,M,N):=mMnNαmβnxFqx2=amneq(hx). 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]:1qS(m,n;q)=1qS(1,mn;q)=εq(nq)xFqx2=mneq(2x), where εq=1 if q1(mod4) and εq=i if q3(mod4) (note that if (mn/q)=1, the Salié sum vanishes). The tuple of characters (1,(/q)) 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 boundWa,q(α,β;h,M,N)=O(α1β1), in the Pólya–Vinogradov range. In arithmetic applications the case when weights satisfyα,β=qo(1) 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 M,Nq/2 and any weights α and β as in (1.5), we have|Wa,q(α,β;h,M,N)|α2β1/3β12/3q1/8+o(1)M7/24N1/8(M7/48q1/16+1)(N7/48q1/16+1) and|Wa,q(α,β;h,M,N)|α2β13/4β1/4q1/8+o(1)M5/16N1/16(M3/16q1/8+1)(N3/16q1/8+1).

When the weights α and β satisfy (1.8), we can re-write the bounds of Theorem 1.7 in the following simplified form|Wa,q(α,β;h,M,N)|q1/8+o(1)(MN)19/24(M7/48q1/16+1)(N7/48q1/16+1) and|Wa,q(α,β;h,M,N)|q1/8+o(1)(MN)13/16(M3/16q1/8+1)(N3/16q1/8+1). 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 Wa,q(α,β;h,M,N) 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 αm and βn 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 αm=O(m1/6+ε) due to Conrey and Iwaniec [13].

We now outline the arithmetic applications of Theorem 1.7.

We recall that the discrepancy DN of a sequence in ξ1,,ξN[0,1) is defined asDN=sup0α<β1|#{1nN:ξn[α,β)}(βα)N|, where #S denotes the cardinality of S (if it is finite), see [15], [39] for background. For positive integers P and R, denote the discrepancy of the sequence (multiset) of points{x/q:x2pr(modq)for some primespP,rR} by Δq(P,R). 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 1P,Rq we haveΔq(P,R)q1/8(PR)19/24+o(1)(P7/48q1/16+1)(R7/48q1/16+1).

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 p,rm. 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 p,rq2/3. In this case, using the bound (1.10) one easily derives similarly to Corollary 1.8 the following result.

Corollary 1.9

Let P,Rq2/3 be real numbers such that the interval [2,P] contains P1+o(1) of both prime quadratic residues and non-residues. If qS1 is a real number such that(PR)3/16Sq9/8+ε, then any reduced residue class modulo q can be represented as prs2 for two primes pP, rR with some real P,Rq2/3 and a positive integer sS.

In particular, if P=R=S then the result of Corollary 1.9 is nontrivial if Pq9/11+ε, while for P=R=q we need Sq3/4+ε.

For a positive integer P we denote the discrepancy of the sequence (multiset) of points{x/q:x2p(modq)for some primepP} by Γq(P).

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 Pq we haveΓq(P)q61/1760P61/66+o(1)+q13/110P9/11+o(1).

If the interval [2,P] contains P1+o(1) 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 Pq13/20+ε with some fixed ε>0.

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 qPq1/4+ε. The starting point in Theorem 1.1 is a certain linear combination of logarithms that biases split primes. In particular, considerQ(P):=nPr(n)lognR, where r(n)=Rq(n)/2, and Rq(n) 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 χ(n):=(q/n)

Notation

Throughout the paper, the notation U=O(V), UV and VU are equivalent to |U|cV for some positive constant c, which throughout the paper may depend on a small real positive parameter ε.

For any quantity V>1 we write U=Vo(1) (as V) to indicate a function of V which satisfies |U|Vε for any ε>0, provided V is large enough.

For a real A>0 we write aA to indicate that a is in the dyadic interval Aa<2A.

For ξR, and mN we denotee(ξ)=exp(2πiξ)andem(ξ)=exp(2πiξ/m). We also use (k/q) 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 χ():=(q/), letr(n):=d|nχ(d).

Lemma 4.1

For each ε>0, there is a constant η>0 for which the following holds: if xq1/4+ε, then the sumnxr(n)=L(1,χ)x+O(x1η), where the implied constant depends only on ε.

Thus by Lemma 4.1 and [35, Equations (22.14) and (22.22)] we havenxgcd(n,q)=1R

Values of quadratic forms free of small prime divisors

Supposef(U,V)=AU2+BUV+CV2Z[U,V], is a binary quadratic form with discriminantB24AC=q1(mod4); we refer to [35, Section 22.1] for a general background. Suppose the form is reduced, that is,gcd(A,B,C)=1and|B|AC. This implies that 3AC4ACB2=q. HenceAq3andACq3.

Let P1 be any number such that PCqε. For each1vP/Cwithgcd(v,A)=1, considerFv(U):=f(U,v)=AU2+BUv+Cv2Z[U]. We still havegcd(A,Bv,Cv2)=1. Thus the reduction of FvZ[U] modulo each odd prime p is non-zero. Only p=2 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 ΓRd is a lattice of determinant detΓ, BRd a symmetric convex body of volume Vol(B) and let λ1,,λd denote the successive minima of Γ with respect to B. Then we have1λ1λdd!2dVol(B)detΓ.

A proof of the following is given in [6, Proposition 2.1].

Lemma 6.2

Suppose ΓRd is a lattice, BRd a symmetric convex body and let λ1,,λd denote the successive minima of Γ with respect to B. Then we have|ΓB|j=1d(2jλj+1).

Using

Preliminary transformations

For Pq, let Pq(P) be the set of primes pP, pq, such that p is a quadratic residue modulo q. To study the discrepancy of the roots of these quadratic congruences, we introduce the exponential sumSq(h,P):=pPq(P)xFqx2=peq(hx)=pPxFqx2=peq(hx)+O(1) (where the term O(1) accounts for q=p which has possibly been added to the sum). We see that Lemma 3.1 reduces the discrepancy question to estimating the sums Sq(h,P).

In fact, following the standard principle, we also introduce the sumsS˜q(h,P)=

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)

  • M. Griffin et al.

    Elliptic curves and lower bounds for class numbers

    J. Number Theory

    (2020)
  • K. Homma

    On the discrepancy of uniformly distributed roots of quadratic congruences

    J. Number Theory

    (2008)
  • W.D. Banks et al.

    Density of non-residues in burgess-type intervals and applications

    Bull. Lond. Math. Soc.

    (2008)
  • W.D. Banks et al.

    Congruences with intervals and arbitrary sets

    Arch. Math.

    (2020)
  • K. Benli

    Small prime kth power residues

    Proc. Am. Math. Soc.

    (2020)
  • K. Benli et al.

    Small prime kth power residues for k=2,3,4: a reciprocity laws approach

    Proc. Am. Math. Soc.

    (2019)
  • B.C. Berndt et al.

    Gauss and Jacobi Sums

    (1998)
  • U. Betke et al.

    Successive-minima-type inequalities

    Discrete Comput. Geom.

    (1993)
  • V. Blomer et al.

    On moments of twisted L-functions

    Am. J. Math.

    (2017)
  • E. Bombieri

    On exponential sums in finite fields

    Am. J. Math.

    (1966)
  • J. Bourgain et al.

    On congruences with products of variables from short intervals and applications

    Proc. Steklov Inst. Math.

    (2013)
  • J. Bourgain et al.

    Entropy of quantum limits

    Commun. Math. Phys.

    (2003)
  • D.A. Burgess

    The distribution of quadratic residues and non-residues

    Mathematika

    (1957)
  • M–C. Chang et al.

    Points on curves in small boxes and applications

    Mich. Math. J.

    (2014)
  • J.B. Conrey et al.

    The cubic moment of central values of automorphic L-functions

    Ann. Math.

    (2000)
  • H. Davenport

    Multiplicative Number Theory

    (1980)
  • M. Drmota et al.

    Sequences, Discrepancies and Applications

    (1997)
  • W. Duke

    Hyperbolic distribution problems and half-integral weight Maass forms

    Invent. Math.

    (1988)
  • W. Duke et al.

    Equidistribution of roots of a quadratic congruence to prime moduli

    Ann. Math.

    (1995)
  • W. Duke et al.

    Weyl sums for quadratic roots

    Int. Math. Res. Not.

    (2012)
  • A. Dunn et al.

    The twisted second moment of modular half integral weight L-functions

  • J. Ellenberg et al.

    Reflection principles and bounds for class group torsion

    Int. Math. Res. Not.

    (2007)
  • P.D.T.A. Elliott

    The least prime k-th-power residue

    J. Lond. Math. Soc.

    (1971)
  • P. Erdős et al.

    On the residues of products of prime numbers

    Period. Math. Hung.

    (1987)
  • E. Fogels

    Über die Ausnahmenullstelle der Heckeschen L-Funktionen

    Acta Arith.

    (1962/1963)
  • É. Fouvry

    Sur le probléme des diviseurs de Titchmarsh

    J. Reine Angew. Math.

    (1985)
  • É. Fouvry et al.

    Algebraic trace functions over the primes

    Duke Math. J.

    (2014)
  • J.B. Friedlander et al.

    What is … the parity phenomenon?

    Not. Am. Math. Soc.

    (2009)
  • Cited by (17)

    View all citing articles on Scopus
    View full text