Certified upper bound for the prime second logarithmic moment
ProvedPrimePairSieve.prime_second_logarithmic_moment_upper_boundnumber-theorysieve-theoryverified-computation
The positive prime logarithmic moment
is at most . The bound includes the prime . It supplies numerical control of the constant term in the ordinary and reciprocal prime-pair sieve expansions.
Preamble
import Mathlib open scoped BigOperators set_option autoImplicit false
Formal statement
theorem PrimePairSieve.prime_second_logarithmic_moment_upper_bound :
(∑' p : Nat.Primes,
(8*(p:ℝ)^2-10*(p:ℝ)+4)/((p:ℝ)^2*((p:ℝ)-1)^2)*Real.log (p:ℝ)^2) ≤ 8 := by sorrySource
A new rational numerical bound for the moment appearing in the proved PrimePairSieve.base_correction_second_logarithmic_moment and ordinary explicit expansion. Finite logarithm bounds and finite sum/integral comparisons from Mathlib; numerical constant chosen for the reciprocal-denominator tail comparison. Context: Riesel and Vaughan, On sums of primes (1983), Lemmas 2-3.