Tagged: eigenvector

Diagonalize the Complex Symmetric 3 by 3 Matrix with $\sin x$ and $\cos x$

Problem 533

Consider the complex matrix
\[A=\begin{bmatrix}
\sqrt{2}\cos x & i \sin x & 0 \\
i \sin x &0 &-i \sin x \\
0 & -i \sin x & -\sqrt{2} \cos x
\end{bmatrix},\] where $x$ is a real number between $0$ and $2\pi$.

Determine for which values of $x$ the matrix $A$ is diagonalizable.
When $A$ is diagonalizable, find a diagonal matrix $D$ so that $P^{-1}AP=D$ for some nonsingular matrix $P$.

 

Read solution

FavoriteLoadingAdd to solve later

Unit Vectors and Idempotent Matrices

Problem 527

A square matrix $A$ is called idempotent if $A^2=A$.


(a) Let $\mathbf{u}$ be a vector in $\R^n$ with length $1$.
Define the matrix $P$ to be $P=\mathbf{u}\mathbf{u}^{\trans}$.

Prove that $P$ is an idempotent matrix.


(b) Suppose that $\mathbf{u}$ and $\mathbf{v}$ be unit vectors in $\R^n$ such that $\mathbf{u}$ and $\mathbf{v}$ are orthogonal.
Let $Q=\mathbf{u}\mathbf{u}^{\trans}+\mathbf{v}\mathbf{v}^{\trans}$.

Prove that $Q$ is an idempotent matrix.


(c) Prove that each nonzero vector of the form $a\mathbf{u}+b\mathbf{v}$ for some $a, b\in \R$ is an eigenvector corresponding to the eigenvalue $1$ for the matrix $Q$ in part (b).

 

Read solution

FavoriteLoadingAdd to solve later

Compute $A^{10}\mathbf{v}$ Using Eigenvalues and Eigenvectors of the Matrix $A$

Problem 485

Let
\[A=\begin{bmatrix}
1 & -14 & 4 \\
-1 &6 &-2 \\
-2 & 24 & -7
\end{bmatrix} \quad \text{ and }\quad \mathbf{v}=\begin{bmatrix}
4 \\
-1 \\
-7
\end{bmatrix}.\] Find $A^{10}\mathbf{v}$.

You may use the following information without proving it.
The eigenvalues of $A$ are $-1, 0, 1$. The eigenspaces are given by
\[E_{-1}=\Span\left\{\, \begin{bmatrix}
3 \\
-1 \\
-5
\end{bmatrix} \,\right\}, \quad E_{0}=\Span\left\{\, \begin{bmatrix}
-2 \\
1 \\
4
\end{bmatrix} \,\right\}, \quad E_{1}=\Span\left\{\, \begin{bmatrix}
-4 \\
2 \\
7
\end{bmatrix} \,\right\}.\]

(The Ohio State University, Linear Algebra Final Exam Problem)

 

Read solution

FavoriteLoadingAdd to solve later

A Linear Transformation Preserves Exactly Two Lines If and Only If There are Two Real Non-Zero Eigenvalues

Problem 472

Let $T:\R^2 \to \R^2$ be a linear transformation and let $A$ be the matrix representation of $T$ with respect to the standard basis of $\R^2$.

Prove that the following two statements are equivalent.

(a) There are exactly two distinct lines $L_1, L_2$ in $\R^2$ passing through the origin that are mapped onto themselves:
\[T(L_1)=L_1 \text{ and } T(L_2)=L_2.\]

(b) The matrix $A$ has two distinct nonzero real eigenvalues.

 

Read solution

FavoriteLoadingAdd to solve later

Diagonalize a 2 by 2 Matrix $A$ and Calculate the Power $A^{100}$

Problem 466

Let
\[A=\begin{bmatrix}
1 & 2\\
4& 3
\end{bmatrix}.\]

(a) Find eigenvalues of the matrix $A$.

(b) Find eigenvectors for each eigenvalue of $A$.

(c) Diagonalize the matrix $A$. That is, find an invertible matrix $S$ and a diagonal matrix $D$ such that $S^{-1}AS=D$.

(d) Diagonalize the matrix $A^3-5A^2+3A+I$, where $I$ is the $2\times 2$ identity matrix.

(e) Calculate $A^{100}$. (You do not have to compute $5^{100}$.)

(f) Calculate
\[(A^3-5A^2+3A+I)^{100}.\] Let $w=2^{100}$. Express the solution in terms of $w$.

 

Read solution

FavoriteLoadingAdd to solve later

A Matrix Equation of a Symmetric Matrix and the Limit of its Solution

Problem 457

Let $A$ be a real symmetric $n\times n$ matrix with $0$ as a simple eigenvalue (that is, the algebraic multiplicity of the eigenvalue $0$ is $1$), and let us fix a vector $\mathbf{v}\in \R^n$.

(a) Prove that for sufficiently small positive real $\epsilon$, the equation
\[A\mathbf{x}+\epsilon\mathbf{x}=\mathbf{v}\] has a unique solution $\mathbf{x}=\mathbf{x}(\epsilon) \in \R^n$.

(b) Evaluate
\[\lim_{\epsilon \to 0^+} \epsilon \mathbf{x}(\epsilon)\] in terms of $\mathbf{v}$, the eigenvectors of $A$, and the inner product $\langle\, ,\,\rangle$ on $\R^n$.

 
(University of California, Berkeley, Linear Algebra Qualifying Exam)


Read solution

FavoriteLoadingAdd to solve later

True of False Problems on Determinants and Invertible Matrices

Problem 438

Determine whether each of the following statements is True or False.

(a) If $A$ and $B$ are $n \times n$ matrices, and $P$ is an invertible $n \times n$ matrix such that $A=PBP^{-1}$, then $\det(A)=\det(B)$.

(b) If the characteristic polynomial of an $n \times n$ matrix $A$ is
\[p(\lambda)=(\lambda-1)^n+2,\] then $A$ is invertible.

(c) If $A^2$ is an invertible $n\times n$ matrix, then $A^3$ is also invertible.

(d) If $A$ is a $3\times 3$ matrix such that $\det(A)=7$, then $\det(2A^{\trans}A^{-1})=2$.

(e) If $\mathbf{v}$ is an eigenvector of an $n \times n$ matrix $A$ with corresponding eigenvalue $\lambda_1$, and if $\mathbf{w}$ is an eigenvector of $A$ with corresponding eigenvalue $\lambda_2$, then $\mathbf{v}+\mathbf{w}$ is an eigenvector of $A$ with corresponding eigenvalue $\lambda_1+\lambda_2$.

(Stanford University, Linear Algebra Exam Problem)
 

Read solution

FavoriteLoadingAdd to solve later

If Two Matrices Have the Same Eigenvalues with Linearly Independent Eigenvectors, then They Are Equal

Problem 424

Let $A$ and $B$ be $n\times n$ matrices.
Suppose that $A$ and $B$ have the same eigenvalues $\lambda_1, \dots, \lambda_n$ with the same corresponding eigenvectors $\mathbf{x}_1, \dots, \mathbf{x}_n$.
Prove that if the eigenvectors $\mathbf{x}_1, \dots, \mathbf{x}_n$ are linearly independent, then $A=B$.

 

Read solution

FavoriteLoadingAdd to solve later

Eigenvalues of Orthogonal Matrices Have Length 1. Every $3\times 3$ Orthogonal Matrix Has 1 as an Eigenvalue

Problem 419

(a) Let $A$ be a real orthogonal $n\times n$ matrix. Prove that the length (magnitude) of each eigenvalue of $A$ is $1$


(b) Let $A$ be a real orthogonal $3\times 3$ matrix and suppose that the determinant of $A$ is $1$. Then prove that $A$ has $1$ as an eigenvalue.

 

Read solution

FavoriteLoadingAdd to solve later

A Relation of Nonzero Row Vectors and Column Vectors

Problem 406

Let $A$ be an $n\times n$ matrix. Suppose that $\mathbf{y}$ is a nonzero row vector such that
\[\mathbf{y}A=\mathbf{y}.\] (Here a row vector means a $1\times n$ matrix.)
Prove that there is a nonzero column vector $\mathbf{x}$ such that
\[A\mathbf{x}=\mathbf{x}.\] (Here a column vector means an $n \times 1$ matrix.)

 

Read solution

FavoriteLoadingAdd to solve later