When Is the Union of Two Subspaces a Subspace?
At a glance
- 1. Check containment
Determine whether every vector in one subspace also belongs to the other.
- 2. Use the theorem
The union is a subspace exactly when one of the two subspaces is contained in the other.
- 3. Test a failure
If neither contains the other, choose one vector from each difference; their sum lies in neither subspace.
The union of two subspaces collects every vector that belongs to at least one of them. Unlike their intersection or their sum, that union is not automatically a subspace. The key test is whether one subspace is already contained in the other.
The criterion
Let and be subspaces of the same vector space . Then
If one is contained in the other, their union is simply the larger subspace. If neither is contained in the other, the union fails the subspace test: it is not closed under addition.
Why containment is enough
Suppose . Every vector in is already in , so adding to contributes no new vectors:
Since is a subspace, the union is a subspace. The same argument applies if ; then .
Why neither containment makes the union fail
Suppose neither subspace contains the other. Then there are vectors
Consider their sum . It cannot belong to : if it did, then would also belong to , because and are in and a subspace is closed under subtraction. That contradicts .
Likewise, cannot belong to . If it did, then would belong to , contradicting . Thus is in neither subspace, so it is not in .
The union contains both and but not their sum. Therefore it is not closed under addition and cannot be a subspace.
Worked example: the coordinate axes
In , let
Here is the horizontal axis and is the vertical axis. Neither contains the other: but not , while but not . Their sum is , which lies on neither axis. So is not a subspace.
For comparison, let be the horizontal axis and let . Since , their union is , which is a subspace.
Common mistakes
- Assuming a union behaves like a sum. The union means “in or in .” The sum consists of vectors with and . The sum is always a subspace; the union usually is not.
- Checking only scalar multiplication. A union can be closed under scalar multiplication and still fail to be a subspace because it is not closed under addition. The coordinate axes example shows this: scaling a vector on either axis keeps it on that axis, but adding and leaves the union.
- Thinking the intersection must be trivial. The criterion does not depend on whether is just the zero vector. The question is whether one entire subspace is contained in the other.
- Comparing sets from different ambient spaces. The theorem concerns subspaces of the same vector space, so the union is being tested as a subset of that common space.
A quick way to decide
To determine whether a particular union is a subspace, first check containment. If or , the union is the larger subspace. Otherwise, find and ; the proof above guarantees that is outside the union.
References
- Linear Algebra Done Right, Sheldon Axler
Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.