Siebert's explicit prime-pair sieve bound
ProvedTaoFivePrimes.siebert_prime_pair_boundadditive-number-theorynumber-theoryprime-pairssieve-methodstao-five-primes
Let and let be even. The number of integers for which both and are prime and satisfies
where is the twin prime constant and the product is the singular-series correction at the odd prime divisors of the shift (the product is when has no odd prime divisor). This is Siebert's dimension-two weighted sieve bound in the explicit form, with all constants written down, used in Tao's proof of Proposition 4.10.
In the formal statement the count is written as a finite sum of indicators over .
Preamble
import Definitions.Def_TaoFivePrimes_SingularSeries import Mathlib.Data.Nat.Prime.Basic import Mathlib.Data.Nat.Factors import Mathlib.Analysis.SpecialFunctions.Log.Base open scoped BigOperators
Formal statement
namespace TaoFivePrimes
theorem siebert_prime_pair_bound (x d : ℕ) (hx : 2 ≤ x) (hd0 : 0 < d)
(hd2 : 2 ∣ d) :
(∑ n ∈ Finset.range (x + 1),
if Nat.Prime n ∧ Nat.Prime (n + d) ∧ n + d ≤ x then (1 : ℝ) else 0) ≤
8 * twinPrimeConstant * (x : ℝ) / (Real.log (x : ℝ)) ^ 2 *
∏ p ∈ Nat.primeFactors d, if 2 < p then ((p : ℝ) - 1) / ((p : ℝ) - 2) else 1 := by sorry
end TaoFivePrimesSource
H. Siebert, *Montgomery's weighted sieve for dimension two*, Monatshefte für Mathematik 82 (1976), 327–336, https://doi.org/10.1007/BF01351768; as applied in T. Tao, *Every odd number greater than 1 is the sum of at most five primes*, arXiv:1201.6656, https://arxiv.org/abs/1201.6656, proof of Proposition 4.10.