Hua's inequality, eighth moment
ProvedCircleMethod.hua_L8analytic-number-theorycircle-methodnumber-theorywaring-problem
The case of Hua's inequality: for and every ,
Equivalently, the equation has solutions in , against the trivial and the diagonal count . The first case beyond the classical fourth moment, and the first that genuinely requires the differencing recursion rather than a direct divisor-counting argument.
Preamble
import Definitions.Def_CircleMethod_waring import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.Analysis.SpecialFunctions.Gamma.Beta import Mathlib.Analysis.Fourier.Inversion import Mathlib.NumberTheory.Divisors open Finset MeasureTheory
Formal statement
namespace CircleMethod
theorem hua_L8 {k : ℕ} (hk : 3 ≤ k) {ε : ℝ} (hε : 0 < ε) :
∃ C : ℝ, 0 < C ∧ ∀ N : ℕ, 0 < N →
(∫ θ in (0:ℝ)..1, ‖∑ x ∈ Finset.range N, e (θ * (x : ℝ) ^ k)‖ ^ 8)
≤ C * (N : ℝ) ^ (5 + ε) := by sorry
end CircleMethodSource
L.-K. Hua, On Waring's problem, Quarterly Journal of Mathematics 9 (1938), 199-202; R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Lemma 2.5 (Hua's inequality).