Given two $m \times n$ Matrices $A, B$ of the same rank.
Prove that there are two invertible matrices, $V_{m \times m}$ and $U_{n \times n}$ such that $A=VBU$
I guess it's true because multiplication by invertible matrices is equivalent to elementary operations on matrices, but is there a formal way to prove that?
One way (nonunique)
Do an SVD of both
$A = U_A \Sigma_A V_A^T$, $B = U_B \Sigma_B V_B^T$.
This way $U_A$ and $U_B$ are $m\times m$, $V_A$ and $V_B$ are $n\times n$, and $\Sigma_A$ and $\Sigma_B$ are $m\times n$.
If they are both rank $r$, then $r \leq \min\{m,n\}$. Then $\Sigma_A$ and $\Sigma_B$ are tall matrices with a diagonal on the upper $n\times n$ block with the first $r$ entries strictly positive.
Define $S_A^m$ and $S_A^n$ as a diagonal $m\times m$ and $n\times n$ matrix (respectively) where the first $r$ entries are $\sqrt{d_i}$ where $d_i$ are the diagonal entries of $\Sigma_A$. Define the remaining diagonal entries as 1. Do almost the same thing with $\Sigma_B$ to define $S_B^m$ and $S_B^n$, but where the first $r$ entries are $1/\sqrt{d_i}$ and $d_i$ are the diagonal nonzero entries of $\Sigma_B$, and the remaining as 1. Then $S_B^m \Sigma_B S_B^n = \left[\begin{matrix} I & 0 \\ 0 & 0\end{matrix}\right]$ and $S_A^mS_B^m\Sigma_B S_B^nS_A^n = \Sigma_A$.
Then $V = U_A S_A^m S_B^m U_B^T$, $U = V_B S_B^n S_A^n V_A^T$, and you can show it all works out using the orthogonal properties of the left and right singular vector matrices.