Given an SPD matrix, any diagonal submatrix of full rank must be SPD.

167 Views Asked by At

I need help with the following proof:

Given a symmetric positive-definite matrix, show that any diagonal submatrix of full rank must also be symmetric positive-definite.

Thanks

1

There are 1 best solutions below

0
On

An $n \times n$ matrix $Q$ is SPD if $x^T Q x> 0$ for every vector $x$. This is also true the vector $x$ contains zeros.

Let now $P= Q_{i:j,i:j}$ some submatrix around the matrix diagonal with $i<j<n $. Then we have $y^T P y = x^T Q x > 0$ where $x$ contains the the vector $y$ and $x_k = 0$ for $k<i$ and $k>j$.