Eigenvalues and Eigenspaces

Find directions preserved by a square transformation and separate eigenvalues from eigenvectors.

Builds on Least Squares and Data Fitting

The bigger question: Which directions keep their identity as a system evolves?

On this page

A direction that only scales

For a square matrix AA, a nonzero vector vv is an eigenvector with eigenvalue λ\lambda if Av=λvAv=\lambda v. Rearranging gives (A−λI)v=0(A-\lambda I)v=0. A nonzero solution exists exactly when det⁡(A−λI)=0\det(A-\lambda I)=0, the characteristic equation.

For each eigenvalue, its eigenspace is N(A−λI)N(A-\lambda I), including zero. Zero belongs to the eigenspace as a subspace but is never itself called an eigenvector. Any nonzero scalar multiple of an eigenvector represents the same eigen-direction.

Visual guide

VISUAL GUIDEAn eigenvector keeps its direction
For A = diag(2, 1), the horizontal eigenvector doubles and the vertical eigenvector stays unchanged. A diagonal input (1, 1) becomes (2, 1), changing direction, so it is not an eigenvector of this map.-0.5-0.50.30.1251.10.751.91.382.72xy
  • A(1, 1)
For A = diag(2, 1), the horizontal eigenvector doubles and the vertical eigenvector stays unchanged. A diagonal input (1, 1) becomes (2, 1), changing direction, so it is not an eigenvector of this map.

Worked example: two preserved directions

For A=(2112)A=\begin{pmatrix}2&1\\1&2\end{pmatrix}, the characteristic polynomial is (2−λ)2−1=(λ−3)(λ−1)(2-\lambda)^2-1=(\lambda-3)(\lambda-1). For λ=3\lambda=3, solving (A−3I)v=0(A-3I)v=0 gives vectors proportional to (1,1)T(1,1)^T. For λ=1\lambda=1, they are proportional to (1,−1)T(1,-1)^T.

The matrix stretches one diagonal direction by three and leaves the other unchanged. A generic vector combines both behaviors. Solving only the characteristic polynomial does not provide the eigenvectors; each null-space calculation is still needed.

PAUSE & THINKA quick check, not a grade

Try it yourself.

Choose an answer and explain your reasoning to yourself. Use a hint if you get stuck.

Av=3v for v≠0. What is the eigenvalue?

Hint 1 · Find a starting point

An eigenvalue is the scalar multiplying the preserved direction.

Hint 2 · Take the next step

Compare with Av=λv.

Show the reasoning

Answer: 3

λ=3; v is the eigenvector, and v≠0 is essential.

Before moving on: what would make one of the other answers wrong? Saying why is part of understanding.

Worked example: a zero eigenvalue

For A=diag⁡(4,0)A=\operatorname{diag}(4,0), eigenvalues are 44 and 00. The vertical eigenvectors map to zero. Therefore AA is singular. In general, zero is an eigenvalue exactly when a square matrix is not invertible.

Eigenvalues of a triangular matrix are its diagonal entries, counted with algebraic multiplicity. The sum of eigenvalues equals the trace and their product equals the determinant, counting multiplicity over the complex numbers. These are useful checks, not replacements for finding eigenspaces.

Practice

  1. Find eigenpairs of diag⁡(2,5)\operatorname{diag}(2,5).
  2. Is every nonzero vector an eigenvector of 3I3I?
  3. Can a real matrix have nonreal eigenvalues?
Show worked solutions
  1. Eigenvalue 22 has direction (1,0)T(1,0)^T; eigenvalue 55 has direction (0,1)T(0,1)^T.
  2. Yes: 3Iv=3v3Iv=3v for every nonzero vv.
  3. Yes. A 90∘90^\circ plane rotation has characteristic equation λ2+1=0\lambda^2+1=0, giving λ=±i\lambda=\pm i over the complex numbers.
MAKE IT YOURS

Pause before the next idea.

Can you explain how the visualization connects to this lesson’s goal? If a step still feels uncertain, put this lesson on your review list and try the check again another day.

Optional marks, not a grade. Saved in this browser only. Open notebook →