Problem 1
For each of the following subsets of , determine whether it is a subspace of .
- (a)
- (b)
- (c)
- (d)
1(a) The zero vector in is . Since we have
this zero vector also exists in the subset.
For addition, suppose we have such that and . Then, let’s say we have:
For closure under addition, we need to have . So we check:
Thus, satisfies the condition for belonging in , so we have closure under addition.
For scalar multiplication, let’s say we have and such that:
To check whether for closure of scalar multiplication, we check
Thus, satisfies the condition for belonging in , so we have closure under scalar multiplication as well.
1(b) This subset is not a subspace because the zero vector of is not in it:
1(c) The zero vector exists in the subspace, since has . However, the additive identity is not valid since for some , we do not always have
For example, and both belong in the subset, but their sum does not.
1(d) The zero vector/additive identity for exists in the subspace, since satisfies with .
Closure under addition holds. For some we have
then, if , which we can show with
For scalar multiplication, we have
which satisfies the closure property because
Problem 2
Verify all assertions about subspaces in Example 1.35.
This is done in Examples.
Problem 3
Show that the set of differentiable real-valued functions on the interval such that is a subspace of .
is the set of functions from to . The zero function in is , which is differentiable on . We also have:
Thus, the zero function in is contained in .
Next, for addition, if , then and are differentiable real-valued functions. So, must also be differentiable. Then:
from which we can conclude that is closed under addition.
For scalar multiplication, if for any , then is differentiable real-valued functions. So, is differentiable too. Moreover,
This shows is closed under scalar multiplication.
Thus, we’ve shown that shares the same zero function/additive identity, is closed under addition, and is closed under scalar multiplication.
Problem 4
Suppose . Show that the set of continuous real-valued functions on the interval such that is a subspace of if and only if .
Let us call the set . If is a subspace of , then for any , we have . For to be a subspace, any , where , must also be in . Hence
which only happens if .
If , then for any and , we have
which satisfies closure under addition, . Note that is a continuous real-valued function since and are.
Similarly,
and is a continuous real-valued function because is. Thus, we have closure under multiplication, .
Finally, we note the constant function (additive identity) in is also the additive identity in . Hence, is a subspace of .
Problem 5
Is a subspace of ?
is not a subspace of because it does not satisfy closure under scalar multiplication. Specifically, we need to have for , .
- Recall that for closure of multiplication where is a subspace of , is a scalar from the field over which is defined.
This is clearly not true:
Hence, is not a subspace of the complex vector space .
Problem 6
- (a) Is a subspace of ?
- (b) Is a subspace of ?
6(a) The additive identity in is . This same additive identity exists in .
For elements , we have:
For closure under addition, we need to have
or
This is true, since the and is only true if and (for real numbers). Thus, closure under addition is satisfied.
Closure under multiplication is easy to show:
and we have
Thus, we’ve shown that is indeed a subspace of .
6(b) We can show that the set is not a subspace of by providing a counterexample. We have two elements in the subset, and :
Adding these two elements shows that the set is not closed under addition:
Problem 7
Prove or give a counterexample: If is a nonempty subset of such that is closed under addition and under taking additive inverses (meaning whenever ), then is a subspace of .
Let’s say we have . is not empty.
If we have and , then . The sums of each pair are integers, and , so we have
which means that is closed under addition.
Similarly, since , is closed under additive inverses.
However, is not closed under scalar multiplication if we have fractional scalars. For example, while , we do not have .
Therefore, is not a subspace of .
Problem 8
Give an example of a nonempty subset of such that is closed under scalar multiplication, but is not a subspace of .
An example nonempty subset is
This is closed under scalar multiplication because for some elements and a scalar , we have
where we have some .
However, is not closed under addition because
Hence, is not a subspace of .
Problem 9
A function is called periodic if there exists a positive number such that for all . Is the set of periodic functions from to a subspace of ? Explain.
Consider two periodic functions from to :
Then, for this to be a subspace, it needs to be closed under addition, such that the sum of the above functions
is also periodic.
For to be periodic, we need to have some such that for all . Then, we must have
This means we must have:
which implies that and . We know from that we must have where . However, implies that , where . Hence,
which is not possible since .
Thus, this cannot be a subspace since our contradiction above shows it is not closed under addition.
Problem 10
Suppose and are subspace of . Prove that the intersection is a subspace of .
Additive identity: Since and are subspaces of , they both contain the zero vector. Then, the zero vector must also be in the intersection .
Closure under addition: Let . Then, this means that . Since is a subspace, it is closed under addition, so . Since is also a subspace, . Since is in both and , we have
which shows that is closed under addition.
Closure under scalar multiplication: Let and . We know that and . Since and are both subspaces, they are closed under scalar multiplication, such that
Thus, we also have . Therefore, is closed under scalar multiplication.
Problem 11
Prove that the intersection of every collection of subspaces of is a subspace of .
This seems to be a trivial extension of Problem 10 above. The idea is just that if a given element exists in the intersection of a collection, it must also exist in each of the subspaces in the collection. Conversely, a sum of two such elements must also exist in each of the subspaces for each of them to be closed under addition; since they exist in every subspace in the collection, they’re in the intersection. Same goes for scalar multiplication, and all of the subspaces must share the same additive identity since they are all subspaces of .
Problem 12
Prove that the union of two subspaces of is only a subspace if and only if one of the subspace is contained in the other.
Suppose and are two subspace of and is a subspace of .
Let’s say that is not a subset of and is not a subset of . Consider elements and . For to be closed under addition, their sum must belong to . Hence, we must have or .
If , then , leading to a contradiction because we defined .
If , then , leading to a contradiction because we defined .
Therefore, if is a subspace of , we must have or .
Problem 13
Prove that the union of three subspaces of is a subspace of if and only if one of the subspaces contains the other two.
Problem 14
Suppose
Describe using symbols, also give a description of that uses no symbols.
Symbolic: To find , we consider all possible sums of elements from and . Let and , so:
Adding and :
Let and . Then we have:
Therefore, every vector in can be expressed as:
In set form:
Without symbols: is the set of all vectors in whose third element is twice the first coordinate. This means that is a plane in defined by .
Problem 15
Suppose is a subspace of . What is ?
is the set of all possible sums of two elements from . Since is a subspace of another space, it is closed under addition, the sum of two elements from should still be in . Thus, .
Problem 16
Is the operation of addition on the subspaces of commutative? In other words, if and are subspace of , is ?
The addition on the subspaces is commutative because the addition of individual elements is commutative as well. For and , we have
because addition in is commutative. This implies that , and . Hence, .
Problem 17
Is the operation of addition on the subspaces of associative? In other words, if are subspaces of is
This is similar to the question above. If , we have:
since , which is a vector space (must then satisfy associative addition).
Problem 18
Does the operation of addition on the subspaces of have an additive identity? Which subspaces have additive inverses?
If some subspace is an additive identity, for for any subspaces of , we need to have . This means ; the only possibility is .
Suppose some subspace of of has additive inverses, then there exists some of such that . This can only happen when since .
Problem 19
Prove or give a counterexample: If are subspaces of such that
then .
A counterexample: Let , and . Then:
but .
Problem 20
Suppose
Find a subspace of of such that .
A possible solution is:
This can be checked by considering the condition for direct sums of 2 subspaces, which is that if is a direct sum, we must have . This is indeed true, as there are no elements in other than that have the same 1st and 2nd coordinate, and the same 3rd and 4th coordinate.
Problem 21
Suppose
Find a subspace of such that .
only allows us to choose two coordinates arbitrarily; the rest of the coordinates depend on the first two. Thus, we take in which the first two coordinates are zero and the last three are variables:
We can show that by considering that, for some , it must have because this is true for all elements in . Following this fact, for to be in , it must have
Hence, we must have and .
Problem 22
Suppose
Find three subspace of , none of which equal , such that .
We can have:
Problem 23
Prove or give a counterexample: If are subspaces of such that
then .
A counterexample: Let , , , and . Then, we have
however .
Problem 24
A function is called even if
for all . A function is called odd if
for all . Let denote the set of real-valued even functions on and let denote the set of real-valued odd functions on . Show that .
Given any (the set of functions from to ), define an even part and an odd part
for all . Then, .
For all , we have
and
hence and .
We also have
so . By definition, , so . Since we can choose arbitrarily from , and we have shown that , it follows that every function in is in , so we have .
Then, to show , we need to show that . Let . Then, we must have since , and since for all . If we sum up and , we get for all . Hence, , which implies .