Hua's inequality
ProvedCircleMethod.hua_inequalityHua's inequality, in full generality. For , every and every there is a constant with
By orthogonality the integral counts solutions of in ; the theorem says there are essentially only the diagonal ones, to within . At it is the exact identity ; each further gains a factor over the trivial bound.
This is the mean-value half of the circle method, complementing the pointwise Weyl bound. Neither alone suffices on the minor arcs: one interpolates between them by Hölder, and it is Hua's inequality at that makes the minor-arc contribution to Waring's problem negligible for .
Formalization Note. The proof is not by Weyl differencing plus Hölder — that route provably loses a full power of at every step, giving where the truth is already at , because the differenced sums cancel against one another and Hölder cannot see it. The argument here instead pairs two Fourier expansions of against each other: the moment expansion downstairs, and -fold differencing kept in exact character form upstairs, with the divisor bound applied to the differenced equation . The recursion obtained is , which is tight.
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
namespace CircleMethod
theorem hua_inequality {k : ℕ} (hk : 2 ≤ k) {ε : ℝ} (hε : 0 < ε) (j : ℕ) (hj : 1 ≤ j)
(hjk : j ≤ k) :
∃ C : ℝ, 0 < C ∧ ∀ N : ℕ, 0 < N →
(∫ θ in (0:ℝ)..1, ‖∑ x ∈ Finset.range N, e (θ * (x : ℝ) ^ k)‖ ^ (2 ^ j))
≤ C * (N : ℝ) ^ ((2 ^ j : ℕ) - (j : ℝ) + ε) := by sorry
end CircleMethod