Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The arithmetic half-weight shell has leading coefficient M(1/2), for a test with two vanishing moments

Proved
MasulloRH.translated_half_weight_prime_power_sum_and_nonvanishing

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

analytic-number-theorymellin-transformtrace-formula

Fix 0<a≤b0<a\le b0<a≤b and a real C1C^1C1 norm test fff with support compactly contained in (a,b)(a,b)(a,b). With Λ\LambdaΛ the actual von Mangoldt function and M\mathcal MM the Mellin transform, the normalized sum X−1/2∑aX<n≤bXΛ(n)n−1/2f(n/X)X^{-1/2}\sum_{aX<n\le bX}\Lambda(n)n^{-1/2} f(n/X)X−1/2∑aX<n≤bX​Λ(n)n−1/2f(n/X) converges to Mf(1/2)=∫abf(t)t−1/2 dt\mathcal M f(1/2)=\int_a^b f(t)t^{-1/2}\,dtMf(1/2)=∫ab​f(t)t−1/2dt as real X→∞X\to\inftyX→∞. This is the full prime-power side on these dilates. Moreover there is a single smooth real fff supported in (1,32)(1,32)(1,32) with Mf(1)=Mf(−1/2)=0\mathcal M f(1)=\mathcal M f(-1/2)=0Mf(1)=Mf(−1/2)=0 for which the unnormalized prime-power sum is at least cXc\sqrt XcX​, with c>0c>0c>0, for every sufficiently large XXX. The target is an arithmetic asymptotic relevant to the critical-width trace comparison.

Preamble
import Mathlib.Analysis.MellinTransform
import Mathlib.Analysis.SpecialFunctions.Pow.Deriv
import Mathlib.Analysis.SpecialFunctions.Sqrt
import Mathlib.MeasureTheory.Integral.DominatedConvergence
import Mathlib.MeasureTheory.Integral.IntervalIntegral.IntegrationByParts
import Mathlib.NumberTheory.AbelSummation
import Mathlib.NumberTheory.Chebyshev
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring

open Filter MeasureTheory Set
open scoped Topology ArithmeticFunction
Formal statement
theorem MasulloRH.translated_half_weight_prime_power_sum_and_nonvanishing :
    (∀ (a b : ℝ), 0 < a → a ≤ b → ∀ f : ℝ → ℝ, ContDiff ℝ 1 f →
      tsupport f ⊆ Set.Ioo a b →
      Tendsto (fun X : ℝ =>
        (∑ n ∈ Finset.Ioc ⌊a*X⌋₊ ⌊b*X⌋₊,
          ArithmeticFunction.vonMangoldt n / Real.sqrt n * f ((n:ℝ)/X)) / Real.sqrt X)
        atTop (𝓝 ((mellin (fun t => (f t : ℂ)) (1/2 : ℂ)).re))) ∧
    (∃ f : ℝ → ℝ, ContDiff ℝ (⊤ : ℕ∞) f ∧ HasCompactSupport f ∧ tsupport f ⊆ Set.Ioo 1 32 ∧
      HasMellin (fun t => (f t : ℂ)) 1 0 ∧ HasMellin (fun t => (f t : ℂ)) (-(1/2) : ℂ) 0 ∧
      ∃ c : ℝ, 0 < c ∧ ∀ᶠ X : ℝ in atTop,
        c * Real.sqrt X ≤ ∑ n ∈ Finset.Ioc ⌊X⌋₊ ⌊32*X⌋₊,
          ArithmeticFunction.vonMangoldt n / Real.sqrt n * f ((n:ℝ)/X)) := by sorry
Source
Masullo, The Music of the Primes, (11.3.2.1), (11.3.2.5) and the half-weighted prime-power side of (12.5.1.1), positive-norm tests for the rational trivial character. Applications of the ordinary prime number theorem. Uses Yuxuan Xu’s verified Chebyshev PNT (2ccce2b3-fbf8-419b-9ad4-52a6c527fd25), the proved MediumPNT it imports, and Yi’s verified smooth Mellin discriminator (47f46585-d134-434c-909e-0b58cfc6b201).

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