A subspace of a vector space if is also a vector space (under the same operations of )
The question here is what properties of a subspace are guaranteed given that itself is a vector space? We expect many properties to carry over to . There are some things to consider:
The may not be in . Being a subspace doesn't guarantee it.
We need to be careful that for any . It's possible that we leave and enter the uncovered part of in .
Similarly, we may "leave" when doing scalar multiplication of .
Theorem
A subset of a vector space iff:
Additive Identity: .
Closed under vector addition:
Closed under scalar multiplication: .
Before we prove this, let's go through some examples:
Example
Let . Clearly . We claim that this subset is a subspace of .
Proof
Notice .
Let be arbitrary, so then we can say that , for . Notice that:
Let be arbitrary, and likewise for . We define the same as in (2). Notice that:
Therefore, is a subspace of .
☐
Example
Recall: is the vector space of matrices, with entries from . Recall that a matrix is symmetric if it is equal to it's transpose (); the entries are symmetrical about the diagonal. For example:
We claim that the set of symmetric matrices are a subspace of .
Proof
Let's just prove it for , as the process is largely the same for any .
Notice is the zero matrix in our subspace:
Let . Consider :
Let . Then:
☐
This is the vector space of functions from .
Proof
The zero function is in .
... (you can show the rest pretty easily).
☐
Constructions of New Subspaces from Old Ones
Let be a vector space. Let be subspaces of . A couple questions we should answer are:
Is a subspace of ?
Is a subspace of ?
Notice that clearly if (1) is true then (2) must be true, but let's take it one step at a time:
1: Is a subspace of ?
Let's look at an example to see what's going on here:
Example
Let and . These both are subspaces of , which itself is a vector space.
But notice that isn't closed under vector addition. If we take and , then:
So is not closed under vector addition, so is not a subspace of .
What is the smallest subspace of that contains both ? We know that it's possible that to not be a subspace, but what are the conditions that make it not so?
Define a set . This is essentially saying the set of vectors that are spanned by anything from and . You may note that the smallest subspace of that contains both and must also contain (by definition)
Is a subspace? Yes! Why? Let's prove it:
Proof
Let , . then . But look! and likewise so then since is defined as it is, by definition .
Let be arbitrary, and . Notice that . The former vector and so then by definition then .
☐
Note that is the smallest subspace containing both . We give some notation, namely as the sum of two subspaces :
The Sum of Vector Spaces
Suppose are subspaces of vector space . The sum of , denoted by , is the set of all possible sums of elements from :
And is the smallest subspace containing .
We use the words "smallest" to mean that there exists no strict subset from such that is a vector space while containing all of .