Skip to content
Part IA Michaelmas, Lent, Easter Term

Matrix Inverse

Definition

A1A^{-1} is the inverse of AA if:

A1A=AA1=IA^{-1}A = AA^{-1} = I

Existence: Inverse exists if and only if det(A)0\det(A) \neq 0.


Methods for Finding Inverse

1. Formula for 2×22 \times 2

(abcd)1=1adbc(dbca)\begin{pmatrix} a & b \\ c & d \end{pmatrix}^{-1} = \frac{1}{ad - bc}\begin{pmatrix} d & -b \\ -c & a \end{pmatrix}

2. Cofactor Method (Adjugate)

A1=1det(A)(adj A)A^{-1} = \frac{1}{\det(A)}(\text{adj }A)

where adj(A)=CT\text{adj}(A) = C^T is the transpose of the cofactor matrix.

3. Row Reduction (Gaussian Elimination)

Augment [AI][A|I] and perform row operations:

[AI][IA1][A|I] \to [I|A^{-1}]


Example: 2×22 \times 2 Inverse

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

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

A1=11(3152)=(3152)A^{-1} = \frac{1}{1}\begin{pmatrix} 3 & -1 \\ -5 & 2 \end{pmatrix} = \begin{pmatrix} 3 & -1 \\ -5 & 2 \end{pmatrix}

Verify: AA1=(652+215155+6)=IAA^{-1} = \begin{pmatrix} 6-5 & -2+2 \\ 15-15 & -5+6 \end{pmatrix} = I


Properties

PropertyFormula
UniquenessInverse is unique (if exists)
Product(AB)1=B1A1(AB)^{-1} = B^{-1}A^{-1} (reversed order)
Transpose(AT)1=(A1)T(A^T)^{-1} = (A^{-1})^T
Double inverse(A1)1=A(A^{-1})^{-1} = A
Determinantdet(A1)=1/det(A)\det(A^{-1}) = 1/\det(A)

Kernel (Null Space)

The kernel of AA is:

ker(A)={x:Ax=0}\ker(A) = \{\mathbf{x} : A\mathbf{x} = \mathbf{0}\}

Kernel as the null space in R^n, showing vectors that map to zero

Key results:

  • ker(A)={0}\ker(A) = \{\mathbf{0}\} \Leftrightarrow det(A)0\det(A) \neq 0 \Leftrightarrow A1A^{-1} exists
  • Non-trivial kernel \Leftrightarrow columns are linearly dependent

Solving Ax=yA\mathbf{x} = \mathbf{y}

If det(A)0\det(A) \neq 0:

x=A1y\mathbf{x} = A^{-1}\mathbf{y}

Row reduction method: Augment [Ay][A|\mathbf{y}] and solve.


When Inverse Doesn’t Exist

det(A)=0\det(A) = 0 means:

  • Columns are linearly dependent
  • ker(A){0}\ker(A) \neq \{\mathbf{0}\}
  • Either no solution or infinitely many solutions to Ax=yA\mathbf{x} = \mathbf{y}

Left and Right Inverses

For m×nm \times n matrices:

  • Left inverse: BA=InBA = I_n (if columns of AA are independent)
  • Right inverse: AB=ImAB = I_m (if rows of AA are independent)

For square matrices: left inverse = right inverse = unique inverse.


Why Matrix Inverse Matters

  • Solve systems Ax=bA\mathbf{x} = \mathbf{b} directly: x=A1b\mathbf{x} = A^{-1}\mathbf{b}
  • Undo transformations (inverse rotation, inverse scaling)
  • Essential for parameter estimation in statistics
  • Foundation for understanding linear maps

Note: In practice, row reduction or decomposition methods are preferred for numerical stability. Direct inversion is rarely computationally optimal.