Visual walkthrough — Eigenvalues and eigenvectors — characteristic polynomial
Step 1 — What a matrix does to an arrow
WHAT. Start with the most basic object: an arrow (a vector) drawn from the origin. A matrix is a machine: feed it an arrow , and it spits out a new arrow, which we call .
WHY. Before we can hunt for special arrows, we must see what happens to an ordinary one. Most arrows come out pointing somewhere new — they got turned.
PICTURE. In the figure, the cyan arrow is your input . The amber arrow is the output . Notice the amber arrow points in a different direction — the machine rotated and lengthened it.

Term by term in : the letter is the machine, the arrow sits to its right as the thing being fed in, and writing them side-by-side means "apply to ".
Step 2 — The magic directions where nothing turns
WHAT. Among all input arrows, a few special ones come out pointing along the same line they started on. The machine did not turn them — it only made them longer or shorter (or flipped them).
WHY. These are the arrows worth naming, because they reveal the "grain" of the matrix — the directions it treats simply. We call such an arrow an eigenvector, and the stretch factor an eigenvalue .
PICTURE. The cyan arrow and the amber arrow now lie on the same dashed white line. The output is just the input scaled by a number (here , so twice as long, same direction).

The equals sign is the whole demand: "the machine's output must land back on the input's line."
Step 3 — Why the zero arrow is forbidden
WHAT. Ask: what if we allowed , the arrow with no length?
WHY. Plug it in: and for every number . So the equation is true no matter what is. That makes meaningless — every number would "qualify". So we throw the zero arrow out.
PICTURE. The zero arrow is just a dot at the origin (drawn amber). No direction, no line to lie along — there is nothing for to describe.

Step 4 — Move everything to one side
WHAT. Take and subtract the right side across:
WHY. We want to factor out the arrow , the way you factor out of . To factor, all the terms must sit together on one side, equal to zero.
PICTURE. Geometrically: if and are the same arrow, then placing tip-to-tail backwards against leaves you exactly at the origin — the closing white loop back to .

- ::: the output arrow minus the scaled input arrow.
- ::: they cancel perfectly — the difference has no length.
Step 5 — The identity trick: turning into a matrix
WHAT. We would love to write , but we cannot: is a grid of numbers (a matrix) and is a single number. Subtracting a number from a grid is undefined — they live in different worlds. The repair: replace with , where is the identity matrix (the machine that changes nothing).
WHY. Because , multiplying by does the same job as multiplying by : . But now is a genuine grid, so is a legal matrix subtraction. See Determinants later; first we just need a real matrix.
PICTURE. The identity is drawn as landing on itself (arrow unchanged). Scaling that by gives the amber arrow — identical to .

- ::: the identity matrix — s down the diagonal, s elsewhere; it leaves any arrow untouched.
- ::: a matrix that stretches every arrow by .
- ::: one honest matrix, formed by subtracting from each diagonal entry of .
- Factoring out is now legal, since both terms are (matrix).
Step 6 — When does a matrix crush an arrow to zero?
WHAT. Rename . We need a nonzero arrow with . That means must collapse a real arrow down onto the origin.
WHY. If were reversible (invertible), we could undo it: multiply both sides by to get — forced back to the forbidden zero arrow! So must be the opposite of reversible: it must squash some direction to nothing. Such an has a nonzero null space. A collapsing matrix is called singular.
PICTURE. Left panel: an invertible maps the little square to a nonzero-area parallelogram — nothing collapses, only maps to . Right panel: a singular flattens the whole square onto a line — a whole direction (cyan) is crushed onto the origin. That crushed direction is our eigenvector.

Step 7 — Singular means zero determinant
WHAT. How do we test whether collapses space, without drawing pictures? Use the determinant. The determinant measures the area (or volume) scaling of the machine.
WHY THIS TOOL. We need one number that screams "space got flattened". The determinant is exactly that number: if squashes the square onto a line, the enclosed area becomes , so . Nothing else so cleanly detects collapse — that's why the determinant, and not the trace or anything simpler, is the right instrument here.
PICTURE. The unit square (area ) maps to a parallelogram of area . As slides toward an eigenvalue, watch the parallelogram thin to a line — area .

- ::: the area/volume-scaling number of a matrix.
- ::: the scaling collapsed — space was flattened — the matrix is singular.
Step 8 — Reading the equation as a curve
WHAT. Because the determinant of an matrix is built from products of its entries, turns out to be a polynomial of degree in : the characteristic polynomial.
WHY. A polynomial is a curve we can graph, and its crossings of the horizontal axis are exactly the that make — the eigenvalues. So an abstract collapse condition becomes "find where a curve hits zero".
PICTURE. For we get . The amber parabola crosses the axis at and — the two eigenvalues, marked with cyan dots.

- ::: the characteristic polynomial, height of the curve.
- roots of ::: the -values where the curve touches = the eigenvalues.
The sum of the roots is and the product — the free sanity check from the trace and determinant. (See also Cayley–Hamilton Theorem: the matrix satisfies its own .)
Step 9 — The degenerate cases (never left out)
WHAT. Three special situations the derivation must survive.
Case A — repeated root. gives : the curve touches the axis at without crossing (a double root). Algebraic multiplicity , but only one eigenvector direction.
Case B — no real roots. The rotation gives : the parabola floats above the axis, never touching. No real eigenvalue — the roots are , living in the complex world. A real matrix that turns every arrow has no real eigen-direction, exactly as the picture warns.
Case C — the identity itself. gives for every arrow: works in all directions. , and every nonzero arrow is an eigenvector.
PICTURE. Three parabolas on shared axes: crossing twice (distinct real), touching once (repeated), floating clear (complex).

The one-picture summary
Every arrow shows one step: the eigen-equation move to one side insert demand collapse determinant zero read off the curve's roots.

Recall Feynman: tell the whole story in plain words
A matrix is a machine that grabs arrows and swings them to new directions. But a few lucky arrows come out on the same line they went in — the machine only lengthened them. Those are eigenvectors, and "how much longer" is the eigenvalue . To find them we say "output equals times input", slide everything to one side, and try to factor the arrow out. We can't subtract a plain number from a grid , so we swap for the do-nothing matrix — now is a real machine. For a nonzero arrow to be crushed to the origin by this machine, the machine must flatten space. The one number that detects flattening is the determinant, and flattening means it equals zero. Setting gives a polynomial curve; wherever that curve dips down and hits the axis, we've found an eigenvalue. Some curves cross twice (two eigenvalues), some just kiss the axis (a repeated one), and some float clear of it entirely (only complex eigenvalues). That is the whole treasure map.