Diagonalizable Matrix with Eigenvalue 1, -1
Problem 37
Suppose that $A$ is a diagonalizable $n\times n$ matrix and has only $1$ and $-1$ as eigenvalues.
Show that $A^2=I_n$, where $I_n$ is the $n\times n$ identity matrix.
(Stanford University Linear Algebra Exam)
See below for a generalized problem.
Sponsored Links
Hint.
Diagonalize the matrix $A$ so that the diagonal matrix has $\pm 1$ on diagonal entries.
Proof.
Since $A$ is diagonalizable, there exists an invertible matrix $P$ such that $P^{-1}AP=D$, where $D$ is a diagonal matrix.
Since $A$ has only $\pm 1$ as eigenvalues, we can choose $P$ so that the diagonal entries of $D$ are either $\pm 1$.
Then we have $A=PDP^{-1}$ and \(\require{cancel}\)
\begin{align*}
A^2=(PDP^{-1})(PDP^{-1})=(PD\cancel{P}^{-1})(\cancel{P}DP^{-1})=PD^2P^{-1}.
\end{align*}
Note that $D^{2}=I_2$ and thus we have $A^2=I_2$ as required.
Generalization
As a generalization, consider the following problem.
Suppose that $A$ is a diagonalizable $n\times n$ matrix and the eigenvalues of $A$ are $r$-th roots of unity for some positive integer $r$.
Show that $A^r=I_n$, where $I_n$ is the $n\times n$ identity matrix.
The proof of Problem 2 is a straightforward generalization of the proof of Problem 1. So give it a shot.
Related Problem.
For a similar problem, see the post ↴
Finite order matrix and its trace.
This problem is the converse of the current problem in some sense.
Add to solve later
Sponsored Links
More from my site
Two Matrices with the Same Characteristic Polynomial. Diagonalize if Possible.
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 […]- Given Eigenvectors and Eigenvalues, Compute a Matrix Product (Stanford University Exam)
Suppose that $\begin{bmatrix}
1 \\
1
\end{bmatrix}$ is an eigenvector of a matrix $A$ corresponding to the eigenvalue $3$ and that $\begin{bmatrix}
2 \\
1
\end{bmatrix}$ is an eigenvector of $A$ corresponding to the eigenvalue $-2$.
Compute $A^2\begin{bmatrix}
4 […]
- True of False Problems on Determinants and Invertible Matrices
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 an Eigenvector of a Matrix an Eigenvector of its Inverse?
Suppose that $A$ is an $n \times n$ matrix with eigenvalue $\lambda$ and corresponding eigenvector $\mathbf{v}$.
(a) If $A$ is invertible, is $\mathbf{v}$ an eigenvector of $A^{-1}$? If so, what is the corresponding eigenvalue? If not, explain why not.
(b) Is $3\mathbf{v}$ an […]
- Given the Characteristic Polynomial of a Diagonalizable Matrix, Find the Size of the Matrix, Dimension of Eigenspace
Suppose that $A$ is a diagonalizable matrix with characteristic polynomial
\[f_A(\lambda)=\lambda^2(\lambda-3)(\lambda+2)^3(\lambda-4)^3.\]
(a) Find the size of the matrix $A$.
(b) Find the dimension of $E_4$, the eigenspace corresponding to the eigenvalue […]
- If the Kernel of a Matrix $A$ is Trivial, then $A^T A$ is Invertible
Let $A$ be an $m \times n$ real matrix.
Then the kernel of $A$ is defined as $\ker(A)=\{ x\in \R^n \mid Ax=0 \}$.
The kernel is also called the null space of $A$.
Suppose that $A$ is an $m \times n$ real matrix such that $\ker(A)=0$. Prove that $A^{\trans}A$ is […]
The Subspace of Matrices that are Diagonalized by a Fixed Matrix
Suppose that $S$ is a fixed invertible $3$ by $3$ matrix. This question is about all the matrices $A$ that are diagonalized by $S$, so that $S^{-1}AS$ is diagonal. Show that these matrices $A$ form a subspace of $3$ by $3$ matrix space.
(MIT-Massachusetts Institute of Technology […]
Finite Order Matrix and its Trace
Let $A$ be an $n\times n$ matrix and suppose that $A^r=I_n$ for some positive integer $r$. Then show that
(a) $|\tr(A)|\leq n$.
(b) If $|\tr(A)|=n$, then $A=\zeta I_n$ for an $r$-th root of unity $\zeta$.
(c) $\tr(A)=n$ if and only if $A=I_n$.
Proof.
(a) […]
