6.6 Proof of the theorem [03SH]
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.6 Proof of the theorem
For simplicity we will assume that all local systems are trivial and have rank one. The general case is completely similar.
We are going to construct the following chain of -equivalences connecting and :
Classes of objects of all these categories will be the same, and all functors will be identical on objects.
The -pre-category is in fact a dg-category, i.e. all sequences of objects are transversal, compositions vanish for and it has strict identity morphisms. The space is defined as Clearly the space of morphisms does not depend on objects. Using the wedge product of differential forms we make into a dg-category over the field . There is a natural functor , which is the identity map on objects. On morphisms it is the natural embedding of as the subspace of forms on , which are pullbacks of forms on . Clearly it establishes an equivalence of -categories.
The -pre-category is defined as the full subcategory of , and it differs from the latter only by the choice of transversal sequences. Namely, we use the same notion of transversality in as in the Morse category.
The next -pre-category is obtained from by applying homological perturbation theory. For any two transversal objects of we define as . Here is the projector corresponding to the Morse function , it was described at the end of the previous subsection. We also have homotopies associated with . Then formulas of homological perturbation theory (summation over trees) give rise to an -pre-category and an equivalence .
The last functor will have no non-trivial higher components for . The first component of it is a linear map
for every transversal pair . Recall that has a basis labeled by critical points . We define as . It is clear that gives a quasi-isomorphism of complexes for every transversal pair .
Now, we claim that is an -functor. This means that maps all higher compositions in to higher compositions in . This follows directly from the descriptions of higher compositions in both categories in terms of planar trees and the lemma in the previous subsection. Indeed, the number of functions in any given sequence is finite. For all sufficiently small every summand in the formula for , corresponding to a binary tree , coincides with the summand for corresponding to the same (we can assume that is so small that the part 2) of the Lemma can be applied). The theorem is proved.