Linear Independence and the Rank of a Matrix
What You'll Learn
You'll learn how the rank of a matrix directly tells you the maximum number of linearly independent columns (or rows) it contains.
The Core Connection
When you test linear independence using a matrix (as we saw in lesson 2069), you arrange vectors as columns and row-reduce. The rank of that matrix—the number of pivot positions (leading 1's in row echelon form)—tells you exactly how many vectors in your set are linearly independent.
Here's the key insight: the rank equals the size of the largest possible linearly independent subset you can choose from your columns.
Why This Works
Think of rank as counting "degrees of freedom" or "truly distinct directions" in your collection of vectors. Each pivot corresponds to one independent vector. Non-pivot columns? Those are redundant—they can be written as linear combinations of the pivot columns.
Example: Suppose you have four vectors forming a 3×4 matrix, and after row reduction you find rank = 2. This means:
- Only 2 vectors are genuinely independent
- The other 2 are linear combinations of those 2
- Any maximal independent set contains exactly 2 vectors
- Those 2 pivot columns form one such maximal set
Finding Maximal Independent Sets
The pivot columns in the original matrix (before row reduction) form a maximal linearly independent set. You identify them by noting which columns contain pivots in the reduced form, then going back to select those same columns from the original matrix.
This gives you a practical recipe: want to extract a basis or independent subset from redundant vectors? Row-reduce, find the pivots, and pick the corresponding original vectors.
Key Takeaway: The rank of a matrix equals the maximum number of linearly independent columns, and the pivot columns identify a maximal independent set.