Asymptotic counts of compositions with a fixed finite positive part set
ProvedAnalyticCombinatorics.Ch5.Meromorphic.CompositionsGeneral.Close.compS_isEquivalentanalytic-combinatoricslean4meromorphic-analysis
Fix a finite set with , , and . Let be the number of finite ordered lists of elements of whose sum is ; the empty list is included when . Put
Let be the unique positive real root of . Under the stated assumptions and . Then, for this fixed , as natural ,
In the Lean statement the natural count and the real root are embedded in , and the comparison constant is . The theorem assumes only the displayed finite-set conditions; an analytic remainder or a coefficient asymptotic is not an additional hypothesis. The assertion has no uniformity claim for sets varying with .
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch5_Meromorphic_CompositionsGeneral import Mathlib import Mathlib.Analysis.Analytic.Composition import Mathlib.RingTheory.PowerSeries.Substitution 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.Analysis.Asymptotics.AsymptoticEquivalent 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 /-! # Closing the general finite-part composition family This file supplies the formal OGF bridge, the derivative nonvanishing input, and the dominant-pole decomposition needed by `CompositionsGeneral`. -/ open Complex Filter Asymptotics open scoped BigOperators ComplexOrder ENNReal NNReal PowerSeries Topology open AnalyticCombinatorics open AnalyticCombinatorics.Ch5 open AnalyticCombinatorics.Ch5.Meromorphic open AnalyticCombinatorics.Ch5.Meromorphic.CompositionsGeneral
Formal statement
theorem AnalyticCombinatorics.Ch5.Meromorphic.CompositionsGeneral.Close.compS_isEquivalent
(S : Finset ℕ) (hcard : 2 ≤ S.card) (h0 : 0 ∉ S)
(hgcd : S.gcd id = 1) :
(fun n : ℕ => (compS S h0 n : ℂ)) ~[atTop]
(fun n : ℕ =>
compAsymptoticConstant S hcard h0 * (rhoSℂ S hcard h0)⁻¹ ^ n) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).