Reciprocal interval criterion with a certified constant parameter
ProvedPrimePairSieve.reciprocal_interval_certificate_with_constantLet be the mission's twin-prime constant and let be any positive certified lower bound for . For , choose , put and , and suppose .
If the endpoint reciprocal sum is at least , then the original reciprocal threshold holds at every real . The sum retains the literal squarefree weights and the natural-floor cutoff.
The proof generalizes the existing interval criterion, replacing its fixed lower bound by the explicit parameter . The reciprocal sum increases with , while decreases. Logarithm monotonicity and bound the numerator by . The positive correction assumption then permits the two denominator comparisons. Nonnegative omitted terms handle the floor jumps.
The result does not establish a lower bound for or an endpoint certificate: those are explicit inputs. It lets independently certified improvements in the constant reduce the numerical work without changing the original threshold. The local proof is closed, using only Mathlib and the singular-series definition; its reported axioms are propext, Classical.choice, and Quot.sound.
import Mathlib import Definitions.Def_TaoFivePrimes_SingularSeries open scoped BigOperators set_option autoImplicit false
theorem PrimePairSieve.reciprocal_interval_certificate_with_constant
(c₀ L U ell z : ℝ) (hc₀ : 0 < c₀) (hC : c₀ ≤ TaoFivePrimes.twinPrimeConstant) (hL : 40 ≤ L) (hLz : L ≤ z) (hzU : z ≤ U)
(hlog : Real.log (4 * U) ≤ ell)
(hpositive : ((L + 1) / (16 * L ^ 2)) * (ell ^ 2 / (2*c₀)) < 1)
(hcertificate : ell ^ 2 / (2*c₀) /
(1 - ((L + 1) / (16 * L ^ 2)) * (ell ^ 2 / (2*c₀))) ≤
∑ q ∈ Finset.Icc 1 ⌊L⌋₊,
(if Squarefree q then
∏ p ∈ q.primeFactors, if p = 2 then (1 : ℝ) else 2 / ((p : ℝ) - 2)
else 0) / (1 + (q : ℝ) / L)) :
(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