The arithmetic Kakeya statement AK(α)
DefinitionArithmeticKakeya_akadditive-combinatoricskakeya
AK α is the arithmetic Kakeya statement at exponent : for every there are and a finite non-empty dilate set with no element of coordinate-sum zero, such that for every finite some satisfies , where . Since is finite and non-empty and , the form is equivalent to the source's form. The conjecture is .
Definition code
import Mathlib
namespace ArithmeticKakeya
/-- `AK α`: for every `ε > 0` there are `C > 0` and a finite non-empty `X ⊂ ℤ²` with no
element of coordinate-sum zero, such that for every finite `G ⊂ ℤ²` some `x ∈ X` has
`|(1,-1)·G| ≤ C · |x·G|^{α+ε}`. Equivalent to the source's `max_{x∈X}` form. -/
noncomputable def AK (α : ℝ) : Prop :=
∀ ε : ℝ, 0 < ε → ∃ C : ℝ, 0 < C ∧ ∃ X : Finset (ℤ × ℤ), X.Nonempty ∧
(∀ x ∈ X, x.1 + x.2 ≠ 0) ∧
∀ G : Finset (ℤ × ℤ), ∃ x ∈ X,
((G.image (fun g => g.1 - g.2)).card : ℝ) ≤
C * ((G.image (fun g => x.1 * g.1 + x.2 * g.2)).card : ℝ) ^ (α + ε)
end ArithmeticKakeya
Source
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.