Difference between revisions of "031 Review Part 1, Problem 2"
Jump to navigation
Jump to search
Kayla Murray (talk | contribs) |
Kayla Murray (talk | contribs) |
||
Line 4: | Line 4: | ||
!Solution: | !Solution: | ||
|- | |- | ||
− | | | + | |Let <math style="vertical-align: -20px">A= |
+ | \begin{bmatrix} | ||
+ | 0 & 1 \\ | ||
+ | 0 & 0 | ||
+ | \end{bmatrix}.</math> | ||
|- | |- | ||
− | | | + | |First, notice that |
|- | |- | ||
| | | | ||
− | + | ::<math style="vertical-align: -20px">A^2= | |
− | \ | + | \begin{bmatrix} |
− | && | + | 0 & 0 \\ |
− | & | + | 0 & 0 |
− | && | + | \end{bmatrix},</math> |
− | & = & | + | |- |
− | + | |which is diagonalizable. | |
+ | |- | ||
+ | |Since <math style="vertical-align: 0px">A</math> is a diagonal matrix, the eigenvalues of <math style="vertical-align: 0px">A</math> are the entries on the diagonal. | ||
+ | |- | ||
+ | |Therefore, the only eigenvalue of <math style="vertical-align: 0px">A</math> is <math style="vertical-align: -1px">0.</math> Additionally, there is only one linearly independent eigenvector. | ||
+ | |- | ||
+ | |Hence, <math style="vertical-align: 0px">A</math> is not diagonalizable and the statement is false. | ||
|} | |} | ||
Line 21: | Line 31: | ||
!Final Answer: | !Final Answer: | ||
|- | |- | ||
− | | | + | | FALSE |
|} | |} | ||
[[031_Review_Part_1|'''<u>Return to Sample Exam</u>''']] | [[031_Review_Part_1|'''<u>Return to Sample Exam</u>''']] |
Revision as of 14:47, 9 October 2017
True or false: If a matrix is diagonalizable, then the matrix must be diagonalizable as well.
Solution: |
---|
Let |
First, notice that |
|
which is diagonalizable. |
Since is a diagonal matrix, the eigenvalues of are the entries on the diagonal. |
Therefore, the only eigenvalue of is Additionally, there is only one linearly independent eigenvector. |
Hence, is not diagonalizable and the statement is false. |
Final Answer: |
---|
FALSE |