We recall that a linear map (or homomorphism) is a structure-preserving map of a -vector space into a -vector space . That is, for the map , the following two conditions must hold:
must be additive, i.e., for we have that:
must be homogeneous, i.e., for we have that: .
So for a linear map it doesn't matter if we first do the addition or scalar multiplication in the vector space and then map the sum into the vector space , or first map the vectors into the vector space and perform the addition or scalar multiplication there, using the images of the map.
The proof that a map is linear can be done according to the following structure.
First, we assume that a map is given between vector spaces. That is, and are -vector spaces and is well-defined.
Then for the linearity of we have to show:
additivity:
homogeneity:
Exercise (Introductory example)
We consider the following map
and show that it is linear.
Proof (Introductory example)
First, and are vector spaces over the field . Moreover, the map is well-defined.
Next, we consider the space of all sequences of real numbers. This space is infinite-dimensional, because there are not finitely many sequences generating this sequence space. But it is a vector space, as we have shown in the chapter about sequence spaces.
Exercise (Sequence space)
Let be the -vector space of all real-valued sequences. Show that the map
is linear.
How to get to the proof? (Sequence space)
To show linearity, two properties need to be checked:
is additive: for all
is homogeneous: for all and
The vectors and are sequences of real numbers, i.e. they are of the form
and with for all .
In this chapter, we deal with somewhat more abstract vectors. Let be arbitrary sets; a field and a -vector space. We now consider the set of all maps/ functions of the set into the vector space and denote this set with . Furthermore, we also consider the set of all maps of the set into the vector space and denote this set with . The addition of two maps is defined for by
Die scalar multiplication is defined for via
Analogously, we define addition scalar multiplication for .
Exercise (The set is a -vector space)
Show that is a -vector space.
How to get to the proof? (The set is a -vector space)
Simply check the vector space axioms.
We now show that the precomposition with a mapping is a linear map from to .
Exercise (The precomposition with a map is linear.)
Let be a vector space, let be sets, and let or be the vector space of functions from or to . Let be arbitrary but fixed. We consider the mapping
Show that is linear.
It is important that you exactly follow the definitions. Note that is a map that assigns to every map of to a map of to . These maps, which are elements of and respectively, need not themselves be linear, since there is no vector space structure on the sets and .
Summary of proof (The precomposition with a map is linear.)
In order to prove the linearity of , we need to check the two properties again:
is additive: for all
is homogeneous: for all and
So at both points an equivalence of maps is to be shown. For this we evaluate the maps at every m element .
Proof (The precomposition with a map is linear.)
Let .
Proof step: additivity
For all we have that
Thus we have shown , i.e., is additive.
Let and .
Proof step: homogeneity
For all we have that
Thus we have shown , i.e., is homogeneous.
Now, additivity and homogeneity of implies that is a linear map.