An eigenvector as something you can see before it is something you calculate.
Sweep the vector right round before writing any algebra down.
Almost every direction comes back pointing somewhere else. Exactly two lie along their own line, and the readout drops to zero degrees turned. That is the definition, discovered.
The characteristic polynomial then has an obvious job: it is how you find those two directions without sweeping a circle by hand.
Eigenvalues sum to the trace and multiply to the determinant. For [[2,1],[1,2]] that is 3 + 1 = 4 and 3 × 1 = 3. It costs nothing and catches nearly every algebraic slip.
An eigenvector is a direction, not an arrow. (1,1), (2,2) and (−3,−3) are the same answer, so accept any sensible multiple. Zero is never an eigenvector.
| 1. Larger eigenvalue | 3; the roots of λ² − 4λ + 3. |
| 2. Determinant from 3 and 1 | 3. |
| 3. M(1,1) = (3,3) | A, (1,1) is an eigenvector with eigenvalue 3. |
1 markThe characteristic polynomial written before it is solved.
1 markEigenvalues checked against trace and determinant.
1 markAn eigenvector in simplest whole-number form, interpreted in context.
| They give | What it means |
|---|---|
| 4 (Q1) | Gave the trace, which is the sum of the eigenvalues. |
| 1 (Q1) | Gave the smaller one. |
| 4 (Q2) | Confused trace with determinant: sum against product. |
| B (Q3) | Swapped eigenvector and eigenvalue. The input is the eigenvector. |
| D (Q3) | Did not recognise Mv = λv as the definition itself. |
"What are they actually for?" The long run. Apply a matrix repeatedly and the largest eigenvalue sets the growth rate while its eigenvector sets the shape it settles into. That is the same steady state as 4.19.
"Can an eigenvalue be negative or zero?" Yes. Negative flips the direction; zero means the matrix collapses that direction entirely, and the determinant is then zero too.
"Why is zero not an eigenvector?" Because every matrix sends it to itself, so it would satisfy the definition for every λ and tell you nothing.
| What is happening | |
|---|---|
| 1 | Sweep the circle. Find the two directions before naming anything. |
| 2 | Mv = λv, written against what was just seen. |
| 3 | The characteristic polynomial, with the trace and determinant check. |
| 4 | Finding the eigenvectors by substituting back. |
| 5 | The long-run application, linked to 4.19. |
Do not open with det(M − λI) = 0. It is a method for finding something they have not yet seen the point of.
Do not insist on one particular eigenvector. Any non-zero multiple is the same answer.
Three tiers, ramping the way practice should: the method on its own, then the method inside something real, then a challenge. Set the tier the class in front of you needs rather than one undifferentiated sheet. Answers are given so these can go straight onto a board.
The method on its own, with friendly numbers. Set these first and move on quickly once they are secure.
The same skill inside a real situation, where the first job is working out what is being asked.
Reasoning, working backwards, or spotting an error. These are where the top grades are decided.
Works on a phone. Nothing is loaded from any other site, so it runs behind a school firewall, and nothing a student does is saved or sent anywhere.