Suppose that you have two finite sets and and a function . If you know that is onto then you get some information about and : you know that must be at least as large as .
But an arbitrary function between two vector spaces doesn’t necessarily give you any information about their relationship as vector spaces. To get such information, we need to restrict to functions that respect the vector space structure — that is, the scalar multiplication and the vector addition.
Functions with this property, which we’re going to define shortly, are called linear maps. They allow us to do something similar to the finite set example above: for example, if you have a surjective linear map from a vector space to another vector space , it is true that .
Let and be vector spaces over the same field . A function is called a linear map or a linear transformation if
for all and all we have , and
for all we have .
Point 1 is what it means to say that respects scalar multiplication and point 2 is what it means to say that respects vector addition.
This concept is so common that it has many names. For us,
is a linear map
is a linear function
is a linear transformation
is linear
all mean exactly the same thing, namely that satisfies Definition 4.13.1.
For any vector space , the identity map and the zero map given by for all are linear.
Let be a matrix with entries in a field . Then defined by is linear.
is not linear.
is linear.
given by is linear.
Let’s look at why some of these are true, starting with example 2. To show that is a linear map we have to check the two parts of the definition of being a linear map. Both of these are going to follow from properties of matrix multiplication and addition that you learned in the previous section.
Let and . Then
matrix multiplication properties | ||||
Let . Then
matrix multiplication properties | ||||
The properties of matrix multiplication used were proved in Proposition 3.4.1.
Similarly, the fact that the differentiation map of example 5 is linear follows from standard properties of derivatives: you know, for example, that for any two functions (not just polynomials) and we have , which shows that satisfies the second part of the linearity definition.
As an example where the linearity of a map doesn’t just come from standard facts you already know, consider
To show is linear we have to show that it has properties 1 and 2 from the definition.
Here are some examples of things which are not linear maps:
isn’t linear. It doesn’t satisfy either linearity property. , and .
. Again it doesn’t satisfy either part of the definition - you should check that.