Theorem

Proof by Induction
We prove the Spectral Theorem for real symmetric matrices by induction on the dimension n.

Base Case

Induction Hypothesis

Inductive Step: The n × n Case
Find the Characteristic Polynomial of A
The characteristic polynomial of A is used to establish the existence of an eigenvalue and corresponding eigenvector.

Recall the Fundamental Theorem of Algebra



Show that λ1 is Real for a Symmetric Matrix
Since A is real and symmetric, we show that the eigenvalue λ1 must be real.



Normalize the Eigenvector of λ1

Construct the Orthogonal Complement
We construct Q2 with orthonormal columns spanning the subspace orthogonal to q1.

Show the Columns of Q2 are Invariant Under A
We show that Aqk ∈ Col(Q2) for every column qk of Q2, establishing that the column space of Q2 is invariant under A.



Restrict A to the Column Space of Q2
We define B = Q2TAQ2, representing the restriction of A to the (n − 1) dimensional subspace Col(Q2).

Show that B is Symmetric

Show that Q2B = AQ2


Apply the Induction Hypothesis
Since B is a real symmetric (n − 1) × (n − 1) matrix, the induction hypothesis applies to B.

Find the Remaining Eigenvectors of A


Show W has Orthonormal Columns

Define the Matrices of Eigenvectors and Eigenvalues of A

Show Q is Orthogonal


Show A = QDQT
Combining the orthonormal eigenvectors of A gives the orthogonal diagonalization A = QDQT, completing the proof of the Spectral Theorem.


2 thoughts on “Proof of the Spectral Theorem for Real Symmetric Matrices”