Arithmetic Kakeya: a constructible proof of score
OpenArithmeticKakeya.arithmetic_kakeya_1675additive-combinatoricskakeyaopen-problem
Exhibit a finite dilate set containing whose non-zero elements have non-zero coordinate sum, an -constructible graph , and a forcing -set with and score (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 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 ArithmeticKakeyaSource
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.