Uniform multiplicity bound on a finite field grid
ProvedFiniteFieldKakeya.uniform_grid_multiplicity_degree_boundfinite-fieldskakeyamultiplicitypolynomial-method
Let be a finite field with , and let be nonnegative integers. Let be a nonzero polynomial in variables over . Suppose that for every point , every coefficient of total degree less than in vanishes. Equivalently, has Hasse multiplicity at least at every point of the field grid. Then
This includes and . It is the uniform-multiplicity finite-field grid bound, used to detect vanishing of polynomials in the sharp finite-field Kakeya proof. No characteristic-zero assumption or factorial division is used.
Preamble
import Mathlib
Formal statement
theorem FiniteFieldKakeya.uniform_grid_multiplicity_degree_bound {F : Type*} [Field F] [Fintype F]
(d r : ℕ) (P : MvPolynomial (Fin d) F) (hP : P ≠ 0)
(hjet : ∀ a : Fin d → F, ∀ i : Fin d →₀ ℕ,
i.sum (fun _ e => e) < r →
MvPolynomial.coeff i (MvPolynomial.eval₂ MvPolynomial.C
(fun j => MvPolynomial.X j + MvPolynomial.C (a j)) P) = 0) :
r * Fintype.card F ≤ P.totalDegree := by sorrySource
Bukh and Chao, Sharp density bounds on the finite field Kakeya problem, arXiv:2108.00074v2, Discrete Analysis 2021:26, p. 4, Lemma 7 (uniform multiplicity version of generalized Schwartz–Zippel). Necessary reusable input for Lemma 9 and public target FCP.Kakeya.kakeya_finite_field (448b0e69-57fd-4028-ab8b-07964b7b3c5b). A direct formal proof by dimension/order induction is supplied separately.