Coefficient error for a supplied finite geometric principal-part decomposition
ProvedAnalyticCombinatorics.Ch5.Meromorphic.meromorphic_coeff_transfer_simplePoleSumanalytic-combinatoricslean4meromorphic-analysis
Let be any index type, let be a finite set, let , and let . Let be real. Suppose the complex formal multilinear series associated with has convergence radius strictly greater than , and suppose the following equality holds as formal power series:
Then, as natural ,
The error is complex-valued and the bounding scale is real. The principal-part decomposition is a hypothesis. The finite set may be empty, weights or may vanish, and different indices may have the same . Thus the summands need not all have genuine poles. There is no requirement that or that the displayed points be distinct dominant singularities.
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch4_Analytic_Bridge import Mathlib import Mathlib.Analysis.Asymptotics.AsymptoticEquivalent 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.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.Data.Fintype.Card set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 open Filter Asymptotics open scoped BigOperators ENNReal NNReal PowerSeries Topology
Formal statement
theorem AnalyticCombinatorics.Ch5.Meromorphic.meromorphic_coeff_transfer_simplePoleSum
{ι : Type*} (s : Finset ι) (c a : ι → ℂ)
(f g : PowerSeries ℂ) {R : ℝ}
(hR : 0 < R) (hgR : ENNReal.ofReal R < (PowerSeries.toFMLS g).radius)
(hfg :
f =
(∑ i ∈ s, PowerSeries.C (c i) *
PowerSeries.rescale (a i) (PowerSeries.invUnitsSub (1 : ℂˣ))) + g) :
(fun n : ℕ => PowerSeries.coeff (R := ℂ) n f -
∑ i ∈ s, c i * (a i) ^ n) =O[atTop] (fun n : ℕ => R⁻¹ ^ n) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).