The Hardy-Littlewood asymptotic formula for Waring's problem
ProvedCircleMethod.waring_asymptoticThe Hardy--Littlewood asymptotic formula for Waring's problem. For and , the number of representations of as a sum of non-negative -th powers satisfies
where is the singular series.
This is the theorem the circle method was invented to prove (Hardy--Littlewood, Partitio Numerorum I, 1920). Its content is a local-global principle made quantitative: the number of representations is asymptotically the product of the local densities of solutions — the archimedean density, which is the Gamma factor, and the -adic densities, whose product is the singular series. It is strictly stronger than Hilbert's theorem that is finite, since it gives the order of growth and not merely non-vanishing.
The proof is the method in full. The representation count is written as with and . The circle is dissected by Farey fractions into major arcs, near rationals with small denominator, and minor arcs. On the major arcs is approximated by , and summing those approximations assembles the singular series times the singular integral, which evaluates to the Gamma factor. On the minor arcs Weyl's inequality gives a pointwise power saving and Hua's inequality gives a mean value bound; interpolating between them by H"older shows the minor arcs contribute . The hypothesis is exactly what makes that interpolation work and what makes the singular series converge absolutely.
Formalization Note. The error is stated with Asymptotics.IsLittleO along atTop, which unfolds to the usual - form and cannot be satisfied by a convenient choice of threshold. The count is over all of , not over a box; the two agree because bounds each . Summability of the singular series is a consequence of , not an added hypothesis. The exponent is a real power.
import Definitions.Def_CircleMethod_asymptotic import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Gamma.Basic import Mathlib.Analysis.Asymptotics.Defs open Finset Filter Asymptotics
namespace CircleMethod
theorem waring_asymptotic {k s : ℕ} (hk : 2 ≤ k) (hs : 2 ^ k < s) :
(fun n : ℕ => (repCount k s n : ℂ) - mainTerm k s n)
=o[atTop] (fun n : ℕ => (n : ℝ) ^ ((s : ℝ) / (k : ℝ) - 1)) := by sorry
end CircleMethod