Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Damped Möbius sums approximate every fixed finite prefix to arbitrary accuracy

Proved
NymanBeurling.damped_moebius_approximation_on_each_fixed_prefix

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

analytic-number-theoryfinite-approximationmoebius-functionnyman-beurlingriemann-zeta-function

For m≥1m\ge1m≥1, ε>0\varepsilon>0ε>0 and a finite truncation NNN, put

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 each fixed integer H≥0H\ge0H≥0 and each δ>0\delta>0δ>0, all sufficiently small positive ε<1/2\varepsilon<1/2ε<1/2 have the following property. For all sufficiently large NNN, every 0≤h≤H0\le h\le H0≤h≤H satisfies

∑m=1hEN,ε(m)2m(m+1)<δ.\sum_{m=1}^{h}\frac{E_{N,\varepsilon}(m)^2}{m(m+1)}<\delta.m=1∑h​m(m+1)EN,ε​(m)2​<δ.

The allowable damping and the truncation threshold may depend on the prescribed prefix HHH.

Preamble
import Mathlib.NumberTheory.LSeries.Dirichlet
import Mathlib.Analysis.SpecialFunctions.Pow.Continuity

open Filter Topology
Formal statement
theorem NymanBeurling.damped_moebius_approximation_on_each_fixed_prefix (H : ℕ) (δ : ℝ) (hδ : 0 < δ) :
    ∀ᶠ ε : ℝ in 𝓝[>] 0, 0 < ε ∧ ε < 1/2 ∧
      ∀ᶠ N : ℕ in atTop, ∀ h : ℕ, h ≤ 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
The finite-prefix statement is an unconditional consequence of the Dirichlet series for the reciprocal Riemann zeta function in Re(s)>1, its simple pole at 1, and elementary Möbius inversion. The uniform approximation problem for the same family is https://prove2.me/theorems/cf53c71e-758a-4724-897b-66cd8091e51b .

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