Eigenvectors, Eigenvalues, and the Characteristic Equation
Eigenvectors and eigenvalues · Eigenspaces · The characteristic equation · Multiplicity · Similar matrices
By the end of this week you will be able to:
- decide whether a given vector is an eigenvector of a matrix, and whether a given number is an eigenvalue;
- find a basis for the eigenspace of a given eigenvalue by row reduction;
- write down the eigenvalues of a triangular matrix, and explain why \(0\) is an eigenvalue exactly when the matrix is not invertible;
- find the characteristic polynomial of a \(2\times 2\) or \(3\times 3\) matrix and read off the eigenvalues with their multiplicities;
- use eigenvectors to write an explicit formula for the solution of \(\mathbf x_{k+1}=A\mathbf x_k\), and explain why similar matrices have the same eigenvalues.
Day 1: Eigenvectors and Eigenvalues
Today we look for the vectors that a matrix only stretches, and for the stretching factors.
1.1 Vectors that are only stretched
Multiplication by a square matrix \(A\) moves vectors in many directions. For some vectors, however, the action of \(A\) is simple: \(A\mathbf x\) lies on the same line as \(\mathbf x\).
Let \(A=\begin{bmatrix} 3&-2\\ 1&0\end{bmatrix}\), \(\mathbf u=\begin{bmatrix} -1\\ 1\end{bmatrix}\) and \(\mathbf v=\begin{bmatrix} 2\\ 1\end{bmatrix}\). Compute \(A\mathbf u\) and \(A\mathbf v\).
Solution
\[A\mathbf u=\begin{bmatrix} 3&-2\\ 1&0\end{bmatrix}\begin{bmatrix} -1\\ 1\end{bmatrix}=\begin{bmatrix} -5\\ -1\end{bmatrix},\qquad A\mathbf v=\begin{bmatrix} 3&-2\\ 1&0\end{bmatrix}\begin{bmatrix} 2\\ 1\end{bmatrix}=\begin{bmatrix} 4\\ 2\end{bmatrix}=2\mathbf v.\]\(A\mathbf v\) is \(2\mathbf v\): \(A\) only stretches \(\mathbf v\) by the factor \(2\). \(A\mathbf u\) is not a multiple of \(\mathbf u\): the first entry of \(A\mathbf u\) is \(5\) times the first entry of \(\mathbf u\), but the second entry is \(-1\) times the second entry of \(\mathbf u\). Figure 1 shows the four vectors.
An eigenvector of an \(n\times n\) matrix \(A\) is a nonzero vector \(\mathbf x\) such that \(A\mathbf x=\lambda\mathbf x\) for some scalar \(\lambda\). A scalar \(\lambda\) is an eigenvalue of \(A\) if there is a nontrivial solution \(\mathbf x\) of \(A\mathbf x=\lambda\mathbf x\); such an \(\mathbf x\) is an eigenvector corresponding to \(\lambda\).
An eigenvector must be nonzero, but an eigenvalue may be \(0\).
In Example 1, \(\mathbf v\) is an eigenvector of \(A\) corresponding to the eigenvalue \(2\), and \(\mathbf u\) is not an eigenvector of \(A\). Checking whether a given vector is an eigenvector is a single matrix-vector product.
Let \(A=\begin{bmatrix} 1&6\\ 5&2\end{bmatrix}\), \(\mathbf u=\begin{bmatrix} 6\\ -5\end{bmatrix}\) and \(\mathbf v=\begin{bmatrix} 3\\ -2\end{bmatrix}\). Are \(\mathbf u\) and \(\mathbf v\) eigenvectors of \(A\)?
Solution
\[A\mathbf u=\begin{bmatrix} 1&6\\ 5&2\end{bmatrix}\begin{bmatrix} 6\\ -5\end{bmatrix}=\begin{bmatrix} 6-30\\ 30-10\end{bmatrix}=\begin{bmatrix} -24\\ 20\end{bmatrix}=-4\begin{bmatrix} 6\\ -5\end{bmatrix}=-4\mathbf u.\]So \(\mathbf u\) is an eigenvector corresponding to the eigenvalue \(-4\).
\[A\mathbf v=\begin{bmatrix} 1&6\\ 5&2\end{bmatrix}\begin{bmatrix} 3\\ -2\end{bmatrix}=\begin{bmatrix} 3-12\\ 15-4\end{bmatrix}=\begin{bmatrix} -9\\ 11\end{bmatrix}.\]For \(A\mathbf v\) to equal \(\lambda\mathbf v\) we would need \(\lambda=-3\) from the first entry and \(\lambda=-\tfrac{11}{2}\) from the second. No single \(\lambda\) works, so \(\mathbf v\) is not an eigenvector of \(A\).
1.2 Is a given number an eigenvalue? The eigenspace
The scalar \(\lambda\) is an eigenvalue of \(A\) exactly when \(A\mathbf x=\lambda\mathbf x\) has a nontrivial solution. Since \(\lambda\mathbf x=\lambda I\mathbf x\), this equation can be rewritten:
\[A\mathbf x=\lambda\mathbf x\quad\Longleftrightarrow\quad A\mathbf x-\lambda I\mathbf x=\mathbf 0\quad\Longleftrightarrow\quad (A-\lambda I)\mathbf x=\mathbf 0.\]So \(\lambda\) is an eigenvalue of \(A\) if and only if the homogeneous system \((A-\lambda I)\mathbf x=\mathbf 0\) has a free variable, and the eigenvectors for \(\lambda\) are the nonzero solutions of this system.
Show that \(7\) is an eigenvalue of the matrix \(A=\begin{bmatrix} 1&6\\ 5&2\end{bmatrix}\) of Example 2, and find the corresponding eigenvectors.
Solution
Form \(A-7I\) and row reduce the augmented matrix of \((A-7I)\mathbf x=\mathbf 0\):
\[A-7I=\begin{bmatrix} 1&6\\ 5&2\end{bmatrix}-\begin{bmatrix} 7&0\\ 0&7\end{bmatrix}=\begin{bmatrix} -6&6\\ 5&-5\end{bmatrix},\qquad \left[\begin{array}{cc|c} -6&6&0\\ 5&-5&0\end{array}\right]\sim\left[\begin{array}{cc|c} 1&-1&0\\ 0&0&0\end{array}\right].\]The row operations are \(R_1\to-\tfrac16R_1\) and then \(R_2\to R_2-5R_1\). There is a free variable, \(x_2\), so the system has nontrivial solutions and \(7\) is an eigenvalue. The general solution is \(x_1=x_2\), that is,
\[\mathbf x=x_2\begin{bmatrix} 1\\ 1\end{bmatrix}.\]Every vector of this form with \(x_2\neq 0\) is an eigenvector corresponding to \(\lambda=7\). Check: \(A\begin{bmatrix} 1\\ 1\end{bmatrix}=\begin{bmatrix} 7\\ 7\end{bmatrix}=7\begin{bmatrix} 1\\ 1\end{bmatrix}\).
Row reduction was used to find the eigenvectors once \(\lambda\) was known. It cannot be used to find eigenvalues: the echelon form of \(A\) does not display the eigenvalues of \(A\). The eigenvalues come from a different equation, on Day 2.
Let \(\lambda\) be an eigenvalue of the \(n\times n\) matrix \(A\). The set of all solutions of \((A-\lambda I)\mathbf x=\mathbf 0\) is the null space of \(A-\lambda I\), a subspace of \(\mathbb R^n\). It is called the eigenspace of \(A\) corresponding to \(\lambda\). It consists of the zero vector and all the eigenvectors corresponding to \(\lambda\).
For the matrix of Examples 2 and 3, the eigenspace for \(\lambda=7\) is the line through \((1,1)\), and the eigenspace for \(\lambda=-4\) is the line through \((6,-5)\). Figure 2 shows both lines and what \(A\) does on each of them.
Let \(A=\begin{bmatrix} 4&-1&6\\ 2&1&6\\ 2&-1&8\end{bmatrix}\). An eigenvalue of \(A\) is \(2\). Find a basis for the corresponding eigenspace.
Solution
\[A-2I=\begin{bmatrix} 4&-1&6\\ 2&1&6\\ 2&-1&8\end{bmatrix}-\begin{bmatrix} 2&0&0\\ 0&2&0\\ 0&0&2\end{bmatrix}=\begin{bmatrix} 2&-1&6\\ 2&-1&6\\ 2&-1&6\end{bmatrix}.\]Row reduce the augmented matrix of \((A-2I)\mathbf x=\mathbf 0\) with \(R_2\to R_2-R_1\) and \(R_3\to R_3-R_1\):
\[\left[\begin{array}{ccc|c} 2&-1&6&0\\ 2&-1&6&0\\ 2&-1&6&0\end{array}\right]\sim\left[\begin{array}{ccc|c} 2&-1&6&0\\ 0&0&0&0\\ 0&0&0&0\end{array}\right].\]There are two free variables, \(x_2\) and \(x_3\), which confirms that \(2\) is an eigenvalue. From \(2x_1-x_2+6x_3=0\) we get \(x_1=\tfrac12x_2-3x_3\), so
\[\mathbf x=\begin{bmatrix} x_1\\ x_2\\ x_3\end{bmatrix}=x_2\begin{bmatrix} 1/2\\ 1\\ 0\end{bmatrix}+x_3\begin{bmatrix} -3\\ 0\\ 1\end{bmatrix}.\]The eigenspace is a plane in \(\mathbb R^3\). A basis is \(\left\{\begin{bmatrix} 1\\ 2\\ 0\end{bmatrix},\ \begin{bmatrix} -3\\ 0\\ 1\end{bmatrix}\right\}\), where the first vector is \(2\) times the vector found above. Check: \(A\begin{bmatrix} 1\\ 2\\ 0\end{bmatrix}=\begin{bmatrix} 2\\ 4\\ 0\end{bmatrix}\) and \(A\begin{bmatrix} -3\\ 0\\ 1\end{bmatrix}=\begin{bmatrix} -6\\ 0\\ 2\end{bmatrix}\), both twice the original vector.
Solution
Is \(\lambda=4\) an eigenvalue of \(A=\begin{bmatrix} 3&0&-1\\ 2&3&1\\ -3&4&5\end{bmatrix}\)? If so, find one corresponding eigenvector.
Solution
\[A-4I=\begin{bmatrix} -1&0&-1\\ 2&-1&1\\ -3&4&1\end{bmatrix}.\]Row reduce the augmented matrix of \((A-4I)\mathbf x=\mathbf 0\). First \(R_1\to-R_1\); then \(R_2\to R_2-2R_1\) and \(R_3\to R_3+3R_1\); then \(R_3\to R_3+4R_2\):
\[\left[\begin{array}{ccc|c} 1&0&1&0\\ 2&-1&1&0\\ -3&4&1&0\end{array}\right]\sim\left[\begin{array}{ccc|c} 1&0&1&0\\ 0&-1&-1&0\\ 0&4&4&0\end{array}\right]\sim\left[\begin{array}{ccc|c} 1&0&1&0\\ 0&-1&-1&0\\ 0&0&0&0\end{array}\right].\]\(x_3\) is free, so \(4\) is an eigenvalue. The equations give \(x_1=-x_3\) and \(x_2=-x_3\). Taking \(x_3=-1\) gives the eigenvector \(\begin{bmatrix} 1\\ 1\\ -1\end{bmatrix}\). Check: \(A\begin{bmatrix} 1\\ 1\\ -1\end{bmatrix}=\begin{bmatrix} 3+0+1\\ 2+3-1\\ -3+4-5\end{bmatrix}=\begin{bmatrix} 4\\ 4\\ -4\end{bmatrix}\).
Self-check only. These exercises are not graded. Entries may be typed as integers, decimals (1.5 or 1,5) or simple fractions (3/2).
For each pair, decide whether the vector is an eigenvector of the matrix. If it is, enter the eigenvalue; if it is not, leave the eigenvalue box empty.
Self-check only.
The number \(7\) is an eigenvalue of \(A=\begin{bmatrix} 8&3&-4\\ -1&4&4\\ 2&6&-1\end{bmatrix}\). Find the dimension of the eigenspace for \(\lambda=7\) and enter a basis for it as the columns of the grid (leave unused columns empty). Any correct basis is accepted.
\(A-7I=\begin{bmatrix} 1&3&-4\\ -1&-3&4\\ 2&6&-8\end{bmatrix}\). Rows 2 and 3 are \(-1\) and \(2\) times row 1, so \(R_2\to R_2+R_1\), \(R_3\to R_3-2R_1\) leave the single equation \(x_1+3x_2-4x_3=0\). Two free variables: the eigenspace has dimension \(2\). With \(x_1=-3x_2+4x_3\),
\[\mathbf x=x_2\begin{bmatrix} -3\\ 1\\ 0\end{bmatrix}+x_3\begin{bmatrix} 4\\ 0\\ 1\end{bmatrix},\]so \(\{(-3,1,0),\ (4,0,1)\}\) is a basis. Check: \(A(-3,1,0)=(-21,7,0)\) and \(A(4,0,1)=(28,0,7)\).
1.3 Triangular matrices and the eigenvalue 0
In one special case the eigenvalues can be read off directly.
The eigenvalues of a triangular matrix are the entries on its main diagonal.
Proof (for a \(3\times 3\) upper triangular matrix; the lower triangular case is the same). If \(A\) is upper triangular, then
\[A-\lambda I=\begin{bmatrix} a_{11}-\lambda&a_{12}&a_{13}\\ 0&a_{22}-\lambda&a_{23}\\ 0&0&a_{33}-\lambda\end{bmatrix}.\]The scalar \(\lambda\) is an eigenvalue of \(A\) if and only if \((A-\lambda I)\mathbf x=\mathbf 0\) has a free variable. Because of the zeros below the diagonal, this matrix is already in echelon form, and it has a free variable if and only if at least one diagonal entry is \(0\). This happens if and only if \(\lambda\) equals one of \(a_{11},a_{22},a_{33}\). \(\blacksquare\)
Let \(A=\begin{bmatrix} 3&6&-8\\ 0&0&6\\ 0&0&2\end{bmatrix}\) and \(B=\begin{bmatrix} 4&0&0\\ -2&1&0\\ 5&3&4\end{bmatrix}\). Find the eigenvalues of \(A\) and of \(B\).
Solution
\(A\) is upper triangular, so by Theorem 1 its eigenvalues are \(3\), \(0\) and \(2\). \(B\) is lower triangular, so its eigenvalues are \(4\) and \(1\); the entry \(4\) appears twice on the diagonal, but the set of eigenvalues is \(\{4,1\}\).
What does it mean for \(0\) to be an eigenvalue, as for \(A\) in Example 7? The equation \(A\mathbf x=0\mathbf x\) is \(A\mathbf x=\mathbf 0\), and it has a nontrivial solution if and only if \(A\) is not invertible. So:
\(0\) is an eigenvalue of \(A\) if and only if \(A\) is not invertible. The eigenspace for \(\lambda=0\) is \(\operatorname{Nul} A\).
Find one eigenvalue of \(A=\begin{bmatrix} 1&2&3\\ 1&2&3\\ 1&2&3\end{bmatrix}\) without calculation, and describe its eigenspace.
Solution
The three rows of \(A\) are equal, so the rows are linearly dependent and \(A\) is not invertible. Hence \(0\) is an eigenvalue. Its eigenspace is \(\operatorname{Nul} A\), the solution set of the single equation \(x_1+2x_2+3x_3=0\): a plane in \(\mathbb R^3\), with basis \(\{(-2,1,0),\ (-3,0,1)\}\).
Self-check only. Enter the distinct eigenvalues in any order; leave extra boxes empty.
Day 2: Independence of Eigenvectors; The Characteristic Equation
Today we prove that eigenvectors for different eigenvalues are linearly independent, find the eigenvalues of a \(2\times 2\) matrix from a quadratic equation, and use eigenvectors to solve \(\mathbf x_{k+1}=A\mathbf x_k\).
2.1 Eigenvectors for distinct eigenvalues
If \(\mathbf v_1,\dots,\mathbf v_r\) are eigenvectors that correspond to distinct eigenvalues \(\lambda_1,\dots,\lambda_r\) of an \(n\times n\) matrix \(A\), then the set \(\{\mathbf v_1,\dots,\mathbf v_r\}\) is linearly independent.
Proof. Suppose, to the contrary, that \(\{\mathbf v_1,\dots,\mathbf v_r\}\) is linearly dependent. Since \(\mathbf v_1\neq\mathbf 0\), one of the vectors is a linear combination of the preceding ones (Theorem 7 of Section 1.7). Let \(p\) be the least index such that \(\mathbf v_{p+1}\) is a linear combination of the preceding, linearly independent, vectors \(\mathbf v_1,\dots,\mathbf v_p\):
\[c_1\mathbf v_1+\cdots+c_p\mathbf v_p=\mathbf v_{p+1}.\tag{1}\]Multiply both sides of (1) by \(A\) and use \(A\mathbf v_k=\lambda_k\mathbf v_k\):
\[c_1\lambda_1\mathbf v_1+\cdots+c_p\lambda_p\mathbf v_p=\lambda_{p+1}\mathbf v_{p+1}.\tag{2}\]Multiply (1) by \(\lambda_{p+1}\) and subtract the result from (2):
\[c_1(\lambda_1-\lambda_{p+1})\mathbf v_1+\cdots+c_p(\lambda_p-\lambda_{p+1})\mathbf v_p=\mathbf 0.\tag{3}\]Since \(\{\mathbf v_1,\dots,\mathbf v_p\}\) is linearly independent, all the weights in (3) are \(0\). None of the factors \(\lambda_i-\lambda_{p+1}\) is \(0\), because the eigenvalues are distinct, so \(c_1=\cdots=c_p=0\). But then (1) says \(\mathbf v_{p+1}=\mathbf 0\), which is impossible for an eigenvector. Hence the set cannot be linearly dependent. \(\blacksquare\)
The matrix \(A=\begin{bmatrix} 4&0&1\\ -2&1&0\\ -2&0&1\end{bmatrix}\) has eigenvectors \(\mathbf v_1=\begin{bmatrix} 0\\ 1\\ 0\end{bmatrix}\), \(\mathbf v_2=\begin{bmatrix} 1\\ -2\\ -2\end{bmatrix}\), \(\mathbf v_3=\begin{bmatrix} 1\\ -1\\ -1\end{bmatrix}\) with eigenvalues \(1\), \(2\), \(3\). Is \(\{\mathbf v_1,\mathbf v_2,\mathbf v_3\}\) a basis for \(\mathbb R^3\)?
Solution
First confirm the data: \(A\mathbf v_1=(0,1,0)=\mathbf v_1\), \(A\mathbf v_2=(4-2,\,-2-2,\,-2-2)=(2,-4,-4)=2\mathbf v_2\), \(A\mathbf v_3=(4-1,\,-2-1,\,-2-1)=(3,-3,-3)=3\mathbf v_3\). The three eigenvalues \(1,2,3\) are distinct, so by Theorem 2 the three eigenvectors are linearly independent. Three linearly independent vectors in \(\mathbb R^3\) form a basis (the Basis Theorem). No row reduction is needed.
Let \(\mathbf x\) be an eigenvector of \(A\) corresponding to \(\lambda\).
Solution
The definition of eigenvector makes sense for any linear transformation \(T:V\to V\) of a vector space into itself: a nonzero \(\mathbf x\) with \(T(\mathbf x)=\lambda\mathbf x\). For instance, on the space \(\mathbb S\) of signals the transformation \(D(\{x_k\})=\{x_{k+2}\}\) (shift two places to the left) has the eigenvector \(\{\cos(k\pi/2)\}\), because \(\cos((k+2)\pi/2)=\cos(k\pi/2+\pi)=-\cos(k\pi/2)\): the eigenvalue is \(-1\). In this chapter \(V=\mathbb R^n\) and \(T(\mathbf x)=A\mathbf x\).
2.2 The characteristic equation
Day 1 answered "is \(\lambda\) an eigenvalue?" for a given \(\lambda\). To find all eigenvalues of \(A\), recall that \(\lambda\) is an eigenvalue if and only if \(A-\lambda I\) is not invertible, and by the Invertible Matrix Theorem a square matrix is not invertible exactly when its determinant is \(0\). So the eigenvalues are the solutions of a single scalar equation.
The scalar equation \(\det(A-\lambda I)=0\) is the characteristic equation of the \(n\times n\) matrix \(A\). The expression \(\det(A-\lambda I)\) is a polynomial of degree \(n\) in \(\lambda\), the characteristic polynomial of \(A\).
A scalar \(\lambda\) is an eigenvalue of \(A\) if and only if \(\lambda\) satisfies the characteristic equation \(\det(A-\lambda I)=0\).
Find the eigenvalues of \(A=\begin{bmatrix} 2&3\\ 3&-6\end{bmatrix}\).
Solution
\[A-\lambda I=\begin{bmatrix} 2&3\\ 3&-6\end{bmatrix}-\begin{bmatrix} \lambda&0\\ 0&\lambda\end{bmatrix}=\begin{bmatrix} 2-\lambda&3\\ 3&-6-\lambda\end{bmatrix}.\]Using \(\det\begin{bmatrix} a&b\\ c&d\end{bmatrix}=ad-bc\),
\[\det(A-\lambda I)=(2-\lambda)(-6-\lambda)-3\cdot 3=-12-2\lambda+6\lambda+\lambda^2-9=\lambda^2+4\lambda-21=(\lambda-3)(\lambda+7).\]The characteristic equation \((\lambda-3)(\lambda+7)=0\) has the solutions \(\lambda=3\) and \(\lambda=-7\). These are the eigenvalues of \(A\). Figure 3 shows the graph of the characteristic polynomial; the eigenvalues are the points where it crosses the axis.
The characteristic equation also adds one more line to the Invertible Matrix Theorem: since \(0\) is an eigenvalue exactly when \(\det(A-0I)=\det A=0\),
Let \(A\) be an \(n\times n\) matrix. Then \(A\) is invertible if and only if
r. The number \(0\) is not an eigenvalue of \(A\).
Find the characteristic polynomial and the eigenvalues of each matrix.
Solution
Find the eigenvalues of \(A=\begin{bmatrix} 1&-4\\ 4&2\end{bmatrix}\).
Solution
\[\det(A-\lambda I)=(1-\lambda)(2-\lambda)-(-4)(4)=\lambda^2-3\lambda+2+16=\lambda^2-3\lambda+18.\]The discriminant is \((-3)^2-4\cdot 18=9-72=-63\lt 0\), so the characteristic equation has no real solutions. The matrix \(A\) has no real eigenvalues: there is no nonzero vector \(\mathbf v\) in \(\mathbb R^2\) with \(A\mathbf v=\lambda\mathbf v\) for a real number \(\lambda\). In this course the scalars are real numbers, so such a matrix simply has no eigenvalues.
A characteristic polynomial of degree \(n\) has at most \(n\) real roots, so an \(n\times n\) matrix has at most \(n\) distinct eigenvalues. It may have fewer, as in Example 4(c) and Example 5. The clearest geometric case is a rotation.
The matrix \(A=\begin{bmatrix} 0&-1\\ 1&0\end{bmatrix}\) rotates every vector in \(\mathbb R^2\) counterclockwise by \(90^\circ\). Show, in two ways, that \(A\) has no real eigenvalues.
Solution
Algebraically: \(\det(A-\lambda I)=\det\begin{bmatrix} -\lambda&-1\\ 1&-\lambda\end{bmatrix}=\lambda^2+1\), and \(\lambda^2+1=0\) has no real solution.
Geometrically: an eigenvector \(\mathbf v\) would have to satisfy \(A\mathbf v=\lambda\mathbf v\), so \(A\mathbf v\) would lie on the line through \(\mathbf v\) and the origin. But a rotation by \(90^\circ\) turns every nonzero vector onto a perpendicular line (Figure 4). No nonzero vector stays on its own line, so there is no eigenvector.
Self-check only. Write each characteristic polynomial in the form \(\lambda^2+b\lambda+c\) and enter \(b\) and \(c\). Then enter the real eigenvalues in any order; leave a box empty when there are fewer than two.
2.3 Eigenvectors and the difference equation \(\mathbf x_{k+1}=A\mathbf x_k\)
In Week 4 we met the difference equation
\[\mathbf x_{k+1}=A\mathbf x_k\qquad(k=0,1,2,\dots),\]which produces \(\mathbf x_1=A\mathbf x_0\), \(\mathbf x_2=A\mathbf x_1\), and so on, from a starting vector \(\mathbf x_0\). A solution is an explicit formula for \(\mathbf x_k\) that does not go through all the previous terms.
If \(\mathbf x_0\) is an eigenvector of \(A\) with eigenvalue \(\lambda\), the sequence is easy to write down. By Example 2(a), \(A^k\mathbf x_0=\lambda^k\mathbf x_0\), so
\[\mathbf x_k=\lambda^k\mathbf x_0\qquad(k=0,1,2,\dots).\]Linear combinations of such sequences are also solutions: if \(\mathbf v_1,\mathbf v_2\) are eigenvectors with eigenvalues \(\lambda_1,\lambda_2\) and \(\mathbf x_0=c_1\mathbf v_1+c_2\mathbf v_2\), then
\[\mathbf x_k=c_1\lambda_1^k\mathbf v_1+c_2\lambda_2^k\mathbf v_2,\]because \(A\mathbf x_k=c_1\lambda_1^kA\mathbf v_1+c_2\lambda_2^kA\mathbf v_2=c_1\lambda_1^{k+1}\mathbf v_1+c_2\lambda_2^{k+1}\mathbf v_2=\mathbf x_{k+1}\). The weights \(c_1,c_2\) are found by solving the system \([\,\mathbf v_1\ \mathbf v_2\mid\mathbf x_0\,]\), as in Week 10.
Let \(A=\begin{bmatrix} 4&1\\ 2&3\end{bmatrix}\) and \(\mathbf x_0=\begin{bmatrix} 3\\ 0\end{bmatrix}\). Find a formula for the solution of \(\mathbf x_{k+1}=A\mathbf x_k\), and use it to compute \(\mathbf x_2\).
Solution
Step 1: eigenvalues. \(\det(A-\lambda I)=(4-\lambda)(3-\lambda)-2=\lambda^2-7\lambda+10=(\lambda-2)(\lambda-5)\). The eigenvalues are \(5\) and \(2\).
Step 2: eigenvectors. For \(\lambda=5\): \(A-5I=\begin{bmatrix} -1&1\\ 2&-2\end{bmatrix}\), so \(x_1=x_2\) and \(\mathbf v_1=\begin{bmatrix} 1\\ 1\end{bmatrix}\). For \(\lambda=2\): \(A-2I=\begin{bmatrix} 2&1\\ 2&1\end{bmatrix}\), so \(x_2=-2x_1\) and \(\mathbf v_2=\begin{bmatrix} 1\\ -2\end{bmatrix}\). Check: \(A\mathbf v_1=\begin{bmatrix} 5\\ 5\end{bmatrix}\), \(A\mathbf v_2=\begin{bmatrix} 2\\ -4\end{bmatrix}\).
Step 3: write \(\mathbf x_0\) in terms of the eigenvectors. Solve \(c_1\mathbf v_1+c_2\mathbf v_2=\mathbf x_0\): \(c_1+c_2=3\) and \(c_1-2c_2=0\). Subtracting, \(3c_2=3\), so \(c_2=1\) and \(c_1=2\). Thus \(\mathbf x_0=2\mathbf v_1+\mathbf v_2\).
Step 4: the formula.
\[\mathbf x_k=2\cdot 5^k\begin{bmatrix} 1\\ 1\end{bmatrix}+2^k\begin{bmatrix} 1\\ -2\end{bmatrix}=\begin{bmatrix} 2\cdot 5^k+2^k\\ 2\cdot 5^k-2\cdot 2^k\end{bmatrix}\qquad(k=0,1,2,\dots).\]For \(k=2\): \(\mathbf x_2=\begin{bmatrix} 50+4\\ 50-8\end{bmatrix}=\begin{bmatrix} 54\\ 42\end{bmatrix}\). Direct computation agrees: \(\mathbf x_1=A\mathbf x_0=\begin{bmatrix} 12\\ 6\end{bmatrix}\) and \(\mathbf x_2=A\mathbf x_1=\begin{bmatrix} 48+6\\ 24+18\end{bmatrix}=\begin{bmatrix} 54\\ 42\end{bmatrix}\).
The formula shows what the direct computation does not: as \(k\) grows, the term \(2\cdot 5^k\mathbf v_1\) dominates, so \(\mathbf x_k\) moves ever closer to the line through \(\mathbf v_1\).
Self-check only.
Let \(A=\begin{bmatrix} 1&2\\ 2&1\end{bmatrix}\) and \(\mathbf x_0=\begin{bmatrix} 5\\ 1\end{bmatrix}\). The vectors \(\mathbf v_1=\begin{bmatrix} 1\\ 1\end{bmatrix}\) and \(\mathbf v_2=\begin{bmatrix} 1\\ -1\end{bmatrix}\) are eigenvectors of \(A\).
Day 3: Larger Matrices, Multiplicity, and Similarity
Today we compute characteristic polynomials of \(3\times 3\) and triangular matrices with cofactor expansion, count eigenvalues with multiplicity, and show that similar matrices have the same eigenvalues.
3.1 Determinants, revisited
For an \(n\times n\) matrix \(A\), let \(A_{ij}\) be the matrix obtained by deleting row \(i\) and column \(j\). The determinant can be expanded across any row or down any column:
\[\det A=(-1)^{i+1}a_{i1}\det A_{i1}+(-1)^{i+2}a_{i2}\det A_{i2}+\cdots+(-1)^{i+n}a_{in}\det A_{in}\]for the expansion across row \(i\), and similarly down column \(j\). The facts we need are collected in one theorem.
Let \(A\) and \(B\) be \(n\times n\) matrices.
- \(A\) is invertible if and only if \(\det A\neq 0\).
- \(\det AB=(\det A)(\det B)\).
- \(\det A^T=\det A\).
- If \(A\) is triangular, then \(\det A\) is the product of the entries on the main diagonal of \(A\).
- A row replacement operation on \(A\) does not change the determinant. A row interchange changes the sign of the determinant. A row scaling also scales the determinant by the same scalar factor.
Compute the determinant of \(A=\begin{bmatrix} 2&3&1\\ 4&0&-1\\ 0&2&1\end{bmatrix}\). Is \(0\) an eigenvalue of \(A\)?
Solution
Expand down the first column, which has a zero:
\[\det A=2\det\begin{bmatrix} 0&-1\\ 2&1\end{bmatrix}-4\det\begin{bmatrix} 3&1\\ 2&1\end{bmatrix}+0\det\begin{bmatrix} 3&1\\ 0&-1\end{bmatrix}=2(0+2)-4(3-2)+0=0.\]Since \(\det A=0\), \(A\) is not invertible, and so \(0\) is an eigenvalue of \(A\).
3.2 Characteristic polynomials of \(3\times 3\) and triangular matrices
For a \(3\times 3\) matrix, \(\det(A-\lambda I)\) is computed by cofactor expansion. Choose a row or column with zeros; the polynomial then comes out partly factored.
Find the characteristic polynomial and the eigenvalues of \(A=\begin{bmatrix} 6&-2&0\\ -2&9&0\\ 5&8&3\end{bmatrix}\).
Solution
\[A-\lambda I=\begin{bmatrix} 6-\lambda&-2&0\\ -2&9-\lambda&0\\ 5&8&3-\lambda\end{bmatrix}.\]The third column has two zeros, so expand down it. The only nonzero term is the \((3,3)\) entry times its cofactor, with sign \((-1)^{3+3}=+1\):
\[\det(A-\lambda I)=(3-\lambda)\det\begin{bmatrix} 6-\lambda&-2\\ -2&9-\lambda\end{bmatrix}=(3-\lambda)\big[(6-\lambda)(9-\lambda)-4\big]=(3-\lambda)(\lambda^2-15\lambda+50).\]Since \(\lambda^2-15\lambda+50=(\lambda-5)(\lambda-10)\), the characteristic polynomial is \((3-\lambda)(\lambda-5)(\lambda-10)\), and the eigenvalues are \(3\), \(5\) and \(10\). Expanded, the polynomial is \(-\lambda^3+18\lambda^2-95\lambda+150\); the factored form is the useful one.
Find the characteristic polynomial and the eigenvalues of \(A=\begin{bmatrix} 3&-2&3\\ 0&-1&0\\ 6&7&-4\end{bmatrix}\).
Solution
Row 2 of \(A-\lambda I\) is \(\begin{bmatrix} 0&-1-\lambda&0\end{bmatrix}\). Expanding across it, the only term is the \((2,2)\) entry times its cofactor, with sign \((-1)^{2+2}=+1\):
\[\det(A-\lambda I)=(-1-\lambda)\det\begin{bmatrix} 3-\lambda&3\\ 6&-4-\lambda\end{bmatrix}=(-1-\lambda)\big[(3-\lambda)(-4-\lambda)-18\big]=(-1-\lambda)(\lambda^2+\lambda-30).\]With \(\lambda^2+\lambda-30=(\lambda+6)(\lambda-5)\), the eigenvalues are \(-1\), \(-6\) and \(5\).
Find the characteristic equation of \(A=\begin{bmatrix} 5&-2&6&-1\\ 0&3&-8&0\\ 0&0&5&4\\ 0&0&0&1\end{bmatrix}\).
Solution
\(A-\lambda I\) is upper triangular, so by Theorem 3(d) its determinant is the product of its diagonal entries:
\[\det(A-\lambda I)=(5-\lambda)(3-\lambda)(5-\lambda)(1-\lambda)=(5-\lambda)^2(3-\lambda)(1-\lambda).\]The characteristic equation is \((\lambda-5)^2(\lambda-3)(\lambda-1)=0\), or, multiplied out, \(\lambda^4-14\lambda^3+68\lambda^2-130\lambda+75=0\). The eigenvalues are \(5\), \(3\) and \(1\), in agreement with Theorem 1.
The (algebraic) multiplicity of an eigenvalue \(\lambda\) of \(A\) is its multiplicity as a root of the characteristic equation, that is, the number of times the factor \((\lambda-\lambda_0)\) occurs in the characteristic polynomial.
In Example 4, the eigenvalue \(5\) has multiplicity \(2\) and the eigenvalues \(3\) and \(1\) have multiplicity \(1\). Listed with multiplicities, the eigenvalues are \(5,5,3,1\): four numbers for a \(4\times 4\) matrix. In general, an \(n\times n\) matrix has at most \(n\) eigenvalues counted with multiplicity, and fewer when the characteristic polynomial has a factor without real roots.
The characteristic polynomial of a \(6\times 6\) matrix is \(\lambda^6-4\lambda^5-12\lambda^4\). Find the eigenvalues and their multiplicities.
Solution
\[\lambda^6-4\lambda^5-12\lambda^4=\lambda^4(\lambda^2-4\lambda-12)=\lambda^4(\lambda-6)(\lambda+2).\]The eigenvalues are \(0\) (multiplicity \(4\)), \(6\) (multiplicity \(1\)) and \(-2\) (multiplicity \(1\)). The multiplicities add up to \(6\).
To verify that a number \(\lambda\) is an eigenvalue, row reduce \(A-\lambda I\): if it has a pivot in every column, \(\lambda\) is not an eigenvalue. In Example 4, each of \(A-5I\), \(A-3I\) and \(A-I\) has a zero on the diagonal and so a column without a pivot; for any other \(\lambda\), \(A-\lambda I\) has four pivots.
Self-check only. Enter the eigenvalues in any order.
Self-check only. List each distinct eigenvalue once, with its multiplicity, in any order; leave unused rows empty.
| eigenvalue | multiplicity |
|---|---|
| eigenvalue | multiplicity |
|---|---|
3.3 Similar matrices
Let \(A\) and \(B\) be \(n\times n\) matrices. \(A\) is similar to \(B\) if there is an invertible matrix \(P\) such that \(P^{-1}AP=B\), or equivalently \(A=PBP^{-1}\). Writing \(Q=P^{-1}\), the same equation reads \(Q^{-1}BQ=A\), so \(B\) is also similar to \(A\); we simply say that \(A\) and \(B\) are similar. Changing \(A\) into \(P^{-1}AP\) is a similarity transformation.
If \(n\times n\) matrices \(A\) and \(B\) are similar, then they have the same characteristic polynomial and hence the same eigenvalues (with the same multiplicities).
Proof. If \(B=P^{-1}AP\), then, since \(\lambda I=\lambda P^{-1}P=P^{-1}(\lambda I)P\),
\[B-\lambda I=P^{-1}AP-\lambda P^{-1}P=P^{-1}(AP-\lambda P)=P^{-1}(A-\lambda I)P.\]By the multiplicative property, Theorem 3(b),
\[\det(B-\lambda I)=\det\!\big[P^{-1}(A-\lambda I)P\big]=\det(P^{-1})\cdot\det(A-\lambda I)\cdot\det(P).\]Since \(\det(P^{-1})\cdot\det(P)=\det(P^{-1}P)=\det I=1\), we get \(\det(B-\lambda I)=\det(A-\lambda I)\). \(\blacksquare\)
Let \(A=\begin{bmatrix} 7&2\\ -4&1\end{bmatrix}\), \(P=\begin{bmatrix} 1&1\\ -1&-2\end{bmatrix}\) and \(D=\begin{bmatrix} 5&0\\ 0&3\end{bmatrix}\). Verify that \(A=PDP^{-1}\), and use this to find the eigenvalues of \(A\).
Solution
\(\det P=-2+1=-1\), so \(P^{-1}=\dfrac{1}{-1}\begin{bmatrix} -2&-1\\ 1&1\end{bmatrix}=\begin{bmatrix} 2&1\\ -1&-1\end{bmatrix}\). Then
\[PD=\begin{bmatrix} 1&1\\ -1&-2\end{bmatrix}\begin{bmatrix} 5&0\\ 0&3\end{bmatrix}=\begin{bmatrix} 5&3\\ -5&-6\end{bmatrix},\qquad PDP^{-1}=\begin{bmatrix} 5&3\\ -5&-6\end{bmatrix}\begin{bmatrix} 2&1\\ -1&-1\end{bmatrix}=\begin{bmatrix} 10-3&5-3\\ -10+6&-5+6\end{bmatrix}=\begin{bmatrix} 7&2\\ -4&1\end{bmatrix}=A.\]So \(A\) is similar to the diagonal matrix \(D\). By Theorem 4, \(A\) and \(D\) have the same eigenvalues, and the eigenvalues of \(D\) are its diagonal entries (Theorem 1): \(5\) and \(3\). Check with the characteristic polynomial of \(A\): \((7-\lambda)(1-\lambda)+8=\lambda^2-8\lambda+15=(\lambda-5)(\lambda-3)\). Factorizations \(A=PDP^{-1}\) are the subject of next week.
Solution
Theorem 4 goes in one direction only. Two matrices with the same eigenvalues need not be similar: \(\begin{bmatrix} 2&1\\ 0&2\end{bmatrix}\) and \(\begin{bmatrix} 2&0\\ 0&2\end{bmatrix}\) both have the characteristic polynomial \((\lambda-2)^2\), but \(P^{-1}(2I)P=2P^{-1}P=2I\) for every invertible \(P\), so the only matrix similar to \(2I\) is \(2I\) itself.
Similarity is also not row equivalence. Row operations change \(A\) into \(EA\) for an invertible \(E\), not into \(P^{-1}AP\), and they usually change the eigenvalues: \(\begin{bmatrix} 1&2\\ 3&4\end{bmatrix}\) is row equivalent to \(I\), whose only eigenvalue is \(1\), while the characteristic polynomial of \(\begin{bmatrix} 1&2\\ 3&4\end{bmatrix}\) is \((1-\lambda)(4-\lambda)-6=\lambda^2-5\lambda-2\), with the eigenvalues \(\frac{5\pm\sqrt{33}}{2}\).
Self-check only. \(A\) and \(B\) are \(n\times n\) matrices.
Homework 12
- Fill in your name and surname below before you save the PDF.
- Show your work. For each step, name the theorem, the row operation or the reason you use. An answer without the steps that lead to it does not receive full credit.
- Every question has two answer modes: Type and Write by hand. In Write by hand mode the text boxes are replaced by a writing area where you can write with a pen, your finger or the mouse. For each question, only the answer of the selected mode goes into the PDF. Changing the mode does not delete what you entered in the other mode.
- In Type mode, write a vector as
(1, -2, 3), a matrix as[1 2; 3 4](rows separated by semicolons), and a polynomial asL^2 - 3L + 2withLfor \(\lambda\). - To submit: press "Save homework as PDF", choose "Save as PDF" in the print dialog, and upload the file to Canvas.
- Your answers are saved automatically in this browser. If you open the page on a different computer or browser, they will not be there.
Question 125 points
Conclusion, eigenvector and check:
Question 225 points
General solution and basis: