Double shuffle relations for arborified zeta values (Q2333364)

This paper is a detailed study of arborified multizetas and polylogarithms. Recall that multizetas can be defined into two different ways: the first one, with a presentation by iterated sums, gives rise to the stuffle (or quasi-shuffle) relations. The second one, with a presentation by iterated integrals, gives rise to the shuffle relations. Both presentations are related through the binarisation map. Stuffle arborified multizetas are first defined in two versions \(\zeta^T_{st}(F)\) and \(\zeta^{T\star}_{st}(F)\) by iterated sums, which convergence domains are carefully studied. Taking an unramified tree, we obtain a classical multizeta and it is proved that any such arborified multizeta is a linear span of classical multizetas with rational coefficients, in a non unique way; one of these ways gives integer coefficients. Then arborified multizetas are defined. They are smooth functions on \([0,1[\) and, as for arborified multizetas, they are linear spans of classical polylogarithms with rational coefficients. It is proved that they form an algebra morphism for the concatenation product of forests. Taking their limit to 1 (with restriction on the domain of definition of polylogarithms), we obtain shuffle arborified multizetas \(\zeta^T_{sh}(F)\). Generalizing the double shuffle relations, three nonassociative products (stuffle, anti-stuffle and shuffle) are inductively defined on forests, and it is proved that the map \(\zeta^T_{st}\) (respectively \(\zeta_{st}^{T,\star}\) and \(\zeta_{sh}^T\)) is compatible with the stuffle (respectively anti-stuffle product, shuffle) product. This gives families of relations on arborified multizetas, and hence on multizetas. In the appendix, the arborified binarisation map is studied. It gives an inequality between shuffle and stuffle arborified multizetas, which is an equality only for unramified trees, that is to say for classical multizetas.