Prove/Disprove: Existence of a Basis of P_3(F) w/ Degree 2 Polynomial

jaejoon89
Messages
187
Reaction score
0

Homework Statement



Prove or disprove: there exists a basis (p_0, p_1, p_2, p_3) of P_3 (F) such that one of the polynomials p_0, p_1, p_2, p_3 has degree 2.

Homework Equations



none really

The Attempt at a Solution



Is the following proof correct?

----

Let p_0, p_1, p_2, p_3 be elements of P_3(F) s.t.

p_o (x) = 1,
p_1 (x) = x,
p_2 (x) = x^2 + x^3,
p_3(x) = x^3.

None of the polynomials are degree 2 although (p_0,p_1,p_2,p_3) is clearly spanning P_3 (F) with dimP_3(F) = 4 and forms a basis. Hence proved.
 
Physics news on Phys.org
Looks good to me assuming the "one" in the statement of the problem should be "none".
 
I'm not sure that stating that it clearly spans it will suffice even if it is obvious. If you think that this suffices for you class, you're fine.

On the other hand, you could cook up a matrix that maps a degree three polynomial represented in the standard basis to it's representation in this basis pretty easily.
 
Typo: the original statement is supposed to be "none of the polynomials has degree 2." Thanks for pointing that out, LCKurtz.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top