Waring's problem is locally soluble for
ProvedCircleMethod.local_solubilitycircle-methodnumber-theorysingular-serieswaring
For and , the equation is soluble in every ,
with a uniform bound: LocalSolubility k s holds, i.e. for every prime there is such
that the local factor satisfies and is real, for every integer .
This is the arithmetic heart of Waring's problem. It is the statement that no congruence obstruction can prevent representation once , and it is exactly the input the circle method needs to turn its major-arc main term into a genuine asymptotic.
Preamble
/- # Positivity of the singular series in Waring's problem `singSeries k s n = ∑' q, locDens k s q n` is the singular series `𝔖(n)`. This file establishes its Euler product `𝔖(n) = ∏_p σ_p(n)`, `σ_p(n) = ∑_j A(p^j, n)`, bounds the tail of the product, and assembles a uniform lower bound `𝔖(n) ≥ c(k,s) > 0` from the local-solubility statement `LocalSolubility k s` (Vaughan, Lemmas 2.13–2.15). -/ import Definitions.Def_CircleMethod_singpos import Theorems.Thm_CircleMethod_locDens_mul import Theorems.Thm_CircleMethod_locDens_one import Theorems.Thm_CircleMethod_locDens_zero_modulus import Theorems.Thm_CircleMethod_locDens_bound import Theorems.Thm_CircleMethod_locDens_exponent_lt_neg_one import Theorems.Thm_CircleMethod_sing_series_summable_norm import Theorems.Thm_CircleMethod_e_zero import Theorems.Thm_CircleMethod_e_add import Theorems.Thm_CircleMethod_sum_e_div_orthogonality import Theorems.Thm_Vino_e_div_congr import Mathlib.NumberTheory.EulerProduct.Basic import Mathlib.NumberTheory.SumPrimeReciprocals import Mathlib.NumberTheory.Padics.Hensel import Mathlib.NumberTheory.Padics.RingHoms import Mathlib.Combinatorics.Additive.CauchyDavenport open Finset Filter Topology open Finset Filter Topology
Formal statement
namespace CircleMethod
theorem local_solubility {k s : ℕ} (hk : 2 ≤ k) (hs : 2 ^ k < s) : LocalSolubility k s := by sorry
end CircleMethodSource
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Section 2.6, Theorem 2.4