Möbius cancellation in a fixed reduced progression at or below the verified zero-free record
OpenGRH.moebius_partial_sum_reduced_progression_power_bound_below_recordFix a positive modulus , a unit residue class , and an exponent with
Then there is a constant such that for every integer ,
where is the Möbius function and the sum runs over the integers up to in the fixed reduced class modulo .
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 . The complementary range 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 . 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 and any fixed it contains the classical Mertens bound with ; unconditionally no bound of the shape for a fixed is known. Under GRH the full range holds, with room to spare: L. Ye, Theorem 1.1 gives .
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.
import Mathlib.NumberTheory.DirichletCharacter.Bounds import Mathlib.NumberTheory.ArithmeticFunction.Moebius import Mathlib.Analysis.SpecialFunctions.Pow.Real open scoped BigOperators
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