3
$\begingroup$

Any real symmetric matrix $A$ can be written as $A=SDS^T$ for some diagonal matrix $D$ and invertible matrix $S$. Let's fix $D$ to be the (diagonal) inertia matrix of $A$, which has an entry $1, -1, 0$ for each positive, negative, and zero eigenvalue of $A$.

My question is, what is the space of invertible matrices $S$ such that $A=SDS^T$?

$\endgroup$
3
  • $\begingroup$ (I think that) the $S$ that work are exactly those whose columns are each of the form $\sqrt{|\lambda|}\mathbf{v}$ (or just $\mathbf{v}$ if $\lambda = 0$), where $\lambda$ is an eigenvalue of $A$ with corresponding eigenvector $\mathbf{v}$. Is that enough, or were you hoping for something more explicit? $\endgroup$ Commented Jul 14, 2021 at 19:06
  • $\begingroup$ @NathanielJohnston It would be awesome to have such a characterization! I don't immediately see how to prove this, though $\endgroup$
    – Ben
    Commented Jul 14, 2021 at 19:41
  • $\begingroup$ Shoot, looks like I'm wrong. You can always construct an $S$ of the form that I described, but there are others that are not of that form. For an explicit example, see the "an example" section of the answer posted here. $\endgroup$ Commented Jul 14, 2021 at 22:46

1 Answer 1

3
$\begingroup$

Let us first consider the case $D=I$. An invertible matrix $S$ can be (uniquely) factorized as $S=RQ$, where $R$ is upper triangular with positive diagonal entries and $Q$ is orthogonal, $QQ^\top=I$ (this is QR decomposition). Then $SS^\top = RQQ^\top R^\top = RR^\top$. On the other hand, by Cholesky decomposition, every positive definite symmetric matrix $A$ can be uniquely decomposed as $A=RR^\top$, where $R$ is as above. So in this case the space of such $S$ is $R\cdot O(n)$. This reflects the fact that the space of positive definite matrices is isomorphic (in a suitable sense) to $GL(n,\mathbb{R})/O(n)$ (through the mapping $X\mapsto XX^\top$).

What follows lacks some (many) details and should definitely not be taken for granted.

Now for a general non-singular $D$ we would like to use the same consideration, and for that we need $QDQ^\top=D$. This means that $Q$ is an element of the corresponding indefinite orthogonal group $O(D)$.

The analogue for QR decomposition in this case is called HR decomposition (sometimes also hyperbolic QR). Denote $\mathcal{X}$ the set of all matrices $X$ such that the leading principal minors of $X^\top D X$ have the same signs as the corresponding minors of $D$. Then every matrix $X\in\mathcal{X}$ has a decomposition $X=HR$, where $HDH^\top=D$ and $R$ is upper triangular with positive entries (similarly, one can take $R$ to be lower triangular).

If the leading principal minors of $A$ are non-zero, it posesses LDL decomposition $A=LCL^\top$, where $L$ is lower triangular with $1$ on the diagonal and $C$ is diagonal. This can be rewritten as $A=L'DL'^\top$, where $D$ is as above (up to a different order of the diagonal entries) and $L'$ is lower triangular with positive entries on the diagonal (namely, the square roots of the absolute values of the diagonal entries of $C$). Again, if $D$ is ordered as the inertia matrix obtained from LDL decomposition, $A = SDS^\top = LDL^\top$, hence $D = L^{-1}SDS^\top L^{-\top}$ and $L^{-1}S \in O(D)$. If $D$ is ordered differently, the answer differs by a multiplication with a permutation matrix.

The relation with the HR decomposition is based on two observations: 1) the entries of $C$ can be chosen as $C = \operatorname{diag}(\Delta_1,\frac{\Delta_2}{\Delta_1},\ldots,\frac{\Delta_n}{\Delta_{n-1}})$, where $\Delta_i$ are the leading principal minors of $A$ (this is Jacobi method for the diagonalization of quadratic forms); 2) the upper-left corner submatrix of $LML^\top$ for any $M$ and lower-triangular $L$ is the product of the corresponding corner submatrices, and so in case the diagonal entries of $L$ are positive, the leading principal minors of $LML^\top$ and $M$ have the same signs.

I am not sure what to do in case $D$ is singular. Apparently, one can devise some sort of combination of HR and thin QR decompositions, but I do not see this in the literature.

$\endgroup$
0

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .