Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Arithmetic Kakeya: a constructible proof of score ≤1.675\le 1.675≤1.675

Open
ArithmeticKakeya.arithmetic_kakeya_1675

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

additive-combinatoricskakeyaopen-problem

Exhibit a finite dilate set X⊂Z2X\subset\mathbb Z^2X⊂Z2 containing (0,0)(0,0)(0,0) whose non-zero elements have non-zero coordinate sum, an XXX-constructible graph GGG, and a forcing XXX-set (R,T)(R,T)(R,T) with ∣T∣<n(G)|T|<n(G)∣T∣<n(G) and score (m(G)+∣R∣)/(n(G)−∣T∣)≤1.675=67/40(m(G)+|R|)/(n(G)-|T|)\le 1.675=67/40(m(G)+∣R∣)/(n(G)−∣T∣)≤1.675=67/40 (stated in cross-multiplied form). This is the FrontierMath open problem at its default difficulty: any such object improves the best known arithmetic Kakeya exponent ϑ=1.6751308…\vartheta=1.6751308\dotsϑ=1.6751308… and hence the known Kakeya dimension lower bounds in high dimensions.

Preamble
import Mathlib
import Definitions.Def_ArithmeticKakeya_grid
import Definitions.Def_ArithmeticKakeya_forcing
Formal statement
namespace ArithmeticKakeya
theorem arithmetic_kakeya_1675 :
    ∃ (X : Finset (ℤ × ℤ)) (G : ConstructibleGraph X)
      (R : List (List ℕ → ℤ × ℤ)) (T : List (List ℕ)),
      (0, 0) ∈ X ∧
      (∀ x ∈ X, x ≠ (0, 0) → x.1 + x.2 ≠ 0) ∧
      IsXSet G R T ∧ Forces G R T ∧ T.length < n G ∧
      40 * (m G + R.length) ≤ 67 * (n G - T.length) := by sorry
end ArithmeticKakeya
Source
https://epoch.ai/frontiermath/open-problems/arithmetic-kakeya (Problem section, default difficulty 1.675)
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