Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sine-sensitive contribution from one positive zero bin

Proved
TaoFivePrimes.sine_weight_positive_bin_bound_65000

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

explicit-estimatesriemann-zetatao-five-primes

Let 0≤i<1800\le i<1800≤i<180, Li=65000+1290iL_i=65000+1290iLi​=65000+1290i, Ui=Li+1290U_i=L_i+1290Ui​=Li​+1290, and 1/2151≤r≤1/21491/2151\le r\le1/21491/2151≤r≤1/2149. Let ZZZ be a finite set of nontrivial zeta zeros with Li<Im⁡ρ≤UiL_i<\operatorname{Im}\rho\le U_iLi​<Imρ≤Ui​, and let mρm_\rhomρ​ be the analytic multiplicity. If tit_iti​ is the recorded integer weight bound for this bin, then

∑ρ∈Zmρ(Im⁡ρ)3min⁡ ⁣{4sin⁡2 ⁣(rIm⁡ρ2)+8r+3(Im⁡ρ)r2, 4}≤ti2⋅1021.\sum_{\rho\in Z}\frac{m_\rho}{(\operatorname{Im}\rho)^3} \min\!\left\{4\sin^2\!\left(\frac{r\operatorname{Im}\rho}{2}\right)+8r+3(\operatorname{Im}\rho)r^2,\,4\right\} \le\frac{t_i}{2\cdot10^{21}}.ρ∈Z∑​(Imρ)3mρ​​min{4sin2(2rImρ​)+8r+3(Imρ)r2,4}≤2⋅1021ti​​.

The factor 1/21/21/2 reflects that the bound concerns positive ordinates only.

Preamble
import Definitions.Def_dusart_psi_433_20261014_PsiZeroSum
import Definitions.Def_TaoFivePrimes_SineBinData65k
import Definitions.Def_TaoFivePrimes_SineBinArithmetic65k
import Mathlib.Tactic
open DusartSmoothing Complex Set
Formal statement
theorem TaoFivePrimes.sine_weight_positive_bin_bound_65000 (i : Fin 180) (r : ℝ) (hr0 : (1/2151:ℝ) ≤ r)
    (hr1 : r ≤ (1/2149:ℝ)) (Z : Finset ℂ)
    (hZ : ∀ ρ ∈ Z, RvM.IsNontrivialZero ρ ∧
      65000+1290*(i.val:ℝ) < ρ.im ∧ ρ.im ≤ 65000+1290*(i.val:ℝ)+1290) :
    (∑ ρ ∈ Z, (RvM.zeroMult ρ : ℝ) *
      ((min (4*(Real.sin (ρ.im*r/2))^2 + 8*r + 3*ρ.im*r^2) 4) / ρ.im^3)) ≤
      (TaoFivePrimes.sineBinTerm65k i.val:ℝ)/(2*10^21) := by sorry
Source
Combines the proved interval zero-count, sine-square enclosure, and exact rational weight certificates 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