← 2026 Paper 1

UPSC 2026 Maths Optional Paper 1 Q4a-i — Step-by-Step Solution

8 marks · Section A

Rank and nullity; rank-nullity theorem · Linear Algebra · asked 9× in 14 yrs · Read the full method →

Question

Let FF be a subfield of complex numbers and let TT be the linear transformation from F3F^3 into F3F^3, defined by

T(x,y,z)=(x−y+2z,  2x+y,  −x−2y+2z).T(x, y, z) = (x - y + 2z,\; 2x + y,\; -x - 2y + 2z).

If (a,b,c)(a, b, c) is a vector in F3F^3, then answer the following:

Find the condition on a,b,ca, b, c such that the vector (a,b,c)(a, b, c) be in the null space of TT. What is the nullity of TT?

Technique

Write TT as a matrix AA in the standard basis; membership of the null space is the homogeneous system A(a,b,c)T=0A(a,b,c)^{T}=0. Row-reduce once — the rref simultaneously delivers the explicit condition on a,b,ca,b,c and the nullity 3−rank⁡A3-\operatorname{rank}A. Because AA has integer entries, the reduction is valid over every subfield F⊆CF\subseteq\mathbb{C}.

Solution

Step 1 — Matrix of TT in the standard basis.

With B={e1,e2,e3}\mathcal{B}=\{e_1,e_2,e_3\} the standard ordered basis of F3F^3,

T(e1)=(1,2,−1),T(e2)=(−1,1,−2),T(e3)=(2,0,2),T(e_1)=(1,2,-1),\qquad T(e_2)=(-1,1,-2),\qquad T(e_3)=(2,0,2),

so, writing the images as columns,

A=[T]B=(1−12210−1−22),T ⁣(xyz)=A(xyz).A=[T]_{\mathcal B}=\begin{pmatrix}1 & -1 & 2\\ 2 & 1 & 0\\ -1 & -2 & 2\end{pmatrix},\qquad T\!\begin{pmatrix}x\\y\\z\end{pmatrix}=A\begin{pmatrix}x\\y\\z\end{pmatrix}.

Step 2 — Set up the defining condition.

By definition

(a,b,c)∈N(T)  ⟺  T(a,b,c)=(0,0,0),(a,b,c)\in N(T)\iff T(a,b,c)=(0,0,0),

that is, the homogeneous system

a−b+2c=0⋯(1)2a+b+2c=0⋯(2)−a−2b+2c=0⋯(3)\begin{aligned} a - b + 2c &= 0 &&\cdots(1)\\ 2a + b\phantom{{}+2c} &= 0 &&\cdots(2)\\ -a - 2b + 2c &= 0 &&\cdots(3) \end{aligned}

Step 3 — Row-reduce the coefficient matrix.

A=(1−12210−1−22)→  R3→R3+R1    R2→R2−2R1  (1−1203−40−34)→  R3→R3+R2  (1−1203−4000).A=\begin{pmatrix}1 & -1 & 2\\ 2 & 1 & 0\\ -1 & -2 & 2\end{pmatrix} \xrightarrow[\;R_3\to R_3+R_1\;]{\;R_2\to R_2-2R_1\;} \begin{pmatrix}1 & -1 & 2\\ 0 & 3 & -4\\ 0 & -3 & 4\end{pmatrix} \xrightarrow{\;R_3\to R_3+R_2\;} \begin{pmatrix}1 & -1 & 2\\ 0 & 3 & -4\\ 0 & 0 & 0\end{pmatrix}.

Continuing to reduced form (R2→13R2R_2\to\frac13 R_2, then R1→R1+R2R_1\to R_1+R_2):

rref⁡(A)=(102301−43000).\operatorname{rref}(A)=\begin{pmatrix}1 & 0 & \tfrac{2}{3}\\[2pt] 0 & 1 & -\tfrac{4}{3}\\[2pt] 0 & 0 & 0\end{pmatrix}.

There are two non-zero rows, so

rank⁡T=rank⁡A=2.\operatorname{rank} T=\operatorname{rank} A = 2 .

(Consistency check on the determinant: det⁡A=1(1⋅2−0⋅(−2))+1(2⋅2−0⋅(−1))+2(2⋅(−2)−1⋅(−1))=2+4−6=0\det A = 1(1\cdot2-0\cdot(-2))+1(2\cdot2-0\cdot(-1))+2(2\cdot(-2)-1\cdot(-1)) = 2+4-6 = 0, so AA is singular and rank⁡A≤2\operatorname{rank}A\le 2; rows 1,21,2 are non-proportional, so rank⁡A=2\operatorname{rank}A=2 exactly.)

Step 4 — Read off the condition on a,b,ca,b,c.

The rref gives a+23c=0a+\frac23 c=0 and b−43c=0b-\frac43 c=0, i.e.

3a+2c=0,3b−4c=0.3a+2c=0,\qquad 3b-4c=0 .

Equivalently — and this is the tidier pair to quote, because it uses the given equations untouched — work directly from (1),(2),(3)(1),(2),(3). From (2)(2): b=−2ab=-2a. Substituting in (1)(1): a+2a+2c=0a+2a+2c=0, i.e. 3a+2c=03a+2c=0. Equation (3)(3) then reads −a−2(−2a)+2c=3a+2c=0-a-2(-2a)+2c=3a+2c=0, which is the same equation — so (3)(3) carries no new information.

The dependence is exact and worth recording: with R1=(1,−1,2)R_1=(1,-1,2), R2=(2,1,0)R_2=(2,1,0), R3=(−1,−2,2)R_3=(-1,-2,2),

R1−R2=(1−2, −1−1, 2−0)=(−1,−2,2)=R3,R_1-R_2=(1-2,\,-1-1,\,2-0)=(-1,-2,2)=R_3 ,

so R3=R1−R2R_3=R_1-R_2: the third equation is the first minus the second. Exactly one of the three equations is dependent, confirming rank⁡A=2\operatorname{rank}A=2.

Hence the condition is the pair of equations

 2a+b=0and3a+2c=0 \boxed{\,2a+b=0\quad\text{and}\quad 3a+2c=0\,}

equivalently, in proportional (symmetric) form,

a2=b−4=c−3.\frac{a}{2}=\frac{b}{-4}=\frac{c}{-3}.

Step 5 — The null space and the nullity.

One variable is free (nullity =3−rank⁡=1=3-\operatorname{rank}=1). Put a=2ta=2t; then b=−2a=−4tb=-2a=-4t and c=−32a=−3tc=-\tfrac32 a=-3t, so

(a,b,c)=t (2, −4, −3),t∈F.(a,b,c)=t\,(2,\,-4,\,-3),\qquad t\in F .

Hence

N(T)={ t(2,−4,−3)  :  t∈F }=span⁡F{(2,−4,−3)},N(T)=\{\,t(2,-4,-3)\;:\;t\in F\,\}=\operatorname{span}_F\{(2,-4,-3)\},

a one-dimensional subspace (the spanning vector is non-zero, so it is a basis), and

nullity(T)=dim⁡N(T)=1.\text{nullity}(T)=\dim N(T)=1 .

Direct check on the basis vector:

T(2,−4,−3)=(2−(−4)+2(−3),    2(2)+(−4),    −2−2(−4)+2(−3))=(2+4−6,  4−4,  −2+8−6)=(0,0,0). ✓T(2,-4,-3)=\big(2-(-4)+2(-3),\;\;2(2)+(-4),\;\;-2-2(-4)+2(-3)\big)=(2+4-6,\;4-4,\;-2+8-6)=(0,0,0).\ \checkmark

Step 6 — Rank–nullity cross-check, and independence of the field.

rank⁡T+nullity T=2+1=3=dim⁡FF3. ✓\operatorname{rank}T+\text{nullity}\,T = 2+1 = 3 = \dim_F F^3 .\ \checkmark

Finally, note that AA has integer entries and the entire row reduction used only the rational scalars −2, 1, 13-2,\,1,\,\frac13. Any subfield FF of C\mathbb{C} has characteristic 00 and therefore contains Q\mathbb{Q}; so all these operations are legitimate in FF, and the rref — hence the rank, the nullity, and the condition on a,b,ca,b,c — is the same for every subfield F⊆CF\subseteq\mathbb{C}. The answer does not depend on the choice of FF.

Answer

  (a,b,c)∈N(T)  ⟺  2a+b=0  and  3a+2c=0(i.e. a2=b−4=c−3);N(T)=span⁡F{(2,−4,−3)},nullity(T)=1.  \boxed{\;(a,b,c)\in N(T)\iff 2a+b=0\ \text{ and }\ 3a+2c=0\quad\Big(\text{i.e. }\tfrac{a}{2}=\tfrac{b}{-4}=\tfrac{c}{-3}\Big);\quad N(T)=\operatorname{span}_F\{(2,-4,-3)\},\quad \text{nullity}(T)=1.\;}
We post more of this — worked solutions, CSAT trap breakdowns, guide chapters — a few times a week on Telegram. Free, no sign-in. Join

This solution is part of the Maths Coverage Map — 14 years, mapped. Get the take-away PDF free.