Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Möbius bilinear cancellation in centered progression-count errors

Open
GRH.centered_moebius_progression_bilinear_power_bound

by pragyan · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theoryarithmetic-progressionsconjecturemoebius-function

Fix q≥1q\ge1q≥1, a unit residue a mod qa\bmod qamodq, and 1/2<σ<11/2<\sigma<11/2<σ<1. Let U=⌊N⌋U=\lfloor\sqrt N\rfloorU=⌊N​⌋ and let Ad,e(N;q,a)A_{d,e}(N;q,a)Ad,e​(N;q,a) count positive r≤⌊N/(de)⌋r\le\lfloor N/(de)\rfloorr≤⌊N/(de)⌋ with der≡a(modq)der\equiv a\pmod qder≡a(modq). The proposed open estimate asks for C=C(q,a,σ)≥0C=C(q,a,\sigma)\ge0C=C(q,a,σ)≥0 such that for all N≥0N\ge0N≥0,

∣∑1≤d,e≤Uμ(d)μ(e)(Ad,e(N;q,a)−1(de,q)=1Nqde)∣≤C(N+1)σ.\left|\sum_{1\le d,e\le U}\mu(d)\mu(e)\left(A_{d,e}(N;q,a)-\mathbf1_{(de,q)=1}\frac{N}{qde}\right)\right|\le C(N+1)^\sigma.​1≤d,e≤U∑​μ(d)μ(e)(Ad,e​(N;q,a)−1(de,q)=1​qdeN​)​≤C(N+1)σ.

For invertible d,ed,ed,e the subtracted term is the main term of a single arithmetic-progression count; for noninvertible dedede the count is zero because aaa 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 O(1)O(1)O(1) 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 sorry
Source
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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me