An explicit upper bound 1.4 for the prime-sieve constant
ProvedHelfgott.prime_sieve_constant_upper_14explicit-boundsgoldbachlarge-sieveminor-arcs
The additive constant in the prime-sieve asymptotic formula satisfies
Here is Euler's constant. This is a conservative rigorous upper bound for the constant in Helfgott's equation (5.14), suitable for explicit sieve estimates; it is not the sharper decimal approximation quoted in that equation.
Preamble
import Mathlib.NumberTheory.Harmonic.EulerMascheroni import Mathlib.Data.Nat.Prime.Defs open scoped BigOperators
Formal statement
theorem Helfgott.prime_sieve_constant_upper_14 : Real.eulerMascheroniConstant +
(∑' p : Nat.Primes, Real.log (p : ℕ) /
(((p : ℕ) : ℝ) * (((p : ℕ) : ℝ)-1))) ≤ (7/5 : ℝ) := by sorrySource
H. A. Helfgott, The ternary Goldbach conjecture is true, arXiv:1312.7748v2, Section 5.2, equation (5.14), defining c_E and quoting its sharper approximation 1.3325822.... This proof independently certifies the weaker upper bound 1.4 through finite logarithmic bounds and an elementary telescoping tail estimate. https://arxiv.org/html/1312.7748v2