Liouville-weighted bilinear cancellation against squarefree progression counts
OpenGRH.liouville_reduced_progression_squarefree_bilinear_boundanalytic-number-theoryarithmetic-progressionsconjectureliouville-function
Fix a positive modulus and . Put and let count positive squarefree with . The proposed open estimate asks for one constant such that for every unit and every ,
The Liouville signs enter before the absolute value. The truncation identity transfers this estimate to the parent after a correction of size at most .
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_squarefree_bilinear_bound
(q : ℕ) [NeZero q] (σ : ℝ) (hhalf : 1 / 2 < σ) (hone : σ < 1) :
∃ C : ℝ, 0 ≤ C ∧ ∀ a : ZMod q, IsUnit a → ∀ N : ℕ,
|∑ d ∈ Finset.Ioc 0 N.sqrt, (ArithmeticFunction.liouville d : ℝ) *
∑ e ∈ Finset.Ioc 0 N.sqrt, (ArithmeticFunction.liouville e : ℝ) *
(((Finset.Ioc 0 (N / (d * e))).filter
(fun r => Squarefree r ∧ ((d * e * r : ℕ) : ZMod q) = a)).card : ℝ)|
≤ C * ((N : ℝ) + 1) ^ σ := by sorrySource
Proposed open reformulation of Prove2Me's fixed-modulus Liouville frontier, https://prove2.me/theorems/590f5772-3617-4188-a7da-2c20e66541b2. For λ and μ see NIST DLMF §27.2(i), equations (27.2.12) and (27.2.13), https://dlmf.nist.gov/27.2#E13. We adapt the Möbius truncation in H. A. Helfgott and L. Thompson, Summing μ(n): a faster elementary algorithm, Res. Number Theory 9, 6 (2023), §2, eq. (2.1), https://doi.org/10.1007/s40993-022-00408-8. The finite identity and its fixed-progression specialization are proved in the accompanying reduction. The cancellation estimate is conjectural.