Linear Algebra and Its Applications (5th Edition)

Published by Pearson
ISBN 10: 032198238X
ISBN 13: 978-0-32198-238-4

Chapter 5 - Eigenvalues and Eigenvectors - 5.3 Exercises - Page 289: 21

Answer

a.) False b.) True c.) False d.) False

Work Step by Step

a.) False. Indeed, $A = PDP^{-1}$ is the diagonalized form of $A$, however, $D$ cannot be any vector. Matrix $D$ must be a diagonal matrix in which entries are the eigenvalues of $A$. b.) True. From this statement, we can go ahead and build $P$ using the eigenspace basis in $ \mathbb{R}^n$. c.) False. Every matrix will have $n$ eigenvalues (counting multiplicity). However, this does not make it diagonalizable. It must have $n$ linearly independent eigenvectors. d.) False. 0 cannot be an eigenvalue for $A$ to be invertible. Apart from that, there is no relation between diagonalization and invertibility.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.