A 0.389 sieve quotient bound up to modulus ten million
ProvedHelfgott.prime_sieve_small_range_uniform_0389explicit-boundsgoldbachlarge-sieveminor-arcs
For a positive integer , let
If
then
This explicit bound combines the separated-product sieve inequality with a large-scale lower bound for the denominator and a finite Euler product estimate. It handles the stated parameter range only; larger numerator scales still require separate estimates.
Preamble
import Definitions.Def_Helfgott_PrimeSieveData open Helfgott
Formal statement
theorem Helfgott.prime_sieve_small_range_uniform_0389 (q : ℕ) (hq : 0 < q) (hqmax : q ≤ 10000000)
(R S : ℝ) (hR : 1 ≤ R) (hRmax : R ≤ 58) (hSlarge : 125000000 ≤ S) :
primeSieveG q R / primeSieveG q (R * S) ≤ (389 / 1000 : ℝ) := by sorrySource
Derived numerical consequence of Helfgott, The ternary Goldbach conjecture is true, arXiv:1312.7748v2, Section 5.2, equation (5.19), and the large-scale portion of the lower bound (5.15), with an exact finite prime-product bound. The constant 0.389 and these ranges are derived here, not quoted from the paper. https://arxiv.org/html/1312.7748v2