This function finds a submatrix of size $n\times n$ using findANonZeroMinor; it extracts the last entry of the output, finds its determinant and adds it to the ideal $I$, thus extending $I$.
i1 : R = ZZ/5[x,y,z]; |
i2 : I = ideal(random(3,R)-2, random(2,R)); o2 : Ideal of R |
i3 : M = jacobian(I); 3 2 o3 : Matrix R <--- R |
i4 : extendIdealByNonZeroMinor(2,M,I, Strategy => LinearIntersection) 3 2 3 2 2 2 2 3 o4 = ideal (- 2x - 2x*y - 2y + x z - y z + 2x*z - 2y*z - 2z - 2, - 2x*z ------------------------------------------------------------------------ 2 2 2 2 2 + 2y*z - 2z , - 2x z + 2x*y*z - y z - x*z + y*z ) o4 : Ideal of R |
One use for this function can be in showing a certain rings are R1 (regular in codimension 1). Consider the following example which is R1 where computing the dimension of the singular locus takes around 30 seconds as there are 15500 minors of size $4 \times 4$ in the associated $7 \times 12$ Jacobian matrix. However, we can use this function to quickly find interesting minors.
i5 : T = ZZ/101[x1,x2,x3,x4,x5,x6,x7]; |
i6 : I = ideal(x5*x6-x4*x7,x1*x6-x2*x7,x5^2-x1*x7,x4*x5-x2*x7,x4^2-x2*x6,x1*x4-x2*x5,x2*x3^3*x5+3*x2*x3^2*x7+8*x2^2*x5+3*x3*x4*x7-8*x4*x7+x6*x7,x1*x3^3*x5+3*x1*x3^2*x7+8*x1*x2*x5+3*x3*x5*x7-8*x5*x7+x7^2,x2*x3^3*x4+3*x2*x3^2*x6+8*x2^2*x4+3*x3*x4*x6-8*x4*x6+x6^2,x2^2*x3^3+3*x2*x3^2*x4+8*x2^3+3*x2*x3*x6-8*x2*x6+x4*x6,x1*x2*x3^3+3*x2*x3^2*x5+8*x1*x2^2+3*x2*x3*x7-8*x2*x7+x4*x7,x1^2*x3^3+3*x1*x3^2*x5+8*x1^2*x2+3*x1*x3*x7-8*x1*x7+x5*x7); o6 : Ideal of T |
i7 : M = jacobian I; 7 12 o7 : Matrix T <--- T |
i8 : i = 0; |
i9 : J = I; o9 : Ideal of T |
i10 : elapsedTime(while (i < 10) and dim J > 1 do (i = i+1; J = extendIdealByNonZeroMinor(4, M, J)) ); -- 0.939718 seconds elapsed |
i11 : dim J o11 = 1 |
i12 : i o12 = 5 |
In this particular example, there tend to be about 5 associated primes when adding the first minor to J, and so one would expect about 5 steps as each minor computed most likely will eliminate one of those primes.
There is some similar functionality obtained via heuristics (as opposed to actually finding rational points) in the package "FastLinAlg".
The object extendIdealByNonZeroMinor is a method function with options.