(a) Find the eigenvalues and corresponding eigenvectors of $A$.
(b) Show that for $\mathbf{v}=\begin{bmatrix}
1 \\
0
\end{bmatrix}\in \R^2$, we can choose $n$ large enough so that the length $\|A^n\mathbf{v}\|$ is as small as we like.
(University of California, Berkeley, Linear Algebra Final Exam Problem)
Let $A$ be an $n \times n$ matrix and let $c$ be a complex number.
(a) For each eigenvalue $\lambda$ of $A$, prove that $\lambda+c$ is an eigenvalue of the matrix $A+cI$, where $I$ is the identity matrix. What can you say about the eigenvectors corresponding to $\lambda+c$?
(b) Prove that the algebraic multiplicity of the eigenvalue $\lambda$ of $A$ is the same as the algebraic multiplicity of the eigenvalue $\lambda+c$ of $A+cI$ are equal.
Let
\[A=\begin{bmatrix}
3 & -12 & 4 \\
-1 &0 &-2 \\
-1 & 5 & -1
\end{bmatrix}.\]
Then find all eigenvalues of $A^5$. If $A$ is invertible, then find all the eigenvalues of $A^{-1}$.
Let $A$ be an $n\times n$ complex matrix.
Let $p(x)=\det(xI-A)$ be the characteristic polynomial of $A$ and write it as
\[p(x)=x^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0,\]
where $a_i$ are real numbers.
Let $C$ be the companion matrix of the polynomial $p(x)$ given by
\[C=\begin{bmatrix}
0 & 0 & \dots & 0 &-a_0 \\
1 & 0 & \dots & 0 & -a_1 \\
0 & 1 & \dots & 0 & -a_2 \\
\vdots & & \ddots & & \vdots \\
0 & 0 & \dots & 1 & -a_{n-1}
\end{bmatrix}=
[\mathbf{e}_2, \mathbf{e}_3, \dots, \mathbf{e}_n, -\mathbf{a}],\]
where $\mathbf{e}_i$ is the unit vector in $\C^n$ whose $i$-th entry is $1$ and zero elsewhere, and the vector $\mathbf{a}$ is defined by
\[\mathbf{a}=\begin{bmatrix}
a_0 \\
a_1 \\
\vdots \\
a_{n-1}
\end{bmatrix}.\]
Then prove that the following two statements are equivalent.
There exists a vector $\mathbf{v}\in \C^n$ such that
\[\mathbf{v}, A\mathbf{v}, A^2\mathbf{v}, \dots, A^{n-1}\mathbf{v}\]
form a basis of $\C^n$.
There exists an invertible matrix $S$ such that $S^{-1}AS=C$.
(Namely, $A$ is similar to the companion matrix of its characteristic polynomial.)
Suppose that $A$ is $2\times 2$ matrix that has eigenvalues $-1$ and $3$.
Then for each positive integer $n$ find $a_n$ and $b_n$ such that
\[A^{n+1}=a_nA+b_nI,\]
where $I$ is the $2\times 2$ identity matrix.
Let $V$ be a real vector space of all real sequences
\[(a_i)_{i=1}^{\infty}=(a_1, a_2, \dots).\]
Let $U$ be the subspace of $V$ consisting of all real sequences that satisfy the linear recurrence relation
\[a_{k+2}-5a_{k+1}+3a_{k}=0\]
for $k=1, 2, \dots$.
Let $T$ be the linear transformation from $U$ to $U$ defined by
\[T\big((a_1, a_2, \dots)\big)=(a_2, a_3, \dots). \]
Let $B=\{\mathbf{u}_1, \mathbf{u}_2\}$ be a basis of $U$, where
\begin{align*}
\mathbf{u}_1&=(1, 0, -3, -15, -66, \dots)\\
\mathbf{u}_2&=(0, 1, 5, 22, 95, \dots).
\end{align*}
Let $A$ be the matrix representation of the linear transformation $T: U \to U$ with respect to the basis $B$.
(a) Find the eigenvalues and eigenvectors of $T$.
(b) Use the result of (a), find a sequence $(a_i)_{i=1}^{\infty}$ satisfying the linear recurrence relation $a_{k+2}-5a_{k+1}+3a_{k}=0$ and the initial condition $a_1=1, a_2=1$.
(c) Find the formula for the sequences $(a_i)_{i=1}^{\infty}$ satisfying the linear recurrence relation $a_{k+2}-5a_{k+1}+3a_{k}=0$ and express it using $a_1, a_2$.
Let
\[A=\begin{bmatrix}
a & -1\\
1& 4
\end{bmatrix}\]
be a $2\times 2$ matrix, where $a$ is some real number.
Suppose that the matrix $A$ has an eigenvalue $3$.
(a) Determine the value of $a$.
(b) Does the matrix $A$ have eigenvalues other than $3$?
For a real number $0\leq \theta \leq \pi$, we define the real $3\times 3$ matrix $A$ by
\[A=\begin{bmatrix}
\cos\theta & -\sin\theta & 0 \\
\sin\theta &\cos\theta &0 \\
0 & 0 & 1
\end{bmatrix}.\]