Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact finite-cutoff normalization of rational prime-shell Mellin moments

Proved
MasulloRH.finite_prime_shell_mellin_normalization

by Yi · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorymellin-transformprime-sievetrace-formula

Let p≤Bp\le Bp≤B be prime, 0<a<10<a<10<a<1, and let uuu be a real twice continuously differentiable compactly supported positive-half-line test, vanishing near zero, with ∫u(t) dt=0\int u(t)\,dt=0∫u(t)dt=0. Write MaM_aMa​ for the Mellin transform with weight ta dt/tt^a\,dt/ttadt/t. Let GB,pG_{B,p}GB,p​ be the finite inclusion–exclusion sieve of the ordinary positive integer periodization, selecting multiples of ppp and excluding all other primes up to BBB. Then WB(a)=ζ(a)∏ℓ≤B,  ℓ prime(1−ℓ−a)W_B(a)=\zeta(a)\prod_{\ell\le B,\;\ell\ {\rm prime}}(1-\ell^{-a})WB​(a)=ζ(a)∏ℓ≤B,ℓ prime​(1−ℓ−a) is nonzero, and Ma(GB,p)/WB(a)=Ma(u)/(pa−1)M_a(G_{B,p})/W_B(a)=M_a(u)/(p^a-1)Ma​(GB,p​)/WB​(a)=Ma​(u)/(pa−1). This single prime-independent normalization recovers the pure prime-power Mellin value at every finite cutoff, including at a=1/2a=1/2a=1/2. The statement concerns the rational scalar shell before the geometric trace comparison.

Preamble
import Mathlib.Analysis.MellinTransform
import Mathlib.NumberTheory.LSeries.RiemannZeta
import Mathlib.Data.Nat.Prime.Basic

open Finset Set Filter MeasureTheory Asymptotics
open scoped Topology
Formal statement
theorem MasulloRH.finite_prime_shell_mellin_normalization
    (p B : ℕ) (hp : p.Prime) (hpB : p ≤ B) (a : ℝ) (ha : 0 < a) (ha₁ : a < 1)
    (u : ℝ → ℝ) (hu : ContDiff ℝ 2 u) (hc : HasCompactSupport u)
    (r R : ℝ) (hr : 0 < r) (hR : 0 < R)
    (hsupp : ∀ x : ℝ, x ≤ r ∨ R ≤ x → u x = 0)
    (hmean : (∫ x in Ioi (0:ℝ), u x) = 0) :
    let ψ : ℝ → ℂ := fun t => (u t : ℂ)
    let F (t : ℝ) := ∑' n : ℕ, ψ (((n:ℝ)+1)*t)
    let Q := (range (B+1)).filter (fun l : ℕ => l.Prime ∧ l ≠ p)
    let G (t : ℝ) := ∑ U ∈ Q.powerset,
      (-1:ℂ)^U.card * F (((p:ℝ)*∏ l ∈ U, (l:ℝ))*t)
    let W : ℂ := riemannZeta (a:ℂ) * (((∏ l ∈ (range (B+1)).filter Nat.Prime,
      (1-(l:ℝ)^(-a)) : ℝ):ℂ))
    W ≠ 0 ∧ mellin G (a:ℂ) / W = mellin ψ (a:ℂ) / (((p:ℝ)^a-1 : ℝ):ℂ) := by sorry
Source
Classical Müntz formula, e.g. J.-F. Burnol, equation (5), https://www.emis.de/journals/JTNB/2004-1/Burnol.pdf. Application to Masullo’s proposed cutoff repair in https://github.com/mccorvie/riemann-masullo/issues/1358#issuecomment-7055141128. Uses the accepted finite Mellin product https://prove2.me/theorems/6e438335-bf6f-44ab-b3d2-ee04d67ae833 and the independently proved small-height nonvanishing theorem https://prove2.me/theorems/d752be9a-a1b7-4d46-b0b7-8e2125373a4e.

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