online advertising
Processing math: 100%

Saturday, January 16, 2016

UTM Ideals Varieties and Algorithm - Chapter 1 Section 4 Exercise 13

Problem:


Solution:

Another interesting problem. Now we are in the arena of finite fields.

Part (a) is simple. First, we denote that f(x)=x2x, g(y)=y2y. We can simply check that f(0)=f(1)=0, g(0)=g(1)=0.

Any polynomial px2x,y2y has the form a(x,y)f(x)+b(x,y)g(y), so p(0,0)=p(0,1)=p(1,0)=p(1,1)=0, so pI.

Part (b) is the interesting part. Consider a as a polynomial in F2[x][y], then the division algorithm shows that a(x,y)=(y2y)b(x,y)+c(x)y+d(x).

Next, we divide c(x) and d(x) by (x2x) and get:

c(x)=e(x)(x2x)+fx+g, d(x)=h(x)(x2x)+jx+k.

Putting these all back together we get:

a(x,y)=(y2y)b(x,y)+c(x)y+d(x)=(y2y)b(x,y)+(e(x)(x2x)+fx+g)y+(h(x)(x2x)+jx+k)=(y2y)b(x,y)+e(x)(x2x)y+fxy+gy+h(x)(x2x)+jx+k=(y2y)b(x,y)+e(x)(x2x)y+h(x)(x2x)+fxy+gy+jx+k=(y2y)b(x,y)+(x2x)(e(x)y+h(x))+fxy+gy+jx+k

Now we show the required form.

For part (c), let f(x,y)=axy+bx+cy+d, we have:

f(0,0)=d=0
f(1,0)=b+d=b+0=0
f(0,1)=c+d=c+0=0.
f(1,1)=a+b+c+d=a+0+0+0=0.

So we showed that a=b=c=d=0.

For part (d), we know that any polynomial pI can be written as the form in part (b), and part (c) guarantee a=b=c=d=0, so px2x,y2y.

For part (e), we use the division algorithm we have above:

x2y+y2x=x(y2y)+(x2y+xy)=x(y2y)+(x2x)y+2xy=x(y2y)+(x2x)y.

The last term disappear because 2=0F2.

No comments:

Post a Comment