Finite QRow Form exists ne zero
ProvedD1Bound5.finiteQRowForm_exists_ne_zerodiophantine-tuplesnumber-theory
The actual finite determinant selects a nonzero row from a nonzero terminal root, independently of the choice of signed product roots.
Preamble
import Mathlib.Algebra.BigOperators.Fin import Mathlib.Algebra.QuadraticAlgebra.Basic import Mathlib.Algebra.Ring.Basic import Mathlib.Algebra.Ring.Equiv import Mathlib.Analysis.Complex.Norm import Mathlib.Data.Finset.Card import Mathlib.Data.Int.GCD import Mathlib.LinearAlgebra.Dimension.Free import Mathlib.LinearAlgebra.Matrix.Determinant.Basic import Mathlib.LinearAlgebra.Matrix.NonsingularInverse import Mathlib.NumberTheory.NumberField.InfinitePlace.TotallyRealComplex import Mathlib.NumberTheory.NumberField.Norm import Mathlib.Tactic.FinCases import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination import Mathlib.Tactic.NormNum import Mathlib.Tactic.Ring import Definitions.Def_D1Bound5_FiniteQIntegralRows_Definitions
Formal statement
section
open scoped NumberField
open Module
namespace D1Bound5
variable {R S : Type*} [CommRing R] [CommRing S]
theorem _root_.D1Bound5.finiteQRowForm_exists_ne_zero
{F : Type*} [Field F] [CharZero F]
(a b s t c z rA rB rS rT : F)
(ha : a ≠ 0) (hb : b ≠ 0) (hs : s ≠ 0) (ht : t ≠ 0)
(hab : a ≠ b) (has : a ≠ s) (hat : a ≠ t)
(hbs : b ≠ s) (hbt : b ≠ t) (hst : s ≠ t) (hz : z ≠ 0) :
∃ i : Fin 5, finiteQRowForm a b s t c z rA rB rS rT i ≠ 0 := by sorry
end D1Bound5
end
Source
D1Bound5/FiniteQIntegralRows.lean, lines 48-71, SHA-256 13dbc71d3f13cc35a26b1a62808a9ec3ba2232668209833fc8f21e0bdba9f6ad. Project: https://github.com/tomislav-math/d1-bound5-lean