Explicit BV eta0 major-arc error before numerical specialization
OpenTaoFivePrimes.eta0_prop72_bv_explicit_errorexponential-sumsnumber-theorytao-five-primes
Put and let be Tao's logarithmic triangular cutoff, supported on . For every real and , the modulus-one von Mangoldt sum satisfies
This is the explicit analytic input before the large-scale numerical specialization in Section 8. The constants retain , , and total variation , together with the verified-height zero count . The theorem includes the verification-height input and the limiting argument extending the smooth Proposition 7.2 to this literal nonsmooth cutoff. In particular, the smooth proposition alone is not a proof. The coefficient is retained exactly; the printed subsequent comparison with is not used.
Preamble
import Definitions.Def_TaoFivePrimes_ArcSplit import Definitions.Def_TaoFivePrimes_SmoothedExpSum
Formal statement
theorem TaoFivePrimes.eta0_prop72_bv_explicit_error
(y : ℝ) (hy : 4000 ≤ y) (theta : ℝ)
(hup : |theta| ≤ TaoFivePrimes.T0 / (4 * Real.pi * y)) :
‖TaoFivePrimes.smoothedExpSum TaoFivePrimes.eta0 1 y theta -
(y : ℂ) * ∫ t : ℝ, (TaoFivePrimes.eta0 t : ℂ) *
TaoFivePrimes.expCircle (theta * y * t)‖ ≤
((252 + 256 * Real.log 2) * Real.log TaoFivePrimes.T0 /
(3 * TaoFivePrimes.T0)) * y +
((402 : ℝ) / 100 * 10 ^ 10) * Real.sqrt y := by sorrySource
T. Tao, Every odd number greater than 1 is the sum of at most five primes, arXiv:1201.6656v4, Proposition 7.2, equations (7.3)-(7.4), printed p.34; cutoff norms (5.9), (5.11), (5.13), printed p.26, and preceding mollification convention; Section8 eta0 specialization, printed p.38. https://arxiv.org/pdf/1201.6656