Disjoint unions add exponential generating functions
ProvedAnalyticCombinatorics.Ch1.CombClass.egf_sumanalytic-combinatoricslabelled-cycleslean4symbolic-method
For a graded class with finite size fibres, write . For arbitrary graded classes , form . Then
Every coefficient uses the same factor .
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch1_OGF_Sum import Definitions.Def_AnalyticCombinatorics_Ch2_EGF_Defs import Mathlib.RingTheory.PowerSeries.WellKnown import Mathlib.RingTheory.PowerSeries.Exp 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.1 — The labelled sum Flajolet & Sedgewick, Part A, Chapter II. The combinatorial sum (disjoint union) is the same construction for labelled and unlabelled classes (it reuses `CombClass.sum`); only the translation to the EGF differs: **`(A + B)(z) = A(z) + B(z)`**. -/ open AnalyticCombinatorics AnalyticCombinatorics.Ch1 open PowerSeries
Formal statement
theorem AnalyticCombinatorics.Ch1.CombClass.egf_sum (A B : CombClass) :
(A.sum B).egf = A.egf + B.egf := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).