Section 4.1 — for
OpenRudinSquares.z_0_1_2_4_7arithmetic-progressionsnumber-theorysquares
A computation from Section 4.1 (the elliptic-curve Chabauty algorithm at work). For the five-element index set , the set is empty, i.e. : there is no non-trivial integer arithmetic progression with squarefree that is a square at every position of . The paper proves this by exhibiting a genus-1 quotient cover for which every relevant twist has no rational point (or only points giving trivial points of ). Such vanishings are the sieve steps that force in the recursion.
Preamble
import Mathlib import Definitions.Def_RudinSquares_Defs
Formal statement
namespace RudinSquares
theorem z_0_1_2_4_7 : z ({0,1,2,4,7} : Finset ℤ) = 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, §4.1, pp. 69–71 (case ).
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.