direct sum

def (sum of subspace)

Let u1um be subspaces of V. The sum is defined as

u1++um={u1++um|uiUii[1,m]}

i.e. the collection of all possible sums of elements u1um

Ex: Consider V=R2. Let U1={(x,0)|xR} and U2={(0,y)|yR}

U1+U2={(x,0)+(0,y)|x,yR}={(x,y)|x,yR}=R2
Proposition: Let U1Um be subspaces of V. Then U1++Um is the smallest subspace of V containing U1Um

Proof:

  1. Sum is a subspace: Let S=U1++Um. We need to prove 0S. Since each Ui is a subspace, there is a 0 in each subspace.
0=0(U1)+0(U2)++0(Um)S

Now we need to show S is closed under addition. Let u,vS

u=u1++umv=v1++vmu+v=(u1+v1)++(um+vm)S
  1. Sum is the smallest subspace: Consider uiUi. We can express this as:ui=0+0++ui+0++0=0SThus each UiSS contains each ui. Consider T is a subspace containing U1Um. Since T is a subspace it is closed under addition and therefore contains all sums of elements from u1Um and ST

def (Direct Sum)

Suppose U1Um are subspaces of V. Then the sum U1Um is called a direct sum if each vu1++um can be written in a unique way as v=u1++um where uiUi. In this case the notation is U1Um

Theorem: Suppose U1Um are subspaces of V. Then U1++Um is a direct sum iff the only way to write 0 as a sum of the form u1++um is by taking each ui=0

Proof:

[=>] If u1++um is a direct sum, since 0u1++um there is only way to write 0=u1++um (by defn.)

[<=] Suppose the unique way to write 0 is 0=0+0++0. Suppose vU1++Um and vi,wiUi

v=v1++vmv=u1++umvv=(v1u1)++(vmum)0=(v1u1)++(vmum)

By our hypothesis: viui=0vi=ui This is a contradiction.

Proposition: If U and W are subspaces of V, then U+W is a direct sum iff UW={0}

Proof:

[=>] Suppose U+W is a direct sum. Let vUW. Then

v=v(U)+0(W)=0(U)+v(W)

These must be the same since it is a direct sum. Thus v=0UW={0}

[<=] Suppose UW={0}. By the previous theorem it is sufficient to check if there is a unique way to write 0 as a sum of elements of U,W. Suppose if uU,wW

0=u+wu(U)=w(W)UW

Which is by our hypothesis i.e. 0=u+wu=w=0.