Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The half-weight prime signal escapes every fixed finite set of local prime shells

Proved
MasulloRH.arithmetic_half_weight_escapes_all_fixed_prime_shells

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

analytic-number-theorymellin-transformtrace-formula

There is one smooth real test supported in (1,32)(1,32)(1,32) with both M(1)=M(−1/2)=0M(1)=M(-1/2)=0M(1)=M(−1/2)=0 and one c>0c>0c>0 such that, after removing all prime powers at any fixed finite collection of primes from its translated half-weight von Mangoldt sum, the remainder is at least cXc\sqrt XcX​ for every sufficiently large XXX. The bound also holds when an arbitrary finite subset of exponents is selected at each omitted prime. The total absolute local contribution at the fixed primes is bounded over every dilation and choice of exponents. Thus each fixed prime coordinate tends to zero after normalization by X\sqrt XX​, while the full signed mass stays positive.

Preamble
import Mathlib
open Filter MeasureTheory Set
open scoped Topology ArithmeticFunction
Formal statement
theorem MasulloRH.arithmetic_half_weight_escapes_all_fixed_prime_shells :
    ∃ 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 ∧ ∀ P : Finset ℕ, (∀ p ∈ P, 2 ≤ p) →
        (∃ D : ℝ, ∀ (X : ℝ) (J : ℕ → Finset ℕ),
          (∑ p ∈ P, ∑ k ∈ J p, |Real.log (p:ℝ) * (Real.sqrt p)⁻¹ ^ k * f ((p:ℝ)^k/X)|) ≤ D) ∧
        ∀ᶠ X : ℝ in atTop, ∀ J : ℕ → Finset ℕ,
          c * Real.sqrt X ≤
            (∑ n ∈ Finset.Ioc ⌊X⌋₊ ⌊32*X⌋₊, ArithmeticFunction.vonMangoldt n / Real.sqrt n * f ((n:ℝ)/X)) -
            ∑ p ∈ P, ∑ k ∈ J p, Real.log (p:ℝ) * (Real.sqrt p)⁻¹ ^ k * f ((p:ℝ)^k/X) := by sorry
Source
Masullo, (11.3.2.1–5), (12.5.1.1). Builds on Yi’s verified two-moment discriminator and the earlier translated arithmetic half-weight theorem f2d1cdcf-dc61-4c31-ba7e-e336d378ddb3 using Yuxuan Xu’s Chebyshev PNT.

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