Lemm's sums–differences barrier
OpenArithmeticKakeya.lemm_sums_differences_barrieradditive-combinatoricskakeya
Lemm's lower bound: every forcing constructible proof for the sums–differences set has score strictly greater than . Equivalently the sums–differences exponent exceeds , so this method cannot reach the conjectured value. Stated in cross-multiplied form.
Preamble
import Mathlib import Definitions.Def_ArithmeticKakeya_grid import Definitions.Def_ArithmeticKakeya_forcing
Formal statement
namespace ArithmeticKakeya
theorem lemm_sums_differences_barrier
(G : ConstructibleGraph ({(1, 0), (0, 1), (1, 1)} : Finset (ℤ × ℤ)))
(R : List (List ℕ → ℤ × ℤ)) (T : List (List ℕ))
(hXT : IsXSet G R T) (hF : Forces G R T) (ht : T.length < n G) :
88949 * (n G - T.length) < 50000 * (m G + R.length) := by sorry
end ArithmeticKakeyaSource
Lemm, PAMS 143 (2015), Thm 2.1; as stated in https://epoch.ai/frontiermath/open-problems/arithmetic-kakeya
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.