h = homology(f, n)Computed via inducedMap from the chain map toComplexMap(f, n) applied to the pair of per-degree homology modules. Since a chain map sends cycles to cycles and boundaries to boundaries, the induced map is well defined.
The identity DG module map induces the identity on each H_n; the zero DG module map induces the zero map on each H_n. Composition respects homology: homology(g * f, n) == homology(g, n) * homology(f, n).
|
|
|
|
|
|
|
|
|
|
Multiplication by x on a minimal semifree resolution of k = R/(x, y) induces the zero map on H_0 = k, because x kills k.
|
|
|
|
The source of this document is in /build/reproducible-path/macaulay2-1.26.05+ds/M2/Macaulay2/packages/DGAlgebras/doc.m2:4354:0.