Suppose are subspaces of . The sum of , denoted by , is the set of all possible sums of elements from . More precisely:

Sums of subspaces in the theory of vector spaces are analogous to unions of subsets in set theory. Given two subspaces of a vector space, the smallest subspace containing them is their sum. Analogously, given two subsets of a set, the smallest subset containing them is their union.

Basic Examples

Let’s look at some examples of sums of subspaces.

Example: Sum of axis subspaces in .

Suppose are subspaces of , is the subspace of all vectors on the -axis, and is the subspace of all vectors on the -axis, . This would mean contains vectors like , and contains vectors like .

Then, the sum is the set of all possible sum combinations of a vector from and a vector from . In other words, for any and , where can be any real numbers, their sum is

This means that every vector in has the form , where . Thus, we actually have

Example: Sum of subspaces for

Suppose is the set of all elements of whose second and third coordinates equal , and is the set of all elements of whose first and third coordinates equal :

Then

Example: Sum of subspaces of

Suppose

We could say that:

  • is the set of elements of whose first two coordinates equal each other and whose third and fourth coordinates equal each other.
  • is the set of elements of whose first three coordinates equal each other.

To find a description of , consider a typical element of and a typical element of , where . We have

which shows that every element of has its first two coordinates equal to each other. Thus

where the is the symbol for “is a subset of”.

To prove the inclusion in the other direction, suppose . Then

where the first vector on the right is in and the second vector on the right is in . Thus, , showing that the inclusion holds in the other direction:

Hence, we have:

which shows that is the set of elements of whose first two coordinates equal each other.

Sum of subspaces is the smallest containing subspace

The next result states that the sum 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 .