Matrix Mathematics. Errata and Addenda for the Second Edition. Dennis S. Bernstein February 13, 2014

Similar documents
CHARACTERIZATIONS. is pd/psd. Possible for all pd/psd matrices! Generating a pd/psd matrix: Choose any B Mn, then

Lecture Notes in Linear Algebra

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.

Chapter SSM: Linear Algebra Section Fails to be invertible; since det = 6 6 = Invertible; since det = = 2.

Linear Algebra: Lecture notes from Kolman and Hill 9th edition.

1 Linear Algebra Problems

Elementary linear algebra

Instructions. 2. Four possible answers are provided for each question and only one of these is correct.

CP3 REVISION LECTURES VECTORS AND MATRICES Lecture 1. Prof. N. Harnew University of Oxford TT 2013

Math 489AB Exercises for Chapter 2 Fall Section 2.3

Matrix Algebra. Matrix Algebra. Chapter 8 - S&B

Matrices. Chapter What is a Matrix? We review the basic matrix operations. An array of numbers a a 1n A = a m1...

Throughout these notes we assume V, W are finite dimensional inner product spaces over C.

OHSx XM511 Linear Algebra: Solutions to Online True/False Exercises

Recall the convention that, for us, all vectors are column vectors.

MIT Final Exam Solutions, Spring 2017

HOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION)

Math 407: Linear Optimization

MATH 369 Linear Algebra

Some properties of index of Lie algebras

Exercise Sheet 1.

Linear Algebra: Matrix Eigenvalue Problems

Math 408 Advanced Linear Algebra

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2

Computational math: Assignment 1

GENERALIZED MATRIX MULTIPLICATION AND ITS SOME APPLICATION. 1. Introduction

Symmetric and anti symmetric matrices

18.06 Problem Set 8 - Solutions Due Wednesday, 14 November 2007 at 4 pm in

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2

2. Linear algebra. matrices and vectors. linear equations. range and nullspace of matrices. function of vectors, gradient and Hessian

Matrix Completion Problems for Pairs of Related Classes of Matrices

NOTES on LINEAR ALGEBRA 1

CHAPTER 2 -idempotent matrices

NOTES ON LINEAR ALGEBRA. 1. Determinants

18.06 Problem Set 8 Solution Due Wednesday, 22 April 2009 at 4 pm in Total: 160 points.

MAT Linear Algebra Collection of sample exams

2 Constructions of manifolds. (Solutions)

Spectral inequalities and equalities involving products of matrices

Math 320, spring 2011 before the first midterm

Eigenvalues, Eigenvectors. Eigenvalues and eigenvector will be fundamentally related to the nature of the solutions of state space systems.

ANSWERS (5 points) Let A be a 2 2 matrix such that A =. Compute A. 2

Optimization problems on the rank and inertia of the Hermitian matrix expression A BX (BX) with applications

Problem Set (T) If A is an m n matrix, B is an n p matrix and D is a p s matrix, then show

Errata to Introduction to Lie Algebras

Massachusetts Institute of Technology Department of Economics Statistics. Lecture Notes on Matrix Algebra

Quantum Computing Lecture 2. Review of Linear Algebra

1 Matrices and vector spaces

Lecture notes: Applied linear algebra Part 1. Version 2

Homework 1 Elena Davidson (B) (C) (D) (E) (F) (G) (H) (I)

0.1 Rational Canonical Forms

1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det

OCR Maths FP1. Topic Questions from Papers. Matrices. Answers

Part IA. Vectors and Matrices. Year

Mathematical Methods wk 2: Linear Operators

Solution to Homework 1

Linear Algebra. Workbook

Math 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination

LINEAR ALGEBRA WITH APPLICATIONS

Inequalities in Hilbert Spaces

MATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018

Math 240 Calculus III

MATRICES AND MATRIX OPERATIONS

Lecture 2 - Unconstrained Optimization Definition[Global Minimum and Maximum]Let f : S R be defined on a set S R n. Then

MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.

Page 21, Exercise 6 should read: bysetting up a one-to-one correspondence between the set Z = {..., 3, 2, 1, 0, 1, 2, 3,...} and the set N.

Mathematical Foundations

Symmetric and self-adjoint matrices

APPENDIX: MATHEMATICAL INDUCTION AND OTHER FORMS OF PROOF

Mathematics. EC / EE / IN / ME / CE. for


SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear Algebra

Assignment 11 (C + C ) = (C + C ) = (C + C) i(c C ) ] = i(c C) (AB) = (AB) = B A = BA 0 = [A, B] = [A, B] = (AB BA) = (AB) AB

Math 489AB Exercises for Chapter 1 Fall Section 1.0

Extra Problems for Math 2050 Linear Algebra I

Lectures on Linear Algebra for IT

Matrix Theory. A.Holst, V.Ufnarovski

Math Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88

ECON 4117/5111 Mathematical Economics

SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear Algebra

MATH36001 Generalized Inverses and the SVD 2015

Notes on Linear Algebra

Errata and Updates for ASM Exam LTAM (First Edition Second Printing) Sorted by Page

Errata and Updates for ASM Exam LTAM (First Edition Second Printing) Sorted by Date

STAT200C: Review of Linear Algebra

The Maximum Dimension of a Subspace of Nilpotent Matrices of Index 2

Review for Exam Find all a for which the following linear system has no solutions, one solution, and infinitely many solutions.

Numerical Linear Algebra Homework Assignment - Week 2

ELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS. 1. Linear Equations and Matrices

G1110 & 852G1 Numerical Linear Algebra

Appendix A: Matrices

Digital Workbook for GRA 6035 Mathematics

This MUST hold matrix multiplication satisfies the distributive property.

First selection test

Linear Algebra. Christos Michalopoulos. September 24, NTU, Department of Economics

GROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION

Math 10 - Unit 5 Final Review - Polynomials

Chapter 7. Linear Algebra: Matrices, Vectors,

Nonlinear Optimization

Knowledge Discovery and Data Mining 1 (VO) ( )

CHAPTER 8: Matrices and Determinants

Transcription:

Matrix Mathematics Errata and Addenda for the Second Edition Dennis S. Bernstein dsbaero@umich.edu February 13, 2014 This document contains an updated list of errata for the second edition of Matrix Mathematics. Please email me if you discover additional errors, and I will include them in future updates. 1. Page 3, line 20: Replace and with and, respectively. 2. Page 13, Fact 1.7.12, statement i): Delete f 1 [f(a)]. 3. Page 24, Fact 1.10.6: Append ) to the left hand side of the inequality, and ] to the right hand side of the inequality. 4. Page 46, Fact 1.13.10: In the inequality below In particular, multiply the right hand side by 27. 5. Page 49, Proof of Fact 1.13.21: Replace obtuse with isosceles. 6. Page 51, Fact 1.14.5: Replace (y 2 + z 2 ) 2 with (y 2 z 2 ) 2. 7. Page 55, Fact 1.17.11: Replace complex with real. 8. Page 61, Fact 1.17.32: For r = 0, define M r by ( n i=1 xα i i ) 1/n. 9. Page 67, Fact 1.18.5: Delete the statement beginning with Now, and the following statement. 10. Page 68, Fact 1.18.9: Replace the last sentence with: Furthermore, equality holds if and only if there exists α 0 such that either [x 1 x n ] = α[y 1 y n ] or [y 1 y n ] = α[x 1 x n ].. 11. Page 75, Fact 1.20.1: In statements xix) and xx) change (Re z) 2 to 2(Re z) 2. 12. Page 76, Fact 1.20.2: In xxiii), change to =. 13. Page 83, Fact 1.21.2, statement xxviii): Replace tan 1 xy x+y 1 xy with tan 1 1 xy. 14. Page 105, Fact 2.5.6: Replace F n m with F n n. 15. Page 106, Proof of Proposition 2.5.9: Change the second to =. 1

16. Page 110, line -2: Change F m to F n. 17. Page 123, Fact 2.9.27: In statement i), require S F m. 18. Page 124, Fact 2.9.30: In statement i), delete f 1 [f(s)]. 19. Page 126, Fact 2.10.14, statement iii): Replace N(A ) R(B ) with N(B ) R(A ). 20. Page 128, Fact 2.10.24: For the two equalities, assume that both x and y are nonzero. 21. Page 131, Fact 2.11.4: In iv) replace the first = with = {0} and. 22. Page 137, Fact 2.12.8: In ii) change R to rank. 23. Page 138, Fact 2.12.18: In the definition of C replace (A T + yx T ) k y with (A T + yx T ) k 1 y. 24. Page 155, Fact 2.16.6: Replace 1 T 1 n AA 1 with 1 1 n A A 1 n 1. 25. Page 166, line 6: Replace nonsingular. Then, with nonsingular, then 26. Page 170, Fact 2.20.11: Replace 18R 2 a 2 + b 2 + c 2 with 18rR a 2 + b 2 + c 2. 27. Page 172, Fact 2.20.13, lines 6 and 12: Replace ac + bc with ac + bd. 28. Page 175, Fact 2.20.21, line 2: Replace [x y z] with det [x y z]. 29. Page 185, Section 3.3, line 2: Replace Section 11.5 with Section 11.6. 30. Page 193, Fact 3.7.7: Change Let A R n n. to Let A R n n, and assume that A is symmetric.. 31. Page 193, Fact 3.7.9: In v) and vi), change if and only if to only if. 32. Page 194, Fact 3.7.11: Assume that A is skew-hermitian. 33. Pages 197 and 198, Fact 3.7.28 and Fact 3.7.29: Change then ˆB and Ĉ are given by to then B and C are given by. 34. Page 203, Fact 3.10.1: In xliii) replace (x T x) 1 with (x T x) 1. 35. Page 215, Fact 3.12.2: Replace only if with only if A is semisimple and. 36. Page 227, Fact 3.13.19: In statement iii) replace = with. 37. Page 227, Fact 3.13.20: The solution to the problem is yes. 38. Page 231, Fact 3.16.5: Change p. 114 to p. 215. 39. Page 236, Fact 3.18.10: Delete Toeplitz. 40. Page 237, Fact 3.19.1: In statement ii), change A to A 1. 41. Page 248: Replace c 2 + c 2 with c 2 + d 2. 42. Page 272, line -4: Change n = 1 to i = 1. 43. Page 276, Fact 4.8.2, line -5: Change β 3 to β n 3. 2

44. Page 276, Fact 4.8.2, line -2: Change Fact 1.17.11 to Fact 1.17.10. 45. Page 300, Fact 4.11.5: Change perturbation to permutation twice. 46. Page 304, line 8: Replace L k+1 L k with lim k L k+1 L k. 47. Page 306, Fact 4.11.19: Change [174, p. 27] to [186, p. 27]. 48. Page 306, Fact 4.11.22: Change x > 0 and y > 0 to x >> 0 and y >> 0. 49. Page 320, proof of Proposition 5.4.6: Replace S by Ŝ, diag(b 1, 0, B 2 ) by diag( B 1, 0, B 2 ), I ν (A) by I ν (A), and I ν+ (A) by I ν+ (A). 50. Page 328, replace (5.6.9) by: {σ 1,..., σ n } ms = { λ 1 (A),..., λ n (A) } ms. 51. Page 333, Proposition 5.7.4: Change hold to are equivalent. 52. Page 337, Fact 5.8.18: Delete, and assume that S is nonsingular. 53. Page 338, Fact 5.9.2: Change min { a, b } to a 2 + b 2. 54. Page 342, Fact 5.9.26: Change mspec(i n ) = mspec(i n ) to mspec(în) = mspec(în). 55. Page 342, Fact 5.9.27: Change the (1,2) block of S to I. 56. Page 342, Fact 5.9.30: Change F n m to F n n. 57. Page 347, Fact 5.10.13: Change an orthogonal matrix to a projector. 58. Page 355, Fact 5.11.24: Delete the last sentence. 59. Page 355, Fact 5.11.25: Delete the left-hand inequalities in the first two strings. 60. Page 365, Fact 5.12.13: Assume B F m m and replace σ i (B) by σ 2 i (B) 61. Page 394, Fact 5.18.8: Can omit assume that A is nonsingular 62. Page 399, Fact 6.1.6: In xxx), change orthogonal to unitary. 63. Page 404, Fact 6.3.6: Change Let A F n m to Let n 2, let A F n n. 64. Page 411, Fact 6.3.33: Change (A I) = (A I) + to (A I) # = (A I) +. 65. Page 412, Fact 6.4.2: Change Finally, to Finally, assume that A does not have full rank. Then,. 66. Page 419, Fact 6.4.38: Change A B to AB. 67. Page 423, Fact 6.5.5: Change and assume to and assume that A is Hermitian and. 68. Page 424, Fact 6.5.8: Change rank(d B A + B) to rank(c B A + B). 69. Page 431, Fact 6.6.3: Delete AB = 0. 70. Page 435, Fact 6.6.13: Change BA is nonsingular to CB is nonsingular. 71. Page 452, Fact 7.5.13: Change A, D to A, C and change C, B to B, D 72. Page 452, Fact 7.5.17: Change A (k) B (k) to A (n) B (n). 3

73. Page 456, Fact 7.6.11: Change x 1,..., x n R n to x 1,..., x n R. 74. Page 463, Proposition 8.2.7: In v) change β 0,..., β n 1 0 to ( 1) n i β i 0. 75. Page 466, proof of Corollary 8.3.7, line 2: Replace R by F. 76. Page 473, Lemma 8.5.1: Change λ nr to λ r ; change µ nr to µ r ; and change λ r R to µ r R. 77. Page 488, Fact 8.7.8: Delete and for S {1,..., n} and change inclusions to inequalities. 78. Page 502, Fact 8.10.13: Assume that A I is positive definite. 79. Page 505, Fact 8.10.29: Assume that S is nonsingular. 80. Page 505, Fact 8.10.30 and Fact 8.10.31: Change H n n to H n. 81. Page 524, Fact 8.12.8: Delete tr AB. 82. Page 534, Fact 8.13.4: Change A + B on the left hand side to B 83. Page 526, Fact 8.12.15: The upper left inequality of the Problem is false. 84. Page 534, Fact 8.13.4: Change and assume that A is positive semidefinite to assume that A is positive semidefinite, and assume that B is skew Hermitian. Also, on the left hand side of the first inequality, replace A + B with B. 85. Page 535, Fact 8.13.7: Change det(a + ȷB) to det(a + ȷB). 86. Page 543, Fact 8.13.43: Change det A det à to det A det Ãn. 87. Page 547, Fact 8.14.8: Change the second instance of λ min to λ max. 88. Page 553, Fact 8.15.21: Change R n to F n and change min to max. 89. Page 561, Fact 8.18.6: Change σ i (A) to rσ i (A) 90. Page 563, Fact 8.18.15: Change λ i to λ i (A) twice. 91. Page 565, Fact 8.19.5: Change λ i [f(αa + (1 α)b)] αλ i [f(a)] + (1 α)λ i [f(b)]. to λ i [f(αa + (1 α)b)] λ i [αf(a) + (1 α)f(b)].. 92. Page 566, Fact 8.19.7: Multiply the left hand sides of the third and fourth strings by 1/2 93. Page 568, Fact 8.19.14: The answer to the problem is yes. 94. Page 572, Fact 8.19.24: Change spec(a) to spec(ab). 95. Page 578, Fact 8.21.4: Delete 1/2 on the right-hand side of the equation. 96. Page 578, Fact 8.21.5: In the definition of S, change A to A. Also, change A AA + A to A AA + A. 97. Page 585, Fact 8.22.4: Change 1 spec(a A 1 ) to 1 spec(a A T ). 98. Page 590, Fact 8.22.29: Change Hermitian to positive semidefinite. 4

99. Page 611, Corollary 9.4.12: Change A F m l to B F m l. 100. Page 617, Corollary 9.6.9: Assume that n m. 101. Page 618, Fact 9.7.4: In v), change the second + to. 102. Page 625, Fact 9.7.21: In the second string, change the fifth + to. In the last string, change the last + to. 103. Page 636, Fact 9.9.5: Change A B to B A B. 104. Page 642, Fact 9.9.31: Change λ i (A) to λ i, and change λ j (A) to λ j 105. Page 643, Fact 9.9.35: Change all to σp 106. Page 658, Fact 9.12.8: Change λ j to µ j 107. Page 659, Fact 9.12.10: Delete the second remark. 108. Page 663, Fact 9.13.18: Change the upper limit of the last summation to n 109. Page 665, Fact 9.14.3: Define r = min {m, n}. 110. Page 671, Fact 9.14.27: Replace A, B F n m by A F n m and B F m n 111. Page 702, Fact 10.12.6: Change 2sB to 2sB 2. 112. Page 731, first displayed equation: Change x [(ȷωI to x [(ȷωI. 113. Page 798, line 3: Change (12.1.20) to (12.1.19) 114. Page 809, 2 lines above (12.6.5): Change m nm to n nm 115. Page 813, Proposition 12.6.14: Change K R n m to K R m n. Also, the proof is missing a change of basis transformation. 116. Page 813: A 1 R q q and B k F q m. In line 4, replace A by A T. 117. Page 821, Line 6 of the proof of Proposition 12.8.5: Change Proposition 12.5.3 to Proposition 12.8.3. 118. Page 823, Proof of Proposition 12.9.3: In the matrix at the bottom of the page, the entries below the sub-anti-diagonal are incorrect. 119. Page 824, Line 2: Multiply the 2 2 matrix with 1 s on the diagonal by 1. 120. Page 824: Proposition 12.9.7: Change A Rˆn ˆn to  Rˆn ˆn. 121. Page 825: Corollary 12.9.9: Define S c = [O(A, C)] 1 O(A c, C c ) and S o = [O(A, C)] 1 O(A o, C o ). 122. Page 840, line 3: Change G 2 + G 2 to G 1 + G 2. 123. Page 842, line above (12.12.7): Change +ȷ cos ϕ 0 to ȷ cos ϕ 0. 124. Page 842, one line above (12.12.8): Delete Re. 5

125. Page 852, line 2: Change P 4 to P 1. 126. Page 858, line 8: Change Z R n n to Z R 2n 2n. 127. Page 859, line 4: Change λz to λx. 128. Page 859, Section 12.18: Change the first paragraph to In this section we consider the existence of the maximal solution of (12.16.4). Example 12.6.3 shows that (12.16.4) may not have a maximal solution. 6