Matrix Inverse
A⁻¹ satisfies AA⁻¹ = A⁻¹A = I. Exists iff det(A) ≠ 0. Formula: A⁻¹ = (1/det(A))·adj(A), where adj(A) is the adjugate (transpose of cofactor matrix).
Why This Mathematical Concept Matters
Why: Inverse solves Ax = b via x = A⁻¹b. Essential for linear systems and change-of-basis.
How: Compute det(A). If zero, singular. Else: cofactor matrix → transpose → adjugate. A⁻¹ = adj(A) / det(A).
- ●(AB)⁻¹ = B⁻¹A⁻¹ (reverse order).
- ●(Aᵀ)⁻¹ = (A⁻¹)ᵀ.
- ●det(A⁻¹) = 1/det(A).
Sample Examples
⚠️For educational and informational purposes only. Verify with a qualified professional.
🧮 Fascinating Math Facts
2×2: swap diagonal, negate off-diagonal, ÷det
(A⁻¹)⁻¹ = A
Key Takeaways
- • A⁻¹ exists if and only if det(A) ≠ 0. Singular matrices (det=0) have no inverse.
- • A·A⁻¹ = A⁻¹·A = I. The inverse "undoes" the linear transformation.
- • A⁻¹ = (1/det(A)) · adj(A), where adj(A) is the transpose of the cofactor matrix.
- • For 2×2: [a b; c d]⁻¹ = (1/(ad-bc)) · [d -b; -c a].
- • Only square matrices can have inverses.
Did You Know?
How Inverse Works
1. Compute determinant
Use cofactor expansion: det(A) = Σ (-1)^(i+j) a₁ⱼ M₁ⱼ. If det=0, stop — no inverse.
2. Build cofactor matrix
Cᵢⱼ = (-1)^(i+j) · det(Mᵢⱼ), where Mᵢⱼ is the minor (submatrix with row i, col j removed).
3. Transpose to get adjugate
adj(A) = Cᵀ. Swap rows and columns of the cofactor matrix.
4. Divide by determinant
A⁻¹ = (1/det(A)) · adj(A). Each entry of adj(A) is divided by det(A).
Expert Tips
Check det first
Always compute det(A) before building cofactors. If det=0, the matrix is singular and has no inverse.
Numerical stability
For large or ill-conditioned matrices, prefer LU decomposition or iterative solvers instead of explicit inverse.
Diagonal matrices
For diagonal D = diag(d₁,...,dₙ), D⁻¹ = diag(1/d₁,...,1/dₙ) if all dᵢ ≠ 0.
Verify A·A⁻¹ = I
Multiply A by A⁻¹ and check you get the identity matrix (within floating-point tolerance).
Comparison: Methods for Computing Inverse
| Method | Complexity | Best for |
|---|---|---|
| Adjugate (this calc) | O(n!) | Small n (≤5), educational |
| Gauss-Jordan | O(n³) | General purpose |
| LU decomposition | O(n³) | Multiple right-hand sides |
| Block inversion | O(n³) | Structured matrices |
Frequently Asked Questions
When does a matrix have an inverse?
A square matrix has an inverse if and only if its determinant is non-zero. Such matrices are called invertible or non-singular.
What is the adjugate matrix?
The adjugate (or classical adjoint) is the transpose of the cofactor matrix. A⁻¹ = adj(A) / det(A).
Why does det=0 mean no inverse?
If det(A)=0, then A maps to a lower-dimensional space. You cannot uniquely "undo" that — many inputs map to the same output.
What is the 2×2 inverse formula?
For [a b; c d], A⁻¹ = (1/(ad-bc)) · [d -b; -c a]. Swap diagonal elements, negate off-diagonal.
Can rectangular matrices have inverses?
No. Only square matrices can have a two-sided inverse. Rectangular matrices may have left or right pseudoinverses.
What is the condition number?
κ(A) = ||A||·||A⁻¹|| measures sensitivity. High κ means small changes in A cause large changes in A⁻¹.
Is (A⁻¹)⁻¹ = A?
Yes. The inverse of the inverse is the original matrix.
How is the inverse used to solve Ax=b?
If A is invertible: Ax=b ⇒ x = A⁻¹b. Multiply both sides by A⁻¹.
Quick Reference
Sources
- • Gilbert Strang, Linear Algebra and Its Applications, 4th ed.
- • Khan Academy — Matrix Inverses: khanacademy.org
- • MIT 18.06 Linear Algebra: ocw.mit.edu
- • Wolfram MathWorld — Matrix Inverse: mathworld.wolfram.com
- • 3Blue1Brown — Essence of Linear Algebra: 3blue1brown.com