The package exposes three families of predicates for checking conditions that distinguish DG objects from their underlying graded / module-theoretic data.
isWellDefined — verifies that an object satisfies the DG axioms appropriate to its type. For a DGAlgebra or DGModule, the central check is that the stored differential squares to zero on every generator. For a DGSubmodule or DGQuotientModule, the check is d-closure of the defining submodule; for a DGAlgebraMap or DGModuleMap, the check is the chain-map condition d \circ f = f \circ d on every generator.
isAcyclic — returns true when a DG algebra or DG module has H_i = 0 for all i >= 1 up to a finite bound. For objects with infinite hom-degree the user must supply EndDegree.
isQuasiIsomorphism — returns true when a DG algebra map or DG module map induces an isomorphism on H_*. The underlying check is performed on toComplexMap and inherits the Concentration option from the Complexes package.
All three predicates accept the option EndDegree where applicable; for finite-degree objects the default bound is maxDegree of the object and no option is required.
|
|
|
|
|
|
|
|
|
|
|
|
|
For a regular polynomial ring the Koszul DG algebra is acyclic and its identity map is a quasi-isomorphism. Both S and Q = M / S are well-defined because S is d-closed.
The source of this document is in /build/reproducible-path/macaulay2-1.26.05+ds/M2/Macaulay2/packages/DGAlgebras/doc.m2:4897:0.