Eigenvalues and eigenvectors: Eigenvalues and eigenvectors
Solving an eigenvalue problem
When you determine eigenvalues of a matrix and corresponding eigenspaces, then you solve an eigenvalue problem for a matrix. Below is an example.
Solve the eigenvalue problem for the matrix \[
A = \matrix{-2 & 6 \\ 0 & 1}
\]In other words, determine the eigenvalues and vectors.
A = \matrix{-2 & 6 \\ 0 & 1}
\]In other words, determine the eigenvalues and vectors.
The characteristic equation is \[\det\matrix{-2-\lambda & 6 \\ 0 & 1-\lambda }=0\] We first rewrite the characteristic polynomial of \(A\):
\[ \begin{aligned}
\det(A-\lambda I) = \left\vert \begin{array}{cc} -2-\lambda & 6 \\ 0 & 1-\lambda \end{array} \right\vert &= (-2-\lambda)(1-\lambda)-6\cdot0 \\
&= (-2-\lambda)(1-\lambda)
\end{aligned}\] So, the eigenvalues are \(\lambda_1 = -2\) and \(\lambda_2 = 1\).
Let \(\lambda = -2\) be an eigenvalue of the matrix \[A=\matrix{-2 & 6 \\ 0 & 1}\] Then there must be a vector \(\vec{v}\) such that \(A\vec{v}=-2\vec{v}\), this is, \[(A+2 I)\vec{v}=\vec{0}\text.\] In other words, we must find the kernel of the matrix \(A+2 I\). We can do this through row reduction of the matrix \[A+2 I = \matrix{-2 & 6 \\ 0 & 1} - \matrix{-2 & 0 \\0& -2 }=\matrix{ 0 & 6 \\ 0 & 3}\] This can be done as follows:
\[\begin{aligned}
\matrix{0&6\\0&3\\}&\sim\matrix{0&1\\0&3\\}&{\blue{\begin{array}{c}{{1}\over{6}}R_1\\\phantom{x}\end{array}}}\\\\ &\sim\matrix{0&1\\0&0\\}&{\blue{\begin{array}{c}\phantom{x}\\R_2-3R_1\end{array}}} \end{aligned}\] So the eigenspace for \(\lambda = -2\) equals \(\left\{ r \cv{1\\0} \middle|\;r\in\mathbb R\right\}=\left\langle\cv{1\\0}\right\rangle\).
Let \(\lambda = 1\) be an eigenvalue of the matrix \[A=\matrix{-2 & 6 \\ 0 & 1}\] Then there must be a vector \(\vec{v}\) such that \(A\vec{v}=1\vec{v}\), that is, \[(A-I)\vec{v}=\vec{0}\text.\] In other words, we must find the kernel of the matrix \(A-I\). We can do this through row reduction of the matrix \[A-I = \matrix{-2 & 6 \\ 0 & 1} - \matrix{1 & 0 \\0& 1 }=\matrix{ -3 & 6 \\ 0 & 0}\] This can be done as follows:
\[\begin{aligned}
\matrix{-3&6\\0&0\\}&\sim\matrix{1&-2\\0&0\\}&{\blue{\begin{array}{c}-{{1}\over{3}}R_1\\\phantom{x}\end{array}}} \end{aligned}\] So the eigenspace for \(\lambda = 1\) equals \(\left\{ r \cv{2\\1} \middle|\;r\in\mathbb R\right\}=\left\langle\cv{2\\1}\right\rangle\).
If possible, we avoided fractions in the solution.
\[ \begin{aligned}
\det(A-\lambda I) = \left\vert \begin{array}{cc} -2-\lambda & 6 \\ 0 & 1-\lambda \end{array} \right\vert &= (-2-\lambda)(1-\lambda)-6\cdot0 \\
&= (-2-\lambda)(1-\lambda)
\end{aligned}\] So, the eigenvalues are \(\lambda_1 = -2\) and \(\lambda_2 = 1\).
Let \(\lambda = -2\) be an eigenvalue of the matrix \[A=\matrix{-2 & 6 \\ 0 & 1}\] Then there must be a vector \(\vec{v}\) such that \(A\vec{v}=-2\vec{v}\), this is, \[(A+2 I)\vec{v}=\vec{0}\text.\] In other words, we must find the kernel of the matrix \(A+2 I\). We can do this through row reduction of the matrix \[A+2 I = \matrix{-2 & 6 \\ 0 & 1} - \matrix{-2 & 0 \\0& -2 }=\matrix{ 0 & 6 \\ 0 & 3}\] This can be done as follows:
\[\begin{aligned}
\matrix{0&6\\0&3\\}&\sim\matrix{0&1\\0&3\\}&{\blue{\begin{array}{c}{{1}\over{6}}R_1\\\phantom{x}\end{array}}}\\\\ &\sim\matrix{0&1\\0&0\\}&{\blue{\begin{array}{c}\phantom{x}\\R_2-3R_1\end{array}}} \end{aligned}\] So the eigenspace for \(\lambda = -2\) equals \(\left\{ r \cv{1\\0} \middle|\;r\in\mathbb R\right\}=\left\langle\cv{1\\0}\right\rangle\).
Let \(\lambda = 1\) be an eigenvalue of the matrix \[A=\matrix{-2 & 6 \\ 0 & 1}\] Then there must be a vector \(\vec{v}\) such that \(A\vec{v}=1\vec{v}\), that is, \[(A-I)\vec{v}=\vec{0}\text.\] In other words, we must find the kernel of the matrix \(A-I\). We can do this through row reduction of the matrix \[A-I = \matrix{-2 & 6 \\ 0 & 1} - \matrix{1 & 0 \\0& 1 }=\matrix{ -3 & 6 \\ 0 & 0}\] This can be done as follows:
\[\begin{aligned}
\matrix{-3&6\\0&0\\}&\sim\matrix{1&-2\\0&0\\}&{\blue{\begin{array}{c}-{{1}\over{3}}R_1\\\phantom{x}\end{array}}} \end{aligned}\] So the eigenspace for \(\lambda = 1\) equals \(\left\{ r \cv{2\\1} \middle|\;r\in\mathbb R\right\}=\left\langle\cv{2\\1}\right\rangle\).
If possible, we avoided fractions in the solution.
Unlock full access