Tao Corollary 3.2: restricting a smooth cutoff to the odd integers halves the term
ProvedTaoFivePrimes.sum_odd_norm_le_half_L1_add_half_deriv_L1analytic-number-theoryexponential-sumsgoldbachnumber-theory
Throughout, is smooth and compactly supported and .
Restricting the lattice to the odd integers halves the main term:
Since , the same quantity bounds .
This is the first half of Corollary 3.2, the odd-restricted companion of Lemma 3.1. Restricting to odd integers is what lets the paper work with sums over odd primes and save a factor of two throughout Sections 5 and 6.
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_odd_norm_le_half_L1_add_half_deriv_L1
(F : ℝ → ℂ) (hF : ContDiff ℝ (⊤ : ℕ∞) F) (hc : HasCompactSupport F) :
(∑' m : ℤ, ‖F (((2 * m + 1 : ℤ) : ℝ))‖)
≤ (1/2) * (∫ 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, Corollary 3.2, first bound