Difference between revisions of "031 Review Part 3, Problem 1"
Jump to navigation
Jump to search
Kayla Murray (talk | contribs) |
Kayla Murray (talk | contribs) |
||
Line 15: | Line 15: | ||
{| class="mw-collapsible mw-collapsed" style = "text-align:left;" | {| class="mw-collapsible mw-collapsed" style = "text-align:left;" | ||
!Foundations: | !Foundations: | ||
+ | |- | ||
+ | |Recall: | ||
+ | |- | ||
+ | |'''1.''' The eigenvalues of a triangular matrix are the entries on the diagonal. | ||
+ | |- | ||
+ | |'''2.''' By the Diagonalization Theorem, an <math style="vertical-align: 0px">n\times n</math> matrix <math style="vertical-align: 0px">A</math> is diagonalizable | ||
|- | |- | ||
| | | | ||
+ | :if and only if <math style="vertical-align: 0px">A</math> has <math style="vertical-align: 0px">n</math> linearly independent eigenvectors. | ||
|} | |} | ||
Revision as of 13:10, 13 October 2017
(a) Is the matrix diagonalizable? If so, explain why and diagonalize it. If not, explain why not.
(b) Is the matrix diagonalizable? If so, explain why and diagonalize it. If not, explain why not.
Foundations: |
---|
Recall: |
1. The eigenvalues of a triangular matrix are the entries on the diagonal. |
2. By the Diagonalization Theorem, an matrix is diagonalizable |
|
Solution:
(a)
Step 1: |
---|
Step 2: |
---|
(b)
Step 1: |
---|
Step 2: |
---|
Final Answer: |
---|
(a) |
(b) |