also read 1C. Subspaces
Definition:
Assume that are subspaces of . Then we can define the sum as such: It is essentially a sum of one element from every subspace, including the 0 vector in every subspace which allow some elements to have no impact.
Examples
Lets do a proof:
Proof: Assume the set on the right where only the 3rd coordinate is 0 is
- Let and
- Then:
- This holds as the third coordinate is and all the other elements are in
- For any element we can write it as where and . Thus this holds.
Another example:
Proof: Let the set on the right be known as
- Let and
- This holds as the first two coordinates are the same and all coordinates are in
- Take any element
- This holds as and
Another Definition:
Let be subspaces of . is the smallest subspace of containing
Lets prove this in two parts:
- is a subspace of
- Identity:
- Set all . This is the zero vector as it has to exist in every
- Additive closure:
- Let and be elements in the sum for . both be elements inside the sum.
- Then
- Now this is clearly in the sum as each by its own additive closure.
- Scaler Multiplicative Closure
- Let be an element in the sum where every .
- Then for some we have which is by the second distributive property. As every through scaler multiplicative closure, we know the scaler multiple is also in the sum
- Identity:
- It is the smallest subspace of containing V_1,V_2,…,V_n
- This is clear, as the sum contains all individual elements of each by setting all the other summads to their respective 0. By additive closure the sum of all these elements also has to be in the subspace, thus it needs to include all elements of the sum.