Is D1Tuple — fixed cutoff above Q of norms
ProvedD1Bound5.IsD1Tuple.fixed_cutoff_above_Q_of_normsdiophantine-tuplesnumber-theory
Auxiliary result IsD1Tuple.fixed_cutoff_above_Q_of_norms 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 Lean.Util.CollectAxioms import Mathlib.Algebra.BigOperators.Fin import Mathlib.Algebra.BigOperators.NatAntidiagonal import Mathlib.Algebra.CharP.Frobenius import Mathlib.Algebra.CharP.Two import Mathlib.Algebra.Group.Int.Units import Mathlib.Algebra.Order.BigOperators.Ring.Finset import Mathlib.Algebra.Polynomial.BigOperators import Mathlib.Algebra.Polynomial.Degree.Operations 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.Analytic.Binomial import Mathlib.Analysis.CStarAlgebra.Matrix import Mathlib.Analysis.Complex.Basic import Mathlib.Analysis.Complex.Norm import Mathlib.Analysis.Complex.Polynomial.Basic import Mathlib.Analysis.InnerProductSpace.PiL2 import Mathlib.Analysis.Normed.Group.Basic import Mathlib.Analysis.Normed.Ring.Basic import Mathlib.Analysis.SpecificLimits.Normed import Mathlib.Combinatorics.Enumerative.Catalan.Basic import Mathlib.Data.Complex.Basic import Mathlib.Data.Fin.Tuple.Sort import Mathlib.Data.Fin.VecNotation import Mathlib.Data.Finset.Card import Mathlib.Data.Finset.Insert 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.Data.Real.Basic import Mathlib.Data.Sym.Basic import Mathlib.Data.Sym.Card import Mathlib.Data.ZMod.Basic import Mathlib.LinearAlgebra.Dimension.Free import Mathlib.LinearAlgebra.Lagrange import Mathlib.LinearAlgebra.Matrix.Determinant.Basic import Mathlib.LinearAlgebra.Matrix.NonsingularInverse import Mathlib.LinearAlgebra.Matrix.Permutation import Mathlib.LinearAlgebra.Matrix.SchurComplement import Mathlib.NumberTheory.NumberField.InfinitePlace.TotallyRealComplex import Mathlib.NumberTheory.NumberField.Norm import Mathlib.RingTheory.Binomial import Mathlib.RingTheory.MvPolynomial.Symmetric.Defs import Mathlib.RingTheory.PowerSeries.Binomial 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_IsD1Tuple import Definitions.Def_D1Bound5_OneSmallCutoffArithmetic_Definitions_001 import Definitions.Def_D1Bound5_OneSmallCutoffArithmetic_Definitions_002 import Definitions.Def_D1Bound5_OneSmallRows_Definitions
Formal statement
section
open scoped NumberField
open Module
namespace D1Bound5
theorem _root_.D1Bound5.IsD1Tuple.fixed_cutoff_above_Q_of_norms
{K : Type*} [Field K] [NumberField K] [NumberField.IsTotallyComplex K]
(hK : finrank ℚ K = 2) (phi : K →+* ℂ)
(a : Fin 6 → 𝓞 K) (ha : IsD1Tuple a)
(hmon : Monotone (fun i => ‖phi (a i : K)‖))
(r : OneSmallCutoffRow) (hr : r ∈ oneSmallCutoffRows)
(hAsq : ‖phi (a 0 : K)‖^2 = (r.a0 : ℝ))
(hBsq : ‖phi (a 1 : K)‖^2 = (r.b0 : ℝ))
(hSsq : ‖phi (a 2 : K)‖^2 = (r.s0 : ℝ))
(hdab : ‖phi (a 0 : K)-phi (a 1 : K)‖^2 = (r.dab : ℝ))
(hdas : ‖phi (a 0 : K)-phi (a 2 : K)‖^2 = (r.das : ℝ))
(hdbs : ‖phi (a 1 : K)-phi (a 2 : K)‖^2 = (r.dbs : ℝ))
(hlarge : (r.triple.cutoff : ℝ) ≤ ‖phi (a 3 : K)‖^2) :
‖phi (a 4 : K)‖^7/(9*‖phi (a 3 : K)‖^2*(1+1/4000 : ℝ)) <
‖phi (a 5 : K)‖ := by sorry
end D1Bound5
end
Source
D1Bound5/CoherentFixedCutoffNorms.lean, lines 164-210, SHA-256 20b41086d39704136d2879d53f5900b29ea59449fc4f53b52fae60d20b7acbf5. Project: https://github.com/tomislav-math/d1-bound5-lean