Open iterated uniform tail bound for damped Mobius remainder sums
OpenNymanBeurling.damped_moebius_iterated_tail_boundanalytic-number-theorynyman-beurlingriemann-hypothesis
Let
For every , the proposed estimate asks for a coordinate cutoff and a damping threshold such that, for every , there is with
An empty tail sum is zero. The cutoff is chosen before , while the truncation threshold may depend on ; the displayed bound is uniform in the upper coordinate cutoff . 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.