dn = moduleDifferential(n, M)Two code paths are used internally:
When M comes from koszulComplexDGM (so M.module is set) and every generator differential is zero, d_n is the tensor product polyDifferential(n, A) \otimes id_{M.module}. This is the fast path.
For general free DG modules, d_n is computed monomial-by-monomial via the Leibniz rule, extracting A.ring-linear coefficients in the target basis. Results are cached per hom-degree in M.cache.diffs.
|
|
|
|
|
|
|
Every column of d_{n-1} d_n is zero, which is the d^2 = 0 condition.
Raises an error on non-free DG modules (for example, the natural module of a DGQuotientModule). In that setting, compute the differential at the element level via diff(Q, v) or work with dgComplex.
The object moduleDifferential is a method function.
The source of this document is in /build/reproducible-path/macaulay2-1.26.05+ds/M2/Macaulay2/packages/DGAlgebras/doc.m2:6111:0.