06.09.2021 Views

Linear Algebra, 2020a

Linear Algebra, 2020a

Linear Algebra, 2020a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Section II. Similarity 413<br />

where x and y are scalars that are not both zero.<br />

In contrast, a number that is not an eigenvalue of this map is 2, since<br />

assuming that π doubles a vector leads to the three equations x = 2x, y = 2y,<br />

and 0 = 2z, and thus no non-⃗0 vector is doubled.<br />

Note that the definition requires that the eigenvector be non-⃗0. Some authors<br />

allow ⃗0 as an eigenvector for λ as long as there are also non-⃗0 vectors associated<br />

with λ. The key point is to disallow the trivial case where λ is such that t(⃗v) =λ⃗v<br />

for only the single vector ⃗v = ⃗0.<br />

Also, note that the eigenvalue λ could be 0. The issue is whether ⃗ζ equals ⃗0.<br />

3.3 Example The only transformation on the trivial space {⃗0} is ⃗0 ↦→ ⃗0. This<br />

map has no eigenvalues because there are no non-⃗0 vectors ⃗v mapped to a scalar<br />

multiple λ · ⃗v of themselves.<br />

3.4 Example Consider the homomorphism t: P 1 → P 1 given by c 0 + c 1 x ↦→<br />

(c 0 + c 1 )+(c 0 + c 1 )x. While the codomain P 1 of t is two-dimensional, its range<br />

is one-dimensional R(t) ={c + cx | c ∈ C}. Application of t to a vector in that<br />

range will simply rescale the vector c + cx ↦→ (2c)+(2c)x. That is, t has an<br />

eigenvalue of 2 associated with eigenvectors of the form c + cx, where c ≠ 0.<br />

This map also has an eigenvalue of 0 associated with eigenvectors of the form<br />

c − cx where c ≠ 0.<br />

The definition above is for maps. We can give a matrix version.<br />

3.5 Definition A square matrix T has a scalar eigenvalue λ associated with the<br />

nonzero eigenvector ⃗ζ if T⃗ζ = λ · ⃗ζ.<br />

This extension of the definition for maps to a definition for matrices is natural<br />

but there is a point on which we must take care. The eigenvalues of a map are also<br />

the eigenvalues of matrices representing that map, and so similar matrices have<br />

the same eigenvalues. However, the eigenvectors can differ — similar matrices<br />

need not have the same eigenvectors. The next example explains.<br />

3.6 Example These matrices are similar<br />

( )<br />

2 0<br />

T =<br />

0 0<br />

( )<br />

4 −2<br />

ˆT =<br />

4 −2<br />

since ˆT = PTP −1 for this P.<br />

( )<br />

1 1<br />

P =<br />

1 2<br />

( )<br />

P −1 2 −1<br />

=<br />

−1 1<br />

The matrix T has two eigenvalues, λ 1 = 2 and λ 2 = 0. The first one is associated

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

Saved successfully!

Ooh no, something went wrong!