Exercises — Eigenvalues and eigenvectors — characteristic polynomial
Before we start, one shared picture. An eigenvector is a direction the matrix does not turn — it only stretches it. The figure shows a generic vector getting rotated and stretched (orange) versus an eigenvector that stays on its own line (green).

Level 1 — Recognition
Exercise L1.1
For , is an eigenvector? If so, with what eigenvalue?
Recall Solution
Compute and compare with a scalar multiple of . WHAT we did: applied the matrix. WHY: the definition is a test — plug the vector in and see if the output is a multiple of the input. RESULT: output is times the input, same direction, so yes — eigenvector with .
Exercise L1.2
Write the characteristic polynomial symbolically for a general matrix . State its degree.
Recall Solution
Subtract from each diagonal entry (that is what means: has 's on the diagonal, so has 's there): Take the determinant (main-diagonal product minus off-diagonal product): Degree , matching the size of the matrix (an matrix gives degree ).
Level 2 — Application
Exercise L2.1
Find both eigenvalues of and verify them with the trace/determinant check.
Recall Solution
WHY the trace/det shortcut: , so we expect coefficient and constant . Factor: Check (see Trace of a Matrix and Determinants): ✓, ✓.
Exercise L2.2
Find an eigenvector of for .
Recall Solution
Solve — the eigenvector lives in the null space of . Row 1 says . (Row 2 says the same: .) One free direction: Verify: ✓.
Exercise L2.3
Find the eigenvalues of the triangular matrix .
Recall Solution
WHY no work is needed: for a triangular matrix , since the determinant of a triangular matrix is the product of its diagonal entries. So The eigenvalues are exactly the diagonal entries .
Level 3 — Analysis
Exercise L3.1
For , find the eigenvalue, its algebraic multiplicity, and its geometric multiplicity. Is defective?
Recall Solution
Triangular, so . Root appears twice → algebraic multiplicity . Geometric multiplicity = number of independent eigenvectors = dimension of the null space of : This forces , with free: only one direction . So geometric multiplicity . Since geometric algebraic , the matrix is (not diagonalizable — see Diagonalization).
Exercise L3.2
The rotation matrix turns every real vector by . Explain via the characteristic polynomial why it has no real eigenvectors, and find its complex eigenvalues.
Recall Solution
WHY no real roots: means , and no real number squares to a negative. Geometrically this matches the picture — a rotation turns every nonzero vector off its own line, so no real direction is preserved. Using Complex Numbers: Check: sum ✓, product ✓.

Exercise L3.3
Find all eigenvalues of and its two eigenvectors. Note that the eigenvectors are perpendicular — why is that expected here?
Recall Solution
For : , so , giving . For : , so , giving . Dot product → perpendicular. WHY expected: is symmetric (), and symmetric matrices always have perpendicular eigenvectors for distinct eigenvalues.
Level 4 — Synthesis
Exercise L4.1
A matrix has and . Without knowing , find its eigenvalues.
Recall Solution
WHY this works without : the characteristic polynomial of a matrix depends only on trace and determinant: . Check: ✓, ✓.
Exercise L4.2
Given is an eigenvalue of , find .
Recall Solution
is a root means : Set . Check: with , is triangular with diagonal — eigenvalues and , and indeed is one of them ✓.
Exercise L4.3
Let (from the parent note, eigenvalues and ). Show directly that has eigenvalues and , illustrating the rule "if then ."
Recall Solution
WHY the rule holds: apply twice — . Same eigenvector, eigenvalue squared. Direct confirmation: . And indeed , ✓ — the squares of 's eigenvalues.
Level 5 — Mastery
Exercise L5.1
Prove that a matrix is singular (has ) if and only if is one of its eigenvalues.
Recall Solution
WHAT " is an eigenvalue" means: . So is a root of the characteristic polynomial exactly when . Geometric meaning: for some nonzero means collapses that direction to zero — a nontrivial null space, which is precisely singularity.
Exercise L5.2
For , verify the Cayley–Hamilton theorem: satisfies its own characteristic polynomial, i.e. .
Recall Solution
From the parent note, . The Cayley–Hamilton Theorem says substituting the matrix for (and for the constant term) gives the zero matrix.
Exercise L5.3
Find the characteristic polynomial and eigenvalues of the matrix , and state the sum and product of the eigenvalues, confirming them against trace and .
Recall Solution
is lower-triangular, so eigenvalues are the diagonal entries directly: Sum (the general fact "sum of eigenvalues trace" holds for all ). Product (also triangular = product of diagonal). Both structural facts confirmed ✓.
Recall wrap-up
Recall Quick self-quiz
To find eigenvalues you solve ::: To find eigenvectors for a given you solve ::: the null space Eigenvalues of a triangular matrix ::: its diagonal entries Sum of eigenvalues equals ::: the trace; product equals the determinant If , then ::: is an eigenvalue iff ::: is singular ()