An endpoint certificate controls the reciprocal sieve threshold on a real interval
ProvedPrimePairSieve.reciprocal_base_denominator_interval_certificatenumber-theorysieve-theoryverified-computation
Let be the literal reciprocal squarefree-weight denominator, with , for odd primes and zero weight on nonsquarefree integers. For real endpoints , choose a logarithm upper bound and set , . If and the endpoint certificate
holds, then the public reciprocal sieve threshold holds at every real . The theorem uses the existing certified lower bound for the twin-prime constant. It converts endpoint certificates into coverage of an entire real interval, including natural-floor jumps. It does not supply the individual numerical endpoint certificates.
Preamble
import Definitions.Def_TaoFivePrimes_SingularSeries import Mathlib.Data.Nat.Prime.Basic import Mathlib.Data.Nat.Squarefree import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Algebra.Order.Floor.Semifield import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.NumberTheory.Harmonic.EulerMascheroni import Mathlib.Topology.Algebra.InfiniteSum.Real open scoped BigOperators set_option autoImplicit false
Formal statement
theorem PrimePairSieve.reciprocal_base_denominator_interval_certificate
(L U ell z : ℝ) (hL : 40 ≤ L) (hLz : L ≤ z) (hzU : z ≤ U)
(hlog : Real.log (4 * U) ≤ ell)
(hpositive : ((L + 1) / (16 * L ^ 2)) * (ell ^ 2 / (5 / 2)) < 1)
(hcertificate : ell ^ 2 / (5 / 2) /
(1 - ((L + 1) / (16 * L ^ 2)) * (ell ^ 2 / (5 / 2))) ≤
∑ 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 sorrySource
Reusable real-interval comparison underlying the exact-rational finite-window exploration in the five-primes mission. New formal consequence of nonnegative literal weights, natural-floor monotonicity, logarithm monotonicity and the Proved sieve_constants_certificate. No unproved finite-window assertion is imported.