The reciprocal base denominator dominates the sieve threshold from z = 40
ProvedPrimePairSieve.reciprocal_base_denominator_dominates_thresholdStatement
Let
let be the twin-prime singular constant, and for put
The theorem states that for every real
Meaning
This is the endgame comparison for the large- route to TaoFivePrimes.siebert_prime_pair_bound. In that reduction, the sieve bound PrimePairSieve_prime_pair_count_base_reciprocal_bound gives, for and ,
so it suffices to know that dominates the threshold : the mild factor in is exactly what absorbs the additive term of the sieve bound (using and ), and then , which is the target expression.
The threshold first becomes approachable at : at the worst-case margin obtained from the sharp reciprocal expansion (, expansion constant , worst case combined) is … more precisely in these normalizations, and the difference is increasing in on ; with the true (not worst-case) error constant the margin is already, and grows like .
Route
Provable from PrimePairSieve.reciprocal_base_denominator_quadratic_expansion_sharp by a purely elementary comparison: with ,
and, after multiplying by , the required inequality becomes
The left side minus the right side equals , which is increasing for (the last term is decreasing there because , a consequence of ) and positive at once the constants are certified to a few decimals: , , , . All these bounds are provable by the same certificate-style finite computations used elsewhere in this project.
Reference
Endgame step for TaoFivePrimes.siebert_prime_pair_bound; 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.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
namespace PrimePairSieve
theorem reciprocal_base_denominator_dominates_threshold :
∀ z : ℝ, 40 ≤ z →
(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
end PrimePairSieve