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.

9.3. L<strong>in</strong>ear Independence 471<br />

Solution. To determ<strong>in</strong>e if R is l<strong>in</strong>early <strong>in</strong>dependent, we write<br />

a(2⃗u − ⃗w)+b(⃗w +⃗v)+c(3⃗v + 1 2 ⃗u)= ⃗0<br />

If the set is l<strong>in</strong>early <strong>in</strong>dependent, the only solution will be a = b = c = 0. We proceed as follows.<br />

a(2⃗u −⃗w)+b(⃗w +⃗v)+c(3⃗v + 1 2 ⃗u)<br />

2a⃗u − a⃗w + b⃗w + b⃗v + 3c⃗v + 1 2 c⃗u<br />

= ⃗0<br />

= ⃗0<br />

(2a + 1 2 c)⃗u +(b + 3c)⃗v +(−a + b)⃗w = ⃗0<br />

We know that the set S = {⃗u,⃗v,⃗w} is l<strong>in</strong>early <strong>in</strong>dependent, which implies that the coefficients <strong>in</strong> the<br />

last l<strong>in</strong>e of this equation must all equal 0. In other words:<br />

2a + 1 2 c = 0<br />

b + 3c = 0<br />

−a + b = 0<br />

The augmented matrix and result<strong>in</strong>g reduced row-echelon form are given by:<br />

⎡<br />

2 0 1 ⎤ ⎡<br />

⎤<br />

2<br />

0<br />

1 0 0 0<br />

⎣ 0 1 3 0 ⎦ →···→⎣<br />

0 1 0 0 ⎦<br />

−1 1 0 0<br />

0 0 1 0<br />

Hence the solution is a = b = c = 0 and the set is l<strong>in</strong>early <strong>in</strong>dependent.<br />

♠<br />

The follow<strong>in</strong>g theorem was discussed <strong>in</strong> terms <strong>in</strong> R n . We consider it here <strong>in</strong> the general case.<br />

Theorem 9.22: Unique Representation<br />

Let V be a vector space and let U = {⃗v 1 ,···,⃗v k }⊆V be an <strong>in</strong>dependent set. If ⃗v ∈ span U, then⃗v<br />

can be written uniquely as a l<strong>in</strong>ear comb<strong>in</strong>ation of the vectors <strong>in</strong> U.<br />

Consider the span of a l<strong>in</strong>early <strong>in</strong>dependent set of vectors. Suppose we take a vector which is not <strong>in</strong> this<br />

span and add it to the set. The follow<strong>in</strong>g lemma claims that the result<strong>in</strong>g set is still l<strong>in</strong>early <strong>in</strong>dependent.<br />

Lemma 9.23: Add<strong>in</strong>g to a L<strong>in</strong>early Independent Set<br />

Suppose⃗v /∈ span{⃗u 1 ,···,⃗u k } and {⃗u 1 ,···,⃗u k } is l<strong>in</strong>early <strong>in</strong>dependent. Then the set<br />

{⃗u 1 ,···,⃗u k ,⃗v}<br />

is also l<strong>in</strong>early <strong>in</strong>dependent.

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

Saved successfully!

Ooh no, something went wrong!