A uniform Liouville bound transfers to Möbius sums in reduced progressions with explicit constant
ProvedGRH.moebius_progression_le_of_liouville_progression_leanalytic-number-theoryarithmetic-functionsriemann-hypothesis
Let be a positive integer, let , and let . Write and for the sums of the Liouville and Möbius functions, respectively, over positive integers at most congruent to modulo . Assume for every reduced residue class and every nonnegative integer . Then the explicit bound
holds uniformly over the same classes and cutoffs. The convergence threshold comes from the correction for square divisors and requires no further cancellation in those divisors.
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 moebius_progression_le_of_liouville_progression_le (q : ℕ) [NeZero q] (σ C : ℝ) (hσ : 1/2 < σ) (hC : 0 ≤ C)
(H : ∀ a : ZMod q, IsUnit a → ∀ N : ℕ,
|∑ j ∈ range (N+1), if (j:ZMod q)=a then (liouville j:ℝ) else 0| ≤ C*((N:ℝ)+1)^σ)
(a : ZMod q) (ha : IsUnit a) (N : ℕ) :
|∑ k ∈ range (N+1), if (k:ZMod q)=a then (moebius k:ℝ) else 0| ≤
(C * (2:ℝ)^σ * ∑' d : ℕ, ((d:ℝ)^(2*σ))⁻¹) * ((N:ℝ)+1)^σ := by sorry
end GRHSource
The arithmetic functions are as in NIST Digital Library of Mathematical Functions, §27.2, https://dlmf.nist.gov/27.2 . The explicit uniform transfer factor here is obtained by square-divisor inversion and summing the resulting positive majorant.