Applications to System Solvability
You'll learn: How to use matrix rank to determine whether a linear system has solutions and whether those solutions are unique.
The Core Idea
When you have a linear system Ax = b, the rank of matrix A and the augmented matrix [A | b] tell you everything about solvability. Think of rank as measuring "degrees of freedom" or "independent constraints" in your system.
Here's the decision tree:
Does a solution exist?
A system Ax = b has at least one solution if and only if:
rank(A) = rank([A | b])
If rank increases when you append b, it means b lies outside the column space of A—the system is inconsistent.
Is the solution unique?
If solutions exist, they're unique when:
rank(A) = number of variables (columns of A)
This means A has full column rank—no free variables exist. Every variable is determined by a pivot position.
Putting It Together
- Unique solution: rank(A) = rank([A | b]) = n (number of variables)
- Infinitely many solutions: rank(A) = rank([A | b]) < n (free variables exist)
- No solution: rank(A) < rank([A | b]) (inconsistent system)
Why This Works
The fundamental subspaces explain it: b must lie in the column space of A for solutions to exist. The null space of A determines how many "directions" of freedom your solutions have. If the null space contains only the zero vector (rank = n), the solution is unique.
Key Takeaway: Rank comparison tells the complete story: compare rank(A) and rank([A | b]) to check existence, then check if rank(A) equals the number of variables to determine uniqueness.