Linear Maps
[143/0%]Suppose . Define by
Show that is linear if and only if .
Suppose . Define by
Show that is linear if and only if .
Suppose that . Show that there exist scalars for and such that
for every . This exercise shows that the linear map has the form promised in the second to last item of Example 3.3.
Suppose and is a list of vectors in such that is a linearly independent list in . Prove that is linearly independent.
Prove that is a vector space, as was asserted in 3.6.
Prove that multiplication of linear maps has the associative, identity, and distributive properties asserted in 3.8.
Theorem 3.8 (algebraic properties of products of linear maps): associativity: whenever , and are linear maps such that the products make sense (meaning maps into the domain of , and maps into the domain of ). Identity: whenever ; here the first is the identity operator on , and the second is the identity operator on . Distributive properties: and whenever and .
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 .
Give an example of a function such that
for all and all but is not linear. This exercise and the next exercise show that neither homogeneity nor additivity alone is enough to imply that a function is a linear map.
Give an example of a function such that
for all but is not linear. (Here is thought of as a complex vector space.)
There also exists a function such that satisfies the additivity condition above but is not linear. However, showing the existence of such a function involves considerably more advanced tools.
Prove or give a counterexample: If and is defined by , then is a linear map.
The function defined here differs from the function defined in the last bullet point of 3.3 by the order of the functions in the compositions. Last bullet point of Example 3.3 (composition): fix a polynomial and define a linear map by .
Suppose is finite-dimensional and . Prove that is a scalar multiple of the identity if and only if for every .
Suppose is a subspace of with . Suppose and (which means that for some ). Define by
Prove that is not a linear map on .
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 .
The result in this exercise is used in the proof of 3.125. Theorem 3.125 (dimension of the annihilator): suppose is finite-dimensional and is a subspace of . Then .
Suppose is finite-dimensional with , and suppose is infinitedimensional. Prove that is infinite-dimensional.
Suppose is a linearly dependent list of vectors in . Suppose also that . Prove that there exist such that no satisfies for each .
Suppose is finite-dimensional with . Prove that there exist such that .
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 .
Give an example of a linear map with and range .
Suppose are such that range . Prove that .
Suppose is a list of vectors in . Define by
What property of corresponds to spanning ?
What property of corresponds to the list being linearly independent?
Show that is not a subspace of .
Give an example of such that range .
Prove that there does not exist such that range .
Suppose and are finite-dimensional with . Show that is not a subspace of .
Suppose and are finite-dimensional with . Show that is not a subspace of .
Suppose is injective and is linearly independent in . Prove that is linearly independent in .
Suppose spans and . Show that spans range .
Suppose that is finite-dimensional and that . Prove that there exists a subspace of such that
Suppose is a linear map from to such that
Prove that is surjective.
Suppose is a three-dimensional subspace of and that is a linear map from to such that . Prove that is surjective.
Prove that there does not exist a linear map from to whose null space equals .
Suppose there exists a linear map on whose null space and range are both finite-dimensional. Prove that is finite-dimensional.
Suppose and are both finite-dimensional. Prove that there exists an injective linear map from to if and only if .
Suppose and are both finite-dimensional. Prove that there exists a surjective linear map from onto if and only if .
Suppose and are finite-dimensional and that is a subspace of . Prove that there exists such that if and only if .
Suppose is finite-dimensional and . Prove that is injective if and only if there exists such that is the identity operator on .
Suppose is finite-dimensional and . Prove that is surjective if and only if there exists such that is the identity operator on .
Suppose is finite-dimensional, , and is a subspace of . Prove that is a subspace of and
Suppose and are finite-dimensional vector spaces and and . Prove that
Suppose and are finite-dimensional vector spaces and and . Prove that dim range .
Suppose and are such that . Prove that dim range .
Give an example of with and dim range .
Suppose that is finite-dimensional and . Prove that if and only if there exists such that .
Suppose that is finite-dimensional and . Prove that range range if and only if there exists such that .
Suppose and . Prove that range .
Suppose is such that for every nonconstant polynomial . Prove that is surjective.
The notation is used above to remind you of the differentiation map that sends a polynomial p to .
Suppose . Prove that there exists a polynomial such that .
This exercise can be done without linear algebra, but it's more fun to do it using linear algebra.
Suppose and . Suppose is not in . Prove that
Suppose is finite-dimensional, is a subspace of , and is a finitedimensional subspace of . Prove that there exists such that and range if and only if .
Suppose is finite-dimensional with . Show that if is a linear map such that for all , then .
Suppose that and are real vector spaces and . Define by
for all . The linear map is called the complexification of the linear map .
Show that is a (complex) linear map from to .
Show that is injective if and only if is injective.
Show that range if and only if range .
The complexification was defined in Exercise 8 in Section 1B: suppose is a real vector space; the complexification of , denoted by , equals , with an element , , written as ; addition on is defined by ; complex scalar multiplication on is defined by for all and all .
Suppose . Show that with respect to each choice of bases of and , the matrix of has at least dim range nonzero entries.
Suppose and are finite-dimensional and . Prove that dim range if and only if there exist a basis of and a basis of such that with respect to these bases, all entries of equal 1.
Suppose is a basis of and is a basis of .
Show that if , then .
Show that if and , then .
This exercise asks you to verify 3.35 and 3.38.
Suppose that is the differentiation map defined by . Find a basis of and a basis of such that the matrix of with respect to these bases is
Compare with Example 3.33. The next exercise generalizes this exercise.
Suppose and are finite-dimensional and . Prove that there exist a basis of and a basis of such that with respect to these bases, all entries of are 0 except that the entries in row , column , equal 1 if range .
Suppose is a basis of and is finite-dimensional. Suppose . Prove that there exists a basis of such that all entries in the first column of [with respect to the bases and ] are 0 except for possibly a 1 in the first row, first column.
In this exercise, unlike Exercise 5, you are given the basis of instead of being able to choose a basis of .
Suppose is a basis of and is finite-dimensional. Suppose . Prove that there exists a basis of such that all entries in the first row of [with respect to the bases and ] are 0 except for possibly a 1 in the first row, first column.
In this exercise, unlike Exercise 5, you are given the basis of W instead of being able to choose a basis of W.
Suppose is an -by- matrix and is an -by- matrix. Prove that
for each . In other words, show that row of equals (row of ) times .
This exercise gives the row version of 3.48. Theorem 3.48 (column of matrix product equals matrix times column): suppose is an -by- matrix and is an -by- matrix. Then if . In other words, column of equals times column of .
Suppose is a 1-by- matrix and is an -by- matrix. Prove that
In other words, show that is a linear combination of the rows of , with the scalars that multiply the rows coming from .
This exercise gives the row version of 3.50. Theorem 3.50 (linear combination of columns): suppose is an -by- matrix and is an -by- matrix with entries . Then . In other words, is a linear combination of the columns of , with the scalars that multiply the columns coming from .
Give an example of 2-by-2 matrices and such that .
Prove that the distributive property holds for matrix addition and matrix multiplication. In other words, suppose , and are matrices whose sizes are such that and make sense. Explain why and both make sense and prove that
Prove that matrix multiplication is associative. In other words, suppose , and are matrices whose sizes are such that makes sense. Explain why makes sense and prove that
Try to find a clean proof that illustrates the following quote from Emil Artin: "It is my experience that proofs involving matrices can be shortened by 50 if one throws the matrices out."
Suppose is an -by- matrix and . Show that the entry in row , column , of (which is defined to mean ) is
Suppose and are positive integers. Prove that the function is a linear map from to .
Prove that if is an -by- matrix and is an -by- matrix, then
This exercise shows that the transpose of the product of two matrices is the product of the transposes in the opposite order.
Suppose is an -by- matrix with . Prove that the rank of is 1 if and only if there exist and such that for every and every .
Suppose , and and are bases of . Prove that the following are equivalent.
-
is injective.
-
The columns of are linearly independent in .
-
The columns of span .
-
The rows of span .
-
The rows of are linearly independent in . Here means .
Suppose is invertible. Show that is invertible and
Suppose and are both invertible linear maps. Prove that is invertible and that .
Suppose is finite-dimensional and . Prove that the following are equivalent.
-
is invertible.
-
is a basis of for every basis of .
-
is a basis of for some basis of .
Suppose is finite-dimensional and . Prove that the set of noninvertible linear maps from to itself is not a subspace of .
Suppose is finite-dimensional, is a subspace of , and . Prove that there exists an invertible linear map from to itself such that for every if and only if is injective.
Suppose that is finite-dimensional and . Prove that if and only if there exists an invertible such that .
Suppose that is finite-dimensional and . Prove that range range if and only if there exists an invertible such that .
Suppose and are finite-dimensional and . Prove that there exist invertible and such that if and only if .
Suppose is finite-dimensional and is a surjective linear map of onto . Prove that there is a subspace of such that is an isomorphism of onto .
Here means the function restricted to . Thus is the function whose domain is , with defined by for every .
Suppose and are finite-dimensional and is a subspace of . Let
Show that is a subspace of .
Find a formula for in terms of , and .
Suppose is finite-dimensional and . Prove that
Suppose is finite-dimensional and and . Show that is invertible and that .
Show that the result in Exercise 12 can fail without the hypothesis that is finite-dimensional.
Exercise 12: suppose is finite-dimensional and and . Then is invertible and .
Prove or give a counterexample: If is a finite-dimensional vector space and are such that is surjective, then is injective.
Suppose and is a list in such that spans . Prove that spans .
Prove that every linear map from to is given by a matrix multiplication. In other words, prove that if , then there exists an -by- matrix such that for every .
Suppose is finite-dimensional and . Define by
for .
Show that .
Show that range range .
Show that and are isomorphic vector spaces.
Suppose is finite-dimensional and . Prove that has the same matrix with respect to every basis of if and only if is a scalar multiple of the identity operator.
Suppose . Prove that there exists a polynomial such that
for all .
Suppose is a positive integer and for all . Prove that the following are equivalent (note that in both parts below, the number of equations equals the number of variables).
-
The trivial solution is the only solution to the homogeneous system of equations
-
For every , there exists a solution to the system of equations
Suppose and is a basis of . Prove that
Suppose that and are bases of . Let be such that for each . Prove that
Suppose and are square matrices of the same size and . Prove that .
Suppose is a function from to . The graph of is the subset of defined by
Prove that is a linear map if and only if the graph of is a subspace of .
Formally, a function from to is a subset of such that for each , there exists exactly one element . In other words, formally a function is what is called above its graph. We do not usually think of functions in this formal manner. However, if we do become formal, then this exercise could be rephrased as follows: Prove that a function from to is a linear map if and only if is a subspace of .
Suppose that are vector spaces such that is finitedimensional. Prove that is finite-dimensional for each .
Suppose are vector spaces. Prove that and are isomorphic vector spaces.
Suppose are vector spaces. Prove that and are isomorphic vector spaces.
For a positive integer, define by
Prove that and are isomorphic vector spaces.
Suppose that are vectors in and that are subspaces of such that . Prove that .
Let . Suppose . Prove that is a translate of if and only if there exists such that
Suppose and . Prove that is either the empty set or is a translate of .
Explain why the set of solutions to a system of linear equations such as 3.27 is either the empty set or is a translate of some subspace of .
System 3.27: given and , the system of linear equations , , in the variables .
Prove that a nonempty subset of is a translate of some subspace of if and only if for all and all .
Suppose and for some and some subspaces of . Prove that the intersection is either a translate of some subspace of or is the empty set.
Suppose .
Show that is a subspace of .
Prove that is infinite-dimensional.
Suppose . Let
Prove that is a translate of some subspace of .
Prove that if is a translate of some subspace of and , then .
Prove that is a translate of some subspace of of dimension less than .
Suppose is a subspace of such that is finite-dimensional. Prove that is isomorphic to .
Suppose and are subspaces of and . Suppose is a basis of . Prove that is a basis of .
Suppose is a subspace of and is a basis of and is a basis of . Prove that is a basis of .
Suppose and . Prove that .
Suppose is a subspace of such that . Prove that there exists such that .
Suppose that is a subspace of such that is finite-dimensional.
Show that if is a finite-dimensional subspace of and , then .
Prove that there exists a finite-dimensional subspace of such that and .
Suppose and is a subspace of . Let denote the quotient map from onto . Prove that there exists such that if and only if .
Explain why each linear functional is surjective or is the zero map.
Give three distinct examples of linear functionals on .
Suppose is finite-dimensional and with . Prove that there exists such that .
Suppose is finite-dimensional and is a subspace of such that . Prove that there exists such that for every but .
Suppose and is a basis of range . Hence for each , there exist unique numbers such that
thus defining functions from to . Show that each of the functions is a linear functional on .
Suppose . Prove that if and only if there exists such that .
Suppose that are vector spaces. Prove that and are isomorphic vector spaces.
Suppose is a basis of and is the dual basis of . Define and by
Explain why and are inverses of each other.
Suppose is a positive integer. Show that the dual basis of the basis of is , where
Here denotes the derivative of , with the understanding that the derivative of is .
Suppose is a positive integer.
Show that is a basis of .
What is the dual basis of the basis in (a)?
Suppose is a basis of and is the corresponding dual basis of . Suppose . Prove that
Suppose .
Prove that .
Prove that for all .
This exercise asks you to verify (a) and (b) in 3.120.
Show that the dual map of the identity operator on is the identity operator on .
Define by
Suppose denotes the dual basis of the standard basis of and denotes the dual basis of the standard basis of .
Describe the linear functionals and .
Write and as linear combinations of .
Define by
for each .
Suppose is defined by . Describe the linear functional on .
Suppose is defined by . Evaluate .
Suppose is finite-dimensional and . Prove that
Suppose and are finite-dimensional and . Prove that is invertible if and only if is invertible.
Suppose and are finite-dimensional. Prove that the map that takes to is an isomorphism of onto .
Suppose . Explain why
Suppose is finite-dimensional and is a subspace of . Show that
Suppose is finite-dimensional and and are subspaces of .
Prove that if and only if .
Prove that if and only if .
Suppose is finite-dimensional and and are subspaces of .
Show that .
Show that .
Suppose is finite-dimensional and . Prove that the following three sets are equal to each other.
Suppose is finite-dimensional and . Define a linear map by .
Prove that spans if and only if is injective.
Prove that is linearly independent if and only if is surjective.
Suppose is finite-dimensional and . Define a linear map by .
Prove that spans if and only if is injective.
Prove that is linearly independent if and only if is surjective.
Suppose is finite-dimensional and is a subspace of . Prove that
Suppose and , where is the linear functional on defined by . Prove that
Suppose is finite-dimensional and is a linearly independent list in . Prove that
Suppose and are finite-dimensional and .
Prove that if and , then range .
Prove that if and range , then .
Suppose is finite-dimensional and is a basis of . Show that there exists a basis of whose dual basis is .
Suppose is a subspace of . Let be the inclusion map defined by . Thus .
Show that .
Prove that if is finite-dimensional, then range .
Prove that if is finite-dimensional, then is an isomorphism from onto .
The isomorphism in (c) is natural in that it does not depend on a choice of basis in either vector space.
The double dual space of , denoted by , is defined to be the dual space of . In other words, . Define by
for each and each .
Show that is a linear map from to .
Show that if , then , where .
Show that if is finite-dimensional, then is an isomorphism from onto .
Suppose is finite-dimensional. Then and are isomorphic, but finding an isomorphism from onto generally requires choosing a basis of . In contrast, the isomorphism from onto does not require a choice of basis and thus is considered more natural.
Suppose is a subspace of . Let be the usual quotient map. Thus .
Show that is injective.
Show that range .
Conclude that is an isomorphism from onto .
The isomorphism in (c) is natural in that it does not depend on a choice of basis in either vector space. In fact, there is no assumption here that any of these vector spaces are finite-dimensional.