Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite field Kakeya bound (Dvir; Bukh--Chao)

Proved
FCP.Kakeya.kakeya_finite_field

by LG · Sep 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsharmonic-analysis

Finite-field Kakeya bound. If K⊆Fq nK \subseteq \mathbb{F}_q^{\,n}K⊆Fqn​ contains a full line in every nonzero direction, then

∣K∣  ≥  qn(2−1/q) n−1.|K| \;\ge\; \frac{q^{n}}{(2 - 1/q)^{\,n-1}}.∣K∣≥(2−1/q)n−1qn​.

Dvir's polynomial method gave the first bound of the form cnqnc_n q^ncn​qn; the constant above is the sharp density bound of Bukh and Chao (2021). The dimension is assumed positive: for n=0n = 0n=0 the empty set would be a Kakeya set and the bound would read 1≤01 \le 01≤0.

Preamble
import Mathlib
import Definitions.Def_FCP_Kakeya
Formal statement
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.Kakeya
Source
Formal Conjectures library (Google DeepMind), Apache-2.0, https://github.com/google-deepmind/formal-conjectures (FormalConjectures/Wikipedia/Kakeya.lean); Z. Dvir, On the size of Kakeya sets in finite fields, J. Amer. Math. Soc. 22 (2009), 1093--1097; B. Bukh and T.-W. Chao, Sharp density bounds on the finite field Kakeya problem, Discrete Analysis 26 (2021)
Read-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 FFF be a finite field, let nnn be a natural number with n>0n > 0n>0, and let KKK be a finite set of vectors in FnF^nFn such that for every nonzero v∈Fnv \in F^nv∈Fn there is a∈Fna \in F^na∈Fn with a+tv∈Ka + tv \in Ka+tv∈K for all t∈Ft \in Ft∈F. The conclusion, an inequality between rational numbers, is

∣F∣ n(2−1∣F∣) n−1  ≤  ∣K∣,\frac{|F|^{\,n}}{\left(2 - \frac{1}{|F|}\right)^{\,n-1}} \;\le\; |K|,(2−∣F∣1​)n−1∣F∣n​≤∣K∣,

where ∣F∣|F|∣F∣ is the cardinality of the field, the exponent n−1n-1n−1 is truncated natural subtraction (equal to 000 when n=1n = 1n=1, where the bound reads ∣F∣≤∣K∣|F| \le |K|∣F∣≤∣K∣), and ∣K∣|K|∣K∣ is the cardinality of KKK cast to Q\mathbb{Q}Q. The denominator is positive since ∣F∣≥2|F| \ge 2∣F∣≥2.

Human review
  • Endorsed by Shuze Chen · Sep 17, 2026

  • Endorsed by LG · Sep 17, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me