Finite N3Fixed Polynomial norm sq
ProvedD1Bound5.finiteN3FixedPolynomial_norm_sqdiophantine-tuplesnumber-theory
Auxiliary result finiteN3FixedPolynomial_norm_sq 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 Lean.Elab.Tactic.Omega import Mathlib.Algebra.BigOperators.Fin import Mathlib.Algebra.Group.Int.Units import Mathlib.Algebra.Polynomial.Monic import Mathlib.Algebra.QuadraticAlgebra.Basic import Mathlib.Algebra.Ring.Basic import Mathlib.Algebra.Ring.Equiv import Mathlib.Algebra.Squarefree.Basic import Mathlib.Analysis.Complex.Basic import Mathlib.Analysis.Complex.Norm import Mathlib.Analysis.Complex.Polynomial.Basic import Mathlib.Analysis.Normed.Ring.Basic import Mathlib.Data.Fin.Tuple.Sort import Mathlib.Data.Finset.Card import Mathlib.Data.Finset.Prod import Mathlib.Data.Fintype.EquivFin import Mathlib.Data.Int.GCD import Mathlib.Data.Int.Interval import Mathlib.Data.Int.Sqrt import Mathlib.Data.List.Range 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.Convert import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.FinCases import Mathlib.Tactic.GCongr import Mathlib.Tactic.IntervalCases import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination import Mathlib.Tactic.NormNum import Mathlib.Tactic.Positivity import Mathlib.Tactic.Ring import Definitions.Def_D1Bound5_Coordinates_Definitions import Definitions.Def_D1Bound5_FiniteN3FixedHeight_Definitions import Definitions.Def_D1Bound5_SmallExtensionSymmetry_Definitions
Formal statement
section
open scoped NumberField
open Module
namespace D1Bound5
open QuadInt
theorem _root_.D1Bound5.finiteN3FixedPolynomial_norm_sq
{K : Type*} [Field K] [NumberField K] [NumberField.IsTotallyComplex K]
(phi : K →+* ℂ) {tau nu : ℤ} (e : QuadInt tau nu ≃+* 𝓞 K)
(sgn conj : Bool) (x y : 𝓞 K) (i : Fin 3) (j : Fin 2) (ell : Fin 4) :
‖finiteN3FixedPolynomial (phi (x : K)) (phi (y : K)) i j ell‖^2 =
((finiteN3FixedPolynomial
(smallExtensionSymmetry sgn conj (e.symm x))
(smallExtensionSymmetry sgn conj (e.symm y)) i j ell).norm : ℝ) := by sorry
end D1Bound5
end
Source
D1Bound5/FiniteN3FixedHeight.lean, lines 60-85, SHA-256 0b044a9920f89d86943094e723cbd783c3c11f89d494288bfcbb6b25925d3410. Project: https://github.com/tomislav-math/d1-bound5-lean