Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Powers of the divisor function: d(n)j≪εnεd(n)^j\ll_\varepsilon n^\varepsilond(n)j≪ε​nε

Proved
CircleMethod.divisor_bound_pow

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

analytic-number-theorycircle-methodexponential-sumsnumber-theory

For every ε>0\varepsilon>0ε>0 and every fixed exponent jjj there is a constant C=C(ε,j)C=C(\varepsilon,j)C=C(ε,j) with

d(n)j≤C nε(n≥1),d(n)^{j}\le C\,n^{\varepsilon}\qquad (n\ge 1),d(n)j≤Cnε(n≥1),

where d(n)d(n)d(n) is the number of positive divisors of nnn. It follows immediately from the divisor bound d(n)≪δnδd(n)\ll_{\delta}n^{\delta}d(n)≪δ​nδ applied with δ=ε/j\delta=\varepsilon/jδ=ε/j, the point being that a fixed power of a quantity that is O(nδ)O(n^{\delta})O(nδ) for every δ\deltaδ is again O(nε)O(n^{\varepsilon})O(nε) for every ε\varepsilonε.

The reason the power is needed rather than the bare divisor bound: in Weyl's inequality of degree kkk one must count the tuples (h1,…,hk−1)(h_1,\dots,h_{k-1})(h1​,…,hk−1​) whose product takes a given value mmm, and that count is bounded by a power of d(m)d(m)d(m) growing with kkk. This lemma is what absorbs the whole tuple count into a single NεN^{\varepsilon}Nε factor.

Formalization Note. The case j=0j=0j=0 is included and is not vacuous: the claim becomes 1≤Cnε1\le C n^{\varepsilon}1≤Cnε, which is why the constant is taken to be at least 111.

Preamble
import Definitions.Def_CircleMethod_char
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.NumberTheory.Divisors
open Finset
Formal statement
namespace CircleMethod

theorem divisor_bound_pow {ε : ℝ} (hε : 0 < ε) (j : ℕ) :
    ∃ C : ℝ, 0 < C ∧ ∀ n : ℕ, 0 < n →
      ((n.divisors.card : ℝ)) ^ j ≤ C * (n : ℝ) ^ ε := by sorry

end CircleMethod
Source
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 6th ed., Oxford University Press, 2008, Theorem 315; the power form is used in R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., 1997, proof of Lemma 2.4.

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