The part of equals for
ProvedCMSharp.S_pdvd_part_baseanalytic-number-theorycircle-methodexponential-sumsnumber-theory
Fix , a modulus and an integer , and split the complete exponential sum
according to whether . In the range the part over divisible by degenerates completely:
Indeed, writing gives , which is an integer because ; every character value is therefore , and there are exactly multiples of below .
This is the base case of the prime-power recursion for : it terminates the descent once the exponent drops to at most . The value is consistent with the target bound , since precisely when .
Formalization note. As with the recursion step, no coprimality between and is needed — the identity is an exact evaluation, not an estimate.
Preamble
import Definitions.Def_CircleMethod_char import Mathlib.Data.Nat.Prime.Basic import Mathlib.Algebra.BigOperators.Group.Finset.Basic open Finset
Formal statement
namespace CMSharp
theorem S_pdvd_part_base {k p h : ℕ} (hp : 0 < p) (hh : 1 ≤ h) (hhk : h ≤ k) (a : ℤ) :
∑ m ∈ (Finset.range (p ^ h)).filter (fun m => p ∣ m),
CircleMethod.e ((a : ℝ) * (m : ℝ) ^ k / ((p ^ h : ℕ) : ℝ)) = ((p ^ (h - 1) : ℕ) : ℂ) := by sorry
end CMSharpSource
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Chapter 4, Section 4.1, Lemma 4.4 and the proof of Theorem 4.2 (the reduction of S(p^h,a) to its p | m part).