Documentation

Linglib.Core.Algebra.RootedTree.Coproduct.AdmissibleCut

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 #

Main results #

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 #

noncomputable def ConnesKreimer.comulAlgHom {R : Type u_1} [CommSemiring R] {α : Type u_2} :
ConnesKreimer R (UnorderedTree α) →ₐ[R] TensorProduct R (ConnesKreimer R (UnorderedTree α)) (ConnesKreimer R (UnorderedTree α))

The Connes–Kreimer coproduct Δ^ρ as an algebra homomorphism, which is comulOfCuts at the admissible cuts.

Equations
Instances For
    @[simp]
    theorem ConnesKreimer.comulAlgHom_apply_ofTree {R : Type u_1} [CommSemiring R] {α : Type u_2} (T : UnorderedTree α) :

    Grafting B⁺_a #

    noncomputable def ConnesKreimer.bPlus {R : Type u_1} [CommSemiring R] {α : Type u_2} (a : α) :

    bPlus a grafts a forest onto a new root labelled a, sending of' F to ofTree (node a F).

    Equations
    Instances For
      @[simp]
      theorem ConnesKreimer.bPlus_of' {R : Type u_1} [CommSemiring R] {α : Type u_2} (a : α) (F : UnorderedTree.Forest (UnorderedTree α)) :
      @[simp]
      theorem ConnesKreimer.bPlus_one {R : Type u_1} [CommSemiring R] {α : Type u_2} (a : α) :

      The cocycle #

      theorem ConnesKreimer.comulAlgHom_bPlus_cocycle {R : Type u_1} [CommSemiring R] {α : Type u_2} (a : α) (x : ConnesKreimer R (UnorderedTree α)) :
      comulAlgHom ((bPlus a) x) = (bPlus a) x ⊗ₜ[R] 1 + (LinearMap.lTensor (ConnesKreimer R (UnorderedTree α)) (bPlus a)) (comulAlgHom x)

      Grafting is a Hochschild 1-cocycle for Δ^ρ.

      The bialgebra #

      @[instance_reducible]
      noncomputable instance ConnesKreimer.instBialgebra {R : Type u_1} [CommSemiring R] {α : Type u_2} :
      Bialgebra R (ConnesKreimer R (UnorderedTree α))

      The Connes–Kreimer coproduct makes ConnesKreimer R (UnorderedTree α) a bialgebra over any commutative semiring.

      Equations
      theorem ConnesKreimer.coalgebra_comul_apply {R : Type u_1} [CommSemiring R] {α : Type u_2} (x : ConnesKreimer R (UnorderedTree α)) :
      CoalgebraStruct.comul x = comulAlgHom x
      theorem ConnesKreimer.coalgebra_counit_apply {R : Type u_1} [CommSemiring R] {α : Type u_2} (x : ConnesKreimer R (UnorderedTree α)) :
      CoalgebraStruct.counit x = counit x