7.2 Orthogonal Diagonalization: Class Notes
Definition
If and are square matrices, then we say that is orthogonally similar to (or that and are orthogonally similar matrices) if there is an orthogonal matrix such that .
If is orthogonally similar to some diagonal matrix, say , then we say is orthogonally diagonalizable and that orthogonally diagonalizes .
Overview:
Theorem 7.2.1
If is an matrix with real entries, then the following are equivalent.
a) is orthogonally diagonalizable.
b) has an orthonormal set of eigenvectors.
c) is symmetric.
#2
Find the characteristic equation of the given symmetric matrix, and then by inspection determine the dimensions of the eigenspaces.
Solution
Note that this matrix is symmetric and so is orthogonally diagonalizable.
Set and expand along the first row:
Each piece has a factor of :
Answer:
Since the matrix is symmetric, the dimension of each eigenspace is the multiplicity of its eigenvalue:
Answer:
Theorem 7.2.2
If is a symmetric matrix with real entries, then:
a) The eigenvalues of are all real numbers.
b) Eigenvectors from different eigenspaces are orthogonal.
To orthogonally diagonalize an symmetric matrix:
- Step 1: Find a basis for each eigenspace of .
- Step 2: Apply the Gram–Schmidt process to each basis to obtain an orthonormal basis for each eigenspace.
- Step 3: Form whose columns are the vectors from Step 2.
#11
Find a matrix that orthogonally diagonalizes , and determine .
Solution
Since is orthogonal, . Set and expand along the first row:
Factor out the common . The eigenvalues are (multiplicity 1) and (multiplicity 2).
: Row reduce :
gives and gives . Then and give the middle matrix, and gives the last one.
So and :
: Row reduce :
So . Let , :
Any nonzero multiples of these work as basis vectors, so use
These are not orthogonal, so apply Gram–Schmidt:
Use (twice ) to avoid fractions. Then
Answer:
Answer: