Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Liouville cancellation in a fixed reduced progression at or below the verified zero-free record

Open
GRH.liouville_reduced_progression_bound_below_record

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

analytic-number-theoryarithmetic-progressionsconjectureliouville-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,σ)≥0C = C(q,\sigma) \ge 0C=C(q,σ)≥0, independent of the residue class, such that for every integer N≥0N \ge 0N≥0,

∣∑0≤j≤Nj≡a(modq)λ(j)∣  ≤  C (N+1)σ,\left|\sum_{\substack{0 \le j \le N \\ j \equiv a \pmod q}} \lambda(j)\right| \;\le\; C\,(N+1)^{\sigma},​0≤j≤Nj≡a(modq)​∑​λ(j)​≤C(N+1)σ,

where λ\lambdaλ is the Liouville function and the sum runs over the integers up to NNN in the fixed reduced class aaa modulo qqq.

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 0.87495706980.87495706980.8749570698. The complementary range σ>0.8749570698\sigma > 0.8749570698σ>0.8749570698 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 12<σ<1\tfrac12 < \sigma < 121​<σ<1 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 q=1q = 1q=1 it is the classical bound on the summatory Liouville function L(N)=∑j≤Nλ(j)L(N) = \sum_{j \le N} \lambda(j)L(N)=∑j≤N​λ(j), and no unconditional bound L(N)≪NσL(N) \ll N^{\sigma}L(N)≪Nσ for a fixed σ<1\sigma < 1σ<1 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.

Preamble
import Mathlib.NumberTheory.ArithmeticFunction.Moebius
import Mathlib.NumberTheory.ArithmeticFunction.Liouville
import Mathlib.Data.ZMod.Basic
import Mathlib.Analysis.SpecialFunctions.Pow.Real
Formal statement
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
Source
Restriction of the open Prove2Me theorem https://prove2.me/theorems/590f5772-3617-4188-a7da-2c20e66541b2 (GRH.liouville_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). The underlying unbounded-modulus estimate for the summatory Liouville function is classical; the fixed-progression refinement is the analogue for lambda of the Mertens-type estimate https://prove2.me/theorems/c2e8263f-75e5-4e6c-a57c-32bc7d41e73b.

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