This question originated from my interest in a bigger question: to what extent are spectral or other kinds of matrix decompositions necessary to prove some properties about Hermitian or positive (semi)definite matrices? Here are some example statements that can be proved without using any matrix decompositions, although the proofs are much easier if we are allowed to use spectral decomposition or take matrix square roots:
- If $P\succeq0$ and $\langle Px,x\rangle=0$, then $Px=0$.
- If $P\succeq0$ and $A=A^\ast$, all eigenvalues of $AP$ are real.
- If $P\succ0$ and $P^n=I$ for some integer $n\ge2$, then $P=I$.
Yesterday, I was thinking about a variant of statement 2 above:
- If $P\succ0$ and $A=A^\ast$, then $A\succ0$ if and only if $AP$ has a real positive spectrum.
The usual proof relies on the fact that $AP$ is similar to $P^{1/2}AP^{1/2}$. Strictly speaking, the existence of $P^{1/2}$ does not involve spectral decomposition — just think about the proofs for the existence of positive square roots of bounded positive linear operators in Hilbert spaces — but for positive definite matrices, spectral decomposition is undoubtedly a shortcut for proof. Other decompositions of $P$ can also be used. E.g. $AP$ is similar to $L^\ast AL$ where $L$ is the Cholesky factor of $P$.
Can we prove the bullet statement above without using any sort of matrix decomposition?
The forward implication ($A\succ0$ only if $AP$ has a positive spectrum) is easy: let $(\lambda, x)$ be an eigenpair of $AP$. Then $\langle Px,APx\rangle=\lambda \langle Px,x\rangle$. Therefore $\lambda=\frac{\langle Px,APx\rangle}{\langle Px,x\rangle}$ is real and $>0$.
However, I have trouble to prove the backward implication ($A\succ0$ if $AP$ has a positive spectrum). Since I need to infer positive definiteness from a spectral condition here, I am willing to compromise and accept uses of spectral decomposition on $A$ or Jordan form of $AP$, but I still want to avoid decompositions of $P$. Any idea?
$T\big(X\big) = (AP)X + X(AP)^*$ and consider $T(A)$. The Horn proof is decomposition based but the integral based inverse (which I'm less familiar with) may do it. You can get the result via $T_\tau(A)$ using the path $(1-\tau)\cdot (AP) + \tau \cdot A$ then finish with winding numbers since $T_\tau(A)$ can never have an eigenvalue in $i\cdot \mathbb R$. – user8675309 Nov 09 '24 at 20:27