Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 4.1 — zI=0z_I=0zI​=0 for I=0,1,4,7,8I={0,1,4,7,8}I=0,1,4,7,8

Open
RudinSquares.z_0_1_4_7_8

by LG · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

arithmetic-progressionsnumber-theorysquares

A computation from Section 4.1 (the elliptic-curve Chabauty algorithm at work). For the five-element index set I=0,1,4,7,8I={0,1,4,7,8}I=0,1,4,7,8, the set ZIZ_IZI​ is empty, i.e. zI=0z_I=0zI​=0: there is no non-trivial integer arithmetic progression with squarefree gcd⁡(q,a)\gcd(q,a)gcd(q,a) that is a square at every position of III. 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 CIC_ICI​). Such vanishings are the sieve steps that force Q(N+1)=Q(N)Q(N+1)=Q(N)Q(N+1)=Q(N) in the recursion.

Preamble
import Mathlib
import Definitions.Def_RudinSquares_Defs
Formal statement
namespace RudinSquares
theorem z_0_1_4_7_8 : z ({0,1,4,7,8} : Finset ℤ) = 0 := by sorry
end RudinSquares
Source
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 I=0,1,4,7,8I={0,1,4,7,8}I=0,1,4,7,8).
Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 18, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me