All Linear Algebra Resources
Example Questions
Example Question #471 : Linear Algebra
True or false:
is an eigenvector of the matrix .
True
False
True
A vector is an eigenvector of a matrix if and only if there exists a scalar value - an eigenvalue - such that
;
or, equivalently, must be a scalar multiple of .
Letting and , find by multiplying each row of by - that is, multiplying each element in each row in by the corresponding element in . This is
Since and , it follows that
.
Therefore, such a exists (and is equal to 6), and is indeed an eigenvector of .
Example Question #21 : Eigenvalues And Eigenvectors
True or false:
is an eigenvector of the matrix .
True
False
False
A vector is an eigenvector of a matrix if and only if there exists a scalar value - an eigenvalue - such that
;
or, equivalently, must be a scalar multiple of .
Letting and , find by multiplying each row of by - that is, multiplying each element in each row in by the corresponding element in . This is
, but . Therefore, there cannot exist such that . This means that is not an eigenvector of .
Example Question #21 : Eigenvalues And Eigenvectors
is an example of an elementary matrix. What row operation does it represent?
None of the other choices gives the correct response.
An elementary matrix - a matrix which can pre-multiply a matrix of a linear system to perform a single row operation - must be obtainable by performing a single row operation on the identity matrix, which here is the four-by-four identity
The given matrix switches Rows 2 and 3 in the identity matrix, so the row operation that the matrix represents is the switching of Rows 2 and 3. The notation for this is .
Example Question #481 : Linear Algebra
Suppose we have a square matrix with real-valued entries with only positive eigenvalues. Is invertible? Why or why not?
It is invertible because none of its eigenvalues is
It is not invertible because none of its eigenvalues is negative.
It is invertible because it has no negative eigenvalues.
It is not invertible because is not an eigenvalue
It is invertible because none of its eigenvalues is
The square matrix is certainly invertible with the reason being that none of its eigenvalues is . We know that is not an eigenvalue, so the following
does not hold for any nonzero vector in , i.e.
for all nonzero . So the only vector that maps to the zero vector is the zero vector. In a square matrix, this is equivalent to the null space being the zero vector: . This is also equivalent to the matrix being invertible.
Example Question #25 : Eigenvalues And Eigenvectors
A three-by-three matrix has as its three eigenvalues , , and 1. Give its characteristic equation.
The characteristic equation of a matrix is the polynomial that has as its zeroes the eigenvalues of the matrix. Equivalently, if a matrix has a value as an eigenvalue, then its characteristic equation has as a factor the binomial expression . Since the eigenvalues of the matrix are , , and 1, the polynomial is equal to:
or
Multiply the binomials together:
Example Question #401 : Operations And Properties
A three-by-three matrix has as its three eigenvalues 2, , and . Give its characteristic equation.
The characteristic equation of a matrix is the polynomial that has as its zeroes the eigenvalues of the matrix. Equivalently, if a matrix has a value as an eigenvalue, then its characteristic equation has as a factor the binomial expression . Since the eigenvalues of the matrix are 2, , and ., the polynomial is equal to:
or
Multiply the binomials together:
Example Question #27 : Eigenvalues And Eigenvectors
The characteristic equation of a three-by-three matrix is .
All of the following are eigenvalues of the matrix except for:
The characteristic equation of a matrix is the polynomial that has as its zeroes the eigenvalues of the matrix. Therefore, to find the eigenvalues, set the characteristic equation equal to zero and solve for :
Factor as the difference of two cubes, as follows:
Find the zeroes of both factors.
or
Apply the quadratic formula:
, where
The three eigenvalues of the matrix are , , and 6. Therefore, the one choice that does not given an eigenvalue is .
Example Question #28 : Eigenvalues And Eigenvectors
A four-by-four matrix has as its set of eigenvalues . Give its characteristic equation.
The characteristic equation of a matrix is the polynomial that has as its zeroes the eigenvalues of the matrix. Equivalently, if a matrix has a value as an eigenvalue, then its characteristic equation has as a factor the binomial expression . Since the set of eigenvalues of the matrix is , the polynomial is equal to:
or
Multiply these binomials out:
Example Question #21 : Eigenvalues And Eigenvectors
True or false:
is an eigenvector of .
False
True
True
A vector is an eigenvector of a matrix if and only if there exists a scalar value - an eigenvalue - such that
;
or, equivalently, must be a scalar multiple of .
Letting and , find by multiplying each row of by - that is, multiplying each element in each row in by the corresponding element in . This is
Therefore, there exists a number (equal to ) such that . This makes
an eigenvector of
.
Example Question #22 : Eigenvalues And Eigenvectors
.
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.)
Any eigenvector must be a linear combination of the vectors and .
Any eigenvalue must fall between and 4 inclusive.
Any eigenvalue must be in the set .
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:
Certified Tutor