Qp = prune QQp = minimalPresentation Qprune Q proceeds in two steps. First, it prunes the relations submodule Q.subDGModule using prune(DGSubmodule); this trims redundant columns from the inclusion matrix. If the inclusion was already minimal, Qp === Q.
Second, it computes prune (toComplex Qp) at the complex level and caches the result in Qp.cache under the symbol prunedComplex. After this, calling toComplex Qp returns a minimally presented complex and pruning commutes with toComplex: the complex-level prune of toComplex Qp is idempotent.
A pruningMap from Qp to Q is cached in Qp.cache as a DGModuleMap induced by the identity on M.natural.
|
|
|
|
|
|
|
|
If the cokernel is secretly zero, pruning collapses toComplex Qp to the zero complex, matching prune applied to Complex objects from the Complexes package on Complex.
minimalPresentation is a synonym for prune on DG quotient modules.
The source of this document is in /build/reproducible-path/macaulay2-1.26.05+ds/M2/Macaulay2/packages/DGAlgebras/doc.m2:4682:0.