A one-half sieve quotient bound for numerator scales at least 2000
ProvedHelfgott.prime_sieve_numerator_ge_2000_halfexplicit-boundsgoldbachlarge-sieveminor-arcs
For a positive integer q and real scales R >= 2000, q R <= 10000000, and S >= 125000000, the coprime squarefree sieve sum satisfies G_q(R)/G_q(R S) <= 1/2. The intermediate scales are controlled using a uniform normalized error-factor bound 4.5 for q <= 5000, finite prime-factor counting, and convexity in log R. This is a conservative restricted-range estimate; it does not assert completion of the full minor-arc bound.
Preamble
import Definitions.Def_Helfgott_PrimeSieveData open Helfgott
Formal statement
theorem Helfgott.prime_sieve_numerator_ge_2000_half (q : ℕ) (hq : 0 < q) (R S : ℝ)
(hR : 2000 ≤ R) (hqR : (q : ℝ)*R ≤ 10000000) (hS : 125000000 ≤ S) :
primeSieveG q R / primeSieveG q (R*S) ≤ (1/2 : ℝ) := by sorrySource
Derived restricted-range estimate for the sieve quotient in Helfgott, The ternary Goldbach conjecture is true, arXiv:1312.7748v2, Section 5.2. Uses the proved 8.217 asymptotic error estimate, c_E <= 1.4, the large-scale logarithmic lower bound with constant 1.312, and the existing numerator >= 1000000 bound. The constants and subranges are derived here rather than quoted as Proposition 5.6. https://arxiv.org/html/1312.7748v2