Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sine-sensitive bound for the double-box zero kernel

Proved
TaoFivePrimes.oscillatory_smoothed_zero_kernel_bound

by Johan Mercedes · Oct 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisexplicit-estimatesriemann-zetatao-five-primes

Let a,h>0a,h>0a,h>0 with 2h≤a2h\le a2h≤a, and let ρ=β+iγ\rho=\beta+i\gammaρ=β+iγ satisfy 0≤β≤10\le\beta\le10≤β≤1 and γ≠0\gamma\ne0γ=0. For the double-box zero kernel

K(a,h,ρ)=(a+2h)ρ+2−2(a+h)ρ+2+aρ+2h2ρ(ρ+1)(ρ+2),K(a,h,\rho)=\frac{(a+2h)^{\rho+2}-2(a+h)^{\rho+2}+a^{\rho+2}}{h^2\rho(\rho+1)(\rho+2)},K(a,h,ρ)=h2ρ(ρ+1)(ρ+2)(a+2h)ρ+2−2(a+h)ρ+2+aρ+2​,

put r=h/(a+h)r=h/(a+h)r=h/(a+h). Then

∣K(a,h,ρ)∣≤(a+2h)β+2h2∣γ∣3(4sin⁡2(γr/2)+8r+3∣γ∣r2).|K(a,h,\rho)|\le\frac{(a+2h)^{\beta+2}}{h^2|\gamma|^3} \left(4\sin^2(\gamma r/2)+8r+3|\gamma|r^2\right).∣K(a,h,ρ)∣≤h2∣γ∣3(a+2h)β+2​(4sin2(γr/2)+8r+3∣γ∣r2).

This retains the oscillation in the central second difference instead of replacing it by its maximum value.

Preamble
import Definitions.Def_dusart_psi_433_20261014_SmoothedFormula
import Mathlib.Tactic
Formal statement
theorem TaoFivePrimes.oscillatory_smoothed_zero_kernel_bound
    (a h : ℝ) (ρ : ℂ) (ha : 0 < a) (hh : 0 < h) (hsmall : 2*h ≤ a)
    (hβ0 : 0 ≤ ρ.re) (hβ1 : ρ.re ≤ 1) (hγ : 0 < |ρ.im|) :
    ‖DusartSmoothing.smoothedZeroKernel a h ρ‖ ≤
      (a+2*h)^(ρ.re+2)/(h^2*|ρ.im|^3) *
        (4*(Real.sin (ρ.im*(h/(a+h))/2))^2 + 8*(h/(a+h)) +
          3 * |ρ.im| * (h/(a+h))^2) := by sorry
Source
The double-box zero kernel is the published Dusart smoothing formalization, attributed there to Pierre Dusart, Estimates of Some Functions Over Primes without R.H., Theorem 45 and Lemmas 47–55. The sine-sensitive inequality is an elementary supporting estimate developed for the Tao five-primes Chebyshev-error reduction.

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