Worked solution: Maynard's multidimensional sieve: bounded gaps between primes (2013)
Now all the pieces snap together. The classical Bombieri–Vinogradov theorem, known since the 1960s with no need for Zhang's new estimates, guarantees a level of distribution arbitrarily close to . Feeding and into the threshold from Step 5, together with the numerical fact from Step 6, gives : at least two primes among shifted values, infinitely often.
All that remains is a purely combinatorial fact — that some admissible -tuple exists packed into an interval of length only — and the two primes it guarantees are then automatically within of each other.
By the Bombieri–Vinogradov theorem, the primes have level of distribution for every (a classical result requiring no input from Zhang's work). Taking , Proposition 4.3 gives , so Maynard checks directly that with close enough to , , so (Maynard 2013, §4, proof of Theorem 1.3). By Proposition 4.2 (Step 5), infinitely many then have at least of simultaneously prime, for any admissible .
It remains to exhibit one admissible -element set of diameter at most ; such sets can be found by a direct, finite search (choosing residues avoiding one class mod each small prime), and Maynard confirms one exists. Two of its shifted values being simultaneously prime, infinitely often, means two primes with occur infinitely often among consecutive or near-consecutive primes, giving (Maynard 2013, Theorem 1.3).
Crucially, this argument uses no estimate beyond the classical Bombieri–Vinogradov theorem: it improves on Zhang's original using purely older technology, made possible entirely by the multidimensional sieve of Steps 3–6.
- Bombieri–Vinogradov theorem
- A classical theorem (1965) stating that primes up to are, on average over moduli for any , distributed among residue classes almost exactly as evenly as the prime number theorem predicts — playing the role that the Generalized Riemann Hypothesis would play if it were known.