[Math] Span of vectors with more entries in each vector than the amount of vectors

linear algebravector-spaces

I can easily visualize why $\begin{bmatrix}
1\\ 0
\end{bmatrix}$
and $\begin{bmatrix}
0\\ 1
\end{bmatrix}$
spans $R^2$. I have learned that we need at least two linearly independent vectors to span $R^2$, $3$ to span $R^3$ and so on… This is easy to visualize when the entries in the vectors are the same as the amount of total vectors.

But what happens if we for instance have the two vectors $\begin{bmatrix}
1\\ 0 \\ 1 \\ 0
\end{bmatrix}$
and $\begin{bmatrix}
0\\1\\0\\1
\end{bmatrix}$
.

Clearly, the two vectors are linearly independent, but do they still only span $R^2$? If we add the two vectors we produce $\begin{bmatrix}
1\\ 1\\1\\1
\end{bmatrix}$
which is a vector in $R^4$, right?

So my question boils down to what is the span of $\begin{bmatrix}
1\\ 0 \\ 1 \\ 0
\end{bmatrix}$
and $\begin{bmatrix}
0\\1\\0\\1
\end{bmatrix}$
, and in general what is the span of a set of vectors with more entries in each vector than vectors in total?

Best Answer

The span of the vectors you mention is a subspace of the vector space to which they belong. So $(1,0,1,0)$ and $(0,1,0,1)$ span a two dimensional subspace (since as you note the vectors are linearly independent) of $\mathbb{R}^4$. It is not $\mathbb{R}^2$ exactly as this subspace contains $4$-tuples, but it is `equivalen' (in some sense) to $\mathbb{R}^2$ if this is of interest to you.

So in general a span of $m<n$ linearly independent vectors in $\mathbb{R}^n$ is a $m$-dimensional subspace of $\mathbb{R}^n$.