Full ring finite P closed interval excluded
ProvedD1Bound5.full_ring_finiteP_closed_interval_excludeddiophantine-tuplesnumber-theory
The full closed finite P window, using the same relative root error 1/4000 as the neighboring finite families.
Preamble
import Lean.Elab.Tactic.Omega import Mathlib.Algebra.BigOperators.Fin import Mathlib.Algebra.BigOperators.NatAntidiagonal import Mathlib.Algebra.Polynomial.BigOperators import Mathlib.Algebra.Polynomial.Degree.Operations 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.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.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.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_IsD1
Formal statement
section
open scoped NumberField
open Module
namespace D1Bound5
theorem _root_.D1Bound5.full_ring_finiteP_closed_interval_excluded
{K : Type*} [Field K] [NumberField K] [NumberField.IsTotallyComplex K]
(hK : finrank ℚ K = 2) (phi : K →+* ℂ)
{S : Finset (𝓞 K)} (hS : IsD1 S) (a : Fin 3 → 𝓞 K) (c d : 𝓞 K)
(haS : ∀ j, a j ∈ S) (hcS : c ∈ S) (hdS : d ∈ S)
(hinj : Function.Injective a) (hac : ∀ j, a j ≠ c)
(had : ∀ j, a j ≠ d) (hcd : c ≠ d)
(hmon : Monotone (fun j => ‖phi (a j : K)‖))
(hCT : 200*‖phi (a 2 : K)‖ ≤ ‖phi (c : K)‖)
(hCD : ‖phi (c : K)‖ ≤ ‖phi (d : K)‖)
(hAC : 1000 ≤ ‖phi (a 0 : K)‖*‖phi (c : K)‖)
(hleft : 4*(2400 : ℝ)^2*
(max (‖phi (a 1 : K)‖*‖phi (a 2 : K)‖^3)
(‖phi (a 1 : K)‖^3*‖phi (a 2 : K)‖^2))^2*
‖phi (c : K)‖^5/(1-1/4000 : ℝ) ≤ ‖phi (d : K)‖)
(hright : ‖phi (d : K)‖ ≤ ‖phi (a 0 : K)‖^6*‖phi (c : K)‖^9/
(36*‖phi (a 2 : K)‖^4*(1+1/4000 : ℝ))) : False := by sorry
end D1Bound5
end
Source
D1Bound5/FinitePInterval.lean, lines 9-83, SHA-256 df376a211af59eef029f42e3b2eb3a84f703577b606c4bda8116387ba3b3f20e. Project: https://github.com/tomislav-math/d1-bound5-lean