Small-denominator exponential-sum source envelope
ProvedTaoFivePrimes.exp_sum_estimate_small_q_source_envelopeanalytic-number-theorycircle-methodexponential-sumsgoldbachnumber-theorytao-five-primes
Let and let , where , , , and . If every prime factor of is at most , then the smoothed exponential sum obeys the Section 6 source envelope
The first two terms are Tao's bound after applying Theorem 5.1 with and . The final explicit term safely transfers the modulus- estimate to using Lemma 4.1 twice.
Preamble
import Definitions.Def_TaoFivePrimes_SmoothedExpSum import Definitions.Def_TaoFivePrimes_RepresentationCount import Mathlib.Analysis.SpecialFunctions.Pow.Real
Formal statement
namespace TaoFivePrimes
theorem exp_sum_estimate_small_q_source_envelope
(x alpha beta : ℝ) (a : ℤ) (q q0 : ℕ)
(hx : (10 : ℝ) ^ 20 ≤ x)
(hq : 100 ≤ q) (hqx : (q : ℝ) ≤ x / 100)
(haq : Nat.Coprime a.natAbs q)
(halpha : 4 * alpha = (a : ℝ) / q + beta)
(hbeta : |beta| ≤ 1 / (q : ℝ) ^ 2)
(hq0 : ∀ p ∈ q0.primeFactors, (p : ℝ) ≤ Real.sqrt x)
(hsmall : (q : ℝ) ≤ x ^ (1 / 3 : ℝ)) :
‖smoothedExpSum eta0 q0 x alpha‖ ≤
(x / q) * Real.log (2 * x) *
(0.5 * Real.log (2 * x / (q : ℝ) ^ 2 + 4) +
0.9 * (8 + Real.log q)) +
(0.301 * Real.log q ^ 2 + 2.66 * Real.log q) *
(x / Real.sqrt q) +
20.16 * Real.sqrt x := by
sorry
end TaoFivePrimesSource
Terence Tao, Every odd number greater than 1 is the sum of at most five primes, arXiv:1201.6656v4, Lemma 4.1, Theorem 5.1 (equations 5.4-5.6), and Section 6 derivation of equation (1.10), https://arxiv.org/html/1201.6656v4