Span as a Subspace
You'll learn: Why the span of any set of vectors always forms a subspace of the containing vector space.
The Core Idea
You already know that the span of vectors is the set of all possible linear combinations you can make from them. You've also learned what a subspace is: a subset of a vector space that is itself a vector space (closed under addition and scalar multiplication, and contains the zero vector).
Now comes the beautiful connection: the span of any set of vectors automatically satisfies all the requirements to be a subspace. This isn't a coincidence—it's a fundamental theorem.
The Proof (Three Steps)
To prove span(S) is a subspace, we check the three subspace conditions:
1. Contains the zero vector:
Take all scalars to be zero in the linear combination. If S = {v₁, v₂, ..., vₖ}, then 0·v₁ + 0·v₂ + ... + 0·vₖ = 0. So 0 ∈ span(S). ✓
2. Closed under addition:
Suppose u and w are both in span(S). Then:
- u = c₁v₁ + c₂v₂ + ... + cₖvₖ
- w = d₁v₁ + d₂v₂ + ... + dₖvₖ
Their sum is: u + w = (c₁ + d₁)v₁ + (c₂ + d₂)v₂ + ... + (cₖ + dₖ)vₖ
This is still a linear combination of the same vectors, so u + w ∈ span(S). ✓
3. Closed under scalar multiplication:
If u = c₁v₁ + c₂v₂ + ... + cₖvₖ is in span(S), and α is any scalar, then:
αu = (αc₁)v₁ + (αc₂)v₂ + ... + (αcₖ)vₖ
Still a linear combination, so αu ∈ span(S). ✓
Why It Matters
This theorem tells us that every spanning set generates a valid subspace. You can freely work with spans knowing they have all the nice properties of vector spaces.
Key Takeaway: The span of any set of vectors is always a subspace because it's closed under addition, scalar multiplication, and contains the zero vector by construction.