If k is 0, then the zero map is constructed. If k is 1, then M and N should have the same number and degrees of generators in the sense that the modules cover M and cover N are equal, and then the map which sends the i-th generator of N to the i-th generator of M is constructed (and it may not be well-defined). Otherwise, M and N should be equal, or at least have the same number of generators.
i1 : R = QQ[x,y]; |
i2 : M = image vars R |
i3 : N = coker presentation M |
i4 : f = map(M,N,1) |
i5 : isWellDefined f |
i6 : isIsomorphism f |
i7 : g = map(M,cover M,1) |
i8 : isWellDefined g |
i9 : isIsomorphism g |
i10 : h = map(cover M,M,1) |
i11 : isWellDefined h |
See also map(Module,Module,RingElement), map, and matrix.