Skip to content
Question

Q.If A is a 3×33 \times 3 invertible matrix, show that for any scalar k≠0k \neq 0, (kA)−1=1kA−1(kA)^{-1} = \frac{1}{k}A^{-1}. Hence calculate (3A)−1(3A)^{-1}, where A=[2−11−12−11−12]A = \begin{bmatrix} 2 & -1 & 1 \\ -1 & 2 & -1 \\ 1 & -1 & 2 \end{bmatrix}.

CBSECBSE Class XII Board 2025Subjective· 5mImportance★★★★★
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

The inverse of a scalar multiple of an invertible matrix is the reciprocal of the scalar times the original inverse. For AA given, (3A)−1=13A−1(3A)^{-1} = \frac13 A^{-1}, and A−1A^{-1} is computed explicitly.

We start with the core idea: if you scale a matrix by a nonzero constant, its inverse simply scales back by the reciprocal. This is because matrix multiplication is linear in each factor — scaling the whole matrix is like scaling every entry, and the inverse must undo that scaling.


1. Proving the general property

Let AA be an n×nn \times n invertible matrix and k≠0k \neq 0 a scalar. We need to show that (kA)−1=1kA−1(kA)^{-1} = \frac{1}{k} A^{-1}.

Recall the definition: BB is the inverse of CC if BC=I=CBBC = I = CB. So check:

(kA)(1kA−1)=k⋅1k⋅AA−1=1⋅I=I.(kA) \left( \frac{1}{k} A^{-1} \right) = k \cdot \frac{1}{k} \cdot A A^{-1} = 1 \cdot I = I.

Similarly, (1kA−1)(kA)=I\left( \frac{1}{k} A^{-1} \right) (kA) = I. Since the inverse is unique, the result follows.

Watch out

This only holds if k≠0k \neq 0. If k=0k = 0, the matrix kAkA is the zero matrix, which is not invertible.


2. Applying to the given matrix

We have A=[2−11−12−11−12]A = \begin{bmatrix} 2 & -1 & 1 \\ -1 & 2 & -1 \\ 1 & -1 & 2 \end{bmatrix}. First, find A−1A^{-1}.

A common method: use the formula A−1=1det⁡Aadj⁡(A)A^{-1} = \frac{1}{\det A} \operatorname{adj}(A). Compute det⁡A\det A:

Expanding along the first row:

det⁡A=2⋅det⁡[2−1−12]−(−1)⋅det⁡[−1−112]+1⋅det⁡[−121−1].\det A = 2 \cdot \det\begin{bmatrix} 2 & -1 \\ -1 & 2 \end{bmatrix} - (-1) \cdot \det\begin{bmatrix} -1 & -1 \\ 1 & 2 \end{bmatrix} + 1 \cdot \det\begin{bmatrix} -1 & 2 \\ 1 & -1 \end{bmatrix}.

Each 2×22 \times 2 determinant:

  • First: (2)(2)−(−1)(−1)=4−1=3(2)(2) - (-1)(-1) = 4 - 1 = 3
  • Second: (−1)(2)−(−1)(1)=−2+1=−1(-1)(2) - (-1)(1) = -2 + 1 = -1
  • Third: (−1)(−1)−(2)(1)=1−2=−1(-1)(-1) - (2)(1) = 1 - 2 = -1

So det⁡A=2(3)+1(−1)+1(−1)=6−1−1=4\det A = 2(3) + 1(-1) + 1(-1) = 6 - 1 - 1 = 4.


3. Finding the adjugate (classical adjoint)

The adjugate is the transpose of the cofactor matrix. Compute cofactors Cij=(−1)i+jMijC_{ij} = (-1)^{i+j} M_{ij}, where MijM_{ij} is the minor.

  • C11=+det⁡[2−1−12]=3C_{11} = +\det\begin{bmatrix} 2 & -1 \\ -1 & 2 \end{bmatrix} = 3

  • C12=−det⁡[−1−112]=−[(−1)(2)−(−1)(1)]=−(−2+1)=1C_{12} = -\det\begin{bmatrix} -1 & -1 \\ 1 & 2 \end{bmatrix} = -[(-1)(2) - (-1)(1)] = -(-2+1) = 1

  • C13=+det⁡[−121−1]=(−1)(−1)−(2)(1)=1−2=−1C_{13} = +\det\begin{bmatrix} -1 & 2 \\ 1 & -1 \end{bmatrix} = (-1)(-1) - (2)(1) = 1 - 2 = -1

  • C21=−det⁡[−11−12]=−[(−1)(2)−(1)(−1)]=−(−2+1)=1C_{21} = -\det\begin{bmatrix} -1 & 1 \\ -1 & 2 \end{bmatrix} = -[(-1)(2) - (1)(-1)] = -(-2+1) = 1

  • C22=+det⁡[2112]=(2)(2)−(1)(1)=4−1=3C_{22} = +\det\begin{bmatrix} 2 & 1 \\ 1 & 2 \end{bmatrix} = (2)(2) - (1)(1) = 4 - 1 = 3

  • C23=−det⁡[2−11−1]=−[(2)(−1)−(−1)(1)]=−(−2+1)=1C_{23} = -\det\begin{bmatrix} 2 & -1 \\ 1 & -1 \end{bmatrix} = -[(2)(-1) - (-1)(1)] = -(-2+1) = 1 …

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.