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 -10301a4-13877a3b+14913a2b2-7416a3c+2031a2bc-10971a2c2-c4 {7} | a2 0 1339a4+8661a3b+4147a2b2+10076a3c+9551a2bc+11359a2c2 {8} | 0 a2 10689a3+8071a2b-9986a2c ------------------------------------------------------------------------ 0 | 0 | -10301a2b3-13877ab4+14913b5-7416ab3c+2031b4c-10971b3c2 | 1339a2b3+8661ab4+4147b5+10076ab3c+9551b4c+11359b3c2+d5 | 10689ab3+8071b4-9986b3c-c4 | 5 4 o6 : Matrix S <--- S |
i7 : isSyzygy(coker EG,2) o7 = true |