Similar matrices, equivalence class when $A=aI$

Question

I would like to understand why the following is true for $A \in M_{nxn}(K)$: $$\text{the equivalence class of A in the equivalence relation of two matrices being similar consists only of A} \iff \exists a\in K \ (A=aI)$$ Two matrices are similar when $B=C^{-1}AC$. I am also aware that if $A$ and $B$ are similar matrices, then: 1) $\text{det}A=\text{det}B$, 2) $\text{tr}(A)=\text{tr}(B)$, 3) $\text{r}(A)=\text{r}(B)$.

Answer 1

Let $C^{-1}AC=A$ for all invertible matrices $C \in M_{nxn}(K)$.

Hence $AC=CA$ for all invertible matrices $C \in M_{nxn}(K)$.

If $D \in M_{nxn}(K)$, take $t \in K$ such that $C:=D-tI$ is invertible ( hence take $t$ such that $t$ is not an eigenvalue of $D$).

Then it is easy to see that $AD=DA$.

Consequence: $AD=DA$ for all matrices $D \in M_{nxn}(K)$.

Can you now show that , for some $a \in K$ we have $A=aI$ ?

Hint: consider the matrices $E_{ij}$, where $E_{ij}$ is the matrx whose $(i,j)$ - entry $=1$ and all other entries are $=0$.