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

Suppose I have a real, symmetric, $n\times n$ matrix $A$ such that the following conditions hold:

1) All diagonal elements $a_{ii}$ are strictly positive.

2) All off-diagonal elements $a_{ij}$ are non-positive.

3) The sum of the elements in each row (and therefore also in each column since $A$ is symmetric) is nonnegative. Moreover, there exists at least one row where this sum is strictly positive.

Does it follow, then, that $A$ has full rank?

share|cite|improve this question
By the way, welcome to math.stackexchange! – Davide Giraudo May 15 '12 at 19:42
up vote 1 down vote accepted

If I'm not mistaken, $$A=\pmatrix{2&-1&0&0\\-1&2&0&0\\ 0&0&1&-1\\ 0&0&-1&1}$$ gives a counter-example (for $n\geq 4$, since it can be extended adding an identity matrix block of size $n-4$). Indeed

  • $a_{ii}\in\{1,2\}$ so $a_{ii}>0$.
  • The extra-diagonal elements are $0$ or $-1$, hence non-positive.
  • The sum of the rows are either $1$ or $0$ hence non-negative.
  • The sums of the elements of the first row is $1$ which is positive.
  • $A$ is symmetric.
share|cite|improve this answer
Thanks for both the answer and the kind welcome! – Nathaniel Oliver May 16 '12 at 17:26

You can find a criterion for invertibility in the following question

A practical way to check if a matrix is positive-definite

You also might find Theorem 1.21 in Varga's Matrix Analysis helpful.

This theorem says that a matrix $(m_{ij})$ satisfying the conditions in your question and one extra condition is positive definite (and thus invertible). This extra condition should be that your matrix is "irreducible". (As you see, this is not satisfied bz Davide's example. In fact, there is no path from 1 to 3.)

See also Corollary 1 in the following notes I found googling the subject:

So the moral of the story is that you should consider one extra condition to get invertibility and this condition is "irreducibility". It basically means that the graph associated to your matrix is connected.

Let me know if anything is unclear. I wrote this in a bit of a hurry.

(Let me add that such matrices arise in intersection theory. In this case, the matrices are irreducible by Zariski's main theorem.)

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.