The Invertible Matrix Theorem
You'll learn: How several seemingly different properties of a matrix are all secretly saying the same thing—that it's invertible.
The Big Picture
The Invertible Matrix Theorem is a powerful collection of equivalent statements about square matrices. If any one of these conditions is true, then all of them are true. It's like discovering that "the door is unlocked," "you can walk through," and "the doorknob turns freely" all describe the same situation from different angles.
For a square n×n matrix A, the following are equivalent:
- A is invertible (has an inverse A⁻¹)
- The columns of A are linearly independent
- The columns of A span ℝⁿ
- The system Ax = b has a unique solution for every b in ℝⁿ
- The rank of A equals n (full rank)
- The null space of A contains only the zero vector
Why This Matters
Think of invertibility as a "health check" for your matrix. Any one test confirms full health:
- Linear independence means no column is redundant—each adds new information
- Spanning ℝⁿ means the columns can build any vector in n-dimensional space
- Unique solutions means the transformation A is reversible—you can always work backward
These aren't separate lucky coincidences. They're mathematically locked together. Testing one confirms them all.
Example Connection
If columns are linearly independent, there's no redundancy → rank = n → the null space shrinks to just zero → every Ax = b has exactly one solution → A must be invertible.
Key Takeaway: The Invertible Matrix Theorem unifies linear independence, span, rank, null space, and solution uniqueness into a single yes/no question: "Is this matrix invertible?"