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. 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. Later the sieve was again modified by James Maynard (who lowered the bound to 600 {\displaystyle 600} ) and by Terence Tao.
Goldston–Pintz–Yıldırım sieve
Notation Fix a k ∈ N {\displaystyle k\in \mathbb {N} } and the following notation:
P {\displaystyle \mathbb {P} } is the set of prime numbers and 1 P ( n ) {\displaystyle 1_{\mathbb {P} }(n)} the characteristic function of that set,
Λ ( n ) {\displaystyle \Lambda (n)} is the von Mangoldt function,
ω ( n ) {\displaystyle \omega (n)} is the small prime omega function (which counts the distinct prime factors of n {\displaystyle n} )
H = { h 1 , … , h k } {\displaystyle {\mathcal {H}}=\{h_{1},\dots ,h_{k}\}} is a set of distinct nonnegative integers h i ∈ Z + ∪ { 0 } {\displaystyle h_{i}\in \mathbb {Z} _{+}\cup \{0\}} .
θ ( n ) {\displaystyle \theta (n)} is another characteristic function of the primes defined as
θ ( n ) = { log ( n ) if n ∈ P 0 else. {\displaystyle \theta (n)={\begin{cases}\log(n)&{\text{if }}n\in \mathbb {P} \\0&{\text{else.}}\end{cases}}}
Notice that θ ( n ) = log ( ( n − 1 ) 1 P ( n ) + 1 ) {\displaystyle \theta (n)=\log((n-1)1_{\mathbb {P} }(n)+1)} . For an H {\displaystyle {\mathcal {H}}} we also define
H ( n ) := ( n + h 1 , … , n + h k ) {\displaystyle {\mathcal {H}}(n):=(n+h_{1},\dots ,n+h_{k})} ,
P H ( n ) := ( n + h 1 ) ( n + h 2 ) ⋯ ( n + h k ) {\displaystyle P_{\mathcal {H}}(n):=(n+h_{1})(n+h_{2})\cdots (n+h_{k})}
… excerpt ends here. Continue reading the full article.
