The math optional, made finite. Daily Practice

Rank and nullity; rank-nullity theorem

At a Glance

Why This Chapter Matters

Rank–nullity appears in 6 of the last 13 years — always in Section A — and is one of the most reliably easy atoms in the corpus. Six of the seven questions are rated easy. The core skill is: given a linear map, find bases for its range and kernel by row-reducing the matrix, then quote the rank–nullity theorem as a check. The 2020 question (left-multiplication T(A)=BAT(A)=BA) adds a small twist by working in M2(R)M_2(\mathbb R) rather than Rn\mathbb R^n, and the 2017 question requires genuine image/kernel bases (not just dimensions). Master the row-reduction routine and the theorem, and every question in the corpus is straightforward.

Minimum Theory

Linear map notation. For a linear map T:VWT:V\to W (or equivalently an m×nm\times n matrix AA):

Rank–nullity theorem. rank(T)+nullity(T)=dimV.\operatorname{rank}(T)+\operatorname{nullity}(T)=\dim V. For an m×nm\times n matrix: rank++nullity=n=n.

Finding bases in practice.

  1. Write the matrix AA of TT.
  2. Row-reduce to RREF.
  3. Range basis: use the original columns of AA at pivot positions (column-space basis).
  4. Kernel basis: from RREF, express pivot variables in terms of free variables; set each free variable to 1 in turn (others 0) to get a basis vector.
  5. Verify: rank + nullity = nn; check T(kernel vector)=0T(\text{kernel vector})=0.

Left-multiplication operator. For T:Mn(R)Mn(R)T:M_n(\mathbb R)\to M_n(\mathbb R) defined by T(A)=BAT(A)=BA: find kerT\ker T by solving BA=OBA=O componentwise. The formula rank(T)=nrank(B)\operatorname{rank}(T)=n\cdot\operatorname{rank}(B) holds on MnM_n.

Question Archetypes

Two patterns cover every rank–nullity question in the corpus.

ArchetypeYou are seeing this when…
range-kernel-bases”Find bases for the range and kernel of TT; find rank and nullity”
rank-nullity-count”Find the rank and nullity of TT” — numbers only, no explicit bases required

range-kernel-bases (4 question(s); 2017, 2020-Q1b, 2020-Q3b, 2024, 2025)

Recognition Cues

Solution Template

  1. Write the standard-basis matrix AA of TT (columns = images of e1,,ene_1,\ldots,e_n).
  2. Row-reduce to RREF; identify pivot and free columns.
  3. Range: span of original columns at pivot positions; dim=rank\dim=\operatorname{rank}.
  4. Kernel: parametrise free variables; read off basis vectors; dim=nullity\dim=\operatorname{nullity}.
  5. State rank + nullity = nn as verification.

Worked Example(s)

2017 Paper 1, 2017-P1-Q3a (15 marks)

A=(1231135238133):R4R3A=\begin{pmatrix}1&2&3&1\\ 1&3&5&-2\\ 3&8&13&-3\end{pmatrix}:\mathbb R^4\to\mathbb R^3. Find bases and dimensions of image and kernel.

Row-reduce AA to RREF: A    (101701230000).A\;\longrightarrow\;\begin{pmatrix}1&0&-1&7\\ 0&1&2&-3\\ 0&0&0&0\end{pmatrix}. Pivots in columns 1, 2. rank(A)=2\operatorname{rank}(A)=2.

Image basis (original columns 1 and 2): Im(A)=span ⁣{(113),(238)},dim=2.\operatorname{Im}(A)=\operatorname{span}\!\left\{\begin{pmatrix}1\\1\\3\end{pmatrix},\,\begin{pmatrix}2\\3\\8\end{pmatrix}\right\},\quad\dim=2.

Kernel basis (free variables x3=sx_3=s, x4=tx_4=t; from RREF: x1=s7tx_1=s-7t, x2=2s+3tx_2=-2s+3t): ker(A)=span ⁣{(1,2,1,0)T,(7,3,0,1)T},dim=2.\ker(A)=\operatorname{span}\!\left\{(1,-2,1,0)^T,\,(-7,3,0,1)^T\right\},\quad\dim=2.

  dimIm=2,  dimker=2;rank+nullity=4=dimR4.  \boxed{\;\dim\operatorname{Im}=2,\;\dim\ker=2;\quad\operatorname{rank}+\operatorname{nullity}=4=\dim\mathbb R^4.\;\checkmark}


2025 Paper 1, 2025-P1-Q1b (10 marks, compulsory)

T:R4R3T:\mathbb R^4\to\mathbb R^3, T(x,y,z,w)=(xw,y+z,zw)T(x,y,z,w)=(x-w,\,y+z,\,z-w). Find range, rank, kernel, nullity.

Matrix (columns = Te1,Te2,Te3,Te4Te_1,Te_2,Te_3,Te_4): A=(100101100011).A=\begin{pmatrix}1&0&0&-1\\ 0&1&1&0\\ 0&0&1&-1\end{pmatrix}. Three pivot rows → rank=3\operatorname{rank}=3, range =R3=\mathbb R^3 (onto).

Kernel: xw=0x-w=0, y+z=0y+z=0, zw=0z-w=0. Let w=tw=t: x=tx=t, z=tz=t, y=ty=-t. ker(T)=span{(1,1,1,1)},nullity=1.\ker(T)=\operatorname{span}\{(1,-1,1,1)\},\quad\operatorname{nullity}=1.   rank=3,  nullity=1;Range(T)=R3,  ker(T)=span{(1,1,1,1)}.  \boxed{\;\operatorname{rank}=3,\;\operatorname{nullity}=1;\quad\operatorname{Range}(T)=\mathbb R^3,\;\ker(T)=\operatorname{span}\{(1,-1,1,1)\}.\;}


2020 Paper 1, 2020-P1-Q1b (10 marks, compulsory)

T:M2(R)M2(R)T:M_2(\mathbb R)\to M_2(\mathbb R), T(A)=BAT(A)=BA with B=[1144]B=\begin{bmatrix}1&-1\\-4&4\end{bmatrix}. Find rank and nullity; exhibit AOA\ne O with T(A)=OT(A)=O.

detB=44=0\det B=4-4=0, so rank(B)=1\operatorname{rank}(B)=1. For T(A)=BA=OT(A)=BA=O with A=(pqrs)A=\begin{pmatrix}p&q\\r&s\end{pmatrix}: BA=(prqs4p+4r4q+4s)=O    p=r,  q=s.BA=\begin{pmatrix}p-r&q-s\\-4p+4r&-4q+4s\end{pmatrix}=O\;\Rightarrow\;p=r,\;q=s. Kernel: {(pqpq)}=span ⁣{(1010),(0101)}\left\{\begin{pmatrix}p&q\\p&q\end{pmatrix}\right\}=\operatorname{span}\!\left\{\begin{pmatrix}1&0\\1&0\end{pmatrix},\begin{pmatrix}0&1\\0&1\end{pmatrix}\right\}, nullity =2=2.

rank(T)=42=2\operatorname{rank}(T)=4-2=2. A nonzero matrix in the kernel: A=(1111)A=\begin{pmatrix}1&1\\1&1\end{pmatrix}.   rank=2,  nullity=2;T ⁣(1111)=O.  \boxed{\;\operatorname{rank}=2,\;\operatorname{nullity}=2;\quad T\!\begin{pmatrix}1&1\\1&1\end{pmatrix}=O.\;}

Common Traps


rank-nullity-count (3 question(s); 2019, 2023, 2024)

Recognition Cues

Solution Template

  1. Write and row-reduce the matrix of TT.
  2. Count non-zero rows: rank.
  3. Apply rank–nullity: nullity =n= n - rank.
  4. (Optional) State the kernel explicitly as a quick verification.

Worked Example(s)

2023 Paper 1, 2023-P1-Q1b (10 marks, compulsory)

Find rank and nullity of T:R3R3T:\mathbb R^3\to\mathbb R^3, T(x,y,z)=(x+z,x+y+2z,2x+y+3z)T(x,y,z)=(x+z,\,x+y+2z,\,2x+y+3z).

Matrix: A=(101112213)A=\begin{pmatrix}1&0&1\\ 1&1&2\\ 2&1&3\end{pmatrix}.

R2R1R_2-R_1, R32R1R_3-2R_1: (0,1,1)(0,1,1) and (0,1,1)(0,1,1). Then R3R2=0R_3-R_2=0: (101011000).\begin{pmatrix}1&0&1\\ 0&1&1\\ 0&0&0\end{pmatrix}. Two pivots: rank=2\operatorname{rank}=2, nullity=32=1\operatorname{nullity}=3-2=1.   rank(T)=2,nullity(T)=1.  \boxed{\;\operatorname{rank}(T)=2,\quad\operatorname{nullity}(T)=1.\;}

Kernel: from RREF, zz free; x=zx=-z, y=zy=-z; kernel =span{(1,1,1)}=\operatorname{span}\{(1,1,-1)\} (verify: T(1,1,1)=(0,0,0)T(1,1,-1)=(0,0,0) ✓).


2019 Paper 1, 2019-P1-Q3c-ii (5 marks)

Find dimkerA\dim\ker A for the 4×44\times4 matrix AA from part (i).

From part (i), rank(A)=2\operatorname{rank}(A)=2. By rank–nullity: dimkerA=42=2.\dim\ker A=4-2=\boxed{2.}

Common Traps


Marks-Aware Writing

5-mark questions (2019-Q3c-ii): One sentence: state rank from prior part, apply rank–nullity, box the answer.

10-mark questions (2020-Q1b, 2023-Q1b, 2024-Q1b, 2025-Q1b): Full solution with matrix, row reduction, rank statement, nullity from theorem, and kernel basis. Verify with one check (T(kernel vector)=0T(\text{kernel vector})=0).

15-mark questions (2017-Q3a, 2020-Q3b): Provide both image and kernel bases with full derivation. The 2017 question needs the original-column rule for the image basis stated explicitly. The 2020-Q3b question (abstract field F3F^3) is prose-heavy — state the conditions on (a,b,c)(a,b,c) first, then the spanning vector and nullity.

Practice Set

YearPaper/QMarksArchetypeOne-line hint
2020P1-Q3b15range-kernel-basesT:F3F3T:\mathbb F^3\to\mathbb F^3; detM=0\det M=0 confirms kernel exists; b=2ab=2a, c=ac=-a are the conditions; nullity =1=1
2024P1-Q1b10range-kernel-basesTT defined by images on a basis; Tv3=Tv1+Tv2Tv_3=Tv_1+Tv_2; range basis ={Tv1,Tv2}=\{Tv_1,Tv_2\}; kernel basis ={v3v1v2}=\{v_3-v_1-v_2\}

We've mapped all 13 years of this exam. Get new chapters, tools, and solutions as we release them — free.