Definition
Let be a nonempty subset of a vector space .
The span of , denoted or ,
is the set consisting of all linear combinations of the
vectors in .
We define for convenience.
A subset of a vector space generates (or spans)
if .
In this case, we also say that the vectors of generate (or span)
.
Theorems
Theorem 1 *1
The span of any subset of a vector space is a subspace of that contains .
Moreover, any subspace of that contains must also contain .
Proof
This result is immediate if because , which is a subspace that contains and is contained in any subspace of .
If , then contains some vector ; is in .
Let . Then there exists vectors in and scalars
such that
Then, for any scalar ,
is clearly a linear combination of the vectors in . Hence . Thus is a subspace of . Furthermore, if , then , so .
Now let denote any subspace of that contains . If , then is a linear combination of some vectors of . Since , for all . Therefore is a linear combination of vectors of , hence . Thus . \tag*{$||$}
Footnotes
-
Linear Algebra, Fifth Edition, by Stephen Friedberg, Arnold Insel, and Lawrence Spence ↩