1.1Check an Eigenvector
Let
and
Is $v$ an eigenvector of $A$? If so, what is the eigenvalue?
Solution
Compute
Since
$v$ is an eigenvector and the eigenvalue is $2$.
Pomodoro
Showing all 27 problems
Progress
0 of 27 completed
Difficulty
Let
and
Is $v$ an eigenvector of $A$? If so, what is the eigenvalue?
Solution
Compute
Since
$v$ is an eigenvector and the eigenvalue is $2$.
Find the eigenvalues of
Solution
For a triangular matrix, the eigenvalues are the diagonal entries.
So the eigenvalues are
Find the eigenvalues of
Solution
Form the characteristic equation:
Set this equal to $0$:
Factor:
So the eigenvalues are
For
find a basis for the eigenspace corresponding to $\lambda = 4$.
Solution
Compute
Solve
This gives
so $y = x$.
A basis for the eigenspace is
A $2 \times 2$ matrix has eigenvalues $6$ and $k$. Its trace is $11$.
What is $k$?
Solution
The trace equals the sum of the eigenvalues:
So
A matrix has eigenvalues $3$, $0$, and $-2$.
Is the matrix invertible?
Solution
A matrix is invertible if and only if $0$ is not an eigenvalue.
Since $0$ is one of the eigenvalues here, the matrix is not invertible.
The characteristic polynomial of a matrix is
What is the algebraic multiplicity of $\lambda = 2$?
Solution
The algebraic multiplicity is the multiplicity of the root in the characteristic polynomial.
Since $(\lambda - 2)$ appears three times, the algebraic multiplicity of $2$ is $3$.
What are the only possible eigenvalues of a projection matrix $P$ satisfying
Solution
If $Pv = \lambda v$ for an eigenvector $v \ne 0$, then
But $P^2 = P$, so also
Thus
so
Therefore the only possible eigenvalues are
Find the eigenvalues of
Solution
Compute the characteristic equation:
So
Therefore the eigenvalues are
Find the eigenvalues of
Solution
For a $2 \times 2$ matrix, use the characteristic polynomial:
Factor:
So the eigenvalues are
Difficulty
For
find a basis for each eigenspace.
Solution
From the characteristic equation, the eigenvalues are $5$ and $2$.
For $\lambda = 5$,
This gives $y = x$, so a basis is
For $\lambda = 2$,
This gives $2x + y = 0$, so a basis is
For
find the algebraic multiplicity and geometric multiplicity of the eigenvalue $3$.
Solution
The characteristic polynomial is
So the algebraic multiplicity of $3$ is $2$.
Now compute the eigenspace:
Solving
gives $y = 0$.
So the eigenspace is
which has dimension $1$.
Therefore the geometric multiplicity is $1$.
Is
diagonalizable?
Solution
The matrix is upper triangular, so its eigenvalues are the diagonal entries:
The eigenvalue $2$ has algebraic multiplicity $2$.
Now compute
From $(A-2I)v=0$, we get $y=0$ and $z=0$, with $x$ free. So the eigenspace for $\lambda=2$ has dimension $1$.
That is not enough independent eigenvectors. The matrix is not diagonalizable.
Suppose a matrix has the eigenpairs
and
Write the matrices $P$ and $D$ for the diagonalization $A = P D P^{-1}$.
Solution
Put the eigenvectors into the columns of $P$ in the same order as the eigenvalues in $D$:
The diagonal matrix is
You found that the eigenvalues of
are $5$ and $1$.
Use the trace and determinant to check whether this is correct.
Solution
The trace of $A$ is
The sum of the proposed eigenvalues is
The determinant of $A$ is
The product of the proposed eigenvalues is
Since the product does not match the determinant, the proposed eigenvalues are not correct.
For
find the eigenvalues and one eigenvector for each. Then check whether the two eigenvectors are orthogonal.
Solution
Compute the characteristic polynomial:
Factor:
So the eigenvalues are $1$ and $3$.
For $\lambda = 3$,
so $y = x$ and one eigenvector is
For $\lambda = 1$,
so $x + y = 0$ and one eigenvector is
Their dot product is
so the eigenvectors are orthogonal.
Suppose a matrix satisfies
What can you conclude about its eigenvalues and determinant?
Solution
If $Av = \lambda v$ for an eigenvector $v \ne 0$, then
But $A^3 = 0$, so $A^3v = 0$. Since $v \ne 0$, this forces
so $\lambda = 0$.
Therefore every eigenvalue is $0$.
The determinant is the product of the eigenvalues, so
Find the eigenvalues of
Solution
Compute the characteristic polynomial:
Set this equal to $0$:
Use the quadratic formula:
So the eigenvalues are
and
Difficulty
A discrete system is defined by
Suppose the eigenvalues of $A$ are
What happens to the two eigenmodes as $k$ gets large?
Solution
Each eigenmode is scaled by its eigenvalue at every step.
The mode with eigenvalue $\frac{1}{4}$ decays toward $0$ because
The mode with eigenvalue $\frac{3}{2}$ grows without bound because
So the component in the $\frac{1}{4}$-direction dies out, while the component in the $\frac{3}{2}$-direction dominates.
Consider the system
where $A$ has eigenvalues $-2$ and $0$.
What do these eigenvalues say about the two modes of the solution?
Solution
For a linear system $x'(t) = Ax(t)$, an eigenvalue $\lambda$ produces a mode that behaves like $e^{\lambda t}$.
The mode for $\lambda = -2$ is
so it decays to $0$ as $t$ increases.
The mode for $\lambda = 0$ is
so it stays constant in size.
Thus one mode decays and the other remains neutral.
Let
Find a nonzero vector $v$ such that
Solution
The equation $Pv = v$ means $v$ is an eigenvector for eigenvalue $1$.
So solve
That gives
From the first row,
so
One nonzero fixed vector is
Suppose $v_1$ and $v_2$ are eigenvectors of $A$ with eigenvalues $3$ and $\frac{1}{3}$, respectively. Let
Find a formula for $A^k x$.
Solution
Use the eigenvector rules:
and
Therefore
For the symmetric matrix
which direction is stretched more, and by how much?
Solution
Find the eigenvalues:
Factor:
So the stretch factors are $5$ and $3$.
The larger stretch is in the direction of the eigenvector for $\lambda = 5$, which satisfies $y = x$. So the direction is
The smaller stretch is in the direction of the eigenvector for $\lambda = 3$, which satisfies $y = -x$. So the direction is
Difficulty
For
for what values of $k$ is $A$ diagonalizable?
Solution
Because $A$ is triangular, the eigenvalues are
If $k \ne 2$, then the matrix has two distinct eigenvalues, so it is diagonalizable.
If $k = 2$, then
This is the repeated-eigenvalue case from the notes. Its eigenspace has dimension $1$, so it is not diagonalizable.
Therefore $A$ is diagonalizable exactly when
Consider
Find the eigenvalues, their algebraic multiplicities, and decide whether $B$ is diagonalizable.
Solution
Since $B$ is triangular, the eigenvalues are the diagonal entries:
So the algebraic multiplicity of $1$ is $2$, and the algebraic multiplicity of $-1$ is $1$.
Now check the eigenspace for $\lambda = 1$:
Solving $(B-I)v = 0$ gives $y = 0$ and $z = 0$, with $x$ free. So the eigenspace for $1$ has dimension $1$.
That is fewer than its algebraic multiplicity, so $B$ does not have three independent eigenvectors.
Therefore $B$ is not diagonalizable.
A real $2 \times 2$ orthogonal matrix has determinant $1$ and trace $0$.
What are its eigenvalues?
Solution
Let the eigenvalues be $\lambda_1$ and $\lambda_2$.
For a $2 \times 2$ matrix, the sum of the eigenvalues equals the trace and the product equals the determinant.
So
and
This gives the characteristic equation
Thus the eigenvalues are
A real $2 \times 2$ matrix has trace $4$ and determinant $13$.
Find its eigenvalues.
Solution
For a $2 \times 2$ matrix, the characteristic polynomial is
So here it is
Set this equal to $0$:
Use the quadratic formula:
So the eigenvalues are
and
Since neither eigenvalue is real, this matrix has no real eigenvectors associated with these eigenvalues.