A constructible proof of score implies
OpenArithmeticKakeya.constructible_proof_implies_AKadditive-combinatoricskakeya
The Katz–Tao reduction: if is a forcing -set for a constructible graph , no element of has coordinate-sum zero, and , then holds. It combines the counting lemma (lower bound on copies of ) with the forcing property (upper bound), turning a combinatorial configuration into an arithmetic Kakeya exponent.
Preamble
import Mathlib import Definitions.Def_ArithmeticKakeya_grid import Definitions.Def_ArithmeticKakeya_forcing import Definitions.Def_ArithmeticKakeya_ak
Formal statement
namespace ArithmeticKakeya
theorem constructible_proof_implies_AK
{X : Finset (ℤ × ℤ)} (hX : ∀ x ∈ X, x.1 + x.2 ≠ 0)
(G : ConstructibleGraph X) (R : List (List ℕ → ℤ × ℤ)) (T : List (List ℕ))
(hXT : IsXSet G R T) (hF : Forces G R T) (ht : T.length < n G) :
AK ((m G + R.length : ℝ) / (n G - T.length : ℝ)) := by sorry
end ArithmeticKakeyaSource
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.