Difference between revisions of "Diagonalization of Matrices"
(Created page with "The prior subsection defines the relation of similarity and shows that, although similar matrices are necessarily matrix equivalent, the converse does not hold. Some matrix-eq...") |
|||
Line 22: | Line 22: | ||
The simplest extension of the partial-identity form is a diagonal form. | The simplest extension of the partial-identity form is a diagonal form. | ||
− | + | <blockquote style="background: white; border: 1px solid black; padding: 1em;">'''Definition 2.1''': | |
− | ;Definition 2.1 | + | : A transformation is '''diagonalizable''' if it has a diagonal representation with respect to the same basis for the codomain as for the domain. A '''diagonalizable matrix''' is one that is similar to a diagonal matrix: <math> T </math> is diagonalizable if there is a nonsingular <math> P </math> such that <math> PTP^{-1} </math> is diagonal. |
− | A transformation is '''diagonalizable''' if it has a diagonal representation with respect to the same basis for the codomain as for the domain. A '''diagonalizable matrix''' is one that is similar to a diagonal matrix: <math> T </math> is diagonalizable if there is a nonsingular <math> P </math> such that <math> PTP^{-1} </math> is diagonal. | + | </blockquote> |
− | |||
− | + | <blockquote style="background: white; border: 1px solid black; padding: 1em;"> | |
− | + | '''Example 2.2''': | |
The matrix | The matrix | ||
Line 59: | Line 58: | ||
\end{pmatrix}^{-1} | \end{pmatrix}^{-1} | ||
</math> | </math> | ||
− | + | </blockquote> | |
− | + | <blockquote style="background: white; border: 1px solid black; padding: 1em;"> | |
− | + | '''Example 2.3''': | |
Not every matrix is diagonalizable. | Not every matrix is diagonalizable. | ||
The square of | The square of | ||
Line 74: | Line 73: | ||
is the zero matrix. Thus, for any map <math>n</math> that <math> N </math> represents (with respect to the same basis for the domain as for the codomain), the composition <math> n\circ n </math> is the zero map. This implies that no such map <math> n </math> can be diagonally represented (with respect to any <math>B,B</math>) because no power of a nonzero diagonal matrix is zero. That is, there is no diagonal matrix in <math>N</math>'s similarity class. | is the zero matrix. Thus, for any map <math>n</math> that <math> N </math> represents (with respect to the same basis for the domain as for the codomain), the composition <math> n\circ n </math> is the zero map. This implies that no such map <math> n </math> can be diagonally represented (with respect to any <math>B,B</math>) because no power of a nonzero diagonal matrix is zero. That is, there is no diagonal matrix in <math>N</math>'s similarity class. | ||
− | + | </blockquote> | |
That example shows that a diagonal form will not do for a | That example shows that a diagonal form will not do for a |
Revision as of 14:05, 8 October 2021
The prior subsection defines the relation of similarity and shows that, although similar matrices are necessarily matrix equivalent, the converse does not hold. Some matrix-equivalence classes break into two or more similarity classes (the nonsingular matrices, for instance). This means that the canonical form for matrix equivalence, a block partial-identity, cannot be used as a canonical form for matrix similarity because the partial-identities cannot be in more than one similarity class, so there are similarity classes without one. This picture illustrates. As earlier in this book, class representatives are shown with stars.
We are developing a canonical form for representatives of the similarity classes. We naturally try to build on our previous work, meaning first that the partial identity matrices should represent the similarity classes into which they fall, and beyond that, that the representatives should be as simple as possible. The simplest extension of the partial-identity form is a diagonal form.
Definition 2.1:
- A transformation is diagonalizable if it has a diagonal representation with respect to the same basis for the codomain as for the domain. A diagonalizable matrix is one that is similar to a diagonal matrix: is diagonalizable if there is a nonsingular such that is diagonal.
Example 2.2: The matrix
is diagonalizable.
Example 2.3: Not every matrix is diagonalizable. The square of
is the zero matrix. Thus, for any map that represents (with respect to the same basis for the domain as for the codomain), the composition is the zero map. This implies that no such map can be diagonally represented (with respect to any ) because no power of a nonzero diagonal matrix is zero. That is, there is no diagonal matrix in 's similarity class.
That example shows that a diagonal form will not do for a canonical form— we cannot find a diagonal matrix in each matrix similarity class. However, the canonical form that we are developing has the property that if a matrix can be diagonalized then the diagonal matrix is the canonical representative of the similarity class. The next result characterizes which maps can be diagonalized.
In the next subsection, we will expand on that example by considering more closely the property of Corollary 2.4. This includes seeing another way, the way that we will routinely use, to find the 's.
Resources
- Diagonalizability, Wikibooks: Linear Algebra