# Which kinds of (real) symmetric matrices are invertible

I know real symmetric matrices have real eigenvalues, and are orthogonally diagonalizable. But not all are invertible, e.g. a really trivial example:

[0 0]
[0 0]


Is clearly not invertible because the 2 columns are not linearly independent, it has 0's as its eigenvalues, etc. The above example falls into the category where every element is nonnegative, i.e. on [0,infinty).

The identity matrix is also on [0,inf) but is invertible and has nonzero diagonal entries.

As another example,

[1 1]
[1 1]


is not invertible.

So what are necessary/sufficient conditions for a real symmetric matrix to be invertible?

• Here's a simple matrix with positive entries: $\pmatrix{1&1\\1&1}$. Sep 10 '17 at 17:01
• of course, ok updated the question Sep 10 '17 at 22:48
• When it comes to invertibility, I don't think there's anything special about real symmetric matrices – they are no easier to check for invertibility than are any other kind of matrix. Sep 11 '17 at 3:07
• Are you happy with barman's answer, dek? Any points need clarification? Sep 12 '17 at 7:22

Yes, a matrix is invertible if and only if its determinant is not zero. You may have heard of the general linear group $GL(\mathbb{K},n)$ where $\mathbb{K}$ is some field and $n$ is the dimension of the vector space. It denotes the group of invertible matrices.
To see why this determinant criterion works there are several ways. I'm going to write the easiest one out of lazyness. If $A$ is invertible, then exists $B = A^{-1}$ such that $AB =Id$, now $\det(AB) = \det(A)\det(B)=\det(Id) = 1$ so both $\det(A)$ and $\det(B)$ ought to be $\neq 0$.