On the homotopy transfer of A∞ structures
Jakub Kopřiva
Abstract
The present article is devoted to the study of transfers for A∞ structures,
their maps and homotopies, as developed in [8]. In particular, we supply
the proofs of claims formulated therein and provide their extension by comparing them
with the former approach based on the homological perturbation lemma.
Key words: A∞ structures, transfer, homological perturbation lemma.
MSC classification: 18D10, 55S99 .
Dedicated to the memory of Martin Doubek
Contents
-
1 Introduction
-
2 Reduced tensor coalgebras
-
2.1 Codiferentials on tensor coalgebras
-
2.2 Morphisms and homotopies
-
2.3 Codifferentials and A∞ algebras
-
3 Homotopy transfer of A∞ algebras
-
3.1 p−kernels
-
3.2 q−kernels
-
4 Homotopy transfer and the homological perturbation lemma
1 Introduction
The notion of strongly homotopy associative or A∞ algebras
is a generalization of the concept of differential graded algebras.
These algebras were introduced by J. Stasheff with the aim of a characterization
of (de)looping and bar construction in the category of topological spaces.
Since then they found many applications ranging from algebraic topology and
operads to quantum theories in theoretical physics.
We consider the following situation:
let (V,∂V) and (W,∂W) be two chain complexes of modules,
and f:(V,∂V)→(W,∂W) and g:(W,∂W)→(V,∂V)
two mappings of chain complexes such that gf is homotopic to the identity map on V
and (V,∂V) is equipped with A∞ algebra structure.
Then a natural question arises − can A∞ structure be transferred to
(W,∂W) and secondly, what is its explicit form in terms of A∞
algebra structure on (V,∂V) and and in which sense it is unique?
While the existence of a transfer follows from general model
structure considerations, an unconditional and elaborate answer
producing explicit formulas for the transferred objects was formulated
in [8].
The present article contributes to the problem of transfer of A∞
structures. Its modest aim is to supply
detailed proofs of many claims omitted in the original article [8],
thereby facilitating complete subtle proofs to a reader interested
in this topic. This exposition also extends the results of the aforementioned article
in several ways, and sheds a light on its relationship with the
homological perturbation lemma.
The content of our article goes as follows. In the Section 2 we
recall a well-known correspondence
between A∞ algebras and codifferentials on reduced tensor coalgebras.
This allows us to simplify the proofs in Section 3 considerably.
The Section 3 is devoted to the problem of homotopy transfer
of A∞ algebras. We first derive the formulas introduced in [8], and
then give their self-contained proofs. Here we achieve a substantial simplification of
all proofs due to the reduction of sign factors.
We also comment on another remark in [8], namely, the
relationship between the homological perturbation lemma and homotopy transfer of
A∞ algebras. We prove that on certain assumptions
the explicit formulas in [8] do coincide with those coming
from the homological perturbation lemma.
We shall work in the category of Z-graded modules over an arbitrary
commutative unital ring R, and their graded R-homomorphisms.
We first briefly recall the concepts of A∞ algebra,
A∞ morphism of A∞ algebras and A∞
homotopy of A∞ morphisms, cf. [8], [4].
Definition 1.1**.**
Let (V,∂V) be a chain complex of modules
indexed by Z, i.e. (V,∂V) is a Z-graded modules
V=⨁i=−∞∞Vi with ∂V(Vi)⊂Vi−1 and
∂V∘∂V=0. Let μn:V⊗n→V be a collection of
linear mappings of degree n−2 (n≥2), satisfying
[TABLE]
for all n≥2 and A(n)={k,ℓ∈N∣k+ℓ=n+1,k,ℓ≥2,1≤i≤k}.
The structure (V,∂V,μ2,μ3,…) is called A∞ algebra.
Throughout the article, we use the Koszul sign convention. This means that
for U, V a W graded modules and
f:U→V, g:U→V, h:V→W and i:V→W linear maps of degrees
∣f∣, ∣g∣, ∣h∣ and ∣i∣, respectively, holds
[TABLE]
Similarly
for u1,u2∈U of degree ∣u1∣ and ∣u2∣, respectively, holds
[TABLE]
Definition 1.2**.**
Let (V,∂V,μ2,…) and (W,∂W,ν2,…) be A∞ algebras.
Then the set {fn:V⊗n→W,∣fn∣=n−1}n≥1 is called A∞ morphism
if
[TABLE]
holds for all n≥1 with B(n)={k,r1,\mbox…,rk∈N∣k≥2,r1,\mbox…,rk≥1,r1+\mbox…+rk=n} and ϑ(r1,…,rk)=∑1≤i<j≤kri(rj+1).
Morphisms of A∞ algebras can be composed: for (U,∂U,ϱ2,…),
(V,∂V,μ2,…) and (W,∂W,ν2,…) A∞ algebras,
{fn:U⊗n→V}n≥1 and {gn:V⊗n→W}n≥1
A∞ morphisms, their composition
{(gf)n:U⊗n→W}n≥1 is defined as
[TABLE]
Definition 1.3**.**
Let {fn:V⊗n→W}n≥1 and {gn:V⊗n→W}n≥1
be morphisms between A∞ algebras (V,∂V,μ2,…) and (W,∂W,ν2,…). The
set of linear mappings {hn:V⊗n→W,∣hn∣=n}n≥1 is an A∞ homotopy between
A∞ morphisms {fn:V⊗n→W}n≥1 and {gn:V⊗n→W}n≥1
provided
[TABLE]
is true for all n≥1 with
B(n)={k,r1,\mbox…,rk∈N∣k≥2,r1,\mbox…,rk≥1,r1+\mbox…+rk=n}.
2 Reduced tensor coalgebras
In the present section we introduce a bijective correspondence between
A∞ algebras and codifferentials on reduced tensor coalgebras, cf.
[4]. We retain the notation
V=⨁i=−∞∞Vi for Z− graded modules as well as
[TABLE]
[TABLE]
for n∈N, and A(1)=A(2)=B(1)=∅. We use a few natural variations on this notation,
e.g. A′(n)={k′,ℓ′∈N∣k′+ℓ′=n+1,k′,ℓ′≥2,1≤i′≤k′}.
2.1 Codiferentials on tensor coalgebras
Definition 2.1**.**
Let TV=⨁n=1∞V⊗n, where the elements in V⊗i
have degree (or homogeneity) i, and let the mapping C:TV→TV⊗TV
be defined in such a way that C:v↦0 for v∈V⊗1=V and
[TABLE]
for n≥2 and v1,\mbox…,vn∈V. The pair (TV,C)
is called the reduced tensor coalgebra.
Definition 2.2**.**
A linear mapping δ:TV→TV of degree −1 is called coderivation
if C∘δ=(δ⊗1+1⊗δ)∘C. Moreover,
if δ satisfies δ∘δ=0, it is called codifferential.
Remark 2.3*.*
We notice that C is coassociative, (1⊗C)∘C=(C⊗1)∘C.
For all v∈TV holds C(v)=0 if and only if v is of homogeneity 1.
For all maps φ:V⊗n→TW, n≥1, holds CTW∘φ=0
if and only if φ(V⊗n)⊆W.
For all v=v1⊗\mbox…⊗vn∈TV and
w=w1⊗\mbox…⊗wm∈TV, we have
[TABLE]
with vi,j=vi⊗\mbox…⊗vj, i≤j, i,j∈{1,…,n}, and analogously
for wi,j. This little calculation expresses a fact that TV is a bialgebra which is, as a conilpotent coalgebra, cogenerated by V.
Lemma 2.4**.**
Let E:TV→TW be a linear mapping for which there exist
{en:V⊗n→W}n≥1 with
E∣V⊗n=en+∑B(n)er1⊗\mbox…⊗erk,
and B(n) given in (2). Then
[TABLE]
Proof.
Obviously, we can write
E∣V⊗n=en+∑i=1n−1ei⊗E∣V⊗n−i.
The proof is by induction on n: the claim holds for n=1 and we assume it
is true foll all natural numbers less than n. Then
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
and the proof follows by induction hypothesis from
E∣V⊗ℓ=eℓ+∑i=1ℓ−1ei⊗E∣V⊗ℓ−i.
∎
Theorem 2.5**.**
Let E:TV→TW a G:TV→TW be linear mappings for which
there exist linear mappings {en:V⊗n→W}n≥1, {gn:V⊗n→W}n≥1
such that E∣V⊗n=en+∑B(n)er1⊗\mbox…⊗erk and
G∣V⊗n=gn+∑B(n)gr1⊗\mbox…⊗grk with B(n) given in
(2). Given a linear mapping F:TV→TW, the following conditions are equivalent:
-
CTW∘F=(E⊗F+F⊗G)∘CTV,
2. 2.
there exist linear mappings {fn:V⊗n→W}n≥1 such that
[TABLE]
Proof.
(2)⇒(1): We have
F∣V⊗n=fn+∑i=1n−1E∣V⊗i⊗fn−i+∑i=1n−1fi⊗G∣V⊗n−i+∑i=1n−1∑j=1n−i−1E∣V⊗j⊗fi⊗G∣V⊗n−i−j
for all n≥1.
We now verify 1. by expanding both sides:
[TABLE]
[TABLE]
and by Lemma 2.4 we get
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
The summation in the variables i+j and i+j+k, respectively, yields
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Taking all terms of the form
(E∣V⊗n−i)⊗⋆ and ⋆⊗(G∣V⊗n−i)
results in
[TABLE]
and the implication is proved.
Notice that we also proved, on the assumption
F∣V⊗m=fn+∑B(m)∑1≤i≤ker1⊗\mbox…⊗eri−1⊗fri⊗gri+1⊗\mbox…⊗grk for n>m≥1, that
[TABLE]
[TABLE]
(1)⇒(2): The proof is again by induction. For all v∈V holds
CTW∘F(v)=0, which gives F(V)⊂W and so there exists a
linear mapping f1:V→W such that F∣V=f1.
Assume now the claim of the implication is true for all natural numbers less than
n, i.e.
F∣V⊗m=fm+∑B(m)∑1≤i≤ker1⊗\mbox…⊗eri−1⊗fri⊗gri+1⊗\mbox…⊗grk, for n>m≥1. The proof
of the previous implication claims for
F∣V⊗m=fm+∑B(m),ri>0er1⊗\mbox…⊗eri−1⊗fri⊗gri+1⊗\mbox…⊗grk with n>m≥1, that
[TABLE]
[TABLE]
Because CTW is linear,
F∣V⊗n differs from
∑i=1n−1E∣V⊗i⊗fn−i+∑i=1n−1fi⊗G∣V⊗n−i+∑i=1n−1∑j=1n−i−1E∣V⊗j⊗fi⊗G∣V⊗n−i−j by a linear map
fn:V⊗n→W. This means F∣V⊗n is of the required form and the proof is complete.
∎
Theorem 2.6**.**
A linear mapping δ:TV→TV of degree −1 fulfills
C∘δ=(δ⊗1V+1V⊗δ)∘C if and only if
there exist a set of maps {δn:V⊗n→V}n≥1 of degree −1 such that
δ∣V=δ1 and for
n≥2 holds δ∣V⊗n=δn+∑i=1n1V⊗i−1⊗δ1⊗1V⊗n−i+∑A(n)1V⊗i−1⊗δℓ⊗1V⊗k−i, where A(n) is given by (2).
Proof.
In Theorem 2.5 we take E=G=1V, where
e1=g1=1V and en=gn=0 for n≥2.
∎
Lemma 2.7**.**
Let δ:TV→TV be a linear map of degree −1 such that
δ∣V=δ1 and for n≥2 holds
δ∣V⊗n=δn+∑i=1n1V⊗i−1⊗δ1⊗1V⊗n−i+∑A(n)1V⊗i−1⊗δℓ⊗1V⊗k−i.
Then the following conditions are equivalent:
-
δ∘δ=0,
2. 2.
δ1∘δ1=0* and for all n≥2 we have*
[TABLE]
where A(n) is given by (2).
Proof.
(1)⇒(2): The proof goes by induction. By assumption we have for v∈V
δ(δ1(v))=0, so δ1:V→V implies δ1(δ1(v))=0.
Now assume (7) is true for all natural numbers less than n. Then
[TABLE]
[TABLE]
Schematically, this means
[TABLE]
[TABLE]
[TABLE]
where the last row is a consequence of the Koszul sign convention:
[TABLE]
[TABLE]
with ∣δn∣=−1 for all n∈N.
The term ∑1V⊗a⊗δb+d+1(1V⊗b⊗δc⊗1V⊗d)⊗1V⊗e can be written as
[TABLE]
We have a+b+c+d+e=n, choose arbitrary a,e≥0, 1≤a+e<n and sum over all b,c,d such that
0≤b,d≤n−a−e and 1≤c≤n−a−e such that b+c+d=n−e−a:
[TABLE]
[TABLE]
where n′=n−a−e. By induction hypothesis, the last display is equal to [math], and we have
[TABLE]
[TABLE]
Consequently, (7) is true for n and
[TABLE]
[TABLE]
(2)⇒(1): The second implication can be easily deduced from the first one.
∎
2.2 Morphisms and homotopies
Definition 2.8**.**
Let δV be a codifferential on (TV,C) and δW be a codifferential on
(TW,C). A linear mapping F:(TV,C,δV)→(TW,C,δW) of degree [math] is called morphism provided
CTW∘F=(F⊗F)∘CTV and δW∘F=F∘δV.
Lemma 2.9**.**
Let F:(TV,δV)→(TW,δW) be a linear
map of degree [math]. Then the following claims are equivalent:
-
CTW∘F=(F⊗F)∘CTV,
2. 2.
there is a set of linear mappings {fn:V⊗n→W}n≥1
of degree [math] such that F∣V⊗n=fn+∑B(n)fr1⊗\mbox…⊗frk,
with B(n) given in (2).
Proof.
(2)⇒(1): A consequence of Lemma 2.4.
(1)⇒(2) The proof goes by induction. For v∈V we have C(v)=0,
which implies 0=(F⊗F)∘CTV=CTW∘F and so F(v)∈W.
Assuming the claim is true for all natural numbers less than n,
[TABLE]
[TABLE]
and by induction hypothesis F∣V⊗m=fm+∑B(m)fr1⊗\mbox…⊗frk
for all n>m≥1. Lemma 2.4 gives
[TABLE]
and because CTW is linear, F∣V⊗n differs from
∑i=1n−1fi⊗F∣V⊗n−i by a linear map fn:V⊗n→W.
Then F∣V⊗n is of the required form and the proof is complete.
∎
Lemma 2.10**.**
Let F:(TV,δV)→(TW,δW) be a linear map
of degree [math] such that F∣V⊗n=fn+∑B(n)fr1⊗\mbox…⊗frk,
with all {fn:V⊗n→W}n≥1 linear of degree [math]. Then the following are equivalent:
-
δW∘F=F∘δV,
2. 2.
for all n≥1 holds
[TABLE]
Proof.
(1)⇒(2): The proof goes by induction. The restriction to V,
δW∘F∣V=F∘δV∣V, corresponds to δ1W∘f1=f1∘δ1V.
We now assume (8) applies to all natural numbers less than n. We expand both sides of (8),
[TABLE]
[TABLE]
[TABLE]
[TABLE]
and compare the terms of same homogeneities. We fix j≥1 and r1,\mbox…,rj≥1,r1+\mbox…+rj<n and 0≤m≤j, and focus on terms of the form fr1⋆\mbox…⊗fri−1⊗⋆⊗fri⊗\mbox…⊗frj, where ⋆ is an expression of the form δ⋆W(f⋆⊗\mbox…⊗f⋆) or f⋆(1V⊗⋆⊗δ⋆V⊗1V⊗⋆).
Terms on the right hand side of the form fr1⊗\mbox…⊗fri−1⊗δ⋆W(f⋆⊗\mbox…⊗f⋆)⊗fri⊗\mbox…⊗frj
correspond to
[TABLE]
while the terms of the form
fr1⊗\mbox…⊗fri−1⊗f⋆(1V⊗⋆⊗δ⋆V⊗1V⊗⋆)⊗fri⊗\mbox…⊗frj
correspond to
[TABLE]
[TABLE]
[TABLE]
with n′=n−r1+\mbox…+rj. Because n′<n, they fulfill the equality (8)
and hence are equal. Subtracting from both sides all elements of homogeneity greater than 1,
we arrive at
[TABLE]
[TABLE]
[TABLE]
However, this equality is true by (8) for n.
(2)⇒(1): This implication can be again reduced to the previous one.
∎
Definition 2.11**.**
Let δV be a codifferential on (TV,C) and δW be a codifferential on
(TW,C). Let F:(TV,C,δV)→(TW,C,δW)
and G:(TV,C,δV)→(TW,C,δW) be
morphisms. F and G are homotopy equivalent provided there exist linear maps
H:TV→TW of degree 1 such that
CTW∘H=(F⊗H+H⊗G)∘CTV and
F−G=HδV+δWH. The map H is a homotopy between F a G.
Remark 2.12*.*
Theorem 2.5 implies that H:TV→TW of degree 1 fulfills
CTW∘H=(F⊗H+H⊗G)∘CTV
if and only if there is a set of maps {hn:V⊗n→W}n≥1 of degree 1
such that H∣V⊗n=hn+∑B(n),ri>0fr1⊗\mbox…⊗fri−1⊗hri⊗gri+1⊗\mbox…⊗grk.
Theorem 2.13**.**
We retain the assumptions of Definition 2.11, and in addition assume the existence
of the set of linear maps
{en:V⊗n→W}n≥1, {gn:V⊗n→W}n≥1 of even degree
d such that E∣V⊗n=en+∑B(n)er1⊗\mbox…⊗erk and G∣V⊗n=gn+∑B(n)gr1⊗\mbox…⊗grk. Let F:TV→TW be
a linear mapping for which there exists a set of linear maps {fn:V⊗n→W}n≥1 of odd
degree d+1 fulfilling
[TABLE]
Then the following assertions are equivalent:
-
E−G=FδV+δWF,
2. 2.
en−gn=f1(δnV)+∑i=1nfn(1V⊗i−1⊗δ1V⊗1V⊗n−i)+∑A(n)fk(1V⊗i−1⊗δℓV⊗1V⊗k−i)+δ1W(fn)+∑B(n),ri>0δkW(er1⊗\mbox…⊗eri−1⊗fri⊗gri+1⊗\mbox…⊗grk)* for all n≥1.*
Proof.
The proof can be done along the same lines as the proofs of Lemma 2.7 and Lemma 2.10.
∎
2.3 Codifferentials and A∞ algebras
Definition 2.14**.**
For V graded we define sV in such a way that (sV)i=Vi−1. The graded modules
V and sV are canonically isomorphic: s:V→sV is a linear map of degree 1 called suspension,
ω:sV→V is a linear map of degree −1 called desuspension.
Remark 2.15*.*
We have s⊗n⊗ω⊗n=(−1)2n(n−1) by the Koszul sign convention.
Theorem 2.16**.**
The following claims are equivalent:
-
{μn:V⊗n→V;∣μn∣=n−2}n≥1* is A∞ structure on V,*
2. 2.
The linear maps δn=s∘μn∘ω⊗n are of degree −1, and
are the components of a codifferential on TsV in the sense of Theorem 2.6.
Proof.
(2)⇒(1): δn=s∘μn∘ω⊗n are the components
of a codifferential, and so we have for all n≥1
[TABLE]
[TABLE]
This can be rewritten, by Koszul sign convention, as
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
The mappings s and ω are linear, hence
[TABLE]
[TABLE]
(1)⇒(2): This can be easily reduced to the proof of the previous implication.
∎
Theorem 2.17**.**
The following claims are equivalent:
-
{φn:V⊗n→W;∣φn∣=n−1}n≥1* is A∞ morphism
from (V,μ) to (W,ν),*
2. 2.
the mappings
[TABLE]
are of degree [math], and are the components of A∞ morphism from (TsV,δV) to
(TsW,δW) in the sense of Lemma 2.9. The codifferentials are given
by A∞ structures on V and W, respectively, via Theorem 2.16.
The following claims are equivalent:
-
{hn:V⊗n→W;∣hn∣=n}n≥1* is A∞ homotopy between
A∞ morphisms φ with components
{φn:V⊗n→W;∣φn∣=n−1}n≥1 and
ψ with components {ψn:V⊗n→W;∣ψn∣=n−1}n≥1, respectively, from
(V,μ) to (W,ν),*
2. 2.
[TABLE]
are of degree 1, and are the components of A∞ homotopy between morphisms F and
G from (TsV,δV) to (TsW,δW), where F
corresponds to φ and G corresponds to ψ
in the sense of the first equivalence in the theorem.
The codifferentials are given by A∞ structures on V and W, respectively, as in Theorem 2.16.
Proof.
The proof goes along the same lines as in Theorem 2.16.
∎
3 Homotopy transfer of A∞ algebras
The starting point for the present section are
the chain complexes (V,∂V) and (W,∂W),
f:V→W, g:W→V their morphisms such that gf is
homotopy equivalent to 1V by a homotopy h. Let (V,∂V)
be equipped with A∞ algebra structure, which means that there
is a set of multilinear maps μ=(μ2,μ3,\mbox…)
satisfying the relations (1.1).
We would like to induce A∞ structure
(W,∂W,ν2,ν3,\mbox…) on
(W,∂W) by transferring (V,∂V,μ2,μ3,\mbox…),
as well as the morphisms of A∞ algebras ψ=(g,ψ2,ψ3,\mbox…)
from (W,∂W,ν) to (V,∂V,μ) and
φ=(f,φ2,φ3,\mbox…) acting in the opposite
direction such that their composition ψφ is A∞ homotopy
equivalent with the identity map via H=(h,H2,H3,\mbox…).
The strategy to solve this problem, cf. [8], suggests to
construct the set of maps {pn:V⊗n→V}n≥2 of degree n−2
called p−kernels, and the set of maps {qn:V⊗n→V}n≥1
of degree n−1 called q−kernels in such a way that
νn,φn,ψn and Hn defined by
[TABLE]
fulfill the transfer problem of A∞ algebra as discussed in the
previous paragraph.
We shall first introduce the p−kernels and based on them we introduce the q−kernels
later on.
Apart from (2) a (2), we shall rely on the notation (cf., [8])
[TABLE]
for n∈N, and
[TABLE]
for arbitrary u1,\mbox…,uk,k∈N.
3.1 p−kernels
Lemma 3.1**.**
The p−kernels together with ∂W constitute an A∞ structure
on (W,∂W) via (9) if and only if for all n≥2 holds
[TABLE]
[TABLE]
Proof.
(W,∂W,ν2\mbox…) is an A∞ algebra if we have for all n≥1
[TABLE]
[TABLE]
This is true for n=1, because (W,∂W) is the chain complex (f∘∂V=∂W∘f
and analogously for g.) Now expand νn following (9):
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Because both f and g are linear maps of degree [math], this equals to
[TABLE]
[TABLE]
which is
[TABLE]
[TABLE]
∎
Lemma 3.2**.**
Let us assume that p−kernels induce the transfer of A∞ algebra as formulated
above, and they fulfill (n≥2)
[TABLE]
Then
[TABLE]
where we define h∘p1=1V.
Proof.
According to (10) these p−kernels induce
A∞ structure on (W,∂W) by Lemma 3.1.
It remains to verify that they give A∞ morphism from
(V,∂V,μ) to (W,∂W,ν), i.e.
[TABLE]
[TABLE]
[TABLE]
which by (9) can be formulated as
[TABLE]
[TABLE]
[TABLE]
Due to gf−1V=∂Vh+h∂V, we have
[TABLE]
[TABLE]
[TABLE]
By assumption (10), we obtain
[TABLE]
[TABLE]
which reduces to
[TABLE]
∎
Remark 3.3*.*
The assumption of Lemma 3.2 can be weaken to
[TABLE]
where (11) is fulfilled if the p−kernels define A∞ structure on (W,∂W), and
f is a monomorphism. In the situation of interest is f, however, assumed to be an epimorphism.
Definition 3.4** (p−kernels, [8]).**
We define for each n≥2:
[TABLE]
where h∘p1=1V, with B(n) given in (2) and ϑ(r1,\mbox…,rk)
given in (ϑ).
Remark 3.5*.*
For p−kernels there exists a non-inductive explicit expression. Each term in the p−kernel
can be represented by a rooted plane tree, and there is a function which associates to a rooted plane tree a
sign corresponding to our inductive definition.
Theorem 3.6**.**
The p−kernels introduced in [8] satisfy
[TABLE]
for all n≥2.
Proof.
Let us first simplify our situation by passing to the suspension
TsV with the induced codifferential δ.
Because s and ω are by Definition 2.14 izomorphisms, (10) is true if and only if
[TABLE]
[TABLE]
Introducing p^m=s∘pm∘ω⊗m, g^=s∘g∘ω and f^=s∘f∘ω (∣p^m∣=−1, ∣g^∣=∣f^∣=0), we have
[TABLE]
The proof of the last claim goes by induction. The case n=2 corresponds to
[TABLE]
which is certainly true because {δn:V⊗n→V}n≥1 are the components of the
codifferential on TsV (cf., (7) for n=2 in Lemma 2.7.)
By induction hypothesis, we assume the claim is true for all natural numbers less than n.
The proof is naturally divided into three steps:
I. We shall first expand the term δ1p^n: we have
p^n=s∘pn∘ω⊗n, so by Definition 3.4
[TABLE]
[TABLE]
[TABLE]
with σ=∑1≤i<j≤kri(rj+1). However,
∣s∘h∘pri∘ω⊗ri∣=1+1+(ri−2)−ri=0, so the last
display equals to
[TABLE]
Consequently,
[TABLE]
and so
[TABLE]
The last summation can be rewritten as
[TABLE]
[TABLE]
[TABLE]
where the last equality comes from the summation over all r1,…,ri+l with
ri+\mbox…+ri+ℓ fixed. We conclude
[TABLE]
II. We shall apply the induction hypothesis to δ1p^n.
We remind the formal equality h^∘p^1=1V and also
gf−1V=∂Vh+h∂V equivalent to
δ1h^+1V=g^f^−h^δ1. Then
[TABLE]
The second part of the first term on the right hand side (3.1) equals
[TABLE]
[TABLE]
where s=∑j<irj. The second term in (3.1) equals
[TABLE]
[TABLE]
By induction hypothesis, we have for all m<n
[TABLE]
Finally, the first part of the first term (3.1) equals
[TABLE]
[TABLE]
[TABLE]
III. Now we pair up the contributions appearing in the previous step: the right hand side of
(3.1) can be rewritten as
[TABLE]
with s=∑j<irj, and we get
[TABLE]
∎
Remark 3.7*.*
Theorem 3.6 implies that the p−kernels in [8] fulfill (11).
3.2 q−kernels
Lemma 3.8**.**
The q−kernels constitute
A∞ morphism φ=(f,φ2,φ3,\mbox…),
φn=f∘qn and νn=f∘pn∘g⊗n,
from (V,∂V,μ2,μ3,\mbox…) to
(W,\partial_{W},\nu_{2},$$\nu_{3},\mbox{\ldots}) if and only if for all n≥2:
[TABLE]
[TABLE]
[TABLE]
Proof.
The proof easily follows from the explicit expansion of A∞ morphism
φ=(f,φ2,φ3,\mbox…), which maps
(V,∂V,μ2,μ3,\mbox…)
to (W,\partial_{W},$$\nu_{2},\nu_{3},\mbox{\ldots}) for
φn=f∘qn and
νn=f∘pn∘g⊗n (cf. (9)).
∎
Lemma 3.9**.**
Let the q−kernels fulfill
[TABLE]
for all n≥2. Then we have
[TABLE]
for all n≥2, where A∞ morphisms
φ and ψ are given by p−kernels and
q−kernels, (9). We also used the notation C(n) as in (C) and
ϑ(r1,\mbox…,rk) as in (ϑ).
Proof.
Assuming (3.9), the set of q−kernels constitutes by Lemma 3.8
A∞ morphism φ=(f,φ2,φ3,\mbox…) from
(V,∂V,μ2,μ3,\mbox…) to (W,\partial_{W},$$\nu_{2},\nu_{3},\mbox{\ldots}).
We also demand the set of maps Hn=h∘qn gives A∞ homotopy
H=(h,H2,H3,\mbox…) between ψφ and 1.
This is equivalent by Definition 1.3 to
[TABLE]
[TABLE]
[TABLE]
for all n≥2.
According to (3), we have
[TABLE]
and so we can write the composition of A∞ morphisms in terms of p−kernels and q−kernels:
[TABLE]
By Definition 1.3, the A∞ homotopy H=(h,H2,H3,\mbox…)
can be rewritten in terms of p−kernels and q−kernels
(we use again ∂Vh=gf−1V−h∂V and (1)n=0):
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We subtract from both sides of the last display
gf∘qn, and by (3.9) conclude
[TABLE]
[TABLE]
[TABLE]
which finally results in
[TABLE]
∎
Remark 3.10*.*
The assumption (3.9) is fulfilled as soon as the q−kernels give a A∞ morphism
φ=(f,φ2,φ3,\mbox…) from (V,∂V,μ2,μ3,\mbox…)
to (W,∂W,ν2,ν3,\mbox…) and f is a monomorphism.
Definition 3.11** (q−kernels, [8]).**
Let n≥2 and define q1:=1V.
We define q−kernels inductively by
[TABLE]
where (ψφ)m=gf∘qm+∑B(m)(−1)ϑ(r1,\mbox…,rk)h∘pk(gf∘qr1⊗\mbox…⊗gf∘qrk) (cf., (16)),
p−kernels were introduced in 3.4, with C(n) given in (C) and ϑ(u1,\mbox…,uk) in (ϑ).
Remark 3.12*.*
There is an explicit description of the q−kernels in terms of rooted plane trees,
but it is much more complicated when compared to the analogous description for the p−kernels.
We shall now prove that the q−kernels introduced in Definition 3.11 satisfy (3.9).
Let us consider again the suspension TsV with the induced codifferential δ such that
δ1=s∘∂V∘ω and
δn=s∘μn∘ω⊗n, n≥2.
Then q^m=s∘qm∘ω⊗m, ψ^m=s∘ψm∘ω⊗m and φ^m=s∘φm∘ω⊗m for m≥2
(∣q^m∣=∣φ^m∣=∣ψ^m∣=0), and (3.9) is equivalent to
[TABLE]
In the following two lemmas we prove that ψ^φ^ is an A∞ morphism.
Lemma 3.13**.**
Let us assume (3.9) is true for all n≤m.
Then the p−kernels in Definition 3.4
and the q−kernels in Definition 3.11 fulfill
[TABLE]
[TABLE]
[TABLE]
for all m≥2.
Proof.
We shall first expand the composition of morphisms in the suspended form
as in (16), and also use the homotopy h^ between g^f^ and
1V:
[TABLE]
[TABLE]
By Theorem 3.6
[TABLE]
[TABLE]
[TABLE]
and as g^,f^ and q^m are of degree [math], we have
[TABLE]
By (3.9) for n≤m, we expand the terms of the form δ1q^∙ as
[TABLE]
[TABLE]
[TABLE]
[TABLE]
In the second contribution (19), which equals to
[TABLE]
[TABLE]
we sum over all inner positions of p^k′(g^f^∘q^r1⊗\mbox…⊗∙⊗\mbox…⊗g^f^∘q^rk′) and get
[TABLE]
[TABLE]
Up to a sign, this is the same expression as the expression on the fourth line of the expansion (18).
We substitute into (17) for ∑B(m)h^∘δ1p^k(g^f^∘q^r1⊗\mbox…⊗g^f^∘q^rk)
the combination \eqrefL222+\eqrefL223 and also substitute for δ1q^m according to (3.9):
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
This completes the proof.
∎
Lemma 3.14**.**
The p−kernels in Definition 3.4
and the q−kernels in Definition 3.11 fulfill
[TABLE]
for all m≥2.
Proof.
By (13), we have
[TABLE]
[TABLE]
Taking into account that g^,f^ and q^m are of degree [math],
the last display equals to
[TABLE]
[TABLE]
and the summation over the terms δk(⋆r1⊗\mbox…⊗⋆rk) in all possible indices (⋆j denoting a map V⊗j→V) gives
[TABLE]
[TABLE]
However this is already (16) composed with the suspension, and the proof is
complete.
∎
Because the formula for the q−kernels in Lemma 3.9 was based on
the assumption (3.9), we have to prove that it is fulfilled by the
q−kernels in Definition 3.11.
Theorem 3.15**.**
The p−kernels in Definition 3.4
and the q−kernels in Definition 3.11
fulfill (3.9), i.e.
[TABLE]
This means that the objects introduced in (9) solve the
problem of the transfer of A∞ structure.
Proof.
We shall prove an equivalent assertion:
[TABLE]
with suspended q−kernels given by Definition 3.11:
[TABLE]
The proof goes by induction on n: for n=2, we have by
(7) (for n=2) and (20):
[TABLE]
[TABLE]
[TABLE]
By the Koszul sign convention
[TABLE]
where (−1)∣δ1∣∣h^∣=−1 is a consequence of ∣h^∣=∣δ1∣=1,
and so
[TABLE]
[TABLE]
[TABLE]
The induction step is divided into three steps:
I. We first expand the term δ1q^n: by (20)
[TABLE]
[TABLE]
[TABLE]
The first summation can be rewritten as
[TABLE]
[TABLE]
while the second as
[TABLE]
[TABLE]
[TABLE]
The summation over all indices in (Q2.1) terms of the form
δk((ψ^φ^)r1⊗\mbox…⊗⋆⊗\mbox…⊗(ψ^φ^)ri−1⊗h^∘q^ri⊗1V⊗k−i) leads to
[TABLE]
[TABLE]
Analogously, the summation over all indices in (Q2.2) terms of the form
δk((ψ^φ^)r1⊗\mbox…⊗⋆⊗1V⊗k−j) gives
[TABLE]
II.
By Lemma 3.14:
[TABLE]
[TABLE]
and Lemma 3.13 for (ψ^φ^)m
(Definition 3.11 and definition of C(n) in (C) imply
that m is strictly less than n, so that assumptions of
Lemma 3.13 are fulfilled by our induction hypothesis) gives
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
where the first five terms come from (Q1.2) by application of Lemma 3.13, and the fifth one cancels out when combined with (Q2.1). Recall that we have ∣δℓ∣=−1 for all
ℓ, and so (−1)∣h^∣∣δℓ∣=−1 as well as
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Thanks to the induction hypothesis we substitute for δ1q^⋆ and the last display turns into
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
The non-numbered terms (first, second and sixth) can be further simplified. We notice
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
By Lemma 3.14, this expression equals to
[TABLE]
III. In the last step we pair various contributions together:
the first step can be written as
[TABLE]
while the second step as
[TABLE]
and
[TABLE]
Taken altogether,
[TABLE]
The proof is complete.
∎
4 Homotopy transfer and the homological perturbation lemma
In the present section we discuss a motivation to find explicit formulas
for the transfer of A∞ algebra structure presented in an apparently
arbitrary form in (9). In the following, we recall the homological
perturbation lemma and show that it gives a recipe to search for
the transfer problem exactly in the form (9). This is the approach with which
we develop and formalize [8, Remark 4].
Lemma 4.1** (Homological perturbation lemma, [1]).**
Let (V,∂V) and (W,∂W) be chain complexes together with
quasi-isomorphisms f:V→W and g:W→V such that
gf−1V=∂Vh+h∂V for a linear map
h:V→V. Let μ:V→V
be a linear map of the same degree as ∂V such that
(∂V+μ)2=0 and the linear map 1V−μh
is invertible (μ is called in this context perturbation.) We define
[TABLE]
where A=(1V−μh)−1μ.
Then (V,∂V+μ) and (W,ν)
are chain complexes and φ:V→V,
ψ:W→W their quasi-isomorphisms with
ψφ−1V=(∂V+μ)H+H(∂V+μ).
In our case, on (V,∂V) we have an additional A∞ structure given by
a collection of multilinear maps μ=(μ2,μ3,\mbox…) fulfilling certain
axioms. In order to regard μ as a perturbation, we have to pass to the (suspended)
tensor algebra generated by V.
Let us consider TsV with a coderivation δV and TsW with a coderivation
δW, F^ and G^ morphisms and H^ a homotopy between G^F^
and the identity on TsV.
Here δV is given by components {s∘∂V∘ω:sV→sV}∪{0:sV⊗n→sV}n≥2 in the sense of Theorem 2.6, and it is
codifferential by Lemma 2.7 because ∂V is a differential on V. Analogous
conclusions do apply to δW.
The map F^:(TsV,δV)→(TsW,δW) is given by
components {s∘f∘ω:sV→sW}∪{0:(sV)⊗n→sW}n≥2
(Lemma 2.9). By Lemma 2.10, F^ is a morphism (f is a map of chain complexes), i.e.
F^∣(sV)⊗n=f^⊗n for f^=s∘f∘ω.
Analogous conclusions apply to G^ as well.
Homotopy H^:TsV→TsV is a map given by
{g^f^:sV→sV}∪{0:(sV)⊗n→sV}n≥2 on the left,
{s∘h∘ω:sV→sV}∪{0:(sV)⊗n→sV}n≥2 in
the middle and {1V:sV→sV}∪{0:(sV)⊗n→sV}n≥2
on the right in the sense of Theorem 2.5.
Because h is a homotopy between gf and 1V, H^ is a homotopy between
G^F^ and the identity on TsV according to Theorem 2.13;
the notation is
h^=s∘h∘ω.
Let δμ be a coderivation on TsV corresponding to
μ, whose components are given by
{0:sV→sV}∪{s∘μn∘ω⊗n:(sV)⊗n→sV}n≥2
in the sense of Theorem 2.16. Because ∂V and μ form an
A∞ structure on V, (δV+δμ)2=0 by Theorem 2.16;
we use the notation δn=s∘μn∘ω⊗n.
The remaining assumption in Lemma 4.1 is the invertibility of the map
1−δμH^. We know
[TABLE]
so that H^((sV)⊗n)⊆(sV)⊗n for all n≥1, and also
δμ∣sV=0 implies
[TABLE]
for all n≥2 with A(n) as in (2). Consequently, for all
n≥2 holds δμ((sV)⊗n)⊆sV⊕\mbox…⊕(sV)⊗n−1, and its iteration results in
(δμH^)n−1((sV)⊗n)⊆sV,
(δμH^)n((sV)⊗n)=0.
By previous discussion and in accordance with Remark 2.3, [1],
[TABLE]
which means that 1−δμH^ is invertible. Now all assumptions of Lemma 4.1
are fulfilled and we can write
[TABLE]
Here we see immediately the motivation for (9):
δμ∑n≥0(H^δμ)n corresponds to
the p^−kernels and ∑n≥1(δμH^)n corresponds
to the q^−kernels. For our purposes it is more convenient to write
[TABLE]
There is a drawback related to these formulas, however: by a direct inspection we see that
δW+δν is not a coderivation in the sense of Theorem 2.6,
φ^ and ψ^ do not define a morphism in the sense of
Lemma 2.9, and H^ does not fulfill the first part of morphism definition
in the sense of Theorem 2.5.
In what follows we prove that on the additional assumptions (see [8, Remark 4]):
[TABLE]
the homological perturbation lemma gives the results compatible with Section 3.
Lemma 4.2**.**
Let us assume the formulas in (23) are satisfied. Then
-
q^n∘g^⊗n=0* for n≥2,*
2. 2.
q^i+1+j∘((g^f^)⊗i⊗h^⊗1V⊗j)=0*
for all i,j≥0, i+j≥1.*
Proof.
(1): The proof goes by induction. By definition
q^2=δ2(g^f^⊗h^)+δ2(h^⊗1V)
for n=2, so that
q^2⊗g^⊗2=δ2(g^f^g^⊗h^g^)+δ2(h^g^⊗g^) and the claim follows from (23) (h^g^=0.)
We assume the assertion is true for all natural numbers less than n∈N (n≥2.)
By definition
[TABLE]
where
[TABLE]
with [[ψ^φ^]]1=g^f^.
In the case ri>1, the composition h^∘q^ri∘g^⊗ri is
trivial by the induction hypothesis. If ri=1, h^∘q^1∘g^=h^g^
is trivial by (23).
(2): The proof is by induction on n=i+1+j. For n=2 we prove
[TABLE]
As we know q^2(h^⊗1V)=(−1)∣h^∣∣h^∣δ2(g^f^h^⊗h^)+δ2(h^h^⊗1V) and q^2(g^f^⊗h^)=δ2(g^f^g^f^⊗h^h^)+δ2(h^g^f^⊗h^), the claim
follows thanks to (23).
Let the claim hold for m≥2 and all natural numbers less than n, we prove it is true for n.
First of all, for n>i′+j′+1≥2 we have
[TABLE]
and also g^f^∘q^1∘h^=g^f^∘h^=0.
By definition
[TABLE]
[TABLE]
and by induction hypothesis q^i′+1+j′∘((g^f^)⊗i′⊗h^⊗1V⊗j′)=0. The last summation can be conveniently rewritten as
[TABLE]
[TABLE]
[TABLE]
and the induction implies q^ru∘((g^f^)⊗⋆⊗h^⊗1V⊗⋆)=0 for ru>1. We already showed
g^f^∘q^ru∘((g^f^)⊗⋆⊗h^⊗1V⊗⋆)=g^f^∘q^1∘h^=0 for ru=1.
We now return back to the main thread of the proof and show
q^n∘((g^f^)⊗i⊗h^⊗1V⊗j)=0.
We consider k,i′,r1,\mbox…,ri′−1,ri′ in C(n) given by (C), and compute
[TABLE]
After substitution for [[ψ^φ^]], there are the following three possibilities
for indices i a i′:
i<r1+\mbox…+ri′−1:
Then there exist 1≤u<i such that
[[ψ^φ^]]ru∘((g^f^)⊗⋆⊗h^⊗1V⊗⋆). For ru≥2 we already proved [[ψ^φ^]]ru∘((g^f^)⊗⋆⊗h^⊗1V⊗⋆)=0, for ru=1
we have [[ψ^φ^]]ru∘((g^f^)⊗⋆⊗h^⊗1V⊗⋆)=g^f^∘h^=0.
r1+\mbox…+ri′−1≤i<r1+\mbox…+ri′:
In the tensor product there
is a term of the form
h^∘q^ri′∘((g^f^)⊗⋆⊗h^⊗1V⊗⋆), which is by the induction hypothesis [math] for ri′>1. If ri′=1, then
h^∘q^ri′∘((g^f^)⊗⋆⊗h^⊗1V⊗⋆)=h^h^ equals to [math] by (23).
r1+\mbox…+ri′≤i:
In this case we get in the tensor product the term of the form
h^∘q^ri′∘(g^f^)⊗ri′=h^∘q^ri′∘g^⊗ri′∘f^⊗ri′, which is trivial for ri′≥2 by (1) of the lemma.
If ri′=1, then h^∘q^ri′∘(g^f^)⊗ri′=h^∘g^f^ equals to zero again by (23).
Because k,i′,r1,\mbox…,ri′−1,ri′ in C(n) was chosen arbitrarily, we get
[TABLE]
and so finally q^n∘((g^f^)⊗i⊗h^⊗1V⊗j)=0.
∎
Remark 4.3*.*
We easily observe:
-
For all n≥2 and for linear mappings {an:(sV)⊗n→sV}n≥1,
[TABLE]
[TABLE]
where B(n) given as in (2),
2. 2.
For all n≥2, we have
[TABLE]
and if h^∘p^1=1V (Definition 3.4) the formula is true for
n=1 as well.
3. 3.
For all n≥1 and 0≤u≤n−1:
[TABLE]
Lemma 4.4**.**
Let us assume (23) is true for n≥2. Then
[TABLE]
Proof.
The proof goes by induction on n. As for n=2 we have p^2=δ2, hence the claim follows.
We now assume the assertion holds for all natural numbers greater than 1 and less than n.
Let us consider 2≤m<n and k,i,r1,\mbox…,ri−1,ri as given in C(m), so that
[TABLE]
whenever u<r1+\mbox…+ri−1 or r1+\mbox…+ri≤u because
h^∘q^ri∘g^⊗ri=0 for all ri≥1
by Lemma 4.2.
We fix n−1≥k≥2,k≥i≥1 and r1,\mbox…,ri−1≥1 as in (C).
As follows from the previous observation, all terms in
[TABLE]
are of the form
δk([[ψ^φ^]]r1∘g^⊗r1⊗\mbox…⊗[[ψ^φ^]]ri−1∘g^⊗ri−1⊗⋆⊗g^⊗k−i) with ⋆ representing a mapping (sV)⊗⋆→sV
(the q^−kernels are given by (20). We can rewrite them in the form
[TABLE]
[TABLE]
where n′=n+i−k−(r1+\mbox…+ri−1), n′>1.
Applying the second point of Remark 4.3 to
[[ψ^φ^]]⋆∘g^⊗⋆,
the inducing hypothesis reduces the last display to
[TABLE]
(we write g^=h^∘p^1∘g^.)
By the first point of Remark 4.3,
[TABLE]
[TABLE]
[TABLE]
so that for each term in the sum there exists u, ru>1 (they are of the form of terms in (26) with n′>1.)
Adding the remaining term δn∘g^⊗n and using the formula (13)
for the p^−kernels, the proof concludes.
∎
Lemma 4.5**.**
Let us assume (23), and also
[TABLE]
to be true for all 2≤m≤n. Then
[TABLE]
[TABLE]
[TABLE]
Proof.
By (24), we have for all m≥2
[TABLE]
(and [[ψ^φ^]]1=g^f^.) We can split
[TABLE]
[TABLE]
in two components and write
[TABLE]
[TABLE]
Because q^n=1V, we have \eqrefL281=g^f^∘q^n
thanks to (27).
As for the second component (29), consider k,r1,\mbox…,rk∈B(n−i+1) for
some i≥2 with B(n−i+1) as in (2). Then
[TABLE]
[TABLE]
[TABLE]
The reason for the appearance of such terms is that when r⋆≥2 and h^ were
in any other q^−kernel than δi, we would get q^r⋆∘((gf)⊗⋆⊗h⊗1V⊗⋆) which is trivial by Lemma 4.2. If r⋆=1,
we get g^f^∘q^1∘h^=0 because
q^1=1V and f^h^=0 by (23).
Thus we have for i≥2:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
where g^f^∘q^r1=g^f^∘q^r1∘(∑v=0r1−11V⊗v⊗δi⊗1V⊗r1−1−v)∘H^∣(sV)⊗r1−1+i. We notice q^m∘(g^f^)⊗m=0
if and only if m=1 (cf., Lemma 4.2.)
Therefore, we expand the second contribution into
[TABLE]
[TABLE]
[TABLE]
and for fixed k,i,r2,\mbox…,ri sum up all terms of the form
h^∘p^k((g^f^∘q^1)⊗k−i⊗g^f^∘q^⋆⊗g^f^∘q^r2⊗\mbox…⊗g^f^∘q^ri) in (29):
[TABLE]
where r′=n−k+i−(r2+\mbox…+ri). We recall
g^f^∘q^r1=g^f^∘q^r1∘(∑u=0r1−11V⊗u⊗δr′−r1+1⊗1V⊗r1−1−u)∘H^∣(sV)⊗r1−1+i and use (27) to get
[TABLE]
Clearly r′>1, and the summation over all terms in (29) leads to
[TABLE]
[TABLE]
[TABLE]
We conclude
[TABLE]
because all terms are as those in (30) and there is always at least one u such that
ru>1 (this is equivalent to r′>1 in (30).) Recall we started with
[TABLE]
[TABLE]
and showed
[TABLE]
Taking into account the definition of [[ψ^φ^]]n in (24), the
desired conclusion follows immediately.
∎
Lemma 4.6**.**
Let us assume (23) to be true. Then for all n≥2
[TABLE]
Proof.
The proof is by the induction hypothesis on n. For n=2, by (31)
we have δ2(g^f^⊗h^)+δ2(h^⊗1V)=δ2∘(g^f^⊗h^+h^⊗1V) which
is certainly true.
We assume the claim is true for all natural numbers greater than
1 and strictly less than n. Let us consider 2≤j<n and
k,i,r1,\mbox…,ri−1,ri as given in C(n−j+1).
The same reasoning as in Lemma 4.5 leads to
[TABLE]
[TABLE]
[TABLE]
Hereby we expanded a general summand in the definition of q^n−j+1 as in
(20), where
[TABLE]
[TABLE]
[TABLE]
In the previous formulas there are no signs whatsoever, because
h^∘q^ri pass through the terms of degree [math], and
h^ in H^ and δj are of degree 1 and −1, respectively,
so that their sign contributions cancel out.
In the next few steps we show how the terms are organized:
I. Let us choose k,i,r1,\mbox…,ri given in C(n) such
that ri>1, and sum up all terms of the form
δk(h^∘p^r1∘(g^f^)⊗r1⊗\mbox…⊗h^∘p^ri−1∘(g^f^)⊗ri−1⊗h^∘q^r⊗1V⊗k−i) out of the summation
[TABLE]
for all allowable r. We get
[TABLE]
where
[TABLE]
Because ri<n, we get by the induction hypothesis
[TABLE]
If ri−1>1, we sum up all terms of the form
δk(h^∘p^r1∘(g^f^)⊗r1⊗\mbox…⊗[[ψ^φ^]]⋆⊗h^∘q^ri⊗1V⊗k−i):
[TABLE]
with
[TABLE]
Because ri<n, by the induction hypothesis is Lemma 4.5
fulfilled and the last display reduces to
[TABLE]
[TABLE]
The sum of the last display and (33) results in
[TABLE]
which is the same expression as for ri−1=1 because [[ψ^φ^]]ri−1=h^∘p^ri−1∘(g^f^)ri−1
in this case.
Repeating this procedure, we arrive at
δk([[ψ^φ^]]r1⊗\mbox…⊗[[ψ^φ^]]ri−1⊗h^∘q^ri⊗1V⊗k−i).
We summarize the previous considerations: for k,i,r1,\mbox…,ri as in
C(n) such that ri>1, we have
[TABLE]
II. Let us choose k,i,r1,\mbox…,ri as in C(n) such that i>1, ri=1,
and there exists 1≤u≤i−1 such that ru>1 and ru+1=\mbox…=ri−1=1. Then
[TABLE]
with
[TABLE]
By Lemma 4.4
[TABLE]
which can be justified in the same way as in the first step I.
We expand all terms in the summation (denoted (32))
[TABLE]
and use (34) a (35) to rewrite terms in the definition of q^n:
[TABLE]
[TABLE]
Certainly,
[TABLE]
which together with (20) completes the proof.
∎
Remark 4.7*.*
Adopting slight changes in the proofs, our claims can be reformulated as follows:
Lemma 4.4:
On the assumption (23) holds for
all n≥2
[TABLE]
where we write h^∘p^r1∘g^⊗r1⊗\mbox…⊗h^∘p^rk
instead of δk(h^∘p^r1∘g^⊗r1⊗\mbox…⊗h^∘p^rk)
and [[ψ^φ^]]r1⊗\mbox…⊗[[ψ^φ^]]ri−1⊗h^∘q^ri⊗1V⊗k−i instead of δk([[ψ^φ^]]r1⊗\mbox…⊗[[ψ^φ^]]ri−1⊗h^∘q^ri⊗1V⊗k−i);
Lemma 4.5:
On the assumption (23) holds for all n≥2
[TABLE]
where we write
f^∘q^r1⊗\mbox…⊗f^∘q^rk instead of h^∘p^k(g^f^∘q^r1⊗\mbox…⊗g^f^∘q^rk);
Lemma 4.6:
On the assumption (23), we have for all n≥2
[TABLE]
where we write [[ψ^φ^]]r1⊗\mbox…⊗[[ψ^φ^]]ri−1⊗h^∘q^ri⊗1V⊗k−i
instead of
δk([[ψ^φ^]]r1⊗\mbox…⊗[[ψ^φ^]]ri−1⊗h^∘q^ri⊗1V⊗k−i).
Theorem 4.8**.**
On the assumption (23), the formulas produced by the homological
perturbation lemma (22) fulfill
[TABLE]
[TABLE]
[TABLE]
[TABLE]
for all n≥2. In particular, δW+δν is a codifferential, ψ^, φ^ are morphisms and H^ is a homotopy between
ψ^φ^ and 1. When expressed in terms of A∞ algebras,
the relevant objects fulfill (9).
Proof.
We already noticed
[TABLE]
[TABLE]
(3) & (1): We prove by the induction hypothesis (3). For n=2,
we get by (22)
[TABLE]
[TABLE]
Let us assume (3) holds for all natural number greater than 1 and less than n.
Because δμH^ decreases the homogeneity,
[TABLE]
[TABLE]
[TABLE]
The mapping (∑u=0n−i1V⊗u⊗δi⊗1V⊗n−i−u)∘H^∣(sV)⊗n is of homogeneity n−i+1, so
(22) allows us to rewrite the last result as
[TABLE]
[TABLE]
and the combination of induction hypothesis φ^∣(sV)⊗n−i+1
and Lemma 4.6, (37), gives the required form
[TABLE]
Let us remark that (22) gives for all n≥2
[TABLE]
[TABLE]
Choosing 2≤j≤n−1, Lemma 4.2 implies
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We take into account (23), f^g^=1W,
and sum up over all terms of the form
1W⊗⋆⊗⋆⊗1W⊗⋆:
[TABLE]
[TABLE]
[TABLE]
The application of Lemma 4.4 concludes the proof.
(4) & (2): Similarly to the previous part of the proof, we first
concentrate on (4) and then derive (2). For n=2,
it follows from (22)
[TABLE]
[TABLE]
By the induction hypothesis, we assume (4) holds for all natural numbers greater than
1 and less than n. We can write
[TABLE]
[TABLE]
Thanks to the induction hypothesis we can expand H^∣(sV)⊗n−i+1, and
apply Lemma 4.6 together with (38):
[TABLE]
which completes the proof of the first assertion.
Now we use again (22) for n≥2:
[TABLE]
[TABLE]
A consequence of Lemma 4.2, 2≤j≤n−1 arbitrary, is
[TABLE]
[TABLE]
[TABLE]
[TABLE]
because h^∘q^m∘g⊗m=0 for all m≥1.
In other words, if δ⋆ in the last summation would not fit into
h^∘q^⋆ the corresponding term will be trivial.
The summation then leads to
[TABLE]
[TABLE]
[TABLE]
[TABLE]
In order to finish the proof, we remind the equality
h^∘p^1=1V and use
Lemma 4.4.
∎
Acknowledgments
The present article is based on the thesis by the author. The author wants to thank Petr Somberg very much for his great help in preparing this text for publication − if it hadn’t been for it, this article would have never come to being.