Chapter 11 · Introduction

Chapter 11 — Eigenvalues & Cayley–Hamilton

Change the basis and a matrix changes; its eigenvalues do not. This chapter finds the directions an operator only stretches, the characteristic polynomial that collects the stretching factors, and the polynomial identities every matrix obeys — Cayley–Hamilton and the minimal polynomial.

Multiply a vector by the same matrix again and again — the Fibonacci recursion, a Markov chain of market shares, an age-structured population, the power method that ranks web pages — and something remarkable happens: whatever the starting vector, the direction settles down, and each step multiplies the length by nearly the same number. The limiting direction is an eigenvector and the factor is the largest eigenvalue. Eigenvalues also decide whether solutions of $x'=Ax$ decay or explode, give the natural frequencies of a bridge or a molecule, and, in quantum mechanics, are the values a measurement can return. They are the part of a linear operator that no change of basis can hide.

Chapters 9–10 showed that one operator has many matrices, all similar to one another. This chapter extracts what all of them share. The characteristic polynomial collects the eigenvalues, and its coefficients are traces, determinants and sums of principal minors; algebraic and geometric multiplicities measure how many times an eigenvalue occurs and how many independent eigenvectors it has. The Cayley–Hamilton theorem says every matrix satisfies its own characteristic polynomial, and the minimal polynomial records exactly which polynomial identities hold. With spectral mapping (the eigenvalues of $f(A)$ are the $f(\lambda)$), the $AB$/$BA$ theorem and companion matrices, these are the tools behind most eigenvalue questions in CSIR NET — and the minimal polynomial is the key that Chapter 12 uses to find the simplest matrix of an operator.

Eigenvalues & eigenvectors→$p_A$, trace, det→$a(\lambda)$ and $g(\lambda)$→Polynomials in $A$→Cayley–Hamilton→Minimal polynomial→Eigenvalues of $f(A)$, $AB$ vs $BA$→Companion matrices
🎯 By the end of this chapter you can…
  • compute eigenvalues, eigenspaces, algebraic and geometric multiplicities, and the characteristic polynomial from traces and principal minors;
  • prove that eigenvectors for distinct eigenvalues are independent and that $1\le g(\lambda)\le a(\lambda)$, and recognise matrices where the two multiplicities differ;
  • prove the Cayley–Hamilton theorem and use it to compute inverses, powers and polynomial expressions in a matrix;
  • find the minimal polynomial, using $m_A\mid p_A$ and the fact that $m_A$ and $p_A$ have the same roots;
  • use spectral mapping and the $AB$/$BA$ theorem to find $\det$, $\operatorname{tr}$ and eigenvalues of matrices built from others, and write down a matrix with a prescribed characteristic polynomial.
Teaser — Multiply Again and Again: The Matrix Reveals Its Eigenvector

Start with a vector $v_0$ and repeat $v_{k+1}=Av_k$. On the left, the direction of $v_k$ is drawn on the unit circle (older directions fade); the green line is the eigen-direction of the eigenvalue of largest modulus. On the right is the growth factor $\|v_{k+1}\|/\|v_k\|$, with the dashed line at $|\lambda_{\max}|$. Press Play and compare the five matrices: fast, slow, or no convergence at all — and the reason is always the eigenvalues.

k—
direction of vₖ—
‖vₖ₊₁‖ / ‖vₖ‖—
angle to eigen-direction—
eigenvalues—

How this is examined

Every CSIR NET paper has questions from this chapter. In Part B the typical question gives a matrix with a pattern — all entries equal, a rank-one perturbation of the identity, a triangular or block matrix, a matrix satisfying $A^2=A$ or $A^3=A$, the matrix of a map such as $X\mapsto X^T$ or $p\mapsto p'$ — and asks for its eigenvalues, its trace or determinant, the determinant of a polynomial in it, its minimal polynomial, or the dimension of an eigenspace; data such as $\operatorname{tr}A$, $\operatorname{tr}A^2$ and $\det A$ often have to be turned into the characteristic polynomial first, and Cayley–Hamilton turns a high power or an inverse into a short polynomial in $A$. Part C, where several options may be correct, prefers statements to be judged: whether $AB$ and $BA$ share their eigenvalues, their characteristic polynomial or their minimal polynomial; whether algebraic and geometric multiplicities must agree; what the minimal polynomial of a block or companion matrix is. The false options are the counterexamples collected in the ⚠️ box of §11.1. Questions on diagonalisability, similarity and Jordan forms build on this chapter and are treated in Chapter 12. GATE MA asks the same material in single-answer and multiple-select form.

Sections in this chapter

✅ Before you start

This chapter builds directly on Chapters 9–10. You need bases, dimension and direct sums (§9.1); linear maps, kernels and images, rank–nullity, matrices of linear maps, change of basis and similarity (§9.2); and determinants with the product rule, the adjugate and the rank of a matrix (§10.1). From algebra you need the division algorithm for polynomials and the fact that every complex polynomial is a product of linear factors (the fundamental theorem of algebra, proved in complex analysis — CSIR Unit 2). The next chapter, Chapter 12, uses everything here to diagonalise, triangularise and put matrices in Jordan form.