Find inverse of 2×2 matrix [[3,1],[5,2]] and verify

hard 3 min read

Question

Find the inverse of the matrix A=(3152)A = \begin{pmatrix} 3 & 1 \\ 5 & 2 \end{pmatrix} and verify that AA1=IA \cdot A^{-1} = I.

Solution — Step by Step

For a 2×2 matrix (abcd)\begin{pmatrix} a & b \\ c & d \end{pmatrix}, the determinant is adbcad - bc.

det(A)=(3)(2)(1)(5)=65=1\det(A) = (3)(2) - (1)(5) = 6 - 5 = 1

Since det(A)=10\det(A) = 1 \neq 0, the inverse exists.

For a 2×2 matrix, the adjugate is obtained by swapping the diagonal elements and changing the signs of the off-diagonal elements:

adj(A)=(2153)\text{adj}(A) = \begin{pmatrix} 2 & -1 \\ -5 & 3 \end{pmatrix}

(swap 3 and 2, negate 1 and 5)

A1=1det(A)adj(A)=11(2153)=(2153)A^{-1} = \frac{1}{\det(A)} \cdot \text{adj}(A) = \frac{1}{1} \begin{pmatrix} 2 & -1 \\ -5 & 3 \end{pmatrix} = \begin{pmatrix} 2 & -1 \\ -5 & 3 \end{pmatrix} AA1=(3152)(2153)A \cdot A^{-1} = \begin{pmatrix} 3 & 1 \\ 5 & 2 \end{pmatrix} \begin{pmatrix} 2 & -1 \\ -5 & 3 \end{pmatrix}

Row 1 × Col 1: (3)(2)+(1)(5)=65=1(3)(2) + (1)(-5) = 6 - 5 = 1

Row 1 × Col 2: (3)(1)+(1)(3)=3+3=0(3)(-1) + (1)(3) = -3 + 3 = 0

Row 2 × Col 1: (5)(2)+(2)(5)=1010=0(5)(2) + (2)(-5) = 10 - 10 = 0

Row 2 × Col 2: (5)(1)+(2)(3)=5+6=1(5)(-1) + (2)(3) = -5 + 6 = 1

AA1=(1001)=IA \cdot A^{-1} = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} = I \quad \checkmark

Why This Works

The inverse of a matrix “undoes” the transformation it represents. Just as 5×15=15 \times \frac{1}{5} = 1 for numbers, AA1=IA \cdot A^{-1} = I for matrices.

The formula A1=1det(A)adj(A)A^{-1} = \frac{1}{\det(A)} \cdot \text{adj}(A) comes from the property that Aadj(A)=det(A)IA \cdot \text{adj}(A) = \det(A) \cdot I. Dividing both sides by det(A)\det(A) gives the inverse.

The determinant being 1 in this case made the computation especially clean — no fractions to deal with.

Alternative Method — Elementary Row Operations

We can find A1A^{-1} by augmenting AA with the identity matrix and row-reducing:

[31105201]\left[\begin{array}{cc|cc} 3 & 1 & 1 & 0 \\ 5 & 2 & 0 & 1 \end{array}\right]

R2R253R1R_2 \to R_2 - \frac{5}{3}R_1:

[3110013531]\left[\begin{array}{cc|cc} 3 & 1 & 1 & 0 \\ 0 & \frac{1}{3} & -\frac{5}{3} & 1 \end{array}\right]

R23R2R_2 \to 3R_2: [31100153]\left[\begin{array}{cc|cc} 3 & 1 & 1 & 0 \\ 0 & 1 & -5 & 3 \end{array}\right]

R1R1R2R_1 \to R_1 - R_2: [30630153]\left[\begin{array}{cc|cc} 3 & 0 & 6 & -3 \\ 0 & 1 & -5 & 3 \end{array}\right]

R113R1R_1 \to \frac{1}{3}R_1: [10210153]\left[\begin{array}{cc|cc} 1 & 0 & 2 & -1 \\ 0 & 1 & -5 & 3 \end{array}\right]

The right half gives A1=(2153)A^{-1} = \begin{pmatrix} 2 & -1 \\ -5 & 3 \end{pmatrix}. Same answer confirmed.

Common Mistake

Students often write the adjugate incorrectly for 2×2 matrices. The correct rule: swap the main diagonal elements (top-left and bottom-right), then negate the anti-diagonal elements (top-right and bottom-left).

For (abcd)\begin{pmatrix} a & b \\ c & d \end{pmatrix}: adjugate is (dbca)\begin{pmatrix} d & -b \\ -c & a \end{pmatrix}. A common error is negating the wrong pair — swapping instead of negating the off-diagonal.

Want to master this topic?

Read the complete guide with more examples and exam tips.

Go to full topic guide →

Try These Next