Damped Möbius sums approximate every fixed finite prefix to arbitrary accuracy
ProvedNymanBeurling.damped_moebius_approximation_on_each_fixed_prefixanalytic-number-theoryfinite-approximationmoebius-functionnyman-beurlingriemann-zeta-function
For , and a finite truncation , put
For each fixed integer and each , all sufficiently small positive have the following property. For all sufficiently large , every satisfies
The allowable damping and the truncation threshold may depend on the prescribed prefix .
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 sorrySource
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 .