Problem:
Solution:
Another long problem.
For part (a), let's review what is a vector space first.
A vector space is a set of vectors v such that we can add these vector together and do 'scalar' multiplication, where the scalar is an element of a field k, and in this case we say it is a vector field over k.
To see, how k[x] can be interpreted as a vector space, we already know the scalar are elements of k, so the vectors must be power of x, and therefore ⟨I⟩ is a subspace with the 0th power missing.
To show that must have an infinite basis, we simply note that there is no way one can construct xn from linear combination of xk where k<n, thus a basis must be infinite.
For part (b), it is trivial. So trivial that I am not sure if I will remember what I meant, so let's be specific. The form of the solution is:
c1x+c2y=0
So we pick the coefficients c1=y and c2=−x, both of them are not zero and yet the result is 0.
Part (c) is equally trivial. We just simply do exactly the same as above:
s∑i=0cifi=0
So we pick c1=f2, c2=−f1 and ck=0 for other k.
For part (d), we need to be a little more creative, the two representations are
x2+xy+y2=(x+y)(x)+(y)(y)x2+xy+y2=(x)(x)+(x+y)(y)
So there you go, two representations of the same polynomial.
For part (e), it suffice to show three facts:
⟨x+x2,x2⟩=⟨x⟩
⟨x+x2⟩≠⟨x⟩
⟨x2⟩≠⟨x⟩
All of them are pretty obvious.
x=(1)(x+x2)+(−1)(x2)∈⟨x+x2,x2⟩, this implies ⟨x⟩⊂⟨x2+x,x2⟩.
x=(1)(x)∈⟨x⟩ and x+x2=(x+1)(x)∈⟨x⟩, this implies ⟨x+x2,x⟩⊂⟨x⟩.
Together we have shown ⟨x+x2,x2⟩=⟨x⟩
Note that for the other two statements, any polynomial in the left hand side subsets necessarily have degree at least 2, so they cannot have the monomial x, which is in ⟨x⟩, so we establish the other two statements. These two statements together indicate it is a minimal basis.
In linear algebra, the minimal basis always have the same size, which is the dimension of the space. But apparently this does not hold with ideals.
Solution:
Another long problem.
For part (a), let's review what is a vector space first.
A vector space is a set of vectors v such that we can add these vector together and do 'scalar' multiplication, where the scalar is an element of a field k, and in this case we say it is a vector field over k.
To see, how k[x] can be interpreted as a vector space, we already know the scalar are elements of k, so the vectors must be power of x, and therefore ⟨I⟩ is a subspace with the 0th power missing.
To show that must have an infinite basis, we simply note that there is no way one can construct xn from linear combination of xk where k<n, thus a basis must be infinite.
For part (b), it is trivial. So trivial that I am not sure if I will remember what I meant, so let's be specific. The form of the solution is:
c1x+c2y=0
So we pick the coefficients c1=y and c2=−x, both of them are not zero and yet the result is 0.
Part (c) is equally trivial. We just simply do exactly the same as above:
s∑i=0cifi=0
So we pick c1=f2, c2=−f1 and ck=0 for other k.
For part (d), we need to be a little more creative, the two representations are
x2+xy+y2=(x+y)(x)+(y)(y)x2+xy+y2=(x)(x)+(x+y)(y)
So there you go, two representations of the same polynomial.
For part (e), it suffice to show three facts:
⟨x+x2,x2⟩=⟨x⟩
⟨x+x2⟩≠⟨x⟩
⟨x2⟩≠⟨x⟩
All of them are pretty obvious.
x=(1)(x+x2)+(−1)(x2)∈⟨x+x2,x2⟩, this implies ⟨x⟩⊂⟨x2+x,x2⟩.
x=(1)(x)∈⟨x⟩ and x+x2=(x+1)(x)∈⟨x⟩, this implies ⟨x+x2,x⟩⊂⟨x⟩.
Together we have shown ⟨x+x2,x2⟩=⟨x⟩
Note that for the other two statements, any polynomial in the left hand side subsets necessarily have degree at least 2, so they cannot have the monomial x, which is in ⟨x⟩, so we establish the other two statements. These two statements together indicate it is a minimal basis.
In linear algebra, the minimal basis always have the same size, which is the dimension of the space. But apparently this does not hold with ideals.
No comments:
Post a Comment