Dirichlet-regime bound for the smoothed prime sum
ProvedTaoFivePrimes.smoothedExpSum_dirichlet_bound_005analytic-number-theorycircle-methodexponential-sumsnumber-theoryprime-numberstao-five-primes
Let , put , and let have circle distance
For the logarithmic cutoff and the primorial sifting modulus , prove
This is the pure exponential-sum estimate in the Dirichlet regime of Tao's Section 8. Choose , split according to , , or , and apply the explicit bounds (1.10), (1.9), and (1.12), respectively. At the stated endpoints the three corrected coefficients are below , , and , each safely below .
Preamble
import Mathlib import Definitions.Def_TaoFivePrimes_ArcSplit import Definitions.Def_TaoFivePrimes_SmoothedExpSum open TaoFivePrimes
Formal statement
namespace TaoFivePrimes
theorem smoothedExpSum_dirichlet_bound_005 (x : ℕ)
(h1 : 87 * 10 ^ 35 ≤ x) (h2 : (x : ℝ) ≤ Real.exp 3100)
(theta : ℝ)
(hlo : 1000 * T0 / (4 * Real.pi * x) < ‖(theta : AddCircle (1 : ℝ))‖)
(hhi : ‖(theta : AddCircle (1 : ℝ))‖ < 32 / (4 * 10 ^ 14)) :
‖smoothedExpSum eta0 (primorial (Nat.sqrt (x / 1000)))
((x : ℝ) / 1000) theta‖ ≤ 0.05 * (x : ℝ) / 1000 := by sorry
end TaoFivePrimesSource
Terence Tao, Every odd number greater than 1 is the sum of at most five primes, Mathematics of Computation 83 (2014), 997–1038; arXiv:1201.6656v4, Section 8, Dirichlet-regime calculation (8.19)–(8.20), pp. 35–36, applying Theorem 1.3 estimates (1.10), (1.9), and (1.12). https://arxiv.org/html/1201.6656v4#S8. The displayed (8.20) has an extra factor x; the surrounding derivation and three case bounds have the dimensionally correct x/K scale. The formal statement uses K=1000, the corrected x/K scale, the mission split 32/N0, and coefficient 0.05, supported by the same endpoint calculations with the published 1.2 and 2.4 constants in (1.12).