Hensel lifting counts solutions:
ProvedCircleMethod.solCount_gecircle-methodnumber-theorysingular-serieswaring
Suppose that at the prime two local conditions hold at level : the lifting
property KthPowerLift (any congruent to mod with is a -th
power residue mod every ) and representability LocalRep (every is
with a unit coordinate ). Then for all
and every , with variables,
Each of the non-distinguished coordinates may be moved freely through a full set of residues modulo , and the distinguished unit coordinate is then repaired by Hensel lifting. Combined with the divisor-sum identity this is what makes bounded below by a positive constant independent of .
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 solCount_ge {p k t γ : ℕ} (hp : p.Prime) (hlift : KthPowerLift p k γ)
(hrep : LocalRep p k t γ) (n : ℤ) {h : ℕ} (hh : γ ≤ h) :
(p ^ (h - γ)) ^ t ≤ solCount k (t + 1) (p ^ h) n := 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, Lemma 2.14