7
$\begingroup$

If $A$ and $B$ are $3\times 3$ matrices and $A$ is invertible, then can we say that there exists an integer $n$ such that $A+nB$ invertible?

I was trying to show this by choosing $n$ such that eignevalues of $A+nB$ are non-zero. In the case where $B = I$ we can find the eigenvalues of $A+nB$ that would be $\lambda + nB$ (though I am not certain about its proof). This choosing of $n$ such that $\lambda$ is not equal to $-n$ times an eigenvalue of $B$ will serve the purpose. But I am not sure about general $B$. What if I take arbitrary matrices $A$ and $B$.

  • 0
    still i haven't got a complete answer. I need little more help.2012-05-10

1 Answers 1

8

Since $\det(A+xB)$ is a polynomial in $x$, it either has finitely many zeroes or is $0$ for all $x$. Since $A$ is invertible it is not zero when $x=0$, thus all but finitely many integers $n$ are such that $\det(A+nB)\neq 0$ so $A+nB$ is invertible.

  • 0
    It's a polynomial (when $A$,$B$ are $3\times 3$ it has degree $3$). All nonzero polynomials have only finitely many zeroes (in fact, no more than their degree).2012-05-10