SOLVER7 Study. Nothing Else.
2024 Board Paper Q3

Let \(A=\left[\begin{array}\text a&b\\ c&d\end{array}\right]\) be a square matrix such that adj \(A = A.\) Then, \((a + b + c + d)\) is equal to : (A)\(2a\) (B)\(2b\) (C)\(2c\) (D)\(0\)

CBSE Class 12 Maths · Determinants

Solution

👶 Simple Explanation

Simple Explanation

Imagine a magic mirror that flips a matrix into its adjoint. For a 2x2 matrix, the adjoint swaps the corner-to-corner entries and flips the signs of the other two. When the matrix equals its own adjoint, it is like a person who looks exactly the same in the mirror. Matching each spot forces the off-diagonal entries to become zero and the two diagonal entries to be equal. So the sum of all four entries collapses to twice the top-left entry.

Answer: \( a + b + c + d = 2a \), so the correct option is (A).

📖 Adjoint of a 2x2 Matrix equals the Matrix Itself

Detailed Explanation

For a square matrix, the adjoint (adjugate) is the transpose of the cofactor matrix. For a 2x2 matrix \( A = \begin{bmatrix} a & b \\ c & d \end{bmatrix} \), there is a very quick rule: swap the diagonal entries \( a \) and \( d \), and change the sign of the off-diagonal entries \( b \) and \( c \). This gives \( \text{adj}(A) = \begin{bmatrix} d & -b \\ -c & a \end{bmatrix} \). In this problem we are told that \( \text{adj}(A) = A \). Two matrices are equal only when all their corresponding entries are equal, so we compare each position and solve for the relations between \( a, b, c, d \).

Formula Used

For \( A = \begin{bmatrix} a & b \\ c & d \end{bmatrix} \), \[ \text{adj}(A) = \begin{bmatrix} d & -b \\ -c & a \end{bmatrix} \]

Solution

  1. Step 1: Write down the adjoint of the given matrix using the 2x2 rule (swap diagonal entries, negate off-diagonal entries): \[ \text{adj}(A) = \begin{bmatrix} d & -b \\ -c & a \end{bmatrix} \]
  2. Step 2: Apply the given condition \( \text{adj}(A) = A \). This means: \[ \begin{bmatrix} d & -b \\ -c & a \end{bmatrix} = \begin{bmatrix} a & b \\ c & d \end{bmatrix} \]
  3. Step 3: Two matrices are equal only if corresponding entries match. Comparing each position gives four equations: \[ d = a, \quad -b = b, \quad -c = c, \quad a = d \]
  4. Step 4: Solve the equations. From \( -b = b \) we get \( 2b = 0 \), so \( b = 0 \). From \( -c = c \) we get \( 2c = 0 \), so \( c = 0 \). Also \( a = d \).
  5. Step 5: Substitute these results into \( a + b + c + d \): \[ a + b + c + d = a + 0 + 0 + d \] Since \( a = d \), this becomes \[ a + d = a + a = 2a \]

Final Answer

\( a + b + c + d = 2a \), so the correct option is (A).

Common Mistake

A common mistake is forgetting to negate the off-diagonal entries when writing the adjoint. Students sometimes write \( \text{adj}(A) = \begin{bmatrix} d & b \\ c & a \end{bmatrix} \), which is wrong; the correct adjoint is \( \begin{bmatrix} d & -b \\ -c & a \end{bmatrix} \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write down \( \text{adj}(A) \) using the 2×2 shortcut: swap the diagonal entries and negate the off-diagonal entries. \[ \text{adj}(A) = \begin{bmatrix} d & -b \\ -c & a \end{bmatrix} \] — Reason: This shortcut avoids computing all cofactors individually and directly gives the adjoint of any 2×2 matrix.
  2. Step 2: Apply the given condition \( \text{adj}(A) = A \) by setting the two matrices equal: \[ \begin{bmatrix} d & -b \\ -c & a \end{bmatrix} = \begin{bmatrix} a & b \\ c & d \end{bmatrix} \] — Reason: The problem states this condition, so substituting both sides makes the constraint explicit and ready to analyse.
  3. Step 3: Compare each corresponding entry to build four individual equations. Position (1,1): \( d = a \). Position (1,2): \( -b = b \). Position (2,1): \( -c = c \). Position (2,2): \( a = d \). — Reason: Two matrices are equal if and only if every pair of corresponding entries is equal, so this step converts one matrix equation into four scalar equations.
  4. Step 4: Solve the equation \( -b = b \). Adding \( b \) to both sides gives \( 2b = 0 \), so \( b = 0 \). — Reason: Isolating \( b \) shows that the off-diagonal entry in the first row must be zero for the condition to hold.
  5. Step 5: Solve the equation \( -c = c \). Adding \( c \) to both sides gives \( 2c = 0 \), so \( c = 0 \). — Reason: By the same logic, the off-diagonal entry in the second row is also forced to be zero.
  6. Step 6: From the diagonal equations \( d = a \) and \( a = d \), conclude that \( d = a \). — Reason: Both equations say the same thing: the two diagonal entries must be equal to each other.
  7. Step 7: Substitute \( b = 0 \), \( c = 0 \), and \( d = a \) into the expression \( a + b + c + d \): \[ a + b + c + d = a + 0 + 0 + a = 2a \] — Reason: Replacing every variable with its determined value collapses the sum to a single expression in \( a \).

Final Answer

\( a + b + c + d = 2a \), so the correct option is (A).

Common Mistake

One common mistake: students forget to negate the off-diagonal entries when writing the adjoint of a 2×2 matrix, writing \( \begin{bmatrix} d & b \\ c & a \end{bmatrix} \) instead of \( \begin{bmatrix} d & -b \\ -c & a \end{bmatrix} \), which leads to incorrect equations when comparing entries.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Set \( \text{adj}(A) = A \): \[ \begin{bmatrix} d & -b \\ -c & a \end{bmatrix} = \begin{bmatrix} a & b \\ c & d \end{bmatrix} \]
  2. Step 2: Compare entries: \( d = a \), \( -b = b \Rightarrow b = 0 \), \( -c = c \Rightarrow c = 0 \)
  3. Step 3: \( a + b + c + d = a + 0 + 0 + a = 2a \)

Answer: \( a + b + c + d = 2a \), so the correct option is (A).

➕ More Examples

More Examples

Example 1

Question: Let \( B = \begin{bmatrix} p & q \\ r & s \end{bmatrix} \) be a square matrix such that \( \text{adj}(B) = B \). Find the value of \( (p + s) \).

Solution: We know that for a 2×2 matrix \( B = \begin{bmatrix} p & q \\ r & s \end{bmatrix} \), the adjoint is \[ \text{adj}(B) = \begin{bmatrix} s & -q \\ -r & p \end{bmatrix} \] Given that \( \text{adj}(B) = B \), we equate corresponding entries: \[ \begin{bmatrix} s & -q \\ -r & p \end{bmatrix} = \begin{bmatrix} p & q \\ r & s \end{bmatrix} \] From the (1,1) entry: \( s = p \). From the (2,2) entry: \( p = s \). Both give the same result: \( p = s \). From the (1,2) entry: \( -q = q \), so \( 2q = 0 \), giving \( q = 0 \). From the (2,1) entry: \( -r = r \), so \( 2r = 0 \), giving \( r = 0 \). Therefore \( p = s \), and \[ p + s = p + p = 2p \] Hence \( (p + s) = 2p \).

Answer: \( 2p \)

Example 2

Question: Let \( M = \begin{bmatrix} \alpha & \beta \\ \gamma & \delta \end{bmatrix} \) be a square matrix such that \( \text{adj}(M) = M \). Which of the following is necessarily true? (A) \( \alpha + \delta = 2\beta \) (B) \( \beta + \gamma = 0 \) (C) \( \alpha - \delta = 0 \) (D) Both (B) and (C)

Solution: For a 2×2 matrix \( M = \begin{bmatrix} \alpha & \beta \\ \gamma & \delta \end{bmatrix} \), the adjoint is \[ \text{adj}(M) = \begin{bmatrix} \delta & -\beta \\ -\gamma & \alpha \end{bmatrix} \] Setting \( \text{adj}(M) = M \): \[ \begin{bmatrix} \delta & -\beta \\ -\gamma & \alpha \end{bmatrix} = \begin{bmatrix} \alpha & \beta \\ \gamma & \delta \end{bmatrix} \] Equating entry (1,1): \( \delta = \alpha \), so \( \alpha - \delta = 0 \). This confirms option (C). Equating entry (1,2): \( -\beta = \beta \), so \( \beta = 0 \). Equating entry (2,1): \( -\gamma = \gamma \), so \( \gamma = 0 \). Therefore \( \beta + \gamma = 0 + 0 = 0 \). This confirms option (B). Both (B) and (C) are necessarily true. The correct answer is (D).

Answer: (D) Both (B) and (C), i.e., \( \beta + \gamma = 0 \) and \( \alpha = \delta \)

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( B = \begin{bmatrix} p & q \\ r & s \end{bmatrix} \) be a square matrix such that \( \text{adj}(B) = B \). Then \( (p + q + r + s) \) is equal to: (A) \( 2q \) (B) \( 2s \) (C) \( 2r \) (D) \( 0 \)

Solution

  1. Step 1: Write the adjoint of B: For the matrix \( B = \begin{bmatrix} p & q \\ r & s \end{bmatrix} \), the adjoint is obtained by swapping the main diagonal entries and negating the off-diagonal entries: \[ \text{adj}(B) = \begin{bmatrix} s & -q \\ -r & p \end{bmatrix} \]
  2. Step 2: Apply the condition adj(B) = B: Setting \( \text{adj}(B) = B \) gives: \[ \begin{bmatrix} s & -q \\ -r & p \end{bmatrix} = \begin{bmatrix} p & q \\ r & s \end{bmatrix} \] Equating corresponding entries, we get four equations.
  3. Step 3: Solve the system of equations: From the (1,1) entry: \( s = p \). From the (2,2) entry: \( p = s \), which is consistent. From the (1,2) entry: \( -q = q \), so \( 2q = 0 \), giving \( q = 0 \). From the (2,1) entry: \( -r = r \), so \( 2r = 0 \), giving \( r = 0 \).
  4. Step 4: Compute p + q + r + s: Using \( s = p \), \( q = 0 \), and \( r = 0 \): \[ p + q + r + s = p + 0 + 0 + s = p + s = 2s \] since \( p = s \).
  5. Step 5: Identify the correct option: We have \( p + q + r + s = 2s \). Comparing with the options, the correct answer is (B) \( 2s \).

Answer: \( p + q + r + s = 2s \), so the correct option is (B).

Everything you get with Solver7

More questions in Determinants