Symmetric Matrices
Symmetric matrix. A square matrix



Theorem for eigenvectors.
If is symmetric, then two eigenvectors corresponding to different eigenvalues are
orthogonal.
Proof.
Let
and
be eigenvectors corresponding to the different eigenvalues
and
.
By applying the symmetry of
we obtain
Orthogonal diagonalizability.
Assume that the symmetric matrix is diagonalizable,
that is, that the algebraic multiplicity is equal to the geometric multiplicity for each eigenvalue.
Then we can find a orthonormal set
of eigenvectors,
and construct the orthogonal matrix



Characterization of symmetric matrices. In fact, every symmetric matrix is orthogonally diagonalizable, which equivalently characterizes a symmetric matrix. That is, we have the following theorme.
Theorem.
A square matrix is orthogonally diagonalizable if and only if
is symmetric.
Spectral decomposition.
Equivalently the symmetric matrix has a spectral decomposition

EXAMPLE 3.
Let
be a symmetric matrix.
Find orthonormal basis for each eigenspace corresponding
the eigenvalue of
and
.
Orthogonally diagonalize the matrix
.
© TTU Mathematics