Hopf algebras of planar binary trees: an operated algebra approach

Yi Zhang; Xing Gao

arXiv:1905.09430·math.RA·September 26, 2019

Hopf algebras of planar binary trees: an operated algebra approach

Yi Zhang, Xing Gao

PDF

TL;DR

This paper introduces and studies new algebraic structures called v-algebras based on planar binary trees, extending operated algebra frameworks and providing combinatorial descriptions of associated Hopf algebras.

Contribution

It develops the theory of v-algebras and cocycle v-bialgebras, constructing free objects via decorated trees and relating to known Hopf algebras like Loday-Ronco.

Findings

01

Defined v-algebras and v-Hopf algebras.

02

Constructed free v-algebras using decorated planar binary trees.

03

Provided a combinatorial description of the coproduct via admissible cuts.

Abstract

Parallel to operated algebras built on top of planar rooted trees via the grafting operator $B^{+}$ , we introduce and study $\lor$ -algebras and more generally $\lor_{Ω}$ -algebras based on planar binary trees. Involving an analogy of the Hochschild 1-cocycle condition, cocycle $\lor_{Ω}$ -bialgebras (resp.~ $\lor_{Ω}$ -Hopf algebras) are also introduced and their free objects are constructed via decorated planar binary trees. As a special case, the well-known Loday-Ronco Hopf algebra $H_{L R}$ is a free cocycle $\lor$ -Hopf algebra. By means of admissible cuts, a combinatorial description of the coproduct $Δ_{L R (Ω)}$ on decorated planar binary trees is given, as in the Connes-Kreimer Hopf algebra by admissible cuts.

Equations185

Y_{0}

Y_{0}

Y_{3}

Y_{\infty} (Ω) := n ⩾ 0 ⨆ Y_{n} (Ω) and H_{L R} (Ω) := k Y_{\infty} (Ω) = n ⩾ 0 ⨁ k Y_{n} (Ω) .

Y_{\infty} (Ω) := n ⩾ 0 ⨆ Y_{n} (Ω) and H_{L R} (Ω) := k Y_{\infty} (Ω) = n ⩾ 0 ⨁ k Y_{n} (Ω) .

dep (∣) = 0 and dep (\leavevmode t o 22.11 pt \vbox t o 22.11 pt \pgfpicture \makeatletter \lower -21.72707ptto0.0pt \pgfsys@beginscope \pgfsys@invoke \definecolor pgfstrokecolor rgb 0,0,0 \pgfsys@color@rgb@stroke 000 \pgfsys@invoke \pgfsys@color@rgb@fill 000 \pgfsys@invoke \pgfsys@setlinewidth 0.4pt \pgfsys@invoke \nullfont to0.0pt \pgfsys@beginscope \pgfsys@invoke \pgfsys@setlinewidth 0.775pt \pgfsys@invoke \pgfsys@moveto 0.0pt 0.0pt \pgfsys@lineto 10.66978pt -10.66978pt \pgfsys@lineto 21.33957pt 0.0pt \pgfsys@moveto 10.66978pt -10.66978pt \pgfsys@lineto 10.66978pt -21.33957pt \pgfsys@stroke \pgfsys@invoke \pgfsys@beginscope \pgfsys@invoke \pgfsys@beginscope \pgfsys@invoke \pgfsys@transformcm 0.8 0.0 0.0 0.8 13.44586pt -13.45903pt \pgfsys@invoke \definecolor pgfstrokecolor rgb 0,0,0 \pgfsys@color@rgb@stroke 000 \pgfsys@invoke \pgfsys@color@rgb@fill 000 \pgfsys@invoke α \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \hss \pgfsys@discardpath \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \hss \lxSVG@closescope \endpgfpicture) = 1.

dep (∣) = 0 and dep (\leavevmode t o 22.11 pt \vbox t o 22.11 pt \pgfpicture \makeatletter \lower -21.72707ptto0.0pt \pgfsys@beginscope \pgfsys@invoke \definecolor pgfstrokecolor rgb 0,0,0 \pgfsys@color@rgb@stroke 000 \pgfsys@invoke \pgfsys@color@rgb@fill 000 \pgfsys@invoke \pgfsys@setlinewidth 0.4pt \pgfsys@invoke \nullfont to0.0pt \pgfsys@beginscope \pgfsys@invoke \pgfsys@setlinewidth 0.775pt \pgfsys@invoke \pgfsys@moveto 0.0pt 0.0pt \pgfsys@lineto 10.66978pt -10.66978pt \pgfsys@lineto 21.33957pt 0.0pt \pgfsys@moveto 10.66978pt -10.66978pt \pgfsys@lineto 10.66978pt -21.33957pt \pgfsys@stroke \pgfsys@invoke \pgfsys@beginscope \pgfsys@invoke \pgfsys@beginscope \pgfsys@invoke \pgfsys@transformcm 0.8 0.0 0.0 0.8 13.44586pt -13.45903pt \pgfsys@invoke \definecolor pgfstrokecolor rgb 0,0,0 \pgfsys@color@rgb@stroke 000 \pgfsys@invoke \pgfsys@color@rgb@fill 000 \pgfsys@invoke α \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \hss \pgfsys@discardpath \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \hss \lxSVG@closescope \endpgfpicture) = 1.

T = T^{l} \lor_{α} T^{r},

T = T^{l} \lor_{α} T^{r},

∣ * T := T * ∣ := T and T * T^{'} := T^{l} \lor_{α} (T^{r} * T^{'}) + (T * T^{^{'} l}) \lor_{β} T^{^{'} r},

∣ * T := T * ∣ := T and T * T^{'} := T^{l} \lor_{α} (T^{r} * T^{'}) + (T * T^{^{'} l}) \lor_{β} T^{^{'} r},

Δ_{L R (Ω)} (T) := ∣ \otimes ∣ if T = ∣;

Δ_{L R (Ω)} (T) := ∣ \otimes ∣ if T = ∣;

\displaystyle\Delta_{LR(\Omega)}(T):=\Delta_{LR(\Omega)}(T^{l}\vee_{\alpha}T^{r}):=(T^{l}\vee_{\alpha}T^{r})\otimes|+(\ast,\vee_{\alpha})\bigl{(}\Delta_{LR(\Omega)}(T^{l})\otimes\Delta_{LR(\Omega)}(T^{r})\bigr{)},

\displaystyle\Delta_{LR(\Omega)}(T):=\Delta_{LR(\Omega)}(T^{l}\vee_{\alpha}T^{r}):=(T^{l}\vee_{\alpha}T^{r})\otimes|+(\ast,\vee_{\alpha})\bigl{(}\Delta_{LR(\Omega)}(T^{l})\otimes\Delta_{LR(\Omega)}(T^{r})\bigr{)},

Δ_{L R (Ω)} (\leavevmode t o 22.11 pt \vbox t o 22.11 pt \pgfpicture \makeatletter \lower -21.72707ptto0.0pt \pgfsys@beginscope \pgfsys@invoke \definecolor pgfstrokecolor rgb 0,0,0 \pgfsys@color@rgb@stroke 000 \pgfsys@invoke \pgfsys@color@rgb@fill 000 \pgfsys@invoke \pgfsys@setlinewidth 0.4pt \pgfsys@invoke \nullfont to0.0pt \pgfsys@beginscope \pgfsys@invoke \pgfsys@setlinewidth 0.775pt \pgfsys@invoke \pgfsys@moveto 0.0pt 0.0pt \pgfsys@lineto 10.66978pt -10.66978pt \pgfsys@lineto 21.33957pt 0.0pt \pgfsys@moveto 10.66978pt -10.66978pt \pgfsys@lineto 10.66978pt -21.33957pt \pgfsys@stroke \pgfsys@invoke \pgfsys@beginscope \pgfsys@invoke \pgfsys@beginscope \pgfsys@invoke \pgfsys@transformcm 0.8 0.0 0.0 0.8 13.44586pt -13.45903pt \pgfsys@invoke \definecolor pgfstrokecolor rgb 0,0,0 \pgfsys@color@rgb@stroke 000 \pgfsys@invoke \pgfsys@color@rgb@fill 000 \pgfsys@invoke α \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \hss \pgfsys@discardpath \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \hss \lxSVG@closescope \endpgfpicture)

Δ_{L R (Ω)} (\leavevmode t o 22.11 pt \vbox t o 22.11 pt \pgfpicture \makeatletter \lower -21.72707ptto0.0pt \pgfsys@beginscope \pgfsys@invoke \definecolor pgfstrokecolor rgb 0,0,0 \pgfsys@color@rgb@stroke 000 \pgfsys@invoke \pgfsys@color@rgb@fill 000 \pgfsys@invoke \pgfsys@setlinewidth 0.4pt \pgfsys@invoke \nullfont to0.0pt \pgfsys@beginscope \pgfsys@invoke \pgfsys@setlinewidth 0.775pt \pgfsys@invoke \pgfsys@moveto 0.0pt 0.0pt \pgfsys@lineto 10.66978pt -10.66978pt \pgfsys@lineto 21.33957pt 0.0pt \pgfsys@moveto 10.66978pt -10.66978pt \pgfsys@lineto 10.66978pt -21.33957pt \pgfsys@stroke \pgfsys@invoke \pgfsys@beginscope \pgfsys@invoke \pgfsys@beginscope \pgfsys@invoke \pgfsys@transformcm 0.8 0.0 0.0 0.8 13.44586pt -13.45903pt \pgfsys@invoke \definecolor pgfstrokecolor rgb 0,0,0 \pgfsys@color@rgb@stroke 000 \pgfsys@invoke \pgfsys@color@rgb@fill 000 \pgfsys@invoke α \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \hss \pgfsys@discardpath \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \hss \lxSVG@closescope \endpgfpicture)

Δ_{L R (Ω)} (\leavevmode t o 23.72 pt \vbox t o 22.11 pt \pgfpicture \makeatletter \lower -21.72707ptto0.0pt \pgfsys@beginscope \pgfsys@invoke \definecolor pgfstrokecolor rgb 0,0,0 \pgfsys@color@rgb@stroke 000 \pgfsys@invoke \pgfsys@color@rgb@fill 000 \pgfsys@invoke \pgfsys@setlinewidth 0.4pt \pgfsys@invoke \nullfont to0.0pt \pgfsys@beginscope \pgfsys@invoke \pgfsys@setlinewidth 0.775pt \pgfsys@invoke \pgfsys@moveto 0.0pt 0.0pt \pgfsys@lineto 10.66978pt -10.66978pt \pgfsys@lineto 21.33957pt 0.0pt \pgfsys@moveto 10.66978pt -10.66978pt \pgfsys@lineto 10.66978pt -21.33957pt \pgfsys@stroke \pgfsys@invoke \pgfsys@beginscope \pgfsys@invoke \pgfsys@moveto 10.66978pt 0.0pt \pgfsys@lineto 16.00467pt -5.33488pt \pgfsys@lineto 21.33957pt 0.0pt \pgfsys@stroke \pgfsys@invoke \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@beginscope \pgfsys@invoke \pgfsys@beginscope \pgfsys@invoke \pgfsys@transformcm 0.8 0.0 0.0 0.8 13.44586pt -13.45903pt \pgfsys@invoke \definecolor pgfstrokecolor rgb 0,0,0 \pgfsys@color@rgb@stroke 000 \pgfsys@invoke \pgfsys@color@rgb@fill 000 \pgfsys@invoke α \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@beginscope \pgfsys@invoke \pgfsys@beginscope \pgfsys@invoke \pgfsys@transformcm 0.8 0.0 0.0 0.8 18.01003pt -9.46896pt \pgfsys@invoke \definecolor pgfstrokecolor rgb 0,0,0 \pgfsys@color@rgb@stroke 000 \pgfsys@invoke \pgfsys@color@rgb@fill 000 \pgfsys@invoke β \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \hss \pgfsys@discardpath \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \hss \lxSVG@closescope \endpgfpicture)

Δ_{L R (Ω)} (\leavevmode t o 24.15 pt \vbox t o 22.11 pt \pgfpicture \makeatletter \lower -21.72707ptto0.0pt \pgfsys@beginscope \pgfsys@invoke \definecolor pgfstrokecolor rgb 0,0,0 \pgfsys@color@rgb@stroke 000 \pgfsys@invoke \pgfsys@color@rgb@fill 000 \pgfsys@invoke \pgfsys@setlinewidth 0.4pt \pgfsys@invoke \nullfont to0.0pt \pgfsys@beginscope \pgfsys@invoke \pgfsys@setlinewidth 0.775pt \pgfsys@invoke \pgfsys@moveto 0.0pt 0.0pt \pgfsys@lineto 10.66978pt -10.66978pt \pgfsys@lineto 21.33957pt 0.0pt \pgfsys@moveto 10.66978pt -10.66978pt \pgfsys@lineto 10.66978pt -21.33957pt \pgfsys@stroke \pgfsys@invoke \pgfsys@beginscope \pgfsys@invoke \pgfsys@moveto 0.0pt 0.0pt \pgfsys@lineto 5.33488pt -5.33488pt \pgfsys@lineto 10.66978pt 0.0pt \pgfsys@stroke \pgfsys@invoke \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@beginscope \pgfsys@invoke \pgfsys@beginscope \pgfsys@invoke \pgfsys@transformcm 0.8 0.0 0.0 0.8 13.44586pt -13.45903pt \pgfsys@invoke \definecolor pgfstrokecolor rgb 0,0,0 \pgfsys@color@rgb@stroke 000 \pgfsys@invoke \pgfsys@color@rgb@fill 000 \pgfsys@invoke α \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@beginscope \pgfsys@invoke \pgfsys@beginscope \pgfsys@invoke \pgfsys@transformcm 0.8 0.0 0.0 0.8 -1.62234pt -9.46896pt \pgfsys@invoke \definecolor pgfstrokecolor rgb 0,0,0 \pgfsys@color@rgb@stroke 000 \pgfsys@invoke \pgfsys@color@rgb@fill 000 \pgfsys@invoke β \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \hss \pgfsys@discardpath \pgfsys@invoke \lxSVG@closescope \pgfsys@endscope \hss \lxSVG@closescope \endpgfpicture)

ε_{L R (Ω)} : H_{L R} (Ω) \to k, ∣ \mapsto 1_{k} and T \mapsto 0 for ∣ \neq = T \in Y_{\infty} (Ω)

ε_{L R (Ω)} : H_{L R} (Ω) \to k, ∣ \mapsto 1_{k} and T \mapsto 0 for ∣ \neq = T \in Y_{\infty} (Ω)

∣ : k \to H_{L R} (Ω), 1_{k} \mapsto ∣.

∣ : k \to H_{L R} (Ω), 1_{k} \mapsto ∣.

R^{c} (T) = ∣ and P^{c} (T) = T .

R^{c} (T) = ∣ and P^{c} (T) = T .

Adm (T) := Adm_{*} (T) ∖ {\mbox e m pt y c u t, t o t a l c u t} .

Adm (T) := Adm_{*} (T) ∖ {\mbox e m pt y c u t, t o t a l c u t} .

R^{c}(~{}\begin{picture}(15.0,18.0)(-5.0,-1.0)\put(3.0,0.0){\circle*{2.0}} \put(-0.2,0.2){$\vee$} \put(6.0,7.0){\circle*{2.0}} \put(0.0,7.0){\circle*{2.0}} \put(0.0,14.0){\circle*{2.0}} \put(0.0,7.0){\line(0,1){7.0}} \put(-3.0,4.0){\line(1,0){7.0}} \put(5.0,-2.0){\tiny$\alpha$} \put(9.0,5.0){\tiny$\gamma$} \put(-6.0,5.0){\tiny$\beta$} \put(-6.0,12.0){\tiny$\delta$} \end{picture}~{})=\begin{picture}(12.0,5.0)(0.0,-1.0)\put(3.0,0.0){\circle*{2.0}} \put(3.0,0.0){\line(0,1){5.0}} \put(3.0,5.0){\circle*{2.0}} \put(6.0,-3.0){\tiny$\alpha$} \put(6.0,3.0){\tiny$\gamma$} \end{picture}\,\text{ and }\,P^{c}(~{}\begin{picture}(15.0,18.0)(-5.0,-1.0)\put(3.0,0.0){\circle*{2.0}} \put(-0.2,0.2){$\vee$} \put(6.0,7.0){\circle*{2.0}} \put(0.0,7.0){\circle*{2.0}} \put(0.0,14.0){\circle*{2.0}} \put(0.0,7.0){\line(0,1){7.0}} \put(-3.0,4.0){\line(1,0){7.0}} \put(5.0,-2.0){\tiny$\alpha$} \put(9.0,5.0){\tiny$\gamma$} \put(-6.0,5.0){\tiny$\beta$} \put(-6.0,12.0){\tiny$\delta$} \end{picture}~{})=\begin{picture}(12.0,5.0)(0.0,-1.0)\put(3.0,0.0){\circle*{2.0}} \put(3.0,0.0){\line(0,1){5.0}} \put(3.0,5.0){\circle*{2.0}} \put(6.0,-3.0){\tiny$\beta$} \put(6.0,3.0){\tiny$\delta$} \end{picture}.

R^{c}(~{}\begin{picture}(15.0,18.0)(-5.0,-1.0)\put(3.0,0.0){\circle*{2.0}} \put(-0.2,0.2){$\vee$} \put(6.0,7.0){\circle*{2.0}} \put(0.0,7.0){\circle*{2.0}} \put(0.0,14.0){\circle*{2.0}} \put(0.0,7.0){\line(0,1){7.0}} \put(-3.0,4.0){\line(1,0){7.0}} \put(5.0,-2.0){\tiny$\alpha$} \put(9.0,5.0){\tiny$\gamma$} \put(-6.0,5.0){\tiny$\beta$} \put(-6.0,12.0){\tiny$\delta$} \end{picture}~{})=\begin{picture}(12.0,5.0)(0.0,-1.0)\put(3.0,0.0){\circle*{2.0}} \put(3.0,0.0){\line(0,1){5.0}} \put(3.0,5.0){\circle*{2.0}} \put(6.0,-3.0){\tiny$\alpha$} \put(6.0,3.0){\tiny$\gamma$} \end{picture}\,\text{ and }\,P^{c}(~{}\begin{picture}(15.0,18.0)(-5.0,-1.0)\put(3.0,0.0){\circle*{2.0}} \put(-0.2,0.2){$\vee$} \put(6.0,7.0){\circle*{2.0}} \put(0.0,7.0){\circle*{2.0}} \put(0.0,14.0){\circle*{2.0}} \put(0.0,7.0){\line(0,1){7.0}} \put(-3.0,4.0){\line(1,0){7.0}} \put(5.0,-2.0){\tiny$\alpha$} \put(9.0,5.0){\tiny$\gamma$} \put(-6.0,5.0){\tiny$\beta$} \put(-6.0,12.0){\tiny$\delta$} \end{picture}~{})=\begin{picture}(12.0,5.0)(0.0,-1.0)\put(3.0,0.0){\circle*{2.0}} \put(3.0,0.0){\line(0,1){5.0}} \put(3.0,5.0){\circle*{2.0}} \put(6.0,-3.0){\tiny$\beta$} \put(6.0,3.0){\tiny$\delta$} \end{picture}.

Δ_{L R (Ω)} (T) = c \in Adm_{*} (T) \sum P^{c} (T) \otimes R^{c} (T) = T \otimes ∣ + ∣ \otimes T + c \in Adm (T) \sum P^{c} (T) \otimes R^{c} (T) .

Δ_{L R (Ω)} (T) = c \in Adm_{*} (T) \sum P^{c} (T) \otimes R^{c} (T) = T \otimes ∣ + ∣ \otimes T + c \in Adm (T) \sum P^{c} (T) \otimes R^{c} (T) .

Δ_{L R (Ω)} (T) =

Δ_{L R (Ω)} (T) =

=

=

(by the induction hypothesis)

=

=

=

=

Δ_{L R (Ω)} (T) =

Δ_{L R (Ω)} (T) =

=

\displaystyle\ \Big{(}T^{r}\otimes|+|\otimes T^{r}+\sum_{c^{\prime}\in\text{\rm Adm}(T^{r})}P^{c^{\prime}}(T^{r})\otimes R^{c^{\prime}}(T^{r})\Big{)}\biggr{)}\hskip 28.45274pt(\text{by the induction hypothesis})

=

+ ∣ \otimes T^{l} \otimes T^{r} \otimes ∣ + ∣ \otimes T^{l} \otimes ∣ \otimes T^{r} + ∣ \otimes T^{l} \otimes c^{'} \in Adm (T^{r}) \sum P^{c^{'}} (T^{r}) \otimes R^{c^{'}} (T^{r})

+ c \in Adm (T^{l}) \sum P^{c} (T^{l}) \otimes R^{c} (T^{l}) \otimes T^{r} \otimes ∣ + c \in Adm (T^{l}) \sum P^{c} (T^{l}) \otimes R^{c} (T^{l}) \otimes ∣ \otimes T^{r}

Peer Reviews

No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.

Videos

No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.

Full text

††footnotetext: * Corresponding author.

Hopf algebras of planar binary trees: An operated algebra approach

Yi Zhang

School of Mathematics and Statistics, Lanzhou University, Lanzhou, Gansu 730000, P. R. China

[email protected]

and

Xing Gao*∗*

School of Mathematics and Statistics, Key Laboratory of Applied Mathematics and Complex Systems, Lanzhou University, Lanzhou, Gansu 730000, P. R. China

[email protected]

Abstract.

Parallel to operated algebras built on top of planar rooted trees via the grafting operator $B^{+}$ , we introduce and study $\vee$ -algebras and more generally $\vee_{\Omega}$ -algebras based on planar binary trees. Involving an analogy of the Hochschild 1-cocycle condition, cocycle $\vee_{\Omega}$ -bialgebras (resp. $\vee_{\Omega}$ -Hopf algebras) are also introduced and their free objects are constructed via decorated planar binary trees. As a special case, the well-known Loday-Ronco Hopf algebra $H_{LR}$ is a free cocycle $\vee$ -Hopf algebra. By means of admissible cuts, a combinatorial description of the coproduct $\Delta_{LR(\Omega)}$ on decorated planar binary trees is given, as in the Connes-Kreimer Hopf algebra by admissible cuts.

Key words and phrases:

Hopf algebras; Operated algebras; Planar binary trees

2010 Mathematics Subject Classification:

16W99, 08B20 16T10 16T05 16T30

1 Introduction
2 Hopf algebras of decorated planar binary trees
2.1 Hopf algebras of decorated planar binary trees
2.2 A combinatorial description of $\Delta_{LR(\Omega)}$
2.3 Subcoalgebras of coalgebra of decorated planar binary trees
3 Free cocycle $\vee_{\Omega}$ -Hopf algebras of decorated planar binary trees
3.1 Free $\vee_{\Omega}$ -algebras of decorated planar binary trees
3.2 Free cocycle $\vee_{\Omega}$ -Hopf algebras of decorated planar binary trees

1. Introduction

The rooted tree is a significant object studied in algebra and combinatorics. Many algebraic structures have been equipped on rooted trees. One of the most important examples is the Connes-Kreimer Hopf algebra [9], which is employed to deal with a problem of renormalization in Quantum Field Theory [4, 7, 10, 12, 21, 24]. Other Hopf algebras have also been constructed on rooted trees in different situations, such as Loday-Ronco [27], Grossman-Larson [18], Foissy-Holtkamp [13, 14, 22]. Furthermore other algebraic structures, such as dendriform algebras [28], pre-Lie algebras [8], operated algebras [19], and Rota-Baxter algebras [38], have been established on rooted trees. Most of these algebraic structures possess certain universal properties. For example, the Connes-Kreimer Hopf algebra of rooted trees inherits its algebra structure from the initial object in the category of (commutative) algebras with a linear operator [13, 34].

As a special case of rooted trees, (rooted) planar binary trees play an indispensable role in the study of combinatorics [36], algebraic operads [6, 31], associahedrons [30], cluster algebras [23] and Hopf algebras [1, 3, 27]. In [27], Loday and Ronco defined a Hopf algebra $H_{LR}$ (with unity) on planar binary trees, which is a free associative algebra on the trees of the form $|\vee T$ , that is the trees such that the tree born from the root on the left has only one leaf. The $H_{LR}$ (without unity) is the free dendriform algebra on one generator [27, 29]. Later, Brouder and Frabetti [3] showed that there exists a noncommutative Hopf algebra on planar binary trees which represents the renormalization group of quantum electrodynamics, and the coaction which describes the renormalization procedure. In the algebraic framework of Chapoton [5] for Bessel operad, a Hopf operad is constructed on the vector spaces spanned by forests of leaf-labeled binary rooted trees. Aguiar and Sottile further studied the structure of the Loday-Ronco Hopf algebra by a new basis in [1], where the product, coproduct and antipode in terms of this basis were also given.

The concept of an algebra with (one or more) linear operators was introduced by Kurosh [26]. Later Guo [19] constructed the free objects of such algebras in terms of various combinatorial objects, such as Motzkin paths, rooted forests and bracketed words by the name of $\Omega$ -operated algebras, where $\Omega$ is a nonempty set used to index the operators. See also [2, 17, 20]. The Connes-Kreimer Hopf algebra of rooted trees can be viewed as an operated algebra, where the operator is the grafting operation $B^{+}$ . More generally, the decorated (planar) rooted trees with vertices decorated by a set $\Omega$ , together with a set of grafting operations $\{B^{+}_{\alpha}\mid\alpha\in\Omega\})$ , is an $\Omega$ -operated algebra [25, 38]. Indeed it is the free $\Omega$ -operated algebra on the empty set or equivalently the initial object in the category of $\Omega$ -operated algebras.

It is well-known that the noncommutative Connes-Kreimer Hopf algebra of planar rooted trees is isomorphic to the Loday-Ronco Hopf algebra of planar binary trees [14, 22]. Now the former can be treated in the framework of operated algebras [38]. So there should be an analogy of operated alebras on top of planar binary trees, which is introduced and explored in the present paper by the name of $\vee$ -algebras or more generally $\vee_{\Omega}$ -algebras. Let us emphasize that the binary grafting operation $\vee$ on planar binary trees has subtle difference with the aforementioned grafting operation $B^{+}$ on rooted trees—the $\vee$ is binary while $B^{+}$ is unary. Thanks to these new concepts, the decorated planar binary trees $H_{LR}(\Omega)$ can viewed as a free cocycle $\vee_{\Omega}$ -bialgebra and further a free cocycle $\vee_{\Omega}$ -Hopf algebra on the empty set, involving an analogues of a Hochschild $1$ -cocycle condition on planar rooted trees [15]. In particular, the well-known Loday-Ronco Hopf algebra $H_{LR}$ is a free cocycle $\vee$ -Hopf algebra. This new free algebraic structure on planar binary trees validates again that most of algebraic structures on rooted trees have universal properties.

Our second source of inspiration and motivation is the admissible cut on rooted trees which was introduced by Connes and Kreimer [9]. We adapt from this cut to expose the concept of admissible cut on decorated planar binary trees. Surprisingly, the admissible cuts on decorated planar binary trees, make it possible to give a combinatorial description of the coproduct on the decorated Loday-Ronco Hopf algebras. We point out that our admissible cut is different from the one introduced by Connes and Kreimer [9], see Remark 2.5.

Structure of the Paper. In Section 2, we first recall some results concerning the Hopf algebraic structures on decorated planar binary trees. Motivated by the admissible cut on rooted trees, we introduce the concept of an admissible cut on decorated planar binary trees. Having this concept in hand, we give a combinatorial description of the coproduct of the decorated Loday-Ronco Hopf algebra (Theorem 2.6). We end this section by showing that $H_{LR}(\Omega)$ is a strictly graded coalgebra concerning the coalgebra structure (Theorem 2.12). In Section 3, viewing the Hopf algebra of decorated planar binary trees in the framework of operated algebras, we build $\vee$ -algebras and more generally $\vee_{\Omega}$ -algebras (Definition 3.2), leading to the notations of (cocycle) $\vee_{\Omega}$ -bialgebras and $\vee_{\Omega}$ -Hopf algebras (Definitions 3.6, 3.7), involving a $\vee$ -cocycle condition. With the help of these concepts, we first equip the decorated planar binary trees $H_{LR}(\Omega)$ with a free $\vee_{\Omega}$ -algebraic structure (Theorem 3.5). A family of coideals of a $\vee_{\Omega}$ -bialgebra is also given (Proposition 3.8). We then prove respectively that $H_{LR}(\Omega)$ is the free cocycle $\vee_{\Omega}$ -bialgebra and free cocycle $\vee_{\Omega}$ -Hopf algebra on the empty set (Theorem 3.10). In particular when $\Omega$ is a singleton set, we establish respectively the free cocycle $\vee$ -bialgebra and free cocycle $\vee$ -Hopf algebra structures on the well-known Loday-Ronco Hopf algebra $H_{LR}$ (Corollary 3.11).

**Convention. ** Throughout this paper, let ${\bf k}$ be a unitary commutative ring which will be the base ring of all modules, algebras, coalgebras and bialgebras, as well as linear maps. Algebras are unitary algebras but not necessary commutative. For any set $Y$ , denote by ${\bf k}Y$ the free k-module with basis $Y$ .

2. Hopf algebras of decorated planar binary trees

In this section, we expose some results and notations concerning Hopf algebraic structures on decorated planar binary trees, which will be used later. See [6, 14, 33, 35] for more details.

2.1. Hopf algebras of decorated planar binary trees

A ${\bf planar\ tree}$ is an oriented graph draw on a plane, with a preferred vertex called the $\mathbf{root}$ . It is binary when any vertex is trivalent (one root and two leaves) [27]. The root is at the bottom of the tree. For each $n\geqslant 0$ , the set of planar binary trees with $n$ interior vertices will be denoted by $Y_{n}$ . For instance,

[TABLE]

Here $|$ stands for the unique tree with one leaf. The number of the set $Y_{n}$ is given by the Catalan number $\frac{(2n)!}{n!(n+1)!}$ [27].

Let $\Omega$ be a nonempty set throughout the remainder of the paper. For each $n\geqslant 0$ , let $Y_{n}(\Omega)$ denote the set of planar binary trees in $Y_{n}$ with interior vertices decorated by elements of $\Omega$ . Denote by

[TABLE]

A planar binary tree $T$ in $Y_{n}(\Omega)$ is called an $n$ -decorated planar binary tree or $n$ -tree for simplicity. The $\mathbf{depth}$ $\mathrm{dep}(T)$ of a decorated planar binary tree $T$ is the maximal length of linear chains from the root to the leaves of the tree. For example,

[TABLE]

Let $T\in Y_{m}(\Omega)$ and $T^{\prime}\in Y_{n}(\Omega)$ be two decorated planar binary trees and $\alpha$ an element in $\Omega$ . The grafting $\vee_{\alpha}$ of $T$ and $T^{\prime}$ on $\alpha$ is the $(n+m+1)$ -decorated planar binary tree $T\vee_{\alpha}T^{\prime}\in Y_{m+n+1}(\Omega)$ , obtained by joining the roots of $T$ and $T^{\prime}$ and create a new root, which is decorated by $\alpha$ . For any decorated planar binary tree $T\in Y_{n}(\Omega)$ with $n\geqslant 1$ , there exist unique elements $T^{l}\in Y_{k}(\Omega)$ , $T^{r}\in Y_{n-k-1}(\Omega)$ and $\alpha\in\Omega$ such that

[TABLE]

where $T^{l}$ and $T^{r}$ are the left-hand side of $T$ and the right-hand side of $T$ , respectively. For instance

[TABLE]

A multiplication $\ast$ on $H_{LR}(\Omega)$ with unit $|$ is given recursively on the sum of depth as [14, Sec. 4.3]

[TABLE]

where $T=T^{l}\vee_{\alpha}T^{r}$ and $T^{\prime}=T^{{}^{\prime}l}\vee_{\beta}T^{{}^{\prime}r}$ are in $Y_{\infty}(\Omega)$ with $\alpha,\beta\in\Omega$ . Let us agree to fix the notation $\ast$ to denote the multiplication given in Eq. (1) hereafter.

Example 2.1.

We have

[TABLE]

In the undecorated case, the description of the coproduct in the Loday-Ronco Hopf algebra $H_{LR}$ was first introduced in [27, Proposition 3.3]. In the decorated case, Foissy [14, Sec. 4.3] equipped the $\mathbf{k}$ -algebra $H_{LR}(\Omega)$ with a coproduct $\Delta_{LR(\Omega)}$ described recursively on $\mathrm{dep}(T)$ for basis elements $T\in Y_{\infty}(\Omega)$ as

[TABLE]

and for $T=T^{l}\vee_{\alpha}T^{r}$ ,

[TABLE]

where $(\ast,\vee_{\alpha}):=(\ast\otimes\vee_{\alpha})\circ{\tau_{23}}$ and $\tau_{23}$ is the permutation of the second and third tensor factors.

Example 2.2.

We have

[TABLE]

Foissy [14] also defined linear maps

[TABLE]

and

[TABLE]

Recall [33] that a bialgebra $(H,\ast_{H},1_{H},\Delta,\varepsilon)$ is called $\mathbf{graded}$ if there are $\mathbf{k}$ -submodules $H^{(n)},n\geqslant 0$ , of $H$ such that

(a)

$H=\bigoplus_{n=0}^{\infty}H^{(n)}$ ; 2. (b)

$H^{(p)}H^{(q)}\subseteq H^{(p+q)},\,p,q\geqslant 0$ ; and 3. (c)

$\Delta(H^{(n)})\subseteq\bigoplus_{p+q=n}H^{(p)}\otimes H^{(q)},n\geqslant 0$ .

Elements of $H^{(n)}$ are called to have degree $n$ . $H$ is called $\mathbf{connected}$ if $H^{(0)}=\mathbf{k}$ and $\ker\varepsilon=\bigoplus_{n\geqslant 1}H^{(n)}$ . It is well-known that a connected graded bialgebra is a Hopf algebra [32].

Lemma 2.3.

[14, Sec. 4.3]** [33, Sec. 6.3.5] The quintuple $(H_{LR}(\Omega),\ast,|,\Delta_{LR(\Omega)},\varepsilon_{LR(\Omega)})$ is a connected graded bialgebra with grading $H_{LR}(\Omega)=\oplus_{n\geqslant 0}{\bf k}Y_{n}(\Omega)$ and hence a Hopf algebra.

If $\Omega$ is a singleton set, then $Y_{\infty}(\Omega)$ is precisely the planar binary trees (without decorations) and one gets the Loday-Ronco Hopf algebra on planar binary trees [27, Thm. 3.1].

2.2. A combinatorial description of $\Delta_{LR(\Omega)}$

Next we give a combinatorial description of the coproduct $\Delta_{LR(\Omega)}$ by the admissible cut which was introduced by Connes and Kreimer [9] on rooted trees and further studied by Foissy [16] on decorated rooted trees. This notion of cut of rooted trees can be adapted to decorated planar binary trees as follows.

Let $T\in Y_{\infty}(\Omega)$ be a decorated planar binary tree. The edges of $T$ are oriented upwards, from root to leaves. A (non-total) cut $c$ is a choice of edges connecting internal vertices of $T$ . Note that an edge connecting a leaf and an internal vertex is not in a cut. In particular, the empty cut is a cut with the choice of no edges. The cut $c$ is called admissible if any oriented path from a vertex of the tree to the root meets at most one cut edge. For an admissible cut $c$ , cutting each edge in $c$ into two edges, $T$ is sent to a pair $(P^{c}(T),R^{c}(T))$ , such that $R^{c}(T)$ is the connected component containing the root of $T$ and $P^{c}(T)$ is the product of the other connected components with respect to the multiplication $\ast$ given in Eq. (1), from left to right. The total cut is also added, which is by convention an admissible cut such that

[TABLE]

The set of admissible cuts of $T$ is denoted by $\text{\rm Adm}_{*}(T)$ . Let us note that the empty cut is admissible. Denote by

[TABLE]

Example 2.4.

(a)

Consider the decorated planar binary tree $T=\leavevmode\hbox to22.61pt{\vbox to22.03pt{\pgfpicture\makeatletter\hbox{\hskip 0.92842pt\lower-21.684pt\hbox to0.0pt{\pgfsys@beginscope\pgfsys@invoke{ }\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\pgfsys@setlinewidth{0.4pt}\pgfsys@invoke{ }\nullfont\hbox to0.0pt{\pgfsys@beginscope\pgfsys@invoke{ }{{}}\pgfsys@setlinewidth{0.775pt}\pgfsys@invoke{ }\pgfsys@setlinewidth{0.68889pt}\pgfsys@invoke{ }{ {}{{}}{} {{}{}}{} {{}{}}{}{}{{}}{} {{}{}}{}{}\pgfsys@moveto{0.0pt}{0.0pt}\pgfsys@lineto{10.66978pt}{-10.66978pt}\pgfsys@lineto{21.33957pt}{0.0pt}\pgfsys@moveto{10.66978pt}{-10.66978pt}\pgfsys@lineto{10.66978pt}{-21.33957pt}\pgfsys@stroke\pgfsys@invoke{ } \pgfsys@beginscope\pgfsys@invoke{ }{{}} {}{{}}{} {{}{}}{} {{}{}}{}{}\pgfsys@moveto{0.0pt}{0.0pt}\pgfsys@lineto{5.33488pt}{-5.33488pt}\pgfsys@lineto{10.66978pt}{0.0pt}\pgfsys@stroke\pgfsys@invoke{ } \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke{ }{{}} {}{{}}{} {{}{}}{} {{}{}}{}{}\pgfsys@moveto{5.33488pt}{0.0pt}\pgfsys@lineto{8.00233pt}{-2.66743pt}\pgfsys@lineto{10.66978pt}{0.0pt}\pgfsys@stroke\pgfsys@invoke{ } \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope {{}}{{}}\hbox{\hbox{{\pgfsys@beginscope\pgfsys@invoke{ }{{}{}{{ {}{}}}{ {}{}} {{}{{}}}{{}{}}{}{{}{}}{}{}{}{}{} { }{{{{}}\pgfsys@beginscope\pgfsys@invoke{ }\pgfsys@transformcm{0.8}{0.0}{0.0}{0.8}{13.44586pt}{-13.45903pt}\pgfsys@invoke{ }\hbox{{\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\hbox{{$ \alpha $}} }}\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} {{}}{{}}\hbox{\hbox{{\pgfsys@beginscope\pgfsys@invoke{ }{{}{}{{ {}{}}}{ {}{}} {{}{{}}}{{}{}}{}{{}{}}{}{}{}{}{} { }{{{{}}\pgfsys@beginscope\pgfsys@invoke{ }\pgfsys@transformcm{0.8}{0.0}{0.0}{0.8}{-0.12842pt}{-10.53569pt}\pgfsys@invoke{ }\hbox{{\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\hbox{{$ \beta $}} }}\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} {{}}{{}}\hbox{\hbox{{\pgfsys@beginscope\pgfsys@invoke{ }{{}{}{{ {}{}}}{ {}{}} {{}{{}}}{{}{}}{}{{}{}}{}{}{}{}{} { }{{{{}}\pgfsys@beginscope\pgfsys@invoke{ }\pgfsys@transformcm{0.8}{0.0}{0.0}{0.8}{9.6659pt}{-4.14523pt}\pgfsys@invoke{ }\hbox{{\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\hbox{{$ \gamma $}} }}\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} } \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope{}{}{}\hss}\pgfsys@discardpath\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope\hss}}\lxSVG@closescope\endpgfpicture}}$ with $\alpha,\beta,\gamma\in\Omega$ . It has $2^{2}$ non-total cuts and one total cut.

[TABLE] 2. (b)

Consider the decorated planar binary tree $T=\leavevmode\hbox to31.54pt{\vbox to22.11pt{\pgfpicture\makeatletter\hbox{\hskip 5.19658pt\lower-21.72707pt\hbox to0.0pt{\pgfsys@beginscope\pgfsys@invoke{ }\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\pgfsys@setlinewidth{0.4pt}\pgfsys@invoke{ }\nullfont\hbox to0.0pt{\pgfsys@beginscope\pgfsys@invoke{ }{{}}\pgfsys@setlinewidth{0.775pt}\pgfsys@invoke{ }{ {}{{}}{} {{}{}}{} {{}{}}{}{}{{}}{} {{}{}}{}{}\pgfsys@moveto{0.0pt}{0.0pt}\pgfsys@lineto{10.66978pt}{-10.66978pt}\pgfsys@lineto{21.33957pt}{0.0pt}\pgfsys@moveto{10.66978pt}{-10.66978pt}\pgfsys@lineto{10.66978pt}{-21.33957pt}\pgfsys@stroke\pgfsys@invoke{ } \pgfsys@beginscope\pgfsys@invoke{ }{{}} {}{{}}{} {{}{}}{} {{}{}}{}{}\pgfsys@moveto{0.0pt}{0.0pt}\pgfsys@lineto{2.66743pt}{-2.66743pt}\pgfsys@lineto{5.33488pt}{0.0pt}\pgfsys@stroke\pgfsys@invoke{ } \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke{ }{{}} {}{{}}{} {{}{}}{} {{}{}}{}{}\pgfsys@moveto{16.00467pt}{0.0pt}\pgfsys@lineto{18.67212pt}{-2.66743pt}\pgfsys@lineto{21.33957pt}{0.0pt}\pgfsys@stroke\pgfsys@invoke{ } \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope {{}}{{}}\hbox{\hbox{{\pgfsys@beginscope\pgfsys@invoke{ }{{}{}{{ {}{}}}{ {}{}} {{}{{}}}{{}{}}{}{{}{}}{}{}{}{}{} { }{{{{}}\pgfsys@beginscope\pgfsys@invoke{ }\pgfsys@transformcm{0.8}{0.0}{0.0}{0.8}{-4.39658pt}{-7.33488pt}\pgfsys@invoke{ }\hbox{{\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\hbox{{$ {\beta} $}} }}\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} {{}}{{}}\hbox{\hbox{{\pgfsys@beginscope\pgfsys@invoke{ }{{}{}{{ {}{}}}{ {}{}} {{}{{}}}{{}{}}{}{{}{}}{}{}{}{}{} { }{{{{}}\pgfsys@beginscope\pgfsys@invoke{ }\pgfsys@transformcm{0.8}{0.0}{0.0}{0.8}{21.40273pt}{-6.27933pt}\pgfsys@invoke{ }\hbox{{\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\hbox{{$ {\gamma} $}} }}\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} {{}}{{}}\hbox{\hbox{{\pgfsys@beginscope\pgfsys@invoke{ }{{}{}{{ {}{}}}{ {}{}} {{}{{}}}{{}{}}{}{{}{}}{}{}{}{}{} { }{{{{}}\pgfsys@beginscope\pgfsys@invoke{ }\pgfsys@transformcm{0.8}{0.0}{0.0}{0.8}{13.44586pt}{-13.45903pt}\pgfsys@invoke{ }\hbox{{\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\hbox{{$ {\alpha} $}} }}\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} } \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope{}{}{}\hss}\pgfsys@discardpath\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope\hss}}\lxSVG@closescope\endpgfpicture}}$ with $\alpha,\beta,\gamma\in\Omega$ . It has $2^{2}$ non-total cuts and one total cut.

[TABLE]

Remark 2.5.

It should be pointed out that our admissible cut is different from the one, which is introduced by Connes-Kreimer on undecorated planar rooted trees [9] and further studied by Foissy on decorated planar rooted trees [16]. For example, under the framework of [16], Foissy gave

[TABLE]

The undecorated case can also be found in [9, Figure 5]. Note that the cutting edge is deleted. However our admissible cut $c$ cuts each cutting edge into two edges.

Now we are ready to give a combinatorial description of the coproduct $\Delta_{LR(\Omega)}$ .

Theorem 2.6.

Let $T\in Y_{\infty}(\Omega)\setminus\{|\}$ . Then

[TABLE]

Proof.

We prove Eq. (4) by induction on the depth $\mathrm{dep}(T)\geqslant 1$ . For the initial step of $\mathrm{dep}(T)=1$ , we have $T=\leavevmode\hbox to22.11pt{\vbox to22.11pt{\pgfpicture\makeatletter\hbox{\hskip 0.3875pt\lower-21.72707pt\hbox to0.0pt{\pgfsys@beginscope\pgfsys@invoke{ }\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\pgfsys@setlinewidth{0.4pt}\pgfsys@invoke{ }\nullfont\hbox to0.0pt{\pgfsys@beginscope\pgfsys@invoke{ }{{}}\pgfsys@setlinewidth{0.775pt}\pgfsys@invoke{ }{ {}{{}}{} {{}{}}{} {{}{}}{}{}{{}}{} {{}{}}{}{}\pgfsys@moveto{0.0pt}{0.0pt}\pgfsys@lineto{10.66978pt}{-10.66978pt}\pgfsys@lineto{21.33957pt}{0.0pt}\pgfsys@moveto{10.66978pt}{-10.66978pt}\pgfsys@lineto{10.66978pt}{-21.33957pt}\pgfsys@stroke\pgfsys@invoke{ } {{}}{{}}\hbox{\hbox{{\pgfsys@beginscope\pgfsys@invoke{ }{{}{}{{ {}{}}}{ {}{}} {{}{{}}}{{}{}}{}{{}{}}{}{}{}{}{} { }{{{{}}\pgfsys@beginscope\pgfsys@invoke{ }\pgfsys@transformcm{0.8}{0.0}{0.0}{0.8}{13.44586pt}{-13.45903pt}\pgfsys@invoke{ }\hbox{{\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\hbox{{$ {\alpha} $}} }}\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} } \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope{}{}{}\hss}\pgfsys@discardpath\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope\hss}}\lxSVG@closescope\endpgfpicture}}$ for some $\alpha\in\Omega$ . Since ${\alpha}$ has only one internal vertex and each edge in a cut can’t connect a leaf and an internal vertex, $T$ has only two cuts—the total cut and the empty cut. Thus $\text{\rm Adm}_{*}(T)$ consists of the total cut and the empty cut, and so

[TABLE]

For the induction step of $\mathrm{dep}(T)\geqslant 2$ , we may write $T=T^{l}\vee_{\alpha}T^{r}$ for some $T^{l},T^{r}\in Y_{\infty}(\Omega)$ and $\alpha\in\Omega$ . We have two cases to consider.

Case 1. $\mathrm{dep}(T^{l})=0$ and $\mathrm{dep}(T^{r})\geqslant 1$ , or $\mathrm{dep}(T^{l})\geqslant 1$ and $\mathrm{dep}(T^{r})=0$ . Without loss of generality, we consider $\mathrm{dep}(T^{l})=0$ and $\mathrm{dep}(T^{r})\geqslant 1$ . Then $T^{l}=|$ and $T=|\vee_{\alpha}T^{r}$ . By Eq. (3),

[TABLE]

Case 2. $\mathrm{dep}(T^{l})\geqslant 1$ and $\mathrm{dep}(T^{r})\geqslant 1$ . Then $T=T^{l}\vee_{\alpha}T^{r}$ with $T^{l}\neq|$ and $T^{r}\neq|$ . It follows from Eq. (3) that

[TABLE]

We may draw the decorated planar binary tree $T$ graphically as

[TABLE]

Then all kinds of admissible cuts in $\text{\rm Adm}(T)$ can be illustrated graphically as:

[TABLE]

Note that the last eight terms in Eq. (5) are precisely corresponding to the eight kinds of admissible cuts in $\text{\rm Adm}(T)$ . Thus

[TABLE]

This completes the proof. ∎

Example 2.7.

(a)

Consider the planar binary tree $T=\leavevmode\hbox to23.72pt{\vbox to22.11pt{\pgfpicture\makeatletter\hbox{\hskip 1.99547pt\lower-21.72707pt\hbox to0.0pt{\pgfsys@beginscope\pgfsys@invoke{ }\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\pgfsys@setlinewidth{0.4pt}\pgfsys@invoke{ }\nullfont\hbox to0.0pt{\pgfsys@beginscope\pgfsys@invoke{ }{{}}\pgfsys@setlinewidth{0.775pt}\pgfsys@invoke{ }{ {}{{}}{} {{}{}}{} {{}{}}{}{}{{}}{} {{}{}}{}{}\pgfsys@moveto{0.0pt}{0.0pt}\pgfsys@lineto{10.66978pt}{-10.66978pt}\pgfsys@lineto{21.33957pt}{0.0pt}\pgfsys@moveto{10.66978pt}{-10.66978pt}\pgfsys@lineto{10.66978pt}{-21.33957pt}\pgfsys@stroke\pgfsys@invoke{ } \pgfsys@beginscope\pgfsys@invoke{ }{{}} {}{{}}{} {{}{}}{} {{}{}}{}{}\pgfsys@moveto{0.0pt}{0.0pt}\pgfsys@lineto{5.33488pt}{-5.33488pt}\pgfsys@lineto{10.66978pt}{0.0pt}\pgfsys@stroke\pgfsys@invoke{ } \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke{ }{{}} {}{{}}{} {{}{}}{} {{}{}}{}{}\pgfsys@moveto{5.33488pt}{0.0pt}\pgfsys@lineto{8.00233pt}{-2.66743pt}\pgfsys@lineto{10.66978pt}{0.0pt}\pgfsys@stroke\pgfsys@invoke{ } \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope {{}}{{}}\hbox{\hbox{{\pgfsys@beginscope\pgfsys@invoke{ }{{}{}{{ {}{}}}{ {}{}} {{}{{}}}{{}{}}{}{{}{}}{}{}{}{}{} { }{{{{}}\pgfsys@beginscope\pgfsys@invoke{ }\pgfsys@transformcm{0.8}{0.0}{0.0}{0.8}{13.44586pt}{-15.59279pt}\pgfsys@invoke{ }\hbox{{\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\hbox{{$ \alpha $}} }}\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} {{}}{{}}\hbox{\hbox{{\pgfsys@beginscope\pgfsys@invoke{ }{{}{}{{ {}{}}}{ {}{}} {{}{{}}}{{}{}}{}{{}{}}{}{}{}{}{} { }{{{{}}\pgfsys@beginscope\pgfsys@invoke{ }\pgfsys@transformcm{0.8}{0.0}{0.0}{0.8}{-1.19547pt}{-10.53569pt}\pgfsys@invoke{ }\hbox{{\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\hbox{{$ \beta $}} }}\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} {{}}{{}}\hbox{\hbox{{\pgfsys@beginscope\pgfsys@invoke{ }{{}{}{{ {}{}}}{ {}{}} {{}{{}}}{{}{}}{}{{}{}}{}{}{}{}{} { }{{{{}}\pgfsys@beginscope\pgfsys@invoke{ }\pgfsys@transformcm{0.7}{0.0}{0.0}{0.7}{9.92477pt}{-5.09422pt}\pgfsys@invoke{ }\hbox{{\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\hbox{{$ \gamma $}} }}\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} } \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope{}{}{}\hss}\pgfsys@discardpath\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope\hss}}\lxSVG@closescope\endpgfpicture}}$ . By Theorem 2.6 and Example 2.4 (a), we have

[TABLE] 2. (b)

Let $T=\leavevmode\hbox to31.54pt{\vbox to22.11pt{\pgfpicture\makeatletter\hbox{\hskip 5.19658pt\lower-21.72707pt\hbox to0.0pt{\pgfsys@beginscope\pgfsys@invoke{ }\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\pgfsys@setlinewidth{0.4pt}\pgfsys@invoke{ }\nullfont\hbox to0.0pt{\pgfsys@beginscope\pgfsys@invoke{ }{{}}\pgfsys@setlinewidth{0.775pt}\pgfsys@invoke{ }{ {}{{}}{} {{}{}}{} {{}{}}{}{}{{}}{} {{}{}}{}{}\pgfsys@moveto{0.0pt}{0.0pt}\pgfsys@lineto{10.66978pt}{-10.66978pt}\pgfsys@lineto{21.33957pt}{0.0pt}\pgfsys@moveto{10.66978pt}{-10.66978pt}\pgfsys@lineto{10.66978pt}{-21.33957pt}\pgfsys@stroke\pgfsys@invoke{ } \pgfsys@beginscope\pgfsys@invoke{ }{{}} {}{{}}{} {{}{}}{} {{}{}}{}{}\pgfsys@moveto{0.0pt}{0.0pt}\pgfsys@lineto{2.66743pt}{-2.66743pt}\pgfsys@lineto{5.33488pt}{0.0pt}\pgfsys@stroke\pgfsys@invoke{ } \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke{ }{{}} {}{{}}{} {{}{}}{} {{}{}}{}{}\pgfsys@moveto{16.00467pt}{0.0pt}\pgfsys@lineto{18.67212pt}{-2.66743pt}\pgfsys@lineto{21.33957pt}{0.0pt}\pgfsys@stroke\pgfsys@invoke{ } \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope {{}}{{}}\hbox{\hbox{{\pgfsys@beginscope\pgfsys@invoke{ }{{}{}{{ {}{}}}{ {}{}} {{}{{}}}{{}{}}{}{{}{}}{}{}{}{}{} { }{{{{}}\pgfsys@beginscope\pgfsys@invoke{ }\pgfsys@transformcm{0.8}{0.0}{0.0}{0.8}{-4.39658pt}{-7.33488pt}\pgfsys@invoke{ }\hbox{{\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\hbox{{$ \beta $}} }}\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} {{}}{{}}\hbox{\hbox{{\pgfsys@beginscope\pgfsys@invoke{ }{{}{}{{ {}{}}}{ {}{}} {{}{{}}}{{}{}}{}{{}{}}{}{}{}{}{} { }{{{{}}\pgfsys@beginscope\pgfsys@invoke{ }\pgfsys@transformcm{0.8}{0.0}{0.0}{0.8}{21.40273pt}{-6.27933pt}\pgfsys@invoke{ }\hbox{{\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\hbox{{$ \gamma $}} }}\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} {{}}{{}}\hbox{\hbox{{\pgfsys@beginscope\pgfsys@invoke{ }{{}{}{{ {}{}}}{ {}{}} {{}{{}}}{{}{}}{}{{}{}}{}{}{}{}{} { }{{{{}}\pgfsys@beginscope\pgfsys@invoke{ }\pgfsys@transformcm{0.8}{0.0}{0.0}{0.8}{13.44586pt}{-13.45903pt}\pgfsys@invoke{ }\hbox{{\definecolor{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@rgb@stroke{0}{0}{0}\pgfsys@invoke{ }\pgfsys@color@rgb@fill{0}{0}{0}\pgfsys@invoke{ }\hbox{{$ \alpha $}} }}\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope}}} } \pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope{}{}{}\hss}\pgfsys@discardpath\pgfsys@invoke{\lxSVG@closescope }\pgfsys@endscope\hss}}\lxSVG@closescope\endpgfpicture}}$ . It follows from Theorem 2.6 and Example 2.4 (b) that

[TABLE]

Observe that the results in (a) and (b) are consistent with the corresponding ones in Example 2.2.

As a direct consequence of Theorem 2.6, we may give another proof of the following result, which was obtained in [14, Sec. 4.3] and [33, Sec. 6.3.5].

Corollary 2.8.

For each $n\geqslant 0$ ,

[TABLE]

Proof.

Let $T\in Y_{n}(\Omega)$ . Denote by $\text{\rm Int}(T)$ the set of interior vertices of $T$ . Then $|\text{\rm Int}(T)|=n$ . For an admissible cut $c$ in $\text{\rm Adm}_{*}(T)$ , write

[TABLE]

Here we use the convention that $P^{c}(T)=|$ when $k=0$ . By [14, Sec. 4.3], the number of interior vertices of each summand in $T_{1}\ast\cdots\ast T_{k}$ is $\sum_{i=1}^{k}|\text{\rm Int}(T_{i})|$ . So by Theorem 2.6, the number of interior vertices of each summand in $\Delta_{LR(\Omega)}(T)$ is

[TABLE]

whence

[TABLE]

as required. ∎

Remark 2.9.

By Theorem 2.6, the fact that $H_{LR}(\Omega)$ is a connected graded bialgebra is obvious.

2.3. Subcoalgebras of coalgebra of decorated planar binary trees

In this subsection, we only consider the aforementioned coalgebraic structure on decorated planar binary trees, and show that $H_{LR}(\Omega)$ is a strictly graded coalgebra.

Let $C$ be a coalgebra. If there exists a family of ${\bf k}$ -submodules $\{C^{(n)}\mid n\geqslant 0\}$ of $C$ such that

(a)

$C=\bigoplus_{n\geqslant 0}C^{(n)}$ ; 2. (b)

$\varepsilon(C^{(n)})=0$ , $n\neq 0$ ; and 3. (c)

$\Delta(C^{(n)})\subseteq\bigoplus_{p+q=n}C^{(p)}\otimes C^{(q)},n\geqslant 0$ ,

then $C$ is called a graded coalgebra. If in particular,

[TABLE]

then $C$ is said to be a strictly graded coalgebra [11, Chap. 4.1], where $P(C)$ is the set of primitive elements of $C$ .

Definition 2.10.

[11, Chap. 3.1] Let $C$ be a coalgebra.

(a)

A subcoalgebra $M$ of $C$ is called a simple subcoalgebra if it does not have any subcoalgebras other than [math] and $M$ . 2. (b)

$C$ is called irreducible if $C$ has only one simple subcoalgebra. 3. (c)

$C$ is called pointed if all simple subcoalgebras of $C$ are one dimensional.

Lemma 2.11.

[11, Chap. 4.1]** A strictly graded coalgebra is a pointed irreducible coalgebra.

Narrowing our attention to the coalgebraic structure of $H_{LR}(\Omega)$ , we obtain

Theorem 2.12.

The coalgebra $(H_{LR}(\Omega),\Delta_{LR(\Omega)},\varepsilon_{LR(\Omega)})$ is a strictly graded coalgebra with the grading $H_{LR}(\Omega)=\oplus_{n\geqslant 0}{\bf k}Y_{n}(\Omega)$ and hence has only one simple subcoalgebra ${\bf k}\{|\}$ .

Proof.

By Lemma 2.3, $H_{LR}(\Omega)=\oplus_{n\geqslant 0}{\bf k}Y_{n}(\Omega)$ is a graded coalgebra. Since $Y_{0}(\Omega)=Y_{0}=\{|\}$ , we have $\mathbf{k}Y_{0}(\Omega)=\mathbf{k}$ . Furthermore,

[TABLE]

is the set of primitive elements of $H_{LR}(\Omega)$ by Theorem 2.6. Thus $H_{LR}(\Omega)$ is a strictly graded coalgebra. By Lemma 2.11, $H_{LR}(\Omega)$ has only one simple subcoalgebra. Then the result follows from that $\mathbf{k}Y_{0}(\Omega)={\bf k}\{|\}$ is a simple subcoalgebra of $H_{LR}(\Omega)$ . ∎

Remark 2.13.

Summing up, the coradical of the Hopf algebra $H_{LR}(\Omega)$ (that is to say the sum of all its simple coalgebra) is $\mathbf{k}\{|\}$ .

3. Free cocycle $\vee_{\Omega}$ -Hopf algebras of decorated planar binary trees

In this section, based on the binary grafting operations $\vee_{\alpha}$ on $H_{LR}(\Omega)$ with $\alpha\in\Omega$ , we introduce the concept of a $\vee$ -algebra and more generally a $\vee_{\Omega}$ -algebra, leading to the emergence of $\vee_{\Omega}$ -bialgebras and $\vee_{\Omega}$ -Hopf algebras. Further when a $\vee$ -cocycle condition is involved, cocycle $\vee_{\Omega}$ -bialgebras and cocycle $\vee_{\Omega}$ -Hopf algebras are also introduced. We finally show that $H_{LR}(\Omega)$ is a free cocycle $\vee_{\Omega}$ -Hopf algebra.

3.1. Free $\vee_{\Omega}$ -algebras of decorated planar binary trees

In this subsection, we equip the space $H_{LR}(\Omega)$ of planar binary trees decorated by a nonempty set $\Omega$ with a free $\vee_{\Omega}$ -algebra structure. Let us first recall the concept of operated algebras.

Definition 3.1.

[19, Sec. 1.2]

(a)

An **operated algebra ** is an algebra $A$ together with a (linear) operator $P:A\to A$ . 2. (b)

An $\Omega$ **-operated algebra ** is an algebra $A$ together with a set of (linear) operators $P_{\alpha}:A\to A$ , $\alpha\in\Omega$ .

Motivated by the above definition and Eq. (1), we introduce $\vee$ -algebras.

Definition 3.2.

(a)

A $\vee$ -algebra is an algebra $(A,\ast_{A},1)$ together with a binary operation $\vee:A\otimes A\to A$ such that, for $a=a_{1}\vee a_{2}$ and $a^{\prime}=a_{1}^{\prime}\vee a_{2}^{\prime}$ in $A$ ,

[TABLE]

More generally, let $\Omega$ be a nonempty set.

(b)

A $\vee_{\Omega}$ -algebra is an algebra $(A,\ast_{A},1_{A})$ equipped with a set of binary operations

[TABLE]

such that

[TABLE]

where $a=a_{1}\vee_{\alpha}a_{2}$ and $a^{\prime}=a_{1}^{\prime}\vee_{\alpha^{\prime}}a_{2}^{\prime}$ in $A$ with $\alpha,\alpha^{\prime}\in\Omega$ . We denote such a $\vee_{\Omega}$ -algebra by $(A,\ast_{A},1_{A},\vee_{\Omega})$ . 2. (c)

Let $(A,\ast_{A},1_{A},\vee_{\Omega})$ and $(A^{\prime},\ast_{A^{\prime}},1_{A^{\prime}},\vee^{\prime}_{\Omega})$ be two $\vee_{\Omega}$ -algebras. A linear map $\phi:A\rightarrow A^{\prime}$ is called a $\vee_{\Omega}$ -algebra morphism if $\phi$ is an algebra homomorphism such that $\phi\circ\vee_{\alpha}=\vee^{\prime}_{\alpha}\circ(\phi\otimes\phi)$ for each $\alpha\in\Omega$ . 3. (d)

A free $\vee_{\Omega}$ -algebra on a set $X$ is a $\vee_{\Omega}$ -algebra $(A,\ast_{A},1_{A},\vee_{\Omega})$ together with a set map $j:X\rightarrow A$ with the property that, for any $(A^{\prime},\ast_{A^{\prime}},1_{A^{\prime}},\vee^{\prime}_{\Omega})$ and a set map $\phi:X\rightarrow A^{\prime}$ , there exists a unique $\vee_{\Omega}$ -algebra morphism $\overline{\phi}:A\rightarrow A^{\prime}$ such that $\overline{\phi}\circ j=\phi$ .

Remark 3.3.

Let us emphasize that $\vee$ -algebras are different from operated algebras: the $\vee$ -algebra is an algebra equipped with a binary operation satisfying Eq. (6); but the operated algebra is an algebra equipped with a unary operation.

Example 3.4.

It follows from Eq. (1) that $(H_{LR}(\Omega),\ast,|,\vee_{\Omega})$ is a $\vee_{\Omega}$ -algebra. Indeed, it is a free $\vee_{\Omega}$ -algebra with a universal property (see Theorem 3.5 below).

The significant role of the binary grafting $\vee_{\Omega}$ is clarified by the following universal property.

Theorem 3.5.

The quadruple $(H_{LR}(\Omega),\ast,|,\vee_{\Omega})$ is the free $\vee_{\Omega}$ -algebra on the empty set, that is, the initial object in the category of $\vee_{\Omega}$ -algebras. More precisely, for any $\vee_{\Omega}$ -algebra $A=(A,\ast_{A},1_{A},\vee_{A,\Omega})$ , there exists a unique $\vee_{\Omega}$ -algebra morphism $\overline{\phi}:H_{LR}(\Omega)\rightarrow A$ .

Proof.

(Uniqueness). Suppose that $\overline{\phi}:H_{LR}(\Omega)\rightarrow A$ is a $\vee_{\Omega}$ -algebra morphism. We prove the uniqueness of $\overline{\phi}(T)$ for basis elements $T\in Y_{\infty}(\Omega)$ by induction on $\mathrm{dep}(T)\geqslant 0$ . For the initial step of $\mathrm{dep}(T)=0$ , we have $T=|$ and $\overline{\phi}(T)=\overline{\phi}(|)=1_{A}$ . For the induction step of $\mathrm{dep}(T)\geqslant 1$ , we may write $T=T_{1}\vee_{\alpha}T_{2}$ for some $\alpha\in\Omega$ and then

[TABLE]

Here $\overline{\phi}(T_{1})$ and $\overline{\phi}(T_{2})$ are determined uniquely by the induction hypothesis and so $\overline{\phi}(T)$ is unique.

(Existence). Define a linear map ${\overline{\phi}}:H_{LR}(\Omega)\rightarrow A$ recursively on depth $\mathrm{dep}(T)$ for $T\in Y_{\infty}(\Omega)$ by assigning

[TABLE]

where $T=T_{1}\vee_{\alpha}T_{2}$ for some $T_{1},T_{2}\in Y_{\infty}(\Omega)$ and $\alpha\in\Omega$ . Then for any $T_{1},T_{2}\in Y_{\infty}(\Omega)$ , we have

[TABLE]

and so

[TABLE]

We are left to check that

[TABLE]

We proceed to prove Eq. (8) by induction on the sum of depths $\mathrm{dep}(T)+\mathrm{dep}(T^{\prime})\geqslant 0$ . For the initial step of $\mathrm{dep}(T)+\mathrm{dep}(T^{\prime})=0$ , we have $T=T^{\prime}=|$ and

[TABLE]

For the induction step of $\mathrm{dep}(T)+\mathrm{dep}(T^{\prime})\geqslant 1$ , if $\mathrm{dep}(T)=0$ or $\mathrm{dep}(T^{\prime})=0$ , without loss of generality, letting $\mathrm{dep}(T)=0$ , then $T=|$ and

[TABLE]

So we may assume that $\mathrm{dep}(T),\mathrm{dep}(T^{\prime})\geqslant 1$ and write

[TABLE]

Hence

[TABLE]

as required. This completes the proof. ∎

3.2. Free cocycle $\vee_{\Omega}$ -Hopf algebras of decorated planar binary trees

In this subsection, we prove that $H_{LR}(\Omega)$ is the free cocycle $\vee_{\Omega}$ -Hopf algebra on the empty set. Let us first pose the following concepts which are motivated from the binary grafting operations $\{\vee_{\alpha}\mid\alpha\in\Omega\}$ characterized in Eq. (1) and the coproduct $\Delta_{LR(\Omega)}$ given in Eq. (3).

Definition 3.6.

(a)

A $\vee_{\Omega}$ -bialgebra (resp. $\vee_{\Omega}$ -Hopf algebra) is a bialgebra (resp. Hopf algebra) $(H,\ast_{H},1_{H},\Delta_{H},\varepsilon_{H})$ which is also a $\vee_{\Omega}$ -algebra $(H,\ast_{H},1_{H},\vee_{\Omega})$ . 2. (b)

Let $(H,\,\vee_{\Omega})$ and $(H^{\prime},\,\vee^{\prime}_{\Omega})$ be two $\vee_{\Omega}$ -bialgebras (resp. $\vee_{\Omega}$ -Hopf algebras). A linear map $\phi:H\rightarrow H^{\prime}$ is called a $\vee_{\Omega}$ -bialgebra morphism (resp. $\vee_{\Omega}$ -Hopf algebra morphism) if $\phi$ is a bialgebra (resp. Hopf algebra) morphism such that ${\phi}\circ\vee_{\alpha}=\vee^{\prime}_{\alpha}\circ({\phi}\otimes{\phi})$ for $\alpha\in\Omega$ .

Involved with an analogy of the Hochschild 1-cocycle condition [15], we pose

Definition 3.7.

(a)

An $\Omega$ -cocycle $\vee_{\Omega}$ -bialgebra or simply a cocycle $\vee_{\Omega}$ -bialgebra is a $\vee_{\Omega}$ -bialgebra $(H,\ast_{H},1_{H},\Delta_{H},\varepsilon_{H},\vee_{\Omega})$ satisfying the following $\vee$ -cocycle condition: for any $\alpha\in\Omega$ and $h,h^{\prime}\in H,$

[TABLE]

where $(\ast_{H},\vee_{\alpha}):=(\ast_{H}\otimes\vee_{H})\circ{\tau_{23}}$ and $\tau_{23}$ is the permutation of the second and third tensor factor. If the bialgebra in a cocycle $\vee_{\Omega}$ -bialgebra is a Hopf algebra, then it is called a cocycle $\vee_{\Omega}$ -Hopf algebra. 2. (b)

A free cocycle $\vee_{\Omega}$ -bialgebra on a set $X$ is a cocycle $\vee_{\Omega}$ -bialgebra $(H,\ast_{H},1_{H},\Delta_{H},\varepsilon_{H},\vee_{\Omega})$ together with a set map $j:X\rightarrow H$ with the property that, for any cocycle $\vee_{\Omega}$ -bialgebra $(H^{\prime},\ast_{H^{\prime}},1_{H^{\prime}},\Delta_{H^{\prime}},\varepsilon_{H^{\prime}},\vee^{\prime}_{\Omega})$ and any set map $\phi:X\rightarrow H^{\prime}$ , there exists a unique $\vee_{\Omega}$ -bialgebra morphism $\overline{\phi}:H\rightarrow H^{\prime}$ such that $\overline{\phi}\circ j=\phi$ . The concept of a free cocycle $\vee_{\Omega}$ -Hopf algebra is defined in the same way.

When $\Omega$ is a singleton set, the subscript $\Omega$ in Definitions 3.2 and 3.7 will be suppressed for simplicity.

The following result gives a family of coideals of a cocycle $\vee_{\Omega}$ -bialgebra. Recall that a submodule $I$ in a coalgebra $(C,\Delta,\varepsilon)$ is called a coideal if $I\subseteq\ker\varepsilon$ and $\Delta(I)\subseteq I\otimes C+C\otimes I$ . A biideal of a bialgebra $A$ is a submodule of $A$ which is both an ideal and a coideal of $A$ .

Proposition 3.8.

Let $(H,\ast_{H},1_{H},\Delta_{H},\varepsilon_{H},\vee_{\Omega})$ be a cocycle $\vee_{\Omega}$ -bialgebra and $C$ a coideal of $H$ . Then, we have the following.

(a)

$H\vee_{\alpha}H:=\{h_{1}\vee_{\alpha}h_{2}\mid h_{1},h_{2}\in H\}$ * is a coideal of $H$ for each $\alpha\in\Omega$ .* 2. (b)

The ideal generated by $C$ is a biideal.

Proof.

(a) Let $\alpha\in\Omega$ . We first show $H\vee_{\alpha}H\subseteq\ker\varepsilon_{H}$ . Let

[TABLE]

Using Sweedler notation, we can write

[TABLE]

Then

[TABLE]

which implies

[TABLE]

We next show

[TABLE]

Indeed, for any $h_{1}\vee_{\alpha}h_{2}\in H\vee_{\alpha}H$ ,

[TABLE]

Thus $H\vee_{\alpha}H$ is a coideal.

(b) Suppose that $I$ is the ideal generated by $C$ . Then we can write $I=H\ast_{H}C\ast_{H}H$ and so

[TABLE]

Thus $I$ is a biideal of $H$ . ∎

As a consequence of Proposition 3.8 (a), we obtain a family of coideals of $H_{LR}(\Omega)$ .

Corollary 3.9.

The $H_{LR}(\Omega)\vee_{\alpha}H_{LR}(\Omega)$ is a coideal of $H_{LR}(\Omega)$ for each $\alpha\in\Omega$ .

Proof.

It follows from Proposition 3.8 (a). ∎

Now we are ready for our main result of this section.

Theorem 3.10.

Let $\Omega$ be a nonempty set.

(a)

The sextuple $(H_{LR}(\Omega),\ast,|,\Delta_{LR(\Omega)},\varepsilon_{LR(\Omega)},\vee_{\Omega})$ is the free cocycle $\vee_{\Omega}$ -bialgebra on the empty set, that is, the initial object in the category of cocycle $\vee_{\Omega}$ -bialgebras. 2. (b)

The sextuple $(H_{LR}(\Omega),\ast,|,\Delta_{LR(\Omega)},\varepsilon_{LR(\Omega)},\vee_{\Omega})$ is the free cocycle $\vee_{\Omega}$ -Hopf algebra on the empty set, , that is, the initial object in the category of cocycle $\vee_{\Omega}$ -Hopf algebras.

Proof.

(a) It follows from Lemma 2.3 that $(H_{LR}(\Omega),\ast,|,\Delta_{LR(\Omega)},\varepsilon_{LR(\Omega)})$ is a bialgebra. Furthermore, the $(H_{LR}(\Omega),\ast,|,\Delta_{LR(\Omega)},\varepsilon_{LR(\Omega)},\vee_{\Omega})$ is a $\vee_{\Omega}$ -bialgebra by Eq. (1) and a cocycle $\vee_{\Omega}$ -bialgebra by Eq. (3).

We are left to show the freeness of $H_{LR}(\Omega)$ . For this, let $(H,\ast_{H},1_{H},\Delta_{H},\varepsilon_{H},\vee^{\prime}_{\Omega})$ be an arbitrary cocycle $\vee_{\Omega}$ -bialgebra. In particular, $(H,\ast_{H},1_{H},\vee^{\prime}_{\Omega})$ is a $\vee_{\Omega}$ -algebra. So by Theorem 3.5, there exists a unique algebra homomorphism $\overline{\phi}:H_{LR}(\Omega)\rightarrow H$ such that

[TABLE]

It remains to check the following two points:

[TABLE]

We prove Eq. (11) by induction on $\mathrm{dep}(T)\geqslant 0$ . For the initial step of $\mathrm{dep}(T)=0$ , we have $T=|$ and

[TABLE]

For the induction step of $\mathrm{dep}(T)\geqslant 1$ , we may write $T=T_{1}\vee_{\alpha}T_{2}$ for some $T_{1},T_{2}\in Y_{\infty}(\Omega)$ and $\alpha\in\Omega$ . Using the Sweedler notaion,

[TABLE]

Then

[TABLE]

We next prove the Eq. (12). If $T=|$ , then

[TABLE]

If $T\neq|$ , then $T$ can be written as $T=T_{1}\vee_{\alpha}T_{2}$ for some $T_{1},T_{2}\in Y_{\infty}(\Omega)$ and $\alpha\in\Omega$ . By Eq. (10),

[TABLE]

where the second last step employs Proposition 3.8 (a). This completes the proof of Item (a).

(b) By Lemma 2.3, $(H_{LR}(\Omega),\ast,|,\Delta_{LR(\Omega)},\varepsilon_{LR(\Omega)})$ is a Hopf algebra. It is further a $\vee_{\Omega}$ -Hopf algebra by Eq. (1) and a cocycle $\vee_{\Omega}$ -Hopf algebra by Eq. (3). Then Item (b) follows from Item (a) and the well-known fact that any bialgebra morphism between two Hopf algebras is compatible with the antipodes [37, Lem. 4.04]. ∎

Taking $\Omega$ to be a singleton set in Theorem 3.10, all planar binary trees in $H_{LR}(\Omega)$ are decorated by the same letter. In other words, planar binary trees in $H_{LR}(\Omega)$ have no decorations in this case and that are precisely the planar binary trees in the classical Loday-Ronco Hopf algebra $H_{LR}$ . So

Corollary 3.11.

(a)

The classical Loday-Ronco Hopf algebra $H_{LR}$ is the free cocycle $\vee$ -bialgebra on the empty set, that is, the initial object in the category of cocycle $\vee$ -bialgebras. 2. (b)

The classical Loday-Ronco Hopf algebra $H_{LR}$ is the free cocycle $\vee$ -Hopf algebra on the empty set, that is, the initial object in the category of cocycle $\vee$ -Hopf algebras.

Proof.

It follows from Theorem 3.10 by taking $\Omega$ to be a singleton set. ∎

Acknowledgments: This work was supported by the National Natural Science Foundation of China (Grant No. 11771191 and 11501267), Fundamental Research Funds for the Central Universities (Grant No. lzujbky-2017-162), the Natural Science Foundation of Gansu Province (Grant No. 17JR5RA175).

We thank Prof. Foissy for helpful discussion and Proposition 3.8 is inspired by the email communication with him.

Bibliography38

The reference list from the paper itself. Each links out to its DOI / PubMed record.

1[1] M. Aguiar and F. Sottile, Structure of the Loday-Ronco Hopf algebra of trees, J. Algebra 295 (2006), 473-511.
2[2] L. A. Bokut, Y. Chen and J. Qiu, Gröbner-Shirshov bases for associative algebras with multiple operators and free Rota-Baxter algebras, J. Pure Appl. Algebra 214 (2010) 89-110.
3[3] C. Brouder and A. Frabetti, QED Hopf algebras on planar binary trees, J. Algebra 267 (2003), 298-322.
4[4] C. Brouder, A. Frabetti and F. Menous , Combinatorial Hopf algebras from renormalization, J. Algebraic Combin. 32 (2010), 557-578.
5[5] F. Chapoton, A Hopf operad of forests of binary trees and related finite-dimensional algebras, J. Algebraic Combin. 20 (2004), 311-330.
6[6] F. Chapoton, Operads and algebraic combinatorics of trees, S e ´ ´ 𝑒 \acute{e} m. Lothar. Combin. 58 (2008).
7[7] F. Chapoton and A. Frabetti, From quantum electrodynamics to posets of planar binary trees, Combinatorics and physics, 53-66, Contemp. Math. , 539 , Amer. Math. Soc., Providence, RI, 2011.
8[8] F. Chapoton and M. Livernet, Pre-Lie algebras and the rooted trees operad, Intern. Math. Research Notices 8 (2001), 395-408.

TL;DR

Contribution

Findings

Abstract

Peer Reviews

Videos

Hopf algebras of planar binary trees: An operated algebra approach

Abstract.

Key words and phrases:

2010 Mathematics Subject Classification:

Contents

1. Introduction

2. Hopf algebras of decorated planar binary trees

2.1. Hopf algebras of decorated planar binary trees

Example 2.1**.**

Example 2.2**.**

Lemma 2.3**.**

2.2. A combinatorial description of ΔLR(Ω)\Delta_{LR(\Omega)}ΔLR(Ω)​

Example 2.4**.**

Remark 2.5**.**

Theorem 2.6**.**

Proof.

Example 2.7**.**

Corollary 2.8**.**

Proof.

Remark 2.9**.**

2.3. Subcoalgebras of coalgebra of decorated planar binary trees

Definition 2.10**.**

Lemma 2.11**.**

Theorem 2.12**.**

Proof.

Remark 2.13**.**

3. Free cocycle ∨Ω\vee_{\Omega}∨Ω​-Hopf algebras of decorated planar binary trees

3.1. Free ∨Ω\vee_{\Omega}∨Ω​-algebras of decorated planar binary trees

Definition 3.1**.**

Definition 3.2**.**

Remark 3.3**.**

Example 3.4**.**

Theorem 3.5**.**

Proof.

3.2. Free cocycle ∨Ω\vee_{\Omega}∨Ω​-Hopf algebras of decorated planar binary trees

Definition 3.6**.**

Definition 3.7**.**

Proposition 3.8**.**

Proof.

Corollary 3.9**.**

Proof.

Theorem 3.10**.**

Proof.

Corollary 3.11**.**

Proof.

Example 2.1.

Example 2.2.

Lemma 2.3.

2.2. A combinatorial description of $\Delta_{LR(\Omega)}$

Example 2.4.

Remark 2.5.

Theorem 2.6.

Example 2.7.

Corollary 2.8.

Remark 2.9.

Definition 2.10.

Lemma 2.11.

Theorem 2.12.

Remark 2.13.

3. Free cocycle $\vee_{\Omega}$ -Hopf algebras of decorated planar binary trees

3.1. Free $\vee_{\Omega}$ -algebras of decorated planar binary trees

Definition 3.1.

Definition 3.2.

Remark 3.3.

Example 3.4.

Theorem 3.5.

3.2. Free cocycle $\vee_{\Omega}$ -Hopf algebras of decorated planar binary trees

Definition 3.6.

Definition 3.7.

Proposition 3.8.

Corollary 3.9.

Theorem 3.10.

Corollary 3.11.