Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
@fedja: Could you please explain how you proved that cycles of any length are impossible if $A\neq I$? (Even though it's not a solution, it might give more insights on the problem...)
@NawafBou-Rabee: Yes, of course replacing the principal square root with the Cholesky square root makes the problem trivial. However the principal square root has remarkable properties that the Cholesky factor does not have (the most obvious one is that the principal square root is positive (semi)definite). In the problem I'm investigating, I need such properties.
@FedorPetrov: Yes, still it's not straightforward to me to find a pair of unit trace $X_0$, $X_1$ satisfying the above constraint for $A\neq I$. (In case of diagonal $X_0$, $X_1$ it's not possible, I would say).
It's a long story, but basically I would like to show that the iteration $(\star)$ has no invariant trajectories in the set of positive definite trace one matrices if $A\neq I$