Tao Lemma 3.1 (3.1): the trapezoidal rule for a smooth compactly supported cutoff
ProvedTaoFivePrimes.sum_sub_integral_le_half_deriv_L1analytic-number-theoryexponential-sumsgoldbachnumber-theory
Throughout, is smooth and compactly supported and .
The trapezoidal rule for the integer lattice:
In the source this is written , with a quantity of absolute value at most .
This is the first of the three bounds of Lemma 3.1. It is what converts a discrete cutoff sum into its continuous counterpart with a controlled error, and in that form it supplies the denominator of Proposition 4.8.
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_sub_integral_le_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.1)