Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tao Corollary 3.2 (second bound): the odd-integer summation-by-parts estimate

Proved
TaoFivePrimes.sum_odd_exp_le_deriv_L1_div_sin

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.

Let α∈R\alpha\in\mathbb Rα∈R with sin⁡(2πα)≠0\sin(2\pi\alpha)\neq0sin(2πα)=0. Then

∣∑m∈ZF(2m+1) e(α(2m+1))∣  ≤  ∥F′∥L1(R)2 ∣sin⁡(2πα)∣.\Bigl|\sum_{m\in\mathbb Z}F(2m+1)\,e\bigl(\alpha(2m+1)\bigr)\Bigr|\;\le\;\frac{\|F'\|_{L^1(\mathbb R)}}{2\,|\sin(2\pi\alpha)|}.​m∈Z∑​F(2m+1)e(α(2m+1))​≤2∣sin(2πα)∣∥F′∥L1(R)​​.

This is the second half of Corollary 3.2: the odd-restricted form of the decaying bound of Lemma 3.1, in which the frequency α\alphaα is replaced by 2α2\alpha2α in the denominator. It is the estimate used for the odd-restricted exponential sums of 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
import Definitions.Def_TaoFivePrimes_Explicit

open MeasureTheory
Formal statement
theorem TaoFivePrimes.sum_odd_exp_le_deriv_L1_div_sin
    (F : ℝ → ℂ) (hF : ContDiff ℝ (⊤ : ℕ∞) F) (hc : HasCompactSupport F) (alpha : ℝ)
    (halpha : Real.sin (2 * Real.pi * alpha) ≠ 0) :
    ‖∑' m : ℤ, F (((2 * m + 1 : ℤ) : ℝ)) * TaoFivePrimes.eR (alpha * ((2 * m + 1 : ℤ) : ℝ))‖
      ≤ (∫ y : ℝ, ‖deriv F y‖) / (2 * |Real.sin (2 * Real.pi * alpha)|) := 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, second 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