Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tao equation (s1): the logarithmic cutoff η0\eta_0η0​ has unit mass

Proved
TaoFivePrimes.eta0_L1_eq_one

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

analytic-number-theorygoldbachnumber-theory

Throughout, η0\eta_0η0​ is the Lipschitz cutoff of unit mass supported in [1/4,1][1/4,1][1/4,1] introduced in Section 1 of the source,

η0(t)  =  4(log⁡2−∣log⁡2t∣)+,(u)+=max⁡(0,u).\eta_0(t)\;=\;4\bigl(\log 2-|\log 2t|\bigr)_{+},\qquad (u)_{+}=\max(0,u).η0​(t)=4(log2−∣log2t∣)+​,(u)+​=max(0,u).

Its total mass is

∥η0∥L1(R)=∫Rη0(t) dt=1.\|\eta_0\|_{L^1(\mathbb R)}=\int_{\mathbb R}\eta_0(t)\,dt=1.∥η0​∥L1(R)​=∫R​η0​(t)dt=1.

The source records this together with the other norms of η0\eta_0η0​ for repeated use in the minor-arc estimates of Sections 5 and 6, where each of them enters an explicit constant.

Formalization Note Since η0≥0\eta_0\ge0η0​≥0, the L1L^1L1 norm is stated as the plain integral of η0\eta_0η0​ over R\mathbb RR.

Preamble
import Mathlib
import Definitions.Def_TaoFivePrimes_RepresentationCount

open MeasureTheory
Formal statement
theorem TaoFivePrimes.eta0_L1_eq_one :
    (∫ t : ℝ, TaoFivePrimes.eta0 t) = 1 := 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 5, equation (5.7)

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