\(If\ A=\left[\begin{array}\text 1&3&3\\ 1&4&3\\ 1&3&4\end{array}\right],\) then verify that \(A\ {adj}\ A=|A|I.\) Also find \(A^{-1}\).
CBSE Class 12 Maths · Determinants
CBSE Class 12 Maths · Determinants
Think of a matrix like a special locker combination. Every locker has a matching key called its adjoint. When you pair the locker with its key in just the right way, you always get the identity matrix — a perfectly clean result. The determinant tells you how strong the locker is. If the determinant is not zero, the locker can be opened, meaning an inverse exists. Finding the inverse is like discovering the exact reverse combination that undoes everything the original matrix does.
Answer: The property is verified: \[A \, \text{adj}(A) = |A| I = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}\] and the inverse is \[A^{-1} = \begin{bmatrix} 7 & -3 & -3 \\ -1 & 1 & 0 \\ -1 & 0 & 1 \end{bmatrix}\]
For any square matrix \(A\), there is an important relationship connecting the matrix, its adjoint, and its determinant: \(A \, \text{adj}(A) = \text{adj}(A) \, A = |A| I\). The adjoint of \(A\) is the transpose of the matrix of cofactors. A cofactor \(A_{ij}\) is the signed minor \((-1)^{i+j} M_{ij}\), where \(M_{ij}\) is the determinant obtained by deleting row \(i\) and column \(j\). Once we know \(\text{adj}(A)\) and \(|A|\), the inverse is found directly using \(A^{-1} = \frac{1}{|A|}\text{adj}(A)\), valid whenever \(|A| \ne 0\).
\[A \, \text{adj}(A) = |A| I\] \[A^{-1} = \frac{1}{|A|}\text{adj}(A)\] where cofactor \(A_{ij} = (-1)^{i+j} M_{ij}\).
The property is verified: \[A \, \text{adj}(A) = |A| I = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}\] and the inverse is \[A^{-1} = \begin{bmatrix} 7 & -3 & -3 \\ -1 & 1 & 0 \\ -1 & 0 & 1 \end{bmatrix}\]
A very common error is forgetting to take the transpose of the cofactor matrix. The adjoint is the transpose of the cofactor matrix, not the cofactor matrix itself. Students also frequently mix up the sign pattern \((-1)^{i+j}\), which flips the sign of the off-diagonal cofactors.
The property is verified: \[A \, \text{adj}(A) = |A| I = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}\] and the inverse is \[A^{-1} = \begin{bmatrix} 7 & -3 & -3 \\ -1 & 1 & 0 \\ -1 & 0 & 1 \end{bmatrix}\]
One common mistake: students write the adjoint as the cofactor matrix itself, forgetting to transpose it — always take the transpose of the cofactor matrix to get \( \text{adj}(A) \).
Answer: The property is verified: \[A \, \text{adj}(A) = |A| I = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}\] and the inverse is \[A^{-1} = \begin{bmatrix} 7 & -3 & -3 \\ -1 & 1 & 0 \\ -1 & 0 & 1 \end{bmatrix}\]
Question: If \[A = \begin{bmatrix} 2 & 1 & 1 \\ 1 & 2 & 1 \\ 1 & 1 & 2 \end{bmatrix}\] verify that \( A \cdot \text{adj}(A) = |A| \cdot I \) and hence find \( A^{-1} \).
Solution: Step 1: Compute |A|. Expanding along the first row: \[|A| = 2\begin{vmatrix} 2 & 1 \\ 1 & 2 \end{vmatrix} - 1\begin{vmatrix} 1 & 1 \\ 1 & 2 \end{vmatrix} + 1\begin{vmatrix} 1 & 2 \\ 1 & 1 \end{vmatrix}\] \[= 2(4-1) - 1(2-1) + 1(1-2) = 6 - 1 - 1 = 4\] So \( |A| = 4 \ne 0 \), hence \( A^{-1} \) exists. Step 2: Find the cofactors. Cofactors \( C_{ij} \) are computed as \( C_{ij} = (-1)^{i+j} M_{ij} \) where \( M_{ij} \) is the minor. \( C_{11} \): \[\begin{vmatrix} 2 & 1 \\ 1 & 2 \end{vmatrix} = 4-1 = 3\] \( C_{12} \): \[-\begin{vmatrix} 1 & 1 \\ 1 & 2 \end{vmatrix} = -(2-1) = -1\] \( C_{13} \): \[\begin{vmatrix} 1 & 2 \\ 1 & 1 \end{vmatrix} = 1-2 = -1\] \( C_{21} \): \[-\begin{vmatrix} 1 & 1 \\ 1 & 2 \end{vmatrix} = -(2-1) = -1\] \( C_{22} \): \[\begin{vmatrix} 2 & 1 \\ 1 & 2 \end{vmatrix} = 4-1 = 3\] \( C_{23} \): \[-\begin{vmatrix} 2 & 1 \\ 1 & 1 \end{vmatrix} = -(2-1) = -1\] \( C_{31} \): \[\begin{vmatrix} 1 & 1 \\ 2 & 1 \end{vmatrix} = 1-2 = -1\] \( C_{32} \): \[-\begin{vmatrix} 2 & 1 \\ 1 & 1 \end{vmatrix} = -(2-1) = -1\] \( C_{33} \): \[\begin{vmatrix} 2 & 1 \\ 1 & 2 \end{vmatrix} = 4-1 = 3\] Step 3: Write adj(A) = transpose of cofactor matrix. \[\text{adj}(A) = \begin{bmatrix} 3 & -1 & -1 \\ -1 & 3 & -1 \\ -1 & -1 & 3 \end{bmatrix}\] Step 4: Compute \( A \cdot \text{adj}(A) \). \[A \cdot \text{adj}(A) = \begin{bmatrix} 2 & 1 & 1 \\ 1 & 2 & 1 \\ 1 & 1 & 2 \end{bmatrix} \begin{bmatrix} 3 & -1 & -1 \\ -1 & 3 & -1 \\ -1 & -1 & 3 \end{bmatrix}\] Row 1, Col 1: \( 2(3)+1(-1)+1(-1)=6-1-1=4 \). Row 1, Col 2: \( 2(-1)+1(3)+1(-1)=-2+3-1=0 \). Row 1, Col 3: \( 2(-1)+1(-1)+1(3)=-2-1+3=0 \). By symmetry each diagonal entry equals 4 and each off-diagonal entry equals 0. Therefore \[A \cdot \text{adj}(A) = \begin{bmatrix} 4 & 0 & 0 \\ 0 & 4 & 0 \\ 0 & 0 & 4 \end{bmatrix} = 4 \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix} = |A| \cdot I\] This verifies the property. Step 5: Find \( A^{-1} \). \[A^{-1} = \frac{1}{|A|} \text{adj}(A) = \frac{1}{4} \begin{bmatrix} 3 & -1 & -1 \\ -1 & 3 & -1 \\ -1 & -1 & 3 \end{bmatrix}\]
Answer: \[A^{-1} = \frac{1}{4} \begin{bmatrix} 3 & -1 & -1 \\ -1 & 3 & -1 \\ -1 & -1 & 3 \end{bmatrix}\]
Question: If \[A = \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 1 \\ 2 & 0 & 3 \end{bmatrix}\] verify that \( A \cdot \text{adj}(A) = |A| \cdot I \) and hence find \( A^{-1} \).
Solution: Step 1: Compute |A|. Expanding along the first row: \[|A| = 1\begin{vmatrix} 1 & 1 \\ 0 & 3 \end{vmatrix} - 2\begin{vmatrix} 0 & 1 \\ 2 & 3 \end{vmatrix} + 0\begin{vmatrix} 0 & 1 \\ 2 & 0 \end{vmatrix}\] \[= 1(3-0) - 2(0-2) + 0 = 3 + 4 = 7\] So \( |A| = 7 \ne 0 \), hence \( A^{-1} \) exists. Step 2: Find the cofactors. \( C_{11} \): \[\begin{vmatrix} 1 & 1 \\ 0 & 3 \end{vmatrix} = 3-0 = 3\] \( C_{12} \): \[-\begin{vmatrix} 0 & 1 \\ 2 & 3 \end{vmatrix} = -(0-2) = 2\] \( C_{13} \): \[\begin{vmatrix} 0 & 1 \\ 2 & 0 \end{vmatrix} = 0-2 = -2\] \( C_{21} \): \[-\begin{vmatrix} 2 & 0 \\ 0 & 3 \end{vmatrix} = -(6-0) = -6\] \( C_{22} \): \[\begin{vmatrix} 1 & 0 \\ 2 & 3 \end{vmatrix} = 3-0 = 3\] \( C_{23} \): \[-\begin{vmatrix} 1 & 2 \\ 2 & 0 \end{vmatrix} = -(0-4) = 4\] \( C_{31} \): \[\begin{vmatrix} 2 & 0 \\ 1 & 1 \end{vmatrix} = 2-0 = 2\] \( C_{32} \): \[-\begin{vmatrix} 1 & 0 \\ 0 & 1 \end{vmatrix} = -(1-0) = -1\] \( C_{33} \): \[\begin{vmatrix} 1 & 2 \\ 0 & 1 \end{vmatrix} = 1-0 = 1\] Step 3: Write adj(A) = transpose of cofactor matrix. \[\text{adj}(A) = \begin{bmatrix} 3 & -6 & 2 \\ 2 & 3 & -1 \\ -2 & 4 & 1 \end{bmatrix}\] Step 4: Compute \( A \cdot \text{adj}(A) \). \[A \cdot \text{adj}(A) = \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 1 \\ 2 & 0 & 3 \end{bmatrix} \begin{bmatrix} 3 & -6 & 2 \\ 2 & 3 & -1 \\ -2 & 4 & 1 \end{bmatrix}\] Row 1: \( (3+4+0,\ -6+6+0,\ 2-2+0) = (7,\ 0,\ 0) \). Row 2: \( (0+2-2,\ 0+3+4,\ 0-1+1) = (0,\ 7,\ 0) \). Row 3: \( (6+0-6,\ -12+0+12,\ 4+0+3) = (0,\ 0,\ 7) \). Therefore \[A \cdot \text{adj}(A) = \begin{bmatrix} 7 & 0 & 0 \\ 0 & 7 & 0 \\ 0 & 0 & 7 \end{bmatrix} = 7 \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix} = |A| \cdot I\] This verifies the property. Step 5: Find \( A^{-1} \). \[A^{-1} = \frac{1}{|A|} \text{adj}(A) = \frac{1}{7} \begin{bmatrix} 3 & -6 & 2 \\ 2 & 3 & -1 \\ -2 & 4 & 1 \end{bmatrix}\]
Answer: \[A^{-1} = \frac{1}{7} \begin{bmatrix} 3 & -6 & 2 \\ 2 & 3 & -1 \\ -2 & 4 & 1 \end{bmatrix}\]