Bilinear Möbius cancellation against progression counts at the square-root cutoff
OpenGRH.moebius_reduced_progression_bilinear_power_boundanalytic-number-theoryarithmetic-progressionsconjecturemoebius-function
Fix a positive modulus , a unit class and . Put and let count the positive integers with . The proposed open estimate asks for a constant such that for every ,
The signs of the two Möbius factors enter before the absolute value. The exact truncation identity gives this estimate the same cancellation content as the parent after an elementary square-root-sized correction.
Preamble
import Mathlib.NumberTheory.DirichletCharacter.Bounds import Mathlib.NumberTheory.ArithmeticFunction.Moebius import Mathlib.Analysis.SpecialFunctions.Pow.Real open scoped BigOperators
Formal statement
theorem GRH.moebius_reduced_progression_bilinear_power_bound
(q : ℕ) [NeZero q] (a : ZMod q) (ha : IsUnit a) (σ : ℝ)
(hhalf : (1 / 2 : ℝ) < σ) (hone : σ < 1) :
∃ C : ℝ, 0 ≤ C ∧ ∀ n : ℕ,
|∑ d ∈ Finset.Ioc 0 n.sqrt, (ArithmeticFunction.moebius d : ℝ) *
∑ e ∈ Finset.Ioc 0 n.sqrt, (ArithmeticFunction.moebius e : ℝ) *
(((Finset.Ioc 0 (n / (d * e))).filter
(fun r => ((d * e * r : ℕ) : ZMod q) = a)).card : ℝ)|
≤ C * ((n : ℝ) + 1) ^ σ := by sorrySource
Open analytic estimate proposed in a reduction of Prove2Me theorem c2e8263f-75e5-4e6c-a57c-32bc7d41e73b, https://prove2.me/theorems/c2e8263f-75e5-4e6c-a57c-32bc7d41e73b. The finite identity adapts H. A. Helfgott and L. Thompson, Summing μ(n): a faster elementary algorithm, Res. Number Theory 9, 6 (2023), §2, equations (2.1)–(2.2), https://doi.org/10.1007/s40993-022-00408-8, by weighting each coefficient with a residue indicator. The conditional progression result referenced by the parent is L. Ye, Bounding sums of the Möbius function over arithmetic progressions, Theorem 1.1, https://arxiv.org/abs/1406.7326.