The Connes–Kreimer coproduct Δ^ρ #
The Connes–Kreimer coproduct on unordered rooted trees, summing over admissible cuts, which leave
nothing in place of the subtrees they remove. Grafting B⁺_a is a Hochschild 1-cocycle for it.
The bialgebra laws are those of the generic coproduct: nested admissible cuts can be taken in
either order, and the empty cut is the only admissible cut with an empty crown.
Main definitions #
ConnesKreimer.comulAlgHom: the Δ^ρ coproduct, as the generic admissible-cut coproduct (Coproduct/WithCuts.lean) at the enumerationadmissibleCuts.ConnesKreimer.bPlus: graftingB⁺_aas a linear map.
Main results #
ConnesKreimer.comulAlgHom_bPlus_cocycle: the Hochschild 1-cocycle lawΔ^ρ (B⁺_a x) = B⁺_a x ⊗ 1 + (id ⊗ B⁺_a) (Δ^ρ x).ConnesKreimer.instBialgebra: the Δ^ρBialgebra, over anyCommSemiring; the admissible cuts are admissible (ConnesKreimer.instIsBialgebraCutsAdmissibleCuts).
Implementation notes #
B⁺_a takes the children as a multiset, Multiset (UnorderedTree α) → UnorderedTree α; on planar
trees it would need a canonical order of the children, so the cocycle and everything after it live
at the UnorderedTree level.
References #
The coproduct #
The Connes–Kreimer coproduct Δ^ρ as an algebra homomorphism, which is comulOfCuts at the
admissible cuts.
Instances For
Grafting B⁺_a #
bPlus a grafts a forest onto a new root labelled a, sending of' F to
ofTree (node a F).
Equations
- ConnesKreimer.bPlus a = ConnesKreimer.linearLift fun (F : UnorderedTree.Forest (UnorderedTree α)) => ConnesKreimer.ofTree (UnorderedTree.node a F)
Instances For
The cocycle #
Grafting is a Hochschild 1-cocycle for Δ^ρ.
The bialgebra #
The Connes–Kreimer coproduct makes ConnesKreimer R (UnorderedTree α) a bialgebra over any
commutative semiring.
Equations
- ConnesKreimer.instBialgebra = Bialgebra.ofAlgHom ConnesKreimer.comulAlgHom ConnesKreimer.counit ⋯ ⋯ ⋯