On 8 nov, 19:34, andrew ewart <[email protected]> wrote: > I want to write code that does the following > Given ideals I,J in CC[x1,...,xn] > check if Radical(I+J)=Radical(I)+Radical(J) > also maybe throw in an example of yes and no just to see it working > > Radical(I)={f:there is an m such that f^m is in I} (f is a polynomial > of CC[x1,...,xn] > also Radical(I)=I(V(I)) by Nullstellensatz
You can do sage: K.<x,y,z,t> = QQ[] sage: I = Ideal(K.random_element(), K.random_element()) sage: J = Ideal(K.random_element(), K.random_element()) sage: (I+J).radical() == I.radical() + J.radical() True It uses Singular to compute this. Take into account that radical computations are very hard problems, so this is slow for big problems. Check in the documentation the kind of operations you can do with ideals. Luis -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
