Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

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.

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

Short Answer

Expert verified

The basis for eigenvalue \(\lambda = 1\)is \(\left( {\begin{array}{*{20}{c}}1\\0\\{ - 1}\end{array}} \right)\)and \(\left( {\begin{array}{*{20}{c}}2\\{ - 1}\\0\end{array}} \right)\)and the basis for eigenvalue \(\lambda = 5\)is \(\left( {\begin{array}{*{20}{c}}1\\1\\1\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

Write the given diagonalization matrix of \(A\) as:

\[\begin{array}{c}A = \left( {\begin{array}{*{20}{c}}2&2&1\\1&3&1\\1&2&2\end{array}} \right)\\ = \left( {\begin{array}{*{20}{c}}1&1&2\\1&0&{ - 1}\\1&{ - 1}&0\end{array}} \right)\left( {\begin{array}{*{20}{c}}5&0&0\\0&1&0\\0&0&1\end{array}} \right)\left( {\begin{array}{*{20}{c}}{\frac{1}{4}}&{\frac{1}{2}}&{\frac{1}{4}}\\{\frac{1}{4}}&{\frac{1}{2}}&{ - \frac{3}{4}}\\{\frac{1}{4}}&{ - \frac{1}{2}}&{\frac{1}{4}}\end{array}} \right)\end{array}\].

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

\[\begin{array}{c}P = \left( {\begin{array}{*{20}{c}}1&1&2\\1&0&{ - 1}\\1&{ - 1}&0\end{array}} \right)\\D = \left( {\begin{array}{*{20}{c}}5&0&0\\0&1&0\\0&0&1\end{array}} \right)\\{P^{ - 1}} = \left( {\begin{array}{*{20}{c}}{\frac{1}{4}}&{\frac{1}{2}}&{\frac{1}{4}}\\{\frac{1}{4}}&{\frac{1}{2}}&{ - \frac{3}{4}}\\{\frac{1}{4}}&{ - \frac{1}{2}}&{\frac{1}{4}}\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} = 1\)and\({\lambda _3} = 1\)

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

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

Thus, the basis for eigenvalue \(\lambda = 1\)is \(\left( {\begin{array}{*{20}{c}}1\\0\\{ - 1}\end{array}} \right)\)and \(\left( {\begin{array}{*{20}{c}}2\\{ - 1}\\0\end{array}} \right)\)and the basis for eigenvalue \(\lambda = 5\)is \(\left( {\begin{array}{*{20}{c}}1\\1\\1\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 an invertible n × n matrix A such that the zero state is a stable equilibrium of the dynamical system x(t+1)=Ax(t)What can you say about the stability of the systems

x(t+1)=-Ax(t)

Define\(T:{{\rm P}_3} \to {\mathbb{R}^4}\)by\(T\left( {\bf{p}} \right) = \left( {\begin{aligned}{{\bf{p}}\left( { - 3} \right)}\\{{\bf{p}}\left( { - 1} \right)}\\{{\bf{p}}\left( 1 \right)}\\{{\bf{p}}\left( 3 \right)}\end{aligned}} \right)\).

  1. Show that \(T\) is a linear transformation.
  2. Find the matrix for \(T\) relative to the basis \(\left\{ {1,t,{t^2},{t^3}} \right\}\)for \({{\rm P}_3}\)and the standard basis for \({\mathbb{R}^4}\).

Let \({\bf{u}}\) be an eigenvector of \(A\) corresponding to an eigenvalue \(\lambda \), and let \(H\) be the line in \({\mathbb{R}^{\bf{n}}}\) through \({\bf{u}}\) and the origin.

  1. Explain why \(H\) is invariant under \(A\) in the sense that \(A{\bf{x}}\) is in \(H\) whenever \({\bf{x}}\) is in \(H\).
  2. Let \(K\) be a one-dimensional subspace of \({\mathbb{R}^{\bf{n}}}\) that is invariant under \(A\). Explain why \(K\) contains an eigenvector of \(A\).

Question: Construct a random integer-valued \(4 \times 4\) matrix \(A\).

  1. Reduce \(A\) to echelon form \(U\) with no row scaling, and use \(U\) in formula (1) (before Example 2) to compute \(\det A\). (If \(A\) happens to be singular, start over with a new random matrix.)
  2. Compute the eigenvalues of \(A\) and the product of these eigenvalues (as accurately as possible).
  3. List the matrix \(A\), and, to four decimal places, list the pivots in \(U\) and the eigenvalues of \(A\). Compute \(\det A\) with your matrix program, and compare it with the products you found in (a) and (b).

Question 19: Let \(A\) be an \(n \times n\) matrix, and suppose A has \(n\) real eigenvalues, \({\lambda _1},...,{\lambda _n}\), repeated according to multiplicities, so that \(\det \left( {A - \lambda I} \right) = \left( {{\lambda _1} - \lambda } \right)\left( {{\lambda _2} - \lambda } \right) \ldots \left( {{\lambda _n} - \lambda } \right)\) . Explain why \(\det A\) is the product of the n eigenvalues of A. (This result is true for any square matrix when complex eigenvalues are considered.)

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