Is D1Tuple — rational cutoff forced P window
ProvedD1Bound5.IsD1Tuple.rational_cutoff_forced_P_windowdiophantine-tuplesnumber-theory
The universal signed rational triple forces the actual adaptive P window beyond its cutoff. All other windows are proved for the same ambient field, with no fictitious Gaussian-field equivalence.
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.Group.Int.Units import Mathlib.Algebra.Order.Archimedean.Real.Basic import Mathlib.Algebra.Order.BigOperators.Ring.Finset 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.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.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.Polynomial 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.RingTheory.PowerSeries.Binomial import Mathlib.RingTheory.PowerSeries.Trunc import Mathlib.Tactic import Mathlib.Tactic.Convert 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 import Definitions.Def_D1Bound5_OneSmallCutoffArithmetic_Definitions_001 import Definitions.Def_D1Bound5_OneSmallCutoffArithmetic_Definitions_002 import Definitions.Def_D1Bound5_OneSmallFixedWindows_Definitions import Definitions.Def_D1Bound5_OneSmallRows_Definitions
Formal statement
section
open Finset
open scoped NumberField
open Module
namespace D1Bound5
theorem _root_.D1Bound5.IsD1Tuple.rational_cutoff_forced_P_window
{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)‖))
(sgn : Bool)
(h0 : a 0 = if sgn then -1 else 1)
(h1 : a 1 = if sgn then -3 else 3)
(h2 : a 2 = if sgn then -8 else 8)
(hlarge : (oneSmallCutoffRow_56.triple.cutoff : ℝ) ≤ ‖phi (a 3 : K)‖^2) :
let B := ‖phi (a 1 : K)‖
let S := ‖phi (a 2 : K)‖
let C := ‖phi (a 4 : K)‖
let D := ‖phi (a 5 : K)‖
(fixedWindowP oneSmallCutoffRow_56 B S C).1 ≤ D ∧ D ≤ (fixedWindowP oneSmallCutoffRow_56 B S C).2 := by sorry
end D1Bound5
end
Source
D1Bound5/RationalCutoffForcedP.lean, lines 13-171, SHA-256 1571de3774efd5d30f4a5d97cd929d7e03429fdb4ab9560b8096f9251f4c5ef9. Project: https://github.com/tomislav-math/d1-bound5-lean