Finite N3Row Form exists ne zero
ProvedD1Bound5.finiteN3RowForm_exists_ne_zerodiophantine-tuplesnumber-theory
Auxiliary result finiteN3RowForm_exists_ne_zero 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.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_FiniteN3IntegralRows_Definitions
Formal statement
section
open scoped NumberField
open Module
namespace D1Bound5
variable {R S : Type*} [CommRing R] [CommRing S]
theorem _root_.D1Bound5.finiteN3RowForm_exists_ne_zero
{F : Type*} [Field F] [CharZero F]
(x y c z sX sY : F) (hx : x ≠ 0) (hy : y ≠ 0) (hxy : x ≠ y) (hz : z ≠ 0) :
∃ i : Fin 3, finiteN3RowForm x y c z sX sY i ≠ 0 := by sorry
end D1Bound5
end
Source
D1Bound5/FiniteN3IntegralRows.lean, lines 44-59, SHA-256 c3427020ac3dfeb2a74c0f0beb97b619fe1be1a02fad1755f9a8e51d90f6d4bc. Project: https://github.com/tomislav-math/d1-bound5-lean