Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tao Corollary 3.2: restricting a smooth cutoff to the odd integers halves the L1L^1L1 term

Proved
TaoFivePrimes.sum_odd_norm_le_half_L1_add_half_deriv_L1

by Hartmann_Psi · Sep 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theoryexponential-sumsgoldbachnumber-theory

Throughout, F:R→CF:\mathbb R\to\mathbb CF:R→C is smooth and compactly supported and e(t)=e2πite(t)=e^{2\pi i t}e(t)=e2πit.

Restricting the lattice to the odd integers halves the main term:

∑m∈Z∣F(2m+1)∣  ≤  12 ∥F∥L1(R)+12 ∥F′∥L1(R).\sum_{m\in\mathbb Z}\bigl|F(2m+1)\bigr|\;\le\;\tfrac12\,\|F\|_{L^1(\mathbb R)}+\tfrac12\,\|F'\|_{L^1(\mathbb R)} .m∈Z∑​​F(2m+1)​≤21​∥F∥L1(R)​+21​∥F′∥L1(R)​.

Since ∣e(α(2m+1))∣=1|e(\alpha(2m+1))|=1∣e(α(2m+1))∣=1, the same quantity bounds ∣∑mF(2m+1)e(α(2m+1))∣\bigl|\sum_{m}F(2m+1)e(\alpha(2m+1))\bigr|​∑m​F(2m+1)e(α(2m+1))​.

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 Z\mathbb ZZ, 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 sorry
Source
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

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me