← 2026 Paper 1

UPSC 2026 Maths Optional Paper 1 Q1a — Step-by-Step Solution

10 marks · Section A

Solution of system of linear equations · Linear Algebra · asked 8× in 14 yrs · Read the full method →

Question

Find all the values of aa for which the system of homogeneous equations

ax+y+z=0,x+y−z=0,x+y−az=0ax + y + z = 0,\qquad x + y - z = 0,\qquad x + y - az = 0

has non-trivial solutions, and hence determine all the solutions for each value of aa.

Technique

A homogeneous square system Ax=0A\mathbf{x}=\mathbf{0} has a non-trivial solution iff det⁡A=0\det A = 0 (equivalently rank⁡A<n\operatorname{rank}A < n). Compute det⁡A\det A as a polynomial in aa, solve det⁡A=0\det A=0, then for each root reduce the system and read off the null space with its free parameter.

Solution

Step 1 — Write the coefficient matrix and state the criterion.

A=(a1111−111−a),A(xyz)=(000).A=\begin{pmatrix}a & 1 & 1\\ 1 & 1 & -1\\ 1 & 1 & -a\end{pmatrix},\qquad A\begin{pmatrix}x\\y\\z\end{pmatrix}=\begin{pmatrix}0\\0\\0\end{pmatrix}.

The system is homogeneous with as many equations as unknowns, so x=0\mathbf{x}=\mathbf 0 is always a solution. A non-trivial solution exists if and only if AA is singular:

det⁡A=0.\det A = 0.

Step 2 — Evaluate det⁡A\det A.

Expand along the first row:

det⁡A=a∣1−11−a∣−1∣1−11−a∣+1∣1111∣.\det A = a\begin{vmatrix}1 & -1\\ 1 & -a\end{vmatrix} - 1\begin{vmatrix}1 & -1\\ 1 & -a\end{vmatrix} + 1\begin{vmatrix}1 & 1\\ 1 & 1\end{vmatrix}.

Now ∣1−11−a∣=−a+1=1−a\begin{vmatrix}1 & -1\\ 1 & -a\end{vmatrix} = -a+1 = 1-a and ∣1111∣=0\begin{vmatrix}1 & 1\\ 1 & 1\end{vmatrix}=0. Hence

det⁡A=a(1−a)−(1−a)+0=(1−a)(a−1)=−(a−1)2.\det A = a(1-a) - (1-a) + 0 = (1-a)(a-1) = -(a-1)^2.

(Cross-check by row reduction: R2→R2−R3R_2 \to R_2-R_3 turns the second row into (0, 0, a−1)(0,\,0,\,a-1), and expanding along it gives det⁡A=(a−1)⋅(−1)2+3∣a111∣=−(a−1)(a−1)=−(a−1)2\det A = (a-1)\cdot(-1)^{2+3}\begin{vmatrix}a&1\\1&1\end{vmatrix} = -(a-1)(a-1) = -(a-1)^2. ✓)

Step 3 — Solve det⁡A=0\det A = 0.

−(a−1)2=0  ⟺  a=1.-(a-1)^2 = 0 \iff a = 1.

The determinant is a perfect square, so a=1a=1 is a repeated root and it is the only value of aa; there is no second value to hunt for. For every a≠1a \neq 1 we have det⁡A=−(a−1)2≠0\det A = -(a-1)^2 \neq 0, so AA is invertible and the only solution is the trivial one x=y=z=0x=y=z=0.

Step 4 — Confirm Step 3 without determinants (elimination check).

Subtracting the third equation from the second:

(x+y−z)−(x+y−az)=(a−1)z=0.(x+y-z)-(x+y-az) = (a-1)z = 0.

This independently confirms a=1a=1 is the unique value.

Step 5 — The complete solution set at a=1a=1.

Put a=1a=1. The system becomes

x+y+z=0,x+y−z=0,x+y−z=0.x+y+z=0,\qquad x+y-z=0,\qquad x+y-z=0.

Equations (2) and (3) are identical, so effectively two equations remain. Adding (1) and (2): 2(x+y)=02(x+y)=0; subtracting (2) from (1): 2z=02z=0. Hence

z=0,y=−x.z=0,\qquad y=-x.

The coefficient matrix at a=1a=1 is (11111−111−1)\begin{pmatrix}1&1&1\\1&1&-1\\1&1&-1\end{pmatrix}, which row-reduces to (110001000)\begin{pmatrix}1&1&0\\0&0&1\\0&0&0\end{pmatrix}: rank⁡=2\operatorname{rank}=2, so by rank–nullity the null space has dimension 3−2=13-2=1 — a one-parameter family, as found.

Taking x=tx=t as the free parameter,

(x,y,z)=(t, −t, 0)=t (1,−1,0),t∈R.(x,y,z) = (t,\,-t,\,0) = t\,(1,-1,0),\qquad t\in\mathbb{R}.

So the solution space is the line span⁡{(1,−1,0)}\operatorname{span}\{(1,-1,0)\}; t≠0t\neq 0 gives the non-trivial solutions.

Verification by substitution (a=1a=1): x+y+z=t−t+0=0x+y+z = t-t+0 = 0 ✓; x+y−z=t−t−0=0x+y-z = t-t-0 = 0 ✓; third equation same as second ✓.

Answer

  a=1 is the only value. For a=1: (x,y,z)=t(1,−1,0), t∈R;for every a≠1: (x,y,z)=(0,0,0) only.  \boxed{\;a=1 \text{ is the only value. For } a=1:\ (x,y,z)=t(1,-1,0),\ t\in\mathbb{R};\quad \text{for every } a\neq 1:\ (x,y,z)=(0,0,0)\ \text{only.}\;}
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.