Uniform logarithmic-ratio and endpoint bounds for minor arcs
ProvedHelfgott.minor_arc_logarithmic_ratio_boundexplicit-boundsgoldbachlogarithmsminor-arcs
Put and, for , define
Then, uniformly for every positive real ,
These are the logarithmic-ratio estimate (7.38) and its numerical consequence (7.39) in Helfgott's minor-arc argument. Here . Taking gives the explicit expression for the endpoint coefficient in (7.37). The theorem does not assert the remaining exponential-sum or sieve estimates.
Preamble
import Mathlib.Analysis.SpecialFunctions.Log.Deriv import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Tactic.NormNum import Mathlib.Tactic.Linarith import Mathlib.Tactic.Positivity open Finset open scoped BigOperators set_option maxRecDepth 2000 set_option maxHeartbeats 800000
Formal statement
theorem Helfgott.minor_arc_logarithmic_ratio_bound (t : ℝ) (ht : 0 < t) :
let L := Real.log ((1000 / 167 : ℝ) * (2 : ℝ) ^ (1 / 3 : ℝ))
let f := ((4 / 3) * Real.log t - (4 * L - Real.log 3)) /
((2 / 15) * t - (2 / 3) * Real.log t + 2 * L)
f ≤ (9781309 / 500000000 : ℝ) ∧
(217 / 800 : ℝ) * Real.log (3 + f) + (8283 / 20000) ≤ (2231 / 3125) := by sorrySource
H. A. Helfgott, The ternary Goldbach conjecture is true, arXiv:1312.7748v2, Section 7.3, equations (7.37)-(7.39). https://arxiv.org/html/1312.7748v2 . The bound is uniform over all positive t, as stated after (7.38).