f = map(D, C, H)
A map of complexes $f : C \rightarrow D$ of degree $d$ is a sequence of maps $f_i : C_i \rightarrow D_{d+i}$. No relationship between the maps $f_i$ and and the differentials of either $C$ or $D$ is assumed.
We construct a map of chain complexes by specifying the individual maps between the terms.
|
|
|
|
|
|
|
|
|
The keys in the hash table index the terms in the source of the map. If a key is missing, that map is taken to be the zero map. We illustrate by constructing a map of chain complexes having nonzero degree, and omitting one key in the hash table.
|
|
|
|
|
|
|
|
|
|
|
|
|
This is the primary constructor used by all of the more user friendly methods for constructing a chain complex.
This constructor minimizes computation and does very little error checking. To verify that a complex is well constructed, use isWellDefined(ComplexMap).