Mixed-line jet detection for anisotropic polynomial spaces (Bukh–Chao Lemma 9)
ProvedFiniteFieldKakeya.mixed_line_jet_detectionfinite-fieldshasse-derivativeskakeyapolynomial-method
Let be a finite field of cardinality , let be natural numbers with , and choose an arbitrary affine-line anchor for each . Let be a polynomial in variables. Assume every monomial in its support satisfies
For every transverse multi-index with , restrict the Hasse derivative to the line . Suppose that at every its Taylor coefficients of orders vanish, for every . Then is the zero polynomial.
This is the polynomial detection step for the sharp finite-field Kakeya bound. The theorem allows any integer , including the parameter used in the paper, and retains . It requires neither a Kakeya hypothesis on the anchors nor a characteristic-zero assumption. The paper's distinguished last coordinate is relabeled as coordinate zero.
Preamble
import Mathlib import Definitions.Def_KakeyaPolynomialMethods
Formal statement
theorem FiniteFieldKakeya.mixed_line_jet_detection {F : Type*} [Field F] [Fintype F]
(d r rp : ℕ) (hr : 0 < r) (hrrp : r ≤ rp)
(a : (Fin d → F) → (Fin (d+1) → F)) (P : MvPolynomial (Fin (d+1)) F)
(hsupport : ∀ α ∈ P.support,
(∑ j : Fin d, α j.succ) < r * Fintype.card F ∧
α.sum (fun _ e => e) < rp * Fintype.card F)
(hjet : ∀ i : Fin d →₀ ℕ, i.sum (fun _ e => e) < r →
∀ b : Fin d → F, ∀ t : F, ∀ j : ℕ,
j < rp - i.sum (fun _ e => e) / Fintype.card F →
(Polynomial.taylor t (KakeyaPolynomialMethods.lineMap (a b) (Fin.cons 1 b)
(KakeyaHasse.hasse (i.cons 0) P))).coeff j = 0) : P = 0 := by sorrySource
Bukh and Chao, Sharp density bounds on the finite field Kakeya problem, arXiv:2108.00074v2, Discrete Analysis 2021:26, p. 5, Lemma 9, using Lemma 7 (p. 4). Generalization: the paper specializes r′=(2−1/q)r; this statement allows any natural r′≥r with the same degree and mixed-jet thresholds. Necessary detection input for public sharp Kakeya target448b0e69-57fd-4028-ab8b-07964b7b3c5b.