Trying to understand Eigenvectors

  • Thread starter Thread starter noelo2014
  • Start date Start date
  • Tags Tags
    Eigenvectors
noelo2014
Messages
45
Reaction score
0

Homework Statement



Find the Eigenvalues of A=

4 0 1
-2 1 0
-2 0 1

Then find the eigenvectors corresponding to each of the eigenvalues.



Homework Equations





The Attempt at a Solution



I found the Characteristic Polynomial of the matrix, computed the Eigenvalues which are 1,2,3.

What I'm trying to get my head around is the concept of the eigenvectors.

First of all I attempted to find the eigenvector(s) for λ=1. So I constructed the matrix (A-Iλ), row-reduced and got the matrix:

1 0 0
0 0 1
0 0 0

This matrix corresponds to the set of linear eqns (A-Iλ)x, and x must be non-zero. So normally I'd just read the solutions from this matrix and tell myself

x1=0
and
x3=0

I did this in maple and it gave me the value (0,1,0) as the eigenvector corresponding to λ=1, but x2 doesn't equal zero in any of these rows. Can someone explain this to me?
 
Physics news on Phys.org
There is no constraint on x2, so it is arbitrary. 1 is chosen so that the eigenvector is properly normalized. The eigenspace corresponding to eigenvalue ##\lambda =1## is then all vectors of the form ##\langle 0, k, 0\rangle##.
 
Ok, so what you're saying is that x1 has to be zero and x3 has to be zero but x2 can be anything?

I think I get it, I think I'll just need to practice more questions like this. It's a bit subtle.
 
It might be helpful to put some words with the work you did.

When you were finding the eigenvectors for λ = 1, you ended up with this matrix:
$$\begin{bmatrix} 1 & 0 & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \end{bmatrix}$$

Your work started with the matrix equation (A - 1I)x = 0. By row-reduction, you got to the matrix I show above.

This matrix represents the linear system
x1 + 0x2 + 0x3 = 0
0x1 + 0x2 + x3 = 0
0x1 + 0x2 + 0x3 = 0

Or more simply,
x1 = 0
x3 = 0

Since there are no conditions or restrictions on x2, you can substitute any real value for x2. This means that any vector of the form <0, k, 0> is an eigenvector for λ = 1. For convenience's sake, k = 1 is chosen, making the eigenvector <0, 1, 0>. Any multiple of that vector would also be an eigenvector for this eigenvalue.
 
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