When det(A)=0 the system has a unique solution; when det(A)=0 we must compare the ranks of A and the augmented matrix [A∣B] to decide between “no solution” and “infinitely many solutions”.
Next, express row (3) of [A∣B] as a linear combination of rows (1) and (2).
Take numbers p,q so that
p(1,2,1)+q(1,0,α)=(2,−3,β)
Equating components gives
p+q=2,2p=−3⟹p=−23,q=27
With this z-coefficient becomes
p⋅1+q⋅α=−23+27α=β
which is exactly condition (4). The corresponding constant term is
p⋅7+q⋅11=−23⋅7+27⋅11=−221+277=28
Hence, when (4) holds:
• If γ=28, row (3) is a linear combination of rows (1) and (2) ⇒ ranks are equal (both 2 < 3) ⇒ infinitely many solutions.
• If γ=28, the augmented matrix has rank 3 while rank(A)=2⇒ no solution.
Now fix α=1 as given in cases (R) and (S). From (4) we get the special value
2β=7(1)−3⟹β=2
Therefore, for α=1:
det(A)=7(1)−2β−3=4−2β
If β=2 then det(A)=0, so the system has a unique solution irrespective of γ. In particular, substituting α=1 and solving quickly:
From (2): x=11−z. Substituting into (1): 11−z+2y+z=7⇒y=−2.
Using (3): 2(11−z)−3(−2)+βz=γ gives 28+(β−2)z=γ.
• For γ=28 we can take z=0, leading to the specific solution x=11,y=−2,z=0 (unique because β=2 keeps det(A)=0).
• For γ=28, solving z=β−2γ−28 yields a single real triple, again a unique solution.
We are now ready to match.
Case P: β=21(7α−3),γ=28⇒det(A)=0 and ranks equal ⇒ infinitely many solutions ⇒ List-II (3).
Case Q: β=21(7α−3),γ=28⇒det(A)=0 but ranks unequal ⇒ no solution ⇒ List-II (2).
Case R: α=1,β=2,γ=28⇒det(A)=0⇒ unique solution ⇒ List-II (1).
Case S: α=1,β=2,γ=28 gives the concrete solution x=11,y=−2,z=0 (and the solution is unique) ⇒ List-II (4).
The only option that lists these four pairings is:
Option A which is: (P) → (3), (Q) → (2), (R) → (1), (S) → (4).
Tagged Systems of linear equations. Machine-assigned, so read it as a strong shortlist rather than a verdict.