Chapter 3 · Linear Algebra

3.2 Eigenvalues, Diagonalisation, Minimal Polynomial and Jordan Form

Eigenvalues and the characteristic polynomial, Cayley–Hamilton and the minimal polynomial, the tests that decide diagonalisability, and the Jordan canonical form read off from ranks — with the similarity-class counts that GATE MA turns into NAT questions.

Section 3.1 ended with a shift operator whose matrix, after a clever change of basis, became almost diagonal. This section asks the general question: given a linear operator on an $n$-dimensional space, in which basis is its matrix simplest? The first candidates are the directions the operator merely stretches — the eigenvectors — and the stretching factors, the eigenvalues, are the roots of a polynomial of degree $n$, the characteristic polynomial. If there are enough eigenvectors to form a basis, the matrix becomes diagonal and every computation with it (powers, inverses, polynomials, the exponential $e^{At}$ of Chapter 6) becomes a computation with $n$ numbers. If there are not, the Jordan canonical form is the next best thing: a block-diagonal matrix of eigenvalues with $1$'s just above the diagonal, determined completely by the ranks of the powers $(A-\lambda I)^k$.

GATE MA examines this material more heavily than any other part of linear algebra. Typical questions ask for an eigenvalue, a determinant or a trace of a matrix built from a given one; for the minimal polynomial of a block matrix; for which values of a parameter a matrix is diagonalisable; for the Jordan form from rank information; and — as NAT questions — for the number of similarity classes of matrices with a given characteristic or minimal polynomial. The MSQs are full of plausible statements that fail for a $2\times2$ Jordan block. Throughout, $A\in M_n(\mathbb{F})$ with $\mathbb{F}=\mathbb{R}$ or $\mathbb{C}$; everything said for matrices applies to an operator $T\in\mathcal{L}(V)$ through its matrix in any basis, by the change-of-basis formula of §3.1.

Eigenvalues, Eigenvectors and the Characteristic Polynomial

📘 Definition 3.9 — Eigenvalue, eigenvector, eigenspace
A scalar $\lambda\in\mathbb{F}$ is an eigenvalue of $A\in M_n(\mathbb{F})$ if $Av=\lambda v$ for some nonzero $v\in\mathbb{F}^n$; such a $v$ is an eigenvector for $\lambda$. The eigenspace $E_\lambda=N(A-\lambda I)$ consists of the eigenvectors for $\lambda$ together with $0$. The set of eigenvalues is the spectrum $\sigma(A)$.
📐 Theorem 3.15 — Five ways to say "$\lambda$ is an eigenvalue"
For $\lambda\in\mathbb{F}$ the following are equivalent: $\lambda$ is an eigenvalue of $A$; $N(A-\lambda I)\ne\{0\}$; $A-\lambda I$ is not invertible; $\operatorname{rank}(A-\lambda I)\lt n$; $\det(\lambda I-A)=0$.

Proof. The first two statements say the same thing, and the others are equivalent to the second by the invertible matrix theorem (§3.1). ∎

📘 Definition 3.10 — Characteristic polynomial; algebraic and geometric multiplicity
The characteristic polynomial of $A$ is $p_A(x)=\det(xI-A)$. For an eigenvalue $\lambda$, the algebraic multiplicity $a(\lambda)$ is its multiplicity as a root of $p_A$, and the geometric multiplicity is $g(\lambda)=\dim E_\lambda=n-\operatorname{rank}(A-\lambda I)$. (Some texts use $\det(A-xI)=(-1)^np_A(x)$; it has the same roots.)
📐 Theorem 3.16 — What the characteristic polynomial knows
  1. $p_A$ is monic of degree $n$, and $$p_A(x)=x^n-E_1x^{n-1}+E_2x^{n-2}-\cdots+(-1)^nE_n,$$ where $E_k$ is the sum of the $\binom nk$ principal $k\times k$ minors of $A$. In particular $E_1=\operatorname{tr}A$ and $E_n=\det A$. For $n=2$: $p_A=x^2-(\operatorname{tr}A)x+\det A$.
  2. Over $\mathbb{C}$, $p_A(x)=(x-\lambda_1)\cdots(x-\lambda_n)$ (eigenvalues listed with algebraic multiplicity), so $\lambda_1+\cdots+\lambda_n=\operatorname{tr}A$ and $\lambda_1\cdots\lambda_n=\det A$.
  3. Similar matrices have the same characteristic polynomial; so do $A$ and $A^{\mathsf T}$.
  4. The eigenvalues of a triangular matrix are its diagonal entries; for a block triangular matrix $\begin{pmatrix}B&C\\0&D\end{pmatrix}$, $p_A=p_Bp_D$.
  5. For real $A$, nonreal eigenvalues come in conjugate pairs $\lambda,\bar\lambda$ (with eigenvectors $v,\bar v$), and if $n$ is odd $A$ has a real eigenvalue.

Proof. (1) The $j$-th column of $xI-A$ is $xe_j-a_j$, where $a_j$ is the $j$-th column of $A$. The determinant is linear in each column, so it expands into $2^n$ determinants: for each set $S$ of columns choose $-a_j$ for $j\in S$ and $xe_j$ for $j\notin S$. Expanding along the columns $xe_j$ leaves $x^{n-|S|}$ times $(-1)^{|S|}$ times the principal minor of $A$ on the rows and columns in $S$. Collecting the sets with $|S|=k$ gives the coefficient $(-1)^kE_k$ of $x^{n-k}$. (2) Factor $p_A$ over $\mathbb{C}$ (fundamental theorem of algebra) and compare the coefficients of $x^{n-1}$ and $x^0$ with (1). (3) $xI-P^{-1}AP=P^{-1}(xI-A)P$, and $\det(xI-A^{\mathsf T})=\det\left((xI-A)^{\mathsf T}\right)$. (4) $xI-A$ is again (block) triangular and its determinant is the product of the diagonal entries (blocks). (5) $\overline{p_A(\lambda)}=p_A(\bar\lambda)$ because $p_A$ has real coefficients, and $\overline{Av}=A\bar v$; a real polynomial of odd degree has a real root by the intermediate value theorem. ∎

📐 Theorem 3.17 — Independence of eigenvectors; $1\le g(\lambda)\le a(\lambda)$
  1. Eigenvectors $v_1,\dots,v_k$ for distinct eigenvalues $\lambda_1,\dots,\lambda_k$ are linearly independent. More generally the sum $E_{\lambda_1}+\cdots+E_{\lambda_k}$ of the eigenspaces of distinct eigenvalues is direct, so the union of bases of the eigenspaces is independent.
  2. For every eigenvalue, $1\le g(\lambda)\le a(\lambda)$. Hence $\sum_\lambda g(\lambda)\le\sum_\lambda a(\lambda)\le n$, with $\sum_\lambda a(\lambda)=n$ iff $p_A$ splits into linear factors over $\mathbb{F}$ (always true over $\mathbb{C}$).

Proof. (1) Induction on $k$; $k=1$ holds because $v_1\ne0$. Suppose $\sum_{i=1}^kc_iv_i=0$. Applying $A-\lambda_kI$ kills the last term and gives $\sum_{i=1}^{k-1}c_i(\lambda_i-\lambda_k)v_i=0$; by induction $c_i(\lambda_i-\lambda_k)=0$, so $c_i=0$ for $i\lt k$ because the eigenvalues are distinct, and then $c_kv_k=0$ gives $c_k=0$. For the direct sum, if $w_1+\cdots+w_k=0$ with $w_i\in E_{\lambda_i}$, the nonzero $w_i$ would be eigenvectors for distinct eigenvalues with a vanishing sum — impossible; so all $w_i=0$. (2) $g\ge1$ since an eigenvalue has an eigenvector. Let $g=g(\lambda)$, take a basis $v_1,\dots,v_g$ of $E_\lambda$ and extend it to a basis of $\mathbb{F}^n$; with $P$ the matrix of this basis,

$$P^{-1}AP=\begin{pmatrix}\lambda I_g&C\\0&D\end{pmatrix},$$

so by Theorem 3.16(3),(4) $p_A(x)=(x-\lambda)^g\,p_D(x)$, and $(x-\lambda)^g$ divides $p_A$: $g\le a(\lambda)$. The rest follows because $\deg p_A=n$. ∎

📐 Theorem 3.18 — Triangular form, spectral mapping, $AB$ versus $BA$
  1. Triangularisation. Every $A\in M_n(\mathbb{C})$ is similar to an upper triangular matrix, whose diagonal entries are the eigenvalues $\lambda_1,\dots,\lambda_n$.
  2. Spectral mapping. For every polynomial $f$, the eigenvalues of $f(A)$, with algebraic multiplicity, are $f(\lambda_1),\dots,f(\lambda_n)$. In particular $\operatorname{tr}A^k=\sum\lambda_i^k$, $\det f(A)=\prod f(\lambda_i)$, and if $A$ is invertible the eigenvalues of $A^{-1}$ are $1/\lambda_i$. (If $Av=\lambda v$ then $f(A)v=f(\lambda)v$ for every field.)
  3. $AB$ and $BA$. For $A\in M_{m\times n}$, $B\in M_{n\times m}$: $x^n\,p_{AB}(x)=x^m\,p_{BA}(x)$. So $AB$ and $BA$ have the same nonzero eigenvalues with the same algebraic multiplicities, and for square $A,B$, $p_{AB}=p_{BA}$.
  4. Rank-one matrices. For $u,v\in\mathbb{F}^n$: $p_{uv^{\mathsf T}}(x)=x^{n-1}\left(x-v^{\mathsf T}u\right)$. For the all-ones matrix $J\in M_n$, the eigenvalues of $aI+bJ$ are $a+nb$ (once) and $a$ ($n-1$ times).

Proof. (1) Induction on $n$. $p_A$ has a root $\lambda_1\in\mathbb{C}$, with an eigenvector $v_1$; extend to a basis and conjugate as in the proof of Theorem 3.17 to get $\begin{pmatrix}\lambda_1&*\\0&A_1\end{pmatrix}$ with $A_1\in M_{n-1}(\mathbb{C})$. If $Q^{-1}A_1Q$ is upper triangular, conjugating further by $\operatorname{diag}(1,Q)$ makes the whole matrix upper triangular. Its diagonal entries are the roots of $p_A$ by Theorem 3.16(3),(4). (2) If $P^{-1}AP=U$ is upper triangular with diagonal $\lambda_i$, then $P^{-1}f(A)P=f(U)$ is upper triangular with diagonal $f(\lambda_i)$, since sums and products of upper triangular matrices multiply their diagonals entrywise. For $A^{-1}$: $Av=\lambda v$ gives $v=\lambda A^{-1}v$, so the eigenvalues of $A^{-1}$ are the $1/\lambda$; the multiplicities agree because $p_{A^{-1}}(x)=\det(xI-A^{-1})=\det(xA-I)\det A^{-1}$ is a constant times $x^n p_A(1/x)$. (3) A direct computation shows

$$\begin{pmatrix}AB&0\\B&0\end{pmatrix}\begin{pmatrix}I_m&A\\0&I_n\end{pmatrix}=\begin{pmatrix}AB&ABA\\B&BA\end{pmatrix}=\begin{pmatrix}I_m&A\\0&I_n\end{pmatrix}\begin{pmatrix}0&0\\B&BA\end{pmatrix}.$$

So the two block matrices on the outside are similar, and by Theorem 3.16(4) their characteristic polynomials are $p_{AB}(x)\,x^n$ and $x^m\,p_{BA}(x)$. (4) Apply (3) with the $n\times1$ matrix $u$ and the $1\times n$ matrix $v^{\mathsf T}$: $v^{\mathsf T}u$ is $1\times1$ with characteristic polynomial $x-v^{\mathsf T}u$, so $x\,p_{uv^{\mathsf T}}(x)=x^n(x-v^{\mathsf T}u)$. For $J=\mathbf{1}\mathbf{1}^{\mathsf T}$ the eigenvalues are $n$ and $0$ ($n-1$ times), and $aI+bJ$ has eigenvalues $a+b\mu$ for each eigenvalue $\mu$ of $J$, by (2). ∎

✏️ Example 1 — Same characteristic shape, different eigenspaces
Find the eigenvalues with their algebraic and geometric multiplicities, and bases of the eigenspaces, of $$A=\begin{pmatrix}3&1&1\\2&4&2\\1&1&3\end{pmatrix},\qquad B=\begin{pmatrix}2&-1&1\\0&3&-1\\2&1&3\end{pmatrix}.$$
$p_A$ by minors $E_1=\operatorname{tr}A=10$; the principal $2\times2$ minors are $3\cdot4-2=10$, $3\cdot3-1=8$, $4\cdot3-2=10$, so $E_2=28$; $E_3=\det A=3\cdot10-1\cdot4+1\cdot(-2)=24$. Hence $p_A=x^3-10x^2+28x-24=(x-2)^2(x-6)$.
Eigenspaces of $A$ $A-2I=\begin{pmatrix}1&1&1\\2&2&2\\1&1&1\end{pmatrix}$ has rank $1$, so $g(2)=2=a(2)$, with $E_2=\{x+y+z=0\}=\operatorname{span}\{(-1,1,0),(-1,0,1)\}$. For $6$: $(1,2,1)$, since $A(1,2,1)^{\mathsf T}=(6,12,6)^{\mathsf T}$. Three independent eigenvectors: $A$ is diagonalisable.
$p_B$ $E_1=8$; minors $2\cdot3-0=6$, $2\cdot3-1\cdot2=4$, $3\cdot3-(-1)\cdot1=10$, so $E_2=20$; $\det B=2(9+1)+1(0+2)+1(0-6)=16$. Hence $p_B=x^3-8x^2+20x-16=(x-2)^2(x-4)$ — the same pattern of multiplicities.
Eigenspaces of $B$ $B-2I=\begin{pmatrix}0&-1&1\\0&1&-1\\2&1&1\end{pmatrix}$ has rank $2$ (rows 1 and 3 are independent, row 2 is $-$row 1), so $g(2)=1\lt a(2)=2$; $E_2=\operatorname{span}\{(-1,1,1)\}$. For $4$: $(1,-1,1)$. Only two independent eigenvectors: $B$ is not diagonalisable. Check: $B(-1,1,1)^{\mathsf T}=(-2,2,2)^{\mathsf T}$ and $B(1,-1,1)^{\mathsf T}=(4,-4,4)^{\mathsf T}$. ✓
Lesson The characteristic polynomial cannot tell $A$ from $B$ apart in shape; the rank of $A-\lambda I$ can.
✏️ Example 2 — Eigenvalue shortcuts
(a) Find the eigenvalues, trace and determinant of the $5\times5$ matrix with $4$ on the diagonal and $1$ everywhere else. (b) $A\in M_3(\mathbb{R})$ has eigenvalues $1,-1,2$. Find $\det B$ and $\operatorname{tr}B$ for $B=A^3-2A^2+3I$, and $\operatorname{tr}(A+A^{-1})$. (c) For $u=(1,2,3)^{\mathsf T}$, $v=(1,0,-1)^{\mathsf T}$, find the eigenvalues of $uv^{\mathsf T}$ and $\det(I+uv^{\mathsf T})$.
(a) The matrix is $3I+J$ with $J$ the $5\times5$ all-ones matrix. By Theorem 3.18(4) the eigenvalues are $3+5=8$ (once) and $3$ (four times). Trace $8+12=20$ (also $5\cdot4$ ✓), determinant $8\cdot3^4=648$.
(b) With $f(x)=x^3-2x^2+3$: $f(1)=2$, $f(-1)=0$, $f(2)=3$. So $\det B=0$ and $\operatorname{tr}B=5$. The eigenvalues of $A+A^{-1}$ are $\lambda+1/\lambda$: $2,\ -2,\ \tfrac52$, with trace $\tfrac52$.
(c) $v^{\mathsf T}u=1-3=-2$, so $uv^{\mathsf T}$ has eigenvalues $-2,0,0$, and $I+uv^{\mathsf T}$ has eigenvalues $-1,1,1$: $\det(I+uv^{\mathsf T})=-1=1+v^{\mathsf T}u$. (This is the matrix determinant lemma $\det(I+uv^{\mathsf T})=1+v^{\mathsf T}u$.)

Cayley–Hamilton and the Minimal Polynomial

📘 Definition 3.11 — Polynomials in $A$; minimal polynomial
For $f(x)=c_0+c_1x+\cdots+c_kx^k\in\mathbb{F}[x]$ put $f(A)=c_0I+c_1A+\cdots+c_kA^k$. The polynomial $f$ annihilates $A$ if $f(A)=0$. The minimal polynomial $m_A$ is the monic polynomial of least degree that annihilates $A$.
📐 Theorem 3.19 — Properties of the minimal polynomial
  1. $m_A$ exists and is unique, and for every $f\in\mathbb{F}[x]$: $f(A)=0\iff m_A\mid f$.
  2. Similar matrices have the same minimal polynomial.
  3. For a block diagonal matrix, $m_{\operatorname{diag}(A_1,\dots,A_k)}=\operatorname{lcm}(m_{A_1},\dots,m_{A_k})$.

Proof. (1) The $n^2+1$ matrices $I,A,\dots,A^{n^2}$ lie in the $n^2$-dimensional space $M_n(\mathbb{F})$, so they are dependent: some nonzero polynomial annihilates $A$, and there is one of least degree, which we scale to be monic. If $f(A)=0$, divide: $f=qm_A+r$ with $\deg r\lt\deg m_A$; then $r(A)=f(A)-q(A)m_A(A)=0$, and minimality forces $r=0$. Two monic annihilating polynomials of least degree divide each other, so they are equal. (2) $f(P^{-1}AP)=P^{-1}f(A)P$, so the same polynomials annihilate both. (3) $f(\operatorname{diag}(A_i))=\operatorname{diag}(f(A_i))$ vanishes iff every $m_{A_i}$ divides $f$, iff the least common multiple divides $f$. ∎

📐 Theorem 3.20 — The Cayley–Hamilton theorem
Every square matrix satisfies its characteristic polynomial: $p_A(A)=0$. Consequently $m_A\mid p_A$ and $\deg m_A\le n$.

Proof. Let $B(x)=\operatorname{adj}(xI-A)$, the adjugate (transposed cofactor matrix). Its entries are $(n-1)\times(n-1)$ minors of $xI-A$, polynomials of degree at most $n-1$, so $B(x)=B_0+B_1x+\cdots+B_{n-1}x^{n-1}$ with constant matrices $B_k$. The adjugate identity $M\operatorname{adj}M=(\det M)I$ gives

$$(xI-A)\,B(x)=p_A(x)\,I,\qquad p_A(x)=x^n+c_{n-1}x^{n-1}+\cdots+c_0 .$$

Comparing coefficients of powers of $x$: $-AB_0=c_0I$; $B_{k-1}-AB_k=c_kI$ for $1\le k\le n-1$; and $B_{n-1}=I$. Multiply the equation for $x^k$ on the left by $A^k$ and add all of them:

$$p_A(A)=-AB_0+\sum_{k=1}^{n-1}\left(A^kB_{k-1}-A^{k+1}B_k\right)+A^nB_{n-1}.$$

The sum telescopes: every term $A^{k+1}B_k$ appears once with each sign. So $p_A(A)=0$, and $m_A\mid p_A$ by Theorem 3.19(1). ∎

Note what the proof does not do: "substitute $x=A$ in $\det(xI-A)$ to get $\det(A-A)=0$" is not an argument — $p_A(A)$ is a matrix, while $\det(AI-A)$ would be a number.

📐 Theorem 3.21 — $m_A$ and $p_A$ have the same roots
  1. $\lambda\in\mathbb{F}$ is an eigenvalue of $A$ if and only if $m_A(\lambda)=0$. Over $\mathbb{C}$, if $p_A=\prod_i(x-\lambda_i)^{a_i}$ with distinct $\lambda_i$, then $m_A=\prod_i(x-\lambda_i)^{k_i}$ with $1\le k_i\le a_i$.
  2. $A$ is invertible iff $m_A(0)\ne0$ iff $p_A(0)\ne0$; then $A^{-1}$ is a polynomial in $A$: if $p_A(x)=x\,q(x)+c_0$ with $c_0\ne0$, then $A^{-1}=-c_0^{-1}q(A)$.

Proof. (1) If $Av=\lambda v$ with $v\ne0$, then $0=m_A(A)v=m_A(\lambda)v$, so $m_A(\lambda)=0$. Conversely every root of $m_A$ is a root of $p_A$ because $m_A\mid p_A$. Over $\mathbb{C}$ this says $m_A$ contains each factor $x-\lambda_i$ at least once and, dividing $p_A$, at most $a_i$ times. (2) $0$ is an eigenvalue iff it is a root of $m_A$ iff of $p_A$. From $p_A(A)=0$: $A\,q(A)=-c_0I$. ∎

🧭 Finding the minimal polynomial
  1. Factor $p_A=\prod(x-\lambda_i)^{a_i}$. The candidates are $\prod(x-\lambda_i)^{k_i}$ with $1\le k_i\le a_i$; test them in order of increasing degree.
  2. For block diagonal matrices take the lcm of the blocks' minimal polynomials; a Jordan block $J_k(\lambda)$ has minimal polynomial $(x-\lambda)^k$.
  3. Faster, with ranks: the exponent $k_i$ of $(x-\lambda_i)$ in $m_A$ is the least $k$ with $\operatorname{rank}(A-\lambda_iI)^k=\operatorname{rank}(A-\lambda_iI)^{k+1}$ (Theorem 3.25).
  4. If $A$ satisfies some identity $f(A)=0$, then $m_A$ is one of the monic divisors of $f$ — exclude the ones that do not annihilate $A$.
✏️ Example 3 — Cayley–Hamilton in action
Let $A=\begin{pmatrix}2&1\\3&0\end{pmatrix}$. (a) Express $A^{-1}$ as a polynomial in $A$. (b) Find a closed formula for $A^n$ and compute $A^5$. (c) Simplify $A^6-2A^5-3A^4+A$.
(a) $p_A=x^2-2x-3=(x-3)(x+1)$. Cayley–Hamilton: $A^2-2A-3I=0$, i.e. $A(A-2I)=3I$, so $A^{-1}=\tfrac13(A-2I)=\begin{pmatrix}0&\tfrac13\\1&-\tfrac23\end{pmatrix}$. Check: $A\cdot A^{-1}=\begin{pmatrix}0+1&\tfrac23-\tfrac23\\0&1\end{pmatrix}=I$ ✓.
(b) Reduce $x^n$ modulo $p_A$ Divide: $x^n=q(x)p_A(x)+ax+b$. Since $p_A(A)=0$, $A^n=aA+bI$. Substituting the roots $x=3$ and $x=-1$ of $p_A$: $3^n=3a+b$ and $(-1)^n=-a+b$. Hence $$a=\frac{3^n-(-1)^n}{4},\qquad b=\frac{3^n+3(-1)^n}{4}.$$
$A^5$ $a=\tfrac{243+1}4=61$, $b=\tfrac{243-3}4=60$: $A^5=61A+60I=\begin{pmatrix}182&61\\183&60\end{pmatrix}$. (Check: the trace $242=3^5+(-1)^5$ ✓.)
(c) $A^6-2A^5-3A^4=A^4(A^2-2A-3I)=A^4p_A(A)=0$, so the expression equals $A$.
✏️ Example 4 — Five minimal polynomials
Find the minimal polynomial of: (a) $D=\operatorname{diag}(2,2,3)$; (b) $\begin{pmatrix}2&1&0\\0&2&0\\0&0&3\end{pmatrix}$; (c) the companion matrix $C=\begin{pmatrix}0&0&-c_0\\1&0&-c_1\\0&1&-c_2\end{pmatrix}$; (d) the $n\times n$ all-ones matrix $J$ ($n\ge2$), and use it to compute $(I+J)^k$ for $n=3$; (e) a matrix $P$ with $P^2=P$, $P\ne0$, $P\ne I$.
(a) $p_D=(x-2)^2(x-3)$, and $(D-2I)(D-3I)=\operatorname{diag}(0,0,1)\operatorname{diag}(-1,-1,0)=0$. So $m_D=(x-2)(x-3)$, of degree $2\lt3$.
(b) The matrix is $J_2(2)\oplus(3)$, and $J_2(2)$ has minimal polynomial $(x-2)^2$ because $J_2(2)-2I\ne0$ but its square is $0$. By Theorem 3.19(3), $m=\operatorname{lcm}\left((x-2)^2,x-3\right)=(x-2)^2(x-3)=p$.
(c) $Ce_1=e_2$, $Ce_2=e_3$, so $e_1,Ce_1,C^2e_1$ are independent and no nonzero polynomial of degree $\le2$ can annihilate $C$ (it would give a relation among them). Thus $\deg m_C=3$ and $m_C=p_C=x^3+c_2x^2+c_1x+c_0$ (expand $\det(xI-C)$ along the last column to check $p_C$).
(d) $J^2=nJ$ since each entry of $J^2$ is a sum of $n$ ones; $J$ is not a scalar matrix, so $m_J=x(x-n)$. For $n=3$, $J^j=3^{j-1}J$ for $j\ge1$, and the binomial theorem gives $$(I+J)^k=I+\sum_{j=1}^k\binom kj3^{j-1}J=I+\frac{4^k-1}{3}\,J.$$
(e) $x^2-x=x(x-1)$ annihilates $P$, so $m_P\in\{x,\ x-1,\ x(x-1)\}$. $m_P=x$ would mean $P=0$ and $m_P=x-1$ would mean $P=I$. So $m_P=x(x-1)$.

Diagonalisability

📘 Definition 3.12 — Diagonalisable matrix
$A\in M_n(\mathbb{F})$ is diagonalisable over $\mathbb{F}$ if there is an invertible $P\in M_n(\mathbb{F})$ with $P^{-1}AP=D$ diagonal. An operator $T\in\mathcal{L}(V)$ is diagonalisable if some basis of $V$ makes its matrix diagonal.
📐 Theorem 3.22 — Four tests for diagonalisability
For $A\in M_n(\mathbb{F})$ the following are equivalent:
  1. $A$ is diagonalisable over $\mathbb{F}$;
  2. $\mathbb{F}^n$ has a basis of eigenvectors of $A$ — and then $P^{-1}AP=D$ for the matrix $P$ whose columns are these eigenvectors, with the corresponding eigenvalues on the diagonal of $D$;
  3. $\sum_\lambda g(\lambda)=n$; equivalently, $p_A$ splits over $\mathbb{F}$ and $g(\lambda)=a(\lambda)$ for every eigenvalue;
  4. $m_A$ splits over $\mathbb{F}$ into distinct linear factors: $m_A=(x-\lambda_1)\cdots(x-\lambda_k)$ with $\lambda_1,\dots,\lambda_k$ distinct.

Proof. (1)$\iff$(2): $AP=PD$ says exactly that the $j$-th column $p_j$ of $P$ satisfies $Ap_j=d_jp_j$, and $P$ is invertible iff its columns form a basis. (2)$\Rightarrow$(3): grouping a basis of eigenvectors by eigenvalue gives independent vectors in each $E_\lambda$, so $\sum g(\lambda)\ge n$; the reverse inequality is Theorem 3.17(2). (3)$\Rightarrow$(2): by Theorem 3.17(1) the union of bases of the eigenspaces is independent, and it has $\sum g(\lambda)=n$ vectors. The two forms of (3) are equivalent because $\sum g\le\sum a\le n$ with $g(\lambda)\le a(\lambda)$ termwise, and $\sum a=n$ iff $p_A$ splits.

(1)$\Rightarrow$(4): if $D$ has distinct diagonal values $\lambda_1,\dots,\lambda_k$, then $\prod_i(D-\lambda_iI)=0$ (each diagonal position meets one zero factor), so $\prod_i(x-\lambda_i)$ annihilates $A=PDP^{-1}$; $m_A$ divides it and has every $\lambda_i$ as a root (Theorem 3.21), so it equals it. (4)$\Rightarrow$(2): consider the Lagrange polynomials

$$L_i(x)=\prod_{j\ne i}\frac{x-\lambda_j}{\lambda_i-\lambda_j},\qquad i=1,\dots,k.$$

The polynomial $L_1+\cdots+L_k-1$ has degree $\lt k$ and vanishes at the $k$ points $\lambda_1,\dots,\lambda_k$, so $L_1+\cdots+L_k=1$. Hence every $v\in\mathbb{F}^n$ satisfies $v=\sum_iL_i(A)v$. Moreover $(x-\lambda_i)L_i(x)$ is a constant multiple of $m_A$, so $(A-\lambda_iI)L_i(A)v=0$: each $L_i(A)v$ lies in $E_{\lambda_i}$. Thus the eigenvectors span $\mathbb{F}^n$, and a basis of eigenvectors can be extracted from them. ∎

📐 Theorem 3.23 — Consequences
  1. If $A$ has $n$ distinct eigenvalues in $\mathbb{F}$, it is diagonalisable over $\mathbb{F}$.
  2. If $A\in M_n(\mathbb{C})$ satisfies $A^k=I$ for some $k\ge1$, it is diagonalisable over $\mathbb{C}$ with eigenvalues $k$-th roots of unity. If $A^2=A$ (idempotent), it is diagonalisable with eigenvalues in $\{0,1\}$, and $\operatorname{rank}A=\operatorname{tr}A$. If $A^2=I$, it is diagonalisable over $\mathbb{R}$ (when $A$ is real) with eigenvalues $\pm1$.
  3. A diagonalisable matrix with a single eigenvalue $\lambda$ is $\lambda I$. In particular a nilpotent matrix ($N^k=0$ for some $k$) is diagonalisable only if $N=0$.
  4. If $A=PDP^{-1}$, then $f(A)=Pf(D)P^{-1}$ for every polynomial $f$; in particular $A^m=PD^mP^{-1}$, and $f(A)$ is diagonalisable.
  5. Real symmetric matrices, Hermitian matrices and, more generally, normal matrices are diagonalisable — even by an orthogonal or unitary $P$ (§3.3).

Proof. (1) Each $g(\lambda)\ge1$, so $\sum g\ge n$. (2) $m_A$ divides $x^k-1$, whose roots $e^{2\pi ij/k}$ are distinct; it divides $x(x-1)$, resp. $(x-1)(x+1)$, whose roots are distinct and real; apply Theorem 3.22(4). For an idempotent, $D=\operatorname{diag}(1,\dots,1,0,\dots,0)$, so both rank and trace count the $1$'s. (3) $D=\lambda I$ gives $A=P(\lambda I)P^{-1}=\lambda I$; a nilpotent matrix has only the eigenvalue $0$ (Theorem 3.18(2): $\lambda^k=0$). (4) $(PDP^{-1})^m=PD^mP^{-1}$, then add up. (5) is proved in §3.3. ∎

✏️ Example 5 — Diagonalisable or not? Prove or disprove
(a) Every $A\in M_n(\mathbb{C})$ with $A^3=A$ is diagonalisable. (b) Every $A\in M_n(\mathbb{R})$ with $A^2=-I$ is diagonalisable over $\mathbb{R}$. (c) If $A\in M_n(\mathbb{C})$ and $A^2$ is diagonalisable, then $A$ is diagonalisable. (d) For real $a,b,c$, the matrix $\begin{pmatrix}1&a&b\\0&1&c\\0&0&2\end{pmatrix}$ is diagonalisable if and only if $a=0$.
(a) True $m_A$ divides $x^3-x=x(x-1)(x+1)$, which has distinct roots; Theorem 3.22(4). (The same holds over $\mathbb{R}$, since the roots are real.)
(b) False A real eigenvalue $\lambda$ with eigenvector $v$ would give $-v=A^2v=\lambda^2v$, i.e. $\lambda^2=-1$. So $A$ has no real eigenvalues at all, and cannot be diagonalised over $\mathbb{R}$; for example $\begin{pmatrix}0&-1\\1&0\end{pmatrix}$. (Over $\mathbb{C}$ it is diagonalisable, as $x^2+1=(x-i)(x+i)$. Also $(\det A)^2=\det(-I)=(-1)^n$ forces $n$ to be even.)
(c) False $A=\begin{pmatrix}0&1\\0&0\end{pmatrix}$: $A^2=0$ is diagonal, but $A$ is a nonzero nilpotent matrix (Theorem 3.23(3)). The statement becomes true if $A$ is invertible: then $m_{A^2}=\prod(x-\mu_i)$ with distinct $\mu_i\ne0$, so $A$ is annihilated by $\prod(x^2-\mu_i)$, whose $2k$ roots $\pm\sqrt{\mu_i}$ are distinct.
(d) True The eigenvalues are $1$ (with $a(1)=2$) and $2$ (simple), so the only question is whether $g(1)=2$, i.e. $\operatorname{rank}(A-I)=1$. Here $A-I=\begin{pmatrix}0&a&b\\0&0&c\\0&0&1\end{pmatrix}$. If $a=0$ every row is a multiple of $(0,0,1)$: rank $1$, diagonalisable, whatever $b,c$ are. If $a\ne0$ the rows $(0,a,b)$ and $(0,0,1)$ are independent: rank $2$, $g(1)=1$, not diagonalisable.

The Jordan Canonical Form from Rank Data

📘 Definition 3.13 — Jordan blocks, Jordan matrices, partitions

The Jordan block of size $k$ for $\lambda$ is the $k\times k$ matrix $J_k(\lambda)$ with $\lambda$ on the diagonal, $1$ on the superdiagonal and $0$ elsewhere; $J_1(\lambda)=(\lambda)$. For instance

$$J_3(\lambda)=\begin{pmatrix}\lambda&1&0\\0&\lambda&1\\0&0&\lambda\end{pmatrix}.$$

A Jordan matrix is a block diagonal matrix $J_{k_1}(\lambda_1)\oplus\cdots\oplus J_{k_s}(\lambda_s)$ (the $\lambda_i$ need not be distinct). A partition of $a$ is a way of writing $a$ as a sum of positive integers, ignoring order; $p(a)$ denotes the number of partitions of $a$, and $P(a,m)$ the number whose largest part is exactly $m$. Thus $p(1),\dots,p(7)=1,2,3,5,7,11,15$.

📐 Theorem 3.24 — The Jordan canonical form
Every $A\in M_n(\mathbb{C})$ — more generally, every $A\in M_n(\mathbb{F})$ whose characteristic polynomial splits over $\mathbb{F}$ — is similar to a Jordan matrix $J_A$, its Jordan canonical form, which is unique up to the order of the blocks. Two matrices are similar if and only if they have the same Jordan form.

Proof (sketch; full proof in the 📚 box). Step 1: split the space. If $p_A=\prod_i(x-\lambda_i)^{a_i}$, the factors $(x-\lambda_i)^{a_i}$ are pairwise coprime, and a Lagrange/Bézout argument like the one in Theorem 3.22 shows $\mathbb{C}^n=\bigoplus_iK_i$ with $K_i=N\left((A-\lambda_iI)^{a_i}\right)$, the generalised eigenspaces. Each $K_i$ is mapped into itself by $A$, has dimension $a_i$, and $N_i=(A-\lambda_iI)|_{K_i}$ is nilpotent. Step 2: nilpotent maps. A nilpotent operator $N$ has a basis consisting of chains $v,Nv,\dots,N^{m-1}v$ with $N^mv=0$; in the reversed chain $N^{m-1}v,\dots,Nv,v$ the matrix of $N$ is $J_m(0)$. Such a basis is built from the top: choose vectors whose images under $N^{m-1}$ form a basis of $\operatorname{im}N^{m-1}$, extend downwards level by level. So $A|_{K_i}=\lambda_iI+N_i$ is a direct sum of blocks $J_m(\lambda_i)$. Step 3: uniqueness. The number of blocks of each size is computed from ranks in Theorem 3.25, and ranks are similarity invariants. ∎

📐 Theorem 3.25 — Reading the Jordan form from ranks
Let $\lambda$ be an eigenvalue of $A\in M_n(\mathbb{C})$ and $r_k=\operatorname{rank}(A-\lambda I)^k$, with $r_0=n$. In the Jordan form of $A$:
  1. the number of blocks for $\lambda$ is $g(\lambda)=n-r_1$, and their sizes add up to $a(\lambda)$;
  2. the number of blocks for $\lambda$ of size $\ge k$ is $r_{k-1}-r_k$, and of size exactly $k$ is $r_{k-1}-2r_k+r_{k+1}$;
  3. the largest block for $\lambda$ has size equal to the exponent of $(x-\lambda)$ in $m_A$, which is the least $k$ with $r_k=r_{k+1}$ (and then $r_k=n-a(\lambda)$);
  4. the number of linearly independent eigenvectors of $A$ is the total number of blocks; $A$ is diagonalisable iff every block is $1\times1$, iff $r_1=r_2$ for every eigenvalue.

Proof. Ranks of block diagonal matrices add, and conjugation does not change ranks, so we may compute block by block in $J_A$. For a block $J_m(\mu)$ with $\mu\ne\lambda$, $J_m(\mu)-\lambda I$ is triangular with nonzero diagonal, hence invertible: it contributes $m$ to every $r_k$. For a block $J_m(\lambda)$, $J_m(\lambda)-\lambda I=J_m(0)$ shifts the standard basis, $e_1\mapsto0$, $e_j\mapsto e_{j-1}$; so $J_m(0)^k$ has $1$'s on the $k$-th superdiagonal and

$$\operatorname{rank}J_m(0)^k=\max(m-k,0).$$

Therefore, summing over the blocks $J_m(\lambda)$ for the eigenvalue $\lambda$,

$$r_{k-1}-r_k=\sum_{J_m(\lambda)}\Big[\max(m-k+1,0)-\max(m-k,0)\Big],$$

and each bracket is $1$ if $m\ge k$ and $0$ otherwise: this is (2), and (1) is the case $k=1$ together with Theorem 3.17. The block $J_m(\lambda)$ has minimal polynomial $(x-\lambda)^m$, so by Theorem 3.19(3) the exponent of $(x-\lambda)$ in $m_A$ is the largest $m$; and $r_k$ stops decreasing exactly when $k$ reaches it. (4) Each block contributes exactly one eigenvector ($e_1$ of the block), so $\sum_\lambda g(\lambda)$ is the number of blocks; all blocks have size $1$ iff no block has size $\ge2$ iff $r_1-r_2=0$ for every $\lambda$. ∎

It helps to picture the blocks for $\lambda$ as columns of dots (a dot diagram), one column of height $m$ for each block $J_m(\lambda)$, aligned at the bottom. Then $r_{k-1}-r_k$ is the number of dots in row $k$ from the bottom: the bottom row counts the blocks, i.e. the eigenvectors. Interactive 2 animates this.

📐 Theorem 3.26 — When a few invariants decide the Jordan form
For a single eigenvalue $\lambda$ with algebraic multiplicity $a=a(\lambda)$, the block sizes form a partition of $a$ whose largest part is the exponent of $(x-\lambda)$ in $m_A$ and whose number of parts is $g(\lambda)$. Consequently:
  1. if every $a(\lambda)\le3$, the matrix is determined up to similarity by $p_A$ and $m_A$;
  2. if every $a(\lambda)\le6$, it is determined by $p_A$, $m_A$ and the geometric multiplicities $g(\lambda)$;
  3. both bounds are sharp: $J_2(0)\oplus J_2(0)$ and $J_2(0)\oplus J_1(0)\oplus J_1(0)$ share $p=x^4$ and $m=x^2$; $J_3(0)\oplus J_3(0)\oplus J_1(0)$ and $J_3(0)\oplus J_2(0)\oplus J_2(0)$ share $p=x^7$, $m=x^3$ and $g=3$.

Proof. The first sentence is Theorem 3.25. For $a\le3$ the partitions are $(1)$; $(2),(1,1)$; $(3),(2,1),(1,1,1)$ — different largest parts in each case. For $a\le6$ one lists the $1+2+3+5+7+11=29$ partitions and checks that no two partitions of the same $a$ have both the same largest part and the same number of parts; the first coincidence occurs at $a=7$ with $(3,3,1)$ and $(3,2,2)$ (and at $a=4$ for largest part alone: $(2,2)$, $(2,1,1)$). The examples in (3) realise these coincidences; they are not similar because, for instance, $\operatorname{rank}N^2$ is $2$ for $(3,3,1)$ and $1$ for $(3,2,2)$. ∎

📐 Theorem 3.27 — Counting similarity classes
Let $\lambda_1,\dots,\lambda_r\in\mathbb{C}$ be distinct, $a_i\ge m_i\ge1$, $n=\sum a_i$. The number of similarity classes in $M_n(\mathbb{C})$ with $$p_A=\prod_{i=1}^r(x-\lambda_i)^{a_i},\qquad m_A=\prod_{i=1}^r(x-\lambda_i)^{m_i}$$ is $\prod_iP(a_i,m_i)$; with only $p_A$ prescribed it is $\prod_ip(a_i)$. The number of similarity classes of nilpotent $n\times n$ matrices is $p(n)$, and of those with $N^k=0$ it is the number of partitions of $n$ into parts of size at most $k$.

Proof. By Theorem 3.24 similarity classes correspond to Jordan matrices up to block order, i.e. to a choice, independently for each $\lambda_i$, of a partition of $a_i$ (the block sizes). Prescribing $m_A$ prescribes the largest part $m_i$ (Theorem 3.25(3)). A nilpotent matrix has $p_A=x^n$, and $N^k=0$ means that every block has size at most $k$. ∎

📐 Theorem 3.28 — Consequences of the Jordan form
  1. Every $A\in M_n(\mathbb{C})$ is similar to its transpose.
  2. If $N\in M_n(\mathbb{C})$ is nilpotent then $N^n=0$; its index (least $k$ with $N^k=0$) is the size of its largest Jordan block, and the index is $n$ iff $\operatorname{rank}N=n-1$.
  3. $J_k(\lambda)^m=\sum_{j=0}^{k-1}\binom mj\lambda^{m-j}J_k(0)^j$: the $j$-th superdiagonal of $J_k(\lambda)^m$ is constant, equal to $\binom mj\lambda^{m-j}$. Consequently $A^m\to0$ as $m\to\infty$ if and only if every eigenvalue of $A$ satisfies $|\lambda|\lt1$.

Proof. (1) Let $W$ be the $k\times k$ matrix with $1$'s on the antidiagonal; reversing the order of the basis, $WJ_k(\lambda)W=J_k(\lambda)^{\mathsf T}$ and $W=W^{-1}$. Doing this blockwise shows $J_A\sim J_A^{\mathsf T}$, and $A\sim J_A$, $A^{\mathsf T}\sim J_A^{\mathsf T}$. (2) All blocks of $N$ are $J_m(0)$ with $m\le n$, and $J_m(0)^k=0$ iff $k\ge m$. A single block of size $n$ is the same as $g(0)=n-\operatorname{rank}N=1$. (3) $J_k(\lambda)=\lambda I+J_k(0)$, the two terms commute, and $J_k(0)^j=0$ for $j\ge k$; apply the binomial theorem. If $|\lambda|\lt1$, each entry $\binom mj\lambda^{m-j}$ is a polynomial in $m$ times $|\lambda|^m$, which tends to $0$; if $|\lambda|\ge1$ the diagonal entries $\lambda^m$ do not tend to $0$. Apply this to $A^m=PJ_A^mP^{-1}$. ∎

🧭 Jordan form in GATE time
  1. Factor $p_A$; for each eigenvalue note $a(\lambda)$ — the total size of its blocks.
  2. Compute $g(\lambda)=n-\operatorname{rank}(A-\lambda I)$ — the number of blocks. If $g=a$, all blocks are $1\times1$.
  3. If the data are still ambiguous, compute $\operatorname{rank}(A-\lambda I)^2,\dots$ and use $r_{k-1}-r_k=\#\{\text{blocks of size}\ge k\}$; or use the exponent in $m_A$ as the largest block.
  4. Check: the sizes for each $\lambda$ add up to $a(\lambda)$, the number of blocks is $g(\lambda)$, and the largest block matches $m_A$.
✏️ Example 6 — The Jordan form from rank data
$A\in M_7(\mathbb{C})$ has $p_A=(x-2)^5(x+1)^2$, $\operatorname{rank}(A-2I)=4$, $\operatorname{rank}(A-2I)^2=3$, $\operatorname{rank}(A-2I)^3=2$ and $\operatorname{rank}(A+I)=6$. Find the Jordan form of $A$, its minimal polynomial and the number of linearly independent eigenvectors. Is $A$ diagonalisable?
$\lambda=2$ $r_0=7$, $r_1=4$, $r_2=3$, $r_3=2$. Number of blocks $r_0-r_1=3$; of size $\ge2$: $r_1-r_2=1$; of size $\ge3$: $r_2-r_3=1$. So two blocks of size $1$ and one of size $s\ge3$; the sizes add up to $a(2)=5$, so $s=3$. (Consistently, $r_3=2=7-5$, the contribution of the other eigenvalue, so the ranks have stopped decreasing.)
$\lambda=-1$ $g(-1)=7-6=1$: a single block, of size $a(-1)=2$.
Answer $J_A=J_3(2)\oplus J_1(2)\oplus J_1(2)\oplus J_2(-1)$, and $m_A=(x-2)^3(x+1)^2$ (largest blocks). There are $3+1=4$ independent eigenvectors, fewer than $7$: $A$ is not diagonalisable.
✏️ Example 7 — Counting similarity classes
How many similarity classes are there of: (a) $6\times6$ complex matrices with $p_A=(x-1)^4(x+2)^2$ and $m_A=(x-1)^2(x+2)$; (b) $5\times5$ complex matrices with $N^3=0$ but $N^2\ne0$; (c) $4\times4$ complex matrices with $p_A=(x-3)^4$; (d) $6\times6$ complex matrices with $A^2=A$?
(a) $2$ For $\lambda=1$: partitions of $4$ with largest part $2$: $(2,2)$ and $(2,1,1)$, so $P(4,2)=2$. For $\lambda=-2$: partitions of $2$ with largest part $1$: only $(1,1)$. Total $2\cdot1=2$: $J_2(1)\oplus J_2(1)\oplus(-2)\oplus(-2)$ and $J_2(1)\oplus J_1(1)\oplus J_1(1)\oplus(-2)\oplus(-2)$.
(b) $2$ $N$ is nilpotent with largest block exactly $3$: partitions of $5$ with largest part $3$ are $(3,2)$ and $(3,1,1)$.
(c) $5$ All partitions of $4$: $(4),(3,1),(2,2),(2,1,1),(1,1,1,1)$; $p(4)=5$.
(d) $7$ $A^2=A$ forces $A$ diagonalisable with eigenvalues in $\{0,1\}$ (Theorem 3.23(2)), so its class is determined by the number of $1$'s, i.e. by $\operatorname{rank}A\in\{0,1,\dots,6\}$: seven classes.
⚠️ Counterexamples and pitfalls
  1. Eigenvalues are not additive or multiplicative. $A=\begin{pmatrix}0&1\\0&0\end{pmatrix}$ and $B=\begin{pmatrix}0&0\\1&0\end{pmatrix}$ have only the eigenvalue $0$, but $A+B$ has eigenvalues $\pm1$ and $AB=\operatorname{diag}(1,0)$ has eigenvalue $1$. (For commuting matrices the eigenvalues of $A+B$ are sums $\lambda_i+\mu_i$ in a suitable order.)
  2. The same characteristic polynomial does not give similarity: $I_2$ and $J_2(1)$. The same $p_A$ and $m_A$ do not either, from size $4$ on: $J_2(0)\oplus J_2(0)$ and $J_2(0)\oplus J_1(0)\oplus J_1(0)$. Nor do $p_A$, $m_A$ and all $g(\lambda)$, from size $7$ on: $(3,3,1)$ versus $(3,2,2)$.
  3. A repeated eigenvalue does not prevent diagonalisability ($I$, or matrix $A$ of Example 1); distinct eigenvalues are sufficient, not necessary.
  4. $AB$ and $BA$ have the same eigenvalues but need not be similar. $A=\operatorname{diag}(1,0)$, $B=E_{12}$: $AB=E_{12}\ne0$ while $BA=0$.
  5. Row operations change eigenvalues. Never row-reduce $A$ before computing $p_A$; row-reduce $A-\lambda I$ only to find its rank or null space.
  6. $A$ and $A^{\mathsf T}$ have the same eigenvalues but usually different eigenvectors: $J_2(0)$ has eigenvector $e_1$, its transpose $e_2$.
  7. The field matters. The rotation $\begin{pmatrix}0&-1\\1&0\end{pmatrix}$ has no real eigenvalues and is diagonalisable over $\mathbb{C}$ but not over $\mathbb{R}$; it satisfies $A^4=I$, so "$A^k=I\Rightarrow$ diagonalisable" is a statement over $\mathbb{C}$. Over $\mathbb{F}_2$, $\begin{pmatrix}1&1\\0&1\end{pmatrix}$ satisfies $A^2=I$ and is not diagonalisable, because $x^2-1=(x-1)^2$ there.
  8. $m_A=p_A$ does not mean distinct eigenvalues ($J_2(0)$), and $\deg m_A\lt n$ does not mean diagonalisable ($J_2(0)\oplus(0)$ has $m=x^2$, $n=3$).
  9. $A^2$ diagonalisable does not make $A$ diagonalisable ($J_2(0)$), unless $A$ is invertible.
  10. Geometric multiplicity is $n-\operatorname{rank}(A-\lambda I)$, not the rank. And it counts eigenvectors (blocks), not the size of the eigenvalue's blocks.
  11. Cayley–Hamilton is not "$\det(A-A)=0$". See the remark after Theorem 3.20.
  12. Nilpotent $\ne$ zero eigenvalues over $\mathbb{R}$. A real matrix all of whose real eigenvalues are $0$, such as $(0)\oplus\begin{pmatrix}0&-1\\1&0\end{pmatrix}$, need not be nilpotent; over $\mathbb{C}$, "all eigenvalues $0$" does imply $N^n=0$ (Cayley–Hamilton).
📚 Go deeper — full proofs in the CSIR NET course

Two Labs

Interactive 1 — Hunting for Eigenvectors

Left: a unit vector $v$ (black) turns round the circle and $Av$ (red) follows it; the purple ellipse is the image of the unit circle. Whenever $Av$ is parallel to $v$, $v$ is an eigenvector — the green dashed lines are the eigen-directions. Right: the cross product $c(\theta)=v\times Av$ for $0\le\theta\le\pi$; its zeros are exactly the eigen-directions. Compare a symmetric matrix, a shear (one eigen-line, a double zero of $c$), a rotation (no zeros) and a scalar matrix ($c\equiv0$).

θ—
Av—
v × Av—
eigenvalues—
Interactive 2 — Jordan Blocks, Dot Diagrams and the Rank Staircase

Choose the block sizes of a nilpotent matrix $N$. Left: the matrix $N^k$ (filled cells are $1$'s). Middle: the dot diagram — one column per Jordan block, the bottom dot of each column being an eigenvector; the purple dots span $\operatorname{im}N^k$. Right: the ranks $r_k=\operatorname{rank}N^k$; each drop $r_{k-1}-r_k$ is the number of blocks of size $\ge k$. Press Play to raise $k$. Compare the partitions $(3,3,1)$ and $(3,2,2)$: same number of blocks, same largest block, different staircase.

k—
rank Nᵏ—
blocks = g—
index (largest block)—

Exercises

I
Eigenvalues and the characteristic polynomial.
  • 1 Find the eigenvalues and eigenspaces of $\begin{pmatrix}1&2\\3&2\end{pmatrix}$.
  • 2 Find the characteristic polynomial and the eigenvalues of $\begin{pmatrix}0&0&6\\1&0&-11\\0&1&6\end{pmatrix}$.
  • 3 $A\in M_3(\mathbb{R})$ has $\operatorname{tr}A=6$, $\operatorname{tr}A^2=14$ and $\det A=6$. Find its eigenvalues.
  • 4 Show that a nilpotent matrix has $p_A=x^n$. Conversely, if $A\in M_n(\mathbb{C})$ has only the eigenvalue $0$, show that $A$ is nilpotent.
  • 5 Every row of $A\in M_n(\mathbb{R})$ sums to $s$. Show that $s$ is an eigenvalue of $A$, and that if $A$ is invertible every row of $A^{-1}$ sums to $1/s$.
  • 6 Find the eigenvalues and the determinant of the $n\times n$ matrix with $0$ on the diagonal and $1$ everywhere else.
  • 7 Show that $AB$ and $BA$ need not be similar, using $A=\operatorname{diag}(1,0)$ and $B=\begin{pmatrix}0&1\\0&0\end{pmatrix}$.
  • 8 For which real $k$ does $\begin{pmatrix}1&k\\1&1\end{pmatrix}$ have real eigenvalues? Distinct real eigenvalues? Is it diagonalisable when $k=0$?
  • 9 $A\in M_3(\mathbb{R})$ satisfies $\det(A-I)=\det(A-2I)=\det(A+I)=0$. Find $\operatorname{tr}A$, $\det A$ and $\det(A^2+2I)$.
1 $p=x^2-3x-4=(x-4)(x+1)$. $E_4=\operatorname{span}\{(2,3)\}$, $E_{-1}=\operatorname{span}\{(1,-1)\}$. Check: $A(2,3)^{\mathsf T}=(8,12)^{\mathsf T}$, $A(1,-1)^{\mathsf T}=(-1,1)^{\mathsf T}$.
2 It is a companion matrix: expanding along the last column, $p=x^3-6x^2+11x-6=(x-1)(x-2)(x-3)$. Eigenvalues $1,2,3$.
3 $E_1=6$, $E_2=\tfrac12\left((\operatorname{tr}A)^2-\operatorname{tr}A^2\right)=\tfrac12(36-14)=11$, $E_3=6$: $p=x^3-6x^2+11x-6$, eigenvalues $1,2,3$.
4 If $N^k=0$ and $Nv=\lambda v$, $v\ne0$, then $0=N^kv=\lambda^kv$, so $\lambda=0$; over $\mathbb{C}$, $p_N=x^n$ (and the coefficients do not depend on the field). Conversely, if the only complex eigenvalue is $0$, then $p_A=x^n$ and Cayley–Hamilton gives $A^n=0$.
5 $A\mathbf{1}=s\mathbf{1}$ for $\mathbf{1}=(1,\dots,1)^{\mathsf T}$. If $A$ is invertible, $s\ne0$ and $A^{-1}\mathbf{1}=s^{-1}\mathbf{1}$, which says each row of $A^{-1}$ sums to $1/s$.
6 The matrix is $J-I$: eigenvalues $n-1$ (once) and $-1$ ($n-1$ times); $\det=(-1)^{n-1}(n-1)$.
7 $AB=\begin{pmatrix}0&1\\0&0\end{pmatrix}\ne0$ and $BA=0$. Both have $p=x^2$, but the only matrix similar to $0$ is $0$.
8 $p=x^2-2x+1-k$, discriminant $4k$. Real eigenvalues iff $k\ge0$, distinct iff $k\gt0$. For $k=0$ the matrix is $\begin{pmatrix}1&0\\1&1\end{pmatrix}$, with $A-I\ne0$ of rank $1$: $g(1)=1\lt2$, not diagonalisable.
9 The eigenvalues are $1,2,-1$: $\operatorname{tr}A=2$, $\det A=-2$, and $\det(A^2+2I)=(1+2)(4+2)(1+2)=54$.
II
Cayley–Hamilton and the minimal polynomial.
  • 1 Verify the Cayley–Hamilton theorem for $A=\begin{pmatrix}1&2\\3&4\end{pmatrix}$ and use it to write $A^{-1}$ as a polynomial in $A$.
  • 2 $A\in M_3(\mathbb{R})$ has $p_A(x)=x^3-2x^2-x+2$. Write $A^4$ and $A^{-1}$ in the form $\alpha A^2+\beta A+\gamma I$.
  • 3 Find the minimal polynomial of $J_2(2)\oplus J_1(2)\oplus J_1(5)$.
  • 4 Find the minimal polynomial of the $3\times3$ matrix all of whose entries are $1$.
  • 5 A real matrix $A$ has $m_A(x)=x^2+1$. Show that its size $n$ is even and that $A$ is diagonalisable over $\mathbb{C}$ but not over $\mathbb{R}$.
  • 6 $A\in M_n(\mathbb{C})$, $A\ne0$, satisfies $A^3=A^2$. List the possible minimal polynomials, and show that $A^2$ is idempotent.
  • 7 Prove that the inverse of an invertible matrix is a polynomial in the matrix. Is the polynomial unique?
  • 8 $A\in M_3(\mathbb{C})$ has $m_A=(x-1)^2$. Find $p_A$ and the Jordan form of $A$.
1 $p=x^2-5x-2$. $A^2=\begin{pmatrix}7&10\\15&22\end{pmatrix}$ and $A^2-5A-2I=\begin{pmatrix}7-5-2&10-10\\15-15&22-20-2\end{pmatrix}=0$ ✓. So $A(A-5I)=2I$ and $A^{-1}=\tfrac12(A-5I)=\begin{pmatrix}-2&1\\\tfrac32&-\tfrac12\end{pmatrix}$.
2 $A^3=2A^2+A-2I$, so $A^4=2A^3+A^2-2A=2(2A^2+A-2I)+A^2-2A=5A^2-4I$. From $A(A^2-2A-I)=-2I$: $A^{-1}=-\tfrac12A^2+A+\tfrac12I$. Check on the eigenvalues $1,-1,2$: $5\lambda^2-4=\lambda^4$ ✓ and $-\tfrac12\lambda^2+\lambda+\tfrac12=\tfrac1\lambda$ ✓.
3 $\operatorname{lcm}\left((x-2)^2,\ x-2,\ x-5\right)=(x-2)^2(x-5)$.
4 $J^2=3J$ and $J$ is not scalar: $m_J=x(x-3)$ (while $p_J=x^2(x-3)$).
5 $x^2+1$ has the distinct roots $\pm i$, so $A$ is diagonalisable over $\mathbb{C}$ with eigenvalues $\pm i$; these come in conjugate pairs with equal multiplicity (Theorem 3.16(5)), so $n=2\cdot a(i)$ is even. There are no real eigenvalues, so no diagonalisation over $\mathbb{R}$.
6 $m_A$ divides $x^2(x-1)$ and $m_A\ne x$ (since $A\ne0$): so $m_A\in\{x-1,\ x(x-1),\ x^2,\ x^2(x-1)\}$, realised by $I$, $\operatorname{diag}(1,0)$, $J_2(0)$, $J_2(0)\oplus(1)$. Idempotent: $(A^2)^2=A^4=A\cdot A^3=A\cdot A^2=A^3=A^2$.
7 Theorem 3.21(2). It is not unique as a polynomial (add any multiple of $m_A$), but it is unique among polynomials of degree $\lt\deg m_A$.
8 The only eigenvalue is $1$ (roots of $m_A$), so $p_A=(x-1)^3$. The largest block has size $2$ and the sizes add to $3$: $J_2(1)\oplus J_1(1)$.
III
Diagonalisability.
  • 1 Diagonalise $A=\begin{pmatrix}4&-2\\1&1\end{pmatrix}$ and find a formula for $A^n$.
  • 2 Is $\begin{pmatrix}2&1&0\\0&2&0\\0&0&3\end{pmatrix}$ diagonalisable?
  • 3 For which real $a,b$ is $\begin{pmatrix}1&a\\0&b\end{pmatrix}$ diagonalisable?
  • 4 Prove that every idempotent matrix is diagonalisable and that its rank equals its trace.
  • 5 $A\in M_n(\mathbb{R})$ satisfies $A^2=I$. Show that $A$ is diagonalisable over $\mathbb{R}$ and that $\operatorname{tr}A\equiv n\pmod 2$.
  • 6 Give a real $2\times2$ matrix that is diagonalisable over $\mathbb{C}$ but not over $\mathbb{R}$.
  • 7 Prove that a nonzero nilpotent matrix is not diagonalisable.
  • 8 Show that if $A$ is diagonalisable then so is $f(A)$ for every polynomial $f$. Is the converse true?
  • 9 Modelling. A city bike-share scheme has two stations. Each day $80\%$ of the bikes at station $A$ stay there and $20\%$ are ridden to $B$; at $B$, $70\%$ stay and $30\%$ go to $A$. With $x_n=(a_n,b_n)^{\mathsf T}$ the fractions of the fleet at $A$ and $B$ on day $n$, $x_{n+1}=Mx_n$. Find $M$, diagonalise it, and find the long-run distribution of the bikes and how fast it is approached.
1 $p=x^2-5x+6=(x-2)(x-3)$; $E_2=\operatorname{span}\{(1,1)\}$, $E_3=\operatorname{span}\{(2,1)\}$. With $P=\begin{pmatrix}1&2\\1&1\end{pmatrix}$, $P^{-1}=\begin{pmatrix}-1&2\\1&-1\end{pmatrix}$, $D=\operatorname{diag}(2,3)$: $$A^n=PD^nP^{-1}=\begin{pmatrix}2\cdot3^n-2^n&2^{n+1}-2\cdot3^n\\3^n-2^n&2^{n+1}-3^n\end{pmatrix}.$$ For $n=1$ this gives $\begin{pmatrix}4&-2\\1&1\end{pmatrix}$ ✓.
2 No: it is $J_2(2)\oplus(3)$, with $g(2)=3-\operatorname{rank}(A-2I)=3-2=1\lt a(2)=2$.
3 If $b\ne1$ the eigenvalues $1,b$ are distinct: diagonalisable. If $b=1$, it is diagonalisable iff $A-I=\begin{pmatrix}0&a\\0&0\end{pmatrix}$ is $0$, i.e. $a=0$.
4 Theorem 3.23(2): $m_A\mid x(x-1)$, distinct roots; $D=\operatorname{diag}(1,\dots,1,0,\dots,0)$, and rank and trace both count the $1$'s (both are similarity invariants).
5 $m_A\mid(x-1)(x+1)$, distinct real roots: diagonalisable over $\mathbb{R}$ with $p$ eigenvalues $1$ and $q$ eigenvalues $-1$, $p+q=n$. Then $\operatorname{tr}A=p-q=n-2q\equiv n\pmod2$.
6 $\begin{pmatrix}0&-1\\1&0\end{pmatrix}$: $p=x^2+1$, eigenvalues $\pm i$ (distinct, so diagonalisable over $\mathbb{C}$), none real.
7 A nilpotent matrix has only the eigenvalue $0$; if it were diagonalisable it would be similar to the zero matrix, hence zero (Theorem 3.23(3)).
8 $f(PDP^{-1})=Pf(D)P^{-1}$ and $f(D)$ is diagonal. The converse fails: for $A=J_2(0)$ and $f(x)=x^2$, $f(A)=0$ is diagonal but $A$ is not diagonalisable.
9 $M=\begin{pmatrix}0.8&0.3\\0.2&0.7\end{pmatrix}$ (columns sum to $1$). $p=x^2-1.5x+0.5=(x-1)(x-0.5)$, with $E_1=\operatorname{span}\{(3,2)\}$ and $E_{0.5}=\operatorname{span}\{(1,-1)\}$. Writing $x_0=\tfrac15(3,2)^{\mathsf T}+c(1,-1)^{\mathsf T}$ (the coordinates of $x_0$ add up to $1$), $x_n=\tfrac15(3,2)^{\mathsf T}+c\,(0.5)^n(1,-1)^{\mathsf T}$. In the long run $60\%$ of the bikes are at $A$ and $40\%$ at $B$; the deviation halves every day.
IV
The Jordan form and similarity classes.
  • 1 Find the Jordan form and the minimal polynomial of $\begin{pmatrix}3&1&0\\-1&1&0\\0&0&2\end{pmatrix}$.
  • 2 A nilpotent $N\in M_6(\mathbb{C})$ has $\operatorname{rank}N=3$, $\operatorname{rank}N^2=1$, $N^3=0$. Find its Jordan form.
  • 3 List all possible Jordan forms of $A\in M_5(\mathbb{C})$ with $p_A=(x-2)^3(x-5)^2$ and $m_A=(x-2)^2(x-5)$.
  • 4 Show that there are exactly $5$ similarity classes of $4\times4$ complex nilpotent matrices, and give the rank sequence $(\operatorname{rank}N,\operatorname{rank}N^2,\operatorname{rank}N^3)$ of each.
  • 5 How many similarity classes are there of $6\times6$ complex matrices with $p_A=(x-1)^4(x+1)^2$?
  • 6 Prove that $J_k(\lambda)$ is similar to its transpose.
  • 7 Suppose $p_A=m_A$ for $A\in M_n(\mathbb{C})$. Show that every eigenvalue has exactly one Jordan block, so $g(\lambda)=1$ for every eigenvalue.
  • 8 Compute $J_3(2)^5$.
1 The top-left block has trace $4$ and determinant $4$, so $p=(x-2)^2(x-2)=(x-2)^3$. $A-2I=\begin{pmatrix}1&1&0\\-1&-1&0\\0&0&0\end{pmatrix}$ has rank $1$: two blocks, sizes adding to $3$. Jordan form $J_2(2)\oplus J_1(2)$; $m_A=(x-2)^2$ (indeed $(A-2I)^2=0$).
2 $r_0,r_1,r_2,r_3=6,3,1,0$: blocks of size $\ge1$: $3$; $\ge2$: $2$; $\ge3$: $1$. So the sizes are $(3,2,1)$: $J_3(0)\oplus J_2(0)\oplus J_1(0)$.
3 For $2$: partitions of $3$ with largest part $2$: only $(2,1)$. For $5$: partitions of $2$ with largest part $1$: only $(1,1)$. A unique form: $J_2(2)\oplus J_1(2)\oplus(5)\oplus(5)$.
4 Classes $\leftrightarrow$ partitions of $4$ (Theorem 3.27): $(4)$: $(3,2,1)$; $(3,1)$: $(2,1,0)$; $(2,2)$: $(2,0,0)$; $(2,1,1)$: $(1,0,0)$; $(1,1,1,1)$: $(0,0,0)$. The rank sequences are all different, confirming that the classes are distinct.
5 $p(4)\cdot p(2)=5\cdot2=10$.
6 With $W$ the antidiagonal permutation matrix ($We_j=e_{k+1-j}$), $W^{-1}=W$ and $WJ_k(\lambda)W=J_k(\lambda)^{\mathsf T}$: reversing the basis moves the $1$'s from above to below the diagonal.
7 The exponent of $x-\lambda$ in $m_A$ is the largest block size; in $p_A$ it is the sum of the block sizes. If they are equal for every $\lambda$, there is just one block, and $g(\lambda)$ = number of blocks $=1$.
8 By Theorem 3.28(3) the diagonal is $2^5=32$, the first superdiagonal $\binom51 2^4=80$, the second $\binom522^3=80$: $$J_3(2)^5=\begin{pmatrix}32&80&80\\0&32&80\\0&0&32\end{pmatrix}.$$
🎯 GATE corner GATE MA · MCQGATE MA · MSQGATE MA · NAT

E1. GATE MA · MCQ Let $A$ be the $5\times5$ real matrix with every diagonal entry equal to $3$ and every off-diagonal entry equal to $1$. Then $\det A$ is (A) $112$; (B) $7$; (C) $48$; (D) $243$.

Idea $A=2I+J$ with $J$ the all-ones matrix; Theorem 3.18(4).
Compute Eigenvalues $2+5=7$ (once) and $2$ (four times): $\det A=7\cdot2^4=112$.
Options (B) is the largest eigenvalue alone; (D) $3^5$ multiplies the diagonal entries as if $A$ were triangular; (C) is $3\cdot2^4$, using the wrong large eigenvalue.
Answer (A).

E2. GATE MA · MCQ The minimal polynomial of $A=\begin{pmatrix}1&1&1\\0&1&1\\0&0&1\end{pmatrix}$ is (A) $x-1$; (B) $(x-1)^2$; (C) $(x-1)^3$; (D) $x^3-1$.

Idea $p_A=(x-1)^3$, so $m_A=(x-1)^k$ with $k$ the least power killing $N=A-I$.
Compute $N=\begin{pmatrix}0&1&1\\0&0&1\\0&0&0\end{pmatrix}\ne0$ and $N^2=\begin{pmatrix}0&0&1\\0&0&0\\0&0&0\end{pmatrix}\ne0$, while $N^3=0$. Equivalently $\operatorname{rank}N=2$: one Jordan block $J_3(1)$.
Options (A) would mean $A=I$; (B) fails because $N^2\ne0$; (D) $x^3-1$ has the non-real roots $e^{\pm2\pi i/3}$, which are not eigenvalues.
Answer (C).

E3. GATE MA · MSQ Let $A\in M_3(\mathbb{R})$ satisfy $A^3=A$, $\operatorname{tr}A=1$ and $\det A=0$. Which of the following is/are true? (One or more options may be correct.) (A) $A$ is diagonalisable over $\mathbb{R}$. (B) $\operatorname{rank}A=2$. (C) $A^2=A$. (D) $\det(A+I)=2$.

Eigenvalues $m_A\mid x^3-x=x(x-1)(x+1)$, so every eigenvalue lies in $\{-1,0,1\}$. $\det A=0$ forces one eigenvalue $0$; the other two lie in $\{-1,0,1\}$ and add up to $1$, so they are $0$ and $1$. The eigenvalues are $0,0,1$.
(A) True $x^3-x$ has distinct real roots (Theorem 3.22(4)).
(B) False; (C) True $A=P\operatorname{diag}(1,0,0)P^{-1}$, so $\operatorname{rank}A=1$ and $A^2=P\operatorname{diag}(1,0,0)^2P^{-1}=A$.
(D) True The eigenvalues of $A+I$ are $1,1,2$, with product $2$.
Answer (A), (C) and (D).

E4. GATE MA · MSQ Let $N\in M_4(\mathbb{C})$ be nilpotent with $\operatorname{rank}N=2$. Which of the following is/are necessarily true? (One or more options may be correct.) (A) $N^2=0$. (B) $N^3=0$. (C) If $N^2=0$, then $N$ is similar to $J_2(0)\oplus J_2(0)$. (D) $\operatorname{rank}N^2\le1$.

Idea $g(0)=4-2=2$ blocks with sizes adding to $4$: the partition is $(3,1)$ or $(2,2)$.
(A) False $J_3(0)\oplus J_1(0)$ has rank $2$ and $N^2\ne0$ (rank $1$).
(B) True In both cases the largest block has size $\le3$.
(C) True $N^2=0$ means every block has size $\le2$, which leaves only $(2,2)$.
(D) True $\operatorname{rank}N^2$ is $1$ for $(3,1)$ and $0$ for $(2,2)$.
Answer (B), (C) and (D).

E5. GATE MA · NAT The number of similarity classes of $8\times8$ complex matrices $A$ with $A^3=0$ is ______.

Idea Theorem 3.27: partitions of $8$ into parts of size at most $3$ (this includes $A=0$ and the matrices with $A^2=0$).
Count Two parts $3$: the remaining $2$ is $(2)$ or $(1,1)$ — $2$ ways. One part $3$: the remaining $5$ into parts $\le2$: $(2,2,1),(2,1,1,1),(1^5)$ — $3$ ways. No part $3$: $8$ into parts $\le2$, with $0$ to $4$ twos — $5$ ways.
Answer $2+3+5=10$. Answer: $10$.

E6. GATE MA · NAT $A\in M_3(\mathbb{R})$ has characteristic polynomial $x^3-7x^2+14x-8$. The value of $\operatorname{tr}(A^{-1})$ is ______ (correct to two decimal places).

Idea $\operatorname{tr}A^{-1}=\sum1/\lambda_i=\dfrac{\lambda_1\lambda_2+\lambda_1\lambda_3+\lambda_2\lambda_3}{\lambda_1\lambda_2\lambda_3}=\dfrac{E_2}{E_3}$.
Compute $E_2=14$, $E_3=8$, so $\operatorname{tr}A^{-1}=\tfrac{14}8=1.75$. (Indeed $p=(x-1)(x-2)(x-4)$ and $1+\tfrac12+\tfrac14=1.75$.)
Answer $1.75$ (accept $1.74$ to $1.76$).
🧑‍🏫 For the teacher

Suggested plan — 3 lectures × 60 min.

  1. Eigenvalues. Definitions 3.9–3.10, Theorems 3.15–3.17 with proofs (the block form $\begin{pmatrix}\lambda I_g&C\\0&D\end{pmatrix}$ is worth drawing). Example 1 on the board — let half the class do $A$, half do $B$, then compare. Project Interactive 1 on the shear and the rotation. Theorem 3.18 and Example 2 as a quick-fire GATE drill.
  2. Polynomials in a matrix. Definition 3.11, Theorem 3.19, the adjugate proof of Cayley–Hamilton (Theorem 3.20) and the warning after it, Theorem 3.21, Examples 3 and 4. Then diagonalisability: Theorem 3.22 with the Lagrange-polynomial proof, Theorem 3.23 and Example 5 as a prove-or-disprove discussion.
  3. Jordan form. Definition 3.13, Theorem 3.24 (sketch), Theorem 3.25 with the rank formula $\operatorname{rank}J_m(0)^k=\max(m-k,0)$. Project Interactive 2 and step through $(3,3,1)$ and $(3,2,2)$. Theorems 3.26–3.28, the strategy box, Examples 6 and 7. Finish with GATE corner E4 and E5.

Discussion questions. (1) Why can the characteristic polynomial never detect whether a matrix is diagonalisable, while the minimal polynomial always can? (2) A $3\times3$ matrix has a single eigenvalue. How many different Jordan forms can it have, and which single number (a rank) decides between them? (3) In Interactive 1, the cross product $c(\theta)$ is a quadratic form in $v$. Why does a defective matrix produce a double zero, and what would a triple root of $p_A$ look like for a $3\times3$ matrix?

Misconceptions to watch for. Row-reducing $A$ and reading eigenvalues off the result; treating $g(\lambda)$ as $\operatorname{rank}(A-\lambda I)$; "repeated eigenvalue $\Rightarrow$ not diagonalisable"; "$p_A$ and $m_A$ determine the matrix up to similarity" (false from $n=4$); the fake proof of Cayley–Hamilton; forgetting that diagonalisability depends on the field; adding eigenvalues of non-commuting matrices.

Suggested homework. I(2, 3, 5, 6, 9), II(1, 2, 5, 6), III(1, 3, 5, 8, 9), IV(1, 2, 3, 5, 8); GATE corner E1, E3, E6.

🔬 Research–Teaching NexusResearch-tutored · optional, about 60 minutes

Research question. Will an age-structured animal population grow or decline in the long run, at what rate, and with what age profile — and why are the answers an eigenvalue and an eigenvector of a $3\times3$ matrix?

Why it matters. Wildlife agencies, fisheries scientists and conservation biologists (for sea turtles, seabirds, fish stocks) use Leslie matrix models to decide which life stage to protect. If $x_t$ lists the numbers of juveniles, sub-adults and adults in year $t$, then $x_{t+1}=Lx_t$, so $x_t=L^tx_0$, and the long-run behaviour of $L^t$ is governed by the eigenvalue of largest modulus (Theorem 3.28(3)).

What to do.

  1. Take $L=\begin{pmatrix}0&1.5&1.2\\0.6&0&0\\0&0.5&0\end{pmatrix}$: sub-adults and adults have $1.5$ and $1.2$ offspring per year, $60\%$ of juveniles and $50\%$ of sub-adults survive to the next stage. Show that $p_L(x)=x^3-0.9x-0.36$.
  2. Show that $p_L(1)\lt0$ and conclude that $L$ has a real eigenvalue $\lambda_1\gt1$. Find it numerically (Newton's method or a root finder) and the corresponding eigenvector, normalised to sum $1$ — the stable age distribution.
  3. Start from $x_0=(100,0,0)$ and iterate $x_{t+1}=Lx_t$ for $30$ years (the power method). Plot the ratios of total population in successive years and the proportions in each class. How fast do they settle, and how is that speed related to the other two eigenvalues?
  4. The net reproductive number is $R_0=1.5\cdot0.6+1.2\cdot0.6\cdot0.5$. Show that $\lambda_1\gt1$ exactly when $R_0\gt1$ (divide $p_L(\lambda)=0$ by $\lambda^3$). Which survival rate would you try to improve to make the population grow fastest?

Tools: Python with numpy (numpy.linalg.eig, a loop for the power method) or a spreadsheet.

Hand in: the characteristic polynomial and its roots; the stable age distribution; the plots of step 3; a short paragraph answering the conservation question of step 4 with numbers (change one survival rate by $0.05$ and recompute $\lambda_1$).

Going further. Read about the Perron–Frobenius theorem, which guarantees a positive dominant eigenvalue with a positive eigenvector for matrices like $L$, and about elasticity analysis, which measures how $\lambda_1$ responds to each entry of $L$ via the left and right eigenvectors.

Instructor note: $p_L(x)=x^3-0.9x-0.36$, $p_L(1)=-0.26$. The roots are $\lambda_1\approx1.1069$ and $\approx-0.5535\pm0.1376i$ (modulus $\approx0.570$), so the population grows by about $10.7\%$ a year and the age profile converges like $(0.570/1.107)^t\approx0.515^t$ — within a few percent after about six years. The stable age distribution is approximately $(0.560,\ 0.303,\ 0.137)$. $R_0=0.9+0.36=1.26\gt1$. Students should see the ratio of totals settle to $1.107$ and the proportions to the eigenvector; the oscillation in early years comes from the complex pair.

🧪 Self-check quiz

0/5 correct

Q1. $A\in M_3(\mathbb{R})$ has eigenvalues $1,2,3$. Then $\det(A+I)$ equals

Q2. Which of these matrices is not diagonalisable over $\mathbb{C}$?

Q3. The minimal polynomial of the Jordan matrix $J_2(0)\oplus J_1(0)\oplus J_3(0)$ is

Q4. In the Jordan form of $A\in M_n(\mathbb{C})$, the number of Jordan blocks for the eigenvalue $\lambda$ equals

Q5. How many similarity classes of $3\times3$ complex nilpotent matrices are there?