Invariant spaces and eigenvector problem

gottfried
Messages
118
Reaction score
0

Homework Statement


Let W be a 1-dimensional subspace of V that is A-invariant. Show that every non zero vector in W is a eigenvector of A. [A element of Mn(F)]

The Attempt at a Solution



We know W is A-invariant therefore for all w in W A.w is in W. W is one dimensional which implies to me that A must therefore be a one by one matrix with an entry from F. Is this a correct assumption?

If so then A.w=λ.w where λ is an element of F which implies that all w in W are eigenvectors of A.

I'm new to this sort of linear algebra and therefore can't tell if I've made a blatant mistake?
 
Physics news on Phys.org
gottfried said:

Homework Statement


Let W be a 1-dimensional subspace of V that is A-invariant. Show that every non zero vector in W is a eigenvector of A. [A element of Mn(F)]

The Attempt at a Solution



We know W is A-invariant therefore for all w in W A.w is in W. W is one dimensional which implies to me that A must therefore be a one by one matrix with an entry from F. Is this a correct assumption?
No, in fact it makes no sense at all. Any n by n matrix can have "1-dimensional invarient subspace".

If so then A.w=λ.w where λ is an element of F which implies that all w in W are eigenvectors of A.
How did you arrive at that? If w is in the invariant subspace, W, then Aw is also in W and, since W is "1-dimensional", it must be a multiple of A. But it does not immediately follow that that multiple is the same for all vectors in W.

Suppose that u and v are different vectors in W. Then we can say that Au= \lambda_1 u and that Av= \lambda v but we cannot yet say that \lambda_1= \lambda_2. To do that, we need to use the fact that W is "1-dimensional" again. Because of that, any vector in the subspace is a mutiple of any other (except 0). We can write u= xv so that Au= x(Av). What does that give you?

I'm new to this sort of linear algebra and therefore can't tell if I've made a blatant mistake?
 
Thanks for the help. I'm still a little confused though.

HallsofIvy said:
Suppose that u and v are different vectors in W. Then we can say that Au= \lambda_1 u and that Av= \lambda v but we cannot yet say that \lambda_1= \lambda_2.

Why do we need to show that the two λ's are the same. Isn't that Au= \lambda_1 u sufficient because that is the definition of an eigenvector? Unless eigenvalues have to unique for each matrix?
 
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