Difference between revisions of "031 Review Part 3, Problem 1"

From Grad Wiki
Jump to navigation Jump to search
Line 131: Line 131:
 
{| class="mw-collapsible mw-collapsed" style = "text-align:left;"
 
{| class="mw-collapsible mw-collapsed" style = "text-align:left;"
 
!Step 2:  
 
!Step 2:  
 +
|-
 +
|Now, we find a basis for each eigenspace by solving &nbsp;<math style="vertical-align: -6px">(A-\lambda I)\vec{x}=\vec{0}</math>&nbsp; for each eigenvalue &nbsp;<math style="vertical-align: 0px">\lambda.</math>
 +
|-
 +
|For the eigenvalue &nbsp;<math style="vertical-align: -4px">\lambda=2,</math>&nbsp; we have
 +
|-
 +
|
 +
&nbsp; &nbsp; &nbsp; &nbsp;<math>\begin{array}{rcl}
 +
\displaystyle{A-2I} & = & \displaystyle{\begin{bmatrix}
 +
          2 & 0 & -2 \\
 +
          1 & 3  & 2 \\
 +
          0 & 0 & 3
 +
        \end{bmatrix}-\begin{bmatrix}
 +
          2 & 0 & 0 \\
 +
          0 & 2  & 0 \\
 +
          0 & 0 & 2
 +
        \end{bmatrix}}\\
 +
&&\\
 +
& = & \displaystyle{\begin{bmatrix}
 +
          0 & 0 & -2 \\
 +
          1 & 1  & 2 \\
 +
          0 & 0 & 1
 +
        \end{bmatrix}}\\
 +
&&\\
 +
& \sim & \displaystyle{\begin{bmatrix}
 +
          1 & 1 & 0 \\
 +
          0 & 0  & 1 \\
 +
          0 & 0 & 0
 +
        \end{bmatrix}.}
 +
\end{array}</math>
 +
|-
 +
|We see that &nbsp;<math style="vertical-align: -3px">x_2</math>&nbsp; is a free variable. So, a basis for the eigenspace corresponding to &nbsp;<math style="vertical-align: -1px">2</math>&nbsp; is 
 +
|-
 +
|
 +
::<math>\bigg\{\begin{bmatrix}
 +
          -1  \\
 +
          1 \\
 +
          0 
 +
        \end{bmatrix}\bigg\}.</math>
 +
|}
 +
 +
{| class="mw-collapsible mw-collapsed" style = "text-align:left;"
 +
!Step 3: &nbsp;
 +
|-
 +
|For the eigenvalue &nbsp;<math>\lambda=3,</math>&nbsp; we have
 +
|-
 +
|
 +
&nbsp; &nbsp; &nbsp; &nbsp;<math>\begin{array}{rcl}
 +
\displaystyle{A-3I} & = & \displaystyle{\begin{bmatrix}
 +
          2 & 0 & -2 \\
 +
          1 & 3  & 2 \\
 +
          0 & 0 & 3
 +
        \end{bmatrix}-\begin{bmatrix}
 +
          3 & 0 & 0 \\
 +
          0 & 3  & 0 \\
 +
          0 & 0 & 3
 +
        \end{bmatrix}}\\
 +
&&\\
 +
& = & \displaystyle{\begin{bmatrix}
 +
          -1 & 0 & -2 \\
 +
          1 & 0  & 2 \\
 +
          0 & 0 & 0
 +
        \end{bmatrix}}\\
 +
&&\\
 +
& \sim & \displaystyle{\begin{bmatrix}
 +
          1 & 0 & 2 \\
 +
          0 & 0  & 0 \\
 +
          0 & 0 & 0
 +
        \end{bmatrix}.}
 +
\end{array}</math>
 +
|-
 +
|We see that &nbsp;<math>x_2</math>&nbsp; and &nbsp;<math>x_3</math>&nbsp; are free variables. So, a basis for the eigenspace corresponding to &nbsp;<math>3</math>&nbsp; is 
 +
|-
 +
|
 +
::<math>\bigg\{\begin{bmatrix}
 +
          0  \\
 +
          1 \\
 +
          0 
 +
        \end{bmatrix},\begin{bmatrix}
 +
          -2  \\
 +
          0 \\
 +
          1 
 +
        \end{bmatrix}\bigg\}.</math>
 +
|}
 +
 +
{| class="mw-collapsible mw-collapsed" style = "text-align:left;"
 +
!Step 4: &nbsp;
 +
|-
 +
|Since &nbsp;<math>A</math>&nbsp; has &nbsp;<math>3</math>&nbsp; linearly independent eigenvectors,
 +
|-
 +
|<math>A</math>&nbsp; is diagonalizable by the Diagonalization Theorem.
 +
|-
 +
|Using the Diagonalization Theorem, we can diagonalize &nbsp;<math>A</math>&nbsp; using the information from the steps above.
 +
|-
 +
|So, we have
 
|-
 
|-
 
|
 
|
 +
::<math>D=\begin{bmatrix}
 +
          2 & 0 & 0 \\
 +
          0 & 3  & 0 \\
 +
          0 & 0 & 3
 +
        \end{bmatrix},P=\begin{bmatrix}
 +
          -1 & 0 & -2 \\
 +
          1 & 1  & 0 \\
 +
          0 & 0 & 1
 +
        \end{bmatrix}.</math>
 
|}
 
|}
  
Line 142: Line 245:
  
 
|-
 
|-
|&nbsp;&nbsp; '''(b)''' &nbsp; &nbsp;  
+
|&nbsp;&nbsp; '''(b)''' &nbsp; &nbsp; <math style="vertical-align: 0px">A</math>&nbsp; is diagonalizable and &nbsp;<math>D=\begin{bmatrix}
 +
          2 & 0 & 0 \\
 +
          0 & 3  & 0 \\
 +
          0 & 0 & 3
 +
        \end{bmatrix},P=\begin{bmatrix}
 +
          -1 & 0 & -2 \\
 +
          1 & 1  & 0 \\
 +
          0 & 0 & 1
 +
        \end{bmatrix}.</math>
 
|}
 
|}
 
[[031_Review_Part_3|'''<u>Return to Sample Exam</u>''']]
 
[[031_Review_Part_3|'''<u>Return to Sample Exam</u>''']]

Revision as of 17:05, 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
if and only if    has    linearly independent eigenvectors.


Solution:

(a)

Step 1:  
To answer this question, we examine the eigenvalues and eigenvectors of  
Since    is a triangular matrix, the eigenvalues are the entries on the diagonal.
Hence, the only eigenvalue of    is  
Step 2:  
Now, we find a basis for the eigenspace corresponding to    by solving  
We have
       
Solving this system, we see    is a free variable and  
Therefore, a basis for this eigenspace is
Step 3:  
Now, we know that    only has one linearly independent eigenvector.
By the Diagonalization Theorem,    must have    linearly independent eigenvectors to be diagonalizable.
Hence,    is not diagonalizable.

(b)

Step 1:  
First, we find the eigenvalues of    by solving  
Using cofactor expansion, we have

       

Therefore, setting
 
we find that the eigenvalues of    are    and  
Step 2:  
Now, we find a basis for each eigenspace by solving    for each eigenvalue  
For the eigenvalue    we have

       

We see that    is a free variable. So, a basis for the eigenspace corresponding to    is
Step 3:  
For the eigenvalue    we have

       

We see that    and    are free variables. So, a basis for the eigenspace corresponding to    is
Step 4:  
Since    has    linearly independent eigenvectors,
  is diagonalizable by the Diagonalization Theorem.
Using the Diagonalization Theorem, we can diagonalize    using the information from the steps above.
So, we have


Final Answer:  
   (a)       is not diagonalizable.
   (b)       is diagonalizable and  

Return to Sample Exam