Recursion
ProvedCircleMethod.weylSum_succanalytic-number-theorycircle-methodexponential-sumsnumber-theory
Extending the range of a Weyl sum by one term:
This is the recursion that supports induction on , and it is the form in which partial summation (Abel summation) is applied to Weyl sums with smooth weights.
Preamble
import Definitions.Def_CircleMethod_weylsum import Mathlib.Algebra.BigOperators.Group.Finset.Basic open Finset
Formal statement
namespace CircleMethod
theorem weylSum_succ (k : ℕ) (α : ℝ) (N : ℕ) :
weylSum k α (N + 1) = weylSum k α N + e (α * (N : ℝ) ^ k) := by sorry
end CircleMethodSource
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Section 2.1 (Weyl sums and the Farey dissection) and Chapter 4 (Waring's problem); H. Weyl, Ueber die Gleichverteilung von Zahlen mod. Eins, Mathematische Annalen 77 (1916), 313-352.