Linear Mapping - Linear Algebra
Card 0 of 208
Consider the mapping
such that
.
What is the the null space of
?
Consider the mapping such that
.
What is the the null space of ?
To find the null space consider the equation


This gives a system of equations

The only solution to this system is 
Thus the null space consists of the single vector 
To find the null space consider the equation
This gives a system of equations
The only solution to this system is
Thus the null space consists of the single vector
Compare your answer with the correct one above
is the set of all polynomials with degree
or less.
Define a linear mapping
as follows:

Is this mapping one-to-one and onto?
is the set of all polynomials with degree
or less.
Define a linear mapping as follows:
Is this mapping one-to-one and onto?
is a vector space of dimension
.
is a linear mapping of a four-dimensional vector space into a five-dimensional vector space; since the range has greater dimension than the domain,
cannot be onto. It remains to be determined whether it is one-to-one.
A transformation is one-to-one if and only if for any
in the domain,
implies that
.
Suppose that
for some
.
Since
are third-degree polynomials:


for some scalar
.
, so



For these two polynomials to be equal, it must hold that all coefficients of the terms of equal degree are equal. We can immediately see from the first-degree terms that
. Applying some simple algebra, it follows almost as quickly that
,
, and
. Thus,
, and
is one-to-one.
The correct response is that
is one-to-one but not onto.
is a vector space of dimension
.
is a linear mapping of a four-dimensional vector space into a five-dimensional vector space; since the range has greater dimension than the domain,
cannot be onto. It remains to be determined whether it is one-to-one.
A transformation is one-to-one if and only if for any in the domain,
implies that
.
Suppose that for some
.
Since are third-degree polynomials:
for some scalar .
, so
For these two polynomials to be equal, it must hold that all coefficients of the terms of equal degree are equal. We can immediately see from the first-degree terms that . Applying some simple algebra, it follows almost as quickly that
,
, and
. Thus,
, and
is one-to-one.
The correct response is that is one-to-one but not onto.
Compare your answer with the correct one above
is the set of all two-by-one matrices - that is, the set of all column matrices with two entries.
Let
. Define a linear mapping
as follows:
.
True or false:
is one-to-one and onto.
is the set of all two-by-one matrices - that is, the set of all column matrices with two entries.
Let . Define a linear mapping
as follows:
.
True or false: is one-to-one and onto.
The domain and the codomain of
are identical, so
is one to one if and only if it is onto.
A necessary and sufficient condition for
to be one-to-one is that the kernel of
be
. In
, the zero element is
, and this condition states that if
, then 
Thus, we can prove that
is not one-to-one - and not onto - by finding a nonzero column matrix
such that
.
Set
. Then





There is at least one nonzero column matrix in the kernel of
, so
is not one-to-one or onto.
The domain and the codomain of are identical, so
is one to one if and only if it is onto.
A necessary and sufficient condition for to be one-to-one is that the kernel of
be
. In
, the zero element is
, and this condition states that if
, then
Thus, we can prove that is not one-to-one - and not onto - by finding a nonzero column matrix
such that
.
Set . Then
There is at least one nonzero column matrix in the kernel of , so
is not one-to-one or onto.
Compare your answer with the correct one above
Consider the mapping
such that
.
What is the the null space of
?
Consider the mapping such that
.
What is the the null space of ?
To find the null space consider the equation


This gives a system of equations

The only solution to this system is 
Thus the null space consists of the single vector 
To find the null space consider the equation
This gives a system of equations
The only solution to this system is
Thus the null space consists of the single vector
Compare your answer with the correct one above
is the set of all polynomials with degree
or less.
Define a linear mapping
as follows:

Is this mapping one-to-one and onto?
is the set of all polynomials with degree
or less.
Define a linear mapping as follows:
Is this mapping one-to-one and onto?
is a vector space of dimension
.
is a linear mapping of a four-dimensional vector space into a five-dimensional vector space; since the range has greater dimension than the domain,
cannot be onto. It remains to be determined whether it is one-to-one.
A transformation is one-to-one if and only if for any
in the domain,
implies that
.
Suppose that
for some
.
Since
are third-degree polynomials:


for some scalar
.
, so



For these two polynomials to be equal, it must hold that all coefficients of the terms of equal degree are equal. We can immediately see from the first-degree terms that
. Applying some simple algebra, it follows almost as quickly that
,
, and
. Thus,
, and
is one-to-one.
The correct response is that
is one-to-one but not onto.
is a vector space of dimension
.
is a linear mapping of a four-dimensional vector space into a five-dimensional vector space; since the range has greater dimension than the domain,
cannot be onto. It remains to be determined whether it is one-to-one.
A transformation is one-to-one if and only if for any in the domain,
implies that
.
Suppose that for some
.
Since are third-degree polynomials:
for some scalar .
, so
For these two polynomials to be equal, it must hold that all coefficients of the terms of equal degree are equal. We can immediately see from the first-degree terms that . Applying some simple algebra, it follows almost as quickly that
,
, and
. Thus,
, and
is one-to-one.
The correct response is that is one-to-one but not onto.
Compare your answer with the correct one above
is the set of all polynomials with degree
or less.
Define a linear mapping
as follows:

Is this mapping one-to-one and onto?
is the set of all polynomials with degree
or less.
Define a linear mapping as follows:
Is this mapping one-to-one and onto?
is a linear mapping of a vector space into itself, so it is possible for
to be both one-to-one and onto.
A transformation is one-to-one if and only if for any
in the domain,
implies that
.
Suppose that
for some
.
Since
are third-degree polynomials:


for some scalar
.
, so




For these two polynomials to be equal, it must hold that all coefficients of the terms of equal degree are equal. We can immediately see from the first-degree terms that
. Applying some simple algebra, it follows almost as quickly that
,
, and
. Thus,
, and
is one-to-one.
A transformation is onto if, for each
in the range, there exists
in the domain such that
.
Let
. Then

for some scalar
.
If
, then, if
is defined as before,




Therefore,
,
,
, 
Or,
,
,
,
.
Thus,
is the polynomial in
that
maps into
. Since such a polynomial exists in the domain for each range element, it follows that
is onto.
The correct response is that
is one-to-one and onto.
is a linear mapping of a vector space into itself, so it is possible for
to be both one-to-one and onto.
A transformation is one-to-one if and only if for any in the domain,
implies that
.
Suppose that for some
.
Since are third-degree polynomials:
for some scalar .
, so
For these two polynomials to be equal, it must hold that all coefficients of the terms of equal degree are equal. We can immediately see from the first-degree terms that . Applying some simple algebra, it follows almost as quickly that
,
, and
. Thus,
, and
is one-to-one.
A transformation is onto if, for each in the range, there exists
in the domain such that
.
Let . Then
for some scalar .
If , then, if
is defined as before,
Therefore,
,
,
,
Or,
,
,
,
.
Thus,
is the polynomial in
that
maps into
. Since such a polynomial exists in the domain for each range element, it follows that
is onto.
The correct response is that is one-to-one and onto.
Compare your answer with the correct one above
is the set of all two-by-one matrices - that is, the set of all column matrices with two entries.
Let
. Define a linear mapping
as follows:
.
True or false:
is one-to-one and onto.
is the set of all two-by-one matrices - that is, the set of all column matrices with two entries.
Let . Define a linear mapping
as follows:
.
True or false: is one-to-one and onto.
The domain and the codomain of
are identical, so
is one to one if and only if it is onto.
A necessary and sufficient condition for
to be one-to-one is that the kernel of
be
. In
, the zero element is
, and this condition states that if
, then 
Thus, we can prove that
is not one-to-one - and not onto - by finding a nonzero column matrix
such that
.
Set
. Then





There is at least one nonzero column matrix in the kernel of
, so
is not one-to-one or onto.
The domain and the codomain of are identical, so
is one to one if and only if it is onto.
A necessary and sufficient condition for to be one-to-one is that the kernel of
be
. In
, the zero element is
, and this condition states that if
, then
Thus, we can prove that is not one-to-one - and not onto - by finding a nonzero column matrix
such that
.
Set . Then
There is at least one nonzero column matrix in the kernel of , so
is not one-to-one or onto.
Compare your answer with the correct one above
Consider the mapping
such that
.
What is the the null space of
?
Consider the mapping such that
.
What is the the null space of ?
To find the null space consider the equation


This gives a system of equations

The only solution to this system is 
Thus the null space consists of the single vector 
To find the null space consider the equation
This gives a system of equations
The only solution to this system is
Thus the null space consists of the single vector
Compare your answer with the correct one above
is the set of all polynomials with degree
or less.
Define a linear mapping
as follows:

Is this mapping one-to-one and onto?
is the set of all polynomials with degree
or less.
Define a linear mapping as follows:
Is this mapping one-to-one and onto?
is a vector space of dimension
.
is a linear mapping of a four-dimensional vector space into a five-dimensional vector space; since the range has greater dimension than the domain,
cannot be onto. It remains to be determined whether it is one-to-one.
A transformation is one-to-one if and only if for any
in the domain,
implies that
.
Suppose that
for some
.
Since
are third-degree polynomials:


for some scalar
.
, so



For these two polynomials to be equal, it must hold that all coefficients of the terms of equal degree are equal. We can immediately see from the first-degree terms that
. Applying some simple algebra, it follows almost as quickly that
,
, and
. Thus,
, and
is one-to-one.
The correct response is that
is one-to-one but not onto.
is a vector space of dimension
.
is a linear mapping of a four-dimensional vector space into a five-dimensional vector space; since the range has greater dimension than the domain,
cannot be onto. It remains to be determined whether it is one-to-one.
A transformation is one-to-one if and only if for any in the domain,
implies that
.
Suppose that for some
.
Since are third-degree polynomials:
for some scalar .
, so
For these two polynomials to be equal, it must hold that all coefficients of the terms of equal degree are equal. We can immediately see from the first-degree terms that . Applying some simple algebra, it follows almost as quickly that
,
, and
. Thus,
, and
is one-to-one.
The correct response is that is one-to-one but not onto.
Compare your answer with the correct one above
is the set of all polynomials with degree
or less.
Define a linear mapping
as follows:

Is this mapping one-to-one and onto?
is the set of all polynomials with degree
or less.
Define a linear mapping as follows:
Is this mapping one-to-one and onto?
is a linear mapping of a vector space into itself, so it is possible for
to be both one-to-one and onto.
A transformation is one-to-one if and only if for any
in the domain,
implies that
.
Suppose that
for some
.
Since
are third-degree polynomials:


for some scalar
.
, so




For these two polynomials to be equal, it must hold that all coefficients of the terms of equal degree are equal. We can immediately see from the first-degree terms that
. Applying some simple algebra, it follows almost as quickly that
,
, and
. Thus,
, and
is one-to-one.
A transformation is onto if, for each
in the range, there exists
in the domain such that
.
Let
. Then

for some scalar
.
If
, then, if
is defined as before,




Therefore,
,
,
, 
Or,
,
,
,
.
Thus,
is the polynomial in
that
maps into
. Since such a polynomial exists in the domain for each range element, it follows that
is onto.
The correct response is that
is one-to-one and onto.
is a linear mapping of a vector space into itself, so it is possible for
to be both one-to-one and onto.
A transformation is one-to-one if and only if for any in the domain,
implies that
.
Suppose that for some
.
Since are third-degree polynomials:
for some scalar .
, so
For these two polynomials to be equal, it must hold that all coefficients of the terms of equal degree are equal. We can immediately see from the first-degree terms that . Applying some simple algebra, it follows almost as quickly that
,
, and
. Thus,
, and
is one-to-one.
A transformation is onto if, for each in the range, there exists
in the domain such that
.
Let . Then
for some scalar .
If , then, if
is defined as before,
Therefore,
,
,
,
Or,
,
,
,
.
Thus,
is the polynomial in
that
maps into
. Since such a polynomial exists in the domain for each range element, it follows that
is onto.
The correct response is that is one-to-one and onto.
Compare your answer with the correct one above
is the set of all two-by-one matrices - that is, the set of all column matrices with two entries.
Let
. Define a linear mapping
as follows:
.
True or false:
is one-to-one and onto.
is the set of all two-by-one matrices - that is, the set of all column matrices with two entries.
Let . Define a linear mapping
as follows:
.
True or false: is one-to-one and onto.
The domain and the codomain of
are identical, so
is one to one if and only if it is onto.
A necessary and sufficient condition for
to be one-to-one is that the kernel of
be
. In
, the zero element is
, and this condition states that if
, then 
Thus, we can prove that
is not one-to-one - and not onto - by finding a nonzero column matrix
such that
.
Set
. Then





There is at least one nonzero column matrix in the kernel of
, so
is not one-to-one or onto.
The domain and the codomain of are identical, so
is one to one if and only if it is onto.
A necessary and sufficient condition for to be one-to-one is that the kernel of
be
. In
, the zero element is
, and this condition states that if
, then
Thus, we can prove that is not one-to-one - and not onto - by finding a nonzero column matrix
such that
.
Set . Then
There is at least one nonzero column matrix in the kernel of , so
is not one-to-one or onto.
Compare your answer with the correct one above
Consider the mapping
such that
.
What is the the null space of
?
Consider the mapping such that
.
What is the the null space of ?
To find the null space consider the equation


This gives a system of equations

The only solution to this system is 
Thus the null space consists of the single vector 
To find the null space consider the equation
This gives a system of equations
The only solution to this system is
Thus the null space consists of the single vector
Compare your answer with the correct one above
is the set of all polynomials with degree
or less.
Define a linear mapping
as follows:

Is this mapping one-to-one and onto?
is the set of all polynomials with degree
or less.
Define a linear mapping as follows:
Is this mapping one-to-one and onto?
is a vector space of dimension
.
is a linear mapping of a four-dimensional vector space into a five-dimensional vector space; since the range has greater dimension than the domain,
cannot be onto. It remains to be determined whether it is one-to-one.
A transformation is one-to-one if and only if for any
in the domain,
implies that
.
Suppose that
for some
.
Since
are third-degree polynomials:


for some scalar
.
, so



For these two polynomials to be equal, it must hold that all coefficients of the terms of equal degree are equal. We can immediately see from the first-degree terms that
. Applying some simple algebra, it follows almost as quickly that
,
, and
. Thus,
, and
is one-to-one.
The correct response is that
is one-to-one but not onto.
is a vector space of dimension
.
is a linear mapping of a four-dimensional vector space into a five-dimensional vector space; since the range has greater dimension than the domain,
cannot be onto. It remains to be determined whether it is one-to-one.
A transformation is one-to-one if and only if for any in the domain,
implies that
.
Suppose that for some
.
Since are third-degree polynomials:
for some scalar .
, so
For these two polynomials to be equal, it must hold that all coefficients of the terms of equal degree are equal. We can immediately see from the first-degree terms that . Applying some simple algebra, it follows almost as quickly that
,
, and
. Thus,
, and
is one-to-one.
The correct response is that is one-to-one but not onto.
Compare your answer with the correct one above
is the set of all polynomials with degree
or less.
Define a linear mapping
as follows:

Is this mapping one-to-one and onto?
is the set of all polynomials with degree
or less.
Define a linear mapping as follows:
Is this mapping one-to-one and onto?
is a linear mapping of a vector space into itself, so it is possible for
to be both one-to-one and onto.
A transformation is one-to-one if and only if for any
in the domain,
implies that
.
Suppose that
for some
.
Since
are third-degree polynomials:


for some scalar
.
, so




For these two polynomials to be equal, it must hold that all coefficients of the terms of equal degree are equal. We can immediately see from the first-degree terms that
. Applying some simple algebra, it follows almost as quickly that
,
, and
. Thus,
, and
is one-to-one.
A transformation is onto if, for each
in the range, there exists
in the domain such that
.
Let
. Then

for some scalar
.
If
, then, if
is defined as before,




Therefore,
,
,
, 
Or,
,
,
,
.
Thus,
is the polynomial in
that
maps into
. Since such a polynomial exists in the domain for each range element, it follows that
is onto.
The correct response is that
is one-to-one and onto.
is a linear mapping of a vector space into itself, so it is possible for
to be both one-to-one and onto.
A transformation is one-to-one if and only if for any in the domain,
implies that
.
Suppose that for some
.
Since are third-degree polynomials:
for some scalar .
, so
For these two polynomials to be equal, it must hold that all coefficients of the terms of equal degree are equal. We can immediately see from the first-degree terms that . Applying some simple algebra, it follows almost as quickly that
,
, and
. Thus,
, and
is one-to-one.
A transformation is onto if, for each in the range, there exists
in the domain such that
.
Let . Then
for some scalar .
If , then, if
is defined as before,
Therefore,
,
,
,
Or,
,
,
,
.
Thus,
is the polynomial in
that
maps into
. Since such a polynomial exists in the domain for each range element, it follows that
is onto.
The correct response is that is one-to-one and onto.
Compare your answer with the correct one above
is the set of all two-by-one matrices - that is, the set of all column matrices with two entries.
Let
. Define a linear mapping
as follows:
.
True or false:
is one-to-one and onto.
is the set of all two-by-one matrices - that is, the set of all column matrices with two entries.
Let . Define a linear mapping
as follows:
.
True or false: is one-to-one and onto.
The domain and the codomain of
are identical, so
is one to one if and only if it is onto.
A necessary and sufficient condition for
to be one-to-one is that the kernel of
be
. In
, the zero element is
, and this condition states that if
, then 
Thus, we can prove that
is not one-to-one - and not onto - by finding a nonzero column matrix
such that
.
Set
. Then





There is at least one nonzero column matrix in the kernel of
, so
is not one-to-one or onto.
The domain and the codomain of are identical, so
is one to one if and only if it is onto.
A necessary and sufficient condition for to be one-to-one is that the kernel of
be
. In
, the zero element is
, and this condition states that if
, then
Thus, we can prove that is not one-to-one - and not onto - by finding a nonzero column matrix
such that
.
Set . Then
There is at least one nonzero column matrix in the kernel of , so
is not one-to-one or onto.
Compare your answer with the correct one above
Consider the mapping
. Can f be an isomorphism?
(Hint: Think about dimension's role in isomorphism)
Consider the mapping . Can f be an isomorphism?
(Hint: Think about dimension's role in isomorphism)
No, f, cannot be an isomorphism. This is because
and
have different dimension. Isomorphisms cannot exist between vector spaces of different dimension.
No, f, cannot be an isomorphism. This is because and
have different dimension. Isomorphisms cannot exist between vector spaces of different dimension.
Compare your answer with the correct one above
The last question showed us isomorphisms must be between vector spaces of the same dimension. This question now asks about homomorphisms.
Consider the mapping
. Can f be a homomorphism?
The last question showed us isomorphisms must be between vector spaces of the same dimension. This question now asks about homomorphisms.
Consider the mapping . Can f be a homomorphism?
The answer is yes. There is no restriction on dimension for homomorphism like there is for isomorphism. Therefore f could be a homomorphism, but it is not guaranteed.
The answer is yes. There is no restriction on dimension for homomorphism like there is for isomorphism. Therefore f could be a homomorphism, but it is not guaranteed.
Compare your answer with the correct one above
In the previous question, we said an isomorphism cannot be between vector spaces of different dimension. But are all homomorphisms between vector spaces of the same dimension an isomorphism?
Consider the homomorphism
. Is f an isomorphism?
In the previous question, we said an isomorphism cannot be between vector spaces of different dimension. But are all homomorphisms between vector spaces of the same dimension an isomorphism?
Consider the homomorphism . Is f an isomorphism?
The answer is not enough information. The reason is that it could be an isomorphism because it is between vector spaces of the same dimension, but that doesn't mean it is.
For example:
Consider the zero mapping f(x,y)= (0,0).
This mapping is not onto or 1-to-1 because all elements go to the zero vector. Therefore it is not an isomorphism even though it is a mapping between spaces with the same dimension.
Another example:
Consider the identity mapping f(x,y) = (x,y)
This is an isomorphism. It clearly preserves structure and is both onto and 1-to-1.
Thus f could be an isomorphism (example identity map) or it could NOT be an isomorphism ( Example the zero mapping)
The answer is not enough information. The reason is that it could be an isomorphism because it is between vector spaces of the same dimension, but that doesn't mean it is.
For example:
Consider the zero mapping f(x,y)= (0,0).
This mapping is not onto or 1-to-1 because all elements go to the zero vector. Therefore it is not an isomorphism even though it is a mapping between spaces with the same dimension.
Another example:
Consider the identity mapping f(x,y) = (x,y)
This is an isomorphism. It clearly preserves structure and is both onto and 1-to-1.
Thus f could be an isomorphism (example identity map) or it could NOT be an isomorphism ( Example the zero mapping)
Compare your answer with the correct one above
Let f be a homomorphism from
to
. Can f be 1-to-1?
(Hint: look at the dimension of the domain and co-domain)
Let f be a homomorphism from to
. Can f be 1-to-1?
(Hint: look at the dimension of the domain and co-domain)
No, f can not be 1-to-1. The reason is because the domain has dimension 3 but the co-domain has dimension of 2. A mapping can not be 1-to-1 when the the dimension of the domain is greater than the dimension of the co-domain.
No, f can not be 1-to-1. The reason is because the domain has dimension 3 but the co-domain has dimension of 2. A mapping can not be 1-to-1 when the the dimension of the domain is greater than the dimension of the co-domain.
Compare your answer with the correct one above
Often we can get information about a mapping by simply knowing the dimension of the domain and codomain.
Let f be a mapping from
to
. Can f be onto?
(Hint look at the dimension of the domain and codomain)
Often we can get information about a mapping by simply knowing the dimension of the domain and codomain.
Let f be a mapping from to
. Can f be onto?
(Hint look at the dimension of the domain and codomain)
No, f cannot be onto. The reason is because the dimension of the domain (2) is less than the dimension of the codomain(3).
For a function to be onto, the dimension of the domain must be less than or equal to the dimension of the codomain.
No, f cannot be onto. The reason is because the dimension of the domain (2) is less than the dimension of the codomain(3).
For a function to be onto, the dimension of the domain must be less than or equal to the dimension of the codomain.
Compare your answer with the correct one above