Proposition 3 — four-element index sets in with
OpenRudinSquares.prop3_four_subsetsarithmetic-progressionsnumber-theorysquares
Proposition 3 of the paper. Let be a four-element subset of . Then unless is equivalent (under integer translation and rational dilation) to one of the five sets
in which case . Equivalently: if is equivalent to one of these five sets then is empty; otherwise is infinite. The five exceptional sets are exactly the symmetric four-term patterns whose associated elliptic curve has rank and only the eight trivial rational points. This is the base case of the sieve used to bound for small .
Preamble
import Mathlib import Definitions.Def_RudinSquares_Defs
Formal statement
namespace RudinSquares
theorem prop3_four_subsets (I : Finset ℤ) (hI : I ⊆ Finset.Icc (0 : ℤ) 6) (hcard : I.card = 4) :
(GenEq I {0,1,2,3} ∨ GenEq I {0,1,3,4} ∨ GenEq I {0,1,4,5} ∨ GenEq I {0,2,3,5} ∨ GenEq I {0,1,5,6} → z I = 0) ∧
(¬ (GenEq I {0,1,2,3} ∨ GenEq I {0,1,3,4} ∨ GenEq I {0,1,4,5} ∨ GenEq I {0,2,3,5} ∨ GenEq I {0,1,5,6}) → z I = ⊤) := by sorry
end RudinSquaresSource
E. González-Jiménez and X. Xarles, 'On a conjecture of Rudin on squares in arithmetic progressions', LMS J. Comput. Math. 17(1) (2014) 58–76, doi:10.1112/S1461157013000259, Proposition 3, p. 60.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.