Is D1Tuple — first pair retained packet of norms
ProvedD1Bound5.IsD1Tuple.first_pair_retained_packet_of_normsdiophantine-tuplesnumber-theory
The actual S≥15 retained packet. Only the squared norms of the normalized first pair are used, so rational pairs are valid over every imaginary quadratic full integer ring without a coordinate equivalence.
Preamble
import Lean.Util.CollectAxioms 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.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.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.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_FirstPairGeometryData_Definitions_001 import Definitions.Def_D1Bound5_FirstPairGeometry_Definitions import Definitions.Def_D1Bound5_IsD1Tuple import Definitions.Def_D1Bound5_OneSmallCutoffArithmetic_Definitions_001 import Definitions.Def_D1Bound5_OneSmallRows_Definitions
Formal statement
section
open scoped NumberField
open Module
namespace D1Bound5
theorem _root_.D1Bound5.IsD1Tuple.first_pair_retained_packet_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 : FirstPairGeometryRow) (hv : r.Valid)
(hAsq : ‖phi (a 0 : K)‖^2 = (r.a0 : ℝ))
(hBsq : ‖phi (a 1 : K)‖^2 = (r.b0 : ℝ))
(hdsq : ‖phi (a 0 : K)-phi (a 1 : K)‖^2 = (r.dab : ℝ))
(hS15 : 15 ≤ ‖phi (a 2 : K)‖) :
let B := ‖phi (a 1 : K)‖
let S := ‖phi (a 2 : K)‖
let T := ‖phi (a 3 : K)‖
let C := ‖phi (a 4 : K)‖
let D := ‖phi (a 5 : K)‖
(7/4 : ℝ)*T^5/S^2 < C ∧
(r.G : ℝ)*B^5*S^3 < C ∧
(r.rho : ℝ)*((3535/409600 : ℝ)*firstPairPhi (phi (a 1 : K)) (phi (a 2 : K)))*B^5*S^3 < C ∧
C^7/(S^2*T^4) < D ∧
1000 < C ∧ 200*S < C ∧ 4*T < C ∧ 2*B*S < T := by sorry
end D1Bound5
end
Source
D1Bound5/FirstPairRetainedPacket.lean, lines 12-191, SHA-256 7afda9af389a6bf925c14d87f654a70371728c70dde0a1dbdb96182ecfdd0517. Project: https://github.com/tomislav-math/d1-bound5-lean