Show that Polynomials p0 to pn Form Basis of F[t] ≤ n

[e.gedge]

Quick a easy question i need help with, so thanks to anyone who will try it out..

Show that the polynomials p₀= 1 + x + x²+ x³...+ xⁿ, p₁= x + x²+ x³... +xⁿ, p₂= x² + x³ +...+ xⁿ, ... p_n=xⁿ form a basis of F[t] less than or equal to n

Thanks!
xo

 

[HallsofIvy]

For a problem like this it is best to use the definition. A "basis" for a vector space is a set of vectors that (1) span the space and (2) are independent.

Now look at the definitions of "span" and "independent".
To span the space means that every vector in the space can be written as a linear combinations in the set. Any vector in this space is a polynomal of degree less than or equal to n: any such vector can be written f(x)= \alpha_nx^n+ \alpha_{n-1}x^{n-1}+ \cdot\cdot\cdot+ \alpha_1 x+ \alpha_0. Can you find numbers a_0, a_1, \cdot\cdot\cdot, a_n so that a_0(1 + x + x^2+ x^3+ \cdot\cdot\cdot+ x^n)+ a_1(x+ x^2+ x^3+ \cdot\cdot\cdot+ x^n)+\cdot\cdot\cdot + a_n(x^n)= \alpha_nx^n+ \alpha_{n-1}x^{n-1}+ \cdot\cdot\cdot+ \alpha_1 x+ \alpha_0?<br /> <br /> "Independent" means that the only linear combination of the vectors that equals the 0 vector is the "trivial" combination with all coefficients equal to 0. Suppose<br /> a_0(1 + x + x^2+ x^3+ \cdot\cdot\cdot+ x^n)+ a_1(x+ x^2+ x^3+ \cdot\cdot\cdot+ x^n)+\cdot\cdot\cdot + a_n(x^n)= 0 for all x. Can you prove that all the "a"s must be 0?

 

[e.gedge]

Uhh... I am pretty sure that i ca do the span part, but i still am unsure as to how to go about proving that all a's must equal 0

 

[e.gedge]

oh, nevermind, i got it now. Thanks a ton for the help!