Loading [MathJax]/jax/output/HTML-CSS/jax.js
Ask Your Question
2

ideal membership and solution

asked 6 years ago

arpit gravatar image

I gave sage the following ring and the ideal

R.<x,y,z>=GF(2)[];
f=1 + z + y*z + y^2*z + z^2 + y*z^2; 
g=1 + x + y^2 + z^2;
I = R.ideal(f,  g)

I found that the function h below lies in the Ideal I using

h=1 + y + z + x*z + y*z + x*y*z + y^2*z + y*z^2;
h in I

I know that in general, finding polynomials a(x) and b(x) such that h=af+bg might be hard, but can I find the solutions for a and b to a certain degree of these polynomials, if they exist? I was wondering if sage can check this more efficiently

Preview: (hide)

1 Answer

Sort by » oldest newest most voted
1

answered 6 years ago

rburing gravatar image

Yes, this can be done algorithmically. First you compute a Groebner basis g1,,gr of I, and remember the expressions gi=aif+big. Then you do multivariate polynomial division of h by g1,,gr. This yields h=c1g1++crgr=(c1a1+crar)f+(c1b1+crbr)g.

In your example one Groebner basis of I is f,g,f1,f2,f3 where f1=S(f,g)=fzg, f2=S(f1,f)zg=(yz)fz(y+1)g, f3=S(f1,f2)=(xz(yz))f+z(z(y+1)x)g. Multivariate polynomial division of h by f,g,f1,f2,f3 yields h=f+f2=(yz+1)fz(y+1)g.

This can all easily be automated in Sage (but I don't have time to do it now).

Preview: (hide)
link

Comments

@rburing thanks for the answer. This is useful. How do I do the last step of multivariate polynomial division in Sage?

arpit gravatar imagearpit ( 6 years ago )

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

Stats

Asked: 6 years ago

Seen: 806 times

Last updated: Mar 28 '19