Finite fourth-element growth certificate
ProvedD1Bound5.oneSmallFourth_49_checkeddiophantine-tuplesnumber-theory
The finite fourth-element growth check succeeds for anchors oneSmallPairA_35, oneSmallPairB_35, oneSmallTripleS_49, cutoff oneSmallTripleCutoff_49, and root list oneSmallDisk_300_1_5. Every tested candidate below this cutoff that passes the three square conditions satisfies N(z) ≤ 4N(b)N(s).
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.IntervalCases import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination import Definitions.Def_D1Bound5_Coordinates_Definitions import Definitions.Def_D1Bound5_OneSmallDisks_Definitions import Definitions.Def_D1Bound5_OneSmallFiniteCheck_Definitions import Definitions.Def_D1Bound5_OneSmallFourthData7_Definitions import Definitions.Def_D1Bound5_OneSmallThirdData_Definitions_002
Formal statement
section
namespace D1Bound5
open QuadInt
set_option maxRecDepth 32768
set_option maxHeartbeats 12000000
theorem _root_.D1Bound5.oneSmallFourth_49_checked :
oneSmallFourthGrowthBool oneSmallPairA_35 oneSmallPairB_35 oneSmallTripleS_49
oneSmallTripleCutoff_49 oneSmallDisk_300_1_5 = true := by sorry
end D1Bound5
end
Source
D1Bound5/OneSmallFourthData7.lean, lines 31-34, SHA-256 0b8e884d1ce5df34ee0ab1ba66c3c86b9f949af320f3ddb5bfe6edeaf2cec83c. Project: https://github.com/tomislav-math/d1-bound5-lean