06.09.2021 Views

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

174 SPECTRAL THEORY<br />

Theorem 7.4.4 Let A be an n × n matrix. Then there exists a unitary matrix U such that<br />

U ∗ AU = T, (7.11)<br />

where T is an upper triangular matrix having the eigenvalues of A on the main diagonal<br />

listed according to multiplicity as roots of the characteristic equation.<br />

Proof: The theorem is clearly true if A is a 1 × 1 matrix. Just let U =1the1× 1<br />

matrix which has 1 down the main diagonal and zeros elsewhere. Suppose it is true for<br />

(n − 1) × (n − 1) matrices and let A be an n × n matrix. Then let v 1 be a unit eigenvector<br />

for A . Then there exists λ 1 such that<br />

Av 1 = λ 1 v 1 , |v 1 | =1.<br />

Extend {v 1 } to a basis and then use Lemma 7.4.1 to obtain {v 1 , ··· , v n }, an orthonormal<br />

basis in F n .LetU 0 be a matrix whose i th column is v i . Then from the above, it follows U 0<br />

is unitary. Then U0 ∗ AU 0 is of the form<br />

⎛<br />

⎜<br />

⎝<br />

λ 1 ∗ ··· ∗<br />

0<br />

. A 1<br />

0<br />

where A 1 is an n − 1 × n − 1 matrix. Now by induction there exists an (n − 1) × (n − 1)<br />

unitary matrix Ũ1 such that<br />

Ũ1 ∗ A 1 Ũ 1 = T n−1 ,<br />

an upper triangular matrix. Consider<br />

( ) 1 0<br />

U 1 ≡<br />

0 Ũ1<br />

⎞<br />

⎟<br />

⎠<br />

This is a unitary matrix and<br />

( 1 0<br />

U1 ∗ U0 ∗ AU 0 U 1 =<br />

0 Ũ 1<br />

∗<br />

)(<br />

λ1 ∗<br />

)( 1 0<br />

0 A 1 0 Ũ1<br />

)<br />

=<br />

( )<br />

λ1 ∗<br />

≡ T<br />

0 T n−1<br />

where T is upper triangular. Then let U = U 0 U 1 . Since (U 0 U 1 ) ∗ = U1 ∗ U0 ∗ , it follows A<br />

is similar to T and that U 0 U 1 is unitary. Hence A and T have the same characteristic<br />

polynomials and since the eigenvalues of T are the diagonal entries listed according to<br />

algebraic multiplicity, <br />

As a simple consequence of the above theorem, here is an interesting lemma.<br />

Lemma 7.4.5 Let A be of the form<br />

⎛<br />

⎞<br />

P 1 ··· ∗<br />

⎜<br />

A =<br />

.<br />

⎝<br />

.<br />

. ..<br />

. ⎟<br />

. ⎠<br />

0 ··· P s<br />

where P k is an m k × m k matrix. Then<br />

det (A) = ∏ k<br />

det (P k ) .<br />

Also, the eigenvalues of A consist of the union of the eigenvalues of the P j .

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!