i.e. the collection of all possible sums of elements
Ex: Consider . Let and
Proposition: Let be subspaces of . Then is the smallest subspace of containing
Proof:
Sum is a subspace: Let . We need to prove . Since each is a subspace, there is a in each subspace.
Now we need to show is closed under addition. Let
Sum is the smallest subspace: Consider . We can express this as:Thus each contains each . Consider is a subspace containing . Since T is a subspace it is closed under addition and therefore contains all sums of elements from and
def (Direct Sum)
Suppose are subspaces of . Then the sum is called a direct sum if each can be written in a unique way as where . In this case the notation is
Theorem: Suppose are subspaces of . Then is a direct sum iff the only way to write as a sum of the form is by taking each
Proof:
[=>] If is a direct sum, since there is only way to write (by defn.)
[<=] Suppose the unique way to write 0 is . Suppose and
By our hypothesis: This is a contradiction.
Proposition: If and are subspaces of , then is a direct sum iff
Proof:
[=>] Suppose is a direct sum. Let . Then
These must be the same since it is a direct sum. Thus
[<=] Suppose . By the previous theorem it is sufficient to check if there is a unique way to write as a sum of elements of . Suppose if