Define $Z=(X:Y)$. We know that the projection matrix of $Z$ (say, $P_z$) can be expressed as the sum of the projection matrix of $X$ (say, $P_x$) and that of $(I-P_x)Y$. If the column spaces of $X$ and $Y$ are orthogonal, then $P_z=P_x+P_y$, where $P_y$ is the projection matrix of $Y$.
However, I am interested in the general case when the column spaces of $X$ and $Y$ are not necessarily orthogonal. In this context, is it possible to write $P_z \leq P_x+P_y$? Here, `$A\leq B$' implies that $(B-A)$ is a non-negative definite matrix.
On a related note, we also know that when $P_xP_y=P_yP_x$, then $P_z=P_x+P_y-P_xP_y$. However, I am unable to interpret this condition. Suppose, in a regression context, we have a group of covariates $X=(X_1:X_2)$. What would be the implication of the assumption that the projection matrices corresponding to $X_1$ and $X_2$ commute?
Edit: By projection matrix of $X$, I mean the orthogonal projection matrix on the column space of $X$. Here $X,Y$ are non-random. Columns of $X,Y$ are sub-spaces of $\mathbb{R}^n$.
We clearly have that $P_z-P_x$ and $P_z-P_y$ are projections and $P_z$ commutes with $P_x$ and $P_y.$
We are going to prove that $$P_z\le P_x+P_y \iff P_xP_y=P_yP_x\quad (*)$$ We start with proving the fact that for two orthogonal projections $ P$ and $Q$ we have $$ P\le Q\implies PQ=QP\qquad (**)$$ Indeed, we have $0\le I-Q\le I-P.$ Thus $v=Pv$ implies $v=Qv.$ Hence $QP=PQP$ and $PQ=(QP)^*=PQP.$ Thus $PQ=QP.$
Assume $P_z\le P_x+P_y.$ Then $P_z-P_y\le P_x.$ By $(**)$ we get that $P_x$ and $P_z-P_y$ commute. Hence $P_x$ and $P_y$ commute.
The $\Leftarrow$ direction of $(*)$ follows from the identity $$P_z=P_x+P_y-P_xP_y$$ as the operator $P_xP_y$ is positive.
A concrete example can be made up in the two dimensional space by taking two non orthogonal and not parallel vectors $x$ and $y$ and projections on them. Then $P_x$ and $P_y$ do not commute therefore $P_x+P_y\ge P_z$ fails.