Definition: subspace
We say that a subset of a vector space is a of if is a vector space under the inherited addition and scalar multiplication operations of .
Example :
Consider a plane in through the origin:

This equation can be expressed as the homogeneous system , or with the matrix . If and are both solutions to , then, by linearity of matrix multiplication, so is :
So is closed under addition and scalar multiplication. Additionally, contains the origin (which can be derived from the above by setting ). All other vector space requirements hold for because they hold for all vectors in .

Theorem (Subspace Theorem)
Let be a non-empty subset of a vector space . Then is a subspace if and only if for arbitrary in , and arbitrary constants .
Proof
One direction of this proof is easy: if is a subspace, then it is a vector space, and so by the additive closure and multiplicative closure properties of vector spaces, it has to be true that for all in and all constants constants .
The other direction is almost as easy: we need to show that if for all in and all constants , then is a vector space. That is, we need to show that the ten properties of vector spaces are satisfied. We know that the additive closure and multiplicative closure properties are satisfied. All of the other eight properties is true in because it is true in .
Note that the requirements of the subspace theorem are often referred to as "closure''.
We can use this theorem to check if a set is a vector space. That is, if we have some set of vectors that come from some bigger vector space , to check if itself forms a smaller vector space we need check only two things:
- If we add any two vectors in , do we end up with a vector in ?
- If we multiply any vector in by any constant, do we end up with a vector in ?
If the answer to both of these questions is yes, then is a vector space. If not, is not a vector space.