# Inverse of a symmetric positive definite matrix

If a matrix is symmetric and positive definite, determine if it is invertible and if its inverse matrix is symmetric and positive definite.

I know that if a matrix is symmetric and positive definite, than it's inverse matrix is also positive definite, based on a theorem. But I am not sure how to prove that the matrix even is invertible or that it's inverse matrix is also symmetric.

It would really help if someone explained this a bit. Thanks

• How do you talk about its inverse matrix according to your theorem then you asked if it's invertible or no? – user296113 May 19 '17 at 16:54
• If a matrix is not invertible, then it send some nonzero vector to zero, preventing it from being positive definite. Further, $(A^{-1})^T = (A^T)^{-1} = A^{-1}$, if $A$ is symmetric and invertible. – florence May 19 '17 at 16:56

We have $(A^{-1})^T = (A^T)^{-1}$ for any invertible matrix. It follows from this that if $A$ is invertible and symmetric $$(A^{-1})^T = (A^T)^{-1} = A^{-1}$$ so $A^{-1}$ is also symmetric. Further, if all eigenvalues of $A$ are positive, then $A^{-1}$ exists and all eigenvalues of $A^{-1}$ are positive since they are the reciprocals of the eigenvalues of $A$. Thus $A^{-1}$ is positive definite when $A$ is positive definite.
If A is positive definite matrix, then its eigenvalues are $\lambda_1, \dotsc, \lambda_n >0$ so,
$$|A| = \prod_{i=1}^n \lambda_i > 0$$ and A is invertible. Moreover, eigenvalues of $A^{-1}$ are $\frac{1}{\lambda_i}>0$, hence $A^{-1}$ is positive definite. To see $A^{-1}$ is symmetric consider $$A^{-1} = (A^T)^{-1}=(A^{-1})^T$$