Is D1Tuple — rational unit pair impossible
ProvedD1Bound5.IsD1Tuple.rational_unit_pair_impossiblediophantine-tuplesnumber-theory
Either orientation of the rational unit pair is impossible. Negating the whole tuple changes the orientation while preserving every modulus.
Preamble
import Init import Lean.Elab.Tactic.Omega import Lean.Util.CollectAxioms import Mathlib.Algebra.BigOperators.Fin import Mathlib.Algebra.BigOperators.Group.Finset.Sigma import Mathlib.Algebra.BigOperators.NatAntidiagonal import Mathlib.Algebra.CharP.Frobenius import Mathlib.Algebra.CharP.Two import Mathlib.Algebra.CharZero.Infinite import Mathlib.Algebra.Group.Int.Units import Mathlib.Algebra.Order.BigOperators.Ring.Finset import Mathlib.Algebra.Order.Floor.Semiring import Mathlib.Algebra.Polynomial.BigOperators import Mathlib.Algebra.Polynomial.Degree.Operations import Mathlib.Algebra.Polynomial.Div import Mathlib.Algebra.Polynomial.Monic 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.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.Normed.Ring.InfiniteSum import Mathlib.Analysis.SpecialFunctions.Gaussian.GaussianIntegral import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Analysis.SpecialFunctions.Pow.Real 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.Defs import Mathlib.Data.Rat.Lemmas 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.Polynomial import Mathlib.LinearAlgebra.Matrix.SchurComplement import Mathlib.LinearAlgebra.Matrix.ToLinearEquiv import Mathlib.NumberTheory.DiophantineApproximation.Basic import Mathlib.NumberTheory.NumberField.InfinitePlace.TotallyRealComplex import Mathlib.NumberTheory.NumberField.Norm import Mathlib.NumberTheory.Real.Irrational import Mathlib.RingTheory.Binomial import Mathlib.RingTheory.Coprime.Lemmas import Mathlib.RingTheory.Int.Basic import Mathlib.RingTheory.MvPolynomial.Symmetric.Defs import Mathlib.RingTheory.PowerSeries.Binomial import Mathlib.RingTheory.PowerSeries.Trunc import Mathlib.Tactic import Mathlib.Tactic.ComputeDegree 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 Mathlib.Topology.Algebra.InfiniteSum.Order import Definitions.Def_D1Bound5_Coordinates_Definitions import Definitions.Def_D1Bound5_DegeneratePairClassification_Definitions import Definitions.Def_D1Bound5_IsD1Tuple
Formal statement
section
open scoped NumberField
open Module
namespace D1Bound5
open QuadInt
theorem _root_.D1Bound5.IsD1Tuple.rational_unit_pair_impossible
{K : Type*} [Field K] [NumberField K] [NumberField.IsTotallyComplex K]
(hK : finrank ℚ K = 2) (phi : K →+* ℂ)
(t : Fin 6 → 𝓞 K) (ht : IsD1Tuple t)
(hmon : Monotone (fun i => ‖phi (t i : K)‖))
(hpair : RationalUnitPair (t 0) (t 1)) : False := by sorry
end D1Bound5
end
Source
D1Bound5/DegeneratePairImpossible.lean, lines 59-77, SHA-256 449a3a0eb81ab63cbb073585d13a396c6886de6c7e8f6b4565307a657ed38f67. Project: https://github.com/tomislav-math/d1-bound5-lean