Subspace — Definition & Examples
A subspace is a smaller vector space sitting inside a larger one. It is a collection of vectors that contains the zero vector and stays closed when you add vectors or scale them. Familiar examples are a line or a plane through the origin in .
Let be a vector space over a field (usually ). A subset is a (linear) subspace of if is itself a vector space under the addition and scalar multiplication inherited from . Equivalently, is a subspace if and only if (1) , (2) for all , and (3) for all and all scalars .
Key Formula
Where:
- = The subset being tested, contained in a vector space V
- = The zero vector of V
- = Arbitrary vectors in W
- = Any real scalar
How It Works
To decide whether a set is a subspace, you run the subspace test. First, check that the zero vector is in . If it is not, you can stop, because is not a subspace. If it is, take two arbitrary vectors in and show that their sum is also in . Then show that any scalar multiple of an arbitrary vector in is in . You do not need to recheck the other vector space axioms, such as associativity, because inherits them from .
Worked Example
Problem: Show that is a subspace of . Then confirm the result with the vectors and .
Step 1: Check the zero vector. Substitute into the defining equation. The equation holds, so .
Step 2: Check closure under addition. Let and be arbitrary vectors in . Regroup the left side for . Each group equals 0, so .
Step 3: Check closure under scalar multiplication. For any scalar , factor out . The result is , so .
Step 4: Confirm with numbers. Both and satisfy the equation. Their sum and the multiple satisfy it as well. These checks illustrate the proof but do not replace it.
Answer: contains the zero vector and is closed under addition and scalar multiplication, so is a subspace of . Geometrically, it is a plane through the origin.
Another Example
Problem: Is the first quadrant a subspace of ?
Step 1: The zero vector satisfies both inequalities, so .
Step 2: Adding two vectors with nonnegative entries gives nonnegative entries, so is closed under addition.
Step 3: Test scalar multiplication with and . The result has negative entries, so it lies outside .
Answer: No. fails closure under scalar multiplication, so it is not a subspace.
Why It Matters
Subspaces, such as the column space and null space of a matrix, are central ideas in a first linear algebra course. The column space, null space, row space, and eigenspaces of a matrix are all subspaces, and the rank-nullity theorem relates their dimensions. In data science, principal component analysis projects data onto a low-dimensional subspace that captures most of the variation.
Common Mistakes
Mistake: Calling a line or plane a subspace even when it does not pass through the origin, such as the line .
Correction: Every subspace must contain the zero vector. Because does not satisfy , that line is not a subspace. Check the zero vector first, since it is the fastest way to rule a set out.
Mistake: Checking closure with a few specific vectors and concluding the set is a subspace.
Correction: Numerical examples can disprove closure, but they cannot prove it. To prove closure, use arbitrary vectors such as and an arbitrary scalar , as in Steps 2 and 3.
