LeoMath

Foundations of linear algebra · Section 5 of 5

Eigenvalues

Directions along which a map is just a stretch.

about 8 min

Start from a problem

Problem

In most directions a linear map both stretches and turns. Are there directions in which it only stretches?

If so, perhaps those directions can serve as a new coordinate system in which the map becomes extremely simple. We need a definition capturing "direction unchanged", and a way to find such directions.

Observe

Tick "Show eigenvectors", then press "Stretch": two dashed lines appear, one horizontal, one vertical. Vectors along these directions keep their direction after the transformation; only their length is scaled. Press "Shear": only one dashed line remains, the horizontal one. Press "Rotate": the lines vanish.

Interactive experimentLinear transformation
A=
Determinant (signed area) 1
Eigenvalues 1, 1

What did you observe?Play first, then answer. Read the explanation only after you have thought it through.

  1. 1.Drag e₁ and e₂ onto the same line. What happens to the grid, and what is the determinant?
  2. 2.Drag only e₁. Do the origin and the whole vertical line through e₂ move? Why?
  3. 3.Press “Rotate”: the eigenvalues become complex. Is there any line in the plane that maps to itself under a rotation?
Conjecture

Every linear map may have some "special directions" along which it merely stretches. If enough such directions exist, taking them as a new basis makes the map act by scaling each coordinate separately: the simplest kind of matrix, a diagonal one. Rotation has no real such direction; shear has only one.

Definition

Definition 5.1Eigenvalues and eigenvectors

Let A be an n×n matrix. If there are a nonzero vector v and a number λ with

Av=λv,

then λ is an eigenvalue of A and v an eigenvector for λ.

"Nonzero" is essential: A0=λ0 holds for every λ and carries no information.

Try it in the matrix calculator →

Derivation: how to find them

Av=λv⟺(A−λI)v=0. For a nonzero solution v to exist, A−λI must be non-invertible, i.e. (see Matrices)

det⁡(A−λI)=0.
Definition 5.2Characteristic polynomial

pA(λ)=det⁡(A−λI) is the characteristic polynomial of A. For a 2×2 matrix,

pA(λ)=λ2−(tr⁡A)λ+det⁡A,tr⁡A=a+d.
Proof

det⁡(a−λbcd−λ)=(a−λ)(d−λ)−bc=λ2−(a+d)λ+(ad−bc).

Eigenvalues are the roots of the characteristic polynomial. Having found λ, solve (A−λI)v=0 for the eigenvectors.

Example 5.1Three typical cases
  • Stretch (1.6000.7): p=(λ−1.6)(λ−0.7), eigenvalues 1.6,0.7, eigenvectors 𝐞1,𝐞2. Two independent directions.
  • Shear (1101): p=(λ−1)2, only λ=1. (A−I)v=0 forces v2=0, so the eigenvectors are the multiples of 𝐞1 only. A double root gave only one direction.
  • Rotation (0−110): p=λ2+1, no real roots. No real eigen-direction; the eigenvalues are ±i.

The sign of the discriminant (tr⁡A)2−4det⁡A decides which case you are in. The "complex" readout in the experiment means the discriminant is negative.

Theorems and proofs

Theorem 5.1Eigenvectors for distinct eigenvalues are independent

If v1,…,vk are eigenvectors for pairwise distinct eigenvalues λ1,…,λk, they are linearly independent.

Proof

Induction on k; k=1 is clear since v1≠0. Assume the statement for k−1. If c1v1+⋯+ckvk=0, applying A gives c1λ1v1+⋯+ckλkvk=0; subtracting λk times the original relation,

c1(λ1−λk)v1+⋯+ck−1(λk−1−λk)vk−1=0.

By induction all coefficients vanish, and since λi≠λk, c1=⋯=ck−1=0; then ckvk=0 gives ck=0.

Theorem 5.2Diagonalisation

If an n×n matrix A has n independent eigenvectors v1,…,vn, let P=[v1⋯vn] and D=diag⁡(λ1,…,λn). Then

A=PDP−1.
Proof

The j-th column of AP is Avj=λjvj; the j-th column of PD is the j-th column of P times λj, also λjvj. So AP=PD, and P is invertible because its columns are independent.

Meaning: in coordinates built from eigenvectors, A is the diagonal matrix D. The intuition "it only stretches along special directions" has become an exact identity. Shear cannot be diagonalised because it lacks a second independent direction.

Common mistake

Eigenvectors must be nonzero, but an eigenvalue may be 0 (then A has a nontrivial kernel and zero determinant). Also, a double eigenvalue does not guarantee two independent eigenvectors: the shear has only one direction. Algebraic and geometric multiplicity are different things.

Applications

ApplicationPowers of a matrix

Ak=PDkP−1 with Dk=diag⁡(λ1k,…,λnk). The Fibonacci recursion Fn+1=Fn+Fn−1 is (Fn+1Fn)=(1110)(FnFn−1), with eigenvalues 1±52; Binet's formula follows.

ApplicationSecond-order linear differential equations

y′′+py′+qy=0 becomes the first-order system (yy′)′=(01−q−p)(yy′), whose characteristic polynomial is λ2+pλ+q: exactly the textbook "characteristic equation". That is the subject of Second-order linear equations.

Remark

Eigenvalues answer the question "in which directions is this map simplest?" Symmetric matrices always have a full orthogonal set of eigen-directions (the spectral theorem), the shared mathematical basis of principal component analysis, vibration modes and observables in quantum mechanics.

Exercises

0 of 2 done

1
Find the largest eigenvalue of (2112).

Enter the exact value; a fraction such as 1/3 is fine.

2
The eigenvectors of the shear (1101) are
Answer to exercise 2

Discussion

Found a mistake, have a question or a suggestion? You can also write to 620026600@qq.com

No comments yet. Share your understanding, ask a question, or point out an error on this page.

Log in to join the discussion