Small Pair Graph 30 excludes three full ring
ProvedD1Bound5.smallPairGraph_30_excludes_three_full_ringdiophantine-tuplesnumber-theory
Complete large-extension triangle exclusion for pair-table row 30.
Preamble
import Init import Mathlib.Algebra.Order.Ring.Abs import Mathlib.Algebra.QuadraticAlgebra.Basic import Mathlib.Algebra.Ring.Basic import Mathlib.Algebra.Ring.Equiv import Mathlib.Analysis.Complex.Basic import Mathlib.Analysis.Complex.Norm import Mathlib.Analysis.Complex.Polynomial.Basic import Mathlib.Data.Finset.Card import Mathlib.Data.Finset.Prod import Mathlib.Data.Int.GCD import Mathlib.Data.Int.Interval import Mathlib.Data.Int.Sqrt import Mathlib.Data.List.Basic import Mathlib.Data.List.Range import Mathlib.Data.ZMod.Basic import Mathlib.LinearAlgebra.Dimension.Free import Mathlib.NumberTheory.NumberField.InfinitePlace.TotallyRealComplex import Mathlib.NumberTheory.NumberField.Norm import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination import Mathlib.Tactic.Ring import Definitions.Def_D1Bound5_Coordinates_Definitions import Definitions.Def_D1Bound5_IsD1Tuple import Definitions.Def_D1Bound5_PairExtensionCore_Definitions import Definitions.Def_D1Bound5_SmallPairGraphInputs30_Definitions_001
Formal statement
section
open scoped NumberField
open Module
namespace D1Bound5
open QuadInt
theorem _root_.D1Bound5.smallPairGraph_30_excludes_three_full_ring
{K : Type*} [Field K] [NumberField K] [NumberField.IsTotallyComplex K]
(hK : finrank ℚ K = 2) (phi : K →+* ℂ)
(e : QuadInt 1 1 ≃+* 𝓞 K) (t : Fin 3 → QuadInt 1 1)
(ht : IsD1Tuple t)
(hpair : ∀ i, PairExtension smallPairA_30 smallPairB_30 (t i))
(hlarge : ∀ i, 9 ≤ (t i).norm) (hbound : ∀ i, (t i).norm ≤ 10^1100)
(hneA : ∀ i, t i ≠ smallPairA_30) (hneB : ∀ i, t i ≠ smallPairB_30) : False := by sorry
end D1Bound5
end
Source
D1Bound5/SmallPairGraphFullRing30.lean, lines 9-29, SHA-256 1686bd105d3a25224b4519f22251156d4c4c87d4fbcaa1ce86560761f163684a. Project: https://github.com/tomislav-math/d1-bound5-lean