Goldston-Pintz-Yıldırım sieve explained

The Goldston-Pintz-Yıldırım sieve (also called GPY sieve or GPY method) is a sieve method and variant of the Selberg sieve with generalized, multidimensional sieve weights. The sieve led to a series of important breakthroughs in analytic number theory.

It is named after the mathematicians Dan Goldston, János Pintz and Cem Yıldırım.^[1] They used it in 2005 to show that there are infinitely many prime tuples whose distances are arbitrarily smaller than the average distance that follows from the prime number theorem.

The sieve was then modified by Yitang Zhang in order to prove a finite bound on the smallest gap between two consecutive primes that is attained infinitely often.^[2] Later the sieve was again modified by James Maynard (who lowered the bound to

600 ^[3]) and by Terence Tao.

Goldston-Pintz-Yıldırım sieve

Notation

Fix a

k\in \N and the following notation:P is the set of prime numbers and 1 _{P} (n) the characteristic function of that set,Λ (n) is the von Mangoldt function,\omega(n) is the small prime omega function (which counts the distinct prime factors of n )l{H}=\{h _{1,...,h} _{k\}} is a set of distinct nonnegative integers h _{i\in\Z} _{+\cup} \{ 0 \} .\theta(n) is another characteristic function of the primes defined as\theta(n) = \begin{cases} log (n) & if n\in P \ 0 & else. \end{cases}

Notice that

\theta(n) =log ((n -1 ) 1 _{P} (n) +1 ) .For an l{H} we also definel{H}(n):=(n+h _{1,...,n+h} _{k)} ,P _{l{H} }(n):=(n+h_1)(n+h_2)\cdots (n+h_k)\nu _{p(l{H})} is the amount of distinct residue classes of l{H} modulo p . For example \nu _{3(\{0,2,4\})=3} and \nu _{3(\{0,2\})=2} because \{ 0 , 2 , 4 \}\stackrel{\pmod{ 3 }}{ = }\{ 0 , 1 , 2 \} and \{ 0 , 2 \}\stackrel{\pmod{ 3 }}{ = }\{ 0 , 2 \} .If \nu _{p(l{H})<k} for all p\in P , then we call l{H} admissible.

Construction

Let

l{H}=\{h _{1,...,h} _{k\}} be admissible and consider the following sifting functionl{S}(N,c; l{H}):=\sum\limits ^{2 N} _{n = N +1} \left(\sum\limits _{h _{i\in} l {H} }1_(n+h_i)-c\right)w(n)^2,\quad w(n)\in \R,\quad c>0.For each n\in [N +1 , 2 N] this function counts the primes of the form n + h _{i} minus some threshold c , so if l{S}>0 then there exist some n such that at least \lfloor c \rfloor +1 are prime numbers in l{H}(n) .

Since

1 _{P} (n) has not so nice analytic properties one chooses rather the following sifting functionl{S}(N; l{H}):=\sum\limits ^{2 N} _{n = N +1} \left(\sum\limits _{h _{i\in} l{H} }\theta(n+h_i)-\log(3N)\right)w(n)^2.Since log (N)<\theta(n + h _{i)<log(2N)} and c =log ( 3 n) , we have l{S}>0 only if there are at least two prime numbers n + h _{i} and n + h _{j} . Next we have to choose the weight function w(n) so that we can detect prime k-tuples.

Derivation of the weights

A candidate for the weight function is the generalized von Mangoldt function

Λ _{k(n)=\sum\limits} _{d\mid} \mu(d)\left( log \left( (n)/(d) \right)\right) ^{k,} which has the following property: if \omega(n)>k , then Λ _{k(n)=0} . This functions also detects factors which are proper prime powers, but this can be removed in applications with a negligible error.

So if

l{H}(n) is a prime k-tuple, then the functionΛ _{k(n; l{H})= (1)/(k!) Λ} _{k(P} _{l{H} }(n))will not vanish. The factor 1 /k! is just for computational purposes. The (classical) von Mangoldt function can be approximated with the truncated von Mangoldt functionΛ (n) ≈ Λ _{R(n):=\sum\limits} _{\begin{array} {c} d\mid n\ d\leq R \end{array}}\mu(d) log \left( (R)/(d) \right), where R now no longer stands for the length of l{H} but for the truncation position. Analogously we approximate Λ _{k(n;l{H})} withΛ _{R(n; l{H})= (1)/(k!) \sum\limits} _{\begin{array} {c} d\mid P _{l{H} }(n)\\ d\leq R \end}\mu(d)\left(\log\left(\frac\right)\right)^k

For technical purposes we rather want to approximate tuples with primes in multiple components than solely prime tuples and introduce another parameter

0 \leq \ell \leq k so we can choose to have k + \ell or less distinct prime factors. This leads to the final formΛ _{R(n; l{H},\ell)= (1)/((k+\ell)!) \sum\limits} _{\begin{array} {c} d\mid P _{l{H} }(n)\\ d\leq R \end}\mu(d)\left(\log\left(\frac\right)\right)^Without this additional parameter \ell one has for a distinct d = d _{1d} _{2 …} d _{k} the restriction d _{1\leq} R, d _{2\leq} R, ... ,d _{k\leq} R but by introducing this parameter one gets the more looser restriction d _{1d} _{2...} d _{k\leq} R .So one has a k + \ell -dimensional sieve for a k -dimensional sieve problem.^[4]

Goldston-Pintz-Yıldırım sieve

The GPY sieve has the following form

l{S}(N; l{H},\ell):=\sum\limits ^{2 N} _{n = N +1} \left(\sum\limits _{h _{i\in} l{H} }\theta(n+h_i)-\log(3N)\right)\Lambda_R(n;\mathcal,\ell)^2,\qquad |\mathcal|=kwithΛ _{R(n; l{H},\ell)= (1)/((k+\ell)!) \sum\limits} _{\begin{array} {c} d\mid P _{l{H} }(n)\\ d\leq R \end}\mu(d)\left(\log\left(\frac\right)\right)^,\quad 0\leq \ell\leq k.

Proof of the main theorem by Goldston, Pintz and Yıldırım

Consider

( l{H} _{1,\ell} _{1,} k _{1)} and ( l{H} _{2,\ell} _{2,} k _{2)} and 1 \leq h _{0\leq} R and define M: = k _{1+k} _{2+\ell} _{1+\ell} _{2} . In their paper, Goldston, Pintz and Yıldırım proved in two propositions that under suitable conditions two asymptotic formulas of the form\sum\limits _{n\leq} Λ _{R(n;l{H}} _{1,\ell} _{1)Λ} _{R(n;l{H}} _{2,\ell} _{2)} = C ^{i} _{1 \left( l{S}( l{H}} ) + o _{M(1)\right)N} and\sum\limits _{n\leq} Λ _{R(n;l{H}} _{1,\ell} _{1)Λ} _{R(n;l{H}} _{2,\ell} _{2)\theta(n+h} _{0) =} C ^{j) + o} _{M( 1 )\right)N} hold, where C _{1,C} _{2} are two constants, l{S}( l{H} ^{i} ) and l{S}( l{H} ^{j} ) are two singular series whose description we omit here.

Finally one can apply these results to

l{S} to derive the theorem by Goldston, Pintz and Yıldırım on infinitely many prime tuples whose distances are arbitrarily smaller than the average distance.

Notes and References

1. Daniel A.. Goldston. János. Pintz. Cem Y.. Yıldırım. Primes in Tuples I. Annals of Mathematics. 170. 2. 2009. 819–862. 10.4007/annals.2009.170.819. free.
2. Yitang. Zhang. Bounded gaps between primes. Annals of Mathematics. 179. 2014. 1121–1174. 10.4007/annals.2014.179.3.7. free.
3. James. Maynard. Small gaps between primes. Annals of Mathematics. 383–413. 181. 2015. 1. 10.4007/annals.2015.181.1.7. 1311.4600.
4. Small gaps between primes or almost primes. Daniel A.. Goldston. János. Pintz. Cem Y.. Yıldırım. Sidney W.. Graham. 2009. Transactions of the American Mathematical Society . 361. 10. math/0506067. 7.