Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Ramaré's squarefree totient sum: analytic range z≥142300z \ge 142300z≥142300

Proved
TaoFivePrimes.ramare_squarefree_totient_sum_le_large

by andreaskapfer · 1 vote · Sep 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-number-theorynumber-theoryprime-pairssieve-methodstao-five-primes

Let G(z)=∑n≤zμ2(n)/φ(n)G(z) = \sum_{n \le z} \mu^2(n)/\varphi(n)G(z)=∑n≤z​μ2(n)/φ(n) denote the summatory function of the squarefree totient weights. For every integer N≥142300N \ge 142300N≥142300,

G(N)  ≤  log⁡N+1.4708.G(N) \;\le\; \log N + 1.4708.G(N)≤logN+1.4708.

This is the analytic component of Lemma 3.5(1) of Ramaré's 1995 paper on Šnirel'man's constant, the estimate used by Tao in the proof of Proposition 4.10 on the mesoscopic sifted pair correlation. Ramaré bounds the error in the asymptotic expansion of GGG (his Lemma 3.2), re-run with the exponent 0.450.450.45 in place of 1/31/31/3, by 0.138217…=1.4708−1.3325830.138217\ldots = 1.4708 - 1.3325830.138217…=1.4708−1.332583; equations (3.10)–(3.12) reduce this to an explicit numerical condition involving the Chebyshev bound θ(t)≤1.001093 t\theta(t) \le 1.001093\,tθ(t)≤1.001093t, satisfied as soon as z≥142300z \ge 142300z≥142300. The complementary range 1≤z≤1423001 \le z \le 1423001≤z≤142300 is handled separately by direct verification (eq. (3.13)).

Formalization note: the sum is a finite sum over Finset.Icc 1 N of the indicator Squarefree n divided by Nat.totient n, which agrees with G(N)G(N)G(N) at integer points.

Preamble
import Mathlib.Data.Nat.Totient
import Mathlib.Data.Nat.Squarefree
import Mathlib.Analysis.SpecialFunctions.Log.Base

open scoped BigOperators
Formal statement
namespace TaoFivePrimes

theorem ramare_squarefree_totient_sum_le_large (N : ℕ) (hN : 142300 ≤ N) :
    (∑ n ∈ Finset.Icc 1 N,
      if Squarefree n then (1 : ℝ) / Nat.totient n else 0) ≤
      Real.log (N : ℝ) + 1.4708 := by sorry

end TaoFivePrimes
Source
O. Ramaré, *On Shnirel'man's constant*, Annali della Scuola Normale Superiore di Pisa, Classe di Scienze (4) 22 (1995), 645–706, http://www.numdam.org/item/ASNSP_1995_4_22_4_645_0/, Lemma 3.5(1) and proof, pp. 659–660, eqs. (3.10)–(3.12); used in T. Tao, *Every odd number greater than 1 is the sum of at most five primes*, arXiv:1201.6656, https://arxiv.org/abs/1201.6656, proof of Proposition 4.10.

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