Suppose that for two $n \times n$ matrices $A,B$ we have $AB = A + B$. Prove that $\text{rank}(A^2) + \text{rank} (B^2) \leq 2 \text{rank} (AB).$
This reminds me of Sylvester's Rank Inequality theorem, but I'm not sure if that's really helpful here. I haven't really made significant progress on this beyond writing out a few matrix multiplication. Would appreciate any help at all! Thank you.
Step 1: $B-I$ is invertible
In fact, $$ Bv = v \implies Av = ABv = Av + Bv = Av + v\implies v=0. $$
Step 2: $AB=BA$
In fact, since $B-I$ is invertible, in particular $(B-I)^{-1}=P(B)$ where $P$ is a polynomial (obtained by Euclidean division between the characteristic polynomial and $x-1$). So $$ AB = A+B \implies A(B-I) = B \implies A = BP(B) = P(B)B $$ and $A$ is thus a polynomial in $B$. In particular $AB=BA$.
Step 3: Profit
Notice now that $A^2 = P(B)BA$, so $rk(A^2)\le rk(BA)$ and the problem is symmetric in $B,A$, so $rk(B^2)\le rk(AB)$, leading to $$ rk(A^2) + rk(B^2)\le rk(BA)+ rk(AB) = 2rk(AB) $$