t = testWalker M
Verifies Walker's Theorem for a finite length graded module over a polynomial ring of char not 2: (2^(codim M)*length M + sum toList (excess M)) == (sum of the betti numbers of M)*(length M)
Returns an error if any homology has infinite length
The object testWalker is a function closure.
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/ChainComplexOperations.m2:398:0.