Remaining reciprocal sieve threshold on [50000,2000000]
ProvedPrimePairSieve.reciprocal_base_denominator_finite_middle_50000_2000000finite-verificationnumber-theorysieve-theory
Let be the mission's twin-prime constant, and let be zero for non-squarefree and otherwise the product over prime factors with factor at and at each odd prime . The remaining finite assertion is that, for every real ,
This is an explicitly Open obligation. It is the exact restriction of the existing finite-middle target to the range above 50,000. The real variable, natural floor, constant, correction term, and literal weights are unchanged. Once the low intervals are certified, this is the numerical gap before the already Proved infinite tail beginning at two million. An external arithmetic study is not a formal proof of this input.
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
Formal statement
namespace PrimePairSieve
theorem reciprocal_base_denominator_finite_middle_50000_2000000 :
∀ z : ℝ, 50000 ≤ z → z ≤ 2000000 →
(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
Source
Exact bounded restriction of https://prove2.me/theorems/36283906-8ebc-4f82-8939-6473c0c94b3f