Suppose $A$ is a $2\times2$ matrix. How do I prove that, if $\det(A) < 0$, then $A$ is a diagonalizable matrix over $\mathbb{R}$?
How do I prove that if $\det(A) < 0$, then $A\in\mathbb R^{2\times 2}$ is a diagonalizable matrix?
3
$\begingroup$
linear-algebra
matrices
-
7You can't, because it's false. – 2012-05-03
-
1The Jordan form must actually be diagonal, since a $2x2$ Jordan block has nonnegative determinant. – 2012-05-03
-
8@ChrisEagle's comment was made before the OP was modified to include the 2x2 hypothesis. – 2012-05-03
-
3@JimConant : If you write 2x2 in $\TeX$, with the letter $x$, then it looks like an $x$, not like a $\times$. If you write 2\times 2, then it looks like $2\times 2$. – 2012-05-03
-
0@MichaelHardy: Yes I know, I was just being lazy. – 2012-05-04
1 Answers
16
Since the matrix is $2 \times 2$, its characteristic polynomial is given by $x^2 - \operatorname{tr} A \cdot x + \det A$. Since $(\operatorname{tr} A)^2 - 4 \det A > 0$ by $\det A < 0$, this polynomial has two distinct real zeroes, i.e., $A$ has two distinct real eigenvalues. Since each eigenvalue has at least one eigenvector, the geometric and algebraic multiplicities of the eigenvalues coincide, i.e., $A$ is diagonalizable.
-
3Also we can say that product of eigen values is the determinant of the matrix. A is $2\times2$ matrix with $\det(A)<0$ that means $\lambda_{1}\lambda_{2}<0$ , where $\lambda$ refers to the eigen values of given matrix $A$.Consequently $\lambda_{i}$ ,i=1,2 must be of opposite signs or we can say that A must have two distinct eigen values having oppsite signs. Which results in $A$ is diagonalizable. – 2012-05-12