Spanning Sets and Redundancy
What You'll Learn
You'll learn how to identify when vectors in a spanning set are redundant (removable without changing the span) or necessary (essential to maintain the full span).
The Core Idea
A spanning set is a collection of vectors whose linear combinations produce a particular space. But not all vectors in that set are equally important—some might be redundant.
A vector is redundant if it can be written as a linear combination of the other vectors in the set. Removing it doesn't shrink the span because everything it could contribute was already achievable through the remaining vectors.
A vector is necessary if removing it reduces the span—meaning there are vectors in the original span that can no longer be reached without it.
Everyday Analogy
Think of spanning sets like a team building something. If one team member only does tasks that others can already cover, they're redundant. If someone brings a unique skill no one else has, they're necessary.
Checking for Redundancy
To determine if vector v in set {v₁, v₂, ..., vₙ} is redundant:
- Can you write v as a linear combination of the others?
- If yes → redundant
- If no → necessary
Example: Consider {(1,0), (0,1), (2,3)} spanning R². The vector (2,3) = 2(1,0) + 3(0,1), so it's redundant. The first two vectors already span all of R².
But in {(1,0), (0,1)}, neither vector is redundant—each is needed to span the full plane.
Why This Matters
Minimal spanning sets (no redundancy) are called bases—the most efficient way to describe a space. Identifying redundancy helps you simplify problems and understand the true "dimension" of what you're working with.
Key Takeaway: A vector in a spanning set is redundant if it's a linear combination of the others; otherwise, it's necessary to maintain the full span.