Liouville cancellation in a fixed reduced progression at or below the verified zero-free record
OpenGRH.liouville_reduced_progression_bound_below_recordFix a positive modulus , a unit residue class , and an exponent with
Then there is a constant , independent of the residue class, such that for every integer ,
where is the Liouville function and the sum runs over the integers up to in the fixed reduced class modulo .
This is the target estimate Liouville cancellation in a fixed reduced progression for all exponents strictly between one half and one restricted to exponents at or below the verified zero-free boundary . The complementary range is already Proved at Liouville cancellation in every fixed reduced progression above the current zero-free record, so the two statements together cover exactly the full range with no overlap and no gap. The added hypothesis therefore makes this statement strictly weaker than its target while isolating precisely the range that no currently verified zero-free region reaches.
The estimate remains open in this restricted range: for it is the classical bound on the summatory Liouville function , and no unconditional bound for a fixed is known. Under GRH the full range holds with room to spare.
Formalization Note. The binders and the conclusion are verbatim the target statement, with the single addition of hcap : σ ≤ 0.8749570698, the literal negation-complement of the hypothesis 0.8749570698 < σ used by the above-record theorem, so that the two cases partition the exponent range exactly.
import Mathlib.NumberTheory.ArithmeticFunction.Moebius import Mathlib.NumberTheory.ArithmeticFunction.Liouville import Mathlib.Data.ZMod.Basic import Mathlib.Analysis.SpecialFunctions.Pow.Real
theorem GRH.liouville_reduced_progression_bound_below_record
(q : ℕ) [NeZero q] (σ : ℝ) (hhalf : 1 / 2 < σ) (hone : σ < 1)
(hcap : σ ≤ 0.8749570698) :
∃ C : ℝ, 0 ≤ C ∧ ∀ a : ZMod q, IsUnit a → ∀ N : ℕ,
|∑ j ∈ Finset.range (N + 1), if (j : ZMod q) = a then (ArithmeticFunction.liouville j : ℝ) else 0| ≤
C * ((N : ℝ) + 1) ^ σ := by sorry