For full rank matrix $A\in\mathbb{C}^{m\times n}$ with $m>n$ and diagonal matrix $B\in\mathbb{C}^{n\times n}$ with $det(B)\ne0$ how can we prove that $rank(ABA^H)=n$?
I have already proven that $rank(AB)=n$ and that $(A^HA)^{-1}$ and $B^{-1}$ are defined. These properties are easy enough to show. It is also clear that the column rank of $AB$ and the row rank of $A$ are equal. I also have a hunch that $ABA^H$ is Hermitian, but I haven't proven this.
I cannot see how to put any of these facts together to prove that $rank(ABA^H)=n$. Any help would be greatly appreciated!
This is a bit of an indirect solution but one might go with the following:
Hint first: Try multiplying matrices from the right and left to $ABA^H$ and then look at the resulting rank.
Solution: