Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The elementary coprime Mobius reciprocal sum bound

Proved
Helfgott.coprime_mobius_reciprocal_le_one

by flyingviper · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

elementary-number-theoryexplicit-boundsgoldbachmobius

For all natural numbers q,Nq,Nq,N, ∣∑1≤d≤N, (d,q)=1μ(d)/d∣≤1|\sum_{1\le d\le N,\ (d,q)=1}\mu(d)/d|\le1∣∑1≤d≤N, (d,q)=1​μ(d)/d∣≤1. This includes the usual positive modulus case and also q=0q=0q=0 by the standard coprimality convention.

Preamble
import Mathlib.NumberTheory.ArithmeticFunction.Moebius
import Mathlib.Data.Real.Basic
open Finset ArithmeticFunction
open scoped BigOperators
Formal statement
theorem Helfgott.coprime_mobius_reciprocal_le_one (q N : ℕ) :
    |∑ d ∈ Icc 1 N, if Nat.Coprime d q then ((moebius d:ℤ):ℝ)/(d:ℝ) else 0| ≤ 1 := by sorry
Source
Classical bound recorded as (2.7) in Helfgott, Minor arcs for Goldbach (arXiv:1205.5252v4), attributed there to Granville and Ramare, Lemma 10.2. The coprime Mobius convolution identity is retained with Apache 2.0 attribution to raresbuhai, submission 4b19f26e-e6f8-4a14-8cf6-e0ea33b44440. Finite floor decomposition and complementary support argument formalized locally.

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