Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I ran into this problem recently.

If $A$ is a $n\times n$ matrix with $1$s in the diagonal and all off diagonal entries have absolute value less than $1$, is $A$ invertible?

It it definitely true for a $2\times 2$ matrix and seems to be true for larger matrices, just by trying to compute the determinant, however, my expression seems to get messy, and I was wondering if there was a easier method to solve this. If not, direction on how to argue from definition of determinant would be appreciated. Although I can see that an argument might come from there, I am having problems with that too.

Thank you for any help, and any help is much appreciated.

share|cite|improve this question
up vote 4 down vote accepted

As Will points out, this isn't true. But you can salvage this idea using the weaker notion of diagonal dominance: if $A$ has 1s along the diagonal and $$\sum_{j\neq i} |a_{ij}| < 1,$$ then $A$ is invertible (the Levy–Desplanques theorem). Notice that for 2x2 matrices, this condition is just that the off-diagonal entries have magnitude less than 1.

share|cite|improve this answer

well, no. With $n$ by $n,$ and $n \geq 3,$ let all the off-diagonal entries be $$ \frac{-1}{n-1}. $$ So the vector with all entries 1 is an eigenvector with eigenvalue 0.

share|cite|improve this answer

The 2x2 case works because it is diagonally dominant. So to explain what happened here, the off-diagonal entries EACH having magnitude less than one isn't enough. They need to be small enough. So if the sum of the absolute values of the off-diagonal elements in a row is strictly less than one and the diagonal-entry has magnitude one, then the matrix will be invertible. Gershgorin proved it so.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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