Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sums–Differences: a constructible proof of score <11/6<11/6<11/6

Open
ArithmeticKakeya.sums_differences_below_11_6

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

additive-combinatoricskakeyaopen-problem

For the sums–differences dilate set X={(1,0),(0,1),(1,1)}X=\{(1,0),(0,1),(1,1)\}X={(1,0),(0,1),(1,1)}, exhibit a forcing constructible proof of score strictly below 11/611/611/6, improving Katz–Tao's bound α(X)≤11/6\alpha(X)\le 11/6α(X)≤11/6. The best known lower bound for this exponent is >1.77898>1.77898>1.77898 (Lemm).

Preamble
import Mathlib
import Definitions.Def_ArithmeticKakeya_grid
import Definitions.Def_ArithmeticKakeya_forcing
Formal statement
namespace ArithmeticKakeya
theorem sums_differences_below_11_6 :
    ∃ (G : ConstructibleGraph ({(1, 0), (0, 1), (1, 1)} : Finset (ℤ × ℤ)))
      (R : List (List ℕ → ℤ × ℤ)) (T : List (List ℕ)),
      IsXSet G R T ∧ Forces G R T ∧ T.length < n G ∧
      6 * (m G + R.length) < 11 * (n G - T.length) := by sorry
end ArithmeticKakeya
Source
https://epoch.ai/frontiermath/open-problems/arithmetic-kakeya (Goal 2)
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