Solution Manual for Elementary Linear Algebra

with Applications 9th Edition by Kolman Hill

ISBN 0132296543 9780132296540 download

http://testbankpack.com/download/solution-manual-for-elementary-
linear-algebra-with-applications-9th-edition-by-kolman-hill-
isbn-0132296543-9780132296540/

Explore and download more test bank or solution manual

at testbankpack.com
Here are some suggested products you might be interested in.
Click the link to download

Solution Manual for Linear Algebra with Applications 9th

Edition Leon 0321962214 9780321962218

https://testbankpack.com/download/solution-manual-for-linear-algebra-
with-applications-9th-edition-leon-0321962214-9780321962218/

Solution Manual for Linear Algebra with Applications 2nd

Edition Holt 1464193347 9781464193347

https://testbankpack.com/download/solution-manual-for-linear-algebra-
with-applications-2nd-edition-holt-1464193347-9781464193347/

Solution Manual for Elementary Linear Algebra 8th Edition

by Larson ISBN 1305658000 9781305658004

https://testbankpack.com/download/solution-manual-for-elementary-
linear-algebra-8th-edition-by-larson-isbn-1305658000-9781305658004/

Test Bank for Linear Algebra with Applications 2nd Edition

Holt 1464193347 9781464193347

https://testbankpack.com/download/test-bank-for-linear-algebra-with-
applications-2nd-edition-holt-1464193347-9781464193347/
Solution Manual for Linear Algebra and Its Applications
5th Edition Lay McDonald 032198238X 9780321982384

https://testbankpack.com/download/solution-manual-for-linear-algebra-
and-its-applications-5th-edition-lay-
mcdonald-032198238x-9780321982384/

Solution Manual for Elementary Algebra Graphs and

Authentic Applications 2nd Edition by Lehmann ISBN
0321868277 9780321868275
https://testbankpack.com/download/solution-manual-for-elementary-
algebra-graphs-and-authentic-applications-2nd-edition-by-lehmann-
isbn-0321868277-9780321868275/

Solution Manual for Elementary Algebra Concepts and

Applications 10th Edition by Bittinger Ellenbogen Johnson
ISBN 0134441370 9780134441375
https://testbankpack.com/download/solution-manual-for-elementary-
algebra-concepts-and-applications-10th-edition-by-bittinger-
ellenbogen-johnson-isbn-0134441370-9780134441375/

Solution Manual for Elementary and Intermediate Algebra

Functions and Authentic Applications 2nd Edition by
Lehmann ISBN 0321922727 9780321922724
https://testbankpack.com/download/solution-manual-for-elementary-and-
intermediate-algebra-functions-and-authentic-applications-2nd-edition-
by-lehmann-isbn-0321922727-9780321922724/

Test Bank for Linear Algebra and Its Applications 5th

Edition Lay McDonald 032198238X 9780321982384

https://testbankpack.com/download/test-bank-for-linear-algebra-and-
its-applications-5th-edition-lay-mcdonald-032198238x-9780321982384/
 Solution Manual for Elementary Linear Algebra with
Applications 9th Edition by Kolman Hill ISBN 0132296543
9780132296540
Full link download Solution Manual:
https://testbankpack.com/p/solution-manual-for-elementary-
linear-algebra-with-applications-9th-edition-by-kolman-hill-isbn-
0132296543-9780132296540/

Chapter 2

Solving Linear Systems

Section 2.1, p. 94
−1r1 → r1 ⎡ ⎤
1 −1 1 0 −3
3r1 + r2 → r2
2. (a) Possible answer: −4r + r → r ⎣0 1 4 1 1⎦
1 3 3
2r2 + r3 → r3 0 0 0 0 0
2r1 + r2 → r2 ⎡ ⎤
−4r1 + r3 → r3 1 1 −4
(b) Possible answer: 0 1 2
⎣ ⎦
r2 + r3 → r 3
0 0 1
6 r3 → r3
1

⎡ ⎤
1 0 0 8 ⎡ ⎤
1 0 0 −1 4

3r3 + r1 → r1 ⎢0 1 0 −1 ⎥
4. (a) ⎢ ⎥ (b) −3r2 + r1 → r1 ⎣0 1 0 1 0⎦
−r3 + r2 → r2 0 0 1 2
⎣ ⎦
0 0 1 −1 0
0 0 0 0
−r1 → r1
−2r1 + r2 → r2 ⎡ ⎤
−2r1 + r3 → r3 −3r1 + r2 → r2 1 0 −3
− 5r1 + r3 → r3 ⎢0
1
2 r2
→ r2 2⎥
1
6. (a) I (b) +r r
2r1 4 → 4
⎢ ⎥
−3r3 → r3 3 ⎣0 0 0⎦
r2 + r3a)→ r3
4
3 r3+ r2 → r 2 8 RREF (c) N
−5r3 + r1 → r1 . REF
2r2 + r1 → r1 ( (b)

Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall

−
0 0
−r2 + r1
0
→
r1

9. Consider the columns of A which contain leading entries of nonzero rows of A. If this set of columns is
the entire set of n columns, then A = In . Otherwise there are fewer than n leading entries, and hence
fewer than n nonzero rows of A.
10. (a) A is row equivalent to itself: the sequence of operations is the empty sequence.
(b) Each elementary row operation of types I, II or III has a corresponding inverse operation of the
same type which “undoes” the effect of the original operation. For example, the inverse of the
operation “add d times row r of A to row s of A” is “subtract d times row r of A from row s of
A.” Since B is assumed row equivalent to A, there is a sequence of elementary row operations
which gets from A to B. Take those operations in the reverse order, and for each operation do its
inverse, and that takes B to A. Thus A is row equivalent to B.
(c) Follow the operations which take A to B with those which take B to C.

Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall

28 Chapter 2
⎡ ⎤ ⎡ ⎤
1 0 0 0 0 1 0 0 0 0
12. (a) ⎣ 2 1 0 0 0 ⎦ (b) ⎣ 0 1 0 0 0 ⎦
3 53 1 0 0 0 0 1 0 0

Section 2.2, p. 113

2. (a) x = −6 − s − t, y = s, z = t, w = 5.
(b) x = −3, y = −2, z = 1.
4. (a) x = 5 + 2t, y = 2 − t, z = t.
(b) x = 1, y = 2, z = 4 + t, w = t.
6. (a) x = −2 + r, y = −1, z = 8 − 2r, x4 = r, where r is any real number.
(b) x = 1, y = 23 , z = − 23 .
(c) No solution.
8. (a) x = 1 − r, y = 2, z = 1, x4 = r, where r is any real number.
(b) x = 1 − r, y = 2 + r, z = −1 + r, x4 = r, where r is any real number.

r
10. x = , where r = 0.
0

⎡ ⎤
− 1
⎢ 4 ⎥ r
⎢ ⎥
12. x = ⎢ 1 r ⎥, where r = 0.
⎣ 4 ⎦
r

14. (a) a = −2. (b) a = ±2. (c) a = 2.

√ √
16. (a) a = ± 6. (b) a = ± 6.
a b 0
18. The augmented matrix is . If we reduce this matrix to reduced row echelon form, we see
c d 0

that the linear system has only the trivial solution if and only if A is row equivalent to I2 . Now show
that this occurs if and only if ad − bc = 0. If ad − bc = 0 then at least one of a or c is = 0, and it is a
routine matter to show that A is row equivalent to I2 . If ad − bc = 0, then by case considerations we
find that A is row equivalent to a matrix that has a row or column consisting entirely of zeros, so that
A is not row equivalent to I2 .
Alternate proof: If ad − bc = 0, then A is nonsingular, so the only solution is the trivial one. If
ad − bc = 0, then ad = bc. If ad = 0 then either a or d = 0, say a = 0. Then bc = 0, and either b
or c = 0. In any of these cases we get a nontrivial solution. If ad = 0, then ac = bd, and the second
equation is a multiple of the first one so we again have a nontrivial solution.

19. This had to be shown in the first proof of Exercise 18 above. If the alternate proof of Exercise 18 was
given, then Exercise 19 follows from the former by noting that the homogeneous system Ax = 0 has
only the trivial solution if and only if A is row equivalent to I2 and this occurs if and only if ad− bc = 0.
⎡ 3⎤ ⎡ ⎤
2 −1
⎢ ⎥ ⎢ ⎥
20. −2 + 1 t, where t is any number.
⎣ ⎦ ⎣ ⎦
0 0

22. −a + b + c = 0.
24. (a) Change “row” to “column.”
(b) Proceed as in the proof of Theorem 2.1, changing “row” to “column.”
Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall
Section 2.2 29

25. Using Exercise 24(b) we can assume that every m × n matrix A is column equivalent to a matrix in
column echelon form. That is, A is column equivalent to a matrix B that satisfies the following:

(a) All columns consisting entirely of zeros, if any, are at the right side of the matrix.
(b) The first nonzero entry in each column that is not all zeros is a 1, called the leading entry of the
column.
(c) If the columns j and j + 1 are two successive columns that are not all zeros, then the leading
entry of column j + 1 is below the leading entry of column j.

We start with matrix B and show that it is possible to find a matrix C that is column equivalent to B
that satisfies

(d) If a row contains a leading entry of some column then all other entries in that row are zero.

If column j of B contains a nonzero element, then its first (counting top to bottom) nonzero element
is a 1. Suppose the 1 appears in row rj . We can perform column operations of the form acj + ck for
each of the nonzero columns ck of B such that the resulting matrix has row rj with a 1 in the (rj , j)
entry and zeros everywhere else. This can be done for each column that contains a nonzero entry hence
we can produce a matrix C satisfying (d). It follows that C is the unique matrix in reduced column
echelon form and column equivalent to the original matrix A.

26. −3a − b + c = 0.

28. Apply Exercise 18 to the linear system given here. The coefficient matrix is

a−r d
.
c b− r

Hence from Exercise 18, we have a nontrivial solution if and only if (a − r)(b − r) − cd = 0.

29. (a) A(xp + xh ) = Axp + Axh = b + 0 = b.

(b) Let xp be a particular solution to Ax = b and let x be any solution to Ax = b. Let xh = x − xp .
Then x = xp + xh = xp + (x − xp ) and Axh = A(x − xp ) = Ax − Axp = b − b = 0. Thus xh is
in fact a solution to Ax = 0.
30. (a) 3x2 + 2 (b) 2x2 − x − 1

2x −
3 2
32. x + 12 .
34. (a) x = 0, y = 0 (b) x = 5, y = −7

36. r = 5, r2 = 5.

37. The GPS receiver is located at the tangent point where the two circles intersect.

38. 4Fe + 3O2 → 2Fe2 O3

0
40. x = .
1
4 − 14 i

42. No solution.

Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall

30 Chapter 1

Section 2.3, p. 124

1. The elementary matrix E which results from In by a type I interchange of the ith and jth row differs
from In by having 1’s in the (i, j) and (j, i) positions and 0’s in the (i, i) and (j, j) positions. For that
E, EA has as its ith row the jth row of A and for its jth row the ith row of A.
The elementary matrix E which results from In by a type II operation differs from In by having c = 0
in the (i, i) position. Then EA has as its ith row c times the ith row of A.
The elementary matrix E which resultsfrom In by a type III operation differs from In by having c in
the (j, i) position. Then EA has as jthrow the sum of the jth row of A and c times the ith row of A.
⎡ ⎤ ⎡ ⎤ ⎡ ⎤
1 0 0 0 1 0 0 0 0 0 1 0
⎢ 0 −2 0 0⎥ ⎢0 1 0 0⎥ ⎢0 1 0 0⎥
2. (a) . (b) . (c) .
0 1
⎢ ⎥ ⎢ ⎥ ⎢ ⎥
⎣0 0 0 0⎦ ⎣0 0 1 0⎦ ⎣1 0 0 0⎦
0 1 0 0 3 1 0 0 0 1

⎡ ⎤ ⎡ ⎤
1 0 0 1 0 0

4. (a) Add 2 times row 1 to row 3: ⎣ 0 1 0⎦ → ⎣0 1 0⎦ = C

−2 0 1 0 0 1
⎡ ⎤ ⎡ ⎤
1 0 0 1 0 0

(b) Add 2 times row 1 to row 3: ⎣ 0 1 0⎦ → ⎣0 1 0⎦ = B

0 0 1 2 0 1

⎡ ⎤⎡ ⎤ ⎡ ⎤
1 0 0 1 0 0 1 0 0

(c) AB = ⎣ 0 1 0⎦ ⎣0 1 0⎦ = ⎣0 1 0 ⎦.

−2 0 1 2 0 1 0 0 1
⎡ ⎤⎡ ⎤ ⎡ ⎤
1 0 0 1 0 0 1 0 0

BA = ⎣ 0 1 0⎦ ⎣ 0 1 0⎦ = ⎣0 1 0 ⎦.

2 0 1 −2 0 1 0 0 1

Therefore B is the inverse of A.

6. If E1 is an elementary matrix of type I then E 1−1 = E1 . Let E2 be obtained from In by multiplying

the ith row of In by c = 0. Let E ∗2 be obtained from In by multiplying the ith row of In by 1c. Then
E2 E2∗ = In . Let E3 be obtained from In by adding c times the ith row of In to the jth row of In . Let
E ∗3 be obtained from In by adding −c times the ith row of In to the jth row of In . Then E3 E∗3 = In .
⎡ ⎤
1 −1 0
⎢ ⎥
⎢
8. A−1 = ⎢ 32 3⎥
⎣
1
2
− 2⎦
⎥.
−1 0 1
⎡ ⎤ ⎡ ⎤ ⎡ ⎤
3 −3 −1
1 −1 0 −1 3
2
1
2 5 5 5
⎢ ⎥ ⎢ ⎥ ⎢ ⎥
⎢ ⎥ ⎢ ⎥ ⎢ ⎥
10. (a) Singular. (b) ⎢ 1 2 1 ⎥. (c) ⎢ 1 − 32 1
2
⎥. (d) ⎢ 2
5
3
− 54 ⎥.
5
Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall
 −
⎣ ⎦ ⎣ ⎦ ⎣ ⎦
3 5 1 1 1 1 1 2
−2 2 −2 0 2 −2 −5 5 5

⎡ ⎤
1 −1 0 −1
⎢ ⎥
⎢ ⎥
⎢ 0 − 12 0 0⎥
12. (a) A−1 =⎢ ⎥ . (b) Singular.
⎢ 1 ⎥
⎢−5 1 1 3 ⎥
⎣ 5 5 ⎦
2 1 2 1

5
−2 −5 −5

Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall

Section 2.3 31

14. A is row equivalent to I3 ; a possible answer is

⎡ ⎤ ⎡ ⎤⎡ ⎤⎡ ⎤⎡ ⎤⎡ ⎤⎡ ⎤
1 2 3 1 0 0 1 2 0 1 0 0 1 0 0 1 0 0 1 0 −1
⎣
A = 0 1 2 = 0⎦ ⎣ 1 0 ⎦ ⎣ 0 1 0 ⎦ ⎣ 0 1 0 ⎦ ⎣ 0 1 0 ⎦ ⎣ 0 1 2 ⎦ ⎣ 0 1 0⎦ .
1 0 3 1 0 1 0 0 1 0 −2 1 0 0 4 0 0 1 0 0 1
⎡ ⎤
⎢
3
2
−1 1
2 ⎥
⎢ 1 ⎥
16. A = 1 .
⎢ 0 −2 ⎥
⎣ 2 ⎦
−1 1 0

18. (b) and (c).

20. For a = −1 or a = 3.
21. This follows directly from Exercise 19 of Section 2.1 and Corollary 2.2. To show that
1 d −b
A−1 =
ad − bc −c a
we proceed as follows:

1 d −b a b 1 ad − bc db − bd 1 0
= = .
ad − bc −c a c d ad − bc −ca + ac −bc + ad 0 1

⎡ ⎤ ⎡ ⎤ ⎡ ⎤
1 0 0 1 0 0 1 0 −5
⎣
22. (a) 0 1 0 ⎦. (b) ⎣ 0 1 0 ⎦. ⎣
(c) 0 1 0 ⎦.
0 0 −3 0 1 0 0 0 1

23. The matrices A and B are row equivalent if and only if B = Ek Ek−1 · · · E2 E1 A.
Let P = Ek Ek−1 · · · E2 E1 .
24. If A and B are row equivalent then B = P A, where P is nonsingular, and A = P −1 B (Exercise 23). If
A is nonsingular then B is nonsingular, and conversely.
25. Suppose B is singular. Then by Theorem 2.9 there exists x = 0 such that Bx = 0. Then (AB)x =
A0 = 0, which means that the homogeneous system (AB)x = 0 has a nontrivial solution. Theorem
2.9 implies that AB is singular, a contradiction. Hence, B is nonsingular. Since A = (AB)B −1 is a
product of nonsingular matrices, it follows that A is nonsingular.
Alternate Proof: If AB is nonsingular it follows that AB is row equivalent to In , so P (AB) = In . Since
P is nonsingular, P = Ek Ek−1 · · · E2 E1 . Then (P A)B = In or (Ek Ek−1 · · · E2 E1 A)B = In . Letting
Ek Ek−1 · · · E2 E1 A = C, we have CB = In , which implies that B is nonsingular. Since P AB = In ,
A = P −1 B −1 , so A is nonsingular.
26. The matrix A is row equivalent to O if and only if A = P O = O where P is nonsingular.
27. The matrix A is row equivalent to B if and only if B = P A, where P is a nonsingular matrix. Now
B T = AT P T , so A is row equivalent to B if and only if AT is column equivalent to B T .
28. If A has a row of zeros, then A cannot be row equivalent to In , and so by Corollary 2.2, A is singular.
If the jth column of A is the zero column, then the homogeneous system Ax = 0 has a nontrivial
solution, the vector x with 1 in the jth entry and zeros elsewhere. By Theorem 2.9, A is singular.
1 0 0 0
29. (a) No. Let A = , B = . Then (A + B)−1 exists but A−1 and B −1 do not. Even
0 0 0 1

supposing they all exist, equality need not hold. Let A = 1 , B = 2 so (A + B)−1 = 1
3 =
1 + 21 = A−1 + B −1 .
Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall
32 Chapter 1
(b) Yes, for A nonsingular and r = 0.

1 −1 = r 1
(rA) A A · A−1 = 1 · In = In .
r r

30. Suppose that A is nonsingular. Then Ax = b has the solution x = A−1 b for every n × 1 matrix b.
Conversely, suppose that Ax = b is consistent for every n × 1 matrix b. Letting b be the matrices
⎡ ⎤ ⎡ ⎤ ⎡ ⎤
1 0 0
⎢0⎥ ⎢1⎥ ⎢0⎥
⎢ ⎥ ⎢ ⎥ ⎢ ⎥
⎢ ⎥ ⎢ ⎥ ⎢ ⎥
e1 = ⎢ .
⎢.⎥
⎥ , e2 = ⎢ 0 ⎥ , . . . , en = ⎢ . ⎥ ,
⎢ ⎥ ⎢.⎥
.
⎢ ⎥ ⎢ ⎥ ⎢ ⎥
⎣ ⎦ ⎣.⎦ ⎣0⎦
0 0 1

we see that we have solutions x1 , x2 , . . . , xn to the linear systems

Ax1 = e1 , Ax2 = e2 , ..., Axn = en . (∗ )

Letting C be the matrix whose jth column is xj , we can write the n systems in (∗ ) as AC = In , since
In = e1 e2 · · · en . Hence, A is nonsingular.
31. We consider the case that A is nonsingular and upper triangular. A similar argument can be given for
A lower triangular.
By Theorem 2.8, A is a product of elementary matrices which are the inverses of the elementary
matrices that “reduce” A to In . That is,

A = E1−1 · · · E k−1 .

The elementary matrix Ei will be upper triangular since it is used to introduce zeros into the upper
triangular part of A in the reduction process. The inverse of Ei is an elementary matrix of the same
type and also an upper triangular matrix. Since the product of upper triangular matrices is upper
triangular and we have A−1 = Ek · · · E1 we conclude that A−1 is upper triangular.

Section 2.4, p. 129

1. See the answer to Exercise 4, Section 2.1. Where it mentions only row operations, now read “row and
column operations”.
I4 I2 0
2. (a) . (b) I3 . (c) . (d) I4 .
0 0 0

4. Allowable equivalence operations (“elementary row or elementary column operation”) include in par-
ticular elementary row operations.
5. A and B are equivalent if and only if B = Et · · · E2 E1 AF1 F2 · · · Fs . Let Et Et−1 · · · E2 E1 = P and
F1 F2 · · · Fs = Q.
⎡ ⎤ ⎡ ⎤
−1 2 0 1 0 −1
I2 0
6. B = ; a possible answer is: B = ⎣ 1 −1 0⎦ A ⎣0 1 −1 ⎦.
0 0
−1 1 1 0 0 1

Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall

8. Suppose A were nonzero but equivalent to O. Then some ultimate elementary row or column operation
must have transformed a nonzero matrix Ar into the zero matrix O. By considering the types of
elementary operations we see that this is impossible.

Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall

Section 2.5 33

9. Replace “row” by “column” and vice versa in the elementary operations which transform A into B.
10. Possible answers are:
⎡ ⎤ ⎡ ⎤
1 −2 3 0 1 0 0 0 0
1 0
(a) ⎣ 0 −1 4 3 ⎦. (b) . (c) ⎣ 0 1 −2 0 2 ⎦.
0 0
0 2 −5 −2 0 5 5 4 4

11. If A and B are equivalent then B = P AQ and A = P −1 BQ−1 . If A is nonsingular then B is nonsingular,
and conversely.

Section 2.5, p. 136

⎡ ⎤
0
2. x = ⎣ −2 ⎦.
3
⎡ ⎤
2
⎢ −1 ⎥
4. x = ⎢ ⎥
⎣ 0 ⎦.
5
⎡ ⎤ ⎡ ⎤ ⎡ ⎤
1 0 0 −3 1 −2 −3
6. L = ⎣ 4 1 0 ⎦, U = ⎣ 0 6 2 ⎦, x = ⎣ 4 ⎦.
−5 3 1 0 0 −4 −1
⎡ ⎤ ⎡ ⎤ ⎡ ⎤
1 0 0 0 −5 4 0 1 1

⎢ 6 1 0 0⎥ ⎢ 0 3 2 1⎥
⎢ −2 ⎥
8. L = ,U= ,x= .
⎢ ⎥ ⎢ ⎥ ⎢ ⎥
⎣ −1 2 1 0 ⎦ ⎣ 0 0 −4 1⎦ ⎣ 5⎦
−2 3 2 1 0 0 0 −2 −4

⎡ ⎤ ⎡ ⎤ ⎡ ⎤
1 0 0 0 4 1 0.25 −0.5 −1.5

⎢ 0.2 1 0 0⎥ ⎢ 0 0.4 1.2 −2.5 ⎥ ⎢ 4.2 ⎥

10. L = ,U= ,x= .
⎢ ⎥ ⎢ ⎥ ⎢ ⎥
⎣ −0.4 0.8 1 0⎦ ⎣0 0 −0.85 2⎦ ⎣ 2.6 ⎦
2 −1.2 −0.4 1 0 0 0 −2.5 −2

Supplementary Exercises for Chapter 2, p. 137

2. (a) a = −4 or a = 2.
(b) The system has a solution for each value of a.

4. c + 2a − 3b = 0.
1
5. (a) Multiply the jth row of B by k.
(b) Interchange the ith and jth rows of B.
(c) Add −k times the jth row of B to its ith row.

6. (a) If we transform E1 to reduced row echelon form, we obtain In . Hence E1 is row equivalent to In
and thus is nonsingular.
(b) If we transform E2 to reduced row echelon form, we obtain In . Hence E2 is row equivalent to In
Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall
and thus is nonsingular.

Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall

34 Chapter 2

(c) If we transform E3 to reduced row echelon form, we obtain In . Hence E3 is row equivalent to In
and thus is nonsingular.
⎡ ⎤
1 −a a2 −a3
⎢ 0 1 −a a 2 ⎥
8. ⎢
⎣0 0
⎥.
1 −a ⎦
0 0 0 1
⎡ ⎤ ⎡ ⎤
−41 83

10. (a) ⎣ 47 ⎦. (b) ⎣ −45 ⎦.

−35 −62

√
12. s = 0, ± 2.

13. For any angle θ, cos θ and sin θ are never simultaneously zero. Thus at least one element in column 1
is not zero. Assume cos θ = 0. (If cos θ = 0, then interchange rows 1 and 2 and proceed in a similar
manner to that described below.) To show that the matrix is nonsingular and determine its inverse,
we put

cos θ sin θ 1 0
− sin θ cos θ 0 1

into reduced row echelon form. Apply row operations 1

cos θ times row 1 and sin θ times row 1 added to
row 2 to obtain
⎡ ⎤
sin θ 1
⎢ 1 cos θ cos θ
0⎥
⎢ ⎥
⎢ ⎥
⎢ ⎥.
⎢ ⎥
sin2 θ sin θ
⎣ 0 ⎦
+ cos θ 1
cos θ cos θ

Since

sin2 θ sin2 θ + cos2 θ 1

+ cos θ = = ,
cos θ cos θ cos θ

sin θ
the (2, 2)-element is not zero. Applying row operations cos θ times row 2 and − cos θ times row 2
added to row 1 we obtain

1 0 cos θ − sin θ
.
0 1 sin θ cos θ

It follows that the matrix is nonsingular and its inverse is

cos θ − sin θ
.
sin θ cos θ

14. (a) A(u + v) = Au + Av = 0 + 0 = 0.

(b) A(u − v) = Au − Av = 0 − 0 = 0.
(c) A(ru) = r(Au) = r0 = 0.
(d) A(ru + sv) = r(Au) + s(Av) = r0 + s0 = 0.

15. If Au = b and Av = b, then A(u − v) = Au − Av = b − b = 0.

Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall
Chapter Review 35

16. Suppose at some point in the process of reducing the augmented matrix to reduced row echelon form
we encounter a row whose first n entries are zero but whose (n + 1)st entry is some number c = 0. The
corresponding linear equation is

0 · x1 + · · · + 0 · xn = c or 0 = c.

This equation has no solution, thus the linear system is inconsistent.

17. Let u be one solution to Ax = b. Since A is singular, the homogeneous system Ax = 0 has a nontrivial
solution u0 . Then for any real number r, v = ru0 is also a solution to the homogeneous system. Finally,
by Exercise 29, Sec. 2.2, for each of the infinitely many vectors v, the vector w = u + v is a solution
to the nonhomogeneous system Ax = b.

18. s = 1, t = 1.

20. If any of the diagonal entries of L or U is zero, there will not be a unique solution.

21. The outer product of X and Y can be written in the form

⎡ ⎤
x1 y1 y2 ···yn
⎢ ⎥
⎢ x2 y1 y2 ···yn ⎥
XY T = ⎢
⎢ ..
⎥.
⎥
⎣ ⎦
xn y1 y2 · · · yn

If either X = O or Y = O, then XY T = O. Thus assume that there is at least one nonzero component
in X, say xi , and at least one nonzero component in Y , say yj . Then x1i Rowi (X Y T ) makes the ith
row exactly Y T . Since all the other rows are multiples of Y T , row operations of the form −xk Ri + Rp ,
for p = i, can be performed to zero out everything but the ith row. It follows that either XY T is row
equivalent to O or to a matrix with n − 1 zero rows.

Chapter Review for Chapter 2, p. 138

True or False
1. False. 2. True. 3. False. 4. True. 5. True.
6. True. 7. True. 8. True. 9. True. 10. False.
Quiz
⎡ ⎤
1 0 2
1. ⎣ 0 1 3 ⎦
0 0 0

2. (a) No.
(b) Infinitely many.
(c) No.
⎡ ⎤
−6 + 2r + 7s
⎢ r ⎥
(d) x = ⎢ ⎥, where r and s are any real numbers.
⎣ −3s ⎦
s

3. k = 6.

Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall

36 Chapter 2
⎡ ⎤
0
4. ⎣ 0 ⎦.
0
⎡ 1 ⎤
−2 1
2
1
2
⎢ ⎥
5. ⎣ 1 1 0 ⎦.
−
− 21 3
2
− 21

6. P = A−1 , Q = B.
7. Possible answers: Diagonal, zero, or symmetric.

Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall

Random documents with unrelated
content Scribd suggests to you:
If the second copy is also defective, you may demand a refund
in writing without further opportunities to fix the problem.

1.F.4. Except for the limited right of replacement or refund set

forth in paragraph 1.F.3, this work is provided to you ‘AS-IS’,
WITH NO OTHER WARRANTIES OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO WARRANTIES OF
MERCHANTABILITY OR FITNESS FOR ANY PURPOSE.

1.F.5. Some states do not allow disclaimers of certain implied

warranties or the exclusion or limitation of certain types of
damages. If any disclaimer or limitation set forth in this
agreement violates the law of the state applicable to this
agreement, the agreement shall be interpreted to make the
maximum disclaimer or limitation permitted by the applicable
state law. The invalidity or unenforceability of any provision of
this agreement shall not void the remaining provisions.

1.F.6. INDEMNITY - You agree to indemnify and hold the

Foundation, the trademark owner, any agent or employee of the
Foundation, anyone providing copies of Project Gutenberg™
electronic works in accordance with this agreement, and any
volunteers associated with the production, promotion and
distribution of Project Gutenberg™ electronic works, harmless
from all liability, costs and expenses, including legal fees, that
arise directly or indirectly from any of the following which you
do or cause to occur: (a) distribution of this or any Project
Gutenberg™ work, (b) alteration, modification, or additions or
deletions to any Project Gutenberg™ work, and (c) any Defect
you cause.

Section 2. Information about the Mission

of Project Gutenberg™
Project Gutenberg™ is synonymous with the free distribution of
electronic works in formats readable by the widest variety of
computers including obsolete, old, middle-aged and new
computers. It exists because of the efforts of hundreds of
volunteers and donations from people in all walks of life.

Volunteers and financial support to provide volunteers with the

assistance they need are critical to reaching Project
Gutenberg™’s goals and ensuring that the Project Gutenberg™
collection will remain freely available for generations to come. In
2001, the Project Gutenberg Literary Archive Foundation was
created to provide a secure and permanent future for Project
Gutenberg™ and future generations. To learn more about the
Project Gutenberg Literary Archive Foundation and how your
efforts and donations can help, see Sections 3 and 4 and the
Foundation information page at www.gutenberg.org.

Section 3. Information about the Project

Gutenberg Literary Archive Foundation
The Project Gutenberg Literary Archive Foundation is a non-
profit 501(c)(3) educational corporation organized under the
laws of the state of Mississippi and granted tax exempt status
by the Internal Revenue Service. The Foundation’s EIN or
federal tax identification number is 64-6221541. Contributions
to the Project Gutenberg Literary Archive Foundation are tax
deductible to the full extent permitted by U.S. federal laws and
your state’s laws.

The Foundation’s business office is located at 809 North 1500

West, Salt Lake City, UT 84116, (801) 596-1887. Email contact
links and up to date contact information can be found at the
Foundation’s website and official page at
www.gutenberg.org/contact
 Section 4. Information about Donations to
the Project Gutenberg Literary Archive
Foundation
Project Gutenberg™ depends upon and cannot survive without
widespread public support and donations to carry out its mission
of increasing the number of public domain and licensed works
that can be freely distributed in machine-readable form
accessible by the widest array of equipment including outdated
equipment. Many small donations ($1 to $5,000) are particularly
important to maintaining tax exempt status with the IRS.

The Foundation is committed to complying with the laws

regulating charities and charitable donations in all 50 states of
the United States. Compliance requirements are not uniform
and it takes a considerable effort, much paperwork and many
fees to meet and keep up with these requirements. We do not
solicit donations in locations where we have not received written
confirmation of compliance. To SEND DONATIONS or determine
the status of compliance for any particular state visit
www.gutenberg.org/donate.

While we cannot and do not solicit contributions from states

where we have not met the solicitation requirements, we know
of no prohibition against accepting unsolicited donations from
donors in such states who approach us with offers to donate.

International donations are gratefully accepted, but we cannot

make any statements concerning tax treatment of donations
received from outside the United States. U.S. laws alone swamp
our small staff.

Please check the Project Gutenberg web pages for current

donation methods and addresses. Donations are accepted in a
number of other ways including checks, online payments and
credit card donations. To donate, please visit:
www.gutenberg.org/donate.

Section 5. General Information About

Project Gutenberg™ electronic works
Professor Michael S. Hart was the originator of the Project
Gutenberg™ concept of a library of electronic works that could
be freely shared with anyone. For forty years, he produced and
distributed Project Gutenberg™ eBooks with only a loose
network of volunteer support.

Project Gutenberg™ eBooks are often created from several

printed editions, all of which are confirmed as not protected by
copyright in the U.S. unless a copyright notice is included. Thus,
we do not necessarily keep eBooks in compliance with any
particular paper edition.

Most people start at our website which has the main PG search
facility: www.gutenberg.org.

This website includes information about Project Gutenberg™,

including how to make donations to the Project Gutenberg
Literary Archive Foundation, how to help produce our new
eBooks, and how to subscribe to our email newsletter to hear
about new eBooks.
Welcome to our website – the ideal destination for book lovers and
knowledge seekers. With a mission to inspire endlessly, we offer a
vast collection of books, ranging from classic literary works to
specialized publications, self-development books, and children's
literature. Each book is a new journey of discovery, expanding
knowledge and enriching the soul of the reade

Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.

Let us accompany you on the journey of exploring knowledge and

personal growth!

testbankpack.com