Differential characterization of the labelled-cycle EGF
ProvedAnalyticCombinatorics.Ch1.CombClass.egf_lcyc_uniqueanalytic-combinatoricslabelled-cycleslean4symbolic-method
For a graded class with finite size fibres, write . Assume is empty. The source labelled cycle class has no size-zero object. At size , its objects are ordered labelled powers for whose first component block contains the largest label ; this fixes a canonical rotation. The labelled product splits a label set into two complementary blocks; the labelled powers are its iterates with the neutral size-zero class as zeroth power. Let be the source finite labelled-sequence class. If satisfies
then . Both conditions on and the hypothesis are retained.
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch2_EGF_Defs import Definitions.Def_AnalyticCombinatorics_Ch2_EGF_LabelledCyc import Mathlib.Order.Partition.Finpartition import Mathlib.RingTheory.PowerSeries.Derivative import Mathlib.Data.Fintype.EquivFin import Mathlib.RingTheory.PowerSeries.Inverse import Mathlib.RingTheory.PowerSeries.NoZeroDivisors import Mathlib.RingTheory.PowerSeries.PiTopology import Mathlib.Algebra.BigOperators.NatAntidiagonal import Mathlib.Data.Fintype.Powerset import Mathlib.RingTheory.PowerSeries.WellKnown import Mathlib.RingTheory.PowerSeries.Exp import Mathlib.GroupTheory.Perm.Basic import Mathlib.Data.Fintype.Perm import Mathlib.RingTheory.PowerSeries.Substitution 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 cycle construction This file gives a concrete canonical-rotation model for labelled cycles. A nonempty labelled power represents a cycle by rotating it so that the first block contains the largest label. The transfer theorem is stated as the defining differential equation `CYC(C)' = C' * SEQ(C)`, with zero constant term. -/ open AnalyticCombinatorics AnalyticCombinatorics.Ch1 open PowerSeries Finset
Formal statement
theorem AnalyticCombinatorics.Ch1.CombClass.egf_lcyc_unique (C : CombClass) (hC : C.counts 0 = 0) {F : ℚ⟦X⟧}
(hF' : d⁄dX ℚ F = d⁄dX ℚ C.egf * C.lseq.egf)
(hF0 : constantCoeff F = 0) :
F = C.lcyc.egf := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).