The exponential generating function of labelled set partitions
ProvedAnalyticCombinatorics.Ch1.CombClass.egf_bellanalytic-combinatoricsexponential-generating-functionslean4set-partitionssymbolic-method
Let count partitions of the labels into nonempty unordered blocks, with the unique positive-size decoration on each block. These are the objects of the source's nonempty-block set class. Their factorial-normalized generating function over satisfies
Both exponential expressions are formal power series and the outer exponential is composed with the zero-constant series . The empty partition gives . The assertion concerns this finite partition class; no identification with a separately named Bell-number sequence is assumed.
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch1_OGF_Sequence
import Definitions.Def_AnalyticCombinatorics_Ch2_EGF_Defs
import Definitions.Def_AnalyticCombinatorics_Ch2_EGF_LabelledSet
import Mathlib.RingTheory.PowerSeries.Substitution
import Mathlib.RingTheory.PowerSeries.Exp
import Mathlib.RingTheory.PowerSeries.Inverse
import Mathlib.RingTheory.PowerSeries.NoZeroDivisors
import Mathlib.RingTheory.PowerSeries.PiTopology
import Mathlib.Combinatorics.Enumerative.Composition
import Mathlib.Data.Nat.Fib.Basic
import Mathlib.Order.Partition.Finpartition
import Mathlib.RingTheory.PowerSeries.Derivative
import Mathlib.Data.Fintype.EquivFin
import Mathlib.RingTheory.PowerSeries.WellKnown
import Mathlib.GroupTheory.Perm.Basic
import Mathlib.Data.Fintype.Perm
import Mathlib.RingTheory.PowerSeries.Basic
import Mathlib.Data.Fintype.Card
import Mathlib.Algebra.BigOperators.NatAntidiagonal
import Mathlib.Data.Fintype.Powerset
set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# Ch2 §II.3 — Applications of the labelled symbolic method
Flajolet & Sedgewick, Part A, Chapter II, §II.3. Using the labelled set and
sequence transfers on the positive-integer ("urn"/nonempty-block) class `ℙ`
(one object of each size `n ≥ 1`, EGF `e^z - 1`):
* set partitions / **Bell numbers** `SET(ℙ)`, EGF `exp(e^z - 1)`;
* **surjections** `SEQ(ℙ)`, EGF `1/(2 - e^z)`.
-/
open AnalyticCombinatorics AnalyticCombinatorics.Ch1
open PowerSeries
Formal statement
theorem AnalyticCombinatorics.Ch1.CombClass.egf_bell :
CombClass.posInt.set.egf = (PowerSeries.exp ℚ).subst (PowerSeries.exp ℚ - 1) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).