Skip to content

6.2-exam3-1998

Quiz 3, 1998 · Section 6.2: Diagonalizing a Matrix Source: exam3_1.pdf, pp. 18, 23

Problem

4. (30 pts.) (a) If \(B\) is invertible prove that \(AB\) has the same eigenvalues as \(BA\). (Hint: Find a matrix \(M\) such that \(ABM = MBA\).)

(b) Find a diagonalizable matrix \(A \neq 0\) that is similar to \(-A\). Also find a nondiagonalizable matrix \(A\) that is similar to \(-A\).

Solution (a) Take \(M = B^{-1}\). Then \[ AB = B^{-1}(BA)B = M^{-1}(BA)M, \] so \(AB\) is similar to \(BA\), and similar matrices have the same eigenvalues. (b) A diagonalizable example: \[ A = \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix}, \] since \(-A = \begin{bmatrix} -1 & 0 \\ 0 & 1 \end{bmatrix}\) is similar to \(A\) (e.g. by the permutation matrix \(\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}\)). A nondiagonalizable example: \[ A = \begin{bmatrix} 0 & 1 \\ 0 & 0 \end{bmatrix}, \] since \(-A = \begin{bmatrix} 0 & -1 \\ 0 & 0 \end{bmatrix} = \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix} A \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix}^{-1}\).

Keywords: similar matrices, eigenvalues, diagonalizable