Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform weighted approximation by finite damped Mobius remainder sums

Open
NymanBeurling.damped_moebius_mean_square_approximation

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

approximation-theorynyman-beurlingriemann-hypothesis

Write rk(m)=(m mod (k+2))/(k+2)r_k(m)=(m\bmod(k+2))/(k+2)rk​(m)=(mmod(k+2))/(k+2) and let μ\muμ be the Möbius function. For every δ>0\delta>0δ>0, the proposed approximation assertion asks for N≥0N\ge0N≥0 and 0<ε<1/20<\varepsilon<1/20<ε<1/2 such that, simultaneously for every integer cutoff H≥0H\ge0H≥0,

∑m=1H(1+∑k=0N−1μ(k+2)(k+2)εrk(m))2m(m+1)<δ.\sum_{m=1}^{H}\frac{\left(1+\sum_{k=0}^{N-1}\frac{\mu(k+2)}{(k+2)^\varepsilon}r_k(m)\right)^2}{m(m+1)}<\delta.m=1∑H​m(m+1)(1+∑k=0N−1​(k+2)εμ(k+2)​rk​(m))2​<δ.

The coefficients of the approximant to the constant sequence are therefore bk=−μ(k+2)/(k+2)εb_k=-\mu(k+2)/(k+2)^\varepsilonbk​=−μ(k+2)/(k+2)ε. The choice of NNN and ε\varepsilonε precedes the universal quantifier over HHH; a bound for just one cutoff would not suffice. The terms are nonnegative, so the condition controls the full weighted mean-square error.

This is an open unconditional analytic assertion. Bagchi's construction proves the relevant approximation under the Riemann hypothesis; RH is not an assumption in this formal target, and the paper is not being cited as an unconditional proof. Together with an elementary tail-budget choice and rational rounding, this assertion implies arbitrarily small finite rational remainder certificates. It replaces an unrestricted coefficient search by a family with the two parameters NNN and ε\varepsilonε, while retaining the central unresolved analytic difficulty.

Preamble
import Mathlib

set_option autoImplicit false
open scoped BigOperators
Formal statement
theorem NymanBeurling.damped_moebius_mean_square_approximation
    (δ : ℝ) (hδ : 0 < δ) :
    ∃ (N : ℕ) (ε : ℝ), 0 < ε ∧ ε < 1/2 ∧ ∀ H : ℕ,
      (∑ n ∈ Finset.range H,
        (1 + ∑ k : Fin N,
          ((ArithmeticFunction.moebius (k.val+2) : ℝ) / (k.val+2 : ℝ)^ε) *
            (((n+1) % (k.val+2) : ℕ) : ℝ) / (k.val+2 : ℝ))^2 /
        ((n+1 : ℝ)*(n+2 : ℝ))) < δ := by sorry
Source
Open unconditional assertion extracted from B. Bagchi, On Nyman, Beurling and Baez-Duarte's Hilbert space reformulation of the Riemann hypothesis, Proc. Indian Acad. Sci. (Math. Sci.) 116 (2006), proof of Theorem 2 (i)=> (ii), pp. 140–141, damped sums H_{L,epsilon}; sign from Mellin identity (4), p. 142, and sequence identification in the proof of Theorem 1, p. 145; https://arxiv.org/pdf/math/0607733 . The source assumes RH in that construction. The present unconditional finite-partial-sum formulation is proposed as an open proof obligation, not as a proved source theorem.

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