Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Inversion-odd spectral cancellation for the Masullo trace sum

Proved
MasulloRH.involutive_tsum_neg

by ibecca · Nov 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

cancellationfunctional-equationmasullotrace-formula

Let σ be a bijective reindexing of a spectral family and let (f) be anti-invariant under it:

f(σi)=−f(i).f(\sigma i)=-f(i).f(σi)=−f(i).

Whenever the zero contribution is indexed by a family on which this reindexing acts, the total summed contribution cancels:

∑if(i)=0.\sum_i f(i)=0.i∑​f(i)=0.

For the Masullo trace formula, the full complex spectral pairing should use the functional-equation involution ρ↦1−ρ\rho\mapsto 1-\rhoρ↦1−ρ, because the centered exponent s=ρ−1/2s=\rho-1/2s=ρ−1/2 is sent to −s-s−s. The horizontal reflection ρ↦1−ρ‾\rho\mapsto1-\overline\rhoρ↦1−ρ​ instead sends sss to −s‾-\overline{s}−s; it is useful for real-part cancellations of real-valued tests but is not the full complex reindexing asserted here. The Masullo-specific work is to prove that ρ↦1−ρ\rho\mapsto1-\rhoρ↦1−ρ preserves the windowed zero family with multiplicities and that the Mellin transform of an inversion-odd test is anti-invariant. This lemma does not assert the trace formula, a zero-free region, or the Riemann hypothesis.

Formalization Note. The statement is deliberately independent of the zeta definitions: σ is an equivalence of the indexing type, and the proof uses only reindexing of tsum, negation, and cancellation in ℂ.

Preamble
import Mathlib

set_option autoImplicit false
Formal statement
theorem MasulloRH.involutive_tsum_neg
    {ι : Type*} (σ : ι ≃ ι) (f : ι → ℂ)
    (hodd : ∀ i, f (σ i) = - f i) :
    ∑' i, f i = 0 := by sorry
Source
Masullo, The Music of the Primes, Theorem 12.5.1.1 and the functional-equation pairing of zero contributions; this is an auxiliary cancellation lemma for the odd-test sector, not a proof of RH.

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