Inverse Matrix
Definition
A square matrix is invertible (non-singular) if there exists a matrix such that
Intuition
The inverse undoes the transformation encoded by . Geometrically, if stretches and rotates space, applies the exact reverse — restoring the original vectors. A matrix is invertible when it neither collapses any dimension to zero (full rank) nor maps multiple inputs to the same output (injective map), i.e. .
Formal Description
For a matrix, solving yields:
The scalar is the determinant of : the product of the diagonals minus the product of the off-diagonals.
- is invertible if and only if .
- If is invertible, so is , and .
Applications
- Solving linear systems : if is invertible, then .
- LU decomposition factorises to compute solutions without explicitly forming .
Trade-offs
- The inverse does not exist when (singular matrix); the linear system then has either no solution or infinitely many.
- Explicitly computing is numerically expensive () and unstable for ill-conditioned matrices; in practice, solve directly using LU or QR decomposition instead.
- For non-square matrices, only the pseudoinverse exists; it minimises in the least-squares sense.