Properties and Theorems on Independence
What you'll learn: You'll discover two powerful properties that make checking linear independence easier: any subset of an independent set is also independent, and any superset of a dependent set is also dependent.
The Core Idea
When working with linear independence, you don't always need to check every vector individually. Two key theorems provide shortcuts:
Theorem 1: Subsets of Independent Sets
If a set of vectors is linearly independent, then any subset of those vectors is also linearly independent.
Think of it like this: if no vector in your group can be written as a combination of the others, then removing some vectors won't suddenly make the remaining ones dependent. You're only taking away resources; you're not adding any redundancy.
Theorem 2: Supersets of Dependent Sets
If a set of vectors is linearly dependent, then any larger set containing those vectors is also linearly dependent.
Here's the intuition: if you already have redundancy (one vector expressible as a combination of others), adding more vectors doesn't fix that problem—the redundancy remains. You can't make a dependent set independent just by throwing more vectors into the mix.
Practical Use
These theorems save time. Suppose you know that three vectors {v₁, v₂, v₃} are independent. Then you immediately know {v₁, v₂} is independent without recalculating. Conversely, if {u₁, u₂} are dependent, then {u₁, u₂, u₃, u₄} must also be dependent—no need to test!
This is especially useful when building or verifying bases: if you're adding vectors one by one to form an independent set and suddenly introduce dependence, you know every subsequent larger set will also be dependent.
Key Takeaway: Independence of a set guarantees independence of all subsets; dependence of a set guarantees dependence of all supersets—powerful shortcuts for analysis without redundant computation.