Moerdijk Hopf Algebra

• Moerdijk Hopf Algebra is a decorated planar rooted forest structure defined by symmetric Hochschild 1-cocycle identities and a noncommutative concatenation product.
• Its recursive grafting operators and induced-subforest coproduct offer a systematic method for analyzing the combinatorial and algebraic properties of trees.
• The specialization at λ=0 yields a connected, graded, cocommutative Hopf algebra that distinctly contrasts with Connes–Kreimer and Grossman–Larson constructions.

The Moerdijk Hopf algebra is a rooted-tree Hopf algebra governed by a symmetric Hochschild $1$-cocycle condition for grafting. In the formulation developed for decorated planar rooted forests, the underlying objects are planar rooted forests whose internal vertices are decorated by $\Omega$ and whose leaves are decorated by $X\sqcup \Omega$; the product is noncommutative concatenation, and the coproduct is determined recursively by grafting operators $B^+_\omega$. For $\lambda=0$, this construction yields a connected, graded, cocommutative Hopf algebra, recovering the classical Moerdijk algebra in the undecorated planar case and extending it to a free $\Omega$-cocycle Hopf algebra framework (Foissy et al., 26 Aug 2025).

1. Position within rooted-tree Hopf algebras

Rooted-tree Hopf algebras encode recursive and combinatorial structures of trees and forests and play central roles in renormalization, numerical analysis through Butcher’s $B$-series, operads, and pre-Lie algebras. Within this landscape, the Moerdijk Hopf algebra is one of several classical families, alongside the Connes–Kreimer and Grossman–Larson constructions (Foissy et al., 26 Aug 2025).

Algebra	Forest type and product	Coalgebra/cocycle profile
Connes–Kreimer	non-planar; commutative concatenation	admissible cuts; asymmetric $1$-cocycle
Grossman–Larson	rooted trees; grafting-type product	noncommutative and cocommutative
Moerdijk	planar forests; noncommutative concatenation	symmetric $1$-cocycle

The decisive distinction is the cocycle identity. In Connes–Kreimer, the grafting operator satisfies the asymmetric condition

$$\Delta B^+=B^+\otimes 1+(\mathrm{id}\otimes B^+)\Delta.$$

By contrast, the Moerdijk-type construction uses the symmetric identity

$\Omega$0

which is specialized in the decorated planar setting to each grafting operator $\Omega$1 (Foissy et al., 26 Aug 2025).

A common conflation is to treat the Moerdijk algebra as merely a planar variant of Connes–Kreimer. The comparison given in the literature is sharper: the Moerdijk construction differs simultaneously in planarity, in the noncommutativity of the concatenation product, and in the replacement of the asymmetric Hochschild $\Omega$2-cocycle by a symmetric one (Foissy et al., 26 Aug 2025). A related but distinct line of work, associated with Moerdijk’s universal characterization of rooted-tree Hopf algebras via cocycle operators, was developed systematically for decorated forests and cocycle Hopf algebras by Gao, Guo, and Zhang (Gao et al., 2016).

2. Decorated planar rooted forests and the underlying algebra

Fix disjoint sets $\Omega$3 and $\Omega$4. A planar rooted tree is a rooted tree with a fixed planar embedding. The set of decorated planar rooted trees, denoted $\Omega$5, consists of trees whose internal vertices are decorated by $\Omega$6 and whose leaves are decorated by $\Omega$7. Forests are words of trees in the free monoid

$\Omega$8

with unit $\Omega$9; the breadth $X\sqcup \Omega$0 is the number of trees in the forest $X\sqcup \Omega$1 (Foissy et al., 26 Aug 2025).

The underlying vector space is the free $X\sqcup \Omega$2-module

$X\sqcup \Omega$3

graded by the number of vertices: $X\sqcup \Omega$4 This grading is the weight grading and is fundamental for the Hopf-theoretic consequences at $X\sqcup \Omega$5 (Foissy et al., 26 Aug 2025).

The multiplication $X\sqcup \Omega$6 is the noncommutative concatenation of planar forests, written by juxtaposition: $X\sqcup \Omega$7 Its unit is the empty forest $X\sqcup \Omega$8. The noncommutativity is not incidental: it reflects the left-to-right order inherent in planar forests and separates the Moerdijk framework from commutative rooted-tree Hopf algebras (Foissy et al., 26 Aug 2025).

For each $X\sqcup \Omega$9, the grafting operator

$B^+_\omega$0

grafts all trees of a forest onto a new root decorated by $B^+_\omega$1, with

$B^+_\omega$2

These operators make $B^+_\omega$3 into an $B^+_\omega$4-operated algebra, free on $B^+_\omega$5 (Foissy et al., 26 Aug 2025).

The counit is

$B^+_\omega$6

This is the standard rooted-forest counit, but in the present setting it is paired with a coproduct adapted to the symmetric cocycle identity rather than the Connes–Kreimer cut coproduct (Foissy et al., 26 Aug 2025).

3. Symmetric cocycle coproduct and its combinatorics

For a fixed $B^+_\omega$7, the coproduct $B^+_\omega$8 is defined recursively by depth and breadth. On depth $B^+_\omega$9, namely forests of leaves in $\lambda=0$0,

$\lambda=0$1

On breadth $\lambda=0$2, the defining rule is the symmetric cocycle identity

$\lambda=0$3

On breadth at least $\lambda=0$4, the coproduct is multiplicative: $\lambda=0$5 These rules endow $\lambda=0$6 with a coalgebra structure, and $\lambda=0$7 is an algebra morphism, so the full structure is a bialgebra (Foissy et al., 26 Aug 2025).

The same coproduct admits a combinatorial description in terms of induced subforests. For a decorated planar forest $\lambda=0$8 with vertex set $\lambda=0$9, and a subset $\Omega$0, the induced subforest $\Omega$1 is formed by retaining the vertices in $\Omega$2, connecting each retained vertex to its nearest ancestor in $\Omega$3, and arranging the resulting components in the natural planar order. Then

$\Omega$4

where $\Omega$5 is the set of vertices decorated by elements of $\Omega$6 (Foissy et al., 26 Aug 2025).

In the Moerdijk case $\Omega$7, this simplifies to

$\Omega$8

The paper describes this as a planar admissible-cuts formula: one chooses any subset of vertices and splits the forest into the induced subforest and its complement, while retaining the planar order and the decoration data (Foissy et al., 26 Aug 2025).

Small examples illustrate the rule. For a single-node tree $\Omega$9 with $B$0,

$B$1

For a two-root forest $B$2 with $B$3,

$B$4

The recursive and induced-subforest formulations are equivalent, and the latter makes the dependence on planarity and leaf-overlap weighting explicit (Foissy et al., 26 Aug 2025).

4. Hopf structure, antipode, and the role of $B$5

For $B$6, the bialgebra is connected, graded, and cocommutative, hence a Hopf algebra. This is the Moerdijk Hopf algebra of decorated planar rooted forests in the sense established in the 2025 construction (Foissy et al., 26 Aug 2025).

Its antipode has an explicit inclusion–exclusion formula. For $B$7,

$B$8

where the sum runs over all partitions of the vertex set into disjoint subsets, and the corresponding induced subforests are multiplied in planar order. The proof proceeds through the reduced coproduct $B$9 and Takeuchi’s antipode formula. Computationally, one enumerates all set partitions of $1$0, forms the induced subforests, multiplies them in the planar order, and sums with sign $1$1 (Foissy et al., 26 Aug 2025).

The parameter $1$2 controls a deformation of the leaf behavior. The term

$1$3

in $1$4 permits overlaps only on vertices decorated by $1$5, as reflected in the condition $1$6 in the combinatorial formula. In the decorated setting this has a structural consequence: when $1$7, $1$8 breaks Hopfness because of the non-invertible group-like element $1$9 (Foissy et al., 26 Aug 2025).

This distinction is mathematically significant. It isolates the classical Moerdijk Hopf algebra as the $1$0 specialization while retaining, for general $1$1, a broader bialgebraic family. The $1$2-deformation is therefore not merely a formal perturbation; it changes the existence of an antipode in the decorated case (Foissy et al., 26 Aug 2025).

5. Operated-algebra formulation and the symmetric cocycle principle

The grafting operators $1$3 place the construction in the framework of operated algebras. The symmetric Hochschild $1$4-cocycle condition for a coalgebra endomorphism $1$5 is

$1$6

Specializing $1$7 to $1$8 gives the defining identity for the Moerdijk-type coproduct (Foissy et al., 26 Aug 2025).

This leads to the notion of an $1$9-cocycle bialgebra: an $$\Delta B^+=B^+\otimes 1+(\mathrm{id}\otimes B^+)\Delta.$$0-operated bialgebra

$$\Delta B^+=B^+\otimes 1+(\mathrm{id}\otimes B^+)\Delta.$$1

satisfying

$$\Delta B^+=B^+\otimes 1+(\mathrm{id}\otimes B^+)\Delta.$$2

Each image $$\Delta B^+=B^+\otimes 1+(\mathrm{id}\otimes B^+)\Delta.$$3 is then a coideal. In this formulation, the Moerdijk Hopf algebra is not just a specific combinatorial object but the paradigmatic example of a symmetric cocycle Hopf algebra (Foissy et al., 26 Aug 2025).

The operated viewpoint also clarifies the relation to earlier cocycle theories. Gao–Guo–Zhang formalized cocycle bialgebras and cocycle Hopf algebras in the context of rooted forests equipped with grafting operators satisfying Hochschild $$\Delta B^+=B^+\otimes 1+(\mathrm{id}\otimes B^+)\Delta.$$4-cocycle identities, and used this to establish universal properties and to transport forest coalgebra structures to free Rota–Baxter algebras (Gao et al., 2016). The 2025 Moerdijk construction refines that general perspective by replacing the asymmetric cocycle pattern with the symmetric identity appropriate to Moerdijk’s class (Foissy et al., 26 Aug 2025).

One common misconception is that “cocycle Hopf algebra” automatically means the Connes–Kreimer-type identity. The two settings are parallel but distinct: Connes–Kreimer uses

$$\Delta B^+=B^+\otimes 1+(\mathrm{id}\otimes B^+)\Delta.$$5

whereas the Moerdijk construction uses the symmetric version with $$\Delta B^+=B^+\otimes 1+(\mathrm{id}\otimes B^+)\Delta.$$6 on both tensor legs. The difference affects the coproduct formula, the combinatorics of cuts, and the universal properties that the resulting Hopf algebra satisfies (Foissy et al., 26 Aug 2025).

6. Dual structures, matrix encoding, and universal properties

Because $$\Delta B^+=B^+\otimes 1+(\mathrm{id}\otimes B^+)\Delta.$$7 is homogeneous, it induces a dual product $$\Delta B^+=B^+\otimes 1+(\mathrm{id}\otimes B^+)\Delta.$$8 on $$\Delta B^+=B^+\otimes 1+(\mathrm{id}\otimes B^+)\Delta.$$9 through the pairing

$\Omega$00

To describe $\Omega$01, the construction introduces forest-representable matrices $\Omega$02. A planar forest $\Omega$03 with $\Omega$04 vertices is encoded by an $\Omega$05 matrix $\Omega$06: its $\Omega$07-th column records vertex decorations in the total order obtained by combining the “height” relation with the “right” relation, and its upper triangular part records the relation symbols $\Omega$08. This gives a bijection $\Omega$09 (Foissy et al., 26 Aug 2025).

The dual product is then expressed by a shuffle-composition formula: $\Omega$10 where $\Omega$11 and $\Omega$12. The examples in the paper show explicitly how shuffles and matrix-compatibility conditions enumerate the summands. For $\Omega$13, quasi-shuffles produce a deformed product $\Omega$14 (Foissy et al., 26 Aug 2025).

Planarity is essential here. The matrix encoding depends on a total order on vertices obtained from ancestor–descendant structure together with left–right position. This is a specifically planar feature; without it, the forest-representable matrix formalism would not take the same form. This suggests that the matrix description is not an auxiliary device but a structural expression of the noncommutative planar setting (Foissy et al., 26 Aug 2025).

The same paper establishes the universal properties of the construction. The quadruple

$\Omega$15

is the free $\Omega$16-operated monoid on $\Omega$17, and

$\Omega$18

is the free $\Omega$19-operated algebra on $\Omega$20. More strongly,

$\Omega$21

is the free $\Omega$22-cocycle bialgebra on $\Omega$23, and for $\Omega$24 it is the free $\Omega$25-cocycle Hopf algebra on $\Omega$26. Concretely, if

$\Omega$27

is any $\Omega$28-cocycle bialgebra and $\Omega$29 satisfies

$\Omega$30

then there is a unique $\Omega$31-operated bialgebra morphism $\Omega$32 sending $\Omega$33 and commuting with grafting (Foissy et al., 26 Aug 2025).

Taking $\Omega$34, one obtains the initial object in the category of $\Omega$35-cocycle bialgebras; when $\Omega$36 is a singleton, this recovers the classical Moerdijk Hopf algebra on planar rooted forests. The same universal framework yields functorial morphisms such as the leaf-scaling bialgebra morphism

$\Omega$37

between different $\Omega$38 (Foissy et al., 26 Aug 2025).

A further structural consequence appears at the level of operators. For any cocommutative Hopf algebra, the antipode is a Rota–Baxter operator of weight $\Omega$39 in the sense of Goncharov: a coalgebra homomorphism $\Omega$40 is Rota–Baxter if

$\Omega$41

Since the Moerdijk Hopf algebra at $\Omega$42 is cocommutative, its antipode satisfies this identity. The paper presents this as evidence of operator-theoretic structure intrinsic to the antipode and notes possible functional-analytic and geometric ramifications (Foissy et al., 26 Aug 2025).