Local factors, local solubility, Hensel lifting (singular series positivity)
DefinitionCircleMethod_singposcircle-methodnumber-theorysingular-serieswaring
Objects used to prove that the singular series of Waring's problem is bounded below by a positive constant.
localFactor k s p nis the local factor of the Euler product , where is the local densitylocDens.LocalSolubility k sasserts that for each prime there is with (real) for every .solCount k s q n.KthPowerLift p k γis the Hensel-type lifting property: whenever and , is a -th power residue modulo every .LocalRep p k t γsays every is with a unit coordinate .sumsetIter A tis the -fold iterated sumset (used with Cauchy–Davenport).
Definition code
import Definitions.Def_CircleMethod_asymptotic
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Data.Fintype.Pi
import Mathlib.Algebra.Group.Pointwise.Finset.Basic
open Finset
namespace CircleMethod
/-- The local factor `σ_p(n) = ∑_{j ≥ 0} A(p^j, n)` of the singular series at the prime `p`,
where `A(q, n) = locDens k s q n` is the local density. -/
noncomputable def localFactor (k s p : ℕ) (n : ℤ) : ℂ := ∑' j : ℕ, locDens k s (p ^ j) n
/-- **Local solubility**: every local factor `σ_p(n)` is real and bounded below by a positive
constant `c_p > 0` uniformly in `n`. -/
def LocalSolubility (k s : ℕ) : Prop :=
∀ p : ℕ, p.Prime → ∃ c : ℝ, 0 < c ∧ ∀ n : ℤ, ∃ r : ℝ, c ≤ r ∧ localFactor k s p n = r
/-- `M_n(q) = #{x ∈ [0,q)^s : ∑ x_i^k ≡ n (mod q)}`, the number of solutions of the
congruence `x_1^k + ⋯ + x_s^k ≡ n (mod q)`. -/
noncomputable def solCount (k s q : ℕ) (n : ℤ) : ℕ :=
((Fintype.piFinset (fun _ : Fin s => Finset.range q)).filter
(fun x => (q : ℤ) ∣ ∑ i, ((x i : ℤ) ^ k) - n)).card
/-- **Hensel-type lifting property** at level `γ`: if `p ∤ a` and `a^k ≡ m (mod p^γ)`, then `m`
is a `k`-th power residue modulo every power `p^h`. -/
def KthPowerLift (p k γ : ℕ) : Prop :=
∀ (a m : ℤ), ¬ (p : ℤ) ∣ a → (p : ℤ) ^ γ ∣ a ^ k - m →
∀ h : ℕ, ∃ y : ℤ, (p : ℤ) ^ h ∣ y ^ k - m
/-- **Representability at level `p^γ`** with a unit coordinate: every `n` is
`a^k + ∑_{i<t} x_i^k (mod p^γ)` for some `a` with `p ∤ a`. -/
def LocalRep (p k t γ : ℕ) : Prop :=
∀ n : ℤ, ∃ (a : ℤ) (x : Fin t → ℤ), ¬ (p : ℤ) ∣ a ∧ (p : ℤ) ^ γ ∣ a ^ k + ∑ i, x i ^ k - n
open scoped Pointwise in
/-- The `t`-fold iterated sumset `A + ⋯ + A` (with `{0}` for `t = 0`). -/
def sumsetIter {α : Type*} [AddCommMonoid α] [DecidableEq α] (A : Finset α) : ℕ → Finset α
| 0 => {0}
| t + 1 => sumsetIter A t + A
end CircleMethod
Source
R. C. Vaughan, The Hardy–Littlewood Method, 2nd ed., Cambridge Tracts 125, §2.6 (Lemmas 2.12–2.15, Theorem 2.4: positivity of the singular series)