Seed Root Disk 0 2 eq
ProvedD1Bound5.seedRootDisk_0_2_eqdiophantine-tuplesnumber-theory
Auxiliary result seedRootDisk_0_2_eq in the proof of the bound five for Diophantine D(1) sets in imaginary quadratic integer rings. The formal statement specifies its hypotheses and conclusion; a mathematical prose description remains to be supplied.
Preamble
import Mathlib.Algebra.QuadraticAlgebra.Basic import Mathlib.Algebra.Ring.Basic import Mathlib.Algebra.Ring.Equiv import Mathlib.Data.Finset.Card import Mathlib.Data.Finset.Prod import Mathlib.Data.Int.Interval import Mathlib.Data.Int.Sqrt import Mathlib.Data.List.Range import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination import Definitions.Def_D1Bound5_Coordinates_Definitions import Definitions.Def_D1Bound5_DiskEnumeration_Definitions import Definitions.Def_D1Bound5_PairSeedDisks_Definitions
Formal statement
section namespace D1Bound5 open QuadInt set_option maxRecDepth 32768 set_option maxHeartbeats 8000000 theorem _root_.D1Bound5.seedRootDisk_0_2_eq : disk 0 2 132 = seedRootDisk_0_2.toFinset := by sorry end D1Bound5 end
Source
D1Bound5/PairSeedDisks.lean, lines 737-739, SHA-256 78505b817d0fd58b324eb977c7c891cc24704cb83dce618764d353027caf26bb. Project: https://github.com/tomislav-math/d1-bound5-lean