Folioby Interconnected
Log InSign Up

Why eigenvalues matter: how diagonalization simplifies everything

Eigenvalues and eigenvectors appear suddenly in every linear algebra course — but why are they so important? Because they decompose a complicated linear map into independent scalings, turning hard problems into easy ones.

FO
Folio Official
March 1, 2026

Somewhere around the midpoint of a linear algebra course, two new concepts appear:

Definition 1.
Given an n×n matrix A, a scalar λ is an eigenvalue and a nonzero vector v is an eigenvector if
Av=λv.

The textbook immediately proceeds to the mechanics: find the characteristic polynomial, factor it, solve for eigenvectors. But step back for a moment. Why should anyone care?

1 The geometric picture

A matrix A represents a linear map. Most vectors get both rotated and stretched when A is applied. But an eigenvector is special: its direction does not change. The map merely scales it by the factor λ.

Example 2.
Consider A=(20​13​).

The characteristic equation det(A−λI)=0 gives (2−λ)(3−λ)=0, so λ1​=2 and λ2​=3.

For λ1​=2: solving (A−2I)v=0 yields v1​=(10​).

For λ2​=3: solving (A−3I)v=0 yields v2​=(11​).

The map A stretches the v1​-direction by a factor of 2 and the v2​-direction by a factor of 3. That is all it does.

2 Diagonalization: making a matrix look trivial

If we use the eigenvectors as a new basis, the matrix becomes diagonal:

P−1AP=(λ1​0​0λ2​​).

In this eigenbasis, the map is just independent scaling along each axis. All the apparent complexity of A was an artifact of the coordinate system.

3 ComputingA100in seconds

This is where diagonalization pays off most directly. Computing A100 naively requires multiplying the matrix by itself a hundred times. But with diagonalization,

A100=P(λ1100​0​0λ2100​​)P−1.
Raising a diagonal matrix to a power is trivial: just raise each diagonal entry.

Example 3.
Continuing the example above, P=(10​11​), so
A100=(10​11​)(21000​03100​)(10​−11​)=(21000​3100−21003100​).

4 The Fibonacci sequence

The Fibonacci recurrence F0​=0, F1​=1, Fn+2​=Fn+1​+Fn​ can be written as a matrix equation:

(Fn+1​Fn​​)=(11​10​)n(10​).

The eigenvalues of (11​10​) are ϕ=21+5​​ (the golden ratio) and ϕ^​=21−5​​. Diagonalizing gives the closed-form expression

Fn​=5​ϕn−ϕ^​n​.

An integer sequence whose general term involves 5​ — this is a gift from eigenvalues.

5 Systems of differential equations

The differential equation x′(t)=Ax(t) has solution x(t)=eAtx(0). When A is diagonalizable,

eAt=P(eλ1​t0​0eλ2​t​)P−1.

Each eigenvector direction evolves independently as an exponential. The eigenvalues determine the rates.

Example 4.
For x′=(−10​0−2​)x, the solution is
x(t)=(c1​e−tc2​e−2t​).
The first component decays at rate 1; the second at rate 2. The eigenvalues are the decay rates.

6 What eigenvalues tell you

Eigenvalues encode the essential spectral information of a linear map:

  • ∣λ∣>1: expansion in that direction

  • ∣λ∣<1: contraction in that direction

  • λ<0: reversal in that direction

  • λ=0: collapse in that direction (singular matrix)

7 The takeaway

Eigenvalues matter because they decompose a complex linear map into independent scalings along privileged directions. Once you diagonalize, matrix powers reduce to scalar powers, and differential equations reduce to independent exponentials. The eigenvalues are the essential data of a linear map — everything else is coordinate noise.

Linear AlgebraAlgebraBetween the Lines
FO
Folio Official

Mathematics "between the lines" — exploring the intuition textbooks leave out, written in LaTeX on Folio.

1 followers·107 articles
Linear Algebra — Between the LinesPart 5 of 6
Previous
What does the determinant measure? Area, volume, and orientation
Next
The geometry that inner products unlock: orthogonality, projection, and least squares

Share your expertise with the world

Write articles with LaTeX support, build your audience, and earn from your knowledge.

Start Writing — It's Free

More from Folio Official

Folio Official·March 1, 2026

The geometry that inner products unlock: orthogonality, projection, and least squares

A vector space, by itself, has no concept of length or angle. Inner products supply both — and with them come orthogonal projections, the Gram–Schmidt process, least squares, and the bridge to Fourier analysis.

Linear AlgebraAlgebraBetween the Lines
1
Folio Official·March 1, 2026

What is "dimension," really? The truth about degrees of freedom

We all say "three-dimensional space" without blinking — but what exactly does the "three" mean? The answer is less obvious than it seems, and proving it requires the Steinitz exchange lemma.

Linear AlgebraAlgebraBetween the Lines
3
Folio Official·March 24, 2026

The Spectral Theorem: Orthogonal Diagonalization of Symmetric Matrices

Every real symmetric matrix can be orthogonally diagonalized — we prove this spectral theorem and its complex generalization for normal operators. The spectral decomposition A = sum lambda_i P_i into orthogonal projections is derived, and we apply it to classify quadratic forms via Sylvester's law of inertia.

Linear AlgebraAlgebraTextbook
1
Folio Official·March 24, 2026

The Singular Value Decomposition: Structure of Arbitrary Matrices

Every real m x n matrix factors as A = U Sigma V^T, where U and V are orthogonal and Sigma is diagonal — this is the singular value decomposition. We prove existence, show how the SVD yields optimal low-rank approximations (Eckart–Young theorem), and construct the Moore–Penrose pseudoinverse for least-squares solutions.

Linear AlgebraAlgebraTextbook
2