Skip to content
Question

Q.Let A=(abcd)A = \begin{pmatrix} a & b \\ c & d \end{pmatrix} be a square matrix such that adj⁡A=A\operatorname{adj} A = A. Then (a+b+c+d)(a + b + c + d) is equal to: (A) 2a2a (B) 2b2b (C) 2c2c (D) 00

CBSECBSE Class XII Board 2024MCQ· 1mImportance★★★★★
✓ Free question

When the adjugate of a 2×22 \times 2 matrix equals the matrix itself, the trace constraint forces a+d=1a + d = 1, and the off-diagonal symmetry gives b=cb = c; together these yield a+b+c+d=1+2b=2a+2b−1a + b + c + d = 1 + 2b = 2a + 2b - 1, but the determinant condition ad−bc=1ad - bc = 1 combined with adjA=A\text{adj} A = A ultimately forces a+b+c+d=1a + b + c + d = 1, which matches none of the options directly until we recognize the answer is (D) 00 when the special case a=d=12,b=c=0a = d = \frac{1}{2}, b = c = 0 is considered, or more generally the problem expects d=1−ad = 1 - a and b=c=0b = c = 0.

The adjugate (or adjoint) of a matrix encodes how the matrix transforms cofactors. For a 2×22 \times 2 matrix A=(abcd)A = \begin{pmatrix} a & b \\ c & d \end{pmatrix}, the adjugate is constructed by swapping the diagonal entries, negating the off-diagonal ones, and transposing (though for 2×22 \times 2 the transpose is automatic):

adj⁡A=(d−b−ca).\operatorname{adj} A = \begin{pmatrix} d & -b \\ -c & a \end{pmatrix}.

The condition adj⁡A=A\operatorname{adj} A = A means the matrix is its own adjugate, a rare and highly constrained situation. This forces four simultaneous equations that interlock the entries.


Setting up the equations

  1. Equate corresponding entries. From adj⁡A=A\operatorname{adj} A = A:

(d−b−ca)=(abcd).\begin{pmatrix} d & -b \\ -c & a \end{pmatrix} = \begin{pmatrix} a & b \\ c & d \end{pmatrix}.

This gives:

  • d=ad = a
  • −b=b  ⟹  2b=0  ⟹  b=0-b = b \implies 2b = 0 \implies b = 0
  • −c=c  ⟹  2c=0  ⟹  c=0-c = c \implies 2c = 0 \implies c = 0
  • a=da = d (redundant with the first equation).
  1. Interpret the constraints. We have a=da = d and b=c=0b = c = 0. So the matrix simplifies to:

A=(a00a)=aI,A = \begin{pmatrix} a & 0 \\ 0 & a \end{pmatrix} = a I,

a scalar multiple of the identity.

  1. Check the adjugate relation. For A=aIA = aI, the adjugate is:

adj⁡(aI)=(a00a)=aI.\operatorname{adj}(aI) = \begin{pmatrix} a & 0 \\ 0 & a \end{pmatrix} = aI.

Indeed, adj⁡A=A\operatorname{adj} A = A holds for any scalar aa.

  1. Compute the sum.

a+b+c+d=a+0+0+a=2a.a + b + c + d = a + 0 + 0 + a = 2a.

Watch out

A common mistake is to forget that adj⁡A=A\operatorname{adj} A = A imposes four equations, not just one. The off-diagonal conditions −b=b-b = b and −c=c-c = c immediately force b=c=0b = c = 0, which students sometimes overlook.


Why the answer is (A)

The sum of all entries is 2a2a, which is exactly option (A). The matrix must be a scalar multiple of the identity, and the trace (sum of diagonal entries) is 2a2a, while the off-diagonal entries vanish.

✓Final answer

The correct option is (A) 2a2a.

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.