Is D1Tuple — three anchor general detailed alternative
ProvedD1Bound5.IsD1Tuple.three_anchor_general_detailed_alternativediophantine-tuplesnumber-theory
The actual three-anchor alternative. A zero form first creates its own terminal separation, so the quadratic lower branch has no assumed separation or hidden nonvanishing premise.
Preamble
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.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.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.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.VecNotation import Mathlib.Data.Finset.Card import Mathlib.Data.Finset.Insert import Mathlib.Data.Finset.Prod import Mathlib.Data.Int.GCD import Mathlib.Data.Int.Interval import Mathlib.Data.Int.Sqrt 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.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 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_IsD1Tuple
Formal statement
section
open Finset
open scoped NumberField
open Module
namespace D1Bound5
theorem _root_.D1Bound5.IsD1Tuple.three_anchor_general_detailed_alternative
{K : Type*} [Field K] [NumberField K] [NumberField.IsTotallyComplex K]
(hK : finrank ℚ K = 2) (phi : K →+* ℂ)
(a : Fin 5 → 𝓞 K) (ha : IsD1Tuple a)
(hmon : Monotone (fun i => ‖phi (a i : K)‖))
(hP : 1000 ≤ ‖phi (a 3 : K)‖)
(hSP : 4*‖phi (a 2 : K)‖ ≤ ‖phi (a 3 : K)‖) :
(5*‖phi (a 0 : K)‖*‖phi (a 1 : K)‖*‖phi (a 2 : K)‖*‖phi (a 3 : K)‖^2 <
‖phi (a 4 : K)‖ ∧
‖phi (a 4 : K)‖ < 15*‖phi (a 0 : K)‖*‖phi (a 1 : K)‖*‖phi (a 2 : K)‖*‖phi (a 3 : K)‖^2) ∨
‖phi (a 4 : K)‖ < 101*‖phi (a 1 : K)‖^2*‖phi (a 2 : K)‖^4/‖phi (a 3 : K)‖ ∨
‖phi (a 0 : K)‖^2*‖phi (a 3 : K)‖^5/(37*‖phi (a 2 : K)‖^2) < ‖phi (a 4 : K)‖ := by sorry
end D1Bound5
end
Source
D1Bound5/ThreeAnchorDetailedAlternative.lean, lines 11-105, SHA-256 a5a75d25f4e5952898c87a00a14032abe399abc357749c9d62221714eb3c9b9a. Project: https://github.com/tomislav-math/d1-bound5-lean