Linear Algebra: does it form a basis?

Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
3 replies · 2K views
brushman
Messages
112
Reaction score
1

Homework Statement


See attachment.

The Attempt at a Solution



I already did parts i and ii (correctly, I hope). On part iii I found 2 linearly independent elements to be: t+1, t^2 - 1.

However, I don't understand how to show that these form a basis of W. Because W is a subspace of P2, and P2 has dimension 3, we know W has at most dimension 3. But I only have 2 elements, not 3, so I can't use this to show that I have a basis. Perhaps the constraint that p(-1) = 0 reduces the dimension, but I don't know how to prove this.

Thanks.
 

Attachments

  • Capture.PNG
    Capture.PNG
    14.1 KB · Views: 579
on Phys.org
brushman said:
However, I don't understand how to show that these form a basis of W. Because W is a subspace of P2, and P2 has dimension 3, we know W has at most dimension 3. But I only have 2 elements, not 3, so I can't use this to show that I have a basis. Perhaps the constraint that p(-1) = 0 reduces the dimension, but I don't know how to prove this.

Thanks.

A polynomial in W is can be represented by an ordered pair of numbers (a0, a1): p(t)=a0+a1t+(a1-a0)t^2. So the set W is isomorphic with the set of ordered pair of numbers ...

ehild
 
the constraint that -1 is a root gives
[itex]a_0-a_1+a_2=0[/itex]
[itex]a_0=a_1-a_2[/itex]

so then

[itex]a(t^2-1)+b(t+1)=at^2-a+bt+a=at^2+bt+(b-a)[/itex]

since a is the coefficient on t^2 and b is the coefficient on t we can let
[itex]a=a_2[/itex] and [itex]b=a_1[/itex]
to find
[itex]a_2(t^2-1)+a_1(b+1)=a_2 t^2+a_1 t +(a_1-a_2)[/itex]
from the constraint we found [itex]a_0=a_1-a_2[/itex]
and so
[itex]a_2(t^2-1)+a_1(b+1)=a_2t^2+b_1t+a_0[/itex]

you follow?

I should also add, every constraint you add to a system reduces the dimension of it by 1, adding another root would make it a 1 dimensional problem
 
genericusrnme said:
the constraint that -1 is a root gives
[itex]a_0-a_1+a_2=0[/itex]
[itex]a_0=a_1-a_2[/itex]

so then

[itex]a(t^2-1)+b(t+1)=at^2-a+bt+a=at^2+bt+(b-a)[/itex]

since a is the coefficient on t^2 and b is the coefficient on t we can let
[itex]a=a_2[/itex] and [itex]b=a_1[/itex]
to find
[itex]a_2(t^2-1)+a_1(b+1)=a_2 t^2+a_1 t +(a_1-a_2)[/itex]
from the constraint we found [itex]a_0=a_1-a_2[/itex]
and so
[itex]a_2(t^2-1)+a_1(b+1)=a_2t^2+b_1t+a_0[/itex]

you follow?

Not really...:smile: I would do it just on the opposite way.

Those polynomials which have root -1, are of form pa,b(t)=at^2+bt+(b-a), that is pa,b(t)=a(t^2-1)+b(t+1), which means all such polynomials are linear combination of the basic "vectors" p1=t^2-1 and p2=t+1. Two basic vectors define a two-dimensional subspace.

genericusrnme said:
I should also add, every constraint you add to a system reduces the dimension of it by 1, adding another root would make it a 1 dimensional problem

That is right.
With one more constraint, there would be only one free parameter, so the space would become one-dimensional.


ehild