← Back to Math 010

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 V, then 𝐰 is said to be a linear combination of the vectors 𝐯1, 𝐯2, …, 𝐯r in V if 𝐰 can be expressed in the form 𝐰=k1𝐯1+k2𝐯2+…+kr𝐯r, where each ki is a scalar. The scalars are called the coefficients of the linear combination. In the case where r=1, we have 𝐰=k1𝐯1, 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 𝐩1=2+x+4x2, 𝐩2=1−x+3x2, and 𝐩3=3+2x+5x2.

a. −9−7x−15x2

b. 6+11x+6x2

c. 0

d. 7+8x+9x2

Solution

We note that c1p→1+c2p→2+c3p→3 becomes

2c1+c1x+4c1x2+c2−c2x+3c2x2+3c3+2c3x+5c3x2

Then c1p→1+c2p→2+c3p→3=p→, where p→=a0+a1x+a2x2, yields (matching the constant terms, the x-terms, and the x2-terms)

2c1+c2+3c3=a0c1−c2+2c3=a14c1+3c2+5c3=a2

In matrix form, each column holds the coefficients of one polynomial:

[2131−12435][c1c2c3]=[a0a1a2]

We can solve (a)–(d) using the augmented matrix

[213a01−12a1435a2]

and substituting for each ai. Row reduction gives

[100−112a0+2a1+52a201032a0−a1−12a200172a0−a1−32a2]

a. If a0=−9, a1=−7, a2=−15, then

c1=−112(−9)+2(−7)+52(−15)=−2.

Likewise, c2=1 and c3=−2.

Answer: p→=−2p→1+p→2−2p→3

Check:

−4−2x−8x2+1−x+3x2−6−4x−10x2=−9−7x−15x2

b.

Answer: p→=4p→1−5p→2+p→3

c.

Answer: 0=0p→1+0p→2+0p→3

d.

Answer: p→=−2p→2+3p→3

Note: we can always find a solution, since there are no restrictions on a0, a1, a2.

Definition

The span of a nonempty set S={𝐯1,𝐯2,…,𝐯r} of vectors is the set of all possible linear combinations of vectors in S, denoted by span{𝐯1,𝐯2,…,𝐯r} or span(S). If W=span(S), then we say that W is spanned by S.

#9

Determine whether the following polynomials span P2.

𝐩1=1−x+2x2, 𝐩2=3+x, 𝐩3=5−x+4x2, 𝐩4=−2−2x+2x2

Solution

That is, can we build every polynomial of degree ≤2 using p→1,p→2,p→3,p→4? That is, does

ap→1+bp→2+cp→3+dp→4=p→

always have a solution, where p→=b1+b2x+b3x2? Writing each polynomial as its column of coefficients,

p→1=[1−12],p→2=[310],p→3=[5−14],p→4=[−2−22]

Row reduce:

[135−2b1−11−1−2b22042b3]⟶[102114b1−34b2011−114b1+14b20000b1−3b2−2b3]

This has a solution if and only if b1−3b2−2b3=0. So if b1−3b2−2b3≠0, there is no such linear combination.

Answer: The set {p→1,p→2,p→3,p→4} does not span P2.

#12

Let TA:R2→R2 be multiplication by A. Determine whether the vector 𝐮=(1, 2) is in the span of {TA(𝐞1), TA(𝐞2)}.

a. A=[1201]

b. A=[1111]

Solution

a.

TA(e→1)=[1201][10]=[10],TA(e→2)=[1201][01]=[21]

Tip: Note that these are the columns of A.

u→=−3TA(e→1)+2TA(e→2)

Answer: a. Yes.

b.

TA(e→1)=[1111][10]=[11],TA(e→2)=[1111][01]=[11]

We cannot express [12] as a linear combination of [11] and [11].

Answer: b. No.

#16

Let W be the solution space to the system A𝐱=𝟎. Determine whether the set {𝐮, 𝐯} spans W.

A=[01−1102−2203−33]

a. 𝐮=(1, 1, 1, 0), 𝐯=(0, −1, 0, 1)

b. 𝐮=(0, 1, 1, 0), 𝐯=(1, 0, 1, 1)

Solution

Can an arbitrary vector in W be expressed as a linear combination of u→ and v→? First find W:

[01−11002−22003−330]⟶[01−1100000000000]

x1 is free: x1=t. The first row says x2−x3+x4=0⇒x2=x3−x4. Let x3=r and x4=s. Then

x→=[t000]+[0r−srs]=[1000]t+[0110]r+[0−101]s

Thus the solution space is spanned by

[1000],[0110],and[0−101].

In both (a) and (b), u→ and v→ do not span this set, so they do not span the solution space.

Answer: In both (a) and (b), {u→,v→} does not span W.

Theorem 4.3.1

If S={𝐰1, 𝐰2, …, 𝐰r} is a nonempty set of vectors in a vector space V, then:

a) The set W of all possible linear combinations of the vectors in S is a subspace of V.

b) The set W in part (a) is the “smallest” subspace of V that contains all of the vectors in S in the sense that any other subspace that contains those vectors contains W.

Proof of (a)

Let u→,v→∈span(S). Then

u→=∑i=1rciw→i,v→=∑i=1rkiw→i.

u→+v→=∑i=1r(ciw→i+kiw→i)=∑i=1r(ci+ki)w→i,

which has the form ∑i=1rdiw→i, a linear combination of the w→i. So u→+v→∈span(S).

Let k∈ℝ. Then

ku→=k∑i=1rciw→i=∑i=1r(kci)w→i,

so ku→∈span(S).

Theorem 4.3.2

If S={𝐯1, 𝐯2, …, 𝐯r} and S′={𝐰1, 𝐰2, …, 𝐰k} are nonempty sets of vectors in a vector space V, then span{𝐯1, 𝐯2, …, 𝐯r} =span{𝐰1, 𝐰2, …, 𝐰k} if and only if each vector in S is a linear combination of those in S′, and each vector in S′ is a linear combination of those in S.

#20

Let 𝐯1=(1, 6, 4), 𝐯2=(2, 4, −1), 𝐯3=(−1, 2, 5), and 𝐰1=(1, −2, −5), 𝐰2=(0, 8, 9). Use Theorem 4.3.2 to show that span{𝐯1,𝐯2,𝐯3}=span{𝐰1,𝐰2}.

Solution

Can I use the v→i to make each w→i? Put v→1,v→2,v→3 in the coefficient columns and w→1,w→2 in the augmented columns, then row reduce:

[12−110642−284−15−59]⟶[101−1201−11−100000]

Both systems are consistent. Reading the first augmented column (with c3=0) and the second augmented column:

w→1=−v→1+v→2

w→2=2v→1−v→2

Now can I use the w→i to make each v→i?

[1012−1−28642−594−15]⟶[1012−10111000000]

Yes: all three systems are consistent (v→1=w→1+w→2, v→2=2w→1+w→2, v→3=−w→1). By Theorem 4.3.2,

Answer: span({v→i})=span({w→i})