Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Square-root-scale cancellation of the Liouville function in fixed reduced progressions

Open
GRH.liouville_partial_sum_reduced_progression_power_bound

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

analytic-number-theoryriemann-hypothesis

Let q≥1q\ge1q≥1 be fixed and 1/2<σ<11/2<\sigma<11/2<σ<1. Write λ(n)=(−1)Ω(n)\lambda(n)=(-1)^{\Omega(n)}λ(n)=(−1)Ω(n), where Ω(n)\Omega(n)Ω(n) counts prime factors with multiplicity. The conjectural bound asserts that a constant C=C(q,σ)≥0C=C(q,\sigma)\ge0C=C(q,σ)≥0 exists such that, uniformly for all units a mod qa\bmod qamodq and all nonnegative integers NNN,

∣∑1≤n≤N, n≡a mod qλ(n)∣≤C(N+1)σ.\left|\sum_{1\le n\le N,\ n\equiv a\bmod q}\lambda(n)\right|\le C(N+1)^\sigma.​1≤n≤N, n≡amodq∑​λ(n)​≤C(N+1)σ.

This is an open arithmetic cancellation estimate. The square-divisor transfer shows its role in bounding the corresponding Möbius sums in the campaign.

Preamble
import Mathlib.NumberTheory.ArithmeticFunction.Moebius
import Mathlib.NumberTheory.ArithmeticFunction.Liouville
import Mathlib.Data.ZMod.Basic
import Mathlib.Analysis.SpecialFunctions.Pow.Real
Formal statement
open ArithmeticFunction Finset
namespace GRH

theorem liouville_partial_sum_reduced_progression_power_bound
    (q : ℕ) [NeZero q] (σ : ℝ) (hhalf : 1 / 2 < σ) (hone : σ < 1) :
    ∃ C : ℝ, 0 ≤ C ∧ ∀ a : ZMod q, IsUnit a → ∀ N : ℕ,
      |∑ j ∈ range (N+1), if (j:ZMod q)=a then (liouville j:ℝ) else 0| ≤ C*((N:ℝ)+1)^σ := by sorry

end GRH
Source
NIST Digital Library of Mathematical Functions, §27.2, https://dlmf.nist.gov/27.2 , for the Liouville function; the asserted fixed-progression cancellation is an open GRH-strength input to the square-divisor reduction. For the related conditional Möbius bounds see L. Ye, Bounding sums of the Möbius function over arithmetic progressions, https://arxiv.org/abs/1406.7326 .

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