isWellDefined f
A map of chain complexes $f : C \to D$ of degree $d$ is a sequence of maps $f_i : C_i \to D_{d+i}$. No relationship is required between these maps and the differentials in the source and target.
This routine checks that $C$ and $D$ are well-defined chain complexes, and that, for each $f_i$, the source and target equal $C_i$ and $D_{d+i}$, respectively. If the variable debugLevel is set to a value greater than zero, then information about the nature of any failure is displayed.
Unlike the corresponding function for Complexes, the basic constructors for complex maps are all but assured to be well defined. The only case that could cause a problem is if one constructs the source or target complex, and those are not well defined.
|
|
|
|
|
|
|
|
|
We construct two random maps of chain complexes, and check to see that, as should be the case, both are well defined.
|
|
|
|
|
|
This method also checks the following aspects of the data structure: