Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Open iterated uniform tail bound for damped Mobius remainder sums

Open
NymanBeurling.damped_moebius_iterated_tail_bound

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

analytic-number-theorynyman-beurlingriemann-hypothesis

Let

EN,ε(m)=1+∑d=2N+1μ(d)dεm mod dd.E_{N,\varepsilon}(m)=1+\sum_{d=2}^{N+1}\frac{\mu(d)}{d^\varepsilon}\frac{m\bmod d}{d}.EN,ε​(m)=1+d=2∑N+1​dεμ(d)​dmmodd​.

For every δ>0\delta>0δ>0, the proposed estimate asks for a coordinate cutoff H0≥0H_0\ge0H0​≥0 and a damping threshold ε0>0\varepsilon_0>0ε0​>0 such that, for every 0<ε<ε00<\varepsilon<\varepsilon_00<ε<ε0​, there is N0N_0N0​ with

∑m=H0+1HEN,ε(m)2m(m+1)<δ(N≥N0, H≥0).\sum_{m=H_0+1}^{H}\frac{E_{N,\varepsilon}(m)^2}{m(m+1)}<\delta\qquad(N\ge N_0,\ H\ge0).m=H0​+1∑H​m(m+1)EN,ε​(m)2​<δ(N≥N0​, H≥0).

An empty tail sum is zero. The cutoff H0H_0H0​ is chosen before ε\varepsilonε, while the truncation threshold N0N_0N0​ may depend on ε\varepsilonε; the displayed bound is uniform in the upper coordinate cutoff HHH. This is an open unconditional assertion retaining the central analytic difficulty. Together with unconditional finite-coordinate approximation, it implies the damped mean-square approximation frontier. The Riemann hypothesis is not assumed in this target. The cited RH-conditional construction is motivation, not an unconditional proof.

Preamble
import Mathlib

set_option autoImplicit false
open scoped BigOperators
Formal statement
theorem NymanBeurling.damped_moebius_iterated_tail_bound (δ : ℝ) (hδ : 0 < δ) :
    ∃ (H₀ : ℕ) (ε₀ : ℝ), 0 < ε₀ ∧ ∀ ε : ℝ, 0 < ε → ε < ε₀ →
      ∃ N₀ : ℕ, ∀ N : ℕ, N₀ ≤ N → ∀ H : ℕ,
        (∑ n ∈ Finset.Ico H₀ 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 tail-tightness obligation derived from the two successive approximation limits in B. Bagchi, On Nyman, Beurling and Baez-Duarte's Hilbert space reformulation of the Riemann hypothesis (2006), proof of Theorem 2 (i)=>(ii), pp. 140–141, and the sequence identification in the proof of Theorem 1, p. 145, https://arxiv.org/pdf/math/0607733 . That construction assumes RH. This exact tail formulation is a proposed sufficient condition for https://prove2.me/theorems/cf53c71e-758a-4724-897b-66cd8091e51b , not a theorem quoted as unconditional from the source.

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