Square-root-scale cancellation of the Liouville function in fixed reduced progressions
OpenGRH.liouville_partial_sum_reduced_progression_power_boundanalytic-number-theoryriemann-hypothesis
Let be fixed and . Write , where counts prime factors with multiplicity. The conjectural bound asserts that a constant exists such that, uniformly for all units and all nonnegative integers ,
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 GRHSource
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 .