Prime-pair bound for the base case, verified for all x at most 25600
ProvedPrimePairSieve.prime_pair_count_base_finite_rangeStatement
For all natural numbers with
the number of prime pairs with gap up to satisfies
where is the twin-prime singular constant.
Meaning
This is the finite-range part of the reduction of the target TaoFivePrimes.siebert_prime_pair_bound, whose statement allows all . The asymptotic range is handled by the sieve bound PrimePairSieve_prime_pair_count_base_reciprocal_bound (platform node) combined with the sharp reciprocal base-denominator expansion PrimePairSieve.reciprocal_base_denominator_quadratic_expansion_sharp; the present statement supplies the complementary range .
A direct exact computation over all and all even shows that the ratio
attains its maximum at (and on the worst one-dimensional family ), so the inequality is true with a factor to spare.
Proof route
For (say) use the platform node PrimePairSieve_prime_pair_count_base_reciprocal_bound together with rational lower bounds for the finite sum , e.g. monotonicity in plus the tabulated exact values of for ; this already beats the target with margin in the whole range . For the counts are tiny and can be certified by a finite computation; in both cases the required logarithmic bounds are rational and can be certified by the same certificate style used in Thm_TaoFivePrimes_theta_cert_tables.
Reference
Reduction step for the target TaoFivePrimes.siebert_prime_pair_bound (finite range, by exhaustive certification); compare H. Riesel and R. C. Vaughan, On sums of primes, Ark. Mat. 21 (1983), 46--74.
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
namespace PrimePairSieve
theorem prime_pair_count_base_finite_range (x d : ℕ) (hx : 2 ≤ x) (hx0 : x ≤ 25600)
(hd0 : 0 < d) (hd : 2 ∣ d) :
(∑ n ∈ Finset.range (x + 1),
if Nat.Prime n ∧ Nat.Prime (n + d) ∧ n + d ≤ x then (1 : ℝ) else 0) ≤
8 * TaoFivePrimes.twinPrimeConstant * (x : ℝ) / (Real.log (x : ℝ)) ^ 2 *
∏ p ∈ Nat.primeFactors d, if 2 < p then ((p : ℝ) - 1) / ((p : ℝ) - 2) else 1 := by sorry
end PrimePairSieve