Wikipedia provides two methods to prove row rank of a matrix is equal to its column rank. My doubt is regarding the second method. But the wikipedia page mentions that this proof is valid only for real matrices. What part of this proof breaks down if the matrix is complex? I've added the proof here for easy reference.
Proof:
Let $r$ be the row rank of a matrix $A$. Let $x_1, x_2, \ldots x_r$ be a basis for row space of $A$.
Claim: $Ax_1, Ax_2, \ldots Ax_r$ are linearly independent (LI).
To prove, I need to show that
$$\sum_{i=1}^{r}c_iAx_i = 0 \iff c_i=0, \forall i=1,2,\dots r$$
$$\sum_{i=1}^{r}c_iAx_i = A\sum_{i=1}^{r}c_ix_i$$
Let
$$v=\sum_{i=1}^{r}c_ix_i \implies v \in C(A')$$
$$\sum_{i=1}^{r}c_iAx_i = Av = 0 \implies v \in N(A) $$
$$ \therefore v \in C(A') \bigcap N(A) \implies v = \vec{0}$$
$$ v = \sum_{i=1}^{r}c_ix_i = 0 \implies c_i=0 \forall i $$
Because $x_i$ are LI. This proves $Ax_i$ are LI.
We know that $Ax_i \in C(A)$ and $Ax_i$ are LI, dim($C(A)$)$\ge r$ i.e. column rank is greater than or equal to row rank. By doing the same steps with $A'$, we get that row rank of $A$ is greater than or equal to its column rank. This proves that row rank is equal to column rank.