1
$\begingroup$

I do not know enough about matrices, maybe only enough to be able to create question like this one, but I would like to see an answer.

Let $a_{ij}$ be some element of invertible $n\times n$ matrix $M$ which has real numbers as entries.

Let us now define the addition of the real number $\alpha$ with matrix $M$ in such a way that $\alpha+M$ gives matrix $N$ which has entries $a_{ij}+\alpha$.

The question is:

Can we for every real invertible matrix $M$ find real number $\alpha \neq 0$ such that $M+\alpha$ is invertible?

I created this question because it seems to me that the set of real invertible matrices is connected in such a way that if we have some real invertible matrix that we could alter coefficients at least a little bit by the same amount and still arrive at another real invertible matrix.

As I know almost nothing about this area of mathematics, I could be wrong, but because some of you surely know how to answer this question I will probably find out was my intuition right?

Also, I would like to have a proof or counterexample that is as elementary as possible.

$\endgroup$
  • $\begingroup$ @arctictern But that only makes change to the numbers on the diagonal, right? $\endgroup$ – Farewell Dec 9 '15 at 16:05
  • $\begingroup$ Yes but that is actually a common operation. $M+\alpha$ does not a priori actually mean anything. How do you add a Matrix to a number? Just adding $\alpha$ to all entries is not a very common operation. $\endgroup$ – Jorik Dec 9 '15 at 16:06
  • $\begingroup$ @Jorik Maybe the operation is not common but it is unavoidable for the problem which is stated as it is stated. $\endgroup$ – Farewell Dec 9 '15 at 16:07
  • $\begingroup$ You can define whatever you want as long as it have some sense. $\endgroup$ – Farewell Dec 9 '15 at 16:08
1
$\begingroup$

Yes. A matrix $A$ is invertible if and only if the determinant $\det A$ is non-zero. Since the determinant is a polynomial in the entries of $A$ (as can be seen, e.g. by cofactor expansion), the determinant is continuous in the entries of $A$.

Hence if $\det(M) \ne 0$, then for all sufficiently small $\alpha$, $\det(M + \alpha) \ne 0$.

$\endgroup$
  • $\begingroup$ So it seems that we will have an uncountable number of choices for $\alpha$? $\endgroup$ – Farewell Dec 9 '15 at 16:14
  • $\begingroup$ @AntePaladin Yes. If you prefer, there's a full interval. $\endgroup$ – user296602 Dec 9 '15 at 16:15
  • 2
    $\begingroup$ @AntePaladin math.stackexchange.com/questions/606295/… $\endgroup$ – JP McCarthy Dec 9 '15 at 16:16
  • 1
    $\begingroup$ @GyroGearloose here $M+\alpha$ does not mean $M+\alpha I$. So that argument doesn't work. $\endgroup$ – Jorik Dec 9 '15 at 16:44
  • 2
    $\begingroup$ @user by viewing $\det(M+\alpha)$ as a polynomial in $\alpha$ we see that there are just a finite number of values $\alpha$ can take so that $M+\alpha$ is not invertable. $\endgroup$ – Jorik Dec 9 '15 at 16:45

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.