06.09.2021 Views

A First Course in Linear Algebra, 2017a

A First Course in Linear Algebra, 2017a

A First Course in Linear Algebra, 2017a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

4.10. Spann<strong>in</strong>g, L<strong>in</strong>ear Independence and Basis <strong>in</strong> R n 199<br />

Theorem 4.78: Subspaces are Spans<br />

Let V be a nonempty collection of vectors <strong>in</strong> R n . Then V is a subspace of R n if and only if there<br />

exist vectors {⃗u 1 ,···,⃗u k } <strong>in</strong> V such that<br />

V = span{⃗u 1 ,···,⃗u k }<br />

Furthermore, let W be another subspace of R n and suppose {⃗u 1 ,···,⃗u k }∈W. Then it follows that<br />

V is a subset of W.<br />

Note that s<strong>in</strong>ce W is arbitrary, the statement that V ⊆ W means that any other subspace of R n that<br />

conta<strong>in</strong>s these vectors will also conta<strong>in</strong> V .<br />

Proof. We first show that if V is a subspace, then it can be written as V = span{⃗u 1 ,···,⃗u k }. Pick a vector<br />

⃗u 1 <strong>in</strong> V .IfV = span{⃗u 1 }, then you have found your list of vectors and are done. If V ≠ span{⃗u 1 },then<br />

there exists⃗u 2 a vector of V which is not <strong>in</strong> span{⃗u 1 }. Consider span{⃗u 1 ,⃗u 2 }.IfV = span{⃗u 1 ,⃗u 2 },weare<br />

done. Otherwise, pick ⃗u 3 not <strong>in</strong> span{⃗u 1 ,⃗u 2 }. Cont<strong>in</strong>ue this way. Note that s<strong>in</strong>ce V is a subspace, these<br />

spans are each conta<strong>in</strong>ed <strong>in</strong> V . The process must stop with ⃗u k for some k ≤ n by Corollary 4.70, and thus<br />

V = span{⃗u 1 ,···,⃗u k }.<br />

Now suppose V = span{⃗u 1 ,···,⃗u k }, we must show this is a subspace. So let ∑ k i=1 c i⃗u i and ∑ k i=1 d i⃗u i be<br />

two vectors <strong>in</strong> V, andleta and b be two scalars. Then<br />

a<br />

k<br />

∑<br />

i=1<br />

c i ⃗u i + b<br />

k<br />

∑<br />

i=1<br />

d i ⃗u i =<br />

k<br />

∑<br />

i=1<br />

(ac i + bd i )⃗u i<br />

which is one of the vectors <strong>in</strong> span{⃗u 1 ,···,⃗u k } and is therefore conta<strong>in</strong>ed <strong>in</strong> V . This shows that span{⃗u 1 ,···,⃗u k }<br />

has the properties of a subspace.<br />

To prove that V ⊆ W , we prove that if ⃗u i ∈ V, then⃗u i ∈ W.<br />

Suppose ⃗u ∈ V. Then⃗u = a 1 ⃗u 1 + a 2 ⃗u 2 + ···+ a k ⃗u k for some a i ∈ R, 1≤ i ≤ k. S<strong>in</strong>ceW conta<strong>in</strong> each<br />

⃗u i and W is a vector space, it follows that a 1 ⃗u 1 + a 2 ⃗u 2 + ···+ a k ⃗u k ∈ W .<br />

♠<br />

S<strong>in</strong>ce the vectors ⃗u i we constructed <strong>in</strong> the proof above are not <strong>in</strong> the span of the previous vectors (by<br />

def<strong>in</strong>ition), they must be l<strong>in</strong>early <strong>in</strong>dependent and thus we obta<strong>in</strong> the follow<strong>in</strong>g corollary.<br />

Corollary 4.79: Subspaces are Spans of Independent Vectors<br />

If V is a subspace of R n , then there exist l<strong>in</strong>early <strong>in</strong>dependent vectors {⃗u 1 ,···,⃗u k } <strong>in</strong> V such that<br />

V = span{⃗u 1 ,···,⃗u k }.<br />

In summary, subspaces of R n consist of spans of f<strong>in</strong>ite, l<strong>in</strong>early <strong>in</strong>dependent collections of vectors of<br />

R n . Such a collection of vectors is called a basis.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!