# Tagged: diagonal matrix

## Problem 585

Consider the Hermitian matrix
$A=\begin{bmatrix} 1 & i\\ -i& 1 \end{bmatrix}.$

(a) Find the eigenvalues of $A$.

(b) For each eigenvalue of $A$, find the eigenvectors.

(c) Diagonalize the Hermitian matrix $A$ by a unitary matrix. Namely, find a diagonal matrix $D$ and a unitary matrix $U$ such that $U^{-1}AU=D$.

## Problem 584

Prove that the matrix
$A=\begin{bmatrix} 0 & 1\\ -1& 0 \end{bmatrix}$ is diagonalizable.
Prove, however, that $A$ cannot be diagonalized by a real nonsingular matrix.
That is, there is no real nonsingular matrix $S$ such that $S^{-1}AS$ is a diagonal matrix.

## Problem 583

Consider the $2\times 2$ complex matrix
$A=\begin{bmatrix} a & b-a\\ 0& b \end{bmatrix}.$

(a) Find the eigenvalues of $A$.

(b) For each eigenvalue of $A$, determine the eigenvectors.

(c) Diagonalize the matrix $A$.

(d) Using the result of the diagonalization, compute and simplify $A^k$ for each positive integer $k$.

## 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$.

## Problem 504

Prove that if $A$ is a diagonalizable nilpotent matrix, then $A$ is the zero matrix $O$.

## Problem 492

Let
$D=\begin{bmatrix} d_1 & 0 & \dots & 0 \\ 0 &d_2 & \dots & 0 \\ \vdots & & \ddots & \vdots \\ 0 & 0 & \dots & d_n \end{bmatrix}$ be a diagonal matrix with distinct diagonal entries: $d_i\neq d_j$ if $i\neq j$.
Let $A=(a_{ij})$ be an $n\times n$ matrix such that $A$ commutes with $D$, that is,
$AD=DA.$ Then prove that $A$ is a diagonal matrix.

## Problem 456

Determine whether the matrix
$A=\begin{bmatrix} 0 & 1 & 0 \\ -1 &0 &0 \\ 0 & 0 & 2 \end{bmatrix}$ is diagonalizable.

If it is diagonalizable, then find the invertible matrix $S$ and a diagonal matrix $D$ such that $S^{-1}AS=D$.

## Problem 439

Is every diagonalizable matrix invertible?

## 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$.

## Problem 423

Determine all $2\times 2$ matrices $A$ such that $A$ has eigenvalues $2$ and $-1$ with corresponding eigenvectors
$\begin{bmatrix} 1 \\ 0 \end{bmatrix} \text{ and } \begin{bmatrix} 2 \\ 1 \end{bmatrix},$ respectively.

## Problem 385

Let
$A=\begin{bmatrix} 2 & -1 & -1 \\ -1 &2 &-1 \\ -1 & -1 & 2 \end{bmatrix}.$ Determine whether the matrix $A$ is diagonalizable. If it is diagonalizable, then diagonalize $A$.
That is, find a nonsingular matrix $A$ and a diagonal matrix $D$ such that $S^{-1}AS=D$.

## Problem 363

(a) Find all the eigenvalues and eigenvectors of the matrix
$A=\begin{bmatrix} 3 & -2\\ 6& -4 \end{bmatrix}.$

(b) Let
$A=\begin{bmatrix} 1 & 0 & 3 \\ 4 &5 &6 \\ 7 & 0 & 9 \end{bmatrix} \text{ and } B=\begin{bmatrix} 2 & 0 & 0 \\ 0 & 3 &0 \\ 0 & 0 & 4 \end{bmatrix}.$ Then find the value of
$\det(A^2B^{-1}A^{-2}B^2).$ (For part (b) without computation, you may assume that $A$ and $B$ are invertible matrices.)

## Problem 336

A complex square ($n\times n$) matrix $A$ is called normal if
$A^* A=A A^*,$ where $A^*$ denotes the conjugate transpose of $A$, that is $A^*=\bar{A}^{\trans}$.
A matrix $A$ is said to be nilpotent if there exists a positive integer $k$ such that $A^k$ is the zero matrix.

(a) Prove that if $A$ is both normal and nilpotent, then $A$ is the zero matrix.
You may use the fact that every normal matrix is diagonalizable.

(b) Give a proof of (a) without referring to eigenvalues and diagonalization.

(c) Let $A, B$ be $n\times n$ complex matrices. Prove that if $A$ is normal and $B$ is nilpotent such that $A+B=I$, then $A=I$, where $I$ is the $n\times n$ identity matrix.

## Problem 315

Let $P_1$ be the vector space of all real polynomials of degree $1$ or less. Consider the linear transformation $T: P_1 \to P_1$ defined by
$T(ax+b)=(3a+b)x+a+3,$ for any $ax+b\in P_1$.

(a) With respect to the basis $B=\{1, x\}$, find the matrix of the linear transformation $T$.

(b) Find a basis $B’$ of the vector space $P_1$ such that the matrix of $T$ with respect to $B’$ is a diagonal matrix.

(c) Express $f(x)=5x+3$ as a linear combination of basis vectors of $B’$.

## Problem 314

Let $T$ be the linear transformation from the vector space $\R^2$ to $\R^2$ itself given by
$T\left( \begin{bmatrix} x_1 \\ x_2 \end{bmatrix} \right)= \begin{bmatrix} 3x_1+x_2 \\ x_1+3x_2 \end{bmatrix}.$

(a) Verify that the vectors
$\mathbf{v}_1=\begin{bmatrix} 1 \\ -1 \end{bmatrix} \text{ and } \mathbf{v}_2=\begin{bmatrix} 1 \\ 1 \end{bmatrix}$ are eigenvectors of the linear transformation $T$, and conclude that $B=\{\mathbf{v}_1, \mathbf{v}_2\}$ is a basis of $\R^2$ consisting of eigenvectors.

(b) Find the matrix of $T$ with respect to the basis $B=\{\mathbf{v}_1, \mathbf{v}_2\}$.

## Problem 287

Let $V$ be the vector space of all $3\times 3$ real matrices.
Let $A$ be the matrix given below and we define
$W=\{M\in V \mid AM=MA\}.$ That is, $W$ consists of matrices that commute with $A$.
Then $W$ is a subspace of $V$.

Determine which matrices are in the subspace $W$ and find the dimension of $W$.

(a) $A=\begin{bmatrix} a & 0 & 0 \\ 0 &b &0 \\ 0 & 0 & c \end{bmatrix},$ where $a, b, c$ are distinct real numbers.

(b) $A=\begin{bmatrix} a & 0 & 0 \\ 0 &a &0 \\ 0 & 0 & b \end{bmatrix},$ where $a, b$ are distinct real numbers.

## Problem 269

Let $A$ be a real skew-symmetric matrix, that is, $A^{\trans}=-A$.
Then prove the following statements.

(a) Each eigenvalue of the real skew-symmetric matrix $A$ is either $0$ or a purely imaginary number.

(b) The rank of $A$ is even.

## Problem 237

Let $A$ be an $n \times n$ matrix. Suppose that all the eigenvalues $\lambda$ of $A$ are real and satisfy $\lambda<1$.

Then show that the determinant $|I-A|>0,$ where $I$ is the $n \times n$ identity matrix.

## Problem 216

Let
$A=\begin{bmatrix} 1 & 3 & 3 \\ -3 &-5 &-3 \\ 3 & 3 & 1 \end{bmatrix} \text{ and } B=\begin{bmatrix} 2 & 4 & 3 \\ -4 &-6 &-3 \\ 3 & 3 & 1 \end{bmatrix}.$ For this problem, you may use the fact that both matrices have the same characteristic polynomial:
$p_A(\lambda)=p_B(\lambda)=-(\lambda-1)(\lambda+2)^2.$

(a) Find all eigenvectors of $A$.

(b) Find all eigenvectors of $B$.

(c) Which matrix $A$ or $B$ is diagonalizable?

(d) Diagonalize the matrix stated in (d), i.e., find an invertible matrix $P$ and a diagonal matrix $D$ such that $A=PDP^{-1}$ or $B=PDP^{-1}$.

(Stanford University Linear Algebra Final Exam Problem)

Let $A, B$ be matrices. Show that if $A$ is diagonalizable and if $B$ is similar to $A$, then $B$ is diagonalizable.