Tao Lemma 3.1: a smooth cutoff sampled at the integers is bounded by its norms
ProvedTaoFivePrimes.sum_norm_le_L1_add_half_deriv_L1analytic-number-theoryexponential-sumsgoldbachnumber-theory
Throughout, is smooth and compactly supported and .
The form of the trapezoidal rule:
Since , this immediately bounds by the same quantity, which is the form in which the source states it.
This is the second of the three bounds of Lemma 3.1; it is the estimate used when no cancellation in the exponential is available, in particular for frequencies close to the origin.
Formalization Note The bi-infinite sum is an unconditional sum over , convergent because compact support leaves only finitely many nonzero terms.
Preamble
import Mathlib open MeasureTheory
Formal statement
theorem TaoFivePrimes.sum_norm_le_L1_add_half_deriv_L1
(F : ℝ → ℂ) (hF : ContDiff ℝ (⊤ : ℕ∞) F) (hc : HasCompactSupport F) :
(∑' n : ℤ, ‖F (n : ℝ)‖)
≤ (∫ y : ℝ, ‖F y‖) + (1/2) * ∫ y : ℝ, ‖deriv F y‖ := 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 3, Lemma 3.1, equation (3.2)