The routine reduces the target of M by elementary moves (see elementary) involving just d+1 variables. The outcome is probabalistic, but if the routine fails, it gives an error message.
i1 : kk=ZZ/32003 o1 = kk o1 : QuotientRing |
i2 : S=kk[a..e] o2 = S o2 : PolynomialRing |
i3 : i=ideal(a^2,b^3,c^4, d^5) 2 3 4 5 o3 = ideal (a , b , c , d ) o3 : Ideal of S |
i4 : F=res i 1 4 6 4 1 o4 = S <-- S <-- S <-- S <-- S <-- 0 0 1 2 3 4 5 o4 : ChainComplex |
i5 : f=F.dd_3 o5 = {5} | c4 d5 0 0 | {6} | -b3 0 d5 0 | {7} | a2 0 0 d5 | {7} | 0 -b3 -c4 0 | {8} | 0 a2 0 -c4 | {9} | 0 0 a2 b3 | 6 4 o5 : Matrix S <--- S |
i6 : EG = evansGriffith(f,2) -- notice that we have a matrix with one less row, as described in elementary, and the target module rank is one less. o6 = {5} | c4 d5 0 {6} | -b3 0 d5 {7} | 0 -b3 -11008a4+4864a3b+244a2b2+9664a3c-15641a2bc+10028a2c2-c4 {7} | a2 0 -1224a4+15181a3b-1022a2b2-15550a3c+6905a2bc-5153a2c2 {8} | 0 a2 16000a3-6700a2b-2769a2c ------------------------------------------------------------------------ 0 | 0 | -11008a2b3+4864ab4+244b5+9664ab3c-15641b4c+10028b3c2 | -1224a2b3+15181ab4-1022b5-15550ab3c+6905b4c-5153b3c2+d5 | 16000ab3-6700b4-2769b3c-c4 | 5 4 o6 : Matrix S <--- S |
i7 : isSyzygy(coker EG,2) o7 = true |