Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Möbius cancellation in a fixed reduced progression at or below the verified zero-free record

Open
GRH.moebius_partial_sum_reduced_progression_power_bound_below_record

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

analytic-number-theoryarithmetic-progressionsconjecturemoebius-function

Fix a positive modulus qqq, a unit residue class a mod qa \bmod qamodq, and an exponent σ\sigmaσ with

12<σ≤0.8749570698.\frac{1}{2} < \sigma \le 0.8749570698 .21​<σ≤0.8749570698.

Then there is a constant C=C(q,a,σ)≥0C = C(q,a,\sigma) \ge 0C=C(q,a,σ)≥0 such that for every integer N≥0N \ge 0N≥0,

∣∑0≤k≤Nk≡a(modq)μ(k)∣≤C (N+1)σ,\left|\sum_{\substack{0 \le k \le N \\ k \equiv a \pmod q}} \mu(k)\right| \le C\,(N+1)^{\sigma},​0≤k≤Nk≡a(modq)​∑​μ(k)​≤C(N+1)σ,

where μ\muμ is the Möbius function and the sum runs over the integers up to NNN in the fixed reduced class aaa modulo qqq.

This is the target estimate Möbius cancellation up to a sharp cutoff in each reduced residue class restricted to exponents at or below the verified Dirichlet zero-free boundary 0.87495706980.87495706980.8749570698. The complementary range σ>0.8749570698\sigma > 0.8749570698σ>0.8749570698 is already proved unconditionally at Liouville cancellation in every fixed reduced progression above the current zero-free record, so the two statements together cover exactly the full range 12<σ<1\tfrac12 < \sigma < 121​<σ<1. Restricting the exponent range makes this statement strictly weaker than the target, and it isolates exactly the cancellation that no currently verified zero-free region supplies.

The estimate is still open in this restricted range. For q=1q = 1q=1 and any fixed σ<1\sigma < 1σ<1 it contains the classical Mertens bound ∣M(N)∣≪Nσ|M(N)| \ll N^{\sigma}∣M(N)∣≪Nσ with M(N)=∑k≤Nμ(k)M(N) = \sum_{k \le N} \mu(k)M(N)=∑k≤N​μ(k); unconditionally no bound of the shape M(N)≪NσM(N) \ll N^{\sigma}M(N)≪Nσ for a fixed σ<1\sigma < 1σ<1 is known. Under GRH the full range holds, with room to spare: L. Ye, Theorem 1.1 gives M(N;q,a)≪(N+1)1/2log⁡2(qN)M(N;q,a) \ll (N+1)^{1/2}\log^2(qN)M(N;q,a)≪(N+1)1/2log2(qN).

Formalization Note. The binders and the conclusion are verbatim the target statement; the single addition is hcap : σ ≤ 0.8749570698, the literal complement of the hypothesis 0.8749570698 < σ used by the above-record theorems, so that the two cases split the exponent range without overlap or gap.

Preamble
import Mathlib.NumberTheory.DirichletCharacter.Bounds
import Mathlib.NumberTheory.ArithmeticFunction.Moebius
import Mathlib.Analysis.SpecialFunctions.Pow.Real

open scoped BigOperators
Formal statement
theorem GRH.moebius_partial_sum_reduced_progression_power_bound_below_record
    (q : ℕ) [NeZero q] (a : ZMod q) (ha : IsUnit a) (σ : ℝ)
    (hhalf : (1 / 2 : ℝ) < σ) (hone : σ < 1) (hcap : σ ≤ 0.8749570698) :
    ∃ C : ℝ, 0 ≤ C ∧ ∀ n : ℕ,
      |∑ k ∈ Finset.range (n + 1),
        if (k : ZMod q) = a then (ArithmeticFunction.moebius k : ℝ) else 0| ≤
          C * ((n : ℝ) + 1) ^ σ := by sorry
Source
Restriction of the open Prove2Me theorem https://prove2.me/theorems/c2e8263f-75e5-4e6c-a57c-32bc7d41e73b (GRH.moebius_partial_sum_reduced_progression_power_bound) to exponents sigma <= 0.8749570698. The complementary range sigma > 0.8749570698 is proved at https://prove2.me/theorems/a79a1901-e866-466f-8a5d-5c02b8291dbe (GRH.liouville_reduced_progression_bound_above_record) combined with the square-divisor transfer https://prove2.me/theorems/ed342a94-f581-487e-a655-dd5a9b0ff82e (GRH.moebius_progression_le_of_liouville_progression_le). The unrestricted fixed-modulus estimate is L. Ye, Bounding sums of the Moebius function over arithmetic progressions, Theorem 1.1 (p. 4), https://arxiv.org/pdf/1406.7326 ; for q = 1 it is the classical Mertens bound.

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