# How do I prove that if $A$ is positive definite, then it is invertible and $A^{-1}$ is also positive definite?

I saw this property on Wikipedia. But they didn't give a proof, and I failed to work out one. Is it easy to prove?

-
Use eigen-decomposition – chaohuang Oct 3 '12 at 4:44

As $A$ is positive definite, so $A$ is Hermitian($A^{H}=A$) and for arbitrary vector $X$, we have $X^{H}AX\geq0$ and $X^{H}AX=0$ only when $X=0$.

Assume that $X_{0}$ is a solution for $AX=0$, i.e. $AX_{0}=0$, then $X_{0}^{H}AX_{0}=0$, and we can get that $X_{0}=0$ by above conclusion. This shows that $AX=0$ only have the trivial solution, so $A$ is invertible.

For $A^{-1}$, we can compute as following:

$$(A^{-1})^{H}=(A^{H})^{-1}=A^{-1}$$

so $A^{-1}$ is also Hermitian.

For arbitrary vector $X$,

$$X^{H}A^{-1}X=X^{H}A^{-1}AA^{-1}X=X^{H}(A^{-1})^{H}AA^{-1}X=(A^{-1}X)^{H}A(A^{-1}X)\geq0$$

and $X^{H}A^{-1}X=(A^{-1}X)^{H}A(A^{-1}X)=0$ only when $A^{-1}X=0$, equivalent to saying $X=0$.

So $A^{-1}$ is also positive definite.

-

The proof for $A$ operating on a finite-dimensional space is essentially that $A$ has a basis of positive eigenvalues. This is because it's symmetric (Hermitian,) and so orthogonally (unitarily) diagonalizable over the reals (complexes,) $A=P^{-1}\hat{A}P$. Then if $\hat{A}$ has an entry $\lambda_i,$ $$(P^{-1}e_i)^TA(P^{-1}e_i)=e_i^T(P^{-1})^TP^{-1}\hat{A}e_i=e_i^TPP^{-1}\lambda_ie_i= \lambda_ie_i^Te_i=\lambda_i$$ So if $\lambda_i$ were nonpositive, $A$ couldn't be positive definite.

Now we naturally find $A^{-1}=P\hat{A}^{-1}P^{-1}$, where we can invert $\hat{A}$ just by inverting the $\lambda_i$, leaving all eigenvalues strictly positive. Since $P^{-1}$ is orthogonal or Hermitian $\{P^{-1}e_i\}$ forms a basis, and the same computation from above shows $(P^{-1}e_i)^Te_i^TA^{-1}P^{-1}e_i$ is positive. Now $x^TA^{-1}x$ can be written as a sum of those positive terms, and we see $A^{-1}$ is positive definite.

-

A matrix is positive definite if it is Hermitian and every eigenvalue is positive. And since the eigenvalues of $A^{-1}$ are the reciprocals of the eigenvalues of $A$, they are also positive. So you just need to check that $A$ is indeed invertible to conclude $A^{-1}$ is positive definite. This follows since $A$ is injective (and hence bijective, by Rank-Nullity): If $v\neq 0$ then $Av\neq 0$ since if it was, $v^T A v = v^T 0 = 0$ which contradicts $A$ being positive definite.

-
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "http://math.stackexchange.com/questions/206361/how-do-i-prove-that-if-a-is-positive-definite-then-it-is-invertible-and-a?answertab=votes", "fetch_time": 1461890280000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2016-18/segments/1461860109993.2/warc/CC-MAIN-20160428161509-00174-ip-10-239-7-51.ec2.internal.warc.gz", "warc_record_offset": 109035092, "warc_record_length": 17793, "token_count": 845, "char_count": 2436, "score": 4.1875, "int_score": 4, "crawl": "CC-MAIN-2016-18", "snapshot_type": "latest", "language": "en", "language_score": 0.7958269119262695, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00053-of-00064.parquet"}