Sharp explicit constants in the reciprocal base denominator expansion
OpenPrimePairSieve.reciprocal_base_denominator_quadratic_expansion_sharpStatement
Let denote the reciprocal (logarithmically averaged) base denominator
put
let be Euler's constant, and let be the twin-prime singular constant.
The theorem states that there exist real numbers and with
such that for every real
Meaning of the constants
This is the explicit-constants, numerically sharp version of the platform node PrimePairSieve.reciprocal_base_denominator_quadratic_expansion (the logarithmic average of the base sieve denominator), which is exactly the denominator that appears in the application of the large sieve to prime pairs.
- The centre is the same quadratic asymptotic as in the ordinary base sum, with the logarithmic shift that arises from the kernel . The optimal expansion constant is , numerically ; hence is admissible.
- The true maximal size of the normalized error is only (attained near ), so is admissible with a factor to spare.
A direct numerical check (both at all integers and on a grid of step for , step up to , step up to ) gives .
Route
Provable from PrimePairSieve.base_denominator_quadratic_expansion_sharp together with the pure-analysis transfer estimate for
obtained by writing and inserting the errors of the ordinary expansion; the constant loss is , so the sharp estimate for yields for (and in particular ).
Reference
H. Riesel and R. C. Vaughan, On sums of primes, Arkiv för Matematik 21 (1983), 46--74, eqs. (3.6)--(3.10); explicit sharp version of the platform node PrimePairSieve.reciprocal_base_denominator_quadratic_expansion.
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_quadratic_expansion_sharp :
∃ B E : ℝ, 0 ≤ E ∧ E ≤ 10 / 3 ∧ (-(3 / 2) : ℝ) ≤ 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 sorry
end PrimePairSieve