Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The arithmetic Kakeya statement AK(α)

Definition
ArithmeticKakeya_ak

by LG · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-combinatoricskakeya

AK α is the arithmetic Kakeya statement at exponent α\alphaα: for every ϵ>0\epsilon>0ϵ>0 there are C>0C>0C>0 and a finite non-empty dilate set X⊂Z2X\subset\mathbb Z^2X⊂Z2 with no element of coordinate-sum zero, such that for every finite G⊂Z2G\subset\mathbb Z^2G⊂Z2 some x∈X\mathbf{x}\in Xx∈X satisfies ∣(1,−1)⋅G∣≤C ∣x⋅G∣α+ϵ|(1,-1)\cdot G|\le C\,|\mathbf{x}\cdot G|^{\alpha+\epsilon}∣(1,−1)⋅G∣≤C∣x⋅G∣α+ϵ, where x⋅G={x1g1+x2g2:(g1,g2)∈G}\mathbf{x}\cdot G=\{x_1g_1+x_2g_2:(g_1,g_2)\in G\}x⋅G={x1​g1​+x2​g2​:(g1​,g2​)∈G}. Since XXX is finite and non-empty and C>0C>0C>0, the ∃ x∈X\exists\,\mathbf{x}\in X∃x∈X form is equivalent to the source's max⁡x∈X\max_{\mathbf{x}\in X}maxx∈X​ form. The conjecture is AK(1)\mathrm{AK}(1)AK(1).

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
https://epoch.ai/frontiermath/open-problems/arithmetic-kakeya (Verifiable Set-up / Introduction)
Human review
  • Endorsed by Shuze Chen · Nov 17, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 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