Chapter 3 defined A−1 by the property AB=BA=I but gave no way to compute it. The missing tool is the adjoint.
Definition. The adjoint of a square matrix A=[aij] is the transpose of its cofactor matrix:
adjA=A11A12A13A21A22A23A31A32A33
— compute every cofactor, then flip across the diagonal. Forgetting the transpose is the signature error of this section.
The 2×2 shortcut. For A=(acbd): swap the diagonal entries, negate the off-diagonal ones:
adjA=(d−c−ba)
The master identity
Theorem 1. For any square matrix A of order n:
A(adjA)=(adjA)A=∣A∣I
Why it works: multiply row i of A into column i of adjA — that pairs each row with its own cofactors, giving ∣A∣ on the diagonal. Every off-diagonal entry pairs a row with someone else's cofactors — the alien-cofactor rule from Section 3 makes them all zero.
Singular and nonsingular
A square matrix is singular if ∣A∣=0 and nonsingular if ∣A∣=0. For example (1428) is singular (8−8=0), while (1324) is nonsingular (∣A∣=−2).
Theorem 2. If A and B are nonsingular matrices of the same order, so are AB and BA.
Theorem 3 (product rule).∣AB∣=∣A∣∣B∣ — the determinant of a product is the product of the determinants.
Taking determinants across A(adjA)=∣A∣I gives a JEE favourite as a free corollary:
∣adjA∣=∣A∣n−1(A nonsingular of order n)
— so for order 3, ∣adjA∣=∣A∣2.
The inverse formula
If ∣A∣=0, divide the master identity by ∣A∣:
A−1=∣A∣1adjA
A matrix is invertible exactly when it is nonsingular. Two consequences worth carrying to the exam: (AB)−1=B−1A−1 (reversal, as with transposes), and taking determinants of AA−1=I gives det(A−1)=detA1.