3
$\begingroup$

Let $A,B,C \ne 0 \in M_{n} (\mathbb C)$ and $g(X)\in \mathbb C[X]$ such that $AC=CB$

I need to prove that for every $j=1,2,3..$ the matrices implies $A^jC=CB^j$ and $g(A)C=Cg(B)$ and prove that A and B have a common eigenvalue.

If $AC=CB$ does it mean that $C$ must be diagonal matrix or at list symmetric?

I tried to use Jordan form to solve it, but I didn't succeed.

Thanks again.

  • 0
    You can prove the first part by simple induction.2011-08-23

2 Answers 2

3

For the eigenvalue part -- Let $g$ be the minimal polynomial of $B$. Since $g(A)C=Cg(B)=0$, if $A$ and $B$ does not share a common eigenvalue, then $g(A)$ is invertible and hence $C=0$, which is a contradiction.

To make $AC=CB$, the matrix $C$ need not be symmetric. Example: $A=\begin{pmatrix}1&0\\0&2\end{pmatrix},\ B=I$ and $C=\begin{pmatrix}0&1\\0&0\end{pmatrix}$.

  • 0
    @Avishay28 $A$ and $B$ do not share any eigenvalues. So, $g(a)\ne0$ for every eigenvalue of $A$. Hence $g(A)$ is invertible. Alternatively, if $A$ and $B$ do not share a common eigenvalue, then their minimal polynomials --- say $f$ and $g$ --- are relatively prime. So, there exist polynomials $p,q$ such that $pf+qg=1$. Since $f(A)=0$, we get $q(A)g(A)=I$. Hence $g(A)$ is invertible.2017-06-23
0

For the eigenvalues part: If $\lambda$ is eigenvalue of $B$ so there's $v$ such that $Bv=\lambda v$

$ACv=CBv=C\lambda v= \lambda Cv$ so $Cv$ is an eigenvector for $\lambda$ so they share $\lambda$..

  • 0
    $C$ is not invertible a priori, so you could have $Cv=0$ and $v\neq 0$.2011-08-23