One small fourth root norm le
ProvedD1Bound5.one_small_fourth_root_norm_lediophantine-tuplesnumber-theory
A uniform root bound for all 56 fourth-entry certificates.
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.Tactic.IntervalCases import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination import Definitions.Def_D1Bound5_Coordinates_Definitions
Formal statement
section
namespace D1Bound5
open QuadInt
theorem _root_.D1Bound5.one_small_fourth_root_norm_le {tau nu : ℤ}
(hd : 0 < discriminant tau nu) (a z q : QuadInt tau nu)
(ha : a.norm ≤ 2) (hz : z.norm ≤ 21270) (hq : q*q = a*z+1) :
q.norm ≤ 300 := by sorry
end D1Bound5
end
Source
D1Bound5/OneSmallFiniteCheck.lean, lines 35-48, SHA-256 071c08b2bdc31b423cf7fceaeeb7fd97f8c1844d2c362578eed3d43c62423b55. Project: https://github.com/tomislav-math/d1-bound5-lean