Frequency: 7 sub-parts across 6 of 13 years (2017, 2019, 2020, 2023, 2024, 2025)
Priority tier: T2
Marks (count): 5 (1), 10 (4), 15 (2)
Average solve time: ~7 min
Difficulty mix: easy 6, medium 1
Section: A | Dominant type: computation
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)=BA) adds a small twist by working in M2(R) rather than Rn, 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:V→W (or equivalently an m×n matrix A):
The kernel (null space) is kerT={v∈V:Tv=0}, a subspace of V.
The range (image, column space) is ImT={Tv:v∈V}, a subspace of W.
Rank=dimImT= number of non-zero rows in REF of A= number of pivot columns.
Nullity=dimkerT= number of free variables =n−rankA.
Rank–nullity theorem.rank(T)+nullity(T)=dimV.
For an m×n matrix: rank+nullity=n.
Finding bases in practice.
Write the matrix A of T.
Row-reduce to RREF.
Range basis: use the original columns of A at pivot positions (column-space basis).
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.
Left-multiplication operator. For T:Mn(R)→Mn(R) defined by T(A)=BA: find kerT by solving BA=O componentwise. The formula rank(T)=n⋅rank(B) holds on Mn.
Question Archetypes
Two patterns cover every rank–nullity question in the corpus.
“Find the rank and nullity of T” with no request for explicit bases.
Often a follow-up to a previous part (where the rank was already computed).
Or: “find the dimension of the null space” as a standalone 5-mark item.
Solution Template
Write and row-reduce the matrix of T.
Count non-zero rows: rank.
Apply rank–nullity: nullity =n− rank.
(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:R3→R3, T(x,y,z)=(x+z,x+y+2z,2x+y+3z).
Matrix: A=112011123.
R2−R1, R3−2R1: (0,1,1) and (0,1,1). Then R3−R2=0:
100010110.
Two pivots: rank=2, nullity=3−2=1.
rank(T)=2,nullity(T)=1.
Kernel: from RREF, z free; x=−z, y=−z; kernel =span{(1,1,−1)} (verify: T(1,1,−1)=(0,0,0) ✓).
2019 Paper 1, 2019-P1-Q3c-ii (5 marks)
Find dimkerA for the 4×4 matrix A from part (i).
From part (i), rank(A)=2. By rank–nullity:
dimkerA=4−2=2.
Common Traps
The rank–nullity theorem says nullity =dimV (domain) − rank, not dimW− rank. For a non-square map, use the domain dimension.
For follow-up parts: read the rank from the earlier part — don’t recompute.
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)=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 F3) is prose-heavy — state the conditions on (a,b,c) first, then the spanning vector and nullity.
Practice Set
Year
Paper/Q
Marks
Archetype
One-line hint
2020
P1-Q3b
15
range-kernel-bases
T:F3→F3; detM=0 confirms kernel exists; b=2a, c=−a are the conditions; nullity =1
2024
P1-Q1b
10
range-kernel-bases
T defined by images on a basis; Tv3=Tv1+Tv2; range basis ={Tv1,Tv2}; kernel basis ={v3−v1−v2}
We've mapped all 13 years of this exam. Get new chapters, tools, and solutions as we release them — free.