Chain duality for categories over complexes
Abstract
We show that the additive category of chain complexes parametrized by a finite simplicial complex forms a category with chain duality. This fact, never fully proven in the original reference (Ranicki, 1992), is fundamental for Ranicki’s algebraic formulation of the surgery exact sequence of Sullivan and Wall, and his interpretation of the surgery obstruction map as the passage from local Poincaré duality to global Poincaré duality.
Our paper also gives a new, conceptual, and geometric treatment of chain duality on -based chain complexes.
Dedicated to Dennis Sullivan on the occasion of his 80th birthday.
Keywords: Chain duality, assembly, controlled surgery, -theory, dual cell decomposition, -dissection.
1 Introduction
Kervaire and Milnor [KM] developed and applied the new field of surgery to classify exotic smooth structures on spheres. Browder and Novikov independently extended and relativized the theory. Sullivan in his thesis [Sullivan-thesis] investigated the obstruction theory for deforming a homotopy equivalence to a homeomorphism. In seminar notes [Sullivan-Notes] written shortly after his thesis, Sullivan’s Theorem 3 packaged this in what is now called the surgery exact sequence. (We will be ahistorical and concentrate on topological manifolds; Kervaire-Milnor concentrated on smooth manifolds and Sullivan on PL-manifolds. The extension to topological manifolds is due to the deep work of Kirby and Siebenmann [KS].). It was extended to the nonsimply-connected case and to the case of compact manifolds by Wall [Wall]. The surgery exact sequence for a closed -dimensional manifold with is
The object one wants to compute is the structure set , first defined by Sullivan. Representatives of the structure set are given by (simple) homotopy equivalences from a closed -manifold to . Computing the structure set is the key ingredient in computing the manifold moduli set, the set of homeomorphism types of -manifolds homotopy equivalent to . The beauty of the surgery exact sequence is marred by many flaws. One is that it is an exact sequence of pointed sets. Another flaw is standard with a long exact sequence, to do computations one needs to compute the surgery obstruction map , including its domain, the normal invariants , and its codomain, the -groups. For many fundamental groups (e.g. finite groups or finitely generated abelian groups) one can compute the -groups algebraically. Sullivan, in his thesis, analyzed the normal invariants, using transversality to establish a bijection . He also computed the homotopy groups which vanish for odd, have order 2 for , and are infinite cyclic for (this follows from the generalized Poincaré conjecture). Furthermore, Sullivan analyzed the homotopy type of and established Sullivan periodicity, . This then determines an -spectrum and its 1-connective cover . There is a formal identification .
The surgery exact sequence is now becoming more presentable, but it is still marred by functoriality issues: the -groups are covariant in , the normal invariants are contravariant in , and the structure set has no obvious variance at all. Furthermore it is only defined for manifolds, and one would like an abelian group structure. These flaws make computing the surgery obstruction map difficult. Quinn’s [Quinn] vision (largely carried out by Ranicki [bluebook], see also [KMM]) is to find a bijection between the surgery exact sequence and a long exact sequences of abelian groups defined for every space and fully covariant in . In more detail, there is the following commutative diagram
where the vertical maps labelled are bijections when is a closed -manifold and the bottom two horizontal lines are exact sequences of abelian groups, defined for any space . These two lines are called the 1-connective algebraic surgery exact sequence and the algebraic surgery exact sequence, respectively. The maps and are called assembly maps; they are defined at the spectrum level. Hence there is a long exact sequence of homotopy groups, where the algebraic structure groups are defined be to the homotopy groups of the cofiber of the assembly maps. The map is conjectured to be an isomorphism when with torsionfree.
There are myriad ways of constructing the assembly maps (the construction in [DL98] seems best for computations). Different constructions are identified via axiomatics (see [WW], also [DL98]). Ranicki’s version of assembly, needed for his approach to the above diagram, was motivated by his earlier work with Weiss [RW] viewing the assembly maps as a passage from local to global Poincaré duality. Much earlier Ranicki [ats1] reinterpreted Wall’s algebraic -groups as bordism groups of algebraic Poincaré complexes over the group ring . This is the global Poincaré duality. The local Poincaré duality comes from making a geometric degree one normal map transverse to the dual cones of (see Section 3 for the definition). These degree one normal maps to the cones are then assembled to give the original degree one normal map.
More precisely, Ranicki [bluebook] defined the notion of an additive category with chain duality , the associated algebraic bordism category (see his Example 3.3), and the corresponding -groups (see his Definition 1.8). In his notation, the assembly map is given by establishing a map of algebraic bordism categories (see his Proposition 9.11)
and defining the assembly map to be the induced map on -groups. However, one flaw in his argument is that he never provided a proof that is an additive category with chain duality, despite his assertion in Proposition 5.1 of [bluebook]. Our modest contribution to this saga is to provide a self-contained, conceptual, and geometric proof that is an additive category with chain duality.
We are not the first to provide a proof of this result – one is given in Section 5 of [Spiros-Tibor]. However, we found the proof and its notation rather dense. Another account of this result is given in a recent preprint of Frank Connolly [Frank]. Although his aims are quite similar to ours, the approach is different, the reader may wish to compare.
We now outline our paper. In Section 2 we review Ranicki’s notion of an additive category with chain duality, this is an additive category with a chain duality functor satisfying a chain homotopy equivalence condition. In Section 3 we fix a finite simplicial complex (e.g. a triangulation of a compact manifold), and we define Ranicki’s additive categories of -based chain complexes. Here we need to warn the reader that we have deviated from Ranicki’s notation in [bluebook], which we found difficult to use. A comparison between our notation and Ranicki’s is given in Remark LABEL:R_notation. The two key additive categories are and . The latter category is the one whose -theory gives the normal invariants, so is perhaps more important. The simplicial chain complex gives an object of and the simplicial cochain complex gives an object of . More generally, given a CW-complex with a -dissection, the cellular chains give an object of and given a CW-complex with a -dissection, the cellular chains give an object of . We related this to dual cell decompositions, defined even when is not a manifold. In Section LABEL:sec:cat_point_of_view, we develop homological algebra necessary for our proof that these categories admit a chain duality.
Section LABEL:sec:dual_cell may be of independent interest. For a finite simplicial complex , we define the dual cell decomposition which is a regular CW-complex refining the simplicial structure on . Corollary LABEL:varepsilon_is_a_weak_eq and Remark LABEL:two-sided say that this, in some sense, gives a two-sided bar resolution for the category of posets of .
Finally, in Section LABEL:K-based_chain_duality we define chain duality functors on and and prove our main theorem.
Theorem 1.
The following are additive categories with chain duality
2 Chain Duality
For a category , write when is an object of and for the set of morphisms from to . A preadditive category is a category where all morphism sets are abelian groups and composition is bilinear. An additive category is a preadditive category which admits finite products and coproducts. An example of an additive category is the category of finitely generated free abelian groups.
Let be an additive category and let be the category of finite chain complexes over where finite means that for all but a finite number of . Homotopy notions make sense in this category: the notions of two chain maps being chain homotopic, a chain map being a chain homotopy equivalence, two chain complexes being chain homotopy equivalent, and a chain complex being contractible. The notion of homology of a chain complex over an additive category does not make sense.
Let be the category of finite bigraded chain complexes over . There are functors
where and . (Throughout this paper, if the differentials are standard or can be easily determined, we omit them for readability). If and are finite chain complexes over an additive category , then
is a chain complex of abelian groups with differentials
A 0-cycle is a chain map; the difference of chain maps is a boundary if and only if the chain maps are chain homotopic. In particular, there is a monomorphism of abelian groups .
If and are chain complexes of abelian groups, then there is a chain complex with differentials
Definition 2.
A chain duality functor on an additive category is an additive functor together with a natural chain map
defined for each pair of chain complexes so that in the sense that .
Remark 3.
By restricting to 0-cycles, the natural chain map induces a natural isomorphism of abelian groups
Lemma 4.
Let be a chain duality functor on . For , let be . This defines a natural transformation
so that for each object ,
Proof.
Suppose and are chain maps. Then naturality of implies that
Thus
∎
It is also true, conversely, that an additive functor and natural transformation satisfying for all determines a chain duality functor where , but we omit the proof of this fact.
Definition 5.
A chain duality on an additive category is a chain duality functor so that is a chain homotopy equivalence for all .
This is equivalent to the definition in Andrew Ranicki’s book [bluebook, Definition 1.1]. Notice that a chain duality functor does not necessarily give a chain duality, because of the extra condition that is a chain homotopy equivalence. We separately defined a chain duality functor because there can be uses for the weaker notion, for example, see the thesis of Christopher Palmer [P15].
3 -based chain complexes
Let be a finite set.
Definition 6.
An abelian group is -based if it is expressed as a direct sum
A morphism of -based abelian groups is simply a homomorphism of the underlying abelian groups and . Equivalently, it is a collection of homomorphisms .
In our exposition, we choose to work with being an abelian group. However, everything we say (and everything Ranicki says in [bluebook]) generalizes to the context of -modules where is a ring with involution.
When the set is a finite poset, we are interested in a subcategory of the -based abelian groups.
Definition 7.
Let be a finite poset.
The objects of are the -based abelian groups
where is a finitely generated free abelian group for each . A -based morphism is a morphism in if, for all ,
The slogan for morphisms is “bigger to smaller.”
Let be a finite simplicial complex. There is an associated poset, also called , whose objects are the simplices of and whose morphisms are inclusions: means . Our quintessential examples of a poset will be either or . Our convention will be that means and we will try and minimize the use of . The simplicial chain complex illustrates the bigger-to-smaller slogan. Here , with
Since duality is the fundamental feature of this paper, we introduce it immediately.
Definition 8.
Let be a finite poset. The duality functor
is defined on objects by
where . There is a natural isomorphism
with induced by given by . The duality functor and natural isomorphism extend to chain complexes
with .
This definition illustrates some of our notational conventions. We write (and not ) to denote a chain complex. We use (and not ) so that the dual is also a chain complex, whose differential has degree minus one. There are also sign conventions on the differential; we follow the sign conventions of Dold [Dold]: the differential is given by .
The simplicial cochain complex of a finite simplicial complex illustrates the -slogan “smaller-to-bigger.”
Definition 9.
Let be a finite simplicial complex and let be a finite CW-complex.
-
1.
A -dissection of is a collection of subcomplexes of so that
-
(a)
-
(b)
.
-
(a)
-
2.
A -dissection of is a collection of subcomplexes of so that
-
(a)
-
(b)
.
-
(a)
Here is the smallest simplex of which contains and , if it exists. Note that in a -dissection implies that , while in a -dissection, implies that .
Remark 10.
The -dissections described here are -dissections in Ranicki’s terminology.
Example 11.
The geometric realization of a finite simplicial complex has both a -dissection given by the geometric realization of the simplices and a -dissection given by the dual cones of simplices. We describe the latter in order to fix notation.
Let be the barycentric subdivision of . The vertices of are the barycenters of the geometric realization of the simplices . An -simplex in is given by a sequence where , and is a subdivision of (see Chapter 3, Section 3 of Spanier [S66] for the definition of a subdivision); in particular there is a PL-homeomorphism . For , the dual cell is the union of the geometric realization of all simplices of the barycentric subdivision so that . Define the dual cone of to be . Then gives a -dissection of the geometric realization of .
With a -simplex, Figure 1 shows a and dissection of the geometric realization of a -simplex.
2pt
\pinlabel at 47 50
\pinlabel at 5 67
\pinlabel at 87 67
\pinlabel at 45 155
\pinlabel at 15 112
\pinlabel at 77 112
\pinlabel at 52 108
\pinlabel at 47 67
\pinlabeldual cells at 170 50
\pinlabel at 150 85
\pinlabel at 190 85
\pinlabel at 170 115
\pinlabel at 130 67
\pinlabel -dissection at 305 110
\pinlabel at 285 141
\pinlabel at 322 141
\pinlabel at 303 170
\pinlabel-dissection at 305 -10
\pinlabel at 265 03
\pinlabel at 352 03
\pinlabel at 309 87
\pinlabel at 273 43
\pinlabel at 341 43
\pinlabel at 309 03
\pinlabel at 308 35
\endlabellist