Tao Lemma 4.1: the smoothed prime exponential sum barely depends on the sifting modulus
ProvedTaoFivePrimes.smoothedExpSum_modulus_changeanalytic-number-theoryexponential-sumsgoldbachnumber-theory
For a cutoff , a modulus , a scale and a frequency , write
where is the von Mangoldt function and .
The sum barely depends on the sifting modulus: if vanishes on and everywhere, then for and
where is the number of distinct prime factors of .
The point of the lemma is that the modulus is only of minor technical importance and can be removed at negligible cost; in the source it is what justifies ignoring at a first reading. When every prime factor of is at most it specialises, via an explicit bound on , to an error of size .
Preamble
import Mathlib import Definitions.Def_TaoFivePrimes_SmoothedExpSum
Formal statement
theorem TaoFivePrimes.smoothedExpSum_modulus_change
(eta : ℝ → ℝ) (M : ℝ) (q₀ : ℕ) (x alpha : ℝ)
(hq : 0 < q₀) (hx : 1 ≤ x)
(hM : ∀ t : ℝ, |eta t| ≤ M)
(hsupp : ∀ t : ℝ, 1 < t → eta t = 0) :
‖TaoFivePrimes.smoothedExpSum eta q₀ x alpha
- TaoFivePrimes.smoothedExpSum eta 1 x alpha‖
≤ (q₀.primeFactors.card : ℝ) * M * Real.log x := by sorrySource
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.6656, https://arxiv.org/abs/1201.6656, Section 4, Lemma 4.1