Suppose m and n are positive integers. For v∈Fm and w∈Fn, identify v⊗w with an m-by-n matrix as in Example 9.76. With that identification, show that the set
{v⊗w:v∈Fm and w∈Fn}
is the set of m-by-n matrices (with entries in F) that have rank at most one.