Skip to content

Mathematics · Ch 3 — Matrices

Invertible Matrices and Uniqueness of Inverse

9

Invertible Matrices and Uniqueness of Inverse

Definition

Definition. A square matrix AA of order nn is said to be invertible (or non-singular) if there exists a square matrix BB of the same order nn such that

AB=BA=I,AB=BA=I,

where II is the identity matrix of order nn (Section 2). The matrix BB is called the inverse of AA, written A−1A^{-1}. Only square matrices can possibly be invertible, since II itself must be square and ABAB, BABA must both equal it. A square matrix that is not invertible is called singular.

Uniqueness of the Inverse

Theorem. If a square matrix AA has an inverse, that inverse is unique -- no square matrix can have two different inverses.

Proof. Suppose BB and CC are both inverses of AA, so that

AB=BA=IandAC=CA=I.AB=BA=I \qquad \text{and} \qquad AC=CA=I.

Consider the product B(AC)B(AC). Since AC=IAC=I, this is simply BI=BBI=B. On the other hand, by the associativity of matrix multiplication (Section 5), B(AC)=(BA)CB(AC)=(BA)C; and since BA=IBA=I, this equals IC=CIC=C. Both computations evaluate the same product B(AC)B(AC), so their results must be equal:

B=BI=B(AC)=(BA)C=IC=C.B = BI = B(AC) = (BA)C = IC = C.

Hence B=CB=C -- the two supposed inverses are in fact the same matrix. ■\blacksquare This is precisely why the notation A−1A^{-1} (a single, definite symbol) is justified: there is never any ambiguity about which matrix it refers to. (Exercise: Invertible Matrices, Q4 applies this theorem to a case where two differently-written candidate inverses turn out, on inspection, to be the same matrix all along -- exactly as the theorem guarantees must happen.)

Finding the Inverse of a 2×22\times2 Matrix

A full determinant-and-adjoint theory belongs to a later chapter, but the following shortcut is enough to compute the inverse of any 2×22\times2 matrix here. For A=[abcd]A=\begin{bmatrix}a&b\\c&d\end{bmatrix}, define its determinant det⁡A=ad−bc\det A=ad-bc. If det⁡A≠0\det A\neq0, then AA is invertible, and

A−1=1det⁡A[d−b−ca]A^{-1}=\frac{1}{\det A}\begin{bmatrix}d&-b\\-c&a\end{bmatrix}

-- obtained by swapping the two diagonal entries, negating the two off-diagonal entries (together, this rearranged matrix is called the adjoint of AA), and dividing every entry by det⁡A\det A. If det⁡A=0\det A=0, no such BB can exist and AA is singular (Exercise: Invertible Matrices, Q3 gives a worked example of this case). Example 9 and Exercise: Invertible Matrices, Q1--Q2 apply this shortcut and then verify the result directly against the definition AA−1=A−1A=IAA^{-1}=A^{-1}A=I. …