Suppose $v_1,...,v_m$ is a linearly dependent list of vectors in V. Suppose also that $W\neq\{0\}$. Prove that there exist $w_1,...,w_m$ such that no $T\in L(V,W)$ satisfies $Tv_k=w_k$ for each k= $1,...,m$
My proof: Since $v_1,...,v_m$ is linearly dependent, this means that if $a_1v_1,...+a_mv_m=0$, then $a_1,...,a_m$ are not all zero.
Then apply a linear map $T$ to both side of $a_1v_1,...+a_mv_m=0$, and get $a_1Tv_1+...+a_mTv_m=0$
Then let $(w_1,...,w_m)$ be a linearly independent vector list in $W$
Suppose there exists a linear map $Tv_1=w_1,...,Tv_m=w_m$ under conditions above, then $a_1Tv_1+...+a_mTv_m=0$ this will be
$a_1w_1+...+a_mw_m=0$ and this implies $a_1=...=a_m=0$ and this contradicts with $a_1,...,a_m$ are not all zero.
Thus, when $(w_1,...,w_m)$ is linearly independent, there won't exist a linear map satisfying $Tv_k=w_k$ for each k= $1,...,m$
I'm kind of suspicious of my proof, and I feel there exists some logic problem. Any suggestions? Thanks in advance.
Edit: The above proof is flawed since I didn't consider if the dimension of W is less than m. I give another proof below.
Since $(v_1,...,v_m)$ is linearly dependent,for a vector $v$, this can be written in two ways:
$v=a_1v_1+...+a_mv_m$
$v=b_1v_1+...+b_mv_m$
In these two ways, there always exists $b_i\neq a_i$ for some $i$ since the vector list is linearly dependent.
Thus suppose there is a linearly map $T$ such that $Tv_1=w_1,...,Tv_m=w_m$
Then it is certain that $a_1Tv_1+...+a_mTv_m=b_1Tv_1+...+b_mTv_m$
This means that: $a_1w_1+...+a_mw_m=b_1w_1+...+b_mw_m\implies(a_1-b_1)w_1+...+(a_m-b_m)w_m=0$
Then if $a_1\neq b_1$, let $w_2=...=w_m=0$,but $w_1\neq 0$
Similarly, if $a_i\neq b_i$, just let $w_i\neq 0$ and other $w_j=0$
Then this kind of choice of $w_1,..,w_m$ will make a contradiction to the linear map $T$.