Definition
A−1 is the inverse of A if:
A−1A=AA−1=I
Existence: Inverse exists if and only if det(A)=0.
Methods for Finding Inverse
(acbd)−1=ad−bc1(d−c−ba)
2. Cofactor Method (Adjugate)
A−1=det(A)1(adj A)
where adj(A)=CT is the transpose of the cofactor matrix.
3. Row Reduction (Gaussian Elimination)
Augment [A∣I] and perform row operations:
[A∣I]→[I∣A−1]
Example: 2×2 Inverse
A=(2513)
det(A)=6−5=1
A−1=11(3−5−12)=(3−5−12)
Verify: AA−1=(6−515−15−2+2−5+6)=I
Properties
| Property | Formula |
|---|
| Uniqueness | Inverse is unique (if exists) |
| Product | (AB)−1=B−1A−1 (reversed order) |
| Transpose | (AT)−1=(A−1)T |
| Double inverse | (A−1)−1=A |
| Determinant | det(A−1)=1/det(A) |
Kernel (Null Space)
The kernel of A is:
ker(A)={x:Ax=0}

Key results:
- ker(A)={0} ⇔ det(A)=0 ⇔ A−1 exists
- Non-trivial kernel ⇔ columns are linearly dependent
Solving Ax=y
If det(A)=0:
x=A−1y
Row reduction method: Augment [A∣y] and solve.
When Inverse Doesn’t Exist
det(A)=0 means:
- Columns are linearly dependent
- ker(A)={0}
- Either no solution or infinitely many solutions to Ax=y
Left and Right Inverses
For m×n matrices:
- Left inverse: BA=In (if columns of A are independent)
- Right inverse: AB=Im (if rows of A are independent)
For square matrices: left inverse = right inverse = unique inverse.
Why Matrix Inverse Matters
- Solve systems Ax=b directly: x=A−1b
- Undo transformations (inverse rotation, inverse scaling)
- Essential for parameter estimation in statistics
- Foundation for understanding linear maps
Note: In practice, row reduction or decomposition methods are preferred for numerical stability. Direct inversion is rarely computationally optimal.