Student’s Solutions Manual | itite- Vee oye} Third Edition John B. Fraleigh Raymond A. BeauregardStudent’s Solutions Manual Linear Algebra Third Edition John B. Fraleigh University of Rhode Island Raymond A. Beauregard University of Rhode Island A vv Addison-Wesley Publishing Company Reading, Massachusetts « Menlo Park, California + New York Don Mills, Ontario » Wokingham, England + Amsterdam + Bonn + Sydney ‘Singapore * Tokyo + Madrid » San Juan + Milan « ParisPREFACE This manual contains complete solutions for every third exercise (1, 4, 7, 10, and so on) in the text, except those odd- numbered ones for which fairly lengthy complete solutions are given in the answers at the back of the text. Then reference is simply given to the text answers to save typing. We (the authors) prepared these solutions ourselves. While we tried to be accurate, there are sure to be the inevitable mistakes and typos. However, students should find this manual adequate for the purpose for which it is intended. Kingston, R.1. J.B.P. August, 1994 R.A.B.CONTENTS CHAPTER 1 Vectors, Matrices, and Linear Systems @BIAUEENE Vectors in Euclidean Spaces . The Norm and the Dot Product. . Matrices and Their Algebra Solving Systems of Linear Equations . Inverses of Square Matrices . Homogeneous Systems, Subspaces, and Bases . Application to Population Distribution (Optional) Application to Binary Linear Codes (Optional) CHAPTER 2 Independence and Linear Transformations of 8” i. Independence and Dimension 2. The Rank of a Matrix 3. Linear Transformations of Euclidean Spaces 4. 5. Lines and Other Translates (Optional) Linear Transformations of the Plane (Optional) CHAPTER 3 Vector Spaces Vrene . Vector Spaces Basic Concepts of Vector Spaces Goordinatization of Vectors Linear Transformations Inner-Product Spaces (Optional) CHAPTER 4 Determinants 1. 2. 2. 4. Areas, Volumes, and Cross Products The Determinant of a Square Matrix Computation of Determinants and Cramer's Rule Linear Transformations and Determinants (Optional) CHAPTER 5 Eigenvalues and Eigenvectors 1. 2. 3. Eigenvalues and Eigenvectors Diagonalization Two Applications 21 21 22 23 25 27 30 30 32 36 38 43 45 45 48 50 54 58 58 65 69CHAPTER 6 Orthogonality de 2. The Gram-Schmidt Process 3. Orthogonal Matrices 4, 5. The Method of Least Squares Projections The Projection Matrix CHAPTER 7 Change of Basis lL, 2. Coordinatization and Change of Basis Matrix Representations and Similarity CHAPTER 8 Eigenvalues: Further Applications and Computations poNr . Diagonalization of Quadratic Forms . Applications to Geometry . Applications to Extrema Computing Eigenvalues and Eigenvectors CHAPTER 9 Complex Scalars PONE . Algebra of Complex Numbers . Matrices and Vector Spaces with Complex Scalars . Eigenvalues and Diagonalization . Jordan Canonical Form CHAPTER 10 Solving Large Linear Systems 1. 2. 3. Considerations of Time The LU-Factorization Pivoting, Scaling, and 11l-conditioned Matrices APPENDIX A Mathematical Induction 74 74 76 79 83 86 90 90 92 97 97 100 104 108 lil 111 113 118 122 128 128 131 135 137CHAPTER 1 VECTORS, MATRICES, AND LINEAR SYSTEMS SECTION 1.1 - Vectors in Euclidean Spaces {-1, -3] 4.vtwe= (5, 4, 7] {5, 1] v-w=[-l, -6, -1] l.vtw view -2] + (4, 0, -1] - [-3, -1, 2] = -3) = [6, 4, -5] » 3, 0] + [-2, 0, 1, 6) - (3, -5, 1, -2] = 5, 0, 8) = [-2, 11, 3, 8] 13, 16.Section 1.1 1g. 22. 25 28 Rg, 34. 37. oe 4,55 -0.5 Looking at second components, we see that to have [c”, -4] = r[1, -2], we must have -2r = -4, so r= 2. Thus c? = 2(1) = 5, so c= 2 and ¢ + 2f2. Tf (13, -15] = r[1, 5] + s(3, c], then e #15 since [1, 5] and [3, 15] are parallel, but are not parallel to (13, -15]. Any other choice for c allows [13, -15] to form the diagonal of a parallelogram having adjacent edges formed by vectors r[l, 5) and s[3, c]. If (1, ¢, e-l] = rfl, 2, 1) + s{3, 6, 3] = (+ 3s)[1, 2, 11, then r+ 3s = 1, c= 2(r + 3s), andc -l=r4 3s, The first and second equations yield c = 2, which does satisfy the third equation since r+ 3s = 1. Thus c = 2. [4, 2) = [-1, 3] = [5, -1] [-5, -4, -3, -2, -1] - (1, 2, 3, 4, 5] = [-6, -6, -6, -6, -6] a) -3p - dr + 6s 4p - 2q + 3r 6p + 5q- Wr +75 = “Ald a) (atv) hws [uy ty ut + Uw, oe, wT ty) by Gey) ew) hat tw), ut wD] Tle at iy tw ev ed 1 ut (vtw)ML. M4. M7. MLO. Section 1.2 b) OF V= [0, --+, O) + fv, oo. I - (0+, »O#V I] = [yyy vay eo) vt Cv) = (yy re Ul t Eevee Yad ely ye a -v,] = (0, ---, 0] = 0 [-58, 79, -36, -190] a) (2.1667, -0.2333, 3.8095] b) [2.16666666666667, -0.23333333333333, 3.80952380952381] c) [13/6, -7/30, 80/21] a) (0.0357, 0.0075, 0.1962} b) [0.03571428571429, 0.00750000000000, 0.19619047619048] c) [1/28, 3/400, 103/525] [-1/6, 8/3, 11/2, 25/3, 67/6, 14] SECTION 1.2 - The Norm and the Dot Product 10. 13. 16. cal = 1a, -3, ap = {22 + Cay? + Cay? = lv - 2uf = [2, 1, -1]) - 2[-1, 3, ail = (2, 1, -1] = [-2, 6, si} = ff4, -5, -91) = (4)* + (-5)° + (-9)° = [122 a = 1-0? 32 4 a rey a= [-1, 3, 4] = 0 ie ‘Te Tae Ta u(y ty) = [-1, 3, 4)+([2, 1, -1] + (-2, +1, 3) = [-l, 3, 4]+(0, 0, 2} -O+ 048-8 (1,3, 4)+[-2, -1, 3) | 1 ful cos # = = -0,5765567; Teo4i6 (e+i+9 [30h @ = cos (tL) = sa.te 36h (x, y, 2)+[-1, 3, 4] = -x + 3y + 42 = 0, fx, y, 2]*(2, 1, -l] = 2+ y- 2=0 Adding 2 times the first equation to the second, we obtain ly + 7z=0, soy = -z. Replacing y by -z in either the first or second equation yields x = z. Thus if we let z= r,Section 1.2 we see that every vector of the form [r, -r, r] for r * 0 is a solution. One answer, taking r= 1, is [1, -1, 1). 19. |[10, 20, 25, -15}f = 5](2, 4, 5, -3]) - 544 164+ 2549 = 5{54 = 156 (1, -1, 2, 3, 0, 4]-[7, 0, 1, 3, 2, 4 22. cos @ = Tororo +04 6 (49+ 0F1+ 944416 ~ —34 2 0.687044, so 6 = cos b(—24) = 46.6". Tah9 25. [-1, 4]+(8, 2] = -8 +8 = 28. (2, 1, 4 -1J*[0, 1, 2, 4) =-0+148-4=5%0; not perpendicular. If r[2, 1, 4, -1] = {O, 1, 2, 4], then 2r = 0 so r=0, andalsor=1. Since 0 «1, the vectors are not parallel either. perpendicular 31. The vector v - w, when translated to start at (wy, Wy, “+7, W,,), Teaches to the tip of the vector v, so its length is the distance from (w,, wy), w) to Wye Voge tte Vy) ® ve Ye ‘n 34, (3, 1, 2, 4) - (-1, 2,1, 2) = 4f4, -1, 1, 20 = Terit+til+4-= [22 37. Let T be the tension. Referring to the figure, we see that r= IL byl . " i ai F, - GT sin #)i + (T cos #)j, Fy = (T sin 6)i + T(cos 6)j. Thus 100 = |[F) + Fy = |\(27 cos 9) 3) - orc = fir. Therefore T = 100/{3 1b. 40, TTFFTFTFFF 43. Now (v - w)e(v + .W) = ve - wey tovew > ww svev = wew 2 2 = ivi” - del”. Thus v - w and v + w are perpendicular if and only if (wv - w)+(v + w) = 0, which occurs if and only if ivy? - jw]? - 0, which happens if and only if [vl] = [wl. 446. ML. Ma. M7. Section 1.3 Figure 1.30 suggests that |v + wl - |v - wl. Using vew = 0, we proceed to prove this. Now |v + «ll? = (vt w)e(v tw) = vev + ew + wey + wew am vey + wow = fof? + ell” il 2 2 2 Similarly, |v - wf” = |vh* + [wl”. Therefore |v + ul* = Iv - wl, so |v + wf = |v - wf. Let P be the midpoint of the hypotenuse in Fig. 1.30. The distance from P to the vertex at the right angle is dy + ull; the distance from P to the other two vertices is $lv - wl]. Therefore these distances are equal. lla = 6.3246; the two results agree. 12385 a) viw = 26,8074 b) vew = “Ze angle ~ 0.9499 radians SECTION 1.3 - Matrices and Their Algebra a. 10. 13. 16. 19. 3A = [:$ 3 3] 4. Impossible 7. Impossible 12 0-3. -6 -6 14 -120 -120 280 20| 37 -2 9] = | 740 -40 180 (5D) (4B) = 20DB -19 2-7 -380 40 -140 “4 2 -81 8 27 -35 (24 - B)D = [et Jf ‘ [2 3] “1-3 303 =-7 BC = [s 2. cB = |30 -6 18 ~ +2 -5 12 4 4 -8 12 -4 xy = [-2 3 -1]]-1] = [-14], yx = J-2[{-23 -1)-] 2-3 1 3 3 -6 9-3Section 1.3 22. 25, 28. ai. 34, 37. 40. a) Let x be al xn row vector. If xA is defined, then A is n x m for some m, and xA is then a 1 x m row vector. b) Similar proof to (a), or we can note that (Ay)? = y/a™ and appeal to part (a). The (i,j)th entry in A+ Bisa + which is b,, 75, + ayy ij 0 aj aj Wis the (i,j)th entry in B+ A; Since A+B and B + A have the same size, they are equal. ~ r(sa,,), which is the (i,j)th entry in r(sA). Since (rs)A and r(sA) have the same size, they are equal, The (i,j)th entry in (rs)A is (rs)a, The (i,j)th entry of (A+ 8)? is a,, + bg which is the or (i, j)th entry of AP +7, since (a +B)? and A’ +B” have the same size, they are equal. Let A= [a,,] be mx n and lec B= [bj] ben xs. The n n (i,k)th entry in (rA)B is Zot eye - PPA The n n (£k)eh emery in (eB) Le Fa; (2b j) = FE a Pye The j j n (4,k)th entry in r(aB) is rE a,ib,,. Since (rA)B, A(rB), ge BF and r(AB) all have the same size, they are equal. Since hy = Wj +i - 1 = YG + J - 2) = hy, ve see that His a symmetric matrix. a) (ay? - aay? - aral - (ary? and (a)? . caa2)T . (a2yt al = aa oP? b) Statemenc: (A")? = (a7)” for n& 1. Proof: The statement becomes 42 = a’ for n= 1, Let k>1 and assume (inductive hypothesis) that the statement holds for n= k. Then (At)? 2 (aay? = ca)TaT using the inductive hypothesis, we have (A‘)TaP = caT)Ka? Ty kel = (4°)""" which completes the inductive proof.Section 1.4 43. (A+ B)(A - B) = A? - B? if and only if AB= BA, Let 1. 00 a-{f 4 and 2-[? ale Then AB = BA, aroa-a-[! Ut q-2 i]. ane e28)-B IBS 2 0 ojf1 o 1 20 2 46. |0 r o]fo 1 of = |o r 0 0 0 2jft 0 2 29 2, These products are equal 4, 6 ile 0 6 0 for all values of r. 0 1 o}fo r Oo] = jo x 0 1 0 iflo o 2 20 2 19616 32254 6142 39668 5324 118998 304974 237009 436421 251645 49. 1119592 253590 184626 348650 232514 189786 351337 166597 342753 299707 114414 240371 177647 353409 204283 36499 30055 -6890 10010 50800 30055 32653-11723 3622 44680 -6890 -11723 17179 14629 -15569 10010 3622 14629 22237 10107 50800 44680-15569 10107 75753, 52. ML. a) 32 b) 14629 c) -41558 M4. -79 M7. 1/2 SECTION 1.4 - Solving Systems of Linear Equationsx= 2 yr 4 dx -y=8 -2y = 8 | | 1 -2 2 0 “ ] -{ 8 32. 5-6r 2-4r}, x 1 55 | 2 6 ono aga dao os Ex coos ao Hos aco Inconsistent which shows 5s 3 23. o1 -3 204 o1 0 0 -23 |-{ aso aad maa | is in the span of 2 L 3 7 | which shows that [ mace nda mHoo Hoce Section 1.4 28.Section 1.4 1] f-3 L 2 1 2 2 a 4 2] J-af? |-1}r 2R* Jo 3] [-9 4 0 BL. (4x, + 2x,, 4x, +6] = [-6, 18]; x = “1, xy = 3 1-5 | 13 1-5 | 13 1 0} 3). 32-4 o 17 |-34) ~ lo 2 |-2]) %17 7 4277 + ky be, + 3x5] fo 1 3, + 2, 5x, + 3x, 1 0 2;1_ft 231 13] _ [2 0 |-3]. Va-( 28 ¥al-f 1 3): Rood By Ss 2/3 | 0 1 0} 2). . . al s-[ oy a]: ay" 2, mye 8 ws, t or Lo 1l-1] by L Yel by 40. 2 1{b| ~ jo 1-2 by . The system is 1-1 | by 0 0 3 |-2b, + by consistent for all values of b, and b). 100 43. f= |2 1 0 oo 1 In Exercises 46 and 49, start with the 4 x 4 identity matrix and perform the given operations in sequence to obtain the matrix shown as answer. -t core coor oroo Heoo coor Bors eros book “lL 52. Suppose the ith and jth rows of an mx n matrix A are exchanged resulting in a matrix B. Let the ith and jth rows of the mx m identity matrix I be exchanged resulting in the 9Section 1.4 55. 58. 61. elementary matrix E. Let C = EA. Then multiplication of A on the left by the ith row vector of £ is the same as multiplication of A on the left by the jth row vector of I, so the ith row vector of G is the jth row vector of A. By a similar argument, the jth row vector of C is the ith row vector of A. The other rows of C are of course the same as the corresponding rows of A. Thus B = C. a) The empty sequence of elementary row operations applied to 4 produces A, so A~ A. b) Suppose A ~ B, so that A is row equivalent to B. Then there is a sequence of elementary row operations that can be performed successively on A to obtain B. Performing the inverse of each of these elementary row operations sequentially and in reverse order on B will produce A. Thus B ~ A, c) Suppose that A ~ B and B~ C. Then there are two sequences of elementary row operations, the first of which will reduce A to B and the second of which will reduce B to C. Thus the first sequence followed by the second sequence, when performed on A, will reduce A to C, so that A~C, a) If [A | c] ~ [H | 4] where H has echelon form, then each column of H must have a pivot so there are at least as many rows as columns in H, that is, m2 n. b) If m=n, then A~ I, the n x n identity matrix, since 4x = c has a unique solution. Thus [A | b] ~ (I | d’] and Ax = b has the unique solution x = d’. c) If m>n, then the final row of H in part (a) has all zero entries. Let e, be the final column of the n x n identity matrix. Reversing the elementary row operations that reduce A to H, we see that there exists a vector b such that [H | e,] ~ (4 | b], and the system Ax = b is therefore inconsistent. 0.0345 1 -1.2857) -0.5370 1 x= | 3.1429 64. x = |-1.6240 67, x = [3] 1.2857, 0.1222 i 0.8188 2 1x [7] M4. See the answer to Exercise 61, 10|. Section 1.5 1/2 “3 -1 1/6 0 1 0 |-9/2 [2/3 | ~ [: 1 | 4 1/6 1 0-1/3 1/2 -3 -9/2 b) The matrix A itself is an elementary matrix. -1 ate [ M7. x) = -13 - 2r + lds, xy =r, x, = -5 + 55, x, = 8 SECTION LS - Inverses of Square Matrices aaa wees : = Sev Bae ga mon ; : ania one one 6, Dee ee 22 1 | SSF SEP game, noo a Son "_ one ono Sam Ben 1 : ene one oa as woo : Yo 229, 38 = 40. ; Sea Yoga wae one o Sa OSA gues noo Sat o> ae Soa or oe, = nee = Seca Ona ao of ; es 4 nos 1 no Sor = — Sea = WY Se one « Rao ay a8, 10° sa 28 noe o, SF Ss So gon Son a 2, wo ae? see, gee, 28 22 ase one eke 4 ano, 400, jf yt 4s wes wog ae, ceo yo ye yp tee 3 3 7. a) 11Section 1.5 1 0 0 lo. 6 0 oO a3 1-3/2) 1/2 0] _ [2 04-7 3 . 0 1/2|-5/2 1 o 1]-5 2)’ 1 3}f 4] _ [-37 %y 2} [+3 -26 ft 2 12 yf 2 5 16.C=A o21 Oo 3 Ljo 1 4 4. 4 1 2hla 2 2 al 19, Using the solution to the preceding exercise, we see that A+ 24 = A? + A(2T) = A(A + 21). Thus we can take 302 «20 B-A+2r-|0 3 2. 1030 4. 22. If A and B are row equivalent, then there is a sequence E), Ey, «7+» Ey of elementary mx m matrices such that B~ EE .1--E)Ey4. Thus ¢ - £,£, 1-+-E)£, is the required invertible matrix. Conversely, if B = CA and C is invertible, then C may be expressed as a product of elementary matrices as shown in the text. Therefore, B and A are row equivalent 0-1 0 1) _ fo o 2. 0) se, onsite 2 2+ [2 3 - [8 9. b) Yes. A+A-= 24 = (2I)A is a product of invertible matrices and so is itself invertible. 1228. 5ks 34, 37. 40. 43. 46. ML. Section 1.5 In matrix notation, we never write 4 but rather write A If we try to use quotient notation, we would not know whether 4 means B’14 or Bt. Accordingly, we expect the desired analogous equality contains (A + B) times factors A and B on the left or the right or one on each side. We find that 4 alae Bye = a tap + alee t-te tat. 2 0 a, ay ay 0 0 x x, 0 0 bb, 000 x, 00 0c has the form |) g g g |: Sauaring again 0000 0000 we obtain the form Therefore the 6th power Sooo oooo oooo ooon of the original matrix is the zero matrix. (In fact, so is the Sth power.) 10 0 0 0 Oj, 000 The matrix AE can be obtained from A by applying to A the elementary column operation represented by E (see Exercise 36). Note (ae)" = E74? affects the rows of A’ which are the columns of A. ooo ore Heo, 0.487 -0.241 0.131 -0.588 0.312 -0.0854 -0.166 0.216 -0.0754 (See Exercise 9.) -0.588 0,312 -0.0854 0.487 0.241 0.131 -0.166 0.216 70.0754 0.001783 M4. 0.09985 M7. -0.001071. 13Section 1.6 SECTION 1.6 - Homogeneous Systems, Subspaces, and Bases 1. Let L = ({r, -r] | r € B) which is a nonempty subset of Rr’, Let (a, -a], [b, -b] © L. Then (a, -a] + [b, -b] = [a+ b, -a- b] = [2 +b, -(a + b)] which has the form [r, -r] and thus is inL . Also rla, -a] = [ra, -(ra)) which is in L. Thus L is a subspace of RB’ 4, Let $= ([x, y] | x, ye Rand x, y20}. Since [1, l] eS but (-1){1, 1] = [-1, -1] is not in $, we see that $ is not closed under scalar multiplication, so it cannot be a subspace of R’. 7. Let P = ({x, y, 2] | x, y, 2€RB, z=1, y = 2x). Clearly (0, 0, 0] is not in P, Thus P is not a subspace of R°. 10. Let H = ([x,, 0, x3, *+*, x,] | x; €R) which is a nonempty n subset of RB’. Now aij + [b,, 0, b fay, 0, ag, te, By] > ait bd) 3) = [a, + by, 0, a, + bg, + which is in H, and rla,, 0, see, a] = [ra], 0, rag, se, ra.) ap which is in H, so H is a subspace of R”. 13. a) Every subspace of R° is either (0), all vectors along a Line through the origin, or all of R”. b) Every subspace of R° is either (0), all vectors along a line through the origin, all vectors in a plane through the origin, or all of R°. 16. [ 3] - [3 4 : ('] - [| - [i]. so ({1, 1]} is a basis for the solution space. 22 2 1 -6 10 1 0 7/13 6/13 ag, {2 “© 1 Of fo 13 -1 1) jo 2 -1713 1/13 3-5 2 1 0 13 -1 1 oo 0 0 . 5-4 3 2 0 26 -2 2 00 0 022. 25. 28. 31, 34. 37. Section 1.6 -7r/13 - 68/13 2 -6 r/13- 5/13] _ _r| 1] , _s}-1 © 73]13] * 73} 0} °° s 0. 13 ({-7, 1, 13, 0], [-6, -1, 0, 13]) is a basis for the solution space. [i Hl [3 4 The matrix is invertible so the set is 1 2} 7 [o . 2 L 33 so the set is a basis for R° by Theorem 1.16. a basis for R” by Theorem 1.16. 2 1-0 -1 1 0-1 -1} - |0 4 4|~ |0 1 1}. The matrix is invertible 0 2 3 0 0 0-2 nor Let v be the first column vector and w the second column vector of the matrix. We observe that 3v + w = 0, so by Theorem 1.15, the column vectors are not a basis for the column space of the matrix. 2 3 1 i 7 2 1 0 1/1L 5 2 1 0-33 -9 o 1 3/ll fF 0 1 w3f~ lo oO: The solution 6 -2 0 0 -44 -12 0 0 0 Clie space is given by |(-3/1l)t] for all scalars ¢. A basis is c ([-1, -3, WD. 7+2¢-r- 5s 7 fe - es Se x= & = ° + E Q oO r s 0 s 213 0/5 1-1 2 140 1-1 2 140 1-1 2 1/0] Jo 3-1-2] 5) _ Jo 3-1-2] 5] _ 4-17 2 5 a 3-1-2 a 000 0 0 1-2-1 21 /-5 0-3 1 2 4-5 0000/0 1 0 5/3 1/3 5/3 5/3 -(5r + s)/3 O 1-1/3 -2/3 | 5/3], ~ 15/3 (x + 2s)/3 00 0 0 o |? i 0 © 00 0 oO 0 0 s 1sSection 1.6 40. 43. 46. With more equations than unknowns, we naively expect that too many conditions are demanded of the unknowns to permit any solution, In practice, this is usually the case (see Section 6.5). If the system does have a solution, some of the equations could be deleted to produce a square system with the same solution. Assume Ax = b is consistent and has more than one solution. Theorem 1.18 (part 2) shows that Ax = 0 has more than one solution also. Exercise 42 then shows that Ax = 0 has an infinite number of solutions. Thus 4x = b has an infinite number of solutions by Theorem 1.18 (part 2). a) b) In view of Theorem 1.15 and Exercise 45a, it remains to show that the zero vector is a unique linear combination of v, and 2v, +v , Suppose cyv, + c)(2v, + ¥)) = 0. Then fey LS 2eo)vy + Cov, = 0 so that c, + 2co = 0 and 1 , = 0 because {v,, vp} is a basis for sp(v,, v)). Thus 2 17 °2 In view of Theorem 1.15 and Exercise 45b, it remains to show that the zero vector is a unique linear combination of v) + v) and v, - vy, Suppose c) (vy + vy) + c, = c, = 0, which is what we need to show. egy - vj) = 0. Then (ce) + cy)v + (cy - cy)v = 0 so that c) + cy = 0 and ey > ey = 0 because (vy, Vy) is a basis for sp(vy, v, Adding the preceding equations we 9) see that ey =0 so es 0. Thus c= 0 also. Following the criterion of Theorem 1.15, suppose that e,(v, + ¥,) + e9(vy - vy) + 0,(2v, - 3v) = 0. Then (e, + ey + 2c,)v, + (ce, - cy - 3¢,)¥, = 0 80 that 2 cy +e, + 2c, = 3, €, - ey > eg - 0 because (v,, v,) is a basis for sp(v,, vj). This is a homogeneous system with fewer equations than unknowns and thus has nontrivial solutions. In view of Theorem 1.15, the given vectors cannot form a basis for any subspace of n R”. 1649. ML. MA. M7. Section 1.7 i T oo; The matrix having b,” as ith colum vector has as its reduced echelon form the 4 x 4 identity matrix followed by a row of zeros, so by Theorem 1.17, the vectors form a basis for the subspace that they span. : i T i The matrix having a,° as ith column vector does not have as its reduced echelon form the 4 x 4 identity matrix, so by Theorem 1.17, the vectors do not form a basis for the subspace that they span. ; . T “ The matrix having w,” as ith column vector does not have as its reduced echelon form the 4 x 4 identity matrix, so by Theorem 1.17, the vectors do not form a basis for the subspace that they span. The probability is still 1. Our row reduction always yielded the 8 x 8 identity matrix, showing that thé colum vectors in each 8X 8 "random" matrix spanned R°. SECTION 1.7 - Application to Population Distribution (Optional) 33. 16. No, since the sum of the entries in the first column is not equal to 1. No, since the matrix is not square. Yes. The matrix is not regular since every power has zeros in the first, second, and fourth entries of rows 3 and 5. _ We compute the entry in the 2nd row and 3rd column of 7’, wy obtaining [.4 .2 .1]|-1| - .16 + .02 + .05 = 0.23. & x x x 2 x xX x 0 x x| again has the same form |0 x x], soa 0 x x ox x matrix of this form is not regular. A matrix of this form is not regular; its square has the same form. Alternatively, we can simply note that it is impossible to go from the second state to any other state. 7Section 1.7 19. 22. 3. 28. 31. 34. 37. 40. rere [¥B 3] ee Pes overt rb 3/4 =~ fia): 0 1/4 1/2 ol. 2 o 1 r-r=|0 -3/4 O|]- |0 0 3/2) ~ |0 0 0 1/2 -1/2 0 0 -3/2 00 coef] TRFTITFTFFT R 1] U .2) 8 WR 4.3 .1][-4 32 25.5 .2]].5] = 1.47 al 22 27]. 21, Offspring of one dominant and one hybrid parent inherit G from the dominant parent. Half of them inherit g and half inherit G from the hybrid parent. This gives column 1 of the transition matrix. Column 3 is obtained similarly. For column 2, half the offspring of two hybrid parents inherit 6 from the mother, and half of those also inherit G from the father, Thus the proportion of dominant offspring is (1/2) (1/2) = 1/4. The other two numbers in colum 2 are obtained similarly. BE Til) = |1/2 0 1/4 The transition matrix has at least one entry 1 on the main diagonal. It cannot be regular if it has more than one state, for it is impossible to get from such an absorbing state, corresponding to a diagonal entry 1, to any other state. burs bow 18Section 1.8 43. Let m and q be as suggested, and consider the suggested A F new chain with transition matrix ¢ = E as d- Then oof 828) a gen mee o qa - 4) Since q is the smallest entry in its row in T, we are more likely to reach an absorbing state in mr time periods in the original chain than we are in r time periods in the two-state with transition matrix C. Since the steady state Fiaed 7 an ae [t distribution vector in the two-state chain is ne the nm 7 vector Tp must approach the vector with one in the component corresponding to the absorbing state and zero elsewhere. 2020 4037 a6. [M3 49. |.3975 52, |°2626 2/3, 3373 ‘2862 . . 2492 SECTION 1.8 - Binary Linear Codes (Optional) 1. 0001011 0000000 0111001 1111111 1111111 0100101 0000000 0100101 1111111 0111001 4. 000000, 001011, 010101, 011110, 100110, 101101, 110011, 111000 7. a) 110 b) 001 c) 110 4) 001 or 100 or 111 e) 101 10. a) 7 b) 6 —c) we(u + v) = wt (1010011001) = 5 d) wt(u - v) = wt(1010011001) = 5 13. The computation 1 - 0-1, 1-1=0,0-1=1,0-0=0 shows that u - v contains 1's in precisely the positions where the two words differ. The number of places where u and v differ is the distance between them, and the number of 1's inu - v is wt(u - v), so these numbers are equal. 16. Let G be the generator matrix of the Hamming (7, 4) code C. In vector form, we have C= (xG | x€B"), If u and v are in 19Section 1.8 19. 22. a5, B‘ then uG + vG = (u + v)G is in. Since 0 €C, we know that C is nonempty. The triangle inequality in Exercise 14 shows that if the distance from received word v to code word u is at most m and from code word w is at most m, chen d({u, v) = 2m. Thus if the distance between code words is at least 2m+1, a received word v with at most m incorrect components has a unique nearest neighbor code word, This number 2m + 1 can't be improved since if d(u, v) = 2m, then a possible received word w at distance m from both u and v can be constructed by having its components agree with those of u and v where the components of u and v agree, and making m of the 2m components of w in which u and v differ opposite from the components of u and the other m components of w opposite from those of v. Since the minimum distance between words in C is at least 5, no word w € B" has distance < 2 from two different words u, v eC, for if d(u, w) < 2 and d(v, w) s 2, then d(u, v) <4 by the triangle inequality in Exercise 14. Let e, be the word in B” with 1 in the ith component and 0’s elsewhere, and let e,, for i» j be the word in B” with 1’s in components i and j and 0's elsewhere. By the first sentence, the sets e,+C=(e,+v|vec) ande.,+C={e.,+v | vec) for i i ij ij i, fj-1, 2, ---,n, i# J, are distinct from each other, and are distinct from C. Thus n must be large enough to have B” contains all these words. Now C has 2k elements, and the number of e; is n while the the number of iy is n(n - 1)/2. Thus we must have oP k = 4 nak y He nia - 1) 4k 2 Dividing by 2k, we obtain 27 * > 14n +4 n(n - 1)/2. Hy ~X, + X, + x, +X, s 6 7 8 ~ xX) + Rt K, +s Agr xX, + x,t Xt Xe x, + x), yy 7 X, 3 t Xt Xe t Xe, (Other answers are possible.) 10 + x 12 x. 20CHAPTER 2 INDEPENDENCE AND LINEAR TRANSFORMATIONS OF R® SECTION 2.1 - Independence and Dimension 10. 13. 16. 19. 22. 23. 28. | Two nonzero vectors in R* are dependent if and only if they are parallel. . It is a plane through the origin. -3 6 1 aj 7 “23 1-1 1234 1 2 3 4] ~~ The pivots in 3-1 2 5s} ~|0-7-7-7}~]o 111 columns 1 and 1234 7 0000 2 show that ({-2, 3, 1], [3, -1, 21) ds a basis. 1 4 The pivots in columns 1 and 2 show that o18}* ({-3, 1], [6, 4]) is a basis. Since the rowspace of A is the column space of A’, we reduce 1 2 3) fi 2 3) fi 2 3 7_|3 0 2} Jo -6 -7}_]o 6 7 ; “15 4 al-lo -6 -71~]o 0 of: the Pivots 7 2 7 0 -12 -14 0 0 0 in columns 1 and 2 show that [1, 3, 5, 7] and [2, 0, 4, 2] form a basis for the rowspace of A. ae (i -2] . [2-2 The second column has no pivots so 3 -6 0 0 the set of vectors is dependent. a- [73 9] — [2-3] The second column has no pivot so the 0 0 set of vectors is dependent. 124 124 124 Each column has a -3-5 0] ~ |0 112] -|o 122] pivot so the set of 23 1 0 -1 -7 oo 5 vectors is independent. Since there are four vectors in R°, the set is dependent. (See the statement preceding Example 3.) TFTFTITFTITTIFT 21Section 2.2 31. 34. 37. 40. M1. (See the text answer.) Suppose that ray + raw = 0, Then A(z + row) -0. Since A is invertible, we have (A”"A)(ryv + ry") = 410 so that ryv + ryw = 0. Thus r, =r, = 0 since (v, w) is independent. Thus Av, Aw are independent vectors. Suppose that 1 (Cv,) + 1) (Cv,) qf cae af ¥,(Cv,) = 0. Then Clryyy + roy) + +++ + ryy,) = 0. Multiplying on the lefe 71 by CT", we have ryv) + rv) + --- + ry, = 0, 50 tL" Fy" 11+ = x, = 0 by the independence of the v,. Hence the vectors wy > aoe, ov, are independent. (a), &), a5) tvs Yo: vy) M4. (Was War War Wer We) SECTION 2.2 - The Rank of a Matrix Lx [3 0 -3 Hl . IE 0 -3/2 1/2 3.4 2 2} 7 [0 41372 1/2]- a) 2 b) ((2, 0, -3, 1], (3, 4, 2, 21) c) The set consisting of [?]. (| or of (al. [3]. 1) few 4) The set consisting of |743], |"}]. o| La 3.14 2 f. 0-11) f2 0-1 1) fr 00 0 -1 0-1 01 fo 0-2 1] |o 1 2-1] _ Jo 1 0 0 21 0 1/7 Jo 1 2-1/7 ]o 0 5 of ~ Jo 0 1 0 to-1 1} |o 1 7-1} [0 0-2 1} [0 0 0 2 a) & b) The e): 22Section 2.3 3 i 4 z ) the set consisting of |74], |°], |"L}, [2] or ene set c) The set consisting of |"3], (21, [761+ |? e 1 oO -1 L of column vectors (e1, &), @3, e,) d) The null set. 0-9-9 2 12.121 £2i11 1221. E > fb 2 taf fo-9-9 2] fo a aap jo ria “lh 1-3 4 0-7-7:0 0 0 0-7 000 4)" 13 2 0 011-21 0 0 0-7. 000 0 The rank is 3; therefore the matrix is not invertible. 3°0-1 2 1 401 1401 140 L 10 421 8 0-14 1 4) _ 0231 023 1. "j1 4 01 0 -12 -1 -1 oo1l7 5 oo 1 1/2\" 2 6-3 1 O -2 -3 -1 0 0 22 11 0 0 O -7/2. The rank is 4 so the matrix is invertible. 13. Let A have column vectors ay ee Now the linear system Ax = b has a solution if and only if b € colspace(A) if and only if sp(a,,ay,---,8,,b) - sp(@j.49,°-"48,) in if and only if rank(A | b) = rank(A). 16. The row space of AC is contained in the row space of C. 10 1 19. Let A= [3 | and C= [i i}: Then rank(AC) = 1 < 2 = rank(A). 22. Using Exercise 14, rank(ab) < rank(a) < 1. 25. a) 3. b) Rows 1, 2, and 4 SECTION 2.3 - Linear Transformations of Euclidean Spaces 1. Yes, because T can be computed as T(x) = Ax where 23Section 2.3 lo. 13. 19. 22, 25. A’ associated with T’ is A’ = [ 1 1 oO a= 3 He . No, because T([0, 0]) = [0, 1, 0] » [0, 0, 0}. + T({2, -5, 1]) = 27({1, 0, 0]) - S7([0, 1, 0]) + T([0, 0, 1} = 203, 1, 2) - 5[2, -1, 4) + (6, 0, 1) = [2, 7, -15) “lL ljx L-l} -x 1 0] (-x+y)/2 lL .ijy}7 jo 2}x+y}7 lo 1 (x + y)/2]}" yy) 2, + Sn, uy, Tx, yl) = 471-1, 1 + ZF, 1 = AP. 1 4 + 1-6, 3, 21 - [-4x - 2y, x + 2y, -x + 3y] 2, & 2 i 1 an fh] wa |? i H| 221 The matrix A associated with Tis A= }1 0] and the matrix a ; t the so the matrix associated with T’ o T is A'A = i q}. (T'o T)CEx, 5 %))) - [2x,, 3x, + Xp) - No, because A is not a square matrix. L-1 3/100 100 Yes; |1 1 1/0 1 0} ~]o 11 lo ofoo 1 O-1 3 10 0o;0 01 100; 0 0 1 O 1 1] 0 1-1) ~/o 1 0 |-1/4 3/4 -1/2], Oo 4]1 1-2 0 0 14 1/4 1/4 -1/2 a1 0 0 2 a. AN ]-1/6 3/6 1/2), TCX), Xp) X5)) = 1/4 1/4 -1/228. 31. 34. 37. Section 2.4 [yp ans No, because the matrix assocated with To T’ is 3-1 2 1L-1 1 1-1 1] ~ |0 2-1] which is not invertible. 0-2 21 1-2 1 Let u and v be column vectors in RB”. Then (T’ 0 T)(u + v) = T'(T(a + v)) = T'(T(u) + T(v)) = TH(T(H)) + TH(T()) = (T' 0 T)(a) + (T' 0 T)(v). Also, for any scalar r, we have (T' 0 T)(ra) = T'(T(ru)) = T'(rT(u)) = zT' (PCa) = r(T' 0 T)(u). See the proof of Theorem 3.7 in the text. Undefined since T, © T, is not invertible. SECTION 2.4 - Linear Transformations of the Plane (Optional) iL. 4. (See the text answer.) Rotation of the plane counterclockwise through an angle 30 can be achieved by rotation through the angle @ applied three times. Thus this transformation having as standard matrix cos 3@ -sin 34 i be 01 representation [evs 30 can 39| also has the representation cos 6 -sin 8 a sin @ cos 6 cos’# - sin’@ -2 sin @ cos @||cos @ -sin # 2 sin @ cos @ cos*# - sin’é||sin @ cos @ cos°8 -3 sin?o cos @ wind - 3 sing cos?6 3 sin @ cos’ - sin’@ cos °@ - 3 sin’ cos 8 Thus 25Section 2.4 cos 38 = cos’# - 3 sin’s cos 0 and 2 3 sin 3@ = 3 sin @ cos’@ - sin’#. 7. As in Solution 2 to Example 2, reflection in the line y = mx 10. 13. 16. can be achieved by reflection in the x-axis followed by a rotation counterclockwise through the angle 26 where @ is the angle from the positive x-axis counterclockwise to the line y= mx, Thus we may compute the standard matrix representation of the original reflection as _ feos 2@ -sin 20][1 0 ™ sin 20 cos 26] 10 ~1}" T Referring to the triangle above and using the double angle formulas, we see that 2 cos 2¢ = cos’# - sin’e = (4)? - (8? 2 1+a leo 1+ and sin 29 = 2 sin # cos § = 2(—%—)(—1_) ~ 22, ree figet 2+4 2 fie a on ren 2m me Since T({[x, y]) = [x + ry, y], we see that the second component is unchanged while the first (horizontal) component is increased by ry. This results in a horizontal shear, analogous to the vertical shear described in Example 6. In column vector notation, we have T( fp - [3] - [3 4 [| = [3 4 Es q [‘]. which represents a reflection in the x-axis followed by a reflection in the y-axis. FITET PETE F 26Section 2.5 19. |lvl| = fvew and ¢ = arceos( Tat fep) = arccos(—“*—) I usulvev 22. We have T,(u)-T,(v) - (4u)+(Av) = cas)? (avy = (aA?) (av) = w(aTayy = wiv = wy = (uv). SECTION 2.5 - Lines and Other Translates (Optional) Ka 1. 4, t ' "x, < Nae 10. A point on the line is (5, -1). A perpendicular vector to the line is d’ - [-2, 1], so a vector parallel to the line is d= [1, 2]. Parametric equations of the line are are x, -5+¢, x, = -1 + 2t. 1 2 13. xj: 5 - 3t=-7 46s, 364 65-12, E+ 2s = 4 xy -Lt+t-=3-258, f+ 2s=4. 27Section 2.5 16. 19. 22. 25. 28. 31. Since these two equations are the same, for every value t we can find a corresponding value s. Thus the lines contain exactly the same points ((5 - 3c, -1 +c) | c eR). (1, 3) + 312, 5] = (1,31) = C1, 3) + B13, 27 = co, 4). The point is (0, » $12, 1, 3, 4, 0) joan 2, -1, 3, -1) = int i 7 the point is 3, 3,1, 3, -4y As in Example 5, we have x= [1, 0, 0] + s({0, 1, 0] - [1, 0, 0}) + e({0, 0, 1] - [1, 0, 0]) = (1, 0, 0] + s{-1, 1, 0] + ef-1, 0, 1). Parametric equations: x, =1-s- ¢, x)= 5, x,~¢. We eliminate the parameters s and t from the equations x) 71-8, x)= 5+, x, = -s + ¢ found in Exercise 24. Subtracting the x,-equation from the x,-equation yields *) - X3— 2s. From the x, equation, s = 1 - x,, so we obtain Xp + Xz = 2(L + xy) oF 2x) + x, - xy = 2. As in Example 5, we have x= (1, 2, 1, 3) + s({4, 1, 2, 1) - (1, 2, 1, 3)) + e({3, 1, 2, 0] - (1, 2, 1, 3]) = (1, 2, 1, 3) + (3, -1, 1, -2) + e{2, -1, 1, -3). From the answer x= [0, 0, 0, 0, 2) + (2, 2, 1, 2, 1) + e)(0, 1, 2, 1, 1) + t5(0, 0, 3, 1, 0] + ,10, 0, 0, 1, 2] to Exercise 30, we obtain the parametric equations AE, Hye ep Hey, xy ey + ty + Ey, mnt et ey ee ae Using "forward substitution", we have By, cy = ky - Oxy, - 505 t ~ 2(x, + 2x) = Hex + 2x, + 3x)), 3 x3 2 4 7 Xy > 2m - (Ky - 2x) - Fox, - 2x) + 3x) 2834. Bas 40. 43. Section 2.5 re 4 3 2h Putting these values into the x,-equation, we obtain L 1 Hg = 24 my + (my ~ 2H) + 2G, Hy 1 2 = 2 3x, + BH) - GX, + Ky. Finally, we obtain 9x, - x» + 2x, - 6x, + 3x, ~ 6. 2h) B21 )- 2] em cotston seo the 0-flat x = [i]. 1-3 142 3-8 245 ~ 1 3-1 0 5] 5, o1fi 1-3 112 L 0-2 J-L ~]O 2-1 ]-1] ~ JO 2-2 }-2}. 3-7 4 0 2 -2 J-2 00 0j}0 [-1, -1, 0] is a particular solution of the system. ([2, 1, 1]} is a basis for the solution space of the corresponding homogeneous system. The solution set is the ak 2 1-flat x = |-1] + ¢/1]. 0. 1 i 2-31 ‘j-[ 2-3 - oo 4] “5 : 36-8 -2 4 1 0 0 1-5 Oo 0 1 -5 | -5, [-13, 0, -5, 0] is a particular solution of the system. {{-2, 1, 0, 0], [14, 0, 5, 1]} is a basis for the solution space of the corresponding homogeneous system. The solution -13) -2 1a ° 1 0 set is the 2-flatx=| 5] + 4%] o| +t] 5]: 0 0 1 TRFTFTFTFT 29CHAPTER 3 VECTOR SPACES SECTION 3.1 - Vector Spaces 1. 10. 13, 16. Consider Axiom $4. Now 1[2, 3] = (3, 2] » (2, 3], so this axiom is not satisfied, and we do not have a vector space. + Consider Axiom a3. If a 2 x 2 matrix A has a nonzero entry, then there is no matrix Z (for zero) such that Z} A= A, for Z } A has all entries zero by definition. Thus we do not have a vector space since Axiom A3 fails. - Consider Axiom Al. For f, g, h € F we have (£9 (g > AY) (xe) = £(x) + 2(g > h) (x) = £(x) + 2(g(x) + 2h(x)) = £(x) + 2g(x) + 4h(x) while CCE > g) > h)Gr) = (£ > g) (x) + 2h(x) = £(x) + 2g(x) + 2h(x). Since these are not generally equal (for example, when f, g, and h are all the constant function 1), we see that Axiom Al does not hold, so we do not have a vector space. We do not have a vector space since this set is not closed under addition. Note that 0 1), fo 1] _ fo 2 1 0 1 0 20 Since 0 + 0 = 0 and r0 = 0 for all r © R, we see the set is closed under scalar multiplication and Axioms A3 and A4 are satisfied. All the remaining axioms must be satisfied, since they assert the equality of two computations, and the result of any computation can only be 0, so have a vector space. The set P, is nonempty. The sum of two polynomials of degree less than or equal to n is either the zero polynomial or a Polynomial again of degree less than or equal ton, so P, is closed under addition. The same is true of a scalar multiple of a polynomial in P,. The required axioms for P, to be a vector space are well-known properties of polynomial addition and multiplication of polynomials by real nunbers. 3019. 22. 25. 28. Section 3.1 Suppose y, and y, are vectors such that v + y, = 0 and vty,= 0, Then vty vty yt ty) a9 + OH 90), ¥,+0-y¥,+ (+y), (Axioms AL and A2) yp +07, 40, 1 —Yq- (Axiom 43) Using (iv) of Theorem 3.1, we have (-r)v + rv = (-r + r)v= Ov = 0. Thus (-r)v = -(rv) by (ii) of Theorem 3.1. Similarly, using (v) of Theorem 3.1, we have r(-v) + rv = r(-v + v) = r0 = 0 so that r(-v) = -(rv). Ifx+v-=w, then (tv) -vew-y, x+(v-v)=w-y, (Axiom 41) x+0-2w-v, (axiom A4) xow-v. (axiom A3) Thus x = w - v can be the only vector x satisfying the equation x +v=w. Since (w-¥) tv=0+ (-v+v) (Axiom Al) =wtO (Axioms A2, A4) (axiom A3) -v, we see that w - v does satisfy the equation. We identify each polynomial 2 n P(x) = ay + ax tax + tax! ‘ 5 n+l in P, with the vector a= [4), a), a, "7", a,] © RU. Since polynomial addition is executed by adding coefficients of terms of like degree and vector addition in R™*) is executed by adding corresponding components, we see that if p(x) is identified with the vector a and q(x) with the vector b, then the polynomial p(x) + q(x) is identified with the vector a+b. Similarly, for every scalar r, we see that r(p(x)) is identified with the vector ra. Thus, as vector 1 + spaces, P_ and pr‘! are the same, except for the notation for the vectors. aLSection 3.2 SECTION 3.2 - Basic Concepts of Vector Spaces 1, No, the set is not closed under addition. For example, (x! + x) + (x4 41) =x +1 is not a polynomial of degree greater than 3. 4, Let W = (f © F | £(1) = 0) which is a nonempty set. If f,g €W, then (f + g)(1) = £0.) + g(1) = 0+0-0 sof+geEW. Also, (r£)(1) = r£(1) = (r)0 = 0 so rf €W. Thus W is a subspace of F. 7. a) Since 1 = sin’x + cos*x, we have o = e(sin?x) + e(cos?z) which shows that ¢ € sp(sin“x, cos”x). 2 b) Now cos 2x = cos*x - sin@x = (-1)sin2x + (1)cos2x which shows that cos 2x € sp(sin’x, cos@x). ©) Now cos 4x = cos2x - sin?2x = (1 - sin’2x) - sin?2x = 3(7) + (-2)sin?2x, which shows that cos 4x, and thus 8 cos 4x, is in sp(7, sin“2x), 10 SP(Vy) Vor v's Vy) = SPC, Bp, each v, is a linear combination of the ¥, and each w, w,) {£ and only if is a linear combination of the ve 13. Since cos*x = 1 + (-1)sin?x, the set of vectors is dependent. 16. Suppose ry (sin x) + ry (sin 2x) + r,(sin 3x) = 0. Let x= n/2i ory - Fy 20, 1 Let x= 4/6: or) #5 = 0s We solve this 1 pees 2 * a7 0. linear system. 1 0 -1)0 1 0 -1 JO 10 -1 0 12 73/2 1) 0) ~]jo Gr s32}o}~joi 0 42/2 1 2/2] 0 o 1 f2 Jo 00 2-8] 0 321g. 22. Section 3.2 We conclude that r) =r) = 33 = 0 so the set of vectors is independent. Suppose r + r)(e¥ + e%) + r,(e* - e*) = 0. Differentiating twice, we obtain the two additional equations ry(eX =e) + ry(eh +e *) = 0, xo x rile +e") + 4rA(e - € Substituting x = 0 yields the homogeneous linear system mt ary -0 ar, -0 aro =90 having the unique solution ryt ty 7 ry 0. Thus the given set of functions is independent. Since a basis for Py is (1, x, x), we know that dim(P,) =3 so the given set of four polynomials must be dependent. Inspection shows that 4 = 2(x’ +1) - 2(x - 1), so we delete 4 from the list and check the remaining vectors for independence by solving for the r, in the equation r+ rjG? +1) + 14(2e - 3) = 0. Rewriting this as = (et rye? + eget ryt ty - 3x4) = 0 and equating coefficients of x”, x, and x° to zero, we obtain the homogeneous system te -0 5 2 1 ar, = 0 ory + Fy > Gr, = 0 which has the unique solution Fryar rym 0. Therefore uc - 1, x2 +1, 2" - 3) is independent and thus is a basis for the given subspace of P. (The preceding solution was given as an illustration of the general technique for attacking such a problem. For this 33Section 3.2 problem, we could just have noted that the given subspace of P lies in P, which has dimension 3, and that the three polynomials 4, 2x - 3, and x” +1 form an independent set and thus must be a basis for all of P,, and consequently form a basis for the given subspace as well.) 25. TFTTITFFFTT 28. W, = sp({1, 0, 1], [3, 0, -1]) consists of all vectors in R° 1 3}a whose middle component is zero, since f oO i is the 1-1] 6 augmented matrix of a consistent system for all choice of a and b, The only vectors in W, = sp({1, 2, 3], [2, 1, 1]) with middle component zero are those of the form r(1, 2, 3] - 2r{2, 1, 1] - r[-3, 0, 1]. Thus a generating set for W, OW, is ([-3, 0, 1]). 2 31. Note that (v, + vp) - (vy + v3) =v) = vy, that is, wy - w) “¥3, so sp(w,, W), v3) = sp(w,, W,). To show that this is not all of V, suppose that Vy EM, + ry¥y = Ay(¥y + vy) + By(vy + v5). Then Gy > Dy, + Gy + yyy + ryvy = 0 so Fp 1-90, ry 27% and r= 0 by independence of the v,. This system is inconsistent, so tor, v1 # sp(w,, vy). 34. Let S = (wy, Mor thts Wee Wy, Uy, ve, UD. Generation: Since each v € V has the formv =w+u for w € sp(w,, “, “, wy) and u € sp(u,, Bor ttre wu), we have v © sp(S), that is, S$ generates V. Independence: Suppose that FyW, + Kow, + ++: + rw, cya + Coty tee + tuo 0. Then 3437. 40. Section 3.2 yw try) te HEM Eye, = Egy - ttn 7° since this vector is in both W and U, and thus in WU which is (0) by hypothesis. The independence of the w, then shows that each r, = 0, and the independence of the u, shows shows that each ¢, = 0. Thus S$ is also an independent set, and is a basis for V. Suppose that r,v, + rv) + “+> + F,¥,7~ 0 were a dependence relation so that some r, = 0. Let us choose such nonzero r with maximum subscript. Then r, = 0 for i > j so we can weite rv, -Fyyy 7 Fp 1 Fy jq> Dividing this equation by r,, ve can express v, a8 a linear combination of the v, for i < j, which contradicts our hypothesis, Thus the set (vj, Vy, “**) ¥,) is independent. The solution set is nonempty since it contains the zero function. Suppose that y, and y, are solutions of the given equation. Then £0007 + 7) + £0 + PY +o + CD OY, + Fy)" + LQG + FQ) OD 4 OD) 4. = £0 +) + £, OOy + ECF! YQ") + EQCOO + Fy) by, = 007, + £007, ++ fyooy,' + Foor) + eGo +, yGayfh) + + Rea! + F972) -0+0-~=0, that is, y, + y, is a solution. Also EG) +6 seocyyOh ++ + £,GO (ry)! + £900 (ry) ¢ z , = (EGO, + £, COY, + + £yQ0yy" + £y(*)¥1) = 10 = 0, so ry, is a solution. Thus the solution set is n) (dy. nonempty and closed under addition and scalar multiplication, and so is a subspace of F. 35Section 3.3 43. a) Note that sin x and cos x are independent solutions of the homogeneous equation y* + y = 0, so {a sin x + b cos x | a,b ER) is the solution set. b) Trying y = x, we find that y" + y = 0 +x =x, so that x is a particular solution. Using part (a), the solution set is (a sinx +b cos x +x | a,b €R). 46. a) Let us call (s € S | £(s) ~ 0) the support of f. Thus W is the set of functions in F with finite support. Since the support of the zero function is the empty set (a finite set), the zero function is inW. If f,g €W, then the support of f + g is contained in the union of the support of f with the support of g, for if f(x) = g(x) = 0, then (f + g)(x) = f(x) + g(x) = 0+0-=0, Since the union of finite sets is again a finite set, we see that (f£ + g).€W. The support of rf is the same as the support of £ if r «0, and is the empty set if r= 0, so rf EW. Thus W is a subspace of F. b) If W =F, then $ must be finite, for if $ is infinite then the function f: § + RB defined by f(s) ~ 1 for alls eS has the infinite support $, and thus is in F but is not in W. SECTION 3.3 - Coordinatization of Vectors oly -1 1 oy Q. x [ a | d-{ 1 ah , -1] 0 2 014 10 0; 2 10 0} 1 4 {1 0 3 ]-2)- Jo 1 0] 2) - Jo 1 of 2]; [1, 2, -1) 10 0]1 oo 3] -3} [o 0 1] -1 7. By inspection, [4, 1, -2, 1) 1-2 01 0-2 1-1 01 20). Let i Al . x [? H * lo 4 * {i | * FAL 1] Then rs = 1 MoM rg +4, = -2 1 - ry tr, = 413. 16. 19. Section 3.3 We solve this system: 1 0 O13 10 0 043 10 0 073 1-1-1 1 |-2 o1i1-1)5 0100/5 oo 1 0]fi!7 jo o 1 of 1f7~ jo 0 1 0} 2 oo3 1/4 ooo1]f1 ooo1ft Thus r, = 1, 53-1, 5) = 5, r, = 3 so the coordinate vector is (3, 5, 1, 1). (See the text answer.) Let x +x - x - 1 = bjGe #1)? + dye #1)? + Det 1+ bo. Setting x = -1, we find that 0 = by. Differentiating and setting x ~ -1, we obtain ax’ + 2x -1 = 3by(e +? + 2by(K #1) + YS O= b). Differentiating again and setting x = -1, we obtain 6x + 2 = 6b,(x + 1) + 2by; -4 = 2B), by = -2. Differentiating again, we obtain 6 = 6b,; 6, = 1. The coordinate vector is [1, -2, 0, 0]. a) Suppose r, + r)sin x + r,cos x + r,sin 2x + recos 2x - 0. We substitute the indicated values of x into this equation. x-0: rptr,tr5-0 Kom rp - 4 try 70. Subtracting, we see that 2r,~ 0, sor, = 0. Substituting = 0, while x = -1/2 yields = 0. We x= 7/2 yields r) +r) - ry 1 2° %57 0, and subtraction shows that ry are down to m = ry t+ r,sin 2x + recos ax = 0. Substituting x - 1/4 yields r, +r, = 0 while x = -2/4 yields r, - r, = 0, sor, =r, = 0, and consequently 1 17% r,~ 0 also. Thus the given set of five functions is independent. 37