Unequal Pole Polynomial residual coeff zero
ProvedD1Bound5.unequalPolePolynomial_residual_coeff_zerodiophantine-tuplesnumber-theory
Exact cancellation through one less than the total pole order.
Preamble
import Lean.Elab.Tactic.Omega import Mathlib.Algebra.BigOperators.Group.Finset.Sigma 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.Analysis.Analytic.Binomial import Mathlib.Analysis.Complex.Basic import Mathlib.Analysis.Normed.Ring.Basic import Mathlib.Analysis.Normed.Ring.InfiniteSum import Mathlib.Analysis.SpecificLimits.Normed import Mathlib.Data.Finset.Insert import Mathlib.Data.Sym.Basic import Mathlib.Data.Sym.Card import Mathlib.LinearAlgebra.Lagrange import Mathlib.LinearAlgebra.Matrix.Polynomial import Mathlib.RingTheory.MvPolynomial.Symmetric.Defs import Mathlib.RingTheory.PowerSeries.Binomial import Mathlib.RingTheory.PowerSeries.Trunc import Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum import Mathlib.Tactic.Positivity import Mathlib.Tactic.Ring import Definitions.Def_D1Bound5_UnequalPoleResidual_Definitions
Formal statement
section
open Finset
namespace D1Bound5
variable {I : Type*} [Fintype I] [DecidableEq I]
theorem _root_.D1Bound5.unequalPolePolynomial_residual_coeff_zero
{F : Type*} [Field F] [CharZero F]
(a : I → F) (ha : Function.Injective a) (e : I → ℕ)
(k : ℕ) (he : ∀ j, e j ≤ k) (ν : F)
(r : ℕ) (hr : r < (∑ j, (e j+1))-1) :
PowerSeries.coeff r
(∑ j, (unequalPolePolynomial a e k ν j : PowerSeries F)*
PowerSeries.rescale (a j) (PowerSeries.binomialSeries F ν)) = 0 := by sorry
end D1Bound5
end
Source
D1Bound5/UnequalPoleResidual.lean, lines 50-64, SHA-256 e46f9575bbcd97addd0307c7ad2e250b7b7f566707b1c1322ce262892ab0777e. Project: https://github.com/tomislav-math/d1-bound5-lean