Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform unit bound for coprime Mobius sums with sigma denominators

Proved
Helfgott.coprime_mobius_sigma_abs_le_one

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

explicit-boundsgoldbachminor-arcsmobiustype-ii

For all natural numbers q,Nq,Nq,N, put P(n)=∏p∣n(p+1)P(n)=\prod_{p\mid n}(p+1)P(n)=∏p∣n​(p+1). Then

∣∑1≤n≤N(n,q)=1μ(n)P(n)∣≤1.\left|\sum_{\substack{1\le n\le N\\(n,q)=1}}\frac{\mu(n)}{P(n)}\right|\le1.​1≤n≤N(n,q)=1​∑​P(n)μ(n)​​≤1.

On squarefree integers, P(n)P(n)P(n) is the sum-of-divisors function σ(n)\sigma(n)σ(n). This unconditional unit bound improves constants in the complementary-divisor energy estimates used for Type II sums.

Preamble
import Mathlib
open Finset ArithmeticFunction
open scoped BigOperators
Formal statement
theorem Helfgott.coprime_mobius_sigma_abs_le_one (q N : ℕ) :
    |∑ n ∈ Icc 1 N, if Nat.Coprime n q then
      ((moebius n:ℤ):ℝ)/(∏ p ∈ n.primeFactors, ((p:ℝ)+1)) else 0|≤1 := by sorry
Source
Finite convex averaging of coprime Mobius reciprocal sums, formalized for the Prove2Me Weak Goldbach mission.

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