Mathematics · Ch 3 — Matrices
Invertible Matrices and Uniqueness of Inverse
Invertible Matrices and Uniqueness of Inverse
Definition
Definition. A square matrix of order is said to be invertible (or non-singular) if there exists a square matrix of the same order such that
where is the identity matrix of order (Section 2). The matrix is called the inverse of , written . Only square matrices can possibly be invertible, since itself must be square and , must both equal it. A square matrix that is not invertible is called singular.
Uniqueness of the Inverse
Theorem. If a square matrix has an inverse, that inverse is unique -- no square matrix can have two different inverses.
Proof. Suppose and are both inverses of , so that
Consider the product . Since , this is simply . On the other hand, by the associativity of matrix multiplication (Section 5), ; and since , this equals . Both computations evaluate the same product , so their results must be equal:
Hence -- the two supposed inverses are in fact the same matrix. This is precisely why the notation (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 Matrix
A full determinant-and-adjoint theory belongs to a later chapter, but the following shortcut is enough to compute the inverse of any matrix here. For , define its determinant . If , then is invertible, and
-- obtained by swapping the two diagonal entries, negating the two off-diagonal entries (together, this rearranged matrix is called the adjoint of ), and dividing every entry by . If , no such can exist and 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 . …