Linear Algebra with Applications, 8th Ed. Steven J.

Leon
The following pages include all the items of errata that have been uncovered so far. In each case we include the entire page containing the errata and indicate the correction to be made. Help in uncovering additional errata would be greatly appreciated. Please send any errata you discover to [email protected] Corrections will be made in later printings of the book.

Chapter 1 Matrices and Systems of Equations

Therefore, any solution of system (b) must also be a solution of system (a). By a similar argument, it can be shown that any solution of (a) is also a solution of (b). This can be done by subtracting the rst equation from the second: = 3 x2 3x1 + 2x2 x3 = 2 3x1 x2 + x3 = 5 Then add the rst and third equations: 33x1 + 2x2 x3 = 2 2x3 = 4 3x1 + 2x2 + x3 = 2 Thus, (x1 , x2 , x3 ) is a solution of system (b) if and only if it is a solution of system (a). Therefore, both systems have the same solution set, {(2, 3, 2)}.

Denition

Two systems of equations involving the same variables are said to be equivalent if they have the same solution set. Clearly, if we interchange the order in which two equations of a system are written, this will have no effect on the solution set. The reordered system will be equivalent to the original system. For example, the systems x1 + 2x2 = 4 3x1 x2 = 2 4x1 + x2 = 6 and 4x1 + x2 = 6 3x1 x2 = 2 x1 + 2x2 = 4

both involve the same three equations and, consequently, they must have the same solution set. If one equation of a system is multiplied through by a nonzero real number, this will have no effect on the solution set, and the new system will be equivalent to the original system. For example, the systems x1 + x2 + x3 = 3 2x1 x2 + 4x3 = 1 and 2x1 + 2x2 + 2x3 = 6 2x1 x2 + 4x3 = 1

are equivalent. If a multiple of one equation is added to another equation, the new system will be equivalent to the original system. This follows since the n-tuple (x1 , . . . , xn ) will satisfy the two equations ai1 x1 + + ain xn = bi a j1 x1 + + a jn xn = b j if and only if it satises the equations ai1 x1 + + ain xn = bi (a j1 + ai1 )x1 + + (a jn + ain )xn = b j + bi

Leon:

Linear Algebra with Applications 8/E 6/22/07 10:42 Page 4

Chapter 1 Matrices and Systems of Equations

Returning to the example, we nd that the rst row is used to eliminate the elements in the rst column of the remaining rows. We refer to the rst row as the pivotal row. For emphasis, the entries in the pivotal row are all in bold type and the entire row is color shaded. The rst nonzero entry in the pivotal row is called the pivot. (pivot a11 = 1) 2 1 3 pivotal row 1 3 1 3 1 entries to be eliminated a21 = 3 and a31 = 2 4 2 3 1 By using row operation III, 3 times the rst row is subtracted from the second row and 2 times the rst row is subtracted from the third. When this is done, we end up with the matrix 2 1 3 1 0 7 6 10 pivotal row 0 1 1 2 At this step we choose the second row as our new pivotal row and apply row operation III to eliminate the last element in the second column. This time, the pivot is 7 and the quotient 1 = 1 is the multiple of the pivotal row that is subtracted from the 7 7 third row. We end up with the matrix 2 1 3 1 0 7 6 10 1 4 0 0 7 7 This is the augmented matrix for the strictly triangular system, which is equivalent to the original system. The solution of the system is easily obtained by back substitution.

EXAMPLE 4 Solve the system

Solution
The augmented matrix for this system is 1 0 0 1 1 1 1 1 1 6 2 4 1 2 1 3 3 1 2 2 Since it is not possible to eliminate any entries by using 0 as a pivot element, we will use row operation I to interchange the rst two rows of the augmented matrix. The new rst row will be the pivotal row and the pivot element will be 1: (pivot a11 = 1) 1 1 1 1 6 pivot row 1 0 0 1 1 2 4 1 2 1 3 3 1 2 2

Leon:

Linear Algebra with Applications 8/E 6/22/07 10:42 Page 8

82

Chapter 1 Matrices and Systems of Equations

then

4 AB = 7

5 10

and

11 BA = 4

7 3

7. If A and B are n n matrices, then (A B)2 = A2 2AB + B 2 . 8. If AB = AC and A = O (the zero matrix), then B = C. 9. If AB = O, then B A = O. 10. If A is a 3 3 matrix and a1 + 2a2 a3 = 0, then A must be singular. 11. If A is a 4 3 matrix and b = a1 + a3 , then the system Ax = b must be consistent. 12. Let A be a 4 3 matrix with a2 = a3 . If b = a1 + a2 + a3 , then the system Ax = b will have innitely many solutions. 13. If E is an elementary matrix, then E T is also an elementary matrix. 14. The product of two elementary matrices is an elementary matrix. 15. If x and y are nonzero vectors in Rn and A = xyT , then the row echelon form of A will have exactly one nonzero row.

This proves that statement (ii) is false. reduced 1. If the row echelon form of A involves free variables, then the system Ax = b will have innitely many solutions. 2. Every homogeneous linear system is consistent. 3. An n n matrix A is nonsingular if and only if the reduced row echelon form of A is I (the identity matrix). 4. If A is nonsingular, then A can be factored into a product of elementary matrices. 5. If A and B are nonsingular n n matrices, then A + B is also nonsingular and (A + B)1 = A1 + B 1 . 6. If A = A1 , then A must be equal to either I or I .

CHAPTER TEST B
1. Find all solutions of the linear system x1 x2 + 3x3 + 2x4 = 1 x1 + x2 2x3 + x4 = 2 2x1 2x2 + 7x3 + 7x4 = 1 2. (a) A linear equation in two unknowns corresponds to a line in the plane. Give a similar geometric interpretation of a linear equation in three unknowns. (b) Given a linear system consisting of two equations in three unknowns, what is the possible number of solutions? Give a geometric explanation of your answer. (c) Given a homogeneous linear system consisting of two equations in three unknowns, how many solutions will it have? Explain. 3. Let Ax = b be a system of n linear equations in n unknowns, and suppose that x1 and x2 are both solutions and x1 = x2 . (a) How many solutions will the system have? Explain. (b) Is the matrix A nonsingular? Explain. 4. Let A be a matrix of the form A= 2 2 where and are xed scalars not both equal to 0. (a) Explain why the system 3 Ax = 1 must be inconsistent. (b) How can one choose a nonzero vector b so that the system Ax = b will be consistent? Explain. 5. Let 2 1 3 2 1 3 A = 4 2 7 B = 1 3 5 4 2 7 1 3 5 0 1 3 C = 0 2 7 5 3 5 (a) Find an elementary matrix E such that E A = B. (b) Find an elementary matrix F such that AF = C. 6. Let A be a 3 3 matrix and let b = 3a1 + a2 + 4a3 Will the system Ax = b be consistent? Explain.

Leon:

Linear Algebra with Applications 8/E 6/22/07 10:42 Page 82

6.4 Hermitian Matrices

335

2. Let 1+i 2 z1 = 1i 2 i 2 z2 = 1 2

and

(a) Show that {z1 , z2 } is an orthonormal set in C2 . 2 + 4i as a linear (b) Write the vector z = 2i combination of z1 and z2 . 3. Let {u1 , u2 } be an orthonormal basis for C2 , and let z = (4 + 2i)u1 + (6 5i)u2 . H H (a) What are the values of u1 z, z H u1 , u2 z, and H z u2 ? (b) Determine the value of z . 4. Which of the matrices that follow are Hermitian? Normal? 2i 1 1 i 2 (b) (a) 2+i 1 2 3 1 1 2 2 (c) 1 1 2 2 1 1 i 2 2 (d) 1 1 i 2 2 i 1 0 i 0 2 + i (e) 1 2 + i 0 1+i i 3 1 i 1 3 (f) i 3 1 5. Find an orthogonal or unitary diagonalizing matrix for each of the following: 3+i 1 2 1 (b) (a) 3i 4 1 2 1 1 2 2 i 0 1 i 2 0 3 2 (d) (c) 1 2 3 0 0 2 0 0 1 1 1 1 1 1 1 0 1 0 (f) (e) 1 1 1 1 0 0 2 2 4 2 1 1 (g) 2 1 1

6. Show that the diagonal entries of a Hermitian matrix must be real. 7. Let A be a Hermitian matrix and let x be a vector in Cn . Show that if c = xAx H , then c is real. 8. Let A be a Hermitian matrix and let B = i A. Show that B is skew Hermitian. 9. Let A and C be matrices in Cmn and let B Cnr . Prove each of the following rules: (a) (A H ) H = A (b) ( A + C) H = A H + C H (c) (AB) H = B HA H 10. Let A and B be Hermitian matrices. Answer true or false for each of the statements that follow. In each case, explain or prove your answer. (a) The eigenvalues of AB are all real. (b) The eigenvalues of AB A are all real. 11. Show that z, w = w H z denes an inner product on Cn . 12. Let x, y, and z be vectors in Cn and let and be complex scalars. Show that z, x + y = z, x + z, y 13. Let {u1 , . . . , un } be an orthonormal basis for a complex inner product space V , and let z = a1 u1 + a2 u2 + + an un w = b1 u1 + b2 u2 + + bn un Show that z, w =
i=1 n

bi ai 0 i 1

14. Given that

4 A = 0 0

0 1 i

15.

16.

17.

18.

nd a matrix B such that B H B = A. Let U be a unitary matrix. Prove that (a) U is normal. (b) U x = x for all x Cn . (c) if is an eigenvalue of U , then || = 1. Let u be a unit vector in Cn and dene U = I 2uu H . Show that U is both unitary and Hermitian and, consequently, is its own inverse. Show that if a matrix U is both unitary and Hermitian, then any eigenvalue of U must equal either 1 or 1. Let A be a 2 2 matrix with Schur decomposition U T U H and suppose that t12 = 0. Show that

Leon:

Linear Algebra with Applications 8/E 7/15/07 15:02 Page 54

7.4 Matrix Norms and Condition Numbers

415

11. Let A = wyT , where w Rm and y Rn . Show that Ax 2 y 2 w 2 for all x = 0 in Rn . (a) x 2 (b) 12. Let A
2

= y

20. Let A be an m n matrix. The 1,2-norm of A is given by Ax 2 A 1,2 = max x=0 x 1 (See Exercise 19.) Show that A
1,2

3 A = 1 4

1 2 1

2 7 4

= max ( a1 2 , a2 2 , . . . , an 2 )

(a) Determine A . (b) Find a vector x whose coordinates are each 1 such that Ax = A . (Note that x = 1, so A = Ax / x .) 13. Theorem 7.4.2 states that
n

= max

1im

|ai j |
j=1

Prove this in two steps. (a) Show rst that

max

1im

|ai j |
j=1

(b) Construct a vector x whose coordinates are each 1 such that Ax = Ax x

21. Let A be an m n matrix. Show that A 1,2 A 2 22. Let A be an m n matrix and let B Rnr . Show that (a) Ax A 1,2 x 1 for all x in Rn . (b) AB 1,2 A 2 B 1,2 23. Let A be an n n matrix and let M be a matrix norm that is compatible with some vector norm on Rn . Show that if is an eigenvalue of A, then || A M . 24. Use the result from Exercise 23 to show that if is an eigenvalue of a stochastic matrix, then || 1. 25. Sudoku is a popular puzzle involving matrices. In this puzzle, one is given some of the entries of a 9 9 matrix A and asked to ll in the missing entries. The matrix A has block structure A11 A12 A13 A = A21 A22 A23 A31 A32 A33 where each submatrix Ai j is 3 3. The rules of the puzzle are that each row, each column, and each of the submatrices of A must be made up of all of the integers 1 through 9. We will refer to such a matrix as a sudoku matrix. Show that if A is a sudoku matrix, then = 45 is its dominant eigenvalue. 26. Let Ai j be a submatrix of a sudoku matrix A (see Exercise 25). Show that if is an eigenvalue of Ai j , then || 22. 27. Let A be an n n matrix and x Rn . Prove: (a) Ax n 1/2 A 2 x (b) Ax 2 n 1/2 A x 2 (c) n 1/2 A 2 A n 1/2 A 2 28. Let A be a symmetric n n matrix with eigenvalues 1 , . . . , n and orthonormal eigenvectors u1 , . . . , un . Let x Rn and let ci = uiT x for i = 1, 2, . . . , n. Show that
n

= max

1im

|ai j |
j=1

14. Show that A F = A T F . 15. Let A be a symmetric n n matrix. Show that A = A 1. 16. Let A be a 5 4 matrix with singular values 1 = 5, 2 = 3, and 3 = 4 = 1. Determine the values of A 2 and A F . 17. Let A be an m n matrix. (a) Show that A 2 A F . (b) Under what circumstances will A 2 = A F ? 18. Let denote the family of vector norms and let M be a subordinate matrix norm. Show that A
M

= max Ax
x =1

19. Let A be an m n matrix and let v and w be vector norms on Rn and Rm , respectively. Show that Ax w A v,w = max x=0 x v mn denes a matrix norm on R .

(a)

Ax

2 2

=
i=1

(i ci )2

(b) If x = 0, then
1in

min |i |

Ax 2 max |i | 1in x 2

Leon:

Linear Algebra with Applications 8/E 7/15/07 16:25 Page 30

474

Answers to Selected Exercises

5. (a) det(A) = 0, so A is singular. 2 1 1 2 4 2 and (b) adj A = 1 2 1 0 0 0 A adj A = 0 0 0 0 0 0 9. (a) det(adj(A)) = 8 and det(A) = 2 0 0 0 1 0 4 1 1 (b) A = 0 6 2 2 0 1 0 1 14. D O YOUR H OMEWORK .
CHAPTER TEST A 1. True 2. False 3. False 4. True 5. False 6. True 7. True 8. True 9. False 10. True

3.3

Chapter 3
3.1

1. (a) x1 = 10, x2 = 17 (b) x3 = 13 < x1 + x2 2. (a) x1 = 5, x2 = 3 5 (b) x3 = 4 5 = x1 + x2 7. If x + y = x for all x in the vector space, then 0 = 0 + y = y. 8. If x + y = x + z, then x + (x + y) = x + (x + z) and the conclusion follows from axioms 1, 2, 3, and 4. V is not a vector space. Axiom 6 does not hold. (a) and (c) are subspaces; (b), (d), and (e) are not. (b) and (c) are subspaces; (a) and (d) are not. (a), (c), (e), and (f) are subspaces; (b), (d), and (g) are not. (a) {(0, 0)T } (b) Span((2, 1, 0, 0)T , (3, 0, 1, 0)T ) (c) Span((1, 1, 1)T ) (d) (1, 1, 0, 0)T , Span((5, 0, 3, 1)T ) Only the set in part (c) is a subspace of P4 . (a), (b), and (d) are subspaces. (a), (c), and (e) are spanning sets. (a) and (b) are spanning sets. (b) and (c)

3.4

11.

3.2

1. 2. 3. 4.

3.5

5. 6. 11. 12. 16.

1. (a) and (e) are linearly independent (b), (c), and (d) are linearly dependent. 2. (a) and (e) are linearly independent (b), (c), and (d) are not. 3. (a) and (b) are all of 3-space (c) a plane through (0, 0, 0) (d) a line through (0, 0, 0) (e) a plane through (0, 0, 0) 4. (a) linearly independent (b) linearly independent (c) linearly dependent 8. (a) and (b) are linearly dependent while (c) and (d) are linearly independent. 11. When is an odd multiple of /2. If the graph of y = cos x is shifted to the left or right by an odd multiple of /2, we obtain the graph of either sin x or sin x. 1. Only in parts (a) and (e) do they form a basis. 2. Only in part (a) do they form a basis. 3. (c) 2 4. 1 5. (c) 2 (d) a plane through (0, 0, 0) in 3-space 6. (b) {(1, 1, 1)T }, dimension 1 (c) {(1, 0, 1)T , (0, 1, 1)T }, dimension 2 7. {(1, 1, 0, 0)T , (1, 1, 1, 0)T , (0, 2, 0, 1)T } 11. {x 2 + 2, x + 3} 12. (a) {E 11 , E 22 } (c) {E 11 , E 21 , E 22 } (e) {E 12 , E 21 , E 22 } (f) {E 11 , E 22 , E 21 + E 12 } 13. 2 14. (a) 3 (b) 3 (c) 2 (d) 2 15. (a) {x, x 2 } (b) {x 1, (x 1)2 } (c) {x(x 1)} 1 1 (b) 1 2 1. (a) 2 5 1 1 0 1 (c) 1 0 1 1 2 2 (b) 5 2 2. (a) 1 1 2 1 2 2 0 1 (c) 1 0 7 5 2 2 (b) 11 14 3. (a) 1 4 5 1 2 2

Leon:

Linear Algebra with Applications 8/E 7/2/07 06:43 Page 1