What is a Subspace?
A subspace is a subset of a vector space that is itself a vector space under the same operations. Most action in linear algebra—solution sets, spans, kernels—happens inside subspaces.
Checking every axiom is tedious. Instead, use the Subspace Test: a nonempty subset is a subspace if it is closed under two operations:
| Operation | Rule | Meaning |
|---|---|---|
| Addition | If , then | Adding vectors stays inside |
| Scaling | If , is scalar, then | Scaling vectors stays inside |
Setting reveals a vital shortcut: every subspace must contain the zero vector (). Any subset missing fails instantly.
Geometry of Subspaces
In , the only possible subspaces are strict geometric categories:
| Subspace Type | Description |
|---|---|
| Zero subspace | The origin point only () |
| Lines | Any line through the origin |
| Planes | Any plane through the origin |
| Full space | All of |
Common pitfall: A line or plane that is offset from the origin is not a subspace. It fails because it lacks , and scaling any of its points by lands at the origin, off the line.
Subspaces also include homogeneous solution sets (the null space), spans, and linear map ranges.