MathLabs

Worked solution: Maynard's multidimensional sieve: bounded gaps between primes (2013)

Step 7 of 8: Closing the argument: Bombieri–Vinogradov gives lim inf⁡(pn+1−pn)≤600\liminf(p_{n+1}-p_n)\le 600
In plain words

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 θ\theta arbitrarily close to 1/21/2. Feeding θ=1/2\theta=1/2 and k=105k=105 into the threshold from Step 5, together with the numerical fact M105>4M_{105}>4 from Step 6, gives r105≥2r_{105}\ge 2: at least two primes among 105105 shifted values, infinitely often.

All that remains is a purely combinatorial fact — that some admissible 105105-tuple exists packed into an interval of length only 600600 — and the two primes it guarantees are then automatically within 600600 of each other.

lim inf⁡n→∞(pn+1−pn)≤600\liminf_{n\to\infty}(p_{n+1}-p_n)\le 600
Detailed analysis

By the Bombieri–Vinogradov theorem, the primes have level of distribution θ\theta for every θ<1/2\theta<1/2 (a classical result requiring no input from Zhang's work). Taking k=105k=105, Proposition 4.3 gives M105>4M_{105}>4, so Maynard checks directly that with θ\theta close enough to 1/21/2, θM105/2>1\theta M_{105}/2 > 1, so r105=⌈θM105/2⌉≥2r_{105}=\lceil \theta M_{105}/2\rceil \ge 2 (Maynard 2013, §4, proof of Theorem 1.3). By Proposition 4.2 (Step 5), infinitely many nn then have at least 22 of n+h1,…,n+h105n+h_1,\dots,n+h_{105} simultaneously prime, for any admissible H={h1,…,h105}\mathcal{H}=\{h_1,\dots,h_{105}\}.

It remains to exhibit one admissible 105105-element set of diameter at most 600600; such sets can be found by a direct, finite search (choosing 105105 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 pn+hi,pn+hjp_{n+h_i}, p_{n+h_j} with ∣hi−hj∣≤600|h_i-h_j|\le 600 occur infinitely often among consecutive or near-consecutive primes, giving lim inf⁡n(pn+1−pn)≤600\liminf_n(p_{n+1}-p_n)\le 600 (Maynard 2013, Theorem 1.3).

Crucially, this argument uses no estimate beyond the classical Bombieri–Vinogradov theorem: it improves on Zhang's original 70,000,00070{,}000{,}000 using purely older technology, made possible entirely by the multidimensional sieve of Steps 3–6.

Terms in this step
Bombieri–Vinogradov theorem
A classical theorem (1965) stating that primes up to NN are, on average over moduli q≤Nθq\le N^\theta for any θ<1/2\theta<1/2, 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.