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.

9.4. Subspaces and Basis 487<br />

Then from Lemma 9.23, {⃗u 1 ,···,⃗u k ,⃗u k+1 } is also l<strong>in</strong>early <strong>in</strong>dependent. Cont<strong>in</strong>ue add<strong>in</strong>g vectors <strong>in</strong> this<br />

way until n l<strong>in</strong>early <strong>in</strong>dependent vectors have been obta<strong>in</strong>ed. Then<br />

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

because if it did not do so, there would exist⃗u n+1 as just described and {⃗u 1 ,···,⃗u n+1 } would be a l<strong>in</strong>early<br />

<strong>in</strong>dependent set of vectors hav<strong>in</strong>g n + 1 elements. This contradicts the fact that {⃗v 1 ,···,⃗v n } is a basis. In<br />

turn this would contradict Theorem 9.35. Therefore, this list is a basis.<br />

♠<br />

Recall Example 9.24 <strong>in</strong> which we added a matrix to a l<strong>in</strong>early <strong>in</strong>dependent set to create a larger l<strong>in</strong>early<br />

<strong>in</strong>dependent set. By Theorem 9.43 we can extend a l<strong>in</strong>early <strong>in</strong>dependent set to a basis.<br />

Example 9.44: Add<strong>in</strong>g to a L<strong>in</strong>early Independent Set<br />

Let S ⊆ M 22 be a l<strong>in</strong>early <strong>in</strong>dependent set given by<br />

{[<br />

1 0<br />

S =<br />

0 0<br />

Enlarge S to a basis of M 22 .<br />

]<br />

,<br />

[<br />

0 1<br />

0 0<br />

]}<br />

Solution. Recall from the solution of Example 9.24 that the set R ⊆ M 22 given by<br />

{[ ] [ ] [ ]}<br />

1 0 0 1 0 0<br />

R = , ,<br />

0 0 0 0 1 0<br />

is also l<strong>in</strong>early [ <strong>in</strong>dependent. ] However this set is still not a basis for M 22 as it is not a spann<strong>in</strong>g set. In<br />

0 0<br />

particular, is not <strong>in</strong> spanR. Therefore, this matrix can be added to the set by Lemma 9.23 to<br />

0 1<br />

obta<strong>in</strong> a new l<strong>in</strong>early <strong>in</strong>dependent set given by<br />

{[ ] [ ] [ ] [ ]}<br />

1 0 0 1 0 0 0 0<br />

T = , , ,<br />

0 0 0 0 1 0 0 1<br />

This set is l<strong>in</strong>early <strong>in</strong>dependent and now spans M 22 . Hence T is a basis.<br />

♠<br />

Next we consider the case where you have a spann<strong>in</strong>g set and you want a subset which is a basis. The<br />

above discussion <strong>in</strong>volved add<strong>in</strong>g vectors to a set. The next theorem <strong>in</strong>volves remov<strong>in</strong>g vectors.<br />

Theorem 9.45: Basis from a Spann<strong>in</strong>g Set<br />

Let V be a vector space and let W be a subspace. Also suppose that W = span{⃗w 1 ,···,⃗w m }.Then<br />

there exists a subset of {⃗w 1 ,···,⃗w m } which is a basis for W.<br />

Proof. Let S denote the set of positive <strong>in</strong>tegers such that for k ∈ S, there exists a subset of {⃗w 1 ,···,⃗w m }<br />

consist<strong>in</strong>g of exactly k vectors which is a spann<strong>in</strong>g set for W. Thus m ∈ S. Pick the smallest positive<br />

<strong>in</strong>teger <strong>in</strong> S. Callitk. Then there exists {⃗u 1 ,···,⃗u k }⊆{⃗w 1 ,···,⃗w m } such that span{⃗u 1 ,···,⃗u k } = W. If<br />

k<br />

∑<br />

i=1<br />

c i ⃗w i =⃗0

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

Saved successfully!

Ooh no, something went wrong!