# Inverse Matrix of Positive-Definite Symmetric Matrix is Positive-Definite

## Problem 397

Suppose $A$ is a positive definite symmetric $n\times n$ matrix.

(a) Prove that $A$ is invertible.

(b) Prove that $A^{-1}$ is symmetric.

(c) Prove that $A^{-1}$ is positive-definite.

(MIT, Linear Algebra Exam Problem)

## Proof.

### (a) Prove that $A$ is invertible.

Thus, since $A$ is positive-definite, the matrix does not have $0$ as an eigenvalue.
Hence $A$ is invertible.

### (b) Prove that $A^{-1}$ is symmetric.

By part (a), we know that $A$ is invertible. We have
$A^{-1}A=I,$ where $I$ is the $n\times n$ identity matrix.

Taking the transpose, we have
\begin{align*}
&I=I^{\trans}=(A^{-1}A)^{\trans}\\
&=A^{\trans}(A^{-1})^{\trans}\\
&=A(A^{-1})^{\trans} && \text{since $A$ is symmetric}.
\end{align*}
It follows that $A^{-1}=(A^{-1})^{\trans}$, and hence $A^{-1}$ is a symmetric matrix.

### (c) Prove that $A^{-1}$ is positive-definite.

Again we use the fact that a symmetric matrix is positive-definite if and only if its eigenvalues are all positive.
(See the post “Positive definite real symmetric matrix and its eigenvalues” for a proof.)

All eigenvalues of $A^{-1}$ are of the form $1/\lambda$, where $\lambda$ is an eigenvalue of $A$.
Since $A$ is positive-definite, each eigenvalue $\lambda$ is positive, hence $1/\lambda$ is positive.

So all eigenvalues of $A^{-1}$ are positive, and it yields that $A^{-1}$ is positive-definite.

## Comment.

Note that the above proof of (b) shows the following.

The inverse matrix of a nonsingular symmetric matrix is symmetric.

### More from my site

• Transpose of a Matrix and Eigenvalues and Related Questions Let $A$ be an $n \times n$ real matrix. Prove the followings. (a) The matrix $AA^{\trans}$ is a symmetric matrix. (b) The set of eigenvalues of $A$ and the set of eigenvalues of $A^{\trans}$ are equal. (c) The matrix $AA^{\trans}$ is non-negative definite. (An $n\times n$ […]
• Positive definite Real Symmetric Matrix and its Eigenvalues A real symmetric $n \times n$ matrix $A$ is called positive definite if $\mathbf{x}^{\trans}A\mathbf{x}>0$ for all nonzero vectors $\mathbf{x}$ in $\R^n$. (a) Prove that the eigenvalues of a real symmetric positive-definite matrix $A$ are all positive. (b) Prove that if […]
• Find All the Eigenvalues and Eigenvectors of the 6 by 6 Matrix Find all the eigenvalues and eigenvectors of the matrix $A=\begin{bmatrix} 10001 & 3 & 5 & 7 &9 & 11 \\ 1 & 10003 & 5 & 7 & 9 & 11 \\ 1 & 3 & 10005 & 7 & 9 & 11 \\ 1 & 3 & 5 & 10007 & 9 & 11 \\ 1 &3 & 5 & 7 & 10009 & 11 \\ 1 &3 & 5 & 7 & 9 & […] • The Subspace of Matrices that are Diagonalized by a Fixed Matrix Suppose that S is a fixed invertible 3 by 3 matrix. This question is about all the matrices A that are diagonalized by S, so that S^{-1}AS is diagonal. Show that these matrices A form a subspace of 3 by 3 matrix space. (MIT-Massachusetts Institute of Technology […] • Diagonalizable by an Orthogonal Matrix Implies a Symmetric Matrix Let A be an n\times n matrix with real number entries. Show that if A is diagonalizable by an orthogonal matrix, then A is a symmetric matrix. Proof. Suppose that the matrix A is diagonalizable by an orthogonal matrix Q. The orthogonality of the […] • Construction of a Symmetric Matrix whose Inverse Matrix is Itself Let \mathbf{v} be a nonzero vector in \R^n. Then the dot product \mathbf{v}\cdot \mathbf{v}=\mathbf{v}^{\trans}\mathbf{v}\neq 0. Set a:=\frac{2}{\mathbf{v}^{\trans}\mathbf{v}} and define the n\times n matrix A by \[A=I-a\mathbf{v}\mathbf{v}^{\trans},$ where […]
• The Inverse Matrix of the Transpose is the Transpose of the Inverse Matrix Let $A$ be an $n\times n$ invertible matrix. Then prove the transpose $A^{\trans}$ is also invertible and that the inverse matrix of the transpose $A^{\trans}$ is the transpose of the inverse matrix $A^{-1}$. Namely, show […]
• A Symmetric Positive Definite Matrix and An Inner Product on a Vector Space (a) Suppose that $A$ is an $n\times n$ real symmetric positive definite matrix. Prove that $\langle \mathbf{x}, \mathbf{y}\rangle:=\mathbf{x}^{\trans}A\mathbf{y}$ defines an inner product on the vector space $\R^n$. (b) Let $A$ be an $n\times n$ real matrix. Suppose […]

### 1 Response

1. 05/01/2017

[…] For proofs, see the post “Inverse matrix of positive-definite symmetric matrix is positive-definite“. […]

##### Positive definite Real Symmetric Matrix and its Eigenvalues

A real symmetric $n \times n$ matrix $A$ is called positive definite if $\mathbf{x}^{\trans}A\mathbf{x}>0$ for all nonzero vectors $\mathbf{x}$ in...

Close