Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Is D1Tuple — one small first triple classification

Proved
D1Bound5.IsD1Tuple.one_small_first_triple_classification

by tp · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

diophantine-tuplesnumber-theory

Complete actual-full-ring classification after the analytic first-pair and third-entry size reductions. Only the rational pair remains separate.

Preamble
import Mathlib.Algebra.Group.Int.Units
import Mathlib.Algebra.Polynomial.Monic
import Mathlib.Algebra.QuadraticAlgebra.Basic
import Mathlib.Algebra.Ring.Basic
import Mathlib.Algebra.Ring.Equiv
import Mathlib.Algebra.Squarefree.Basic
import Mathlib.Analysis.Complex.Basic
import Mathlib.Analysis.Complex.Norm
import Mathlib.Analysis.Complex.Polynomial.Basic
import Mathlib.Data.Fin.Tuple.Sort
import Mathlib.Data.Finset.Card
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Fintype.EquivFin
import Mathlib.Data.Int.GCD
import Mathlib.Data.Int.Interval
import Mathlib.Data.Int.Sqrt
import Mathlib.Data.List.Range
import Mathlib.LinearAlgebra.Dimension.Free
import Mathlib.NumberTheory.NumberField.InfinitePlace.TotallyRealComplex
import Mathlib.NumberTheory.NumberField.Norm
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.IntervalCases
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Definitions.Def_D1Bound5_Coordinates_Definitions
import Definitions.Def_D1Bound5_IsD1Tuple
import Definitions.Def_D1Bound5_OneSmallRows_Definitions
import Definitions.Def_D1Bound5_OneSmallSymmetry_Definitions
import Definitions.Def_D1Bound5_SmallPairClassification_Definitions

Formal statement
section
open scoped NumberField Classical
open Module

namespace D1Bound5
open QuadInt


theorem _root_.D1Bound5.IsD1Tuple.one_small_first_triple_classification
    {K : Type*} [Field K] [NumberField K] [NumberField.IsTotallyComplex K]
    (hK : finrank ℚ K = 2) (phi : K →+* ℂ)
    (t : Fin 3 → 𝓞 K) (ht : IsD1Tuple t)
    (hsize :
      (‖phi (t 0 : K)‖^2 = 1 ∧ 9 ≤ ‖phi (t 1 : K)‖^2 ∧ ‖phi (t 1 : K)‖^2 < 64) ∨
      (‖phi (t 0 : K)‖^2 = 2 ∧ 9 ≤ ‖phi (t 1 : K)‖^2 ∧ ‖phi (t 1 : K)‖^2 < 16))
    (hbound : ‖phi (t 2 : K)‖^2 < 225)
    (horder : ‖phi (t 1 : K)‖^2 ≤ ‖phi (t 2 : K)‖^2) :
    (t 0 = 1 ∧ t 1 = 3) ∨ (t 0 = -1 ∧ t 1 = -3) ∨
      ∃ (tau nu : ℤ) (e : QuadInt tau nu ≃+* 𝓞 K),
        (tau,nu) ∈ smallPairModels ∧
        OneSmallNormalizedThirdRows (e.symm (t 0)) (e.symm (t 1)) (e.symm (t 2)) := by sorry





end D1Bound5
end
Source
D1Bound5/OneSmallFullRingFinite.lean, lines 9-47, SHA-256 c38fd48e9b736d57c9245c63903e03393e9c506b12b4772b6531ad1bbd5204fe. Project: https://github.com/tomislav-math/d1-bound5-lean

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me