Bennett polynomial series has Sum

import Lean.Elab.Tactic.Omega
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.RingDivision
import Mathlib.Analysis.Analytic.Binomial
import Mathlib.Analysis.Normed.Ring.InfiniteSum
import Mathlib.LinearAlgebra.Matrix.Polynomial
import Mathlib.RingTheory.PowerSeries.Binomial
import Mathlib.RingTheory.PowerSeries.Trunc
import Mathlib.Tactic.Ring

section
open Finset

namespace D1Bound5


theorem _root_.D1Bound5.bennett_polynomial_series_hasSum (P : Polynomial ℂ) (B : PowerSeries ℂ)
    (x b : ℂ)
    (hB : HasSum (fun r : ℕ => PowerSeries.coeff r B * x ^ r) b)
    (hBnorm : Summable (fun r : ℕ => ‖PowerSeries.coeff r B * x ^ r‖)) :
    HasSum (fun r : ℕ => PowerSeries.coeff r ((P : PowerSeries ℂ) * B) * x ^ r)
      (P.eval x * b) := by sorry



section Nodes

variable {I : Type*} [Fintype I] [DecidableEq I]







end Nodes

end D1Bound5
end