isWellDefined fA map of simplicial modules $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 face/degeneracy maps in the source and target.
This routine checks that $C$ and $D$ are well-defined simplicial modules, 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 SimplicialModules, the basic constructors for simplicial module 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 simplicial modules, 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:
The source of this document is in /build/reproducible-path/macaulay2-1.26.05+ds/M2/Macaulay2/packages/SimplicialModules/SimplicialModuleDOC.m2:1691:0.