A uniform 0.391 sieve quotient bound for small numerator ranges
ProvedHelfgott.prime_sieve_small_range_uniform_0391explicit-boundsgoldbachlarge-sieveminor-arcs
For a positive integer , define
Suppose that
Then the following uniform bound holds:
This is a conservative numerical consequence of the separated-product sieve inequality and the logarithmic lower bound for sieve sums. It controls the specified small numerator range only; it is not a complete uniform estimate for all the parameters in the minor-arc argument.
Preamble
import Definitions.Def_Helfgott_PrimeSieveData import Mathlib.Analysis.SpecialFunctions.Log.Basic open Helfgott Finset open scoped BigOperators Classical
Formal statement
theorem Helfgott.prime_sieve_small_range_uniform_0391 (q : ℕ) (hq : 0 < q) (hqmax : q ≤ 300000)
(R S : ℝ) (hR : 1 ≤ R) (hRmax : R ≤ 13) (hS : 1 < S)
(hlogS : 17 ≤ Real.log S) :
primeSieveG q R / primeSieveG q (R * S) ≤ (391 / 1000 : ℝ) := by sorrySource
Derived bound using H. A. Helfgott, The ternary Goldbach conjecture is true, arXiv:1312.7748v2, Section 5.2, equation (5.19), together with the logarithmic sieve lower bound and an exact finite prime-product estimate. The numerical constant 0.391 and these parameter restrictions are derived here, not quoted from the paper. https://arxiv.org/html/1312.7748v2