Problem 1
Suppose . Define by
Show that is linear if and only if .
Recall that a linear map have additivity and homogeneity. Let’s say we have where .
Then, for additivity, we would need
The left side gives us
The right side gives us:
For the two of them to be equal
and
For this to be true, will also need . Thus, additivity needs .
To confirm homogeneity, we compare and for all and .
and
Thus, for , we must have
and
which also requires if .
Thus, for both additivity and homogeneity, we need .
Problem 2
Suppose . Define by
Show that is linear if and only if .
Let us have two polynomials . For additivity, we need to have
The left side gives:
The right side gives:
For the left and right sides to be equal, we need
We also need
We can also check homogeneity
The left side gives:
The right side gives:
Then, we have
so the only solution is for all is .
And we also have
which is also only true for all is .
Problem 3
Suppose that . Show that there exist scalars for and such that
for every .
Note that this problem shows the 2nd last example from Linear Map.
We first determine using its action on the standard basis vectors of , denoted as , where is the vector with a in the -th position and elsewhere. For each , the transformation of by is a vector in , denoted as
where for each .
We can write an arbitrary vector as a linear combination of the basis vectors :
By linearity of , we have
Substituting , we have
If we consider the -th component of , we have
Thus, we have
We can look at an example of so that takes vectors from of the form and maps them to vectors from of the form .
We’ll define by specifying how it acts on the basis standard vectors of , , , and :
For a general vector , we can have:
Now we can compute the two components corresponding to
- First component:
- Second component:
Here, the scalars are
So:
Problem 4
Suppose and is a list of vectors in such that is a linearly independent list in . Prove that is linearly independent.
If are not linearly independent, there exist some that are not all , such that
Applying the linear map to both sides:
Note that because linear maps take 0 to 0.
The last line implies that is not linearly independent, since we are using some that are not all . This presents a contradiction. Thus, must be linearly independent.
This basically says that, by the linearity of the transformation , if are linearly independent, so must and vice versa.
Problem 5
Prove that is a vector space.
Recall that for a vector space, we need to show a zero element, closure under addition, and closure under scalar multiplication. Specifically, for these three operations, we verify that the result is still a linear map (for example, the addition of two linear maps must still be a linear map).
We can define a zero map by:
where is the zero vector in . The zero map is linear because is satisfies:
- Additivity:
- Homogeneity:
For closure under addition, let . Define by:
Checking the linearity of :
- Additivity:
- Homogeneity:
Therefore, , showing closure under addition.
For closure under scalar multiplication, let , and define by:
Checking for linearity:
- Additivity:
- Homogeneity:
Thus, , confirming closure under scalar multiplication.
Since we’ve shown zero element, closure under addition, and closure under scalar multiplication, we’ve shown that is a vector space.
Problem 6
Prove that multiplication of linear maps has the associative, identity, and distributive properties.
Associativity:
Identity:
and
Distributive properties:
and
Problem 7
Show that every linear map from a one-dimensional vector space to itself is multiplication by some scalar. More precisely, prove that if and , then there exists such that for all .
Since , there is some that is a basis of . Because , there exists some such that .
Since is a basis every , there exists some such that . This implies that
Problem 8
Give an example of a function such that
for all and all but is not linear.
For , let
Clearly, we have homogeneity in for every and .
But, there obviously exists where , because
Thus, is not linear.
Problem 8 and 9 show that neither homogeneity nor additivity alone is enough to imply that a function is a linear map.
Problem 9
Give an example of a function such that
for all but is not linear. (Here is thought of as a complex vector space.)
Let . For every , we define , so the function just returns the real part.
Hence, , we have
and
So we have .
However, and . Then, we have
Thus, in this case, for some and , we don’t have . Therefore, is not linear.
Problem 10
Prove or give a counterexample: If and is defined by , then is a linear map.
- This differs from the composition example in Examples because the order of functions in the composition is different.
For additivity, we need . Expanding these, we have:
As a counterexample, let . Then:
However,
For homogeneity, we need . Expanding these, we have
As a counterexample, let . Then:
However:
Problem 11
Suppose is finite-dimensional and . Prove that is a scalar multiple of the identity if and only if for every .
First we prove it in one direction, by showing that if , for some scalar , we have .
We have:
and
so .
Next, we prove it in the opposite direction: if for every , we have . First, we show the effect of on basis vectors, and show that it is diagonal on a chosen basis.
Suppose and is a basis of . Define :
Thus, projects any vector onto the basis vector , scaled by a corresponding coefficient.
From the assumption that for all , consider:
Since , this reduces to
By definition of , the transformation retains only the -component of . Therefore, must be a scalar multiple of :
Now, we want to show that cannot treat different basis vectors differently; it must scale them all by the same scalar. Specifically, we want for all using the linear operator and the assumption and that for all .
Let our be defined to swap the coefficients of and in any vector, such that
For example, .
From the assumption that , we have
Applying the left side to , we have
and then applying , we have
Applying the right side, we have
and then applying gives
Equating the two sides gives
which means that for all . Thus, , where .
Problem 12
Suppose is a subspace of with . Suppose and (which means that for some ). Define by
Prove that is not a linear map on .
Let such that ; such as exists because . Let such that ; such a exists because .
Since and , their sum cannot lie in . Otherwise, we could write , which is a contradiction.
Therefore, , and by the definition of , we have . However, additivity requires , implying .
Therefore, is not a linear map on .
Problem 13
Suppose is finite-dimensional. Prove that every linear map on a subspace of can be extended to a linear map on . In other words, show that if is a subspace of and , then there exists such that for all .
There exists a subspace of such that . For all , there exist and such that .
Suppose . For all , define . We have
We also have:
Hence, is linear.
Problem 14
Suppose is finite-dimensional with , and suppose is infinite- dimensional. Prove that is infinite-dimensional.
Suppose and is a basis of . As is infinite-dimensional, we can find a sequence of elements in , denoted by , that is linearly independent for any positive integer .
For every , where , define such that
To prove is linearly independent for any , assume that we have a linear combination of these maps that equals the zero map, which must exist since is a vector space.
This means, for every :
For this to hold for all , it must be true that . Since are linearly independent by construction, the only solution is .
Hence, we find a sequence of elements in , that is linearly independent for any positive . Therefore, is infinite-dimensional.
Problem 15
Suppose is a linearly dependent list of vectors in . Suppose also that . Prove that there exist such that no satisfies for each .
being linearly dependent implies that there exist some , not all , such that .
As and are not all , we can find such that .
Now if we use this list with such that , we have
This is impossible. Hence, the result is proved.
Problem 16
Suppose is finite-dimensional with . Prove that there exist such that .
Suppose is a basis of , such that every element of can be written as some . Since , .
Let us define to such that
where the coefficients of the and terms are switched.
Let us define such that
Then:
and
Thus, .
Problem 17
Suppose is finite-dimensional. Show that the only two-sided ideals of are and .
A subspace of is called a two-sided ideal of if and for all and all .
It’s easy to verify that and are two-sided ideals of .
Suppose for the sake of contradiction that another exists. Let be its basis and let be the basis of .
Define as
to be a linear map in . Essentially, this reverses the coefficients of the basis vectors.
Define as
This maps acts a projection onto the basis vector . Note that because is spanned by .
We have reached the contradicting the example such that