Operations and Properties - Linear Algebra
Card 1 of 2140
.
Which of the following is a consequence of the Cayley-Hamilton Theorem?
(Note:
and
refer to the two-by-two identity and zero matrices, respectively.)
.
Which of the following is a consequence of the Cayley-Hamilton Theorem?
(Note: and
refer to the two-by-two identity and zero matrices, respectively.)
Tap to reveal answer
The Cayley-Hamilton Theorem states that a square matrix
is a solution of its own characteristic equation. To find this, first find the polynomial formed from the determinant of
. This matrix is


Multiply
by each element in the identity:

Subtract elementwise:

Take the determinant by taking the product of the upper-left and lower-right entries, and subtracting the product of the other two:




The characteristic equation is

By the Cayley-Hamilton Theorem, the matrix
is a solution to this equation, so the correct choice is the above equation, modified for matrix arithmetic:

The Cayley-Hamilton Theorem states that a square matrix is a solution of its own characteristic equation. To find this, first find the polynomial formed from the determinant of
. This matrix is
Multiply by each element in the identity:
Subtract elementwise:
Take the determinant by taking the product of the upper-left and lower-right entries, and subtracting the product of the other two:
The characteristic equation is
By the Cayley-Hamilton Theorem, the matrix is a solution to this equation, so the correct choice is the above equation, modified for matrix arithmetic:
← Didn't Know|Knew It →
.
Which of the following is a consequence of the Cayley-Hamilton Theorem?
(Note:
and
refer to the two-by-two identity and zero matrices, respectively.)
.
Which of the following is a consequence of the Cayley-Hamilton Theorem?
(Note: and
refer to the two-by-two identity and zero matrices, respectively.)
Tap to reveal answer
The Cayley-Hamilton Theorem states that a square matrix
is a solution of its own characteristic equation. To find this, first find the polynomial formed from the determinant of
. This matrix is


Multiply
by each element in the identity:

Subtract elementwise:

Take the determinant by taking the product of the upper-left and lower-right entries, and subtracting the product of the other two:




The characteristic equation is

By the Cayley-Hamilton Theorem, the matrix
is a solution to this equation, so the correct choice is the above equation, modified for matrix arithmetic:

The Cayley-Hamilton Theorem states that a square matrix is a solution of its own characteristic equation. To find this, first find the polynomial formed from the determinant of
. This matrix is
Multiply by each element in the identity:
Subtract elementwise:
Take the determinant by taking the product of the upper-left and lower-right entries, and subtracting the product of the other two:
The characteristic equation is
By the Cayley-Hamilton Theorem, the matrix is a solution to this equation, so the correct choice is the above equation, modified for matrix arithmetic:
← Didn't Know|Knew It →
.
Which of the following is a consequence of the Cayley-Hamilton Theorem?
(Note:
and
refer to the two-by-two identity and zero matrices, respectively.)
.
Which of the following is a consequence of the Cayley-Hamilton Theorem?
(Note: and
refer to the two-by-two identity and zero matrices, respectively.)
Tap to reveal answer
The Cayley-Hamilton Theorem states that a square matrix
is a solution of its own characteristic equation. To find this, first find the polynomial formed from the determinant of
. This matrix is


Multiply
by each element in the identity:

Subtract elementwise:

Take the determinant by taking the product of the upper-left and lower-right entries, and subtracting the product of the other two:




The characteristic equation is

By the Cayley-Hamilton Theorem, the matrix
is a solution to this equation, so the correct choice is the above equation, modified for matrix arithmetic:

The Cayley-Hamilton Theorem states that a square matrix is a solution of its own characteristic equation. To find this, first find the polynomial formed from the determinant of
. This matrix is
Multiply by each element in the identity:
Subtract elementwise:
Take the determinant by taking the product of the upper-left and lower-right entries, and subtracting the product of the other two:
The characteristic equation is
By the Cayley-Hamilton Theorem, the matrix is a solution to this equation, so the correct choice is the above equation, modified for matrix arithmetic:
← Didn't Know|Knew It →
.
Which of the following is a consequence of the Cayley-Hamilton Theorem?
(Note:
and
refer to the two-by-two identity and zero matrices, respectively.)
.
Which of the following is a consequence of the Cayley-Hamilton Theorem?
(Note: and
refer to the two-by-two identity and zero matrices, respectively.)
Tap to reveal answer
The Cayley-Hamilton Theorem states that a square matrix
is a solution of its own characteristic equation. To find this, first find the polynomial formed from the determinant of
. This matrix is


Multiply
by each element in the identity:

Subtract elementwise:

Take the determinant by taking the product of the upper-left and lower-right entries, and subtracting the product of the other two:




The characteristic equation is

By the Cayley-Hamilton Theorem, the matrix
is a solution to this equation, so the correct choice is the above equation, modified for matrix arithmetic:

The Cayley-Hamilton Theorem states that a square matrix is a solution of its own characteristic equation. To find this, first find the polynomial formed from the determinant of
. This matrix is
Multiply by each element in the identity:
Subtract elementwise:
Take the determinant by taking the product of the upper-left and lower-right entries, and subtracting the product of the other two:
The characteristic equation is
By the Cayley-Hamilton Theorem, the matrix is a solution to this equation, so the correct choice is the above equation, modified for matrix arithmetic:
← Didn't Know|Knew It →
A
matrix has as its set of eigenvalues
.
True, false, or indeterminate: the matrix is singular.
A matrix has as its set of eigenvalues
.
True, false, or indeterminate: the matrix is singular.
Tap to reveal answer
A matrix is singular - that is, not having an inverse - if and only if one of its eigenvalues is 0. This is seen to be the case.
A matrix is singular - that is, not having an inverse - if and only if one of its eigenvalues is 0. This is seen to be the case.
← Didn't Know|Knew It →
The eigenvalues of a four-by-four matrix are:

Which one is the dominant eigenvalue?
The eigenvalues of a four-by-four matrix are:
Which one is the dominant eigenvalue?
Tap to reveal answer
An eigenvalue is a dominant eigenvalue if its absolute value is strictly greater than those of all other eigenvalues. The absolute values of all four eigenvalues are as follows:




;
therefore, the dominant eigenvalue is
.
An eigenvalue is a dominant eigenvalue if its absolute value is strictly greater than those of all other eigenvalues. The absolute values of all four eigenvalues are as follows:
;
therefore, the dominant eigenvalue is .
← Didn't Know|Knew It →
A
matrix has as its set of eigenvalues
.
True, false, or indeterminate: the matrix is singular.
A matrix has as its set of eigenvalues
.
True, false, or indeterminate: the matrix is singular.
Tap to reveal answer
A matrix is singular - that is, not having an inverse - if and only if one of its eigenvalues is 0. This is seen to be the case.
A matrix is singular - that is, not having an inverse - if and only if one of its eigenvalues is 0. This is seen to be the case.
← Didn't Know|Knew It →
The eigenvalues of a four-by-four matrix are:

Which one is the dominant eigenvalue?
The eigenvalues of a four-by-four matrix are:
Which one is the dominant eigenvalue?
Tap to reveal answer
An eigenvalue is a dominant eigenvalue if its absolute value is strictly greater than those of all other eigenvalues. The absolute values of all four eigenvalues are as follows:




;
therefore, the dominant eigenvalue is
.
An eigenvalue is a dominant eigenvalue if its absolute value is strictly greater than those of all other eigenvalues. The absolute values of all four eigenvalues are as follows:
;
therefore, the dominant eigenvalue is .
← Didn't Know|Knew It →
A
matrix has as its set of eigenvalues
.
True, false, or indeterminate: the matrix is singular.
A matrix has as its set of eigenvalues
.
True, false, or indeterminate: the matrix is singular.
Tap to reveal answer
A matrix is singular - that is, not having an inverse - if and only if one of its eigenvalues is 0. This is seen to be the case.
A matrix is singular - that is, not having an inverse - if and only if one of its eigenvalues is 0. This is seen to be the case.
← Didn't Know|Knew It →
The eigenvalues of a four-by-four matrix are:

Which one is the dominant eigenvalue?
The eigenvalues of a four-by-four matrix are:
Which one is the dominant eigenvalue?
Tap to reveal answer
An eigenvalue is a dominant eigenvalue if its absolute value is strictly greater than those of all other eigenvalues. The absolute values of all four eigenvalues are as follows:




;
therefore, the dominant eigenvalue is
.
An eigenvalue is a dominant eigenvalue if its absolute value is strictly greater than those of all other eigenvalues. The absolute values of all four eigenvalues are as follows:
;
therefore, the dominant eigenvalue is .
← Didn't Know|Knew It →
A
matrix has as its set of eigenvalues
.
True, false, or indeterminate: the matrix is singular.
A matrix has as its set of eigenvalues
.
True, false, or indeterminate: the matrix is singular.
Tap to reveal answer
A matrix is singular - that is, not having an inverse - if and only if one of its eigenvalues is 0. This is seen to be the case.
A matrix is singular - that is, not having an inverse - if and only if one of its eigenvalues is 0. This is seen to be the case.
← Didn't Know|Knew It →
The eigenvalues of a four-by-four matrix are:

Which one is the dominant eigenvalue?
The eigenvalues of a four-by-four matrix are:
Which one is the dominant eigenvalue?
Tap to reveal answer
An eigenvalue is a dominant eigenvalue if its absolute value is strictly greater than those of all other eigenvalues. The absolute values of all four eigenvalues are as follows:




;
therefore, the dominant eigenvalue is
.
An eigenvalue is a dominant eigenvalue if its absolute value is strictly greater than those of all other eigenvalues. The absolute values of all four eigenvalues are as follows:
;
therefore, the dominant eigenvalue is .
← Didn't Know|Knew It →
The characteristic equation of a three-by-three matrix is

Which of the following is its dominant eigenvalue?
The characteristic equation of a three-by-three matrix is
Which of the following is its dominant eigenvalue?
Tap to reveal answer
The eigenvalues of a matrix are the zeroes of its characteristic equation.
We can try to extract one or more zeroes using the Rational Zeroes Theorem, which states that any rational zero must be the positive or negative quotient of a factor of the constant and a factor of the leading coefficient. Since the constant is 57, and the leading coefficient of the polynomial is 1, any rational zeroes must be one of the set
divided by 1, with positive or native numbers taken into account. Thus, any rational zeroes must be in the set

By trial and error, it can be determined that 3 is a solution of the equation:



True.
It follows that
is a factor. Divide
by
; the quotient can be found to be
, which is prime.
The characteristic equation is factorable as

We already know that
is an eigenvalue; the other two eigenvalues are the zeroes of
, which can be found by way of the quadratic formula:


An eigenvalue is a dominant eigenvalue if its absolute value is strictly greater than those of all other eigenvalues. Calculate the absolute values of all three eigenvalues:













Therefore,
.
Since no single eigenvalue has absolute value strictly greater than that of the other two, the matrix has no dominant eigenvalue.
The eigenvalues of a matrix are the zeroes of its characteristic equation.
We can try to extract one or more zeroes using the Rational Zeroes Theorem, which states that any rational zero must be the positive or negative quotient of a factor of the constant and a factor of the leading coefficient. Since the constant is 57, and the leading coefficient of the polynomial is 1, any rational zeroes must be one of the set divided by 1, with positive or native numbers taken into account. Thus, any rational zeroes must be in the set
By trial and error, it can be determined that 3 is a solution of the equation:
True.
It follows that is a factor. Divide
by
; the quotient can be found to be
, which is prime.
The characteristic equation is factorable as
We already know that is an eigenvalue; the other two eigenvalues are the zeroes of
, which can be found by way of the quadratic formula:
An eigenvalue is a dominant eigenvalue if its absolute value is strictly greater than those of all other eigenvalues. Calculate the absolute values of all three eigenvalues:
Therefore,
.
Since no single eigenvalue has absolute value strictly greater than that of the other two, the matrix has no dominant eigenvalue.
← Didn't Know|Knew It →
, the set of all continuous functions defined on
, is a vector space under the usual rules of addition and scalar multiplication.
True or false: The set of all functions of the form

where
is a real number, is a subspace of
.
, the set of all continuous functions defined on
, is a vector space under the usual rules of addition and scalar multiplication.
True or false: The set of all functions of the form
where is a real number, is a subspace of
.
Tap to reveal answer
Let
.
We can show through counterexample that this is not a subspace of
.
Let
. This is an element of
.
One condition for
to be a subspace of a vector space is closure under scalar multiplication. Multiply
by scalar
. The product is the function
.
.
This violates a criterion for a subspace, so
is not a subspace of
.
Let .
We can show through counterexample that this is not a subspace of .
Let . This is an element of
.
One condition for to be a subspace of a vector space is closure under scalar multiplication. Multiply
by scalar
. The product is the function
.
.
This violates a criterion for a subspace, so is not a subspace of
.
← Didn't Know|Knew It →
A matrix
has
as its set of eigenvalues.
Give the set of eigenvalues of
.
A matrix has
as its set of eigenvalues.
Give the set of eigenvalues of .
Tap to reveal answer
If
is nonsingular, the set of eigenvalues of
is exactly the set of reciprocals of eigenvalues of
. The eigenvalues of
are
, so the eigenvalues of these numbers are the reciprocals of these. The reciprocal of
is
.
Similarly,



The set of eigenvalues of
is
.
If is nonsingular, the set of eigenvalues of
is exactly the set of reciprocals of eigenvalues of
. The eigenvalues of
are
, so the eigenvalues of these numbers are the reciprocals of these. The reciprocal of
is
.
Similarly,
The set of eigenvalues of is
.
← Didn't Know|Knew It →
A matrix
has
as its set of eigenvalues.
Give the set of eigenvalues of
.
A matrix has
as its set of eigenvalues.
Give the set of eigenvalues of .
Tap to reveal answer
If
is nonsingular, the set of eigenvalues of
is exactly the set of reciprocals of eigenvalues of
. The eigenvalues of
are
, so the eigenvalues of these numbers are the reciprocals of these. The reciprocal of
is
.
Similarly,



The set of eigenvalues of
is
.
If is nonsingular, the set of eigenvalues of
is exactly the set of reciprocals of eigenvalues of
. The eigenvalues of
are
, so the eigenvalues of these numbers are the reciprocals of these. The reciprocal of
is
.
Similarly,
The set of eigenvalues of is
.
← Didn't Know|Knew It →
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?
Tap to reveal answer
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.
← Didn't Know|Knew It →
Let
.
Define
as the set of all
matrices, and
as the set of all polynomials in
of dimension
or less.
True or false:
and
are isomorphic linear spaces.
Let .
Define as the set of all
matrices, and
as the set of all polynomials in
of dimension
or less.
True or false: and
are isomorphic linear spaces.
Tap to reveal answer
Two linear spaces are isomorphic if and only if they are of the same dimension, or, equivalently, the size of a basis of each includes the same number of elements.
is the set of
matrices; each such matrix includes 4 elements, so it has four elements in one of its bases; for example, one such basis is

is the set of all polynomials in
of degree 4 or less - that is, all polynomials of the form

Each polynomial is defined by five coefficients, so the dimension of
is 5. Each basis of
has five elements; for example, one such basis is
.
Since
, the spaces are not isomorphic.
Two linear spaces are isomorphic if and only if they are of the same dimension, or, equivalently, the size of a basis of each includes the same number of elements.
is the set of
matrices; each such matrix includes 4 elements, so it has four elements in one of its bases; for example, one such basis is
is the set of all polynomials in
of degree 4 or less - that is, all polynomials of the form
Each polynomial is defined by five coefficients, so the dimension of is 5. Each basis of
has five elements; for example, one such basis is
.
Since , the spaces are not isomorphic.
← Didn't Know|Knew It →
The characteristic equation of a three-by-three matrix is

Which of the following is its dominant eigenvalue?
The characteristic equation of a three-by-three matrix is
Which of the following is its dominant eigenvalue?
Tap to reveal answer
The eigenvalues of a matrix are the zeroes of its characteristic equation.
We can try to extract one or more zeroes using the Rational Zeroes Theorem, which states that any rational zero must be the positive or negative quotient of a factor of the constant and a factor of the leading coefficient. Since the constant is 57, and the leading coefficient of the polynomial is 1, any rational zeroes must be one of the set
divided by 1, with positive or native numbers taken into account. Thus, any rational zeroes must be in the set

By trial and error, it can be determined that 3 is a solution of the equation:



True.
It follows that
is a factor. Divide
by
; the quotient can be found to be
, which is prime.
The characteristic equation is factorable as

We already know that
is an eigenvalue; the other two eigenvalues are the zeroes of
, which can be found by way of the quadratic formula:


An eigenvalue is a dominant eigenvalue if its absolute value is strictly greater than those of all other eigenvalues. Calculate the absolute values of all three eigenvalues:













Therefore,
.
Since no single eigenvalue has absolute value strictly greater than that of the other two, the matrix has no dominant eigenvalue.
The eigenvalues of a matrix are the zeroes of its characteristic equation.
We can try to extract one or more zeroes using the Rational Zeroes Theorem, which states that any rational zero must be the positive or negative quotient of a factor of the constant and a factor of the leading coefficient. Since the constant is 57, and the leading coefficient of the polynomial is 1, any rational zeroes must be one of the set divided by 1, with positive or native numbers taken into account. Thus, any rational zeroes must be in the set
By trial and error, it can be determined that 3 is a solution of the equation:
True.
It follows that is a factor. Divide
by
; the quotient can be found to be
, which is prime.
The characteristic equation is factorable as
We already know that is an eigenvalue; the other two eigenvalues are the zeroes of
, which can be found by way of the quadratic formula:
An eigenvalue is a dominant eigenvalue if its absolute value is strictly greater than those of all other eigenvalues. Calculate the absolute values of all three eigenvalues:
Therefore,
.
Since no single eigenvalue has absolute value strictly greater than that of the other two, the matrix has no dominant eigenvalue.
← Didn't Know|Knew It →
Let
.
Define
as the set of all
matrices, and
as the set of all polynomials in
of dimension
or less.
True or false:
and
are isomorphic linear spaces.
Let .
Define as the set of all
matrices, and
as the set of all polynomials in
of dimension
or less.
True or false: and
are isomorphic linear spaces.
Tap to reveal answer
Two linear spaces are isomorphic if and only if they are of the same dimension, or, equivalently, the size of a basis of each includes the same number of elements.
is the set of
matrices; each such matrix includes 4 elements, so it has four elements in one of its bases; for example, one such basis is

is the set of all polynomials in
of degree 4 or less - that is, all polynomials of the form

Each polynomial is defined by five coefficients, so the dimension of
is 5. Each basis of
has five elements; for example, one such basis is
.
Since
, the spaces are not isomorphic.
Two linear spaces are isomorphic if and only if they are of the same dimension, or, equivalently, the size of a basis of each includes the same number of elements.
is the set of
matrices; each such matrix includes 4 elements, so it has four elements in one of its bases; for example, one such basis is
is the set of all polynomials in
of degree 4 or less - that is, all polynomials of the form
Each polynomial is defined by five coefficients, so the dimension of is 5. Each basis of
has five elements; for example, one such basis is
.
Since , the spaces are not isomorphic.
← Didn't Know|Knew It →