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

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

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

Example 4.71: L<strong>in</strong>ear Dependence<br />

Consider the vectors {[<br />

1<br />

4<br />

] [<br />

2<br />

,<br />

3<br />

] [<br />

3<br />

,<br />

2<br />

]}<br />

Are these vectors l<strong>in</strong>early <strong>in</strong>dependent?<br />

Solution. This set conta<strong>in</strong>s three vectors <strong>in</strong> R 2 . By Corollary 4.70 these vectors are l<strong>in</strong>early dependent. In<br />

fact, we can write<br />

[ ] [ ] [ ]<br />

1 2 3<br />

(−1) +(2) =<br />

4 3 2<br />

show<strong>in</strong>g that this set is l<strong>in</strong>early dependent.<br />

♠<br />

The third vector <strong>in</strong> the previous example is <strong>in</strong> the span of the first two vectors. We could f<strong>in</strong>d a way to<br />

write this vector as a l<strong>in</strong>ear comb<strong>in</strong>ation of the other two vectors. It turns out that the l<strong>in</strong>ear comb<strong>in</strong>ation<br />

which we found is the only one, provided that the set is l<strong>in</strong>early <strong>in</strong>dependent.<br />

Theorem 4.72: Unique L<strong>in</strong>ear Comb<strong>in</strong>ation<br />

Let U ⊆ R n be an <strong>in</strong>dependent set. Then any vector⃗x ∈ span(U) can be written uniquely as a l<strong>in</strong>ear<br />

comb<strong>in</strong>ation of vectors of U.<br />

Proof. To prove this theorem, we will show that two l<strong>in</strong>ear comb<strong>in</strong>ations of vectors <strong>in</strong> U that equal⃗x must<br />

be the same. Let U = {⃗u 1 ,⃗u 2 ,...,⃗u k }. Suppose that there is a vector⃗x ∈ span(U) such that<br />

⃗x = s 1 ⃗u 1 + s 2 ⃗u 2 + ···+ s k ⃗u k ,forsomes 1 ,s 2 ,...,s k ∈ R, and<br />

⃗x = t 1 ⃗u 1 +t 2 ⃗u 2 + ···+t k ⃗u k ,forsomet 1 ,t 2 ,...,t k ∈ R.<br />

Then⃗0 n =⃗x −⃗x =(s 1 −t 1 )⃗u 1 +(s 2 −t 2 )⃗u 2 + ···+(s k −t k )⃗u k .<br />

S<strong>in</strong>ce U is <strong>in</strong>dependent, the only l<strong>in</strong>ear comb<strong>in</strong>ation that vanishes is the trivial one, so s i − t i = 0for<br />

all i,1≤ i ≤ k.<br />

Therefore, s i = t i for all i, 1≤ i ≤ k, and the representation is unique. Let U ⊆ R n be an <strong>in</strong>dependent<br />

set. Then any vector⃗x ∈ span(U) can be written uniquely as a l<strong>in</strong>ear comb<strong>in</strong>ation of vectors of U. ♠<br />

Suppose that ⃗u,⃗v and ⃗w are nonzero vectors <strong>in</strong> R 3 ,andthat{⃗v,⃗w} is <strong>in</strong>dependent. Consider the set<br />

{⃗u,⃗v,⃗w}. When can we know that this set is <strong>in</strong>dependent? It turns out that this follows exactly when<br />

⃗u ∉ span{⃗v,⃗w}.<br />

Example 4.73:<br />

Suppose that⃗u,⃗v and ⃗w are nonzero vectors <strong>in</strong> R 3 ,andthat{⃗v,⃗w} is <strong>in</strong>dependent. Prove that {⃗u,⃗v,⃗w}<br />

is <strong>in</strong>dependent if and only if ⃗u ∉ span{⃗v,⃗w}.<br />

Solution. If⃗u ∈ span{⃗v,⃗w}, then there exist a,b ∈ R so that⃗u = a⃗v+b⃗w. This implies that⃗u−a⃗v−b⃗w =⃗0 3 ,<br />

so ⃗u−a⃗v − b⃗w is a nontrivial l<strong>in</strong>ear comb<strong>in</strong>ation of {⃗u,⃗v,⃗w} that vanishes, and thus {⃗u,⃗v,⃗w} is dependent.

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

Saved successfully!

Ooh no, something went wrong!