Section 6 — the recursion and the criterion
OpenRudinSquares.recursionarithmetic-progressionsnumber-theorysquares
The recursive engine of Section 6. For every ,
and the value does not increase exactly when every -element index set inside supports no progression:
Thus, knowing , one computes by determining for all -subsets of : if all vanish then , otherwise . This reduces Theorem 1 to the finite collection of computations carried out in the paper.
Preamble
import Mathlib import Definitions.Def_RudinSquares_Defs
Formal statement
namespace RudinSquares
theorem recursion (N : ℕ) :
Q N ≤ Q (N + 1) ∧ Q (N + 1) ≤ Q N + 1 ∧
(Q (N + 1) = Q N ↔
∀ I : Finset ℤ, I ⊆ Finset.Icc (0 : ℤ) (N : ℤ) → I.card = Q N + 1 → z I = 0) := 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, §6 (Consequences and comments), p. 73.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.