/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q14E In Exercises 9–16, find a basi... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

In Exercises 9–16, find a basis for the eigenspace corresponding to each listed eigenvalue.

14. \(A = \left( {\begin{array}{*{20}{c}}1&0&{ - 1}\\1&{ - 3}&0\\4&{ - 13}&1\end{array}} \right)\), \(\lambda = - 2\)

Short Answer

Expert verified

For \(\lambda = - 2\): \(\left( {\begin{array}{*{20}{c}}{\frac{1}{3}}\\{\frac{1}{3}}\\1\end{array}} \right)\) or \(\left( {\begin{array}{*{20}{c}}1\\1\\3\end{array}} \right)\).

Step by step solution

01

Definitions

Eigenvalue: Let \(\lambda \) is a scaler, \(A\) is an \(n \times n\) matrix and \({\bf{x}}\) is an eigenvector corresponding to \(\lambda \), \(\lambda \) is said to an eigenvalue of the matrix \(A\) if there exists a nontrivial solution \({\bf{x}}\) of \(A{\bf{x}} = \lambda {\bf{x}}\).

Eigenvector: For a \(n \times n\) matrix \(A\), whose eigenvalue is \(\lambda \), the set of a subspace of \({\mathbb{R}^n}\) is known as an eigenspace, where the set of the subspace of is the set of all the solutions of \(\left( {A - \lambda I} \right){\bf{x}} = 0\).

02

Find a basis of eigenspace for \(\lambda  =  - {\bf{2}}\)

The given matrix is \(A = \left( {\begin{array}{*{20}{c}}1&0&{ - 1}\\1&{ - 3}&0\\4&{ - 13}&1\end{array}} \right)\), where \(\lambda = - 2\).

As, \(\lambda = - 2\) are the eigenvalue of the matrix \(A\), so they satisfy the equation \(A{\bf{x}} = \lambda {\bf{x}}\).

For \(\lambda = - 2\), solve \(\left( {A - \lambda I} \right){\bf{x}} = 0\), for which first evaluate \(\left( {A - \lambda I} \right)\).

\(\begin{array}{c}\left( {A + 2I} \right) = \left( {\begin{array}{*{20}{c}}1&0&{ - 1}\\1&{ - 3}&0\\4&{ - 13}&1\end{array}} \right) + 2\left( {\begin{array}{*{20}{c}}1&0&0\\0&1&0\\0&0&1\end{array}} \right)\\ = \left( {\begin{array}{*{20}{c}}1&0&{ - 1}\\1&{ - 3}&0\\4&{ - 13}&1\end{array}} \right) + \left( {\begin{array}{*{20}{c}}2&0&0\\0&2&0\\0&0&2\end{array}} \right)\\ = \left( {\begin{array}{*{20}{c}}3&0&{ - 1}\\1&{ - 1}&0\\4&{ - 13}&3\end{array}} \right)\end{array}\)

Write the obtained matrix in the form of an augmented matrix, where for \(A{\bf{x}} = 0\), the augmented matrix given by \(\left( {\begin{array}{*{20}{c}}A&0\end{array}} \right)\).

\(\left( {\begin{array}{*{20}{c}}3&0&{ - 1}&0\\1&{ - 1}&0&0\\4&{ - 13}&3&0\end{array}} \right)\)

The obtained matrix is not in a reduced form, so reduce it in row echelon form by applying row operations.

\(\begin{gathered} \hfill \left( {\begin{array}{*{20}{c}} 3&0&{ - 1}&0 \\ 1&{ - 1}&0&0 \\ 4&{ - 13}&3&0 \end{array}} \right)\xrightarrow{{{R_1} \to \frac{{{R_1}}}{3}}}\left( {\begin{array}{*{20}{c}} 1&0&{ - \frac{1}{3}}&0 \\ 1&{ -1}&0&0 \\ 4&{ - 13}&3&0 \end{array}} \right) \\ \hfill \xrightarrow({{R_3} \to {R_3} - 4{R_1}}){{{R_2} \to {R_2} - {R_1}}}\left( {\begin{array}{*{20}{c}} 1&0&{ - \frac{1}{3}}&0 \\ 0&{ - 1}&{\frac{1}{3}}&0 \\ 0&{ - 13}&{\frac{{13}}{3}}&0 \end{array}} \right) \\ \hfill \xrightarrow{{{R_2} \to - {R_2}}}\left( {\begin{array}{*{20}{c}} 1&0&{ - \frac{1}{3}}&0 \\ 0&1&{ - \frac{1}{3}}&0 \\ 0&{ - 13}&{\frac{{13}}{3}}&0 \end{array}} \right) \\ \hfill \xrightarrow{{{R_3} \to {R_3} + 13{R_2}}}\left( {\begin{array}{*{20}{c}} 1&0&{ - \frac{1}{3}}&0 \\ 0&1&{ - \frac{1}{3}}&0 \\ 0&0&0&0 \end{array}} \right) \\ \end{gathered} \)

Write a system of equations corresponding to the obtained matrix.

\(\begin{array}{c}{x_1} - \frac{1}{3}{x_3} = 0\\{x_2} - \frac{1}{3}{x_3} = 0\\{x_3},{\rm{ free variable}}\end{array}\)

As \({x_3}\) is a free variable, let \({x_3} = 1\). Then,

\(\begin{array}{c}{x_1} = \frac{1}{3}\\{x_2} = \frac{1}{3}\\{x_3} = 1\end{array}\)

So, the general solution is given as:

\(\left( {\begin{array}{*{20}{c}}{{x_1}}\\{{x_2}}\\{{x_3}}\end{array}} \right) = {x_2}\left( {\begin{array}{*{20}{c}}{\frac{1}{3}}\\{\frac{1}{3}}\\1\end{array}} \right)\)

So, \(\left( {\begin{array}{*{20}{c}}{\frac{1}{3}}\\{\frac{1}{3}}\\1\end{array}} \right)\) or \(\left( {\begin{array}{*{20}{c}}1\\1\\3\end{array}} \right)\) is the basis for the eigenspace for \(\lambda = - 2\).

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 91Ó°ÊÓ!

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

Exercises 19–23 concern the polynomial \(p\left( t \right) = {a_{\bf{0}}} + {a_{\bf{1}}}t + ... + {a_{n - {\bf{1}}}}{t^{n - {\bf{1}}}} + {t^n}\) and \(n \times n\) matrix \({C_p}\) called the companion matrix of \(p\): \({C_p} = \left( {\begin{aligned}{*{20}{c}}{\bf{0}}&{\bf{1}}&{\bf{0}}&{...}&{\bf{0}}\\{\bf{0}}&{\bf{0}}&{\bf{1}}&{}&{\bf{0}}\\:&{}&{}&{}&:\\{\bf{0}}&{\bf{0}}&{\bf{0}}&{}&{\bf{1}}\\{ - {a_{\bf{0}}}}&{ - {a_{\bf{1}}}}&{ - {a_{\bf{2}}}}&{...}&{ - {a_{n - {\bf{1}}}}}\end{aligned}} \right)\).

20. Let \(p\left( t \right){\bf{ = }}\left( {t{\bf{ - 2}}} \right)\left( {t{\bf{ - 3}}} \right)\left( {t{\bf{ - 4}}} \right){\bf{ = - 24 + 26}}t{\bf{ - 9}}{t^{\bf{2}}}{\bf{ + }}{t^{\bf{3}}}\). Write the companion matrix for \(p\left( t \right)\), and use techniques from chapter \({\bf{3}}\) to find the characteristic polynomial.

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)=A-1x→(t)

(M)The MATLAB command roots\(\left( p \right)\) computes the roots of the polynomial equation \(p\left( t \right) = {\bf{0}}\). Read a MATLAB manual, and then describe the basic idea behind the algorithm for the roots command.

Mark each statement as True or False. Justify each answer.

a. If \(A\) is invertible and 1 is an eigenvalue for \(A\), then \(1\) is also an eigenvalue of \({A^{ - 1}}\)

b. If \(A\) is row equivalent to the identity matrix \(I\), then \(A\) is diagonalizable.

c. If \(A\) contains a row or column of zeros, then 0 is an eigenvalue of \(A\)

d. Each eigenvalue of \(A\) is also an eigenvalue of \({A^2}\).

e. Each eigenvector of \(A\) is also an eigenvector of \({A^2}\)

f. Each eigenvector of an invertible matrix \(A\) is also an eigenvector of \({A^{ - 1}}\)

g. Eigenvalues must be nonzero scalars.

h. Eigenvectors must be nonzero vectors.

i. Two eigenvectors corresponding to the same eigenvalue are always linearly dependent.

j. Similar matrices always have exactly the same eigenvalues.

k. Similar matrices always have exactly the same eigenvectors.

I. The sum of two eigenvectors of a matrix \(A\) is also an eigenvector of \(A\).

m. The eigenvalues of an upper triangular matrix \(A\) are exactly the nonzero entries on the diagonal of \(A\).

n. The matrices \(A\) and \({A^T}\) have the same eigenvalues, counting multiplicities.

o. If a \(5 \times 5\) matrix \(A\) has fewer than 5 distinct eigenvalues, then \(A\) is not diagonalizable.

p. There exists a \(2 \times 2\) matrix that has no eigenvectors in \({A^2}\)

q. If \(A\) is diagonalizable, then the columns of \(A\) are linearly independent.

r. A nonzero vector cannot correspond to two different eigenvalues of \(A\).

s. A (square) matrix \(A\) is invertible if and only if there is a coordinate system in which the transformation \({\bf{x}} \mapsto A{\bf{x}}\) is represented by a diagonal matrix.

t. If each vector \({{\bf{e}}_j}\) in the standard basis for \({A^n}\) is an eigenvector of \(A\), then \(A\) is a diagonal matrix.

u. If \(A\) is similar to a diagonalizable matrix \(B\), then \(A\) is also diagonalizable.

v. If \(A\) and \(B\) are invertible \(n \times n\) matrices, then \(AB\)is similar to \ (BA\ )

w. An \(n \times n\) matrix with \(n\) linearly independent eigenvectors is invertible.

x. If \(A\) is an \(n \times n\) diagonalizable matrix, then each vector in \({A^n}\) can be written as a linear combination of eigenvectors of \(A\).

Question: In Exercises \({\bf{3}}\) and \({\bf{4}}\), use the factorization \(A = PD{P^{ - {\bf{1}}}}\) to compute \({A^k}\) where \(k\) represents an arbitrary positive integer.

3. \(\left( {\begin{array}{*{20}{c}}a&0\\{3\left( {a - b} \right)}&b\end{array}} \right) = \left( {\begin{array}{*{20}{c}}1&0\\3&1\end{array}} \right)\left( {\begin{array}{*{20}{c}}a&0\\0&b\end{array}} \right)\left( {\begin{array}{*{20}{c}}1&0\\{ - 3}&1\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.