Explicit reciprocal sieve denominator expansion from proved ordinary constants
ProvedPrimePairSieve.reciprocal_base_denominator_quadratic_expansion_explicit_certifiedexplicit-constantssieve-theorytao-five-primes
Let be Euler's constant, , , , and let be the twin-prime constant with its factor-two normalization. Define
For squarefree n put , where and for odd primes; put otherwise. There exist fixed and such that every satisfies
This gives an explicit reciprocal error constant from the already proved ordinary error bound 600, with the transformed constant term retained. It does not assert the stronger coefficient 10/3 or the threshold for every z at least 40.
Preamble
import Mathlib import Definitions.Def_TaoFivePrimes_SingularSeries open scoped BigOperators set_option autoImplicit false
Formal statement
theorem PrimePairSieve.reciprocal_base_denominator_quadratic_expansion_explicit_certified :
∃ B E : ℝ, 0 ≤ E ∧ E ≤ (127185 / 154 : ℝ) ∧
(2 * Real.eulerMascheroniConstant^2 +
4 * Real.eulerMascheroniConstant *
(2 * (∑' p : Nat.Primes,
Real.log (p : ℝ) / ((p : ℝ) * ((p : ℝ) - 1))) + Real.log 2 / 2) +
((2 * (∑' p : Nat.Primes,
Real.log (p : ℝ) / ((p : ℝ) * ((p : ℝ) - 1))) + Real.log 2 / 2)^2 +
(1 / 4 : ℝ) * Real.log 2^2 -
(∑' p : Nat.Primes,
(8 * (p : ℝ)^2 - 10 * (p : ℝ) + 4) /
((p : ℝ)^2 * ((p : ℝ) - 1)^2) * Real.log (p : ℝ)^2)) -
(4 * Real.eulerMascheroniConstant +
4 * (∑' p : Nat.Primes, Real.log (p : ℝ) / ((p : ℝ) * ((p : ℝ) - 1))) +
Real.log 2) * Real.log 2 + Real.pi ^ 2 / 6 ≤ B) ∧
(∀ z : ℝ, 0 < z →
|(∑ n ∈ Finset.Icc 1 ⌊z⌋₊,
(if Squarefree n then
∏ p ∈ n.primeFactors, if p = 2 then (1 : ℝ) else 2 / ((p : ℝ) - 2)
else 0) / (1 + (n : ℝ) / z)) -
(Real.log z^2 +
(4 * Real.eulerMascheroniConstant +
4 * (∑' p : Nat.Primes,
Real.log (p : ℝ) / ((p : ℝ) * ((p : ℝ) - 1))) - Real.log 2) *
Real.log z + B) / (2 * TaoFivePrimes.twinPrimeConstant)| ≤
E * z ^ (-(1 / 3 : ℝ))) := by sorrySource
Proved ordinary input PrimePairSieve.base_denominator_quadratic_expansion_explicit (7d596122-b196-4342-b0e2-4582e418b754), transferred through the certified finite reciprocal-weight theorem. This is a new explicit consequence of proved inputs; it is not a quotation of the source paper's sharpest bounds. Context: Riesel and Vaughan, On sums of primes (1983), Lemmas 2-3.