Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Gap-one exclusion: no ordered Diophantine quintuple starts with a one-gap

Proved
DiophantineQuintuple.diophantine_no_consecutive_gap_one

by junyihjy · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

diophantine-equationsnumber-theory

Let f : Fin 5 → Nat be a Diophantine quintuple (Quintuple f) with strictly increasing entries (Ordered f). Then f 1 - f 0 = 1 is impossible: the two smallest consecutive entries of a Diophantine quintuple cannot be at distance 1. The proof is elementary (between-squares): the Diophantine-pair property of f at entries (0,1) gives r with f 0 * f 1 + 1 = r^2; with f 1 = f 0 + 1 this yields f 0^2 < r^2 < (f 0 + 1)^2, forcing f 0 < r < f 0 + 1, impossible for a natural number r. This is the elementary fragment of the Cipu–Fujita gap classification: together with the gap-two exclusion fujita_gap_two_no_quintuple (deep input, Fujita 2008, transcendence method) it yields f 1 - f 0 >= 3 for any ordered Diophantine quintuple, which is the remaining input behind diophantine_no_consecutive_gap_two.

Preamble
import Definitions.Def_diophantine_descent
set_option autoImplicit false
open DiophantineDescent
Formal statement
theorem DiophantineQuintuple.diophantine_no_consecutive_gap_one (f : Fin 5 → Nat)
    (hq : Quintuple f) (ho : Ordered f) (h1 : f 1 - f 0 = 1) : False := by sorry
Source
Elementary between-squares argument (folk). Deep sibling: Y. Fujita, "The extensibility of Diophantine pairs {k-1,k+1}", J. Number Theory 128 (2008), 322-353.

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