9.2 Diagonal and Triangular Forms
A diagonalisable operator is a list of independent stretchings. The minimal polynomial decides exactly when that happens; when it does not, the primary decomposition still splits the space into pieces with one eigenvalue each, and every operator whose characteristic polynomial splits is triangular in a suitable — even orthonormal — basis.
If $A=PDP^{-1}$ with $D=\operatorname{diag}(\lambda_1,\dots,\lambda_n)$, then every computation with $A$ becomes a computation with numbers: $A^k=PD^kP^{-1}$, $f(A)=Pf(D)P^{-1}$, $e^{tA}=Pe^{tD}P^{-1}$, and the system $x'=Ax$ splits into $n$ independent equations $y_i'=\lambda_iy_i$ in the coordinates $y=P^{-1}x$. Engineers use this to separate the vibration modes of a structure, chemists to decouple reaction rates, statisticians to compute long-run behaviour of Markov chains. The trouble is that not every matrix can be diagonalised — the shear $\begin{pmatrix}1&1\\0&1\end{pmatrix}$ has only one eigen-direction — and that whether a matrix can be diagonalised may depend on the field.
This section answers the question completely. A matrix is diagonalisable exactly when its minimal polynomial is a product of distinct linear factors (Theorem 9.16); the proof goes through the primary decomposition theorem, which splits $V$ into invariant pieces, one for each irreducible factor of $m_T$. When diagonalisation fails, triangularisation still works as soon as the characteristic polynomial splits — over $\mathbb{C}$ always, and by Schur's theorem even with a unitary change of basis. Finally, commuting operators can be diagonalised or triangularised simultaneously. CSIR NET asks constantly "which of these matrices are diagonalisable (over $\mathbb{R}$? over $\mathbb{C}$?)", "if $A^k=I$ then …", "if $AB=BA$ then …" — and this section is where those questions are settled. We use the notation of §9.1: $p_T$, $m_T$, $E_\lambda$, $a(\lambda)$, $g(\lambda)$.
Diagonalisable Operators
- $T$ is diagonalisable;
- $V$ has a basis consisting of eigenvectors of $T$;
- $V=E_{\lambda_1}\oplus\cdots\oplus E_{\lambda_k}$;
- $g(\lambda_1)+\cdots+g(\lambda_k)=n$;
- $p_T$ splits over $\mathbb{F}$ and $g(\lambda_i)=a(\lambda_i)$ for every $i$.
Proof. (1)$\iff$(2): $[T]_{\mathcal{B}}=\operatorname{diag}(d_1,\dots,d_n)$ says precisely $Tb_j=d_jb_j$ for every basis vector $b_j$. (2)$\Rightarrow$(3): the sum of the eigenspaces is direct by Theorem 9.3, and it contains a basis, so it is $V$. (3)$\Rightarrow$(4): dimensions of a direct sum add up. (4)$\Rightarrow$(2): choose a basis of each $E_{\lambda_i}$; the union has $\sum g(\lambda_i)=n$ vectors, and it is independent because the sum of the eigenspaces is direct (Theorem 9.3); so it is a basis of eigenvectors. (4)$\iff$(5): by Theorem 9.4, $\sum g(\lambda_i)\le\sum a(\lambda_i)\le n$ with $g(\lambda_i)\le a(\lambda_i)$ termwise. So $\sum g=n$ holds iff $\sum a=n$ (i.e. $p_T$ splits) and every inequality $g(\lambda_i)\le a(\lambda_i)$ is an equality. For the last statement: $AP=PD$ says column by column that $Ap_j=d_jp_j$, and $P$ is invertible iff its columns form a basis; $p_D=\prod(x-d_j)$ equals $p_A$, so each $\lambda_i$ appears $a(\lambda_i)$ times. ∎
Proof. Each of the $n$ eigenvalues has $g\ge1$, so $\sum g\ge n$; with Theorem 9.4, $\sum g=n$, and Theorem 9.12(4) applies. ∎
Invariant Subspaces and the Primary Decomposition
- Let $W$ be $T$-invariant, and extend a basis $(w_1,\dots,w_r)$ of $W$ to a basis $\mathcal{B}$ of $V$. Then $[T]_{\mathcal{B}}=\begin{pmatrix}A&B\\0&C\end{pmatrix}$ with $A=[T|_W]$ and $C$ the matrix of $\overline{T}$ in the induced basis of $V/W$. Hence $p_T=p_{T|_W}\,p_{\overline{T}}$, and $m_{T|_W}$, $m_{\overline{T}}$ both divide $m_T$.
- If $V=W_1\oplus\cdots\oplus W_k$ with every $W_i$ invariant, then in a basis adapted to the decomposition $[T]$ is block diagonal, $p_T=\prod p_{T|_{W_i}}$ and $m_T=\operatorname{lcm}_i\,m_{T|_{W_i}}$.
- If $S\in\mathcal{L}(V)$ commutes with $T$, then $\ker S$, $\operatorname{im}S$ and every eigenspace of $S$ are $T$-invariant. In particular $\ker f(T)$ and $\operatorname{im}f(T)$ are $T$-invariant for every $f\in\mathbb{F}[x]$.
Proof. (1) $Tw_j\in W$ is a combination of $w_1,\dots,w_r$ only, so the first $r$ columns vanish below row $r$; the top-left block is $[T|_W]$. For $j\gt r$, $Tb_j=\sum_{i\le r}(\cdot)w_i+\sum_{i\gt r}c_{ij}b_i$, and modulo $W$ this reads $\overline{T}(b_j+W)=\sum_{i\gt r}c_{ij}(b_i+W)$, so $C=[\overline{T}]$. The factorisation of $p_T$ is Theorem 9.2(5). If $f(T)=0$ then $f(T)$ vanishes on $W$ and on $V/W$, i.e. $f(T|_W)=0$ and $f(\overline{T})=0$; so both minimal polynomials divide $m_T$ (Theorem 9.6). (2) is Theorem 9.6 for block diagonal matrices. (3) If $Sv=0$ then $S(Tv)=T(Sv)=0$; if $v=Su$ then $Tv=S(Tu)\in\operatorname{im}S$; and $E_\mu(S)=\ker(S-\mu I)$ with $S-\mu I$ commuting with $T$. Polynomials in $T$ commute with $T$ (Theorem 9.5). ∎
- $V=W_1\oplus W_2\oplus\cdots\oplus W_k$, and each $W_i$ is $T$-invariant;
- the minimal polynomial of $T_i=T|_{W_i}$ is $q_i^{e_i}$;
- the projection $E_i$ of $V$ onto $W_i$ along $\bigoplus_{j\ne i}W_j$ is a polynomial in $T$.
Proof. Put $f_i=m_T/q_i^{e_i}=\prod_{j\ne i}q_j^{e_j}$. No irreducible polynomial divides all of $f_1,\dots,f_k$ ($q_i$ does not divide $f_i$), so $\gcd(f_1,\dots,f_k)=1$, and by Bézout's identity in $\mathbb{F}[x]$ there are $g_1,\dots,g_k$ with $$g_1f_1+g_2f_2+\cdots+g_kf_k=1.$$ Define $E_i=g_i(T)f_i(T)$. Then:
- $E_1+\cdots+E_k=I$ (substitute $T$ in the identity above);
- $E_iE_j=0$ for $i\ne j$, because $m_T$ divides $f_if_j$; multiplying $\sum_jE_j=I$ by $E_i$ then gives $E_i^2=E_i$;
- $\operatorname{im}E_i\subseteq W_i$, since $q_i^{e_i}f_i=m_T$ gives $q_i(T)^{e_i}E_i=g_i(T)\,m_T(T)=0$;
- $W_i\subseteq\operatorname{im}E_i$: if $v\in W_i$ then for $j\ne i$, $q_i^{e_i}$ divides $f_j$, so $E_jv=0$, and $v=\sum_jE_jv=E_iv$.
So $W_i=\operatorname{im}E_i$, and every $v=\sum E_iv$ is a sum of elements of the $W_i$. The sum is direct: if $w_1+\cdots+w_k=0$ with $w_j\in W_j$, apply $E_i$; since $E_iw_j=E_iE_jw_j=0$ for $j\ne i$ (as $w_j=E_jw_j$) and $E_iw_i=w_i$, we get $w_i=0$. Each $W_i$ is invariant by Theorem 9.14(3). This proves (1) and (3).
(2) $q_i(T_i)^{e_i}=0$ by definition of $W_i$, so $m_{T_i}=q_i^{d_i}$ with $d_i\le e_i$ ($q_i$ is irreducible). By Theorem 9.14(2), $m_T=\operatorname{lcm}(q_1^{d_1},\dots,q_k^{d_k})=\prod q_i^{d_i}$; comparing with $m_T=\prod q_i^{e_i}$ gives $d_i=e_i$. In the split case $m_{T_i}=(x-\lambda_i)^{e_i}$, so $N_i=T_i-\lambda_iI$ is nilpotent of index $e_i$ and $p_{T_i}=(x-\lambda_i)^{\dim W_i}$ (its only root is $\lambda_i$, Theorem 9.8). Since $p_T=\prod p_{T_i}$ (Theorem 9.14(2)), the exponent of $x-\lambda_i$ in $p_T$ is $\dim W_i$, i.e. $\dim W_i=a(\lambda_i)$. ∎
Proof. ($\Rightarrow$) Let $\mathcal{B}$ be a basis of eigenvectors and $f=\prod(x-\lambda_i)$ over the distinct eigenvalues. For $b\in\mathcal{B}$ with $Tb=\lambda_jb$, the factors of $f(T)$ commute and $(T-\lambda_jI)b=0$, so $f(T)b=0$. Hence $f(T)=0$ and $m_T\mid f$; since every eigenvalue is a root of $m_T$ (Theorem 9.8), $m_T=f$. ($\Leftarrow$) In Theorem 9.15 all $e_i=1$ and $q_i=x-\lambda_i$, so $V=\bigoplus\ker(T-\lambda_iI)=\bigoplus E_{\lambda_i}$, which is Theorem 9.12(3). For the formula: on $E_{\lambda_l}$ the operator $\prod_{j\ne i}(T-\lambda_jI)/(\lambda_i-\lambda_j)$ acts as the scalar $\prod_{j\ne i}(\lambda_l-\lambda_j)/(\lambda_i-\lambda_j)$, which is $1$ for $l=i$ and $0$ for $l\ne i$; that is the projection onto $E_{\lambda_i}$ along the others, and $T=\sum\lambda_iE_i$ holds on every $E_{\lambda_l}$. (a) $m_T$ divides such a polynomial, so it too has distinct roots in $\mathbb{F}$. (b) $m_{T|_W}\mid m_T$ (Theorem 9.14(1)), and a divisor of a product of distinct linear factors is again one. (c) $m_T$ divides $x^r$ and has distinct roots, so $m_T=x$ and $T=0$. ∎
- Does $p_A$ split over the field? If not (e.g. a factor $x^2+1$ over $\mathbb{R}$), the answer is no.
- Distinct eigenvalues? Then yes (Theorem 9.13).
- Repeated eigenvalue $\lambda$: compare $g(\lambda)=n-\operatorname{rank}(A-\lambda I)$ with $a(\lambda)$; or test whether $\prod(A-\lambda_iI)=0$ over the distinct eigenvalues.
- Given a polynomial identity ($A^2=A$, $A^3=A$, $A^k=I$, $A^2-3A+2I=0$): factor it. Distinct roots in the field $\Rightarrow$ yes (Theorem 9.16(a)). A repeated root decides nothing until you know $m_A$.
- Symmetric real matrices are always diagonalisable (§10.2); nonzero nilpotent ones never are.
Triangular Forms and Schur's Theorem
Proof. ($\Rightarrow$) If $[T]_{\mathcal{B}}$ is upper triangular with diagonal $t_{11},\dots,t_{nn}$, then $p_T=\prod(x-t_{jj})$ splits (Theorem 9.2(5)), and the $t_{jj}$ are the eigenvalues with multiplicity. ($\Leftarrow$) Induction on $n$; $n=1$ is trivial. Since $p_T$ splits it has a root $\lambda_1\in\mathbb{F}$; let $b_1$ be an eigenvector and $W=\operatorname{span}\{b_1\}$, which is invariant. By Theorem 9.14(1), $p_T=(x-\lambda_1)\,p_{\overline{T}}$, where $\overline{T}$ acts on $V/W$ of dimension $n-1$; so $p_{\overline{T}}$ also splits. By induction $V/W$ has a basis $b_2+W,\dots,b_n+W$ in which $\overline{T}$ is upper triangular: $\overline{T}(b_j+W)\in\operatorname{span}\{b_2+W,\dots,b_j+W\}$. Lifting, $Tb_j\in\operatorname{span}\{b_1,b_2,\dots,b_j\}$ for $j\ge2$, and $Tb_1=\lambda_1b_1$. The vectors $b_1,\dots,b_n$ form a basis of $V$ (their classes together with $W$ span), and $[T]$ is upper triangular. The minimal polynomial splits iff the characteristic one does, because they have the same irreducible factors (Theorem 9.8). ∎
A second proof of Cayley–Hamilton (over $\mathbb{C}$). With a flag $V_0\subset\cdots\subset V_n$ and diagonal entries $\lambda_1,\dots,\lambda_n$, $(T-\lambda_jI)V_j\subseteq V_{j-1}$, because $Tb_j-\lambda_jb_j\in V_{j-1}$. Hence $(T-\lambda_1I)(T-\lambda_2I)\cdots(T-\lambda_nI)$ maps $V=V_n$ into $V_{n-1}$, then into $V_{n-2}$, …, and finally into $V_0=\{0\}$. That product is $p_T(T)$. The same flag argument proves the multiplicity part of Theorem 9.9: $f(T)$ is triangular with diagonal $f(\lambda_j)$.
- (Schur's inequality) $\sum_i|\lambda_i|^2\le\sum_{i,j}|a_{ij}|^2=\operatorname{tr}(A^*A)$, with equality if and only if $T$ is diagonal, i.e. $A$ is unitarily diagonalisable;
- the diagonalisable matrices are dense in $M_n(\mathbb{C})$: every $A$ is a limit of matrices with $n$ distinct eigenvalues.
Proof. Induction on $n$, as in Theorem 9.17 but keeping orthonormality. Let $\lambda_1$ be an eigenvalue and $u_1$ a unit eigenvector. Extend $u_1$ to an orthonormal basis $u_1,\dots,u_n$ of $\mathbb{C}^n$ (Gram–Schmidt, §10.1) and let $U_1$ be the unitary matrix with these columns. The first column of $U_1^*AU_1$ is $U_1^*Au_1=\lambda_1U_1^*u_1=\lambda_1e_1$, so
$$U_1^*AU_1=\begin{pmatrix}\lambda_1&*\\0&A_1\end{pmatrix},\qquad A_1\in M_{n-1}(\mathbb{C}).$$By induction $U_2^*A_1U_2=T_1$ is upper triangular for a unitary $U_2$; then $U=U_1\operatorname{diag}(1,U_2)$ is unitary and $U^*AU=\begin{pmatrix}\lambda_1&*\\0&T_1\end{pmatrix}$ is upper triangular. Its diagonal lists the eigenvalues (Theorem 9.17). If $A$ is real with real eigenvalues, the eigenvector $u_1$ can be chosen real, Gram–Schmidt stays in $\mathbb{R}^n$, and $A_1$ is real with real eigenvalues, so the same induction runs with real orthogonal matrices.
(1) Since $A^*A=UT^*U^*UTU^*=UT^*TU^*$ and the trace is a similarity invariant,
$$\operatorname{tr}(A^*A)=\operatorname{tr}(T^*T)=\sum_{i\le j}|t_{ij}|^2=\sum_i|\lambda_i|^2+\sum_{i\lt j}|t_{ij}|^2,$$which is $\ge\sum|\lambda_i|^2$, with equality iff all $t_{ij}$ ($i\lt j$) vanish. (2) Given $\varepsilon\gt0$, change the diagonal entries of $T$ by amounts $\delta_i$ with $|\delta_i|\lt\varepsilon$ so that $t_{ii}+\delta_i$ are distinct, and put $A_\varepsilon=U(T+\operatorname{diag}(\delta_i))U^*$. It has $n$ distinct eigenvalues, so it is diagonalisable (Theorem 9.13), and $\operatorname{tr}\big((A_\varepsilon-A)^*(A_\varepsilon-A)\big)=\sum|\delta_i|^2\lt n\varepsilon^2$. ∎
Simultaneous Diagonalisation and Triangularisation
Proof. ($\Rightarrow$) Diagonal matrices commute, so $[ST]=[S][T]=[T][S]=[TS]$ in the common basis. ($\Leftarrow$) Let $\lambda_1,\dots,\lambda_k$ be the distinct eigenvalues of $T$, so $V=E_{\lambda_1}(T)\oplus\cdots\oplus E_{\lambda_k}(T)$ (Theorem 9.12). Each $E_{\lambda_i}(T)$ is $S$-invariant because $S$ commutes with $T$ (Theorem 9.14(3)), and $S|_{E_{\lambda_i}(T)}$ is diagonalisable by Theorem 9.16(b). Choose a basis of each $E_{\lambda_i}(T)$ consisting of eigenvectors of $S$; its vectors are also eigenvectors of $T$ (everything in $E_{\lambda_i}(T)$ is). The union of these bases is a basis of $V$ of common eigenvectors. For a commuting family, induct on $\dim V$: if every member is a scalar there is nothing to do; otherwise some $T$ in the family has at least two eigenvalues, every eigenspace $E_{\lambda_i}(T)$ is invariant under the whole family and has smaller dimension, and the restrictions are diagonalisable and commute, so by induction each $E_{\lambda_i}(T)$ has a basis of common eigenvectors. The last statement: in the common basis $S+T$, $ST$, $f(S,T)$ are diagonal. ∎
Proof (with every key step). (1) The family spans a subspace of the finite-dimensional space $\mathcal{L}(V)$, so it has a finite basis $T_1,\dots,T_r$ taken from $\mathcal{F}$, and a common eigenvector of $T_1,\dots,T_r$ is one of every member (each member is a combination of them). Let $W_0=V$. $T_1|_{W_0}$ has an eigenvalue $\lambda_1$ (its characteristic polynomial splits); $W_1=\ker(T_1-\lambda_1I)\ne\{0\}$ is invariant under every $T_j$ (they commute with $T_1$). The restriction $T_2|_{W_1}$ has characteristic polynomial dividing $p_{T_2}$ (Theorem 9.14(1)), so it splits and has an eigenvalue $\lambda_2$; $W_2=W_1\cap\ker(T_2-\lambda_2I)\ne\{0\}$ is again invariant under all $T_j$. After $r$ steps, every nonzero vector of $W_r$ is a common eigenvector. (2) Induction on $n$ as in Theorem 9.17: take a common eigenvector $b_1$, pass to $V/\operatorname{span}\{b_1\}$, on which the induced operators still commute and have split characteristic polynomials, triangularise them simultaneously by induction, and lift. For the unitary version, run the proof of Theorem 9.18 with a common unit eigenvector $u_1$; the blocks $A_1,B_1,\dots$ still commute because $U_1^*AU_1$ and $U_1^*BU_1$ commute and are block triangular. Finally, if $U^*AU$ and $U^*BU$ are upper triangular with diagonals $(\lambda_i)$, $(\mu_i)$, then $U^*(A+B)U$ and $U^*ABU$ are upper triangular with diagonals $(\lambda_i+\mu_i)$, $(\lambda_i\mu_i)$. ∎
- Real eigenvalues do not imply diagonalisable: $\begin{pmatrix}1&1\\0&1\end{pmatrix}$, or any nonzero nilpotent matrix.
- Diagonalisable depends on the field: the $90^\circ$ rotation is diagonalisable over $\mathbb{C}$, not over $\mathbb{R}$; $\begin{pmatrix}0&1\\1&0\end{pmatrix}$ over $\mathbb{R}$, not over $\mathbb{F}_2$.
- Distinct eigenvalues is sufficient, not necessary: $I_n$, or $D$ of Example 1.
- Invertible $\ne$ diagonalisable, in both directions: $\begin{pmatrix}1&1\\0&1\end{pmatrix}$ is invertible but not diagonalisable; $\operatorname{diag}(1,0)$ is diagonalisable but singular.
- A repeated root in an annihilating polynomial decides nothing: $A^2=2A-I$ holds for $I$ (diagonalisable) and for the shear (not). Only the minimal polynomial decides.
- Sums and products of diagonalisable matrices need not be diagonalisable (Example 7(b); $\operatorname{diag}(1,0)\begin{pmatrix}0&1\\1&0\end{pmatrix}=\begin{pmatrix}0&1\\0&0\end{pmatrix}$) — unless they commute.
- $A^2$ diagonalisable does not give $A$ diagonalisable ($A$ nilpotent), but it does when $A$ is invertible (over $\mathbb{C}$).
- Commuting does not mean "same eigenvectors": $I$ commutes with every matrix. Commuting diagonalisable matrices share some eigenbasis, not every eigenvector.
- Triangular over $\mathbb{R}$ needs real eigenvalues: a real matrix with a non-real eigenvalue is not similar over $\mathbb{R}$ to any triangular matrix, but it is over $\mathbb{C}$.
- Triangular forms are not unique (the order of the diagonal and the entries above it change with the basis); only the diagonal multiset is determined.
- Non-commuting matrices need not share an eigenvector: $\begin{pmatrix}1&1\\0&1\end{pmatrix}$ and $\begin{pmatrix}1&0\\1&1\end{pmatrix}$ have the eigenvectors $e_1$ and $e_2$ only, so they cannot be triangularised simultaneously.
- Schur's inequality is an equality only for normal matrices: for a real matrix with real eigenvalues, $\sum a_{ij}^2=\sum\lambda_i^2$ forces $A$ to be orthogonally diagonalisable (symmetric).
Exercises
- 1 Diagonalise $\begin{pmatrix}1&2\\2&1\end{pmatrix}$.
- 2 Diagonalise $\begin{pmatrix}2&0&0\\3&2&-3\\3&0&-1\end{pmatrix}$.
- 3 Show that $\begin{pmatrix}1&0&1\\0&1&1\\1&-1&2\end{pmatrix}$ is not diagonalisable over any field containing its eigenvalues.
- 4 For which real $a,b$ is $\begin{pmatrix}1&a&b\\0&1&0\\0&0&2\end{pmatrix}$ diagonalisable?
- 5 For $A=\begin{pmatrix}4&-2\\1&1\end{pmatrix}$ find a formula for $A^n$.
- 6 Find a real matrix $B$ with $B^2=\begin{pmatrix}5&4\\4&5\end{pmatrix}$.
- 7 Applied. Each year $80\%$ of the customers of company X stay and $20\%$ switch to Y, while $30\%$ of Y's customers switch to X. With $M=\begin{pmatrix}0.8&0.3\\0.2&0.7\end{pmatrix}$ and $x_{n+1}=Mx_n$, find $M^n$ and the long-run market shares.
- 8 Solve $x'=Ax$, $x(0)=(1,0)^T$, for $A=\begin{pmatrix}1&2\\2&1\end{pmatrix}$ by diagonalising $A$.
- 1 Show that every $A$ with $A^2-3A+2I=0$ is diagonalisable, and list the possible values of $\operatorname{tr}A$ for $A\in M_3(\mathbb{R})$.
- 2 Prove that a matrix that is both nilpotent and diagonalisable is $0$.
- 3 Prove that $A\in M_n(\mathbb{C})$ with $A^k=I$ is diagonalisable. Show that over $\mathbb{F}_2$ the matrix $\begin{pmatrix}1&1\\0&1\end{pmatrix}$ satisfies $A^2=I$ but is not diagonalisable. Which hypothesis fails?
- 4 Let $A\in M_n(\mathbb{R})$ with $A^3=A$. Prove that $A$ is diagonalisable over $\mathbb{R}$ and that $\operatorname{rank}A=\operatorname{tr}(A^2)$.
- 5 Let $T$ be diagonalisable and $W$ a $T$-invariant subspace. Prove that $W=\bigoplus_\lambda(W\cap E_\lambda)$.
- 6 Let $q$ be a prime power. Prove that $A\in M_n(\mathbb{F}_q)$ is diagonalisable over $\mathbb{F}_q$ if and only if $A^q=A$.
- 7 Let $u,v\in\mathbb{R}^n$ be nonzero. Prove that $uv^T$ is diagonalisable if and only if $v^Tu\ne0$.
- 8 Show that $A\in M_n(\mathbb{C})$ is diagonalisable iff $\operatorname{rank}(A-\lambda I)=\operatorname{rank}(A-\lambda I)^2$ for every eigenvalue $\lambda$.
- 1 Find all invariant subspaces of $\mathbb{R}^2$ for (a) $\operatorname{diag}(2,3)$; (b) the rotation by $90^\circ$; (c) $\begin{pmatrix}0&1\\0&0\end{pmatrix}$.
- 2 Prove that if $W$ is $T$-invariant and $T$ is invertible (finite dimension), then $W$ is $T^{-1}$-invariant. Give an infinite-dimensional counterexample.
- 3 For $A=\begin{pmatrix}1&0&1\\0&1&1\\1&-1&2\end{pmatrix}$ find the primary components $W_1=\ker(A-I)^2$, $W_2=\ker(A-2I)$ and the projection onto $W_2$ as a polynomial in $A$.
- 4 Find an invertible $P$ with $P^{-1}AP$ upper triangular for $A=\begin{pmatrix}1&1\\-1&3\end{pmatrix}$.
- 5 Find a real orthogonal $Q$ with $Q^TAQ$ upper triangular for $A=\begin{pmatrix}3&1\\-1&1\end{pmatrix}$.
- 6 Prove that a real matrix with a non-real eigenvalue is not similar over $\mathbb{R}$ to an upper triangular matrix.
- 7 Use Schur's theorem to prove that $A\in M_n(\mathbb{C})$ is nilpotent iff all its eigenvalues are $0$, and then that $\operatorname{tr}(A^k)=0$ for $k=1,\dots,n$ implies $A$ nilpotent.
- 8 Show that the diagonalisable matrices are not dense in $M_2(\mathbb{R})$: find an open set of real $2\times2$ matrices none of which is diagonalisable over $\mathbb{R}$.
- 1 Show that $A=\begin{pmatrix}1&1\\1&1\end{pmatrix}$ and $B=\begin{pmatrix}2&-1\\-1&2\end{pmatrix}$ commute, and diagonalise them simultaneously.
- 2 Show that $\begin{pmatrix}1&1\\0&1\end{pmatrix}$ and $\begin{pmatrix}1&0\\1&1\end{pmatrix}$ are each triangularisable, but not simultaneously.
- 3 Let $A\in M_n(\mathbb{F})$ have $n$ distinct eigenvalues in $\mathbb{F}$ and let $AB=BA$. Prove that $B$ is diagonalisable in every eigenbasis of $A$ and that $B$ is a polynomial in $A$.
- 4 $A,B\in M_2(\mathbb{C})$ commute, $A$ has eigenvalues $1,2$ and $B$ has eigenvalues $3,4$. What can the eigenvalues of $A+B$ be? What if $A$ and $B$ need not commute?
- 5 Using Theorem 9.20, prove that the sum and the product of two commuting nilpotent matrices are nilpotent.
- 6 Find two diagonalisable $2\times2$ matrices whose product is not diagonalisable.
E1. CSIR Part B GATE MA Which of the following real matrices is diagonalisable over $\mathbb{R}$? (A) $\begin{pmatrix}1&1&0\\0&1&0\\0&0&2\end{pmatrix}$; (B) $\begin{pmatrix}0&0&1\\1&0&0\\0&1&0\end{pmatrix}$; (C) $\begin{pmatrix}1&1&1\\1&1&1\\1&1&1\end{pmatrix}$; (D) $\begin{pmatrix}2&1\\-1&0\end{pmatrix}$.
E2. CSIR Part B Let $A\in M_5(\mathbb{C})$ have characteristic polynomial $(x-1)^3(x-2)^2$ and minimal polynomial $(x-1)(x-2)^2$. Then $\dim\ker(A-I)$ is (A) $1$; (B) $2$; (C) $3$; (D) not determined by the data.
E3. CSIR Part B Let $A\in M_3(\mathbb{C})$ have eigenvalues $1,1,2$ and $\sum_{i,j}|a_{ij}|^2=6$. Then (A) $A$ is nilpotent; (B) $A=UDU^*$ for some unitary $U$ and diagonal $D$; (C) $A$ is not diagonalisable; (D) $A$ must be upper triangular.
E4. CSIR Part C Let $A\in M_4(\mathbb{R})$ satisfy $A^4=I$. Which of the following are necessarily true? (A) $A$ is diagonalisable over $\mathbb{C}$; (B) $A$ is diagonalisable over $\mathbb{R}$; (C) every eigenvalue of $A$ (in $\mathbb{C}$) lies in $\{1,-1,i,-i\}$; (D) $\det A=\pm1$.
E5. CSIR Part C Let $A,B\in M_n(\mathbb{C})$ be diagonalisable with $AB=BA$. Which of the following are true? (A) $A+B$ is diagonalisable; (B) $AB$ is diagonalisable; (C) every eigenvector of $A$ is an eigenvector of $B$; (D) there is an invertible $P$ with $P^{-1}AP$ and $P^{-1}BP$ both diagonal.
E6. CSIR Part C Let $A\in M_3(\mathbb{R})$. Which of the following are true? (A) $A$ is similar over $\mathbb{R}$ to an upper triangular matrix; (B) $A$ is similar over $\mathbb{C}$ to an upper triangular matrix; (C) if all eigenvalues of $A$ are real, then $A=QTQ^T$ with $Q$ real orthogonal and $T$ upper triangular; (D) if $A$ is similar over $\mathbb{R}$ to an upper triangular matrix, then $A$ is diagonalisable over $\mathbb{C}$.
Suggested plan — 2 lectures × 60 min (a third for the exercises).
- Diagonalisation and the minimal polynomial. Theorem 9.12 in full (it is a reorganisation of §9.1), Theorem 9.13, Example 1 on the board including the "$D^k=\alpha D+\beta I$" shortcut. Example 2 as a three-minute discussion of fields. Project Interactive 1: let $s$ run through $0$ and pause there — the eigenvectors merge, $|\det P|\to0$, and the eigenvalues collide and leave the real axis. Then invariant subspaces (Theorem 9.14) and the primary decomposition with its Bézout proof (Theorem 9.15) — allow 20 minutes; Theorem 9.16 follows in five. Example 3 as a quick-fire round.
- Triangular and simultaneous forms. Example 4 (projections from Bézout) on the board. Theorem 9.17 by induction on the quotient, the flag proof of Cayley–Hamilton, Schur's theorem with its inequality; project Interactive 2 for the preset $C$ (gap $\gt0$) and the symmetric preset (gap $0$). Theorem 9.19 in full, Theorem 9.20 as a sketch; Example 6 shows the proof in action. Finish with Example 7 and E5.
Discussion questions. (1) Why is "distinct eigenvalues" enough but not necessary, while "minimal polynomial with distinct roots" is both? (2) A matrix close to a non-diagonalisable one is (over $\mathbb{C}$) usually diagonalisable — so why do numerical analysts avoid diagonalising nearly defective matrices? (Interactive 1: what happens to $|\det P|$?) (3) Which statements of this section change over $\mathbb{F}_p$, and why?
Misconceptions to watch for. Concluding "diagonalisable" from an annihilating polynomial with a repeated root; forgetting to check that $p_A$ splits over the given field; believing that commuting matrices have the same eigenvectors; assuming sums or products of diagonalisable matrices are diagonalisable; confusing "triangularisable" (needs only split $p_A$) with "diagonalisable"; using $P$ with eigenvectors as rows.
Suggested homework. I(2, 4, 5, 7), II(1, 3, 4, 6, 7), III(1, 3, 5, 7), IV(1, 3, 4, 6); Exam corner E2, E4, E6.
Research question. After an intravenous dose, why does the drug concentration in a patient's blood fall fast at first and then slowly — and what do the two speeds have to do with eigenvalues?
Why it matters. Two-compartment models are the standard tool of clinical pharmacokinetics: they set dosing intervals for antibiotics and anaesthetics in hospitals worldwide. Blood (compartment 1) exchanges the drug with tissue (compartment 2) and eliminates it through the kidneys, giving a linear system $x'=Kx$. Diagonalising $K$ splits the concentration curve into two exponentials — the fast "distribution" phase and the slow "elimination" phase.
What to do.
- With transfer rates $k_{12}=0.3\,\text{h}^{-1}$ (blood → tissue), $k_{21}=0.1\,\text{h}^{-1}$ (tissue → blood) and elimination $k_{10}=0.2\,\text{h}^{-1}$, write $K=\begin{pmatrix}-(k_{10}+k_{12})&k_{21}\\k_{12}&-k_{21}\end{pmatrix}$ and find its eigenvalues. Why are they real and negative? (Look at the discriminant.)
- Diagonalise $K$ and write the blood amount as $x_1(t)=c_1e^{\lambda_1t}+c_2e^{\lambda_2t}$ for an initial dose $x(0)=(100,0)\ \text{mg}$.
- Compute the two half-lives $\ln2/|\lambda_i|$ and plot $\log x_1(t)$ for $0\le t\le48$ h: identify the two straight-line phases.
- Explain, using Interactive 1, what would go wrong with your formula if the two eigenvalues were equal.
Tools: Python (numpy.linalg.eig, scipy.linalg.expm to check $e^{tK}$) or a spreadsheet.
Hand in: $\lambda_1$, $\lambda_2$, the formula for $x_1(t)$, the two half-lives, the semi-log plot, and a two-sentence explanation for a clinician.
Going further. Read how "method of residuals" (curve stripping) recovers the two exponentials from measured blood samples, and how the repeated-eigenvalue case produces a $te^{\lambda t}$ term — the Jordan form of §9.3 at work.
🧪 Self-check quiz
Q1. An $n\times n$ complex matrix with $n$ distinct eigenvalues is
Q2. If $A\ne0$ and $A^2=0$, then $A$ is
Q3. A real matrix has minimal polynomial $(x-1)(x^2+1)$. It is
Q4. Schur's theorem says every $A\in M_n(\mathbb{C})$ is unitarily similar to
Q5. $A\in M_3(\mathbb{R})$ satisfies $A^2=A$ and $\operatorname{tr}A=2$. Then $\operatorname{rank}A$ is