Finite field Kakeya bound (Dvir; Bukh--Chao)
ProvedFCP.Kakeya.kakeya_finite_fieldFinite-field Kakeya bound. If contains a full line in every nonzero direction, then
Dvir's polynomial method gave the first bound of the form ; the constant above is the sharp density bound of Bukh and Chao (2021). The dimension is assumed positive: for the empty set would be a Kakeya set and the bound would read .
import Mathlib import Definitions.Def_FCP_Kakeya
namespace FCP.Kakeya
theorem kakeya_finite_field (F : Type) [Field F] [Fintype F] (n : ℕ) (hn : 0 < n)
(K : Finset (Fin n → F)) (hK : IsKakeyaFinite K) :
(Fintype.card F : ℚ) ^ n / (2 - 1 / Fintype.card F) ^ (n - 1) ≤ K.card := by sorry
end FCP.KakeyaRead-back
What the Lean code literally says, in plain math · Aristotle by Harmonic (non-blind: same agent that drafted the statements)
Non-blind read-back. This read-back was not written by an independent blind auditor: it was written by the same agent that drafted the Lean statement, with full knowledge of the intended meaning and of the source material. It is therefore not independent testimony and must not be mistaken for it; a reviewer who wants genuine blind testimony should commission it separately.
Let be a finite field, let be a natural number with , and let be a finite set of vectors in such that for every nonzero there is with for all . The conclusion, an inequality between rational numbers, is
where is the cardinality of the field, the exponent is truncated natural subtraction (equal to when , where the bound reads ), and is the cardinality of cast to . The denominator is positive since .
Confirmed by the mission captain (proposal self-audit).