The next result states that the sums of subspaces is a subspace, and is in fact the smallest subspace containing all the summands (which means that every subspace containing all the summands also contains the sum).

Sum of subspaces if the smallest containing subspace

Suppose are subspaces of . Then is the smallest subspace of containing .

Proof.

First, we want to show that contains the additive identity and is closed under addition and scalar multiplication. This implies that is a subspace of .

Additive Identity/Zero Element: A subspace must contain the additive identity , and since each for is a subspace, they each contain the zero vector. Therefore, the sum also contains the zero vector because you can write as a sum of elements from the subspaces.

Closed under addition: If we take two elements from , say and , where and for each , then their sum is:

Since each is closed under addition, for each . Thus, the sum is still in , which proves that is closed under addition.

Closed under scalar multiplication: If you take an element and a scalar , then:

Since each is closed under scalar multiplication, for each . Therefore, , showing closure under scalar multiplication.

Thus, we have shown that is a subspace of .

Second, we want to argue that the subspaces are all contained in . To see this, we can note that an element of can be written as where all other components are zero. Hence, all are contained within .

Every subspace of containing contains (because subspaces must contain all finite sums of their elements). Thus is the smallest subspace of containing .

Lastly, we want to show that is the smallest subspace that contains all . Suppose there is a subspace that contains all . Since contains all the individual subspaces, it must also contain all infinite sums of elements from those subspaces:

But this is precisely what represents: the set of all infinite sums of elements from the subspaces . Thus, any subspace that contains must also contain . This makes the smallest subspace that contains all of .