\[A=\left[\begin{matrix}0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \\ 2 & 1 & 1& 1 \\ -5 & 2 & 5 & -1\end{matrix}\right]\] \[\lambda=3, -3, 1,-1\]
Consider \(\lambda = 1\) \[\left[\begin{matrix}-1 & 0 & 1 & 0 \\ 0 & -1 & 0 & 1 \\ 2 & 1 & 0& 1 \\ -5 & 2 & 5 & -2\end{matrix}\right]\]\[->\left[\begin{matrix}1 & 0 & -1 & 0 \\ 0 & -1 & 0 & 1 \\ 0 & 1 & 2 & 1 \\ 0 & 2 & 0 & -2\end{matrix}\right]\]\[->\left[\begin{matrix}1 & 0 & 0 & 1 \\ 0 & 1 & 0 & -1 \\ 0 & 0 & 1 & 1 \\ 0 & 0 & 0 & 0\end{matrix}\right]\] So, \[\left[\begin{matrix}x_1 \\ x_2 \\x_3 \\ x_4\end{matrix}\right]=\left[\begin{matrix} -1 \\ 1 \\ -1 \\ 1\end{matrix}\right]x_4\]Eigenvector corresponding to λ=1 is \((-1, 1, -1, 1)^T\) Is that right?
This isn't real, is it?
What do you mean?
Earlier I ignored this http://www.wolframalpha.com/input/?i=Eigen+vectors%7B%7B1%2C1%2C1%7D%2C%7B2%2C2%2C2%7D%2C%7B3%2C3%2C3%7D%7D
-1 1 -1 1 is a eugene vector http://www.wolframalpha.com/input/?i=%7B%7B0%2C0%2C1%2C0%7D%2C%7B0%2C0%2C0%2C1%7D%2C%7B2%2C1%2C1%2C1%7D%2C%7B-5%2C2%2C5%2C-1%7D%7D
How about the eigenvectors of the identity matrix ?
The answer given to this question is \((1,-1,1,-1)^T\). I don't know why I always get the signs "wrong" (I don't think it is really "wrong" though...)
You can check your answer M *vector= lambda* vector maybe the book mixed up the vectors for lambda = 1 and lambda= -1
Eigenvector of lambda = -1 is (1, 5, -1, -5)^T, while I got (-1, -5, 1, 5)^T
Wait.. With reference to the WolframAlpha link given by amistre64, I got the same answer as wolf, but different from the ones given by my teacher. :|
ok, you can always scale the eigenvector, and it still works M v = \(\lambda\) v M (av) = λ (av) so you can choose a= -1 to change your answer.
I would "reduce" v by taking out common factors, but -1 is ambiguous.
I would choose the sign that gives the most positive terms in the e-vector but that is only because I don't like minus signs.
So, we can have multiply the eigenvector by a scalar but it is still the eigenvector corresponding to that eigenvalue lambda. Is that right?
Yes. The eigenvector really represents "direction" and its specific length is not important.
Thanks!!
@Directrix
Join our real-time social learning platform and learn together with your friends!