Question: In Exercises \({\bf{5}}\) and \({\bf{6}}\), the matrix \(A\) is factored in the form \(PD{P^{ - {\bf{1}}}}\). Use the Diagonalization Theorem to find the eigenvalues of \(A\) and a basis for each eigenspace.

6. \(\left( {\begin{array}{*{20}{c}}{\bf{4}}&{\bf{0}}&{{\bf{ - 2}}}\\{\bf{2}}&{\bf{5}}&{\bf{4}}\\{\bf{0}}&{\bf{0}}&{\bf{5}}\end{array}} \right){\bf{ = }}\left( {\begin{array}{*{20}{c}}{{\bf{ - 2}}}&{\bf{0}}&{{\bf{ - 1}}}\\{\bf{0}}&{\bf{1}}&{\bf{2}}\\{\bf{1}}&{\bf{0}}&{\bf{0}}\end{array}} \right)\left( {\begin{array}{*{20}{c}}{\bf{5}}&{\bf{0}}&{\bf{0}}\\{\bf{0}}&{\bf{5}}&{\bf{0}}\\{\bf{0}}&{\bf{0}}&4\end{array}} \right)\left( {\begin{array}{*{20}{c}}{\bf{0}}&{\bf{0}}&{\bf{1}}\\{\bf{2}}&{\bf{1}}&{\bf{4}}\\{{\bf{ - 1}}}&{\bf{0}}&{{\bf{ - 2}}}\end{array}} \right)\)

Short Answer

Expert verified

The basis for eigenvalue \(\lambda = 5\)is \(\left( {\begin{array}{*{20}{c}}0\\1\\0\end{array}} \right)\)and \(\left( {\begin{array}{*{20}{c}}{ - 2}\\0\\1\end{array}} \right)\)and the basis for eigenvalue \(\lambda = 4\)is \(\left( {\begin{array}{*{20}{c}}{ - 1}\\2\\0\end{array}} \right)\).

Step by step solution

01

Write the Diagonalization Theorem

The Diagonalization Theorem:An \(n \times n\) matrix \(A\) is diagonalizable if and only if \(A\) has \(n\) linearly independent eigenvectors. As \(A = PD{P^{ - 1}}\) which has \(D\) a diagonal matrix if and only if the columns of \(P\) are \(n\) linearly independent eigenvectors of \(A\).

02

Find the inverse of the invertible matrix

Consider the given diagonalization matrix of \(A\) as \(A = \left( {\begin{array}{*{20}{c}}4&0&{ - 2}\\2&5&4\\0&0&5\end{array}} \right) = \left( {\begin{array}{*{20}{c}}{ - 2}&0&{ - 1}\\0&1&2\\1&0&0\end{array}} \right)\left( {\begin{array}{*{20}{c}}5&0&0\\0&5&0\\0&0&4\end{array}} \right)\left( {\begin{array}{*{20}{c}}0&0&1\\2&1&4\\{ - 1}&0&{ - 2}\end{array}} \right)\).

Compare diagonalization matrix of \(A\) with \(A = PD{P^{ - 1}}\).

\[\begin{array}{c}P = \left( {\begin{array}{*{20}{c}}{ - 2}&0&{ - 1}\\0&1&2\\1&0&0\end{array}} \right)\\D = \left( {\begin{array}{*{20}{c}}5&0&0\\0&5&0\\0&0&4\end{array}} \right)\\{P^{ - 1}} = \left( {\begin{array}{*{20}{c}}0&0&1\\2&1&4\\{ - 1}&0&{ - 2}\end{array}} \right)\end{array}\]

03

Find Eigenvalues and Eigenvectors

According to the diagonal entries of the matrix, \(D\) there are three eigenvalues.

\({\lambda _1} = 5\), \({\lambda _2} = 4\)and\({\lambda _3} = 5\)

The three eigenvectors are columns of the matrix \(P\).

\[{{\bf{v}}_{\bf{1}}} = \left( {\begin{array}{*{20}{c}}{ - 2}\\0\\1\end{array}} \right), {{\bf{v}}_2} = \left( {\begin{array}{*{20}{c}}0\\1\\0\end{array}} \right), {{\bf{v}}_3} = \left( {\begin{array}{*{20}{c}}{ - 1}\\2\\0\end{array}} \right)\]

Thus, the basis for eigenvalue \(\lambda = 5\) is \(\left( {\begin{array}{*{20}{c}}0\\1\\0\end{array}} \right)\) and \(\left( {\begin{array}{*{20}{c}}{ - 2}\\0\\1\end{array}} \right)\) and the basis for eigenvalue \(\lambda = 4\) is \(\left( {\begin{array}{*{20}{c}}{ - 1}\\2\\0\end{array}} \right)\).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Consider the growth of a lilac bush. The state of this lilac bush for several years (at year’s end) is shown in the accompanying sketch. Let n(t) be the number of new branches (grown in the year t) and a(t) the number of old branches. In the sketch, the new branches are represented by shorter lines. Each old branch will grow two new branches in the following year. We assume that no branches ever die.

(a) Find the matrix A such that [nt+1at+1]=A[ntat]

(b) Verify that [11]and [2-1] are eigenvectors of A. Find the associated eigenvalues.

(c) Find closed formulas for n(t) and a(t).

Question: Let \(A = \left( {\begin{array}{*{20}{c}}{.5}&{.2}&{.3}\\{.3}&{.8}&{.3}\\{.2}&0&{.4}\end{array}} \right)\), \({{\rm{v}}_1} = \left( {\begin{array}{*{20}{c}}{.3}\\{.6}\\{.1}\end{array}} \right)\), \({{\rm{v}}_2} = \left( {\begin{array}{*{20}{c}}1\\{ - 3}\\2\end{array}} \right)\), \({{\rm{v}}_3} = \left( {\begin{array}{*{20}{c}}{ - 1}\\0\\1\end{array}} \right)\) and \({\rm{w}} = \left( {\begin{array}{*{20}{c}}1\\1\\1\end{array}} \right)\).

  1. Show that \({{\rm{v}}_1}\), \({{\rm{v}}_2}\), and \({{\rm{v}}_3}\) are eigenvectors of \(A\). (Note: \(A\) is the stochastic matrix studied in Example 3 of Section 4.9.)
  2. Let \({{\rm{x}}_0}\) be any vector in \({\mathbb{R}^3}\) with non-negative entries whose sum is 1. (In section 4.9, \({{\rm{x}}_0}\) was called a probability vector.) Explain why there are constants \({c_1}\), \({c_2}\), and \({c_3}\) such that \({{\rm{x}}_0} = {c_1}{{\rm{v}}_1} + {c_2}{{\rm{v}}_2} + {c_3}{{\rm{v}}_3}\). Compute \({{\rm{w}}^T}{{\rm{x}}_0}\), and deduce that \({c_1} = 1\).
  3. For \(k = 1,2, \ldots ,\) define \({{\rm{x}}_k} = {A^k}{{\rm{x}}_0}\), with \({{\rm{x}}_0}\) as in part (b). Show that \({{\rm{x}}_k} \to {{\rm{v}}_1}\) as \(k\) increases.

[M] In Exercises 19 and 20, find (a) the largest eigenvalue and (b) the eigenvalue closest to zero. In each case, set \[{{\bf{x}}_{\bf{0}}}{\bf{ = }}\left( {{\bf{1,0,0,0}}} \right)\] and carry out approximations until the approximating sequence seems accurate to four decimal places. Include the approximate eigenvector.

20. \[A{\bf{ = }}\left[ {\begin{array}{*{20}{c}}{\bf{1}}&{\bf{2}}&{\bf{3}}&{\bf{2}}\\{\bf{2}}&{{\bf{12}}}&{{\bf{13}}}&{{\bf{11}}}\\{{\bf{ - 2}}}&{\bf{3}}&{\bf{0}}&{\bf{2}}\\{\bf{4}}&{\bf{5}}&{\bf{7}}&{\bf{2}}\end{array}} \right]\]

Let\(G = \left( {\begin{aligned}{*{20}{c}}A&X\\{\bf{0}}&B\end{aligned}} \right)\). Use formula\(\left( {\bf{1}} \right)\)for the determinant in section\({\bf{5}}{\bf{.2}}\)to explain why\(\det G = \left( {\det A} \right)\left( {\det B} \right)\). From this, deduce that the characteristic polynomial of\(G\)is the product of the characteristic polynomials of\(A\)and\(B\).

Question: For the matrices in Exercises 15-17, list the eigenvalues, repeated according to their multiplicities.

17. \(\left[ {\begin{array}{*{20}{c}}3&0&0&0&0\\- 5&1&0&0&0\\3&8&0&0&0\\0&- 7&2&1&0\\- 4&1&9&- 2&3\end{array}} \right]\)

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free