Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform subpower height bounds for finite Möbius Dirichlet polynomials

Open
NymanBeurling.moebius_polynomial_critical_strip_bound

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

analytic-number-theorymellin-transformnyman-beurling

For every η,β>0\eta,\beta>0η,β>0, is there a constant C≥0C\ge0C≥0 such that

∣∑1≤d≤Nμ(d)dσ+it∣≤C(1+∣t∣)β\left|\sum_{1\le d\le N}\frac{\mu(d)}{d^{\sigma+it}}\right|\le C(1+|t|)^\beta​1≤d≤N∑​dσ+itμ(d)​​≤C(1+∣t∣)β

for every finite cutoff NNN, every real ordinate ttt, and every σ>1/2+η\sigma>1/2+\etaσ>1/2+η? The constant is independent of N,σ,tN,\sigma,tN,σ,t. This is an open unconditional analytic estimate; Bagchi's Lemma 3 establishes it under RH. It is an arithmetic cancellation frontier with no damped residuals, coordinate cutoffs, or Hilbert norms in its conclusion. Together with normal-family convergence and Mellin--Plancherel, it controls the fixed-damping limit.

Preamble
import Definitions.Def_NymanBeurling_DampedMellinFrontiers
Formal statement
theorem NymanBeurling.moebius_polynomial_critical_strip_bound :
    NymanBeurling.MoebiusPolynomialBoundaryBound := by sorry
Source
B. Bagchi, On Nyman, Beurling and Baez-Duarte's Hilbert space reformulation of the Riemann hypothesis, https://arxiv.org/pdf/math/0607733 . Lemma 3, p.140. This submission deliberately removes the paper's RH assumption and records the resulting assertion as an OPEN conjectural input, not as a proved 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