Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Second moment of the divisor function

Proved
Vaughan.sum_sigma_zero_sq_le

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

circle-methodexponential-sumsnumber-theoryvinogradov

Divisor second moment. There is an absolute constant CCC with

∑k≤Kd(k)2 ≤ C K (1+log⁡K)3for every K,\sum_{k\le K} d(k)^2\ \le\ C\,K\,(1+\log K)^3\qquad\text{for every }K,k≤K∑​d(k)2 ≤ CK(1+logK)3for every K,

where d(k)=σ0(k)d(k)=\sigma_0(k)d(k)=σ0​(k) is the number of divisors of kkk. Writing d(k)2=#{(a,b):a∣k,  b∣k}d(k)^2=\#\{(a,b):a\mid k,\;b\mid k\}d(k)2=#{(a,b):a∣k,b∣k} and summing over k≤Kk\le Kk≤K turns the left side into ∑a,b≤K⌊K/lcm(a,b)⌋\sum_{a,b\le K}\lfloor K/\mathrm{lcm}(a,b)\rfloor∑a,b≤K​⌊K/lcm(a,b)⌋, which is estimated by the harmonic sum cubed.

This is the arithmetic input to the Type II estimate: after Cauchy--Schwarz the coefficient (μ−μV)∗ζ(\mu-\mu_V)*\zeta(μ−μV​)∗ζ is bounded by the divisor function, and its second moment is what turns the Cauchy--Schwarz loss into the harmless factor log⁡3N\log^3 Nlog3N.

Preamble
import Definitions.Def_Vino_vaughan
import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt
import Mathlib.NumberTheory.ArithmeticFunction.Moebius
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.NumberTheory.ArithmeticFunction.Misc
import Mathlib.Algebra.BigOperators.Module
import Mathlib.Algebra.Order.Interval.Finset.SuccPred
import Mathlib.Algebra.Order.BigOperators.Ring.Finset
import Mathlib.Algebra.BigOperators.Field
import Mathlib.NumberTheory.Harmonic.Bounds
import Theorems.Thm_CircleMethod_e_neg
import Theorems.Thm_Vino_psi_le
import Theorems.Thm_CircleMethod_aux_sum_min_le
import Theorems.Thm_CircleMethod_nrm_le
import Theorems.Thm_CircleMethod_nrm_triangle
import Theorems.Thm_CircleMethod_nrm_neg
import Theorems.Thm_CircleMethod_nrm_nonneg
import Theorems.Thm_CircleMethod_nrm_eq_zero_iff
import Theorems.Thm_CircleMethod_nrm_pos_of_not_int
import Theorems.Thm_CircleMethod_norm_sum_e_le_inv_nrm
import Theorems.Thm_CircleMethod_norm_sum_e_le
import Theorems.Thm_CircleMethod_e_add
import Theorems.Thm_CircleMethod_norm_e

open Finset ArithmeticFunction

open CircleMethod
Formal statement
namespace Vaughan

theorem sum_sigma_zero_sq_le :
    ∃ C : ℝ, 0 < C ∧ ∀ K : ℕ,
      ∑ k ∈ Icc 1 K, (ArithmeticFunction.sigma 0 k : ℝ) ^ 2 ≤ C * K * (1 + Real.log K) ^ 3 := by sorry

end Vaughan
Source
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Section 2.1, Lemma 2.1; Davenport, Multiplicative Number Theory, Chapter 24 (the bound ∑k≤Kd(k)2≪Klog⁡3K\sum_{k\le K} d(k)^2 \ll K\log^3 K∑k≤K​d(k)2≪Klog3K)

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