Documentation

Linglib.Core.Algebra.RootedTree.Coproduct.AdmissibleCutDuality

Duality of the Grossman–Larson product and the Connes–Kreimer coproduct #

Under the symmetry-weighted pairing, the Grossman–Larson product is the transpose of the Connes–Kreimer coproduct Δ^ρ: ⟨x ⋆ y, z⟩ = ⟨y ⊗ x, Δ^ρ z⟩. So the pairing turns the Grossman–Larson product into the convolution product of linear functionals on the Connes–Kreimer bialgebra, in the opposite order. Hoffman states the duality in this form, as a map of the Grossman–Larson algebra to the graded dual.

Main results #

Implementation notes #

The tensor slots of the duality are crossed. The product x ⋆ y grafts the trees of y onto the host x, while Δ^ρ puts the pruned crown in the first tensor slot and the trunk in the second, so y pairs against crowns and x against trunks. The uncrossed statement is false: for the one-vertex trees x = •_p and y = •_q and the chain z with root p and leaf q, the left side is 1 and ⟨x ⊗ y, Δ^ρ z⟩ is 0.

The duality is proved on basis forests z = of' C by recursion on the number of vertices. The one-tree step uses the adjunction of B⁺ and B⁻ (BMinus.lean) and the Hochschild cocycle property; the step for several trees uses the product rule of the pairing.

References #

Adjoint through the second tensor slot #

Tensor-square of the pairing product rule #

The duality theorem #

theorem ConnesKreimer.pairing_gl_eq_pairing_coproduct {R : Type u_1} [CommSemiring R] {α : Type u_2} [DecidableEq α] (x y z : ConnesKreimer R (UnorderedTree α)) :

The Grossman–Larson product is the transpose of the Connes–Kreimer coproduct under the symmetry-weighted pairing, ⟨x ⋆ y, z⟩ = ⟨y ⊗ x, Δ^ρ z⟩. The tensor slots are crossed: the grafted factor y pairs against the pruned crowns and the host x against the trunks.

theorem ConnesKreimer.isAdjointPair_product_comulAlgHom {R : Type u_1} [CommSemiring R] {α : Type u_2} [DecidableEq α] :
LinearMap.IsAdjointPair (GrossmanLarson.pairing.tmul GrossmanLarson.pairing) GrossmanLarson.pairing ⇑(TensorProduct.lift (LinearMap.flip GrossmanLarson.product)) ⇑comulAlgHom

The duality as an adjoint pair: the Grossman–Larson product with its factors swapped, as a map out of the tensor square, is adjoint to the Connes–Kreimer coproduct.

The pairing as a map to the convolution algebra #

theorem ConnesKreimer.toConv_pairing_product {R : Type u_1} [CommSemiring R] {α : Type u_2} [DecidableEq α] (x y : ConnesKreimer R (UnorderedTree α)) :
WithConv.toConv (GrossmanLarson.pairing ((GrossmanLarson.product x) y)) = WithConv.toConv (GrossmanLarson.pairing y) * WithConv.toConv (GrossmanLarson.pairing x)

The pairing turns the Grossman–Larson product into the convolution product of linear functionals, in the opposite order.

The two triple Grossman–Larson products pair equally against everything, since the convolution product is associative.