I was not too sure how to complete this proof. I thought maybe it was related to $B^{-1}AB$ being the diagonalization of another matrix $D$. I tried approaching it with the determinant and the definition ($A=\lambda x$, $B=\lambda y$) but to no avail.
2026-02-22 19:52:40.1771789960
Show that if $\lambda$ is an eigenvalue of matrix $A$ and $B$, then it is an eigenvalue of $B^{-1}AB$
404 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
You only need it an eigenvalue of $A $. If $Ax=\lambda x $ and $B $ is invertible, let $v=B^{-1}x $. Then $$ B^{-1}ABv=B^{-1}Ax=\lambda v. $$