Coefficient asymptotics of a repeated formal pole
Provedcoeff_repeatedPole_isEquivalentanalytic-combinatoricslean4singularity-boundaries
Let be nonzero and let . Write for the coefficient of in the formal power series . Then, as ,
This gives the leading coefficient asymptotic for a single pole of order , including the geometric case . Both nonzero hypotheses are retained.
Preamble
import Mathlib.Analysis.Asymptotics.AsymptoticEquivalent import Mathlib.Analysis.SpecialFunctions.Choose import Mathlib.RingTheory.PowerSeries.WellKnown import Mathlib.RingTheory.PowerSeries.Inverse import Mathlib.Analysis.SpecificLimits.Normed import Mathlib.Analysis.Analytic.Binomial import Mathlib.Analysis.Meromorphic.Order import Mathlib.Analysis.Complex.Basic import Mathlib.Combinatorics.Enumerative.Composition import Mathlib.Analysis.Analytic.Basic import Mathlib.Analysis.Analytic.OfScalars import Mathlib.Analysis.Analytic.RadiusLiminf import Mathlib.RingTheory.PowerSeries.Basic import Mathlib.Algebra.Algebra.Rat import Mathlib.Data.Complex.Basic import Mathlib.Data.Fintype.Card set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 open Filter Asymptotics open scoped PowerSeries Topology BigOperators open PowerSeries
Formal statement
theorem coeff_repeatedPole_isEquivalent (c a₀ : ℂ) (_ha₀ : a₀ ≠ 0) (_hc : c ≠ 0)
(d : ℕ) :
(fun n : ℕ => PowerSeries.coeff (R := ℂ) n
(PowerSeries.C c * PowerSeries.rescale a₀
(PowerSeries.invOneSubPow ℂ (d + 1)).val))
~[atTop]
(fun n : ℕ => c * a₀^n * ((n : ℂ)^d / (d.factorial : ℂ))) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).