Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Directed orbital cutoffs and their finite lag distribution

Proved
MasulloRH.finite_cutoff_cross_correlation

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

finite-sumsprobabilitytrace-formula

Let a,ba,ba,b be finitely supported real sequences on Z\mathbb ZZ. Give lag jjj the weight ca,b(j)=∑k−i=jaibkc_{a,b}(j)=\sum_{k-i=j}a_i b_kca,b​(j)=∑k−i=j​ai​bk​. For every real test sequence fff, pairing ca,bc_{a,b}ca,b​ against fff equals ∑i,kaibkf(k−i)\sum_{i,k}a_i b_k f(k-i)∑i,k​ai​bk​f(k−i). If a,ba,ba,b are nonnegative and each has total mass one, ca,bc_{a,b}ca,b​ also has these properties. Swapping the cutoffs reflects the lag: cb,a(j)=ca,b(−j)c_{b,a}(j)=c_{a,b}(-j)cb,a​(j)=ca,b​(−j). In particular cδ0,δr=δrc_{\delta_0,\delta_r}=\delta_rcδ0​,δr​​=δr​ for every integer rrr.

Preamble
import Mathlib.Data.Real.Basic
import Mathlib.Algebra.Order.BigOperators.Group.Finset
import Mathlib.Data.Finsupp.Basic
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Tactic.Linarith

open Finset
Formal statement
theorem MasulloRH.finite_cutoff_cross_correlation :
    let corr (u v : ℤ →₀ ℝ) : ℤ →₀ ℝ :=
      ∑ i ∈ u.support, ∑ k ∈ v.support, Finsupp.single (k-i) (u i * v k)
    (∀ (a b : ℤ →₀ ℝ) (f : ℤ → ℝ),
      (∑ j ∈ (corr a b).support, corr a b j * f j) =
        ∑ i ∈ a.support, ∑ k ∈ b.support, (a i * b k) * f (k-i)) ∧
    (∀ a b : ℤ →₀ ℝ, (∀ i, 0 ≤ a i) → (∀ i, 0 ≤ b i) →
      (∑ i ∈ a.support, a i) = 1 → (∑ i ∈ b.support, b i) = 1 →
      (∀ j, 0 ≤ corr a b j) ∧ (∑ j ∈ (corr a b).support, corr a b j) = 1) ∧
    (∀ (a b : ℤ →₀ ℝ) (j : ℤ), corr b a j = corr a b (-j)) ∧
    (∀ r : ℤ, corr (Finsupp.single 0 1) (Finsupp.single r 1) = Finsupp.single r 1) := by sorry
Source
Finite cutoff calculation for Chapter 11 of Masullo, The Music of the Primes, §11.3.2, pp. 495–496, equations (11.3.2.3–5). Related upstream discussion: https://github.com/mccorvie/riemann-masullo/issues/1358.

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