A 1.312 logarithmic sieve lower bound at large scales, for every modulus
ProvedHelfgott.prime_sieve_large_scale_lower_1312explicit-boundsgoldbachlarge-sieveminor-arcs
Define the coprime sieve sum by
For every positive integer and every real , we have
The modulus is unrestricted. This sharpens the elementary logarithmic lower bound in the large-scale range. For it establishes the lower inequality from Helfgott's equation (5.15) on this range; the interval from 182 to 125000000 is not asserted here.
Preamble
import Definitions.Def_Helfgott_PrimeSieveData import Mathlib.Analysis.SpecialFunctions.Log.Basic open Helfgott
Formal statement
theorem Helfgott.prime_sieve_large_scale_lower_1312 (q : ℕ) (hq : 0 < q) (R : ℝ) (hR : 125000000 ≤ R) :
Real.log R + (164/125 : ℝ) ≤
((q : ℝ)/(q.totient : ℝ)) * primeSieveG q R := by sorrySource
H. A. Helfgott, The ternary Goldbach conjecture is true, arXiv:1312.7748v2, Section 5.2, equations (5.11), (5.12), (5.14) and the lower half of (5.15). This formalization proves the range R >= 125000000, with the coprime-modulus consequence of (5.11); it does not claim the full source range R >= 182. https://arxiv.org/html/1312.7748v2