Suvarna Garge (Editor)

Fundamental lemma of sieve theory

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In number theory, the fundamental lemma of sieve theory is any of several results that systematize the process of applying sieve methods to particular problems. Halberstam & Richert write:

Contents

A curious feature of sieve literature is that while there is frequent use of Brun's method there are only a few attempts to formulate a general Brun theorem (such as Theorem 2.1); as a result there are surprisingly many papers which repeat in considerable detail the steps of Brun's argument.

Diamond & Halberstam attribute the terminology Fundamental Lemma to Jonas Kubilius.

Common notation

We use these notations:

  • A is a set of X positive integers, and Ad is its subset of integers divisible by d
  • w(d) and Rd are functions of A and of d that estimate the number of elements of A that are divisible by d, according to the formula
    • | A d | = w ( d ) d X + R d . Thus w(d) / d represents an approximate density of members divisible by d, and Rd represents an error or remainder term.
  • P is a set of primes, and P(z) is the product of those primes ≤ z
  • S(A, P, z) is the number of elements of A not divisible by any prime in P that is ≤ z
  • κ is a constant, called the sifting density, that appears in the assumptions below. It is a weighted average of the number of residue classes sieved out by each prime.

    • Fundamental lemma of the combinatorial sieve

    This formulation is from Tenenbaum. Other formulations are in Halberstam & Richert, in Greaves, and in Friedlander & Iwaniec. We make the assumptions:

  • w(d) is a multiplicative function.
  • The sifting density κ satisfies, for some constant C and any real numbers η and ξ with 2 ≤ η ≤ ξ:
    • ∏ η ≤ p ≤ ξ ( 1 − w ( p ) p ) − 1 < ( ln ⁡ ξ ln ⁡ η ) κ ( 1 + C ln ⁡ η ) .

    There is a parameter u ≥ 1 that is at our disposal. We have uniformly in A, X, z, and u that

    S ( a , P , z ) = X ∏ p ≤ z , p ∈ P ( 1 − w ( p ) p ) { 1 + O ( u − u / 2 ) } + O ( ∑ d ≤ z u , d | P ( z ) | R d | ) .

    In applications we pick u to get the best error term. In the sieve it represents the number of levels of the inclusion–exclusion principle.

    Fundamental lemma of the Selberg sieve

    This formulation is from Halberstam & Richert. Another formulation is in Diamond & Halberstam.

    We make the assumptions:

  • w(d) is a multiplicative function.
  • The sifting density κ satisfies, for some constant C and any real numbers η and ξ with 2 ≤ η ≤ ξ:
    • ∑ η ≤ p ≤ ξ w ( p ) ln ⁡ p p < κ ln ⁡ ξ η + C .
  • w(p) / p < 1 - c for some small fixed c and all p
  • | Rd | ≤ ω(d) where ω(d) is the number of distinct prime divisors of d.

    • The fundamental lemma has almost the same form as for the combinatorial sieve. Write u = ln X / ln z. The conclusion is:

    S ( a , P , z ) = X ∏ p ≤ z ,   p ∈ P ( 1 − w ( p ) p ) { 1 + O ( e − u / 2 ) } .

    Note that u is no longer an independent parameter at our disposal, but is controlled by the choice of z.

    Note that the error term here is weaker than for the fundamental lemma of the combinatorial sieve. Halberstam & Richert remark: "Thus it is not true to say, as has been asserted from time to time in the literature, that Selberg's sieve is always better than Brun's."

    References

    Fundamental lemma of sieve theory Wikipedia
    (Text) CC BY-SA