Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Archimedean integral bound for quarter-support Proposition 7.2

Proved
TaoFivePrimes.prop72_archimedean_integral_bound

by raresbuhai · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

explicit-formulanumber-theorytao-five-primes

Let η\etaη be smooth and nonnegative, supported on [1/4,1][1/4,1][1/4,1], let y≥4000y\ge4000y≥4000, and let θ∈R\theta\in\mathbb Rθ∈R. The archimedean integral appearing in the von Mangoldt explicit formula satisfies

∣y∫Rη(t)e(θyt)(yt)3−yt dt∣≤128y2∫Rη(t) dt.\left|y\int_{\mathbb R}\frac{\eta(t)e(\theta yt)}{(yt)^3-yt}\,dt\right|\le\frac{128}{y^2}\int_{\mathbb R}\eta(t)\,dt.​y∫R​(yt)3−ytη(t)e(θyt)​dt​≤y2128​∫R​η(t)dt.

This is the c=1/4c=1/4c=1/4 specialization of the 2c−3y−2∥η∥12c^{-3}y^{-2}\lVert\eta\rVert_12c−3y−2∥η∥1​ term in Tao's proof of Proposition 7.2. It is an unconditional component of the existing quarter-support major-arc source; it does not require a frequency restriction or any RH premise.

Preamble
import Definitions.Def_TaoFivePrimes_Prop72ZeroTerms
import Mathlib.Analysis.Calculus.ContDiff.Defs
open MeasureTheory
Formal statement
theorem TaoFivePrimes.prop72_archimedean_integral_bound
    (eta : ℝ → ℝ) (hsmooth : ContDiff ℝ (⊤ : ℕ∞) eta)
    (hnonneg : ∀ t, 0 ≤ eta t)
    (hsupp : ∀ t, eta t ≠ 0 → t ∈ Set.Icc (1 / 4 : ℝ) 1)
    (y : ℝ) (hy : 4000 ≤ y) (theta : ℝ) :
    ‖(y : ℂ) * (∫ t : ℝ, (eta t : ℂ) * TaoFivePrimes.expCircle (theta * y * t) /
      (((y * t) ^ 3 - y * t : ℝ) : ℂ))‖ ≤
      (128 / y ^ 2) * (∫ t : ℝ, eta t) := by sorry
Source
Terence Tao, Every odd number greater than 1 is the sum of at most five primes, arXiv:1201.6656v4, Section 7, Proposition 7.1 equation (7.1), and the archimedean bound 2c−3x−2∣∣eta∣∣12c^{-3}x^{-2}||eta||_12c−3x−2∣∣eta∣∣1​ at the start of the proof of Proposition 7.2. https://arxiv.org/html/1201.6656v4

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