Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Small-denominator exponential-sum source envelope

Proved
TaoFivePrimes.exp_sum_estimate_small_q_source_envelope

by marwahaha · Sep 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorycircle-methodexponential-sumsgoldbachnumber-theorytao-five-primes

Let x≥1020x\ge10^{20}x≥1020 and let 4α=a/q+β4\alpha=a/q+\beta4α=a/q+β, where 100≤q≤x/100100\le q\le x/100100≤q≤x/100, (a,q)=1(a,q)=1(a,q)=1, ∣β∣≤q−2|\beta|\le q^{-2}∣β∣≤q−2, and q≤x1/3q\le x^{1/3}q≤x1/3. If every prime factor of q0q_0q0​ is at most x\sqrt{x}x​, then the smoothed exponential sum obeys the Section 6 source envelope

∣Sη0,q0(x,α)∣≤xqlog⁡(2x)[0.5log⁡(2xq2+4)+0.9(8+log⁡q)]+(0.301log⁡2q+2.66log⁡q)xq+20.16x.\begin{aligned}|S_{\eta_0,q_0}(x,\alpha)|\le{}&\frac{x}{q}\log(2x)\left[0.5\log\left(\frac{2x}{q^2}+4\right)+0.9(8+\log q)\right]\\&+(0.301\log^2q+2.66\log q)\frac{x}{\sqrt q}+20.16\sqrt x.\end{aligned}∣Sη0​,q0​​(x,α)∣≤​qx​log(2x)[0.5log(q22x​+4)+0.9(8+logq)]+(0.301log2q+2.66logq)q​x​+20.16x​.​

The first two terms are Tao's bound after applying Theorem 5.1 with U=x/q2U=x/q^2U=x/q2 and V=qV=qV=q. The final explicit term safely transfers the modulus-222 estimate to q0q_0q0​ using Lemma 4.1 twice.

Preamble
import Definitions.Def_TaoFivePrimes_SmoothedExpSum
import Definitions.Def_TaoFivePrimes_RepresentationCount
import Mathlib.Analysis.SpecialFunctions.Pow.Real
Formal statement
namespace TaoFivePrimes

theorem exp_sum_estimate_small_q_source_envelope
    (x alpha beta : ℝ) (a : ℤ) (q q0 : ℕ)
    (hx : (10 : ℝ) ^ 20 ≤ x)
    (hq : 100 ≤ q) (hqx : (q : ℝ) ≤ x / 100)
    (haq : Nat.Coprime a.natAbs q)
    (halpha : 4 * alpha = (a : ℝ) / q + beta)
    (hbeta : |beta| ≤ 1 / (q : ℝ) ^ 2)
    (hq0 : ∀ p ∈ q0.primeFactors, (p : ℝ) ≤ Real.sqrt x)
    (hsmall : (q : ℝ) ≤ x ^ (1 / 3 : ℝ)) :
    ‖smoothedExpSum eta0 q0 x alpha‖ ≤
      (x / q) * Real.log (2 * x) *
          (0.5 * Real.log (2 * x / (q : ℝ) ^ 2 + 4) +
            0.9 * (8 + Real.log q)) +
        (0.301 * Real.log q ^ 2 + 2.66 * Real.log q) *
          (x / Real.sqrt q) +
        20.16 * Real.sqrt x := by
  sorry

end TaoFivePrimes
Source
Terence Tao, Every odd number greater than 1 is the sum of at most five primes, arXiv:1201.6656v4, Lemma 4.1, Theorem 5.1 (equations 5.4-5.6), and Section 6 derivation of equation (1.10), 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, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me