Skip to article frontmatterSkip to article content

9.1 Eigenvalues of Symmetric Matrices

factorizing symmetric matrices

Dept. of Electrical and Systems Engineering
University of Pennsylvania

Binder

Lecture notes

1Reading

Material related to this page, as well as additional exercises, can be found in ALA 8.5.

2Learning Objectives

By the end of this page, you should know:

  • the properties of eigenvalues and eigenvectors of symmetric matrices
  • the Spectral theorem
  • the geometric interpretation of a linear transformation when the matrix is symmetric

3Symmetric Matrix

A square matrix AA is said to be symmetric if A=ATA = A^T. For example, all 2×2 symmetric and 3×3 symmetric matrices are of the form:

[abbc]and[abcbdecef]\begin{bmatrix} a & b \\ b & c \end{bmatrix} \quad \text{and} \quad \begin{bmatrix} a & b & c \\ b & d & e \\ c & e & f \end{bmatrix}

Symmetric matrices arise in many practical contexts: an important one we will spend time on next lecture are covariance matrices. For now, we simply take them as a family of interesting matrices.

Symmetric matrices enjoy many interesting properties, including the following one which will be the focus of this lecture:

We’ll spend the rest of this lecture exploring the consequences of this remarkable theorem, before diving into applications over the next few lectures.

First, we work through a few simple examples to see this theorem in action.

4The Spectral Theorem

The theorem above tells us that every real, symmetric matrix admits an eigenvector basis, and hence is diagonalizable. Furthermore, we can always choose eigenvectors that form an orthonormal basis—hence, the diagonalizing matrix takes a particularly simple form.

Remember that a matrix QRn×nQ \in \mathbb{R}^{n \times n} is orthogonal if and only if its columns form an orthonormal basis of Rn\mathbb{R}^n. Alternatively, we can characterize orthogonal matrices by the condition that QTQ=QQT=IQ^T Q = Q Q^T = I, i.e., Q1=QTQ^{-1} = Q^T.

If we use this orthonormal eigenbasis when diagonalizing a symmetric matrix AA, we obtain its spectral factorization:

5Geometric Interpretation

You can always choose QQ to have detQ=1\det Q = 1; such a QQ represents a rotation. Thus the diagonalization of a symmetric matrix can be interpreted as a rotation of the coordinate system so that the orthogonal eigenvectors align with the coordinate axes. Therefore, the linear transformation L(x)=AxL(\vv x) = A\vv x for which AA has all positive eigenvalues can be interpreted as a combination of stretches in nn mutually orthogonal directions. One way to visualize this is to consider what L(x)L(\vv x) does to the unit Euclidean sphere S={xRnx=1}S = \{ \vv x \in \mathbb{R}^n \mid \|\vv x\| = 1\}: stretching it in orthogonal directions will transform it into an ellipsoid : E=L(S)={Axx=1}E = L(S) = \{ A\vv x \mid \|\vv x\| = 1\} whose principal axes are the directions of stretch, i.e., the eigenvectors of AA.

Ellipse

Binder