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.

202 R n ⃗u 1 =<br />

Furthermore,<br />

⎡<br />

⎢<br />

⎣<br />

1<br />

1<br />

0<br />

0<br />

⎧⎡<br />

⎪⎨<br />

⎢<br />

⎣<br />

⎪⎩<br />

⎤<br />

⎥<br />

⎦ ,⃗u 2 =<br />

1<br />

1<br />

0<br />

0<br />

⎤<br />

⎡<br />

⎥<br />

⎦ , ⎢<br />

⎣<br />

⎡<br />

⎢<br />

⎣<br />

−1<br />

0<br />

1<br />

0<br />

−1<br />

0<br />

1<br />

0<br />

⎤<br />

⎤ ⎡<br />

⎥<br />

⎦ , ⎢<br />

⎣<br />

⎥<br />

⎦ ,⃗u 3 =<br />

is l<strong>in</strong>early <strong>in</strong>dependent, as can be seen by tak<strong>in</strong>g the reduced row-echelon form of the matrix whose<br />

columns are ⃗u 1 ,⃗u 2 and ⃗u 3 .<br />

⎡<br />

⎢<br />

⎣<br />

1 −1 1<br />

1 0 0<br />

0 1 0<br />

0 0 1<br />

⎤ ⎡<br />

⎥<br />

⎦ → ⎢<br />

⎣<br />

1<br />

0<br />

0<br />

1<br />

⎡<br />

⎢<br />

⎣<br />

⎤⎫<br />

⎪⎬<br />

⎥<br />

⎦<br />

⎪⎭<br />

1 0 0<br />

0 1 0<br />

0 0 1<br />

0 0 0<br />

S<strong>in</strong>ce every column of the reduced row-echelon form matrix has a lead<strong>in</strong>g one, the columns are<br />

l<strong>in</strong>early <strong>in</strong>dependent.<br />

Therefore {⃗u 1 ,⃗u 2 ,⃗u 3 } is l<strong>in</strong>early <strong>in</strong>dependent and spans V, soisabasisofV. Hence V has dimension<br />

three.<br />

♠<br />

We cont<strong>in</strong>ue by stat<strong>in</strong>g further properties of a set of vectors <strong>in</strong> R n .<br />

Corollary 4.87: L<strong>in</strong>early Independent and Spann<strong>in</strong>g Sets <strong>in</strong> R n<br />

The follow<strong>in</strong>g properties hold <strong>in</strong> R n :<br />

• Suppose {⃗u 1 ,···,⃗u n } is l<strong>in</strong>early <strong>in</strong>dependent. Then {⃗u 1 ,···,⃗u n } is a basis for R n .<br />

• Suppose {⃗u 1 ,···,⃗u m } spans R n . Then m ≥ n.<br />

•If{⃗u 1 ,···,⃗u n } spans R n , then {⃗u 1 ,···,⃗u n } is l<strong>in</strong>early <strong>in</strong>dependent.<br />

⎤<br />

⎥<br />

⎦<br />

1<br />

0<br />

0<br />

1<br />

⎤<br />

⎥<br />

⎦<br />

Proof. Assume first that {⃗u 1 ,···,⃗u n } is l<strong>in</strong>early <strong>in</strong>dependent, and we need to show that this set spans R n .<br />

To do so, let ⃗v be a vector of R n , and we need to write ⃗v as a l<strong>in</strong>ear comb<strong>in</strong>ation of ⃗u i ’s. Consider the<br />

matrix A hav<strong>in</strong>g the vectors ⃗u i as columns:<br />

A = [ ⃗u 1 ··· ⃗u n<br />

]<br />

By l<strong>in</strong>ear <strong>in</strong>dependence of the ⃗u i ’s, the reduced row-echelon form of A is the identity matrix. Therefore<br />

the system A⃗x =⃗v has a (unique) solution, so⃗v is a l<strong>in</strong>ear comb<strong>in</strong>ation of the ⃗u i ’s.<br />

To establish the second claim, suppose that m < n. Then lett<strong>in</strong>g ⃗u i1 ,···,⃗u ik be the pivot columns of the<br />

matrix [ ]<br />

⃗u1 ··· ⃗u m

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

Saved successfully!

Ooh no, something went wrong!