Montgomery-Vaughan: sum_{q <= R} mu^2(q)/phi(q) >= log R
ProvedTaoFivePrimes.log_le_sum_moebius_sq_div_totientby Hartmann_Psi · Sep 14, 2026 · Mathlib 0df444a (Lean v4.33.1)
analytic-number-theorygoldbachlarge-sievenumber-theorytotient
For a real number R≥0 put
G(R):=q≤R∑φ(q)μ2(q),
the sum being over the positive integers q at most R, with μ the Möbius function and φ Euler's totient. Then
G(R)≥logR.
Only the squarefree q contribute, and for those μ2(q)=1, so G(R)=∑q≤R, q squarefree1/φ(q).
This is the elementary half of the estimate of van Lint and Richert, sharpened by Montgomery and Vaughan to G(R)≥logR+1.07 for R≥6. It is the input that converts the averaging over moduli in the local L2 estimate (Tao's Lemma 4.6) into the saving of logx/logR over the global L2 estimate of Lemma 4.5, and hence it underlies Corollary 4.7, the upper bound on the major-arc L2 mass. The bound is sharp in order: G(R)∼logR as R→∞.
Formalization Note The sum ranges over the integers from 1 to ⌊R⌋, and μ takes integer values whose square is cast to a real number. No lower bound on R is needed: for R<1 the logarithm is negative while the sum is non-negative, and for R=0 the convention log0=0 still leaves the inequality true with an empty sum.
Preamble
import Mathlib
open Finset
Formal statement
theorem TaoFivePrimes.log_le_sum_moebius_sq_div_totient (R : ℝ) (hR : 0 ≤ R) :
Real.log R ≤ ∑ q ∈ Finset.Icc 1 ⌊R⌋₊,
((ArithmeticFunction.moebius q : ℝ) ^ 2 / (Nat.totient q : ℝ)) := by sorrySource
Terence Tao, "Every odd number greater than 1 is the sum of at most five primes", Mathematics of Computation 83 (2014), 997-1038; arXiv:1201.6656, https://arxiv.org/abs/1201.6656, Section 4, the estimate G(R) >= log R quoted in the proof of Lemma 4.6 (Local L^2 estimate); originally J. E. van Lint and H. E. Richert, On primes in arithmetic progressions, Acta Arith. 11 (1965), 209-216, and H. L. Montgomery and R. C. Vaughan, The large sieve, Mathematika 20 (1973), 119-134, Lemma 3
View graph