Amplification arguments for large sieve inequalities

Amplification arguments for large sieve inequalities

E. Kowalski ETH Zürich – D-MATH
Rämistrasse 101
8092 Zürich, Switzerland
kowalski@math.ethz.ch
Abstract.

We give a new proof of the arithmetic large sieve inequality based on an amplification argument, and use a similar method to prove a new sieve inequality for classical holomorphic cusp forms. A sample application of the latter is also given.

Key words and phrases:
Large sieve inequality, modular form, amplification
2000 Mathematics Subject Classification:
Primary 11N35, 11F11
This work was completed while on sabbatical leave at the Institute for Advanced Study (Princeton, NJ). This material is based upon work supported by the National Science Foundation under agreement No. DMS-0635607. Any opinions, findinds and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.

1. The classical large sieve

The classical arithmetic large sieve inequality states that, for any real numbers , , any choice of subsets for primes , we have

(1)

where

and is any constant for which the “harmonic” large sieve inequality holds: for any complex numbers , we have

(2)

the notation and denoting, respectively, a sum over squarefree integers, and one over integers coprime with the (implicit) modulus, which is here.

By work of Montgomery-Vaughan and Selberg, it is known that one can take

(see, e.g., [7, Th. 7.7]).

There are a number of derivations of (1) from (2); for one of the earliest, see [10, Ch. 3]. The most commonly used is probably the argument of Gallagher involving a “submultiplicative” property of some arithmetic function (see, e.g., [8, §2.2] for a very general version).

We will show in this note how to prove (1) quite straightforwardly from the dual version of the harmonic large sieve inequality: is also any constant for which

(3)

holds for arbitrary complex numbers . This is of some interest because, quite often,111 But not always – Gallagher’s very short proof, found e.g. in [11, Th. 1, p. 549], proceeds directly. the inequality (2) is proved by duality from (3), and because, in recent generalized versions of the large sieve (see [8]), it often seems that the analogue of (3) is the most natural inequality to prove – or least, the most easily accessible. So, in some sense, one could dispense entirely with (2) for many applications! In particular, note that both known proofs of the optimal version with proceed by duality.

Note that some ingredients of many previous proofs occur in this new argument. Also, there are other proofs of (1) working directly from the inequality (3) which can be found in the older literature on the large sieve, usually with explicit connections with the Selberg sieve (see the references to papers of Huxley, Kobayashi, Matthews and Motohashi in [11, p. 561]), although none of those that the author has seen seems to give an argument which is exactly identical or as well motivated. Also, traces of this argument appear earlier in some situations involving modular forms, e.g., in [4]. In Section 2, we will use the same method to obtain a new type of sieve inequality for modular forms; in that case, it doesn’t seem possible to adapt easily the classical proofs.

Indeed, maybe the most interesting aspect of our proof is that it is very easy to motivate. It flows very nicely from an attempt to improve the earlier inequality

(4)

of Rényi, which is most easily proved using (3) instead of (1), as in [8, §2.4].

We will explain this quite leisurely; one could be much more concise and direct (as in Section 2).

Let

be the sifted set; we wish to estimate from above the cardinality of this finite set. From (3), the idea is to find an “amplifier” of those integers remaining in the sifted set, i.e., an expression of the form

which is large (in some sense) when . Then an estimate for follows from the usual Chebychev-type manoeuvre.

To construct the amplifier , we look first at a single prime . If , we have . If we expand the characteristic function of in terms of additive characters,222 We use this specific basis to use (3), but any orthonormal basis containing the constant function would do the job, as in [8]. we have then

and the point is that the contribution of the constant function (-th harmonic) is, indeed, relatively “large”, because it is

and exactly reflects the probability of a random element being in . Thus for , we have

(5)

with

If we only use the contribution of the primes in (3), and the amplifier

then by (3), we get

For , the size of the amplifier is

by (5), while on the other hand, by applying the Parseval identity in , we get

So we obtain

i.e., exactly Rényi’s inequality (4), by this technique.

To go further, we must exploit all the squarefree integers (and not only the primes) to construct the amplifier. This is most easily described using the Chinese Remainder Theorem to write

and putting together the amplifiers modulo primes : if then for all , and hence multiplying out (5) over , we find constants , defined for (because is defined for coprime with ), such that

Moreover, because the product decomposition of the Chinese Remainder Theorem is compatible with the Hilbert space structure involved, we have

Arguing as before, we obtain from (3) – using all squarefree moduli this time – that

(6)

with

This is not quite (1), but we have some flexibility to choose another amplifier, namely, notice that this expression is not homogeneous if we multiply the coefficients by scalars independent of , and we can use this to find a better inequality. Precisely, let

where are arbitrary real coefficients.

Then we have the new amplification property

with altered “cost” given by

so that, arguing as before, we get

with

By homogeneity, the problem is now to minimize a quadratic form (namely ) under a linear constraint given by . This is classical, and is done by Cauchy’s inequality: writing

for ease of notation, we have

with equality if and only if is proportional to

in which case

and we get , hence , which is (1).

Remarks.

(1) The last optimization step is reminiscent of the Selberg sieve (see, e.g., [7, p. 161, 162]). Indeed, it is well known that the Selberg sieve is related to the large sieve, and particularly with the dual inequality (3), as explained in [5, p. 125]. Note however that the coefficients we optimize for, being of an “amplificatory” nature, and different from the coefficents typically sought for in Selberg’s sieve, which are akin to the Möbius function and of a “mollificatory” nature.

(2) The argument does not use any particular feature of the classical sieve, and thus extends immediately to provide a proof of the general large sieve inequality of [8, Prop. 2.3] which is directly based on the dual inequality [8, Lemma 2.8]; readers interested in the formalism of [8] are encouraged to check this.

Example.

What are the amplifiers above in some simple situations? In the case – maybe the most important – where we try to count primes, we then take to detect integers free of small primes by sieving, and (5) becomes

if . Then, for squarefree, the associated detector is the identity

if , or in other words, it amounts to the well-known formula

for the values of a Ramanujan sum with coprime arguments. Note that in this case, the optimization process above replaced with

which is not a very big change – and indeed, for small sieves, the bound (6) is not far from (1), and remains of the right order of magnitude.

On the other hand, for an example in a large sieve situation, we can take to be the set of squares in . The characteristic function (for odd ) is

with coefficients given – essentially – by Gauss sums

Then tends to as , while tends to . This difference leads to a discrepancy in the order of magnitude of the final estimate: using standard results on bounds for sums of multiplicative functions, (6) and taking , we get

instead of that follows from (1).

2. Sieving for modular forms

To illustrate the possible usefulness of the proof given in the first section, we use the same technique to prove a new type of large sieve inequality for classical (holomorphic) modular forms. The originality consists in using known inequalities for Fourier coefficients (due to Deshouillers-Iwaniec) as a tool to obtain a sieve where the cusp forms are the objects of interest, i.e., to bound from above the number of cusp forms of a certain type satisfying certain local conditions.

Let be a fixed even integer. For any integer , let be the finite set of primitive holomorphic modular forms of level and weight , with trivial nebentypus (more general settings can be studied, but we restrict to this one for simplicity). We denote by

the Fourier expansion of a form at the cusp at infinity.

We consider on this finite set the “measure” defined by

where is the Petersson inner product. This is the familiar “harmonic weight”, and we denote

(7)

the corresponding averaging operator and “probability”, for an arbitrary property referring to the modular forms . (Note that it is only asymptotically that this is a probability measure, as ).

Imitating the notation in [8, Ch. 1], we now denote by

the -th Fourier coefficient maps, which we see as giving “global-to-local” data, similar to reduction maps modulo primes for integers. If is a squarefree integer coprime with , we denote

which we emphasize is a tuple of Fourier coefficients, that should not be mistaken with the single number .

The basic relation with sieve is the following idea: provided is small enough, the become equidistributed as for the product Sato-Tate measure

where

and this is similar to the equidistribution of arithmetic sequences like the integers or the primes modulo squarefree , and the independence due to the Chinese Remainder Theorem.

The quantitative meaning of this principle is easy to describe if is bounded (independently of ), but requires some care when it grows with . For our purpose, we express it as given by uniform bounds for Weyl-type sums associated with a suitable orthonormal basis of . The latter is easy to construct. Indeed, recall first the standard fact that the Chebychev polynomials , , defined by

(8)

form an orthonormal basis of . Then standard arguments show that for and the measure above on , the functions

defined for any -friable integer333 I.e., integer only divisible by primes . , factored as

form an orthonormal basis of . (In particular we have , the constant function .)

We have also the following fact which gives the link between this orthonormal basis and our local data : for any integer coprime with and divisible only by primes , and any , we have

(9)

This is simply a reformulation of the Hecke multiplicativity relations between Fourier coefficients of primitive forms.

Remark.

Our situation is similar to that of classical sieve problems, where (in the framework of [8]) we have a set (with a finite measure ) and surjective maps with finite target sets , each equipped with a probability density , so that the equidistribution can be measured by the size of the remainders defined by

and the independence by using finite sets , and

and looking at

Here the compact set requires the use of infinitely many functions to describe an orthonormal basis. Another (less striking) difference is that our local information lies in the same set for all primes, whereas classical sieves typically involve reduction modulo primes, which lie in different sets.

We now state the analogue, in this language, of the dual large sieve inequality (3).

Proposition 1.

With notation as above, for all , all integers , all complex numbers defined for in the set of -friable integers coprime with , we have

(10)

where the implied constant depends only on and on the left-hand side is the radical .

Proof of Proposition 1.

This is in fact simply a consequence of one of the well-known large sieve inequalities for Fourier coefficients of cusp forms (as developped by Iwaniec and by Deshouillers–Iwaniec, see [3]). The point is that because of (9), the left-hand side of (10) can be rewritten

We can now enlarge this by positivity; remarking that

can be seen as a subset of an orthonormal basis of the space of cusp forms of weight and level , and selecting any such basis , we have therefore

where we put if , and where the are the Fourier coefficients, so that

(as earlier for Hecke forms). Now by the large sieve inequality in [7, Theorem 7.26], taking into account the slightly different normalization,444 The case requires adding a factor . we have

(11)

with an absolute implied constant, and this leads to (10). ∎

Remark 2.

In terms of equidistribution (which are hidden in this proof), the basic statement for an individual prime is that

for all . Such results are quite well-known and follow in this case from the Petersson formula. There is an implicit version already present in Bruggeman’s work (see [1, §4], where it is shown that, on average, “most” Maass forms with Laplace eigenvalue , satisfy the Ramanujan-Petersson conjecture), and the first explicit result goes back to Sarnak [13], still in the case of Maass forms.555 This is the only result we know that discusses the issue of independence of the coefficients at various primes. Serre [14] and Conrey, Duke and Farmer [2] gave similar statements for holomorphic forms, and Royer [12] described quantitative versions in that case.

We can now derive the analogues of the arithmetic inequality (1) and of Rényi’s inequality (4). The basic “sieve” questions we look at is to bound from above the cardinality (or rather, -measure) of sets of the type

for . Because the expansion of the characteristic function of in terms of Chebychev polynomials involves infinitely many terms, we restrict to a simple type of condition sets of the following type:

(12)

where

is a real-valued polynomial and (the degree is assumed to be the same for all ). Note that is the -average of , so our sets are those where the Fourier coefficients for are “away” from the putative average value according to the Sato-Tate measure.

Denote also by

the variance of .

Then the analogue of (4) is

(13)

where the implied constant depends only on , and that of (1) is

(14)

where , is arbitrary and

the implied constant depending again only on .

To prove (13), we apply (10) with and unless with and , , in which case

By definition of and of , we get

showing that (13) is indeed a special case of (10).

To prove (14), we use the “amplification” method of the previous section. The basic observation is that if, for some prime , we have

(15)

then it follows that

Now let , for , be arbitrary auxiliary positive real numbers, and let

for , the product of all primes . If (15) holds for all coprime with , then we find by multiplying out that, for any integer , i.e., such that

(16)

and for such , we have

which translates to

where runs over the set of integers of the type

so , and

Thus, summing over subject to (16), squaring, then averaging over and applying (10), we find that the probability

satisfies

where

Cauchy’s inequality shows that , with equality if

and the inequality above, with this choice, leads to

as desired.

Remark.

If one tries to adapt, for instance, the standard proof in [8], one encounters problems because the latter would (naively at least) involve the problematic expansion of a Dirac measure at a fixed in terms of Chebychev polynomials.

Here is an easy application of (14), for illustration (stronger results for that particular problem follow from the inequality of Lau and Wu [9], as will be explained with other related results in a forthcoming joint work): it is well-known that for , the sequence of real numbers changes sign infinitely often, and there has been some recent interest (see, e.g., the paper [6] of Iwaniec, Kohnen and Sengupta) in giving quantitative bounds on the first sign change. We try instead to show that this first sign-change is quite small on average over (compare with [4]): fix , and let

(any other combination of signs is permissible). This is a “sifted set”, and we claim that

for any , where the implied constant depends only on and . Since is of size about (for fixed ), this is a non-trivial bound for all . Moreover, to prove this bound, it suffices to show

since we have the well-known upper bound for any (see, e.g., [7, p. 138]).

The sets used in are not exactly in the form (12), so we use some smoothing: we claim there exists a real polynomial of degree such that

(17)

Assuming such a polynomial is given, we observe that

for some fixed . Therefore, by (14) with , we get for all that

where

and the implied constant depends only on . By assumption, we have , and an easy lower bound for follows in the range of interest simply from bounding and using known results on the cardinality of : we have

for any , the implied constant depending only on , the choice of and . This clearly gives the result, and it only remains to exhibit the polynomial . One can check easily that

does the job (see its graph); the numerical values of , and are given by

Figure 1.
Remark 3.

See the letter of Serre in the Appendix of [15] for previous examples showing how to use limited information towards the Sato-Tate conjecture to prove distribution results for Hecke eigenvalues (of a fixed modular form).

References

  • [1] R. Bruggeman: Fourier coefficients of cusp forms, Invent. math. 45 (1978), 1–18.
  • [2] B. Conrey, W. Duke and D. Farmer: The distribution of the eigenvalues of Hecke operators, Acta Arith. 78 (1997), 405–409.
  • [3] J-M. Deshouillers and H. Iwaniec: Kloosterman sums and Fourier coefficients of cusp forms, Invent. math. 70 (1982), 220–288.
  • [4] W. Duke and E. Kowalski: A problem of Linnik for elliptic curves and mean-value estimates for automorphic representations, with an Appendix by D. Ramakrishnan, Invent math. 139 (2000), 1–39.
  • [5] H. Halberstam and H.E. Richert: Sieve methods, London Math. Soc. Monograph, Academic Press (London), 1974
  • [6] H. Iwaniec, W. Kohnen and J. Sengupta: The first negative Hecke eigenvalue, International J. Number Theory 3 (2007), 355–363.
  • [7] H. Iwaniec and E. Kowalski: Analytic number theory, AMS Colloquium Publ. 53, 2004.
  • [8] E. Kowalski: The large sieve and its applications: arithmetic geometry, random walks and discrete groups, Cambridge Tracts in Math. 175, 2008.
  • [9] Y.K. Lau and J. Wu: A large sieve inequality of Elliott-Montgomery-Vaughan type for automorphic forms and two applications, International Mathematics Research Notices, Vol. 2008, doi:10.1093/imrn/rmn162.
  • [10] H-L. Montgomery: Topics in multiplicative number theory, Lecture Notes Math. 227, Springer-Verlag 1971.
  • [11] H-L. Montgomery: The analytic principle of the large sieve, Bull. A.M.S. 84 (1978), 547–567.
  • [12] E. Royer: Facteurs -simples de de grande dimension et de grand rang, Bull. Soc. Math. France 128 (2000), 219–248.
  • [13] P. Sarnak: Statistical properties of eigenvalues of the Hecke operators, in “Analytic Number Theory and Diophantine Problems” (Stillwater, OK, 1984), Progr. Math. 70, Birkhäuser, 1987, 321–331.
  • [14] J-P. Serre: Répartition asymptotique des valeurs propres de l’opérateur de Hecke , J. American Math. Soc. 10 (1997), 75–102.
  • [15] F. Shahidi: Symmetric power -functions for , in: “Elliptic curves and related topics”, edited by E. Kishilevsky and M. Ram Murty, CRM Proc. and Lecture Notes 4, 1994, 159–182.
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
278302
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description