The exponential formula for decorated labelled set partitions
ProvedAnalyticCombinatorics.Ch1.CombClass.egf_setanalytic-combinatoricsexponential-generating-functionslean4set-partitionssymbolic-method
Let be a finite type of objects for each natural-number size , and assume that is empty. Let and over . A size- set object is a partition of the labels into nonempty unordered blocks, together with one -object for every block . If counts these decorated partitions and , then
This is formal substitution into . The zero-size condition makes , and the empty partition gives . No analytic convergence is required.
Preamble
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.Order.Partition.Finpartition import Mathlib.RingTheory.PowerSeries.Derivative import Mathlib.Data.Fintype.EquivFin import Mathlib.Algebra.BigOperators.NatAntidiagonal import Mathlib.Data.Fintype.Powerset 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 set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Ch2 §II.2 — The labelled set exponential formula This file closes the labelled SET construction: `SET(C)(z) = exp(C(z))` when `C` has no size-zero objects. -/ open AnalyticCombinatorics AnalyticCombinatorics.Ch1 open PowerSeries
Formal statement
theorem AnalyticCombinatorics.Ch1.CombClass.egf_set (C : CombClass) (hC : C.counts 0 = 0) :
C.set.egf = (PowerSeries.exp ℚ).subst C.egf := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).