Note that this gives an easy way to write a formula for the inverse of an n × n matrix.
Theorem 4.7.14 A−1 exists if and only if det(A)≠0. If det(A)≠0, then A−1 =
|
for cof
Proof: By Theorem 4.7.13 and letting
|
Now consider
|
when k≠r. Replace the kth column with the rth column to obtain a matrix Bk whose determinant equals zero by Corollary 4.7.6. However, expanding this matrix along the kth column yields
|
Summarizing,
|
Using the other formula in Theorem 4.7.13, and similar reasoning,
|
This proves that if det
|
Now suppose A−1 exists. Then by Theorem 4.7.10,
|
so det
The next corollary points out that if an n × n matrix A has a right or a left inverse, then it has an inverse.
Corollary 4.7.15 Let A be an n × n matrix and suppose there exists an n × n matrix B such that BA = I. Then A−1 exists and A−1 = B. Also, if there exists C an n × n matrix such that AC = I, then A−1 exists and A−1 = C.
Proof: Since BA = I, Theorem 4.7.10 implies
|
and so detA≠0. Therefore from Theorem 4.7.14, A−1 exists. Therefore,
|
The case where CA = I is handled similarly. ■
The conclusion of this corollary is that left inverses, right inverses and inverses are all the same in the context of n × n matrices.
Theorem 4.7.14 says that to find the inverse, take the transpose of the cofactor matrix and divide by the determinant. The transpose of the cofactor matrix is called the adjugate or sometimes the classical adjoint of the matrix A. It is an abomination to call it the adjoint although you do sometimes see it referred to in this way. In words, A−1 is equal to one over the determinant of A times the adjugate matrix of A.