Here, $A$, $X$, and $B$ are real $n\times n$ matrices. A and B are given, but X is unknown.
Also, A is symmetric and positive definite, so $A^T = A$ and $z^TAz >0$ for all nonzero $z$ in $\mathbb R^n$.
My question is: I can easily show that $AX + XA$ is linear in $x$.
but...how many equations and unknowns does it involve?
I wrote out some scratch-work and agree with the solution that it involves $n^2$ unknowns. However, the solution also says it involves $n^2$ equations. I'm pretty sure that's wrong, and that there are only $n$ equations involved.
Thanks,
Edit:
How could I show that F(x) = AX + XA is a bijection? I feel like I should be using what's given in the question: that A is real symmetric, positive definite, so then A has real, positive eigenvalues. Also, A is diagonalizable - orthogonally diagonalizable, in fact - so it has n eigenvectors that form a basis for R^n. Not sure how to proceed to prove the bijection...
Two matrices are equal if and only if their corresponding elements are equal. So the matrix equation $AX + XA = B$ yields $n^2$ equations, one for each entry of the two $n \times n$ matrices $AX + XA$ and $B$.