isWellDefined f
Maps between simplicial complexes are welldefined if the image of every face is contained in a face. In this package, vertices of abstract simplicial complexes are identified with a subset of the variables in a fixed polynomial ring and each face is identified with monomials in those variables. Consequently, a map between simplicial complexes is given by a map between the respective polynomial rings.
This method determines whether the underlying ring map correctly defines a simplicial map. In particular, it checks if variables are sent to variables, and that the image of each monomial corresponding to a face in the source divides some monomial corresponding to a face in the target (i.e. the image of a face is contained in a face).





The constructors in this package have no guarantee to be well defined; the data defining a simplicial map is a ring map between the corresponding polynomial rings, which could have no relation to the two complexes. By making the current debugging level greater than one, one gets some additional information about the nature of the failure.






This method also checks the following aspects of the data structure: