Inverse Matrix

Precise definition

For a square matrix $A$, an inverse is a matrix $A^{-1}$ satisfying $AA^{-1}=A^{-1}A=I$. It exists exactly when $A$ is invertible, equivalently $\det A\ne0$, $\operatorname{rank}A=n$, the columns form a basis, and $A\mathbf x=0$ has only the zero solution.

Notation and mathematical language

For $2\times2$, $A^{-1}=\frac1{ad-bc}\begin{pmatrix}d&-b\\-c&a\end{pmatrix}$ when $ad-bc\ne0$. In general, row-reduce the augmented block $[A\mid I]$; obtaining $[I\mid B]$ proves $B=A^{-1}$.

Conceptual picture

An inverse undoes the linear transformation on both sides. Each column of $A^{-1}$ solves $A x=e_j$. Matrix multiplication order matters: $(AB)^{-1}=B^{-1}A^{-1}$.

Conditions and key results

Only square matrices can have a two-sided inverse. A left or right inverse for a rectangular matrix is a different notion. Numerically, explicitly forming $A^{-1}$ is usually less efficient and less stable than solving a factored system.

A reliable strategy

1. Check squareness and establish invertibility by determinant, pivots, or null space.
2. For small matrices use a valid formula; otherwise row-reduce $[A\mid I]$ with every operation applied across the block.
3. If the left block cannot become $I$, conclude no inverse exists rather than dividing by zero.
4. Verify both products or solve systems directly when that is the actual goal.

Fully worked example

Interpretation and application

Inverse matrices encode coordinate changes and reversible systems. A theoretically invertible but ill-conditioned matrix may amplify measurement or rounding error greatly; invertibility is a yes/no property, while conditioning measures sensitivity.

Common mistakes

Verification and reasonableness

• Multiply in both orders when exact symbolic verification is requested.
• Check determinant or full pivot count independently.
• Use the inverse on basis vectors and confirm $A(A^{-1}e_j)=e_j$.

Practice

1. Invert $\begin{pmatrix}1&0\\0&4\end{pmatrix}$.
2. When does a $2\times2$ inverse exist?
3. What is $(AB)^{-1}$?

Further deduction

The inverse of a transformation exists precisely when it is one-to-one and onto. In finite equal dimensions, either property implies the other, but for maps between different dimensions the distinction matters. The inverse function must also be linear: $T^{-1}(au+bv)=aT^{-1}u+bT^{-1}v$, obtained by applying $T$ and using uniqueness.

For a small perturbation, $(A+E)^{-1}$ exists and can be expanded as $(I+A^{-1}E)^{-1}A^{-1}$ when $\|A^{-1}E\|<1$. The size of $A^{-1}$ therefore controls sensitivity. This is why a matrix can have a perfectly valid exact inverse yet behave poorly with rounded or measured coefficients.

Solving $Ax=b$ by factoring or row reduction is normally preferable to explicitly computing $A^{-1}$. An inverse contains solutions for every basis right-hand side and can cost extra work and amplify rounding, while a factorization targets the needed vector and can be reused. The identity $x=A^{-1}b$ remains conceptually valuable for proofs, but numerical implementation should distinguish a mathematical expression from an efficient and stable algorithm.

Related topics

• Determinants
• Row Reduction
• Linear Transformations