# Eigenvalues of Similarity Transformations

## Problem 452

Let $A$ be an $n\times n$ complex matrix.
Let $S$ be an invertible matrix.

(a) If $SAS^{-1}=\lambda A$ for some complex number $\lambda$, then prove that either $\lambda^n=1$ or $A$ is a singular matrix.

(b) If $n$ is odd and $SAS^{-1}=-A$, then prove that $0$ is an eigenvalue of $A$.

(c) Suppose that all the eigenvalues of $A$ are integers and $\det(A) > 0$. If $n$ is odd and $SAS^{-1}=A^{-1}$, then prove that $1$ is an eigenvalue of $A$.

## Proof.

### Basic Properties of Determinants

We use the following properties of determinants of matrices.
For $n\times n$ matrices $A, B$, we have

1. $\det(AB)=\det(A)\det(B)$.
2. $\det(A^{-1})=\det(A)^{-1}$ if $A$ is invertible.
3. $\det(cA)=c^n\det(A)$ for any complex number $c$.

### (a) If $SAS^{-1}=\lambda A$, then prove that $\lambda^n=1$ or $A$ is a singular matrix.

Suppose that we have $SAS^{-1}=\lambda A$.
We consider the determinants of both sides and we have
\begin{align*}
\det(SAS^{-1})=\det(\lambda A).
\end{align*}
The left hand side becomes
\begin{align*}
\det(SAS^{-1})&=\det(S)\det(A)\det(S^{-1}) &&\text{by property 1}\\
&=\det(S)\det(A)\det(S)^{-1} &&\text{by property 2}\\
&=\det(A).
\end{align*}
The right hand side is by property 3
$\det(\lambda A)=\lambda^n \det(A).$

Hence we obtain
$\det(A)=\lambda^n \det(A).$ It follows from this that either $\lambda^n=1$ or $\det(A)=0$.
In conclusion, either $\lambda^n=1$ or $A$ is a singular matrix.

### (b) If $n$ is odd and $SAS^{-1}=-A$, then prove that $0$ is an eigenvalue of $A$.

Suppose that we have $SAS^{-1}=-A$.
Then we have
\begin{align*}
&\det(A)=\det(S)\det(A)\det(S)^{-1} \\
&=\det(S)\det(A)\det(S^{-1}) &&\text{by property 2}\\
&=\det(SAS^{-1}) &&\text{by property 1}\\
&=\det(-A) &&\text{by assumption}\\
&=(-1)^n\det(A) &&\text{by property 3}\\
&=-\det(A) &&\text{since $n$ is odd.}\\
\end{align*}

This yields that $\det(A)=0$.
Note that the product of all eigenvalues of $A$ is $\det(A)$.
(See the post “Determinant/Trace and Eigenvalues of a Matrix” for a proof.)
Thus, $0$ is an eigenvalue of $A$.

## Similar Transformation (conjugate)

A transformation $A$ to $SAS^{-1}$, for some invertible matrix $S$, is called a similarity transformation or conjugation of the matrix $A$.

We say that matrices $A$ and $B$ are similar if there exists an invertible matrix $S$ such that $B=SAS^{-1}$.
In other words, $A$ is similar to $B$ if there is a similarity transformation from $A$ to $B$.

Check out the following problems about similar matrices.

Problem. Is the matrix $A=\begin{bmatrix} -1 & 6\\ -2& 6 \end{bmatrix}$ similar to the matrix $B=\begin{bmatrix} 1 & 2\\ -1& 4 \end{bmatrix}$?

For a solution together with similar problems, see the post “Determine whether given matrices are similar“.

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

For a proof, see the post “A matrix similar to a diagonalizable matrix is also diagonalizable“.

### More from my site

• A Matrix Similar to a Diagonalizable Matrix is Also Diagonalizable Let $A, B$ be matrices. Show that if $A$ is diagonalizable and if $B$ is similar to $A$, then $B$ is diagonalizable.   Definitions/Hint. Recall the relevant definitions. Two matrices $A$ and $B$ are similar if there exists a nonsingular (invertible) matrix $S$ such […]
• If Two Matrices are Similar, then their Determinants are the Same Prove that if $A$ and $B$ are similar matrices, then their determinants are the same.   Proof. Suppose that $A$ and $B$ are similar. Then there exists a nonsingular matrix $S$ such that $S^{-1}AS=B$ by definition. Then we […]
• An Example of a Real Matrix that Does Not Have Real Eigenvalues Let $A=\begin{bmatrix} a & b\\ -b& a \end{bmatrix}$ be a $2\times 2$ matrix, where $a, b$ are real numbers. Suppose that $b\neq 0$. Prove that the matrix $A$ does not have real eigenvalues.   Proof. Let $\lambda$ be an arbitrary eigenvalue of […]
• Problems and Solutions About Similar Matrices Let $A, B$, and $C$ be $n \times n$ matrices and $I$ be the $n\times n$ identity matrix. Prove the following statements. (a) If $A$ is similar to $B$, then $B$ is similar to $A$. (b) $A$ is similar to itself. (c) If $A$ is similar to $B$ and $B$ […]
• Dimension of Null Spaces of Similar Matrices are the Same Suppose that $n\times n$ matrices $A$ and $B$ are similar. Then show that the nullity of $A$ is equal to the nullity of $B$. In other words, the dimension of the null space (kernel) $\calN(A)$ of $A$ is the same as the dimension of the null space $\calN(B)$ of […]
• Determine Whether Given Matrices are Similar (a) Is the matrix $A=\begin{bmatrix} 1 & 2\\ 0& 3 \end{bmatrix}$ similar to the matrix $B=\begin{bmatrix} 3 & 0\\ 1& 2 \end{bmatrix}$?   (b) Is the matrix $A=\begin{bmatrix} 0 & 1\\ 5& 3 \end{bmatrix}$ similar to the matrix […]
• Nilpotent Matrices and Non-Singularity of Such Matrices Let $A$ be an $n \times n$ nilpotent matrix, that is, $A^m=O$ for some positive integer $m$, where $O$ is the $n \times n$ zero matrix. Prove that $A$ is a singular matrix and also prove that $I-A, I+A$ are both nonsingular matrices, where $I$ is the $n\times n$ identity […]
• Linear Transformation $T(X)=AX-XA$ and Determinant of Matrix Representation Let $V$ be the vector space of all $n\times n$ real matrices. Let us fix a matrix $A\in V$. Define a map $T: V\to V$ by $T(X)=AX-XA$ for each $X\in V$. (a) Prove that $T:V\to V$ is a linear transformation. (b) Let $B$ be a basis of $V$. Let $P$ be the matrix […]

#### You may also like...

##### Inequality about Eigenvalue of a Real Symmetric Matrix

Let $A$ be an $n\times n$ real symmetric matrix. Prove that there exists an eigenvalue $\lambda$ of $A$ such that...

Close