Coherent Quotient Form norm le remainder
ProvedD1Bound5.coherentQuotientForm_norm_le_remainderdiophantine-tuplesnumber-theory
Exact-form norm control before inserting a numerical remainder estimate. This interface is shared by the parameter and four-anchor lemmas.
Preamble
import Mathlib.Algebra.BigOperators.NatAntidiagonal 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.SpecificLimits.Normed import Mathlib.Data.Fin.VecNotation 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.NumberTheory.NumberField.InfinitePlace.TotallyRealComplex import Mathlib.NumberTheory.NumberField.Norm import Mathlib.RingTheory.Binomial import Mathlib.RingTheory.MvPolynomial.Symmetric.Defs import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination import Definitions.Def_D1Bound5_CoherentFormBounds_Definitions import Definitions.Def_D1Bound5_CoherentQuotientForms_Definitions
Formal statement
section
open Finset
namespace D1Bound5
theorem _root_.D1Bound5.coherentQuotientForm_norm_le_remainder
{m : ℕ} (a : Fin m → ℂ) (hm : 2 ≤ m)
(ha : ∀ i, a i ≠ 0) (hinj : Function.Injective a)
(Delta p q eta : ℂ) (hDelta : Delta ≠ 0) (heta : eta ≠ 0)
(hp : ∀ i, ‖p⁻¹*(a i)⁻¹‖ < 1) (hq : ∀ i, ‖q⁻¹*(a i)⁻¹‖ < 1) :
‖coherentQuotientForm a Delta p q eta‖ ≤ ‖Delta‖*‖eta‖*
(‖1-(1+p⁻¹*q⁻¹)^(1/2 : ℂ)‖ + ‖coherentRemainder a p q‖/(∏ i, ‖a i‖)) := by sorry
end D1Bound5
end
Source
D1Bound5/CoherentParameterForms.lean, lines 7-29, SHA-256 374d5b2d6781c171ef752c7123026755c8c7a83017464b5219e1a859229c8703. Project: https://github.com/tomislav-math/d1-bound5-lean