← Back to Math 010

7.2 Orthogonal Diagonalization: Class Notes

Definition

If A and B are square matrices, then we say that B is orthogonally similar to A (or that A and B are orthogonally similar matrices) if there is an orthogonal matrix P such that B=PTAP.

If A is orthogonally similar to some diagonal matrix, say PTAP=D, then we say A is orthogonally diagonalizable and that P orthogonally diagonalizes A.

Overview:

A → λi → 𝐩i → Gram–Schmidt → P (orthogonal)

PTAP=D(P−1=PT)

Theorem 7.2.1

If A is an n×n matrix with real entries, then the following are equivalent.

a) A is orthogonally diagonalizable.

b) A has an orthonormal set of n eigenvectors.

c) A is symmetric.

#2

Find the characteristic equation of the given symmetric matrix, and then by inspection determine the dimensions of the eigenspaces.

[1−42−41−22−2−2]

Solution

Note that this matrix is symmetric and so is orthogonally diagonalizable.

Set det(λI−A)=0 and expand along the first row:

|λ−14−24λ−12−22λ+2|=0

(λ−1)|λ−122λ+2|−4|42−2λ+2|−2|4λ−1−22|=0

(λ−1)(λ2+λ−6)−4(4λ+8+4)−2(8+2λ−2)=0

Each piece has a factor of (λ+3):

(λ−1)(λ+3)(λ−2)−4·4(λ+3)−2·2(λ+3)=0

(λ+3)[(λ−1)(λ−2)−16−4]=0(λ+3)(λ2−3λ−18)=0(λ+3)2(λ−6)=0

Answer: Characteristic equation: (λ+3)2(λ−6)=0

Since the matrix is symmetric, the dimension of each eigenspace is the multiplicity of its eigenvalue:

Answer: λ=6: dim 1,λ=−3: dim 2

Theorem 7.2.2

If A is a symmetric matrix with real entries, then:

a) The eigenvalues of A are all real numbers.

b) Eigenvectors from different eigenspaces are orthogonal.

To orthogonally diagonalize an n×n symmetric matrix:

#11

Find a matrix P that orthogonally diagonalizes A, and determine P−1AP.

A=[2−1−1−12−1−1−12]

Solution

Since P is orthogonal, P−1AP=PTAP=D. Set det(λI−A)=0 and expand along the first row:

|λ−2111λ−2111λ−2|=0

(λ−2)|λ−211λ−2|−1|111λ−2|+1|1λ−211|=0

(λ−2)[(λ−2)2−1]−(λ−2−1)+(1−λ+2)=0(λ−2)(λ2−4λ+3)−(λ−3)−(λ−3)=0(λ−2)(λ−3)(λ−1)−2(λ−3)=0(λ−3)[(λ−2)(λ−1)−2]=0(λ−3)(λ2−3λ)=0 ⇒ λ(λ−3)2=0

Factor out the common (λ−3). The eigenvalues are λ=0 (multiplicity 1) and λ=3 (multiplicity 2).

λ=0: Row reduce 0I−A:

[−2111−2111−2] → [−21101−1000] → [−20201−1000]

R2→R1+2R2 gives (0,−3,3) and R3→R1+2R3 gives (0,3,−3). Then R2→−13R2 and R3→R3+3R2 give the middle matrix, and R1→R1−R2 gives the last one.

So x1=x3 and x2=x3:

𝐱=[111]t⇒𝐩1=(1,1,1)‖(1,1,1)‖=[1/31/31/3]

λ=3: Row reduce 3I−A:

[111111111] → [111000000]

So x1=−x2−x3. Let s=x2, t=x3:

𝐱=[−110]s+[−101]t

Any nonzero multiples of these work as basis vectors, so use

𝐮1=[1−10],𝐮2=[10−1]

These are not orthogonal, so apply Gram–Schmidt:

𝐯1=𝐮1𝐯2=𝐮2−⟨𝐮2,𝐯1⟩‖𝐯1‖2𝐯1=[10−1]−12[1−10]=[1/21/2−1]

Use 𝐯2′=[11−2] (twice 𝐯2) to avoid fractions. Then

𝐩2=𝐯1‖𝐯1‖=[1/2−1/20],𝐩3=𝐯2′‖𝐯2′‖=[1/61/6−2/6]

Answer: P=[𝐩1𝐩2𝐩3]=[1/31/21/61/3−1/21/61/30−2/6]

Answer: P−1AP=PTAP=[000030003]=D