Linear Algebra
4.119 min read

Non-Singular Matrices and Unique Inverses

An invertible square matrix is also called non-singular. A non-invertible square matrix is singular. The inverse A1A^{-1} satisfies A1A=AA1=IA^{-1}A = AA^{-1} = I.

The inverse is unique: if LL is a left inverse and RR is a right inverse of AA, then L=RL = R (and so the two-sided inverse is unique). Proof: L=LI=L(AR)=(LA)R=IR=RL = LI = L(AR) = (LA)R = IR = R.

Key inverse properties: (A1)1=A(A^{-1})^{-1} = A, (AB)1=B1A1(AB)^{-1} = B^{-1}A^{-1} (note order reversal), (AT)1=(A1)T(A^T)^{-1} = (A^{-1})^T.

Formal View

Theorem 4.11 — Uniqueness and Properties of Inverse
If ARn×nA \in \mathbb{R}^{n \times n} is invertible, its inverse A1A^{-1} is unique and satisfies: \begin{enumerate} \item (A1)1=A(A^{-1})^{-1} = A \item (AB)1=B1A1(AB)^{-1} = B^{-1}A^{-1} for invertible BB \item (AT)1=(A1)T(A^T)^{-1} = (A^{-1})^T \end{enumerate}

Why This Matters

Knowing inverse properties lets us manipulate matrix equations like scalar equations.

  • Solving AX=BAX = B: X=A1BX = A^{-1}B (but computing A1A^{-1} explicitly is expensive — use LU instead)
  • (AB)1=B1A1(AB)^{-1} = B^{-1}A^{-1} is the "reverse-order law," critical in signal processing and control
  • The formula (ATA)1AT(A^T A)^{-1} A^T (Moore-Penrose pseudoinverse) appears in least squares

Quiz

Question 1

If AA and BB are invertible, (AB)1(AB)^{-1} equals:

Common Mistakes

  • Writing (AB)1=A1B1(AB)^{-1} = A^{-1}B^{-1} — the correct order reverses: B1A1B^{-1}A^{-1}.
  • Computing A1A^{-1} explicitly when solving Ax=bA\mathbf{x} = \mathbf{b} — it's better to use LU decomposition.