Operations and Properties - Linear Algebra
Card 1 of 2140
A linear map
has a null space that is spanned by the vectors,
and
. is this function 1-to-1?
A linear map has a null space that is spanned by the vectors,
and
. is this function 1-to-1?
Tap to reveal answer
This linear mapping is not 1-to-1. We know this because the null space is spanned by two vectors. Therefore the null space has dimension
. A linear map is 1-to-1 only if it has a null space with dimension zero. This linear map doesn't have a null space of dimension zero, therefore it is not 1-to-1.
This linear mapping is not 1-to-1. We know this because the null space is spanned by two vectors. Therefore the null space has dimension . A linear map is 1-to-1 only if it has a null space with dimension zero. This linear map doesn't have a null space of dimension zero, therefore it is not 1-to-1.
← Didn't Know|Knew It →
A linear map
has a rank of 3. Is the linear map,
, 1-to-1?
(Hint- Use the formula
where
is the dimension of the domain
is the dimension of the null space
is the rank of the linear map )
A linear map has a rank of 3. Is the linear map,
, 1-to-1?
(Hint- Use the formula where
is the dimension of the domain
is the dimension of the null space
is the rank of the linear map )
Tap to reveal answer
The answer is no because the dimension of the null space is not zero. This comes from the equation

We know that the domain is
which has dimension of
. Therefore

Also from the problem statement
.
Plugging these into the equation gives



Since the dimension of the null space is
and not
, then the function can't be 1-to-1.
The answer is no because the dimension of the null space is not zero. This comes from the equation
We know that the domain is which has dimension of
. Therefore
Also from the problem statement .
Plugging these into the equation gives
Since the dimension of the null space is and not
, then the function can't be 1-to-1.
← Didn't Know|Knew It →
Tap to reveal answer
Transposing a matrix simply means to make the columns of the original matrix the rows in the transposed matrix. Example:
ie. column 1 become row 1, column 2 becomes row 2, etc.
Transposing a matrix simply means to make the columns of the original matrix the rows in the transposed matrix. Example: ie. column 1 become row 1, column 2 becomes row 2, etc.
← Didn't Know|Knew It →
A linear map
has a rank of 4. Is the linear map,
, 1-to-1?
(Hint- Use the formula
where
is the dimension of the domain
is the dimension of the null space
is the rank of the linear map )
A linear map has a rank of 4. Is the linear map,
, 1-to-1?
(Hint- Use the formula where
is the dimension of the domain
is the dimension of the null space
is the rank of the linear map )
Tap to reveal answer
The answer is yes because the dimension of the domain and the rank are equal. This implies that the dimension of the null space is zero.
This comes from the equation

We know that the domain is
which has dimension of
. Therefore

Also from the problem statement
.
Plugging these into the equation gives



Since the dimension of the null space is
then the function is 1-to-1.
Notice that whenever
, then
is always zero. Thus whenever
, the linear mapping is 1-to-1.
The answer is yes because the dimension of the domain and the rank are equal. This implies that the dimension of the null space is zero.
This comes from the equation
We know that the domain is which has dimension of
. Therefore
Also from the problem statement .
Plugging these into the equation gives
Since the dimension of the null space is then the function is 1-to-1.
Notice that whenever , then
is always zero. Thus whenever
, the linear mapping is 1-to-1.
← Didn't Know|Knew It →
Tap to reveal answer
Transposing a matrix simply means to make the columns of the original matrix the rows in the transposed matrix. Example:
ie. column 1 become row 1, column 2 becomes row 2, etc.
Transposing a matrix simply means to make the columns of the original matrix the rows in the transposed matrix. Example: ie. column 1 become row 1, column 2 becomes row 2, etc.
← Didn't Know|Knew It →
refers to the set of all functions with domain
and range a subset of
.
Define the transformation
to be

True or false:
is a linear transformation.
refers to the set of all functions with domain
and range a subset of
.
Define the transformation to be
True or false: is a linear transformation.
Tap to reveal answer
For
to be a linear transformation, it must hold that

and

for all
in the domain of
and and for all scalar
.
Let
.
and
, so

By the sum rule for finite sequences,
![T(f)+ T(g)= \sum_{j=1}^{100}[ f'(j) + g'(j)]](https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/1000097/gif.latex)
By the derivative sum rule,



The first condition is met.
Let
and
be a scalar.


By the scalar product rule for finite sequences,

By the scalar product rule for derivatives,


The second condition is met.
is a linear transformation.
For to be a linear transformation, it must hold that
and
for all in the domain of
and and for all scalar
.
Let .
and
, so
By the sum rule for finite sequences,
By the derivative sum rule,
The first condition is met.
Let and
be a scalar.
By the scalar product rule for finite sequences,
By the scalar product rule for derivatives,
The second condition is met.
is a linear transformation.
← Didn't Know|Knew It →
refers to the set of all functions that are continuous on
.
Define the linear mapping
as follows:

True or false:
is in the kernel of
.
refers to the set of all functions that are continuous on
.
Define the linear mapping as follows:
True or false: is in the kernel of
.
Tap to reveal answer
The kernel of a linear transformation
is the subset of the domain of
that maps into the zero of its range. It follows that
if and only if

To determine whether this is true or false, evaluate the integral:





Therefore,
.
The kernel of a linear transformation is the subset of the domain of
that maps into the zero of its range. It follows that
if and only if
To determine whether this is true or false, evaluate the integral:
Therefore, .
← Didn't Know|Knew It →
refers to the set of all functions that are continuous on
.
Define the linear mapping
as follows:

True or false:
is in the kernel of
.
refers to the set of all functions that are continuous on
.
Define the linear mapping as follows:
True or false: is in the kernel of
.
Tap to reveal answer
The kernel of a linear transformation
is the subset of the domain of
that maps into the zero of its range, so, by definition,
if and only if

To determine whether this is true or false, evaluate the integral:





, so
.
The kernel of a linear transformation is the subset of the domain of
that maps into the zero of its range, so, by definition,
if and only if
To determine whether this is true or false, evaluate the integral:
, so
.
← Didn't Know|Knew It →
True or false: If
is a linear mapping, and
is a vector space, then
is a subspace of
.
True or false: If is a linear mapping, and
is a vector space, then
is a subspace of
.
Tap to reveal answer
For example, if
is the space of all vectors in
of the form
, and
is the space of all vectors in
the form
, then
is a linear mapping, but
is not a subset of
, let alone a subspace of
.
For example, if is the space of all vectors in
of the form
, and
is the space of all vectors in
the form
, then
is a linear mapping, but
is not a subset of
, let alone a subspace of
.
← Didn't Know|Knew It →
True or false: The identity mapping
, is also considered a linear mapping, regardless of the vector space
.
True or false: The identity mapping , is also considered a linear mapping, regardless of the vector space
.
Tap to reveal answer
Verifying the conditions for a linear mapping, we have
![I[a\mathbf{x}+b]=a\mathbf{x}+b = aI[\mathbf{x}]+b.](https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/1009260/gif.latex)
Hence the identity mapping is closed under vector addition and scalar multiplication, and is therefore a linear mapping.
Verifying the conditions for a linear mapping, we have
Hence the identity mapping is closed under vector addition and scalar multiplication, and is therefore a linear mapping.
← Didn't Know|Knew It →
is the set of all real polynomials with degree 3 or less.
Define the linear mapping
as follows:

Is this linear mapping one-to-one and onto?
is the set of all real polynomials with degree 3 or less.
Define the linear mapping as follows:
Is this linear mapping one-to-one and onto?
Tap to reveal answer
is a linear mapping of a four-dimensional vector space into a one-dimensional vector space; it cannot be one-to-one.
is onto if, for every element
in its codomain, which here is
, there exists at least one
in the domain
so that
.
For each
, we can choose the constant polynomial
, so each
has at least one domain element that maps into it.
is onto but not one-to-one.
is a linear mapping of a four-dimensional vector space into a one-dimensional vector space; it cannot be one-to-one.
is onto if, for every element
in its codomain, which here is
, there exists at least one
in the domain
so that
.
For each , we can choose the constant polynomial
, so each
has at least one domain element that maps into it.
is onto but not one-to-one.
← Didn't Know|Knew It →
Find the Eigen Values for Matrix
.

Find the Eigen Values for Matrix .
Tap to reveal answer
The first step into solving for eigenvalues, is adding in a
along the main diagonal.

Now the next step to take the determinant.


Now lets FOIL, and solve for
.


Now lets use the quadratic equation to solve for
.



So our eigen values are


The first step into solving for eigenvalues, is adding in a along the main diagonal.
Now the next step to take the determinant.
Now lets FOIL, and solve for .
Now lets use the quadratic equation to solve for .
So our eigen values are
← Didn't Know|Knew It →
Find the eigenvalues for the matrix 
Find the eigenvalues for the matrix
Tap to reveal answer
The eigenvalues,
, for the matrix are values for which the determinant of
is equal to zero. First, find the determinant:

Now set the determinant equal to zero and solve this quadratic:
this can be factored:

The eigenvalues are 5 and 1.
The eigenvalues, , for the matrix are values for which the determinant of
is equal to zero. First, find the determinant:
Now set the determinant equal to zero and solve this quadratic:
this can be factored:
The eigenvalues are 5 and 1.
← Didn't Know|Knew It →
Which is an eigenvector for
,
or 
Which is an eigenvector for ,
or
Tap to reveal answer
To determine if something is an eignevector, multiply times A:

Since this is equivalent to
,
is an eigenvector (and 5 is an eigenvalue).

This cannot be re-written as
times a scalar, so this is not an eigenvector.
To determine if something is an eignevector, multiply times A:
Since this is equivalent to ,
is an eigenvector (and 5 is an eigenvalue).
This cannot be re-written as times a scalar, so this is not an eigenvector.
← Didn't Know|Knew It →
Find the eigenvalues for the matrix 
Find the eigenvalues for the matrix
Tap to reveal answer
The eigenvalues are scalar quantities,
, where the determinant of
is equal to zero.
First, find an expression for the determinant:


Now set this equal to zero, and solve:
this can be factored (or solved in another way)

The eigenvalues are -5 and 3.
The eigenvalues are scalar quantities, , where the determinant of
is equal to zero.
First, find an expression for the determinant:
Now set this equal to zero, and solve:
this can be factored (or solved in another way)
The eigenvalues are -5 and 3.
← Didn't Know|Knew It →
Which is an eigenvector for
,
or
?
Which is an eigenvector for ,
or
?
Tap to reveal answer
To determine if something is an eigenvector, multiply by the matrix A:

This is equivalent to
so this is an eigenvector.

This is equivalent to
so this is also an eigenvector.
To determine if something is an eigenvector, multiply by the matrix A:
This is equivalent to so this is an eigenvector.
This is equivalent to so this is also an eigenvector.
← Didn't Know|Knew It →
Determine the eigenvalues for the matrix 
Determine the eigenvalues for the matrix
Tap to reveal answer
The eigenvalues are scalar quantities
where the determinant of
is equal to zero. First, write an expression for the determinant:


this can be solved by factoring:

The solutions are -2 and -7
The eigenvalues are scalar quantities where the determinant of
is equal to zero. First, write an expression for the determinant:
this can be solved by factoring:
The solutions are -2 and -7
← Didn't Know|Knew It →
Which is an eigenvector for the matrix
,
or 
Which is an eigenvector for the matrix ,
or
Tap to reveal answer
To determine if a vector is an eigenvector, multiply with A:
. This cannot be expressed as an integer times
, so
is not an eigenvector
This can be expressed as
, so
is an eigenvector.
To determine if a vector is an eigenvector, multiply with A:
. This cannot be expressed as an integer times
, so
is not an eigenvector
This can be expressed as
, so
is an eigenvector.
← Didn't Know|Knew It →
Tap to reveal answer
← Didn't Know|Knew It →
Tap to reveal answer
← Didn't Know|Knew It →