Prove2Me
Navigate
MissionsFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

∣S(ph,a)∣≤k3 (ph)1−1/k|S(p^h,a)|\le k^{3}\,(p^h)^{1-1/k}∣S(ph,a)∣≤k3(ph)1−1/k at prime powers

Open
CMSharp.S_prime_pow_bound

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

analytic-number-theorycircle-methodexponential-sumsnumber-theory

Let k≥2k\ge2k≥2, let ppp be a prime, let h≥1h\ge1h≥1, and let aaa be an integer with p∤ap\nmid ap∤a. Then

∣S(ph,a)∣  ≤  k3(ph)1−1k.\left|S(p^{h},a)\right|\;\le\;k^{3}\left(p^{h}\right)^{1-\frac1k}.​S(ph,a)​≤k3(ph)1−k1​.

This is the local half of Vaughan's Theorem 4.2: the estimate ∣S(q,a)∣≪q1−1/k+ε|S(q,a)|\ll q^{1-1/k+\varepsilon}∣S(q,a)∣≪q1−1/k+ε restricted to prime-power moduli, with an explicit constant depending only on kkk.

The proof is an induction on hhh in which three regimes appear. For h=1h=1h=1 one needs genuine cancellation, supplied by the Gauss-sum bound ∣S(p,a)∣≤(k−1)p|S(p,a)|\le(k-1)\sqrt p∣S(p,a)∣≤(k−1)p​ together with 12≤1−1k\tfrac12\le1-\tfrac1k21​≤1−k1​. For hhh below 2(vp(k)+1)2(v_{p}(k)+1)2(vp​(k)+1) the trivial bound ∣S∣≤ph|S|\le p^{h}∣S∣≤ph already suffices, because pvp(k)∣kp^{v_p(k)}\mid kpvp​(k)∣k forces ppp and hhh to be bounded in terms of kkk alone — this is where the constant k3k^{3}k3 comes from. Above that threshold the recursion S(ph,a)=pk−1S(ph−k,a)S(p^{h},a)=p^{k-1}S(p^{h-k},a)S(ph,a)=pk−1S(ph−k,a) applies, and it is exponent-neutral: pk−1⋅p(h−k)(1−1/k)=ph(1−1/k)p^{k-1}\cdot p^{(h-k)(1-1/k)}=p^{h(1-1/k)}pk−1⋅p(h−k)(1−1/k)=ph(1−1/k), so the induction closes with the same constant. When h≤kh\le kh≤k the recursion instead terminates at the exact value ph−1p^{h-1}ph−1, which already satisfies the bound.

Combined with multiplicativity of q↦S(q,a)q\mapsto S(q,a)q↦S(q,a) and the divisor bound, this yields the global estimate for arbitrary moduli.

Preamble
import Definitions.Def_CircleMethod_waring
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.Data.Nat.Prime.Basic
Formal statement
namespace CMSharp

theorem S_prime_pow_bound {k : ℕ} (hk : 2 ≤ k) {p h : ℕ} (hp : p.Prime) (hh : 1 ≤ h) {a : ℤ}
    (ha : ¬ ((p : ℤ) ∣ a)) :
    ‖CircleMethod.S k (p ^ h) a‖ ≤ (k : ℝ) ^ 3 * ((p ^ h : ℕ) : ℝ) ^ (1 - 1 / (k : ℝ)) := by sorry

end CMSharp
Source
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Chapter 4, Theorem 4.2 and its proof in Section 4.1.

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