Reciprocal sieve threshold on [20000,50000] via interval masses
ProvedPrimePairSieve.reciprocal_mass_window_20000_50000For every real , with the mission's twin-prime constant and literal squarefree weight , this theorem states
This is the exact bounded restriction of the registered reciprocal threshold, preserving the real variable, natural floor, correction term, constant, and literal weights. It does not assert the full unbounded threshold or the five-primes theorem.
The certificate reuses 355 disjoint interval masses, checked in 5 groups containing 8,012 selected weights. A certified bound , rational logarithm bounds, and 4 adjoining real cells transfer the finite endpoint comparisons over the whole interval. Integer masses and endpoint divisions round downward; disjointness and containment are checked before adding them. The interval proof imports the mass certificates and generic soundness results as explicit dependencies.
import Mathlib import Definitions.Def_TaoFivePrimes_SingularSeries open scoped BigOperators set_option autoImplicit false
theorem PrimePairSieve.reciprocal_mass_window_20000_50000 : ∀ z : ℝ, 20000 ≤ z → z ≤ 50000 →
(Real.log (4 * z)) ^ 2 / (2 * TaoFivePrimes.twinPrimeConstant) /
(1 - ((z + 1) * ((Real.log (4 * z)) ^ 2 /
(2 * TaoFivePrimes.twinPrimeConstant)) / (16 * z ^ 2)))
≤ ∑ q ∈ Finset.Icc 1 ⌊z⌋₊,
(if Squarefree q then
∏ p ∈ q.primeFactors, if p = 2 then (1 : ℝ) else 2 / ((p : ℝ) - 2)
else 0) / (1 + (q : ℝ) / z) := by sorry