Sums–Differences: a constructible proof of score
OpenArithmeticKakeya.sums_differences_below_11_6additive-combinatoricskakeyaopen-problem
For the sums–differences dilate set , exhibit a forcing constructible proof of score strictly below , improving Katz–Tao's bound . The best known lower bound for this exponent is (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 ArithmeticKakeyaSource
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.