Möbius bilinear cancellation in centered progression-count errors
OpenGRH.centered_moebius_progression_bilinear_power_boundanalytic-number-theoryarithmetic-progressionsconjecturemoebius-function
Fix , a unit residue , and . Let and let count positive with . The proposed open estimate asks for such that for all ,
For invertible the subtracted term is the main term of a single arithmetic-progression count; for noninvertible the count is zero because is a unit. The centered quantity isolates signed cancellation in these counting errors after removing the separable principal main term. This remains a conjectural analytic estimate, rather than a claim that a pointwise counting error alone suffices.
Preamble
import Definitions.Def_GRH_MoebiusBilinear
Formal statement
theorem GRH.centered_moebius_progression_bilinear_power_bound
(q : ℕ) [NeZero q] (a : ZMod q) (ha : IsUnit a) (σ : ℝ)
(hhalf : (1 / 2 : ℝ) < σ) (hone : σ < 1) :
∃ C : ℝ, 0 ≤ C ∧ ∀ N : ℕ,
|GRH.centeredMoebiusBilinear q a N| ≤ C * ((N : ℝ) + 1) ^ σ := by sorrySource
Proposed centered-error subproblem of GRH.moebius_reduced_progression_bilinear_power_bound, https://prove2.me/theorems/1e39fbca-7acc-40a2-baab-ab807852220a. The exact finite bilinear truncation is adapted from Helfgott–Thompson, Summing μ(n): a faster elementary algorithm, §2, equations (2.1)–(2.2), https://doi.org/10.1007/s40993-022-00408-8. Subtracting N/(qde) is the elementary progression-count main term. The displayed signed cancellation estimate is a new proposed open subproblem, not an estimate asserted in the cited paper.