Seed Root Disk 1 6 eq
ProvedD1Bound5.seedRootDisk_1_6_eqdiophantine-tuplesnumber-theory
Auxiliary result seedRootDisk_1_6_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_TwoSmallSeedDisks_Definitions
Formal statement
section namespace D1Bound5 open QuadInt set_option maxRecDepth 32768 set_option maxHeartbeats 8000000 theorem _root_.D1Bound5.seedRootDisk_1_6_eq : disk 1 6 132 = seedRootDisk_1_6.toFinset := by sorry end D1Bound5 end
Source
D1Bound5/TwoSmallSeedDisks.lean, lines 1215-1217, SHA-256 510bd0817de84470204906e29a31775f06a975fc27f5a457bad4d81a12b411eb. Project: https://github.com/tomislav-math/d1-bound5-lean