Let $A$ and $B$ be two symmetric $n\times n$ matrices. Suppose that $A,B\preceq I/2$ ($C \preceq D$ means $D - C$ is positive semidefinite) and $$A(I-A)\preceq B(I-B),$$prove that $A\preceq B$.
My try: By assumptions for every vector $x$ we have: $$x^T(I/2 - B)x\ge 0 \\ x^T(I/2 - A)x\ge 0 \\ x^T(B-B^2-A+A^2)x\ge 0$$ By adding the two first equations, we get $$x^T(I-A-B)x = ||x||^2-x^T(A+B)x\ge 0$$ I don't see how this inequality can be used for showing the desired inequality: $$x^T(B-A)x\ge 0$$
Notice that we can write $$ B(I - B) - A(I - A) = \Bigl(\frac{I}{2} - A\Bigr)^2 - \Bigl(\frac{I}{2} - B\Bigr)^2, $$ and so it follows from the fact that $B(I-B) \succeq A(I - A)$ that $(I/2 - A)^2 \succeq (I/2 - B)^2$ (convince yourself of this!).
But now $(I/2 - A)$ and $(I/2 - B)$ are each positive semidefinite by assumption, from which it follows that $$ \frac{I}{2} - A \succeq \frac{I}{2} - B, $$ and so finally that $A \preceq B$.