Fundamental lemma of sieve theory

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] Rp|92–93write:

Common notation

We use these notations:
* "A" is a set of "X" positive integers, and "A"_"d" is its subset of integers divisible by "d"
* "w"("d") and "R"_"d" are functions of "A" and of "d" that estimate the number of elements of "A" that are divisible by "d", according to the formula:$leftvert\; A\_d\; ightvert\; =\; frac\{w(d)\}\{d\}\; X\; +\; R\_d\; .$:Thus "w"("d") / "d" represents an approximate density of members divisible by "d", and "R"_"d" represents an error or remainder term.
* "P" is a set of primes, and "P"("z") is its 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,Rp|28 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.] Rp|60 Other formulations are in Halberstam & RichertRp|82 and in Greaves.] 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 ≤ η ≤ ξ::

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\; prod\_\{p\; le\; z,\; p\; in\; P\}\; left(\; 1\; -\; frac\{w(p)\}\{p\}\; ight)\; \{1\; +\; O(u^\{-u/2\})\}\; +\; Oleft(sum\_\{d\; le\; z^u,\; d|P(z)\}\; |R\_d|\; ight).$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.Rp|208–209

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 ≤ η ≤ ξ::
* "w"("p") / p < 1 - "c" for some small fixed "c" and all "p"
* | "R"_"d" | ≤ ω("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\; prod\_\{p\; le\; z,\; p\; in\; P\}\; left(\; 1\; -\; frac\{w(p)\}\{p\}\; ight)\; \{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:Rp|221 "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."

Notes