Suppose $A$ is an $m \times n$ matrix with $A\ne 0$. Prove that the rank of A is $1$ if and only if there exist $(c_1,...,c_m) \in {F^m}$ and $(d_1,...,d_n) \in {F^n}$ Such that ${A_{j,k}}$ = ${c_j}{d_k}$ for every $j = 1,...,m$ and every $k = 1,...,n$. It is problem from linear algebra done right(3.F.11)
I think for firs part if we take all entries $1$ and all i,j ${c_{j}=1}$ , ${d_{k}=1}$ it will work. but for other direction??
I will give you a proof of one of the implications and leave the other one for you. Assume that $A \neq 0$ and $\text{rank} A = 1$. That means that the column space of $A$ is one-dimensional. Let $\mathbf{c}$ be a vector spanning $\text{Col} (A)$. Then there exists constant $d_1, d_2, \ldots, d_n$ so that
$$A = [d_1 \mathbf{c} \quad d_2 \mathbf{c} \quad \cdots \quad d_n \mathbf{c} ] = \mathbf{c}[d_1 \quad d_2 \quad \cdots \quad d_n]=\mathbf{c} \mathbf{d}^T.$$
$A = \mathbf{c} \mathbf{d}^T$ is equivalent to $A_{j, k} = c_j d_k$ (see why?), which proves the first implication.