4.3 Spanning Sets: Class Notes
Definition: (generalizes linear combination from Section 3.1)
(generalizes linear combination from Section 3.1)
If is a vector in a vector space , then is said to be a linear combination of the vectors in if can be expressed in the form , where each is a scalar. The scalars are called the coefficients of the linear combination. In the case where , we have , in which case the linear combination is a scalar multiple of the vector.
#6
In each part, express the vector as a linear combination of , , and .
a.
b.
c.
d.
Solution
We note that becomes
Then , where , yields (matching the constant terms, the -terms, and the -terms)
In matrix form, each column holds the coefficients of one polynomial:
We can solve (a)–(d) using the augmented matrix
and substituting for each . Row reduction gives
a. If , , , then
Likewise, and .
Answer:
Check:
b.
Answer:
c.
Answer:
d.
Answer:
Note: we can always find a solution, since there are no restrictions on , , .
Definition
The span of a nonempty set of vectors is the set of all possible linear combinations of vectors in , denoted by or . If , then we say that is spanned by .
#9
Determine whether the following polynomials span .
, , ,
Solution
That is, can we build every polynomial of degree using ? That is, does
always have a solution, where ? Writing each polynomial as its column of coefficients,
Row reduce:
This has a solution if and only if . So if , there is no such linear combination.
Answer:
#12
Let be multiplication by . Determine whether the vector is in the span of .
a.
b.
Solution
a.
Tip: Note that these are the columns of .
Answer:
b.
We cannot express as a linear combination of and .
Answer:
#16
Let be the solution space to the system . Determine whether the set spans .
a.
b.
Solution
Can an arbitrary vector in be expressed as a linear combination of and ? First find :
is free: . The first row says . Let and . Then
Thus the solution space is spanned by
In both (a) and (b), and do not span this set, so they do not span the solution space.
Answer:
Theorem 4.3.1
If is a nonempty set of vectors in a vector space , then:
a) The set of all possible linear combinations of the vectors in is a subspace of .
b) The set in part (a) is the “smallest” subspace of that contains all of the vectors in in the sense that any other subspace that contains those vectors contains .
Proof of (a)
Let . Then
which has the form , a linear combination of the . So .
Let . Then
so .
Theorem 4.3.2
If and are nonempty sets of vectors in a vector space , then if and only if each vector in is a linear combination of those in , and each vector in is a linear combination of those in .
#20
Let , , , and , . Use Theorem 4.3.2 to show that .
Solution
Can I use the to make each ? Put in the coefficient columns and in the augmented columns, then row reduce:
Both systems are consistent. Reading the first augmented column (with ) and the second augmented column:
Now can I use the to make each ?
Yes: all three systems are consistent (, , ). By Theorem 4.3.2,
Answer: