6.4 A ∞ -structure on a subcomplex [03S7]
Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.
Complete original source context · Original author HTML
6.4 -structure on a subcomplex
In this section we are going to restate in a convenient form some results from [GS] and [Me].
Let be a non-unital -algebra, be an idempotent which commutes with the differential . In other words, is a linear map of degree zero such that . Assume that we are given an homotopy , . Let us denote the image of by . Then we have an embedding and a projection , such that .
Let us introduce a sequence of linear operations in the following way:
a) ;
b) ;
c) .
Here the summation is taken over all oriented planar trees with tails vertices (including the root vertex), such that the (oriented) valency (the number of ingoing edges) of every internal vertex of is at least . In order to describe the linear map we need to make some preparations. Let us consider another tree which is obtained from by the insertion of a new vertex into every internal edge. As a result, there will be two types of internal vertices in : the “old” vertices, which coincide with the internal vertices of , and the “new” ones, which can be thought geometrically as the midpoints of the internal edges of .
To every tail vertex of we assign the embedding . To every “old” vertex we assign with . To every “new” vertex we assign the homotopy operator . To the root we assign the projector . Then moving along the tree down to the root one reads off the map as the composition of maps assigned to vertices of . Here is an example of and :
![[Uncaptioned image]](https://arxiv.org/html/math/0011041v1/fig3.png)
![[Uncaptioned image]](https://arxiv.org/html/math/0011041v1/fig3.1.png)
Proposition 4
The linear map defines a differential in .
Proof. Clear.
Theorem 3
The sequence gives rise to a structure of an -algebra on .
Sketch of the proof. The proof is quite straightforward, so we just briefly show main steps of computations.
First, one observes that and are homomorphisms of complexes. In order to prove the theorem we will replace for a given each summand by a different one, and then compute the result in two different ways. Let us consider a collection of trees such that is obtained from in the following way:
a) we split the edge into two edges by inserting a new vertex inside ;
b) the remaining part of is unchanged.
We assign to the vertex edge, and keep all other assignments untouched. In this way we obtain a map .
Let us consider the following sum (with appropriate signs):
We can compute it in two different ways: using the relation , and using the formulas for given by the -structure on . The case of the relation gives
where is defined analogously to , with the only difference that we assign to a new vertex operator instead of for some edge . Similarly, the summand is defined if we assign to a new vertex operator instead of . Formulas for are quadratic expressions in . This gives us another identity
Thus we have , and it is exactly the -constraint for the collection .
Moreover, using similar technique, one can prove the following result.
Proposition 5
There is a canonical -morphism , which defines a quasi-isomorphism of -algebras.
For the convenience fo the reader we give an explicit formula for a canonical choice of . The operator is defined as the inclusion . For we define as the sum of terms over all planar trees with tails. Each term is similar to the term defined above, the only difference is that we insert operator instead of into the root vertex.
One can also construct an explicit -quasi-isomorphism .
Remark 16
a) Similar construction works in the case of an arbitrary non-unital -category. In that case one needs projectors and homotopies for every graded space of morphisms . All formulas remain the same as in the case of -algebras. The resulting -category with the spaces of morphisms given by is equivalent to the original one. We will use this fact later.
b) Propositions 4 and 5 should hold in a much more general case of algebras over operads (see e.g. [M]).