The representation count in Waring's problem as an integral
ProvedCircleMethod.waring_countThe starting point of the circle method for Waring's problem. Let denote the number of -tuples of bases with and
Then, with the Weyl sum,
Expanding the -th power ranges over all tuples of bases and orthogonality annihilates every tuple whose powers do not sum to . Estimating this integral — large on the major arcs, negligible on the minor arcs — is exactly the Hardy--Littlewood method, and the asymptotic is the evaluation of it.
Formalization Note. The count is over tuples of bases in , not over tuples of -th powers. The distinction matters: passing through the image set would collapse distinct bases whenever is non-injective and would lose multiplicity. Indexing by bases directly makes the identity hold for every with no hypotheses at all, including the degenerate .
import Definitions.Def_CircleMethod_waring import Definitions.Def_CircleMethod_weylsum import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.Analysis.PSeries import Mathlib.Analysis.Normed.Group.InfiniteSum import Mathlib.NumberTheory.Divisors import Mathlib.Data.Fintype.Pi open Finset
namespace CircleMethod
theorem waring_count (k s N : ℕ) (n : ℤ) :
(∫ α in (0:ℝ)..1, (weylSum k α N) ^ s * e (-(n : ℝ) * α))
= ((((Fintype.piFinset (fun _ : Fin s => Finset.range N)).filter
(fun v => ∑ i, ((v i : ℤ) ^ k) = n)).card : ℕ) : ℂ) := by sorry
end CircleMethod