06.09.2021 Views

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

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.

494 ANSWERS TO SELECTED EXERCISES<br />

25 (0, −1, 0) (4, −1, 0) saddle point. (2, −1, −12) local<br />

minimum.<br />

27 (1, 1) , (−1, 1) , (1, −1) , (−1, −1) saddle points.<br />

( √ ) (<br />

−<br />

1<br />

6√<br />

5 6, 0 ,<br />

1<br />

√ )<br />

6√<br />

5 6, 0 Local minimums.<br />

29 Critical points: (0, 1, 0) , Saddle point.<br />

31 ±1<br />

G.14 Exercises<br />

8.4<br />

1 The first three vectors form a basis and the dimension<br />

is 3.<br />

3 No. Not a subspace. Consider (0, 0, 1, 0) and multiply<br />

by −1.<br />

5 NO. Multiply something by −1.<br />

7 No. Take something nonzero in M where say u 1 =<br />

1. Now multiply by 100.<br />

9 Suppose {x 1 , ··· , x k } is a set of vectors from F n .<br />

Show that 0 is in span (x 1 , ··· , x k ) .<br />

0 = ∑ i 0x i<br />

11 ⎛It is a⎞<br />

subspace. ⎛ ⎞ It ⎛is spanned ⎞ by<br />

3 2 1<br />

⎜ 1<br />

⎟<br />

⎝ 1 ⎠ , ⎜ 1<br />

⎟<br />

⎝ 1 ⎠ , ⎜ 0<br />

⎟<br />

⎝ 0 ⎠ . These are also independent<br />

so they constitute a<br />

0 0 1<br />

basis.<br />

13 Pick n points {x 1 , ··· ,x n } . Then let e i (x) = 0 unless<br />

x = x i when it equals 1. Then {e i } n i=1<br />

is linearly<br />

independent, this for any n.<br />

15 { 1,x,x 2 ,x 3 ,x 4}<br />

17 L ( ∑ n<br />

i=1 c iv i ) ≡ ∑ n<br />

i=1 c iw i<br />

19 No. There is a spanning set having 5 vectors and<br />

this would need to be as long as the linearly independent<br />

set.<br />

23 No. It can’t. It does not contain 0.<br />

43 Suppose ∑ n<br />

i=1 a ig i =0. Then 0 = ∑ i a ∑<br />

∑<br />

i j A ijf j =<br />

j f ∑<br />

j i A ija i . It follows that ∑ i A ija i = 0 for<br />

each j. Therefore, since A T is invertible, it follows<br />

that each a i = 0. Hence the functions g i are linearly<br />

independent.<br />

G.15 Exercises<br />

9.5<br />

1 ThisisbecauseABC is one to one.<br />

7 In the following examples, a linear transformation,<br />

T is given by specifying its action on a basis β. Find<br />

its matrix with respect to this basis.<br />

( ) 2 0<br />

(a)<br />

1 1<br />

( ) 2 1<br />

(b)<br />

1 0<br />

( ) 1 1<br />

(c)<br />

2 −1<br />

11 A =<br />

13<br />

⎛<br />

⎜<br />

⎝<br />

⎛<br />

⎜<br />

⎝<br />

0 1 0 0<br />

0 0 2 0<br />

0 0 0 3<br />

0 0 0 0<br />

1 0 2 0 0<br />

0 1 0 6 0<br />

0 0 1 0 12<br />

0 0 0 1 0<br />

0 0 0 0 1<br />

⎞<br />

⎟<br />

⎠<br />

⎞<br />

⎟<br />

⎠<br />

15 You can see these are not similar by noticing that<br />

the second has an eigenspace of dimension equal to<br />

1 so it is not similar to any diagonal matrix which<br />

is what the first one is.<br />

19 This is because the general solution is y p + y where<br />

Ay p = b and Ay = 0. Now A0 = 0 and so the solution<br />

is unique precisely when this is the only solution<br />

y to Ay = 0.<br />

G.16 Exercises<br />

25 No. This would lead to 0 = 1.The last one must<br />

not be a pivot column and the ones to the left must<br />

each be pivot columns.<br />

10.6<br />

( 1 1<br />

2 Consider<br />

0 1<br />

Jordan form.<br />

) ( 1 0<br />

,<br />

0 1<br />

)<br />

. These are both in

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

Saved successfully!

Ooh no, something went wrong!