Is D1Tuple — finite N3 inequality
ProvedD1Bound5.IsD1Tuple.finiteN3_inequalitydiophantine-tuplesnumber-theory
The N3 family on any actual four-entry subtuple. In particular the anchors may be the original b,s, giving the manuscript's N3bs family.
Preamble
import Lean.Elab.Tactic.Omega import Mathlib.Algebra.BigOperators.Fin import Mathlib.Algebra.BigOperators.Group.Finset.Sigma import Mathlib.Algebra.BigOperators.NatAntidiagonal import Mathlib.Algebra.CharZero.Infinite import Mathlib.Algebra.Polynomial.BigOperators import Mathlib.Algebra.Polynomial.Degree.Operations import Mathlib.Algebra.Polynomial.Div import Mathlib.Algebra.Polynomial.PartialFractions import Mathlib.Algebra.Polynomial.Reverse import Mathlib.Algebra.Polynomial.RingDivision import Mathlib.Algebra.Polynomial.Roots import Mathlib.Algebra.QuadraticAlgebra.Basic import Mathlib.Algebra.Ring.Basic import Mathlib.Algebra.Ring.Equiv import Mathlib.Analysis.Analytic.Binomial import Mathlib.Analysis.Complex.Basic import Mathlib.Analysis.Complex.Norm import Mathlib.Analysis.Normed.Ring.Basic import Mathlib.Analysis.Normed.Ring.InfiniteSum import Mathlib.Analysis.SpecialFunctions.Gaussian.GaussianIntegral import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecificLimits.Normed import Mathlib.Combinatorics.Enumerative.Catalan.Basic import Mathlib.Data.Finset.Card import Mathlib.Data.Finset.Insert import Mathlib.Data.Int.GCD import Mathlib.Data.Sym.Basic import Mathlib.Data.Sym.Card import Mathlib.LinearAlgebra.Dimension.Free import Mathlib.LinearAlgebra.Lagrange import Mathlib.LinearAlgebra.Matrix.Determinant.Basic import Mathlib.LinearAlgebra.Matrix.NonsingularInverse import Mathlib.LinearAlgebra.Matrix.Polynomial 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.RingTheory.PowerSeries.Trunc import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.FinCases import Mathlib.Tactic.GCongr 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
Formal statement
section
open scoped NumberField
open Module
namespace D1Bound5
theorem _root_.D1Bound5.IsD1Tuple.finiteN3_inequality
{K : Type*} [Field K] [NumberField K] [NumberField.IsTotallyComplex K]
(hK : finrank ℚ K = 2) (phi : K →+* ℂ)
(t : Fin 4 → 𝓞 K) (ht : IsD1Tuple t)
(hXY : ‖phi (t 0 : K)‖ ≤ ‖phi (t 1 : K)‖)
(hXC : 1000 ≤ ‖phi (t 0 : K)‖*‖phi (t 2 : K)‖)
(hC : 200*‖phi (t 1 : K)‖ ≤ ‖phi (t 2 : K)‖) :
∃ z : 𝓞 K, z^2=t 2*t 3+1 ∧
1 < 4143*‖phi (t 1 : K)‖^7*‖phi (t 2 : K)‖^4/‖phi (z : K)‖ +
(35/32 : ℝ)*‖phi (t 1 : K)‖^3*‖phi (z : K)‖/
(‖phi (t 0 : K)‖^4*‖phi (t 2 : K)‖^6) := by sorry
end D1Bound5
end
Source
D1Bound5/FiniteN3Interval.lean, lines 9-34, SHA-256 bd19cb0f15e25ca5629c0b6fe3d5ab9e1b98c2c5cc92c021b9f5983870ce8973. Project: https://github.com/tomislav-math/d1-bound5-lean