Katz–Tao configuration of score
OpenArithmeticKakeya.katz_tao_config_11_6additive-combinatoricskakeya
The first Katz–Tao configuration: for there is a forcing constructible proof of score . Their explicit example has , , , , giving .
Preamble
import Mathlib import Definitions.Def_ArithmeticKakeya_grid import Definitions.Def_ArithmeticKakeya_forcing
Formal statement
namespace ArithmeticKakeya
theorem katz_tao_config_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.