Direct Sums

External direct sums

Definition 1.

Let and be two vector spaces. Define the external direct sum like so:

We define the following operations, which make a vector space.

Notice that contains a copy of and , i.e. there exists an injection from and into . and are NOT subspaces of .

Theorem 2(Lemma).

.

Proof:
Let a basis for be and a basis for be .
Then is a basis for . ❏

Internal Direct Sum

Definition 3.

Suppose are subspaces of . Define the internal direct sum of these subspaces like so:

The internal direct sum of is the smallest subspace of containing every .

Definition 4.

Call linearly independent if

Relation between external and internal direct sums

For , define

Notice that is linear and that .

is the set . So, implies (say). As subspaces are closed under scalar multiplication, . Thus,

We may define such that . We can see that is a linear map. In fact, since is also bijective, is an isomorphism!

Theorem 5.

.

Proof
Using the rank nullity theorem, we have

Alternate Proof (Artin)
Let a basis of be .
We may extend this to a basis of by appending .
We may also extend it to a basis of by appending .
Then, the claimed formula is

So, we have to show that is a basis of . Clearly, spans since spans and spans . Also, and are linearly independent sets, since they are bases. So, it only remains to show that is linearly independent. To this end, consider a linear combination of vectors in which is .

Clearly, and . Thus,

Similarly, for all . Thus, is linearly independent. ❏

!!!! this seems sus. Take 3 lines in .

Theorem 6(Corollary).

A more general statement is:

We can see that

Remark

For ,

For ,

Note that the backwards implication is not true for .

Warning

Almost all the literature I could find has these completely different definitions for the “sum of subspaces” and “direct sums”:

Definition 7.

Suppose are subspaces of . The sum of , denoted , is the set of all possible sums of elements of .

Definition 8.

The sum is called a direct sum is each element of can be written in only one way as a sum , where each is in . If is a direct sum, then it is denoted by .


Determinants

A determinant is a function which satisfies the following properties:

  1. A row operation () on the matrix does not change the determinant
  2. Scaling a row scales the determinant
  3. Swapping rows negates the determinant (antisymmetry) (can be derived from 1 and 2)

Derivation of (3) from (1) and (2):