Finite A5Row Form exists ne zero
ProvedD1Bound5.finiteA5RowForm_exists_ne_zerodiophantine-tuplesnumber-theory
Auxiliary result finiteA5RowForm_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 import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination import Definitions.Def_D1Bound5_FiniteA5IntegralRows_Definitions
Formal statement
section
open scoped NumberField
open Module
namespace D1Bound5
variable {R S : Type*} [CommRing R] [CommRing S]
theorem _root_.D1Bound5.finiteA5RowForm_exists_ne_zero
{F : Type*} [Field F] [CharZero F]
(x y c z sX sY : F) (hx : x ≠ 0) (hy : y ≠ 0) (hc : c ≠ 0) (hxy : x ≠ y) (hz : z ≠ 0) :
∃ i : Fin 3, finiteA5RowForm x y c z sX sY i ≠ 0 := by sorry
end D1Bound5
end
Source
D1Bound5/FiniteA5IntegralRows.lean, lines 44-59, SHA-256 135a11e7f96cd3ffa5b3aba636da84c37adec2ecbaa3d92a22ae8fb4a3140799. Project: https://github.com/tomislav-math/d1-bound5-lean