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 -14090a4-7091a3b+9318a2b2-4099a3c-12060a2bc-10055a2c2-c4 {7} | a2 0 -501a4-643a3b-12807a2b2-4069a3c-10329a2bc+6460a2c2 {8} | 0 a2 -14094a3-8343a2b-2140a2c ------------------------------------------------------------------------ 0 | 0 | -14090a2b3-7091ab4+9318b5-4099ab3c-12060b4c-10055b3c2 | -501a2b3-643ab4-12807b5-4069ab3c-10329b4c+6460b3c2+d5 | -14094ab3-8343b4-2140b3c-c4 | 5 4 o6 : Matrix S <--- S |
i7 : isSyzygy(coker EG,2) o7 = true |