5 Operad and cooperad structures
We now describe an operad structure on Poisd and the corresponding dual cooperad structure on Siopd.
Given an S-tree, we can produce a bracket expression. For example, we send
We can then send forests to products of bracket expressions, e.g.
The Jacobi identity translates to the usual Jacobi identity of the Lie/Poisson bracket. With the bracket expressions, we can interpret Poisd as operad in the usual way by imposing the Leibniz rule
{X,Y⋅Z}={X,Y}⋅Z+(−1)∣X∣∣Y∣Y⋅{X,Z}
Under the configuration pairing, one checks that this gives the following cooperad structure on Siopd. To give an operad structure is to give a map ∘a:O(m)⊗O(n)→O(m+n−1) for every tree of the form
where the grafting vertex is the ath vertex. Label the two vertices A and B. To make Siopd a cooperad, we need a map Siopd(m+n−1)→Siopd(m)⊗Siopd(n). This map sends G to GA⊗GB, where the edges of G1 and G2 are specified by the following procedure:
For any edge ij of G, consider the leaves i and j in the tree above. Let v be the meet of i and j (so that v=A or B), and let Jv(i)=Jv(j) be the branches of v over which i and j lie (in this case, one of Jv(i) and Jv(j) will be i or j). Then add an edge to Gv from Jv(i) to Jv(j).
Theorem
5.1
The map Siopd(n)→H∗(Confn(Rd))=H∗(Ed(n)) is an isomorphism of cooperads.
Corollary
5.2
The map Poisd(n)→H∗(Confn(Rd))=H∗(Ed(n)) is an isomorphism of operads.
Since the cooperad structure is compatible with the product structure, it suffices to show that it preserves
∘a on
aij.
Consider the composite
Ed(m)×Ed(n)⟶∘aEd(m+n−1)⟶αijSd−1.
Consider the homotopy where at time t, the disks in the first factor are scaled by t and the disks in the second factor are scaled by t2. As t→0, we see that this approaches the projection onto the vth factor followed by αJv(i)Jv(j), as promised.