20 CHAPTER 4 Linear Equations in Linear Algebra 1.1 EXERCISES Solve each system in Exercises 1—4 by using elementary row ‘operations on the equations or on the augmented matrix. Follow the systematic elimination procedure described inthis section. Aa AL dn th 4 A mde - Tx 5 Sut 7a =U }. Find the point (xy,.2) that lies onthe line xy + 53 = 7 and (onthe line x; ~ 2x3 = —2. See the figure, yo xj-2ye-2 atSnge7 4, Find the point of intersection of the lines) — x2 = 1 and 3y- Te = 5. Considereach matixin Exercises 5 and 6as the augmented matrix of & linear system, State in words the next two elementary row ‘operations that shouldbe performed in the process of solving the system. 1-4 5 0 7 o 1-3 0 6 oo fT 0 2 0 0 0 1-5 1-6 4 OHI Pena Oa a @ 1. 2 3 os Ora 6. - In Exercises ihe augmented matrix of a linear system his been reduced BY Tow operations tothe form shown. In each ease) continue the appropriate row operations and describe the solution set of the original system. fe tole ro ele opt a0 oP oo 7 0 00 1-2 1-1 0 0-4 o fo La 0-7 00 1-s-l oh os gael e naj 0 9 24 oLao« 7 lo o 1 0 6 po ois} Solve the system in Bxocned(I-185) Mathys 21 +34 + $x 2 Sut In tIn = 6 4, 2. 3a, - Ix + Ty = -8 4 t6n- = 7 2B. 4 -3n= 8 2 +24 90= 7 wat Sx 2 Moen 5 mat mt$ye2 at a0 ea Determine if the systems in Exercises 15 and 16 are consi, Do not completely solve the systems, tan = 2 sane 3 15 -Im tin tus | 3x $I =-5 3 =0 = 2 2 + 2e ut3ue 1 -2n + 3p + lan + 4 ue Do the three lines: xy —4xy = 1, 24) —2 = —3, tnd =mi—3x2=4 havo a common point of intersection? Explain. Do the three planes x1 + 2a + 3 = 4y a2 — 2) = and x1 + 3x2 = 0 have at least one common point of intrsee= tion? Explain, ee In Exercises(]9-22 eter the value(s) of & such that th igmented matrix of a consistent linear: system. mati is the ie a 1 bes va [3 6 i a [2 4 3] ae 2-3 4 afi id) 253 In Exercises 23 and 24, key statements from this section ae cither quoted directly, restated slightly (but still rue), or alte in some way that makes them false in some cuses, Mark etch staterient True or False, and ustfy your answer, (f tus, give? approximate location where a similar statement appears, or refer to adefistion o theorem. If false, give te location of a taement ‘that has been quoted or used incorrect, or eite an example thst shows the statement is not true In all eases.) Similar tue/ilse ‘questions will appear in may sections of the text,23, a, Every elementary row operation is reversible, b. AS x6 matrix has six rows, © The solution set of a linear system involving variables. is ++ 3ty is alist of numbers (5)... 5.) that makes each equation in the system a true statement when the values Siss++Sy ane substituted for x1... .4%q, respectively, 4, Two fundamental questions about a linear system involve ‘existence and uniqueness, 24, a, Elementary row operations on an augmented matrix never ‘change the solution set of the associated linea system. b, Two matrices are row equivalent if they have the same ‘number of rows, ©. An inconsistent system has more than one solution, 4, Two linear systems are equivalent if they have the same solution set. 2S Find an equation involving g, , and that makes this augmented matrix correspond to a consistent system: 1-4 7 g o 3-5 ht 205 9k 26. Construct three different augmented matrices for linear sys- tems whose solution sets x) = ~2, x3 = 1,3 = 0. 27. Suppose the system below is consistent forall possible values of f and g. What can you say about the coefficients ¢ and d? Justify your answer, xine sf ex + dy = g 28, Suppose a, b,c, and d are constants such that a is not zero ‘and the system below is consistent for all possible values of S and g. What can you say about the numbers @,b,¢,andd? Justify your answer, antim=f citdan se. In Exereise(39-32)find the elementary row operation that ra ‘forms the first matrix into the second, and then find the reverse ‘ow operation that transforms the second matrix into the fst. 4.4 Systems of Linear Equations 14 o-2 Ss} pi 4-7 wlio 4 -7}.Jo-2 5 3-1 6}'[3 -1 6 13-4] 71 3-4 wo}o-2 6},/0 1-3 o-5 9}'lo-s 9 1-201 0 1-2 1 0 ajo 5-2 s|Jo 5-2 8 4-1 3-6} LO 7-1 -6 12-5 0771 2-5 0 3m }o 1-3 -2].Jo 1 -3 -2 o-3 9 s}lo 0 o-1 ‘An important concern in the study of heat transfer is to determine the stendy-state temperature distribution of a thin plate when the temperature around the boundary is known. Assume the plate the figure represents a cross section of a metal beam, ble heat flow in the direction perpendicular to the Ty denote the temperatures at the four inte plate. Let 7}, nodes of the mesh in the figure, The temperature at a node is approximately equal to the average of the four nearest nodes— to the left, above, tothe right, and below? For instance, T= (0+20+T+T)/4. of 4% -T-T.= 30 ea 33. Write a system of four equations whose solution gives esti- _- Males for the temperatures T,..., Ts ‘3M. Solve the system of equations from Exercise 33, (Hint: To speed up the calculations, interchange rows 1 and 4 before starting “replace” operations.) * Soe Frank M, White, Hea and Mass Trunafer (Reading, MA: ‘Adklson-Wesley Publishing, 1991), pp. 145-149. SOLUTIONS TO PRACTICE PROBLEMS For “hand com; puration,” the best choice is to interchange equations 3 and 4, Another possiblity is to multiply equution 3 by 1/5. Or replace equation 4 by its sum with =| 1/5 times row 3. (In any case, do not use the x2 in equation 2 to liminate the 42 in equation 1. Wait until a triangulae form has been reached and the x3 terms and xg terms have been eliminated from the first two equations,) >. The system is in angular form. Further simplification begins with the xin the fourth equation, U: s0 the x4 to eliminate all x4 terms above it, The appropriate42 CHAPTER 4 Linear Equations in Linear Algebra Since (3.4 two equations, itis on the line of the intersection of the first wo planes. Since (3. 4,—2) does not satisfy all three equations, it does not lie on all three planes. jon 4 to equation 1. (AfRer that, move to equ, i mes equati Lede atoms uation to eliminate the x} te tion 3, multiply it by 1/2, and then use ce ea! above it.) ; 2, The system corresponding to the augmented matrix. is ay + San + 2x3 = -6 4x, —Txy = 2 Suse 0 which is certainly an allowable value for x5, A fey 1 and 2, you could go on to solve for unique and it is unique. Contrast tis situation ‘The third equation makes x3 = 0 eliminating the x3 tetms in equations | a values for xp and x). Hence a solution exists, with that in Example 3. 3. Itis easy to check iffa specific list of numbers x3 = —2, and find that isa solution. Set x1 = 3,42 = 4, ang 5G) - () 42-2) = 15= 4= 457 -2(3) + 6(4) + 9-2) = -6 +24 -18=0 =1(3) + (4), = 1-2) = 21+ 20+ 6 =5 Although the first uvo equations are satisfied, the third is not, so (3,4, ~2) is nota solution of the system. Notice the use of parentheses when making the substitutions, They are strongly recommended as'a guard against arithmetic errors. 4. When the second equation is replaced by its sum with 3 times the first equation, the system becomes 2x =h k+3h 0 If k + 3h is nonzero, the system has no solution. The system is consistent for any values of h and & that make k + 3/1 = 0. 1.2 | ROW REDUCTION AND ECHELON FORMS ul set refines the method of Section 1.1 into a row reduction algorithm that will ane nh System of near equations! By using only the frst part of a full be able to answer tu i i auestions posed in Seotign ‘er the fundamental existence and uniqueness ie ; Ae cs slot spp ‘o any matrix, Whether or not the matrix is viewed as an & Tineat system, So the first part of this section concerns an arbi- trary rectangular matrix and begin: : eins by ing wail i include the “triangular” ‘Bins by introduicing two important classes of matrices that Fow or column in matr cnt; a leading entry of See aa jn Wester culture wile nineteenth century, 0 smaticiun, Cust Friedrich Gauss a when a f a ele ima spous German mathematician, Curl Friedrich Gauss discovered it, A German e incr, Wilhelm Jordan, popularized the agri avin an 1888 text on geod4.2. Row Reduction and Echelon Forms 43 it has the DEFINITION A réctangulr matrix is in echelon form (or row echelon form) if has following three properties: | 1, All nonzero rows are above any rows of all zer08. i f 2, Each leading entry of a row is in a column to the right of the leading entry 0! the row above it, 3. Allentries ina column below a leading entry are zeros. i If a matrix in echelon form satisties the following additional conditions, then itis in reduced echelon form (or reduced row echelon form): 4, The leading entry in each nonzero row is 1. 8. Bach leading 1 is the only nonzero entry in its column. Anechelon matrix (respectively, reduced echelon matrix) is one that is in echelon form (respectively, reduced echelon form). Property 2 says that the leading entries form aan echelon (“steplike”) pattern that moves down and (o the right through the matrix. Property 3 is a simple consequence of property 2, but we include it for emphasis. The “triangular” matrices of Section 1.1, such as. 2 cBinaBey i bo Ge 0 1-48} and fo 1 0 16 0 0 “Dyate co | are in echelon form. In fact, the second matrix is in reduced echelon form. Here are EXAMPLE 4 The following matrices are in echelon form. The leading entries (a may have any nonzero value; the starred entries (*) may have any value (including zero). is On e © 8 ek 8 oe \ OOO me Oe kk Ones Porc em SM | hid oaet ft) 0000 Oi Mi BoP 8 mie e + s 0 0 000000 8 ¢ The following matrices are in reduced echelon form because the leading entries are 1's, and there are 0°s below and above each leading 1 ocee eoto coke cone ecoce cooce ecco ecoro covoce erocoo oxen Hoooo Any nonzero matrix may be row reduced (that is, transformed by elementary row operations) into more than one matrix i echelon form, using different sequences of row ‘operations. However, the reduced echelon form one obtains from a matrix is unique. The following theorem is proved in Appendix A at the end of the text. THEOREM 1 Uniqueness of the Reduced Echelon Form Each matrix is row equivalent to one and only one reduced echelon matrix.44 CHAPTER 4 Linear Equations in Linear Algebra trix is row equivalent to an echelon matrix U, we call U an echelon (or oe as form) of I isin reduced echelon form, we call U the reduet echelon form of 4. [Most mauix programs and calculators with matrix capeit use the abbreviation RREF for rediced (row) echelon form. Sorte use REF fr (ye echelon form.] Pivot Positions f elon form, further row operations When row operations on a matrix produce an echelon | OW Operations tp obiain the reduced echelon form do not change the positions of the leading ents, Sing the reduced echelon form is unique, the leading entries are always in the same position, {in any echelon form obtained from a given matrix. These leading entries correspond ys Teading 1's in the reduced echelon form. i ition i ix A is a location i ds to a leading | DEFINITION A pivot position in a matrix A is a location in A that correspon 1g dtc reduced echelon form of A. A pivot column is a column of A that contains a pivot posit In Example 1, the squares (a) identify the pivot positions. Many fundamiental con. cepts in the first four chapters will be connected in one way or another with pivot positions in a matrix. EXAMPLE 2 Row reduce the matrix A below to echelon form, and locate the pivot columns of A. 0-3-6 4 9 Ae SE 3" 1 se ea een 14 5-9-9 SOLUTION Use the same basic strategy as in Section 1.1. The top of the leftmost sero column isthe first pivot postion. A nonzero entry, or pivor, must be placed in this position. A good choice is to interchange rows 1 and 4 (because the mental computations in the next step will not involve fractions) e Pivot, 1, by adding multiples ofthe first row to the rows below, and obtain matrix (1) below. Th: low. second row must be as far left as Possible—namely, in the second column. Choose the 2 in this position as the next pivot. Pivot yas be G2 oe Le 0 5 10 ~15 ~15 . @ 0-3-6 4 9 L next piver columnOS ecco sand Echelon Forms 4° 12 Row Reduction e ow 4. Ad 5/2 net ow 21 3a 3/2 es 228 5-9 =i Laat @ 0000 0 0 0 0-5 0 ; ere is no way 10 ‘The matrix in (2) is diferent from any encountered in Section Sodas ing a0 would create a leading entry in column 3! (We can't use row | ee a However It destroy the echelon arrangement of the leading entries already Pt i 4, we interchange rows 3 and 4, we can produce a leading entry 18 column Pivot 1 4S P 0 2 4-6/6 f 0 0 0 ase 0 | Genel form 000 0 0 tt + _ pivot columns. ivot ‘The matrix isin echelon form and thus reveals that columns 1,2, and 4 of 4 are columns. coor cone core ones Pivot positions 0-3 [-6 4 <1 2-1 3 8 2-3 0 3 1.4. 5-9 tit + pivot colurans . A pivot, as illustrated in Example 2, is a nonzero number in a pivot position that is used as needed to create zeros via row operations. The pivots in Example 2 were 1, 2, +4 =5. Notice that these numbers are not the same as the actual elements of 4 in the ‘nea pivot positions shown in (3) ith Example 2 as a guide, we are ready to describe an efficient procedure for transforming a matrix into-an echelon or reduced echelon matrix. Careful study and mastery of this procedure now will pay rich dividends later in the course. The Row Reduction Algorithm ‘The algorithm that follows consists of four steps, and it produces a matrix in echelon form. A fifth step produces a matrix in reduced echelon form, We illustrate the algorithm by an example, EXAMPLE 3 Apply clementary row operations to transform the following matrix first into echelon form and then into reduced echelon form: 0 3-66 4 -5 3-7 8-5 8 9 "13-9 12-9 6 15 Begin with the leftmost nonzero column. This is a pivot column. The pivot nis at the top. SOLUTION STEP 4