Topper Copies

If $A = \begin{pmatrix} 1 & -1 & 1 \\ 2 & -1 & 0 \\ 1 & 0 & 0 \end{pmatrix}$ then obtain $A^{-1}$ by the use of (i) Cayley Hamilton theorem, and (ii) Elementary row operations.

Aryan Yadav, AIR 31, 2025

i)

Finding eigen vals of A

$\Rightarrow |A - \lambda I| = 0$

$\Rightarrow \begin{vmatrix} 1-\lambda & -1 & 1 \\ 2 & -1-\lambda & 0 \\ 1 & 0 & -\lambda \end{vmatrix} = 0$

$\Rightarrow (1-\lambda)(\lambda)(1+\lambda) + (-2\lambda) + (1+\lambda) = 0$

$\Rightarrow \lambda - \lambda^3 - 2\lambda + 1 + \lambda = 0$

$\Rightarrow \lambda^3 - 1 = 0$ (Char polynomial)

By Cayley Hamilton thm $\Rightarrow$ A satisfies char polynomial.

$\Rightarrow A^3 - I = 0$

$\Rightarrow A^3 = I$

Multiply by $A^{-1}$

$\Rightarrow A^{-1} = A^2$

ii)

$\downarrow$ $R_2 \to R_2 - 2R_3$, $R_1 \to R_1 - R_3$

$\downarrow$ $R_2 \to R_2 \times -1$, $R_1 \to R_1 + R_2$

$\downarrow$ $R_1 \leftrightarrow R_3$

$= (I|A^{-1})$

Hence we get