Signed Entry Bounds nine or neg
ProvedD1Bound5.signedEntryBounds_nine_or_negdiophantine-tuplesnumber-theory
The nine-threshold estimate is already stronger than the requested twelve-threshold constants: 16/31 < 7/13 and 128/8649 < 1/64. This avoids any unproved B*C >= 12 assumption for ordered quadruples.
Preamble
import Mathlib.Analysis.Complex.Basic import Mathlib.Analysis.Complex.Polynomial.Basic import Mathlib.Data.Complex.Basic import Mathlib.LinearAlgebra.Matrix.Determinant.Basic import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination import Mathlib.Tactic.NormNum import Mathlib.Tactic.Ring import Definitions.Def_D1Bound5_MixedRootMatrixSigns_Definitions
Formal statement
section
namespace D1Bound5
theorem _root_.D1Bound5.signedEntryBounds_nine_or_neg {R : Type*} [CommRing R]
(f : R →+* ℂ) (a b r : R) (u v : ℂ)
(hu : u^2 = f a) (hv : v^2 = f b)
(hr : r^2 = a*b+1) (hab : 9 ≤ ‖f a * f b‖) :
SignedEntryBounds f a b u v r (7/13) (1/64) ∨
SignedEntryBounds f a b u v (-r) (7/13) (1/64) := by sorry
end D1Bound5
namespace D1Bound5
end D1Bound5
end
Source
D1Bound5/MixedRootMatrixSigns.lean, lines 67-80, SHA-256 2e004ca5529f8e5abf67259e26a8270075f09b04d9c8093e81458a83e3680457. Project: https://github.com/tomislav-math/d1-bound5-lean