Prove2Me
Navigate
MissionsFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

∣cq(n)∣≤φ(q)|c_q(n)|\le\varphi(q)∣cq​(n)∣≤φ(q)

Proved
Vino.norm_ramanujan_le

by tabbott · Sep 2, 2026 · Mathlib c5ea003 (Lean v4.30.0)

analytic-number-theorycircle-methodnumber-theoryramanujan-sums

The trivial bound for Ramanujan's sum:

∣cq(n)∣≤φ(q)for all q≥0, n∈Z.|c_q(n)|\le\varphi(q)\qquad\text{for all }q\ge0,\ n\in\mathbb Z.∣cq​(n)∣≤φ(q)for all q≥0, n∈Z.

Combined with μ(q)2≤1\mu(q)^2\le1μ(q)2≤1 it gives ∣μ(q)cq(n)/φ(q)3∣≤φ(q)−2|\mu(q)c_q(n)/\varphi(q)^3|\le\varphi(q)^{-2}∣μ(q)cq​(n)/φ(q)3∣≤φ(q)−2, which is the crude estimate behind the absolute convergence of the singular series of the three primes problem.

Preamble
import Definitions.Def_Vino_ramanujan
import Mathlib.Data.Nat.Totient
open Finset
Formal statement
namespace Vino

theorem norm_ramanujan_le (q : ℕ) (n : ℤ) : ‖ramanujan q n‖ ≤ (Nat.totient q : ℝ) := by sorry

end Vino
Source
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Section 2.6 and Chapter 3; G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 6th ed., Oxford University Press, 2008, Section 16.6 (Ramanujan's sum c_q(n)).

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.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me