Combinatorial Hopf algebras from renormalization
Christian Brouder (IMPMC), Alessandra Frabetti (ICJ), Frederic Menous

TL;DR
This paper explores the structure of three non-commutative Hopf algebras relevant to quantum field theory renormalization, providing new methods to define their associative products.
Contribution
It introduces the right-sided combinatorial Hopf structures of three specific non-commutative Hopf algebras in renormalization, with two novel approaches to defining their associative products.
Findings
Describes the non-commutative Faà di Bruno Hopf algebra
Details the non-commutative charge renormalization Hopf algebra on planar binary trees
Introduces recursive and grafting/shuffling methods for associative product definition
Abstract
In this paper we describe the right-sided combinatorial Hopf structure of three Hopf algebras appearing in the context of renormalization in quantum field theory: the non-commutative version of the Fa\`a di Bruno Hopf algebra, the non-commutative version of the charge renormalization Hopf algebra on planar binary trees for quantum electrodynamics, and the non-commutative version of the Pinter renormalization Hopf algebra on any bosonic field. We also describe two general ways to define the associative product in such Hopf algebras, the first one by recursion, and the second one by grafting and shuffling some decorated rooted trees.
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.
Combinatorial Hopf algebras from renormalization
Christian Brouder
Institut de Minéralogie et de Physique des Milieux Condensés,
CNRS UMR7590, Universités Paris 6 et 7, IPGP,
140 rue de Lourmel, 75015 Paris, France. [email protected]
Alessandra Frabetti Université de Lyon, Université Lyon 1, CNRS, UMR 5208 Institut Camille Jordan,
43, blvd du 11 novembre 1918, 69622 Villeurbanne, France. [email protected]
Frédéric Menous
Département de Mathématiques, Bât. 425,
Université Paris-Sud, 91405 Orsay, France. [email protected]
(September 18, 2009)
Abstract
In this paper we describe the right-sided combinatorial Hopf structure of three Hopf algebras appearing in the context of renormalization in quantum field theory: the non-commutative version of the Faà di Bruno Hopf algebra, the non-commutative version of the charge renormalization Hopf algebra on planar binary trees for quantum electrodynamics, and the non-commutative version of the Pinter renormalization Hopf algebra on any bosonic field.
We also describe two general ways to define the associative product in such Hopf algebras, the first one by recursion, and the second one by grafting and shuffling some decorated rooted trees.
1 Introduction
In the paper [13], J.-L. Loday and M. Ronco gave the definition of a right-sided combinatorial Hopf algebra (CHA) which includes the examples of Hopf algebras describing the renormalization in quantum field theory. The toy example, which inspired the work in [13], is Kreimer’s Hopf algebra on rooted trees introduced in [9]. In this paper, we describe the CHA structure of three other such examples: the non-commutative version of the Faà di Bruno Hopf algebra given in [3], the non-commutative version of the charge renormalization Hopf algebra on planar binary trees given in [1] for quantum electrodynamics, and the non-commutative version of the Pinter renormalization Hopf algebra on any quantum fields, as given in [4].
Since Loday and Ronco work in the context of cofree-coassociative CHAs, we describe our examples, which are all free-associative CHAs, by considering their linear duals. A right-sided cofree-coassociative CHA is completely determined by the brace structure on the set its primitive elements. Therefore, to describe our examples, it will be sufficient to give their brace structure.
In the first section we fix the notation on right-sided cofree-coassociative CHAs and brace algebras from [13]. We also give a recursive definition of the product and show how to construct it starting from the one defined on decorated rooted trees, that is, the product defined on the right-sided CHA induced by the free brace algebra over the space of decorations. Then we fix the notation for the dual Hopf algebras, which are used in the sequel. Each example is then treated in a separate section.
2 Combinatorial Hopf algebras from
dual Hopf algebras
2.1 Right-sided combinatorial Hopf algebras
In this section we recall the definition and main properties of a right-sided combinatorial Hopf algebra (r-s CHA), as given by J.-L. Loday and M. Ronco in [13], in the cofree-coassociative case.
A right-sided cofree-coassociative CHA is, up to an isomorphism, a tensor coalgebra with the deconcatenation coproduct, endowed with an associative product which makes it into a bialgebra and which satisfies the right-sided condition: for any , the subspace is a right ideal of , that is
[TABLE]
This condition is equivalent to demanding that the product induces a right action of on the quotient space , that is
[TABLE]
Loday and Ronco proved that a cofree-coassociative CHA is right-sided if and only if the set of its primitive elements is a brace algebra, that is, it is endowed with a brace product acting on with value in , satisfying the brace relation
[TABLE]
for any . The brace product restricted to is also denoted by , if one wishes to specify the number of variables on the right, or to underline that it is a special case of a multibrace product defined on any powers .
The brace product can be found from the associative product by projecting the result onto the space of co-generators. If we denote by the canonical projection, this means that
[TABLE]
for any and , where we denote the tensor product in by the concatenation. In particular, for any we have
[TABLE]
therefore on .
Conversely, the product in can be reconstructed from the brace product on , using the deconcatenation coproduct to recover from . The resulting formula of Loday and Ronco for the product is (cf. [13])
[TABLE]
where each map is applied to a block of generators and generators , with the following assumptions:
[TABLE]
and where the operators for of course satisfy the brace relation (2.2).
Applying formula (2.3) requires some computations. Let us take the example of . For we have and the only term is . For we have or and or . This gives us the four terms . Since , we have only two terms left . For , all the terms are zero because each term contains a factor . In general, the terms with are zero in the product . Therefore, using (2.1), we get
[TABLE]
Similarly, for , we have two terms for : and three terms for : , so that
[TABLE]
For , we have one term for : , two terms for : and three terms for : , so that
[TABLE]
In particular then, formula (2.3) for gives
[TABLE]
2.2 Recursive definition of the product.
Formula (2.3) can be given in a recursive way. To do it, let us denote by the brace product induced on by the associative product on , and let us denote by the generic words in .
Proposition 2.1
Given the brace product on , the product on can be reconstructed in the following recursive way. For any , with :
[TABLE]
where the sums run over all possible factorisations of and with respect to the concatenation.
Proof. With the assumptions (2.1) on , formula (2.3) can be expressed as
[TABLE]
where the sum runs other all the factorisations (for the concatenation) of and . Note that the factors can be in but the condition ensures that the sum is finite. It also ensures that formula (2.6) is recursive.
If we then use this formula to express the factor in line (2.6), we obtain the desired expression for .
In particular, if we expand the words and of in terms of elements and of , with the notation of Section 2.1, formula (2.6) becomes
[TABLE]
Corollary 2.2
The brace relation (2.2) is equivalent to the identity
[TABLE]
for any and .
Proof. If we call , and , the left hand-side of the brace relation (2.2) is simply . The right-hand side, instead, becomes
[TABLE]
where we use the assumptions (2.1) on . From (2.7) it then follows that the right-hand side is equal to .
Remark 2.3
The right-sided combinatorial Hopf algebras, as well as the shuffle and the quasishuffle Hopf algebras, are examples of more general cofree-coassociative combinatorial Hopf algebras introduced by Loday and Ronco, where is a so-called multibrace algebra. See [13] and the references therein for details. In all these examples, as well as in the general case, the product on can be defined recursively from the multibrace product on . The expressions (2.7), (2.6) and (2.9), with , are valid in the most general case as well as in all the examples.
2.3 Right-sided Hopf algebras and trees
Let be a right-sided CHA such that the brace algebra is a finite dimensional or a graded vector space. In the first part of this section we forget the brace structure on and consider the free brace algebra on modeled by planar rooted trees. The free brace algebra has already been described in terms of trees by F. Chapoton in [5], as a consequence of his construction of the Brace operad. Here we give a direct description of the free brace algebra within the notations we established in section 2.2.
In the second part of this section we relate the free brace structure on with the original one, and deduce a way to describe the associative product on starting from the one defined on trees. Again, this is a particular case of the equivalence between the categories of brace and dendriform algebras given by Chapoton in [5]. However it seems to us useful for computations to write an explicit statement.
Let denote the set of plane rooted trees and for any non-empty tree denote by the set of its vertices and by the cardinality of . If is a map from to , then the pair is a plane tree with decorations in . For example, the following tree with 4 vertices is decorated by the given map :
[TABLE]
For any , we denote by the linear span of all the decorated trees of shape , modulo the obvious linear relations coming from , such as:
[TABLE]
Then the vector space
[TABLE]
contains the decorated trees of any shape, and the elements of the tensor space are called decorated forests. From now on, we denote by the concatenation the tensor product between trees, and we simply denote by a decorated tree, omitting the decoration.
We now define the structure of a brace algebra on , and consequently that of a right-sided CHA on , using the results of section 2.2. Therefore, we endow with the free (deconcatenation) coproduct and we suppose that the product is defined through the brace product on .
To define the brace product, consider, for any , the linear map
[TABLE]
which maps a forest into the tree obtained by joining the ordered trees to a new root decorated by . For instance
[TABLE]
Any tree can be written as . If is made only of the root, decorated by , the forest is the formal unit of , that is .
Theorem 2.4
Let be the linear map defined on any decorated tree and any decorated forest by
[TABLE]
where is the product induced by on according to Eq. (2.7) and with the assumptions (2.1).
Then is a brace product on , and consequently is an associative product on which makes it into a right-sided CHA.
Proof. Assuming conditions (2.1) on the maps , it suffices to show that satisfies the brace identity (2.9), that is
[TABLE]
for any tree and any forests . If , , have respectively , and vertices, we prove the brace identity by induction on the total number of vertices .
Since is a tree, it has at least one vertex (the root) and therefore . If , only is a tree, namely the single root, and are scalars. Because and , both terms in the equality produce and therefore coincide.
Now suppose that the brace identity holds for , for a given . According to the previous sections, this implies that the product is associative up to the same number of vertices. (In fact, the associativity of does not depend on the definition (2.10) of and was proved in general by Loday and Ronco.) Then consider a tree and two forests with a total number of vertices . Using the definition of and the associativity of up to , for we obtain
[TABLE]
Lemma 2.5
The brace product on can be expressed in terms of graftings of trees: if and , then is the sum of the terms obtained by grafting the trees onto the vertices of , in all the possible ways which preserve the order of the ’s from left to right.
Similarly, the product on is the sum of terms mixing all possible shuffles and all possible graftings of the trees on the right-hand side onto the vertices of the trees on the left hand-side.
This result shows that the recursive definition of the brace product (2.10) is equivalent to the definition given in [5] in terms of grafting of trees.
Proof. We prove it by induction on the size of the forests, given by the total number of vertices. For this, we need to treat at the same time and , which is given by (2.6).
The induction starts with the first non-trivial operations:
[TABLE]
is the grafting of the second on the first one. The claim is obtained because this is the only possible grafting. Similarly, according to (2.6), the product
[TABLE]
is exactly made of the only possible grafting and the two allowed shuffles.
Now suppose that is made of all possible ordered graftings of the trees composing the forest on the vertices of the tree , for and having a total number of vertices , for some . Similarly, suppose that is made of the terms mixing all possible shuffles of the trees of with those of , and of graftings of the trees of over the vertices of those contained in , for and having a total number of vertices .
Then, consider and with . Applying the definition (2.10) for , we see that
[TABLE]
is the grafting of onto the original root. The claim is then guaranteed by the inductive hypothesis on .
Similarly, consider and with . Applying formula (2.6) we see that
[TABLE]
contains exactly all possible shuffles mixed with all possible graftings. This is guaranteed by the inductive hypothesis on the factors and , and the fact that the sum runs over all decompositions of and into two factors, including the trivial ones.
Here are some examples of graftings and shuffles:
[TABLE]
According to the results of Loday and Ronco, in particular paragraph 3.14 in [13], we can conclude that
Corollary 2.6
The brace algebra , endowed with , is the free brace algebra over .
Remark 2.7
The algebras and , or their duals, or their non-planar and commutative versions, appeared in really many recent works. We quote, but the list is surely not exhaustive, the works by R. Grossman and R. G. Larson [7], F. Chapoton [5], L. Foissy [6], D. Guin et J.-M. Oudom [8], M. Ronco [15] and J.-L. Loday and M. Ronco [13].
Now suppose that itself is a brace algebra, and therefore is a right-sided CHA. We are going to show that the product defined in can be found by computing its lifting to .
Let be the linear morphism from to defined by and
[TABLE]
It is clear that preserves the concatenation in and , and that it identifies with .
Note that the map does not preserve the brace product, in fact
[TABLE]
and therefore it does not preserve the product in and . We show that has an inverse map which allows to compute the product in starting from that in .
Theorem 2.8
Let the linear morphism from to defined recursively by
, 2. 2.
, 3. 3.
\mu\big{(}B_{+}^{x}(s_{1}\ldots s_{q})\big{)}=M_{1q}\big{(}x;\mu(s_{1}\ldots s_{q})\big{)}.
Then, for any , we have
[TABLE]
Proof. The proof is straightforward and relies on the recursive formulas in brace algebras and on the fact that . If and then
[TABLE]
Since is a brace algebra, either or .
- •
If , then
[TABLE]
- •
If , then
[TABLE]
Recursively, we get
[TABLE]
This result means that one can compute the product in with the help of the product in . This last product, given by shuffle and grafting of trees, is quite easy to handle. Let us illustrate the application with an example:
[TABLE]
This computation can be compared with that made in section 2.1.
Remark 2.9
The result of theorem (2.8) can be obtained also as a consequence of the equivalence between the categories of brace and dendriform algebras proved by Chapoton in [5]. Since is by assumption a brace homomorphism between and , this equivalence allows to state that for any and in we have . If we then choose and , we obtail formula (2.11).
Remark 2.10
The algebra is the dual of Foissy’s Hopf algebra of decorated plane trees, cf. [6]. Foissy’s Hopf algebra on rooted trees has a “universal property”, in the sense that it is endowed with the Hochschild cocycle operator . Note that the property that we show for is not the dual property of that one.
2.4 Right-sided CHAs from dual Hopf algebras
In the next sections we determine some right-sided CHAs from the dualization of given Hopf algebras where the vector space is itself graded. In this case, the vector space coincides with the dual space , and we give a general tool to compute the brace structure on starting from the coproduct on . This tool is then used in the examples presented in the rest of the paper.
Let be a graded Hopf algebra that is free as an algebra, finite dimensional in all degrees, and with generators which are themselves graded. If we denote by be the vector space spanned by all the generators of (infinite but countable many), the Hopf algebra can be given as .
The dual Hopf algebra is defined as follows. As a vector space, it is the graded linear dual vector space of , that is , where is the graded linear dual vector space of . If we denote by a generic basis of , that is a set of generators of , the element dual to each is defined by the pairing . Therefore, the dual of a generic basis element in is the element in defined by the pairing
[TABLE]
As a coalgebra, inherits the coproduct dual to the product of , that is, such that
[TABLE]
Since is free and unital as an algebra, is cofree and counital as a coalgebra, that is, is the deconcatenation coproduct
[TABLE]
and with the counit . In this expression, is not (yet) a unit, it denotes the generator of . The set of primitive elements of is then obviously the dual of the set of generators of .
Finally, as an algebra, inherits the product dual to the coproduct of , that is, the product such that
[TABLE]
The right-sided condition (2.1) for the Hopf algebra is equivalent to require that the coproduct on induces a right coaction of the Hopf algebra on the subspace , that is
[TABLE]
Explicitly, this means that for any element , the coproduct (in Sweedler’s notation) produces terms with . Since the coproduct is an algebra morphism, and the product is free, it is sufficient that this property holds for : for any generator , the coproduct produces terms with (cf. [13], Section 3.6).
Finally, the brace product on is the projection of onto . The projection , in this case, is the map
[TABLE]
for any . Therefore, the maps are simply given by
[TABLE]
This sum if finite. In fact, let us denote by [resp. ] the degree of the elements in the graded Hopf algebra [resp. ]. We recall that if denotes the degree of a generic basis element of , then the degree of an element is given by . Then the sum over in Formula (2.13) is limited by the fact that .
3 The right-sided combinatorial structure
of the Hopf algebra
Let be the non-commutative Hopf algebra of formal diffeomorphisms, as defined in [16] or [3] (where it was denoted by ). It is the graded and connected Hopf algebra on the generators graded by , considered with the free (tensor) product, and endowed with the coproduct
[TABLE]
where we set , and with the counit . This Hopf algebra is a free-associative CHA, and the formula (3.1) clearly says that the coproduct satisfies the right-sided condition (2.12).
Let be its dual Hopf algebra, as described in section 2, with primitive elements in . Then is a right-sided cofree-coassociative CHA, and moreover a dendriform algebra, and is a brace algebra.
Proposition 3.1
The brace product on which induces the CHA structure on is given by
[TABLE]
Proof. According to eq. (2.13), for any and any , we have
[TABLE]
If we put , the coproduct of becomes [3]
[TABLE]
with
[TABLE]
Therefore,
[TABLE]
We take and we evaluate . From the definition of , we must have , . Therefore, and
[TABLE]
4 The right-sided combinatorial structure
of the Hopf algebra