Elementary Linear Algebra 5Th Student Solutions Manual 5Th Edition Andrilli Hecker Full Chapter

Elementary Linear Algebra 5th Student
Solutions Manual 5th Edition Andrilli

Hecker
Visit to download the full and correct content document:
https://ebookmass.com/product/elementary-linear-algebra-5th-student-solutions-man
ual-5th-edition-andrilli-hecker/
Student Manual
for
Elementary
Linear Algebra
Fifth Edition
Stephen Andrilli
David Hecker
Dedication
To all the students who have used

the various editions of our book
over the years
Table of Contents
Preface …………………………………………………..iii
Chapter 1 Solutions ……………………………………....1

Chapter 2 Solutions ……………………………………..27
Chapter 3 Solutions ……………………………………..77
Chapter 4 Solutions ……………………………………118
Appendix B Solutions …………………………………313
Appendix C Solutions …………………………………315
Appendix D Solutions …………………………………316
ii
Preface
This Student Solutions Manual is designed to
accompany the fifth edition of Elementary Linear Algebra,
by Andrilli and Hecker. It contains detailed solutions for
all of the exercises in the textbook marked with a star ()
or a triangle (). In the triangle exercises, the student is
typically asked to prove a theorem that appears in the
textbook.
The solutions presented are generally self-contained,

except that a comment may appear at the beginning of an
exercise that applies to all the solutions for each part of the
exercise. For example, the solution to Exercise 1 in
Section 1.1 begins with a description of the general strategy
used to solve problems in each of parts (a) and (c). Then,
the solution is given to each part separately, following the
previously stated strategy. Therefore, you should always
check for a comment at the heading of a problem before
jumping to the part in which you are interested.
We hope you find these solutions helpful. You can

find other useful information at the web site at which you
obtained this manual.
Stephen Andrilli
David Hecker
August 2015
iii
Student Manual for Andrilli and Hecker - Elementary Linear Algebra, 5th edition Section 1.1
Solutions to Selected Exercises

Chapter 1
Section 1.1
(1) In each part, to find the vector, subtract the corresponding coordinates of the initial vector from the
terminal vector.
(a) In this case, [5 −1] − [−4 3] = [9 −4]. And so, the desired vector is [9 −4]. The distance between
p √
the two points = k[9 −4]k = 92 + (−4)2 = 97.
(c) In this case, [0 −3 2 −1 −1] − [1 −2 0 2 3] = [−1 −1 2 −3 −4]. And so, the desired vector is
[−1 −1 2 −3 −4]. The distance between the two points = k[−1 −1 2 −3 −4]k =
p √
(−1)2 + (−1)2 + 22 + (−3)2 + (−4)2 = 31
(2) In each part, the terminal point is found by adding the coordinates of the given vector to the corre-
sponding coordinates of the initial point (1 1 1).
(a) [1 1 1] + [2 3 1] = [3 4 2] (see Figure 1), so the terminal point = (3 4 2).
(c) [1 1 1] + [0 −3 −1] = [1 −2 0] (see Figure 2), so the terminal point = (1 −2 0).
Figure 1 Figure 2
(3) In each part, the initial point is found by subtracting the coordinates of the given vector from the
corresponding coordinates of the given terminal point.
(a) [6 −9] − [−1 4] = [7 −13], so the initial point is (7 −13).
(c) [2 −1 −1 5 4] − [3 −4 0 1 −2] = [−1 3 −1 4 6], so the initial point = (−1 3 −1 4 6).
c 2016 Elsevier Ltd. All rights reserved.

Copyright ° 1
(4) (a) First, we find the vector v having the given initial and terminal point by subtracting:
[10 −10 11] − [−4 7 2] = [14 −17 9] = v. Next, the desired point is found by adding 23 v (which
2
is the length of v) to the vector for the initial point (−4 7 2):
3
£ ¤ £ 16 13 ¤
[−4 7 2] + 23 v = [−4 7 2] + 23 [14 −17 9] = [−4 7 2] + 28 34
3 − 3 6 = 3 − 3 8 ,
¡ 16 13 ¢
so the desired point is 3  − 3  8 .
1
(5) Let v represent the given vector. Then the desired unit vector u equals kvk v.
h i
1 1 1 √3  − √5  √6
(a) u = kvk v = k[3−56]k [3 −5 6] =√ [3 −5 6] = 70 70 70
;
32 +(−5)2 +62
√
u is shorter than v since kuk = 1 ≤ 70 = kvk.
1 1 1
(c) u = kvk v = k[06−08]k [06 −08] = √ [06 −08] = [06 −08];
2 (06) +(−08)2
neither vector is longer because u = v.
(6) Two nonzero vectors are parallel if and only if one is a scalar multiple of the other.
(a) [12 −16] and [9 −12] are parallel because 34 [12 −16] = [9 −12].
(c) [−2 3 1] and [6 −4 −3] are not parallel. To show why not, suppose they are. Then there would
be a  ∈ R such that [−2 3 1] = [6 −4 −3]. Comparing first coordinates shows that −2 = 6,
or  = −3. However comparing second coordinates shows that 3 = −4, or  = − 43 instead. But
 can not have both values.
(7) (a) 3[−2 4 5] = [3(−2) 3(4) 3(5)] = [−6 12 15]

(c) [−2 4 5] + [−5 −3 6] = [(−2 + (−5)) (4 + (−3)) (5 + 6)] = [−7 1 11]
(e) 4[−5 −3 6]−5[−2 4 5] = [4(−5) 4(−3) 4(6)]−[5(−2) 5(4) 5(5)] = [−20 −12 24]−[−10 20 25] =
[(−20 − (−10)) (−12 − 20) (24 − 25)] = [−10 −32 −1]
(8) (a) x+y = [−1 5]+[2 −4] = [(−1+2) (5−4)] = [1 1], x−y = [−1 5]−[2 −4] = [(−1−2) (5−(−4))] =
[−3 9], y − x = [2 −4] − [−1 5] = [(2 − (−1)) ((−4) − 5)] = [3 −9] (see Figure 3, next page)
(c) x + y = [2 5 −3] + [−1 3 −2] = [(2 + (−1)) (5 + 3) ((−3) + (−2))] = [1 8 −5],
x − y = [2 5 −3] − [−1 3 −2] = [(2 − (−1)) (5 − 3) ((−3) − (−2))] = [3 2 −1],
y − x = [−1 3 −2] − [2 5 −3] = [((−1) − 2) (3 − 5) ((−2) − (−3))] = [−3 −2 1] (see Figure 4,
next page)
(10) In each part, consider the center of the clock to be the origin.
(a) At 12 PM, the tip of the minute hand is at (0 10). At 12 : 15 PM, the tip of the minute hand is
at (10 0). To find the displacement vector, we subtract the vector for the initial point from the
vector for the terminal point, yielding [10 0] − [0 10] = [10 −10].
(b) At 12 PM, the tip of the minute hand is at (0 10). At 12 : 40 PM, the minute hand makes a 210◦
angle with the positive -axis. So, as shown in Figure 1.10 in the textbook,
h the
³ minute
√ ´
hand makes
¡ ¢i
the vector v = [kvk cos  kvk sin ] = [10 cos(210 ) 10 sin(210 )] = 10 − 2  10 − 12
◦ ◦ 3
=
√
[−5 3 −5]. To find the displacement vector,√ we subtract the vector√ for the initial point from the
vector for the terminal point, yielding [−5 3 −5] − [0 10] = [−5 3 −15].

Copyright ° 2
Figure 3 Figure 4
(13) As shown in Figure 1.10 in the textbook, for any vector v ∈ R2  v = [kvk cos  kvk sin ], where  is
the angle v makes with the positive -axis. Now “southwest” corresponds to 225◦ , “east” corresponds
to 0◦ , and northwest corresponds to 135◦ . Hence, if v1 , v2 , and v3 are the vectors corresponding to
the three given movements, thenh i
√ √
2 2
v1 = [1 cos(225◦ ) 1 sin(225◦ )] = − 2 − 2, v2 = [05 cos(0◦ ) 05 sin(0◦ )] = [05 0], and
h ³√ ´ √ i
v3 = [02 cos(135◦ ) 02 sin(135◦ )] = 02 − 22  02 22 . Hence, the result of all three putts is
h √ √ i h ³ √ ´ √ i √ √
v1 +v2 +v3 = − 22  − 22 +[05 0]+ 02 − 22  02 22 = [05−06 2 −04 2] ≈ [−03485 −05657].
(14) As shown in Figure 1.10 in the textbook, for any vector v ∈ R2  v = [kvk cos  kvk sin ], where  is the
angle v makes with the positive -axis. Now “northwestward” corresponds to 135◦ , and “southward”
corresponds to 270◦ . Hence, if vh1 corresponds
³ √ ´ √ to i the rower, and v2 corresponds to the current, then
2 2
£ √ √ ¤
v1 = [4 cos(135 ) 4 sin(135 )] = 4 − 2  4 2 = −2 2 2 2 and v2 = [3 cos(270◦ ) 3 sin(270◦ )] =
◦ ◦
£ √ √ ¤ √ √
[0 −3]. Therefore, the rower’s net velocity = v1 +v2 = −2 2 2 2 +[0 −3] = [−2 2 −3+2 2]. The
° √ √ ° q √ ¡ √ ¢2 p √
resultant speed = °[−2 2 −3 + 2 2]° = (−2 2)2 + −3 + 2 2 = 25 − 12 2 ≈ 283 km/hr.
(16) If v1 corresponds to the rower, and v2 corresponds to the current and v3 corresponds to the resultant
velocity, then v3 = v1 + v2 , or v1 = v3 − v2 . Now, as shown in Figure 1.10 in the textbook, for any
vector v ∈ R2  v = [kvk cos  kvk sin ], where  is the angle v makes with the positive -axis. Also,
“westward” corresponds to 180◦h, and “northeastward” corresponds to 45◦ . Thus,
√ √ i £√ √ ¤
v2 = [2 cos(45◦ ) 2 sin(45◦ )] = 2 22  2 22 = 2 2 and v3 = [8 cos(180◦ ) 8 sin(180◦ )] = [−8 0].
£√ √ ¤ √ √
Hence, v1 = v3 − v2 = [−8 0] − 2 2 = [−8 − 2 − 2].
(17) Let f and a represent the resultant force and the resultant acceleration, respectively. Then f =
[3−124] £ ¤
f1 + f2 + f3 . Now, f1 = 4 k[3−124]k = √ 2 4 2 2 [3 −12 4] = 13
4
[3 −12 4] = 12 48 16
13  − 13  13 ,
3 +(−12) +4

Copyright ° 3
[0−4−3] 2 2
£ ¤
f2 = 2 k[0−4−3]k =√ [0 −4 −3] = [0 −4 −3] = 0 − 85  − 65 , and
5
02 +(−4)2 +(−3)2
[001] £ ¤ £ ¤
f3 = 6 k[001k = 61 [0 0 1] = [0 0 6]. Therefore, f = f1 +f2 +f3 = 12 48 16 8 6
13  − 13  13 + 0 − 5  − 5 +[0 0 6] =
£ 12 344 392 ¤ 1 1 12 344 392
13  − 65  65 . Finally, f = a . Since  = 20, acceleration = a =  f = 20 [ 13  − 65  65 ] ≈
[00462 −02646 03015].
(20) As shown in Figure 1.10 in the textbook, for any vector v ∈ R2  v = [kvk cos  kvk sin ], where  is
the angle v makes with the positive -axis. Thus, if we let  = kak and  = kbk, then
h √ √ i h √ i
a = [ cos(135◦ )  sin(135◦ )] = − 22   22 and b = [ cos(60◦ )  sin(60◦ )] =  12   23 . Now, since
h √ √ i h √ i
the weight is not moving, a + b + g = 0. That is, − 22   22 +  12   23 + [0 −] = [0 0]. Using
√ √
the first coordinates gives us − 22 +  12 = 0. Hence,  = 2. Using the second coordinates gives us
√ √ √ √ √ √
 22 +  23 −  = 0. Substituting in  = 2 yields  22 + 2 23 −  = 0. Solving for  produces
√
 = √2 2 √ , and  = 2 = 1+ 2
√ . Plugging these values in to the formulas for a and b gives
( 1+ 3) √
3
−
a = [ 1+√3  1+√3 ] and b = [ 1+√3  1+√33 ].
  
(22) In each part, let x = [1  2       ], y = [1  2       ], and  ∈ R.
(b) x + (−x) = [1       ] + [−1      − ] = [(1 + (−1 ))     ( + (− ))] = [0     0] = 0.
Also, (−x) + x = x + (−x) (by part (1) of Theorem 1.3) = 0, by the above.
(c) (x+y) = ([(1 +1 )     ( + )]) = [(1 +1 )     ( + )] = [(1 +1 )     ( + )] =
[1       ] + [1       ] = x + y
(23) If  = 0, we are done. Otherwise, x = 0 =⇒ ( 1 )(x) = 1 (0) =⇒ ( 1 · )x = 0 (by part (7) of Theorem
1.3) =⇒ x = 0. Thus either  = 0 or x = 0.
p
(25) (a) False. The length of [1  2  3 ] is 21 + 22 + 23 . The formula given in the problem is missing the
square root. So, for example, the length of [0 3 4] is actually 5, not 02 + 32 + 42 = 25.
(b) True. This is easily proved using parts (1) and (2) of Theorem 1.3.
(c) True. [2 0 −3] = 2[1 0 0] + (−3)[0 0 1].
(d) False. Two nonzero vectors are parallel if and only if one is a scalar multiple of the other. To
show why [3 −5 2] and [6 −10 5] are not parallel, suppose they are. Then there would be a  ∈ R
such that [3 −5 2] = [6 −10 5]. Comparing first coordinates shows that 3 = 6, or  = 2. But
this value of  must work in all coordinates. However, it does not work in the third coordinate,
since (2)(2) 6= 5.
(e) True. Multiply both sides of x = 0 by 1 .
(f) False. Parallel vectors can be in opposite directions. For example, [1 0] and [−2 0] are parallel,
but are not in the same direction.
(g) False. The properties of vectors in Theorem 1.3 are independent of the location of the initial
points of the vectors.
p √ √
(h) False. ||[9 −8 −4]|| = 92 + (−8)2 + (−4)2 = 81 + 64 + 16 = 161  1

Copyright ° 4
Section 1.2
x·y
(1) In each part, we use the formula cos  = kxkkyk .
x·y [−43]·[6−1] (−4)(6)+(3)(−1) −27

(a) cos  = kxkkyk = k[−43]kk[6−1]k = √ √ = √ .
5 37
And so, using a calculator yields
(−4)2 +32 62 +(−1)2
27
 = arccos(− 5√37
), or about 1526◦ , or 266 radians.
x·y [7−42]·[−6−101] (7)(−6)+(−4)(−10)+(2)(1) 0
(c) cos  = kxkkyk = k[7−42]kk[−6−101]k = √ √ = √ √
69 137
= 0. And so,
72 +(−4)2 +22 (−6)2 +(−10)2 +12

 = arccos(0), which is 90◦ , or 2 radians.
(4) When a force f moves an object by a displacement d, the work performed is f · d.

1
(b) First, we need to compute f . A unit vector in the direction of f is u = k[−245]k [−2 4 5] =
√ 1 1 26
[−2 4 5] = 3√ 5
[−2 4 5]. Thus, since kf k = 26, f = 26u = √
3 5
[−2 4 5] =
(−2)2 +42 +52
h √ √ √ i
−52 5 104 5 26 5
15  15  3 , where we have rationalized the denominators.
1
Next, we need to compute d. A unit vector in the direction of d is v = k[−122]k [−1 2 2] =
1
£ ¤ £ ¤
√ [−1 2 2] = − 13  23  23 . Thus, since kdk = 10, d = 10v = − 10 20 20
3  3  3 .
(−1)2 +22 +22
h √ √ √ i £ ¤
Hence, the work performed is f · d = −52 5 104 5 26 5
15  15  3 · − 10 20 20
3  3  3
³ √ ´¡ ¢ ³ 104√5 ´ ¡ 20 ¢ ³ 26√5 ´ ¡ 20 ¢ ¡ √ √ √ ¢
= −5215
5
− 10
3 + 15 3 + 3 3 = 19 104 5 + 416 5 + 520 5
√
1040 5
= 9 , or 2584 joules.
(6) In all parts, let x = [1  2       ]  y = [1  2       ]  and z = [1  2       ] 
(a) x · y = [1  2       ] · [1  2       ] = 1 1 + · · · +   = 1 1 + · · · +   =

[1  2       ] · [1  2       ] = y · x
(b) x · x = [1  2       ] · [1  2       ] = 1 1 + · · · +   = 21 + · · · + 2 . Now 21 + · · · + 2
is a sum of squares, each of which must be nonnegative. Hence, the sum is also nonnegative, and
³p ´2
so its square root is defined. Thus, 0 ≤ x · x = 21 + · · · + 2 = 21 + · · · + 2 = kxk2 .
(c) Suppose x · x = 0. From part (b), 0 = x · x = 21 + · · · + 2 ≥ 2 , for each , since all terms in the
sum are nonnegative. Hence, 0 ≥ 2 for each . But 2 ≥ 0, because it is a square. Hence each
 = 0. Therefore, x = 0.
(d) (x · y) =  ([1  2       ] · [1  2       ]) =  (1 1 + · · · +   ) = 1 1 + · · · +   =
[1  2       ] · [1  2       ] = (x) · y.
Next, (x · y) = (y · x) (by part (a)) = (y) · x (by the above) = x · (y), by part (a)
(e) (x + y) · z = ([1  2       ] + [1  2       ]) · [1  2       ]
= [1 + 1  2 + 2       +  ] · [1  2       ] = (1 + 1 )1 + (2 + 2 )2 + · · · + ( +  )
= (1 1 + 2 2 + · · · +   ) + (1 1 + 2 2 + · · · +   )
Also, (x · z) + (y · z) = ([1  2       ] · [1  2       ]) + ([1  2       ] · [1  2       ])
= (1 1 + 2 2 + · · · +   ) + (1 1 + 2 2 + · · · +   ). Hence, (x + y) · z = (x · z) + (y · z).
(7) No. Consider x = [1 0], y = [0 1], and z = [1 1]. Then x · z = [1 0] · [1 1] = (1)(1) + (0)(1) = 1 and
y · z = [0 1] · [1 1] = (0) (1) + (1)(1) = 1, so x · z = y · z. But x 6= y.

Copyright ° 5
2
(8) By part (2) of Theorem 1.5, (a − b) · (a − b) = ka − bk ≥ 0. Hence, by parts (5) and (6) of
Theorem 1.5, (a · a) − (b · a) − (a · b) + (b · b) ≥ 0. By parts (1) and (2) of Theorem 1.5, we have
2 2
kak −2 (a · b)+kbk ≥ 0. Thus, 1−2 (a · b)+1 ≥ 0 because a and b are unit vectors, and so a·b ≤ 1
(16) Position the cube so that one of its corners is at the origin and the three edges from that corner are
along the positive -, -, and -axes. Then the corner diagonally opposite from the origin is at the
point (  ). The vector representing this diagonal is d = [  ].
√ √ √
(a) The length of the diagonal = kdk = 2 + 2 + 2 = 32 = 3.
(b) The angle d makes with a side µ of the cube is equal ¶ to the angle between d and [ 0 0], which
³ ´ ³ 2 ´ √
d·[00]
is arccos kdkk[00]k = arccos √()+(0)+(0) √ = arccos √ = arccos( 3 ◦
3 ) ≈ 547 , or
( 3)( 2 +02 +02 ) 32
0955 radians.
³ ´ ³ ´ ³ ´
(17) (a) proja b = kak a·b
2 a = [215]·[14−3]
k[215]k 2 [2 1 5] = (2)(1)+(1)(4)+(5)(−3)
2
2 +1 +52 2 [2 1 5] = −9 30 [2 1 5]
£ 3 3
¤ £ ¤ £ ¤
= − 5  − 10  − 32 . b − proja b = [1 4 −3] − − 35  − 10 3
 − 32 = 85  43 3
10  − 2 . proja b is orthogonal
£ 3 3
¤ £ ¤
to (b − proja b) because proja b · (b − proja b) = − 5  − 10  − 32 · 85  43 3
10  − 2 =
¡ 3 ¢ ¡ 8 ¢ ¡ 3 ¢ ¡ 43 ¢ ¡ 3 ¢ ¡ 3 ¢
− 5 5 + − 10 10 + − 2 − 2 = 0.
³ ´ ³ ´
(c) proja b = kak a·b
2 a = [10−12]·[3−10−1]
k[10−12]k 2 [1 0 −1 2] =
³ ´ £ ¤
(1)(3)+(0)(−1)+(−1)(0)+(2)(−1)
12 +02 +(−1)2 +22 [1 0 −1 2] = 16 [1 0 −1 2] = 16  0 − 16  13 .
£ ¤ £ ¤
b−proja b = [3 −1 0 −1]− 16  0 − 16  13 = 17 1 4
6  −1 6  − 3 . proja b is orthogonal to (b − proja b)
£ ¤ £ ¤
because proja b · (b − proja b) = 16  0 − 16  13 · 17 1
6  −1 6  − 3 =
4
¡ 1 ¢ ¡ 17 ¢ ¡ 1¢ ¡1¢ ¡1¢ ¡ 4¢
6 6 + (0) (−1) + − 6 6 + 3 − 3 = 0.
³ ´ ³ ´ ³ ´
(19) Let a = [  ]. Then proji a = kik i·a
2 i = [100]·[]
k[100]k 2 [1 0 0] = 1+0+0
12 +02 +02 [1 0 0] = i. Similarly,
³ ´ ³ ´ ³ ´ ³ ´
projj a = kjk j·a
2 j = [010]·[]
2 [0 1 0] = 0+1+0
2 2
0 +1 +0 2 [0 1 0] = j, and proj k a = k·a
2 k =
³ ´ ³ k[010]k ´ kkk
[001]·[]
k[001]k2
[0 0 1] = 00+0+1
2 +02 +12 [0 0 1] = k.
(20) In each part, if v is the given vector, then by Theorem 1.11, x = projv x + (x− projv x), where projv x
is parallel to v and (x − projv x) is orthogonal to v.
³ ´
v·x
(a) In this case, x = [−6 2 7] and v = [2 −3 4]. Then projv x = kvk 2 v=
³ ´ ³ ´ ¡ ¢
[2−34]·[−627]
k[2−34]k2
[2 −3 4] = (2)(−6)+(−3)(2)+(4)(7)
22 +(−3)2 +42 [2 −3 4] = 10 20 30 40
29 [2 −3 4] = [ 29  − 29  29 ].
¡ ¢
And so projv x is clearly parallel to v since projv x = 10 29 v. Also,
(x − projv x) = [−6 2 7] − [ 20 30 40 194 88 163
29  − 29  29 ] = [− 29  29  29 ]. We can easily check that
projv x + (x − projv x) = [ 20 30 40 194 88 163
29  − 29  29 ] + [− 29  29  29 ] = [−6 2 7] = x, and that projv x
and (x − projv x) are orthogonal, since projv x · (x − projv x) = [ 20 30 40 194 88 163
29  − 29  29 ] · [− 29  29  29 ]
¡ 20 ¢ ¡ 194 ¢ ¡ 30 ¢ ¡ 88 ¢ ¡ 40 ¢ ¡ 163 ¢
= 29 − 29 + − 29 29 + 29 29 = 0.

Copyright ° 6
³ ´
v·x
(c) In this case, x = [−6 2 7] and v = [3 −2 6]. Then projv x = kvk 2 v=
³ ´ ³ ´ ¡ ¢ £ 60 40 120 ¤
[3−26]·[−627]
k[3−26]k2
[3 −2 6] = (3)(−6)+(−2)(2)+(6)(7)
32 +(−2)2 +62 [3 −2 6] = 20 49 [3 −2 6] = 49  − 49  49 .
¡ ¢
And so, projv x is clearly parallel to v since projv x = 20 49 v. Also,
£ 60 40 120 ¤ £ 354 138 223 ¤
(x − projv x) = [−6 2 7] − 49  − 49  49 = − 49  49  49 . We can easily check that
£ ¤ £ 354 138 223 ¤
projv x + (x − projv x) = 60 40 120
49  − 49  49 + − 49  49  49 = [−6 2 7] = x, and that projv x
£ ¤ £ 354 138 223 ¤
and (x − projv x) are orthogonal, since projv x · (x − projv x) = 60 40 120
49  − 49  49 · − 49  49  49
¡ ¢ ¡ 354 ¢ ¡ 40 ¢ ¡ 138 ¢ ¡ 120 ¢ ¡ 223 ¢
= 60 49 − 49 + − 49 49 + 49 49 = 0.
(23) (a) Note that projx y = [ 85  − 65  2] = 25 x and y − projx y = [ 75  − 24

5  −4] is orthogonal to x. Let w =
y − projx y Then since y = projx y + (y − projx y) we have y = 25 x + w where w is orthogonal
to x.
(25) (a) True by part (4) of Theorem 1.5.
(b) True. Theorem 1.7 (the Cauchy-Schwarz Inequality) states that |x · y| ≤ kxk kyk. Since
x · y ≤ |x · y|, we have x · y ≤ kxk kyk. But then, because kxk  0, we can divide both sides by
kxk to obtain the desired inequality
(c) False. For example, if x = [1 0 0] and y = [0 1 0], then kx − yk = k[1 −1 0]k =
p √
12 + (−1)2 + 02 = 2, and kxk − kyk = k[1 0 0]k − k[0 1 0k =
√ √ √
12 + 02 + 02 − 02 + 12 + 02 = 1 − 1 = 0. However, 2 £ 0.
(d) False. Theorem 1.9 shows that if   2 , then x · y  0. (Remember,  is defined to be ≤ .)
(e) True. If  6= , then e · e = 0(0) + · · · + 1(0) + · · · + 0(1) + 0(0) + · · · + 0(0) = 0 + · · · + 0 = 0.
|{z} |{z}
th terms th terms
³ ´
a·b
(f) False. proja b = kak2
a, and so proja b is parallel to a, since it is a scalar multiple of a. Thus, if
proja b = b, a and b are parallel,
³ not´perpendicular.
³ ´For a particular
³ example,
´ suppose a = [1 0]
a·b [10]·[20] 1(2)+0(0)
and b = [2 0]. Then proja b = kak2 a = k[10]k [1 0] = √
12 +02
[1 0] = 2[1 0] = [2 0] =
b. However, a = [1 0] and b = [2 0] are parallel (since b = 2a) and not perpendicular (since
a · b = [1 0] · [2 0] = 1(2) + 0(0) = 2 6= 0.
Section 1.3
(1) (b) Let  = max{|| ||}. Then kx ± yk ≤ (kxk + kyk).
The proof is as follows:
kx ± yk = kx + (±y)k
≤ kxk + k±yk by the Triangle Inequality
= || kxk + | ± | kyk by Theorem 1.1
≤  kxk +  kyk because || ≤  and | ± | ≤ 
=  (kxk + kyk)
(2) (b) The converse is: If an integer has the form 3 + 1, then it also has the form 6 − 5, where  and
 are integers. For a counterexample, consider that the number 4 = 3 + 1 with  = 1, but there
is no integer  such that 4 = 6 − 5, since this equation implies  = 32 , which is not an integer.

Copyright ° 7
2 2
(6) (a) Consider x = [1 0 0] and y = [1 1 0]. Then x · y = [1 0 0] · [1 1 0] = 1 = k[1 0 0]k = kxk , but
x 6= y.
(b) If x 6= y, then x · y 6= kxk2 .
(c) Yes. Using the counterexample from part (a), x 6= y, but x · y = kxk2 .
(7) Assuming x and y are vectors in R , the contrapositive of the given statement is: “If kx + yk2 =
kxk2 + kyk2 , then x · y = 0.” To prove the contrapositive, we assume the premise kx + yk2 =
kxk2 + kyk2 . Then by applying part (2) of Theorem 1.5 to both sides of this equation, we have
(x + y) · (x + y) = x · x + y · y Expanding the left side (using the distributive laws from Theorem 1.5),
we find x · x + 2(x · y)+ y· y = x · x + y · y, which reduces to x · y = 0 the desired conclusion. Since
the contrapositive of the original statement has been proven, the original statement is proven as well.
(9) (a) Contrapositive: If x = 0, then x is not a unit vector.
Converse: If x is nonzero, then x is a unit vector.
Inverse: If x is not a unit vector, then x = 0.
(c) (Let x, y be nonzero vectors.)
Contrapositive: If projy x 6= 0, then projx y 6= 0.
Converse: If projy x = 0, then projx y = 0.
Inverse: If projx y 6= 0, then projy x 6= 0.
(11) (b) Converse: Let x and y be vectors in R . If kx + yk ≥ kyk, then x · y = 0. The original statement
is true, but the converse is false in general.
Proof of the original statement:
kx + yk2 = (x + y) · (x + y) by part (2) of Theorem 1.5

= kxk2 + 2(x · y) + kyk2 using Theorem 1.5
= kxk2 + kyk2 since x · y = 0
≥ kyk2 by part (2) of Theorem 1.5
Taking the square root of both sides yields kx + yk ≥ kyk. √

Counterexample √to converse: let x = [1 0] and y = [1 1]. Then kx + yk = k[2 1]k = 5 and
kyk = k[1 1]k = 2. Hence kx + yk ≥ kyk. However, x · y = [1 0] · [1 1] = 1 6= 0.
(12) Assume each coordinate of both x and y is equal to either 1 or −1. For a proof by contradiction of the
statement “If x is orthogonal to y, then  is even,” we assume the premise and we assume the negation
of the desired conclusion, and then show that this leads to a logical contradiction.
P That is, we assume
that x ⊥ y and we also assume that  is odd. Then x·y = 0. Now x·y = =1   . But each product
  equals either 1 or −1. If exactly  of these products equal 1, then x · y =  − ( − ) = − + 2.
Hence − + 2 = 0, and so  = 2, contradicting the fact that  is odd. Since we have reached a
logical contradiction by assuming that  is odd, it follows that  is even.
(17) Base Step ( = 1): kx1 k2 = kx1 k2 .
Inductive Step: Assume kx1 + · · · + x k2 = kx1 k2 + · · · + kx k2 . Prove kx1 + · · · + x + x+1 k2 =
kx1 k2 + · · · + kx k2 + kx+1 k2 . We have k(x1 + · · · + x ) + x+1 k2 = kx1 + · · · + x k2 +
2((x1 + · · · + x )·x+1 ) + kx+1 k2 = kx1 + · · · + x k2 + kx+1 k2 (since x+1 is orthogonal to all of
x1      x ) = kx1 k2 + · · · + kx k2 + kx+1 k2  by the inductive hypothesis.
(19) Step 1 cannot be reversed, because  could equal −(2 + 2) and then the converse would not hold.
Step 2 cannot be reversed, because  2 could equal 4 +42 + with   4. For a specific counterexample

Copyright ° 8
√
to the converse, set  = 4 + 42 + 5.
 43 +8
Step 3 is reversible. To prove the converse, multiply both sides of  = 2 by 2.
Step 4 cannot be reversed, because in general  does not have to equal 2 + 2. In particular,  could
equal 2 + 5.
2
Step 5 can be reversed by multiplying 2 by 2( +2)
2(2 +2) .

Step 6 cannot be reversed, since  could equal 2 +  for some  6= 0.
(20) (a) Negation: For every unit vector x in R3 , x · [1 −2 3] 6= 0. (Note that the existential quantifier
has changed to a universal quantifier.)
(c) Negation: x = 0 or kx + yk 6= kyk, for all vectors x and y in R . (The “and” has changed to an
“or,” and the existential quantifier has changed to a universal quantifier.)
(e) Negation: There is an x ∈ R3 such that for every nonzero y ∈ R3 , x · y 6= 0. (Note that the
universal quantifier on x has changed to an existential quantifier, and the existential quantifier
on y has changed to a universal quantifier.)
(21) (a) When negating the conclusion “x = 0 or kx − yk  kyk” of the original statement, we must
change the “or” to “and.”
Contrapositive: If x 6= 0 and kx − yk ≤ kyk, then x · y 6= 0.
Converse: If x = 0 or kx − yk  kyk, then x · y = 0.
Inverse: If x · y 6= 0, then x 6= 0 and kx − yk ≤ kyk.
(25) (a) False. We must also verify that the reversed steps are truly reversible. That is, we must also
supply valid reasons for the forward steps thus generated, as in the proof of Result 3.
(b) True. “If not  then not ” is the contrapositive of “If  then .” A statement and its contra-
positive are always logically equivalent.
(c) True. We saw that “ only if ” is an equivalent form for “If  then ,” whose converse is
“If  then .”
(d) False. “ is a necessary condition for ” is an equivalent form for “If  then .” As such, it does
not include the statement “If  then ” that is included in the “ if and only if ” statement.
(e) False. “ is a necessary condition for ” and “ is a sufficient condition for ” are both equivalent
forms for “If  then .” As such, neither includes the statement “If  then ” that is included
in the “ if and only if ” statement.
(f) False. The inverse of a statement is the contrapositive of the converse. Hence, the converse and
the inverse are logically equivalent, and always have the same truth values.
(g) False. The problem only describes the inductive step. The base step of the proof is also required.
(h) True. This rule is given in the section for negating statements with quantifiers.
(i) False. The “and” must change to an “or.” Thus, the negation of “ and ” is “not  or not .”
Section 1.4
⎡ ⎤ ⎡ ⎤ ⎡ ⎤
−4 2 3 6 −1 0 (−4 + 6) (2 + (−1)) (3 + 0)
(1) (a) ⎣ 0 5 −1 ⎦ + ⎣ 2 2 −4 ⎦ = ⎣ (0 + 2) (5 + 2) ((−1) + (−4)) ⎦
6 1 −2 3 −1 1 (6 + 3) (1 + (−1)) ((−2) + 1)
⎡ ⎤
2 1 3
=⎣ 2 7 −5 ⎦
9 0 −1

Copyright ° 9
⎡ ⎤ ⎡ ⎤ ⎡ ⎤
−4 2 3 4(−4) 4(2) 4(3) −16 8 12
(c) 4 ⎣ 0 5 −1 ⎦ = ⎣ 4(0) 4(5) 4(−1) ⎦ = ⎣ 0 20 −4 ⎦
6 1 −2 4(6) 4(1) 4(−2) 24 4 −8
(e) Impossible. C is a 2 × 2 matrix, F is a 3 × 2 matrix, and E is a 3 × 3 matrix. Hence, 3F is 3 × 2
and −E is 3 × 3. Thus, C, 3F, and −E have different sizes. However, in order to add matrices,
they must be the same size.
⎡ ⎤ ⎡ ⎤ ⎡ ⎤
−4 2 3 3 −3 5 6 −1 0
(g) 2 ⎣ 0 5 −1 ⎦ − 3 ⎣ 1 0 −2 ⎦ − ⎣ 2 2 −4 ⎦
6 1 −2 6 7 −2 3 −1 1
⎡ ⎤ ⎡ ⎤ ⎡ ⎤
2(−4) 2(2) 2(3) −3(3) −3(−3) −3(5) −6 −(−1) −0
= ⎣ 2(0) 2(5) 2(−1) ⎦ + ⎣ −3(1) −3(0) −3(−2) ⎦ + ⎣ −2 −2 −(−4) ⎦
2(6) 2(1) 2(−2) −3(6) −3(7) −3(−2) −3 −(−1) −1
⎡ ⎤ ⎡ ⎤ ⎡ ⎤
−8 4 6 −9 9 −15 −6 1 0
= ⎣ 0 10 −2 ⎦ + ⎣ −3 0 6 ⎦ + ⎣ −2 −2 4 ⎦
12 2 −4 −18 −21 6 −3 1 −1
⎡ ⎤ ⎡ ⎤
(−8) + (−9) + (−6) 4+9+1 6 + (−15) + 0 −23 14 −9
= ⎣ 0 + (−3) + (−2) 10 + 0 + (−2) (−2) + 6 + 4 ⎦ = ⎣ −5 8 8 ⎦
12 + (−18) + (−3) 2 + (−21) + 1 (−4) + 6 + (−1) −9 −18 1
⎡ ⎤ ⎡ ⎤ ⎡ ⎤ ⎡ ⎤
−4 2 3 3 −3 5 −4 0 6 3 1 6
(i) ⎣ 0 5 −1 ⎦ + ⎣ 1 0 −2 ⎦ = ⎣ 2 5 1 ⎦ + ⎣ −3 0 7 ⎦
6 1 −2 6 7 −2 3 −1 −2 5 −2 −2
⎡ ⎤ ⎡ ⎤
((−4) + 3) (0 + 1) (6 + 6) −1 1 12
= ⎣ (2 + (−3)) (5 + 0) (1 + 7) ⎦ = ⎣ −1 5 8 ⎦
(3 + 5) ((−1) + (−2)) ((−2) + (−2)) 8 −3 −4
(l) Impossible. Since C is a 2 × 2 matrix, both C and 2C are 2 × 2. Also, since F is a 3 × 2 matrix,
−3F is 3 × 2. Thus, 2C and −3F have different sizes. However, in order to add matrices, they
must be the same size.
⎡ ⎤ ⎡ ⎤
10 2 −3 3 1 6
(n) (B − A) = ⎣ −3 −3 −2 ⎦ and E = ⎣ −3 0 7 ⎦.
−3 −3 3 5 −2 −2
⎡ ⎤ ⎡ ⎤
13 3 3 ¡ ¢ 13 −6 2

Thus (B − A) + E = ⎣ −6 −3 5 ⎦, and so (B − A) + E = ⎣ 3 −3 −5 ⎦.
2 −5 1 3 5 1
(2) For a matrix to be square, it must have the same number of rows as columns. A matrix X is diagonal
if and only if it is square and  = 0 for  6= . A matrix X is upper triangular if and only if it is
square and  = 0 for   . A matrix X is lower triangular if and only if it is square and  = 0
for   . A matrix X is symmetric if and only if it is square and  =  for all  . A matrix X is
skew-symmetric if and only if it is square and  = − for all  . Notice that this implies that if
X is skew-symmetric, then  = 0 for all . Finally, the transpose of an  ×  matrix X is the  × 
matrix whose ( )th entry is  . We now check each matrix in turn.
A is a 3 × 2 matrix, so is not square. Therefore it can not be diagonal, upper triangular, lower
∙ ¸
 −1 0 6
triangular, symmetric, or skew-symmetric. Finally, A = .
4 1 0

Copyright ° 10
B is a 2 × 2 matrix, and so is square. Because 12 = 21 = 0, B is diagonal, upper triangular, lower
triangular, and symmetric. B is not skew-symmetric because 11 6= 0. Finally, B = B.
C is a 2 × 2 matrix, and so is square. Because 12 6= 0, C is neither diagonal, nor lower triangular.
Because 21 6= 0, C is not upper triangular. C is not symmetric because 12 6= 21 . C is not skew-
∙ ¸
−1 −1
symmetric because 11 6= 0. Finally, C = .
1 1
D is a 3 × 1 matrix, so is not square. Therefore it can not be diagonal, upper triangular, lower
£ ¤
triangular, symmetric, or skew-symmetric. Finally, D = −1 4 2 .
E is a 3 × 3 matrix, and so is square. Because 13 6= 0, E is neither diagonal, nor lower triangular.
Because 31 6= 0, E is not upper triangular. E is not symmetric because 31 6= 13 . E is not skew-
⎡ ⎤
0 0 −6
symmetric because 22 6= 0. Finally, E = ⎣ 0 −6 0 ⎦.
6 0 0
F is a 4 × 4 matrix, and so is square. Because 14 6= 0, F is neither diagonal, nor lower triangular.
Because 41 6= 0, F is not upper triangular. F is symmetric because  =  for every  . F is not
skew-symmetric because 32 6= −23 . Finally, F = F.
G is a 3 × 3 matrix, and so is square. Because  = 0 whenever  6= , G is diagonal, lower triangular,
upper triangular, and symmetric. G is not skew-symmetric because 11 6= 0. Finally, G = G.
H is a 4 × 4 matrix, and so is square. Because 14 6= 0, H is neither diagonal, nor lower triangular.
Because 41 6= 0, H is not upper triangular. H is not symmetric because 12 6= 21 . H is skew-
symmetric because  = − for every  . Finally, H = −H.
J is a 4 × 4 matrix, and so is square. Because 12 6= 0, J is neither diagonal, nor lower triangular.
Because 21 6= 0, J is not upper triangular. J is symmetric because  =  for every  . J is not
skew-symmetric because 32 6= −23 . Finally, J = J.
K is a 4 × 4 matrix, and so is square. Because 14 6= 0, K is neither diagonal, nor lower triangular.
Because 41 6= 0, K is not upper triangular. K is not symmetric because 12 6= 21 . K is not skew-
⎡ ⎤
1 −2 −3 −4
⎢ 2 1 −5 −6 ⎥
symmetric because 11 6= 0. Finally, K = ⎢
⎣ 3
⎥.
5 1 −7 ⎦
4 6 7 1
L is a 3 × 3 matrix, and so is square. Because 13 6= 0, L is neither diagonal, nor lower triangular.
Because  = 0 whenever ̇  , L is upper triangular. L is not symmetric because 31 6= 13 . L is not
⎡ ⎤
1 0 0
skew-symmetric because 11 6= 0 (or because 21 6= −12 ). Finally, L = ⎣ 1 1 0 ⎦.
1 1 1
M is a 3 × 3 matrix, and so is square. Because 31 6= 0, M is neither diagonal, nor upper triangular.
Because  = 0 whenever ̇  , M is lower triangular. M is not symmetric because 31 6= 13 .
⎡ ⎤
0 1 1
M is not skew-symmetric because 31 6= −13 . Finally, M = ⎣ 0 0 1 ⎦.
0 0 0
N is a 3 × 3 matrix, and so is square. Because  = 0 whenever  6= , N is diagonal, lower triangular,
upper triangular, and symmetric. N is not skew-symmetric because 11 6= 0. Finally, N = N = I3 .

Copyright ° 11
P is a 2 × 2 matrix, and so is square. Because 12 6= 0, P is neither diagonal, nor lower triangular.
Because 21 6= 0, P is not upper triangular. P is symmetric because 12 = 21 . P is not skew-symmetric
because 12 6= −21 . Finally, P = P.
Q is a 3 × 3 matrix, and so is square. Because 31 6= 0, Q is neither diagonal, nor upper triangular.
Because  = 0 whenever ̇  , Q is lower triangular. Q is not symmetric because 31 6= 13 . Q is
⎡ ⎤
−2 4 −1
not skew-symmetric because 11 6= 0 (or because 31 6= −13 ). Finally, Q = ⎣ 0 0 2 ⎦.
0 0 3
R is a 3 × 2 matrix, so is not square. Therefore it can not be diagonal, upper triangular, lower
∙ ¸
6 3 −1
triangular, symmetric, or skew-symmetric. Finally, R = .
2 −2 0
(3) Just after Theorem 1.15 in the textbook, the desired decomposition is described as A = S + V, where
S = 12 (A + A ) is symmetric and V = 12 (A − A ) is skew-symmetric.
⎛⎡ ⎤ ⎡ ⎤⎞
3 −1 4 3 0 1
(a) S = 12 (A + A ) = 12 ⎝⎣ 0 2 5 ⎦ + ⎣ −1 2 −3 ⎦⎠
1 −3 2 4 5 2
⎛⎡ ⎤⎞
(3 + 3) ((−1) + 0) (4 + 1)
= 12 ⎝⎣ (0 + (−1)) (2 + 2) (5 + (−3)) ⎦⎠
(1 + 4) ((−3) + 5) (2 + 2)
⎡ ⎤
⎡ ⎤ ⎡ 1 (6) 1 (−1) 1 (5) ⎤ 3 − 12 25
6 −1 5 2 2 2
⎢ ⎥ ⎢ ⎢
⎥
= 12 ⎣ −1 4 2 ⎦ = ⎣ 12 (−1) 1
2 (4)
1
2 (2) ⎦ = ⎣ − 2
1
2 1 ⎥⎦,
5 2 4 1 1 1
2 (5) 2 (2) 2 (4)
5
2 1 2
which is symmetric, since  =  for all  .
⎛⎡ ⎤ ⎡ ⎤⎞
3 −1 4 3 0 1
V = 12 (A − A ) = 12 ⎝⎣ 0 2 5 ⎦ − ⎣ −1 2 −3 ⎦⎠
1 −3 2 4 5 2
⎛⎡ ⎤⎞
(3 − 3) ((−1) − 0) (4 − 1)
= 12 ⎝⎣ (0 − (−1)) (2 − 2) (5 − (−3)) ⎦⎠
(1 − 4) ((−3) − 5) (2 − 2)
⎡ ⎤
⎡ ⎤ ⎡ 1 (0) 1 (−1) 1 (3) ⎤ 0 − 12 23
0 −1 3 2 2 2
⎢ ⎥ ⎢ ⎢
⎥
= 12 ⎣ 1 0 8 ⎦ = ⎣ 12 (1) 1
2 (0)
1
2 (8) ⎦ = ⎣
1
2 0 4 ⎥⎦,
−3 −8 0 1 1 1
2 (−3) 2 (−8) 2 (0) − 32 −4 0
which is skew-symmetric, since  = − for all  .
⎡ ⎤ ⎡ ⎤
3 − 12 25 0 − 12 23
⎢ ⎥ ⎢ ⎥
Note that S + V = ⎢ ⎣ −2
1
2 1 ⎥ ⎦+⎣
⎢ 1
2 0 4 ⎥⎦
5 3
2 1 2 − 2 −4 0

Copyright ° 12
⎡ ¡ 1 ¡ 1 ¢¢ ¡ 5 3 ¢ ⎤ ⎡ ⎤
(3 + 0) −2 + −2 2 + 2 3 −1 4
⎢ ¡ ¢ ⎥
= ⎣ − 12 + 12 (2 + 0) (1 + 4) ⎦ = ⎣ 0 2 5 ⎦ = A.
¡ 5 ¡ 3 ¢¢ 1 −3 2
2 + −2 (1 + (−4)) (2 + 0)
(5) (d) The matrix (call it A) must be a square zero matrix; that is, O , for some . First, since A is
diagonal, it must be square (by definition of a diagonal matrix). To prove that  = 0 for all  ,
we consider two cases: First, if  6= , then  = 0 since A is diagonal. Second, if  = , then
 =  = 0 since A is skew-symmetric ( = − for all , implying  = 0 for all ). Hence,
every entry  = 0, and so A is a zero matrix.
(10) (a) Part (1): Let B = A and C = (A ) . Then  =  =  . Since this is true for all  and ,
we have C = A; that is, (A ) = A.
(b) Part (2), Subtraction Case: Let D = A − B, F = (A − B) and G = A − B . Then  =  =
 −  =  . Since this is true for all  and , we have F = G; that is, (A − B) = A − B .
(c) Part (3): Let B = (A ), D = A and F = (A) . Then  =  =  =  . Since this is
true for all  and , we have F = B; that is, (A) = (A ).
(13) (a) Trace (B) = 11 + 22 = 2 + (−1) = 1, trace (C) = 11 + 22 = (−1) + 1 = 0,
trace (E) = 11 + 22 + 33 = 0 + (−6) + 0 = −6, trace (F) = 11 + 22 + 33 + 44
= 1+0+0+1 = 2, trace (G) = 11 +22 +33 = 6+6+6 = 18, trace (H) = 11 +22 +33 +44 =
0+0+0+0 = 0, trace (J) = 11 +22 +33 +44 = 0+0+1+0 = 1, trace (K) = 11 +22 +33 +44
= 1 + 1 + 1 + 1 = 4, trace (L) = 11 + 22 + 33 = 1 + 1 + 1 = 3, trace (M) = 11 + 22 + 33 =
0 + 0 + 0 = 0, trace (N) = 11 + 22 + 33 = 1 + 1 + 1 = 3, trace (P) = 11 + 22 = 0 + 0 = 0,
trace (Q) = 11 + 22 + 33 = (−2) + 0 + 3 = 1.
(c) Not necessarily true when   1. Consider matrices L and N in Exercise 2. From part (a) of this
exercise, trace(L) = 3 = trace(N). However, L 6= N.
(14) (a) False. The main diagonal entries of a 5 × 6 matrix A are 11 , 22 , 33 , 44 , and 55 . Thus, there
are 5 entries on the main diagonal. (There is no entry 66 because there is no 6th row.)
(b) True. Suppose A is lower triangular. Then  = 0 whenever   . If B = A , then  =  = 0,
if   , and so B is upper triangular.
(c) False. The square zero matrix O is both skew-symmetric and diagonal.
(d) True. This follows from the definition of a skew-symmetric matrix.
¡ ¡ ¢¢ ³ ¡ ¢ ´ ³ ³¡ ¢ ´´

(e) True.  A + B =  A + B (by part (3) of Theorem 1.13) =  A + B
¡ ¢
(by part (2) of Theorem 1.13) =  A + B (by part (1) of Theorem 1.13) = A + B (by part
(5) of Theorem 1.12) = B + A (by part (1) of Theorem 1.12).
Section 1.5
⎡ ⎤⎡ ⎤
−5 3 6 −2 3
(1) (b) BA = ⎣ 3 8 0 ⎦ ⎣ 6 5 ⎦
−2 0 4 1 −4
⎡ ⎤ ⎡ ⎤
((−5) (−2) + (3) (6) + (6) (1)) ((−5) (3) + (3) (5) + (6) (−4)) 34 −24
= ⎣ ((3) (−2) + (8) (6) + (0) (1)) ((3) (3) + (8) (5) + (0) (−4)) ⎦ = ⎣ 42 49 ⎦
((−2) (−2) + (0) (6) + (4) (1)) ((−2) (3) + (0) (5) + (4) (−4)) 8 −22

Copyright ° 13
(c) Impossible; (number of columns of J) = 1 6= 2 = (number of rows of M)

⎡ ⎤
£ ¤ 8
(e) RJ = −3 6 −2 ⎣ −1 ⎦ = [(−3) (8) + (6) (−1) + (−2) (4)] = [−38]
4
⎡ ⎤ ⎡ ⎤ ⎡ ⎤
8 £ ¤ (8) (−3) (8) (6) (8) (−2) −24 48 −16
(f) JR = ⎣ −1 ⎦ −3 6 −2 = ⎣ (−1) (−3) (−1) (6) (−1) (−2) ⎦ = ⎣ 3 −6 2 ⎦
4 (4) (−3) (4) (6) (4) (−2) −12 24 −8
(g) Impossible; (number of columns of R) = 3 6= 1 = (number of rows of T)
(j) Impossible; (number of columns of F) = 2 6= 4 = (number of rows of F)
⎡ ⎤2
1 1 0 1
⎢ 1 0 1 0 ⎥
(l) E3 = E(E2 ). Let W = E2 = ⎢ ⎣ 0
⎥ . Then
0 0 1 ⎦
1 0 1 0
= (1) (1) + (1) (1) + (0) (0) + (1) (1) = 3
11
12
= (1) (1) + (1) (0) + (0) (0) + (1) (0) = 1
13
= (1) (0) + (1) (1) + (0) (0) + (1) (1) = 2
14
= (1) (1) + (1) (0) + (0) (1) + (1) (0) = 1
21
= (1) (1) + (0) (1) + (1) (0) + (0) (1) = 1
22
= (1) (1) + (0) (0) + (1) (0) + (0) (0) = 1
23
= (1) (0) + (0) (1) + (1) (0) + (0) (1) = 0
24
= (1) (1) + (0) (0) + (1) (1) + (0) (0) = 2
31
= (0) (1) + (0) (1) + (0) (0) + (1) (1) = 1
32
= (0) (1) + (0) (0) + (0) (0) + (1) (0) = 0
33
= (0) (0) + (0) (1) + (0) (0) + (1) (1) = 1
34
= (0) (1) + (0) (0) + (0) (1) + (1) (0) = 0
41
= (1) (1) + (0) (1) + (1) (0) + (0) (1) = 1
42
= (1) (1) + (0) (0) + (1) (0) + (0) (0) = 1
43
= (1) (0) + (0) (1) + (1) (0) + (0) (1) = 0
44
= (1) (1) + (0) (0) + (1) (1) + (0) (0) = 2
⎡ ⎤⎡ ⎤
1 1 0 1 3 1 2 1
⎢ 1 0 1 0 ⎥⎢ 1 1 0 2 ⎥
Let Y = E = EE = EW = ⎢
3 2
⎣ 0 0 0 1 ⎦⎣ 1
⎥⎢ ⎥. So,
0 1 0 ⎦
1 0 1 0 1 1 0 2
11 = (1) (3) + (1) (1) + (0) (1) + (1) (1) = 5
12 = (1) (1) + (1) (1) + (0) (0) + (1) (1) = 3
13 = (1) (2) + (1) (0) + (0) (1) + (1) (0) = 2
14 = (1) (1) + (1) (2) + (0) (0) + (1) (2) = 5
21 = (1) (3) + (0) (1) + (1) (1) + (0) (1) = 4
22 = (1) (1) + (0) (1) + (1) (0) + (0) (1) = 1
23 = (1) (2) + (0) (0) + (1) (1) + (0) (0) = 3
24 = (1) (1) + (0) (2) + (1) (0) + (0) (2) = 1
31 = (0) (3) + (0) (1) + (0) (1) + (1) (1) = 1
32 = (0) (1) + (0) (1) + (0) (0) + (1) (1) = 1
33 = (0) (2) + (0) (0) + (0) (1) + (1) (0) = 0
34 = (0) (1) + (0) (2) + (0) (0) + (1) (2) = 2

Copyright ° 14
41= (1) (3) + (0) (1) + (1) (1) + (0) (1) = 4

42= (1) (1) + (0) (1) + (1) (0) + (0) (1) = 1
43= (1) (2) + (0) (0) + (1) (1) + (0) (0) = 3
44= (1) (1) + (0) (2) + (1) (0) + (0) (2) = 1
⎡ ⎤
5 3 2 5
⎢ 4 1 3 1 ⎥
Hence, E3 = Y = ⎢ ⎣ 1 1 0 2 ⎦.
⎥
4 1 3 1
⎛⎡ ⎤ ⎞
9 −3 ∙ ¸
⎜⎢ 5 −4 ⎥ 2 1 −5 ⎟
(n) D(FK) = D ⎜ ⎢
⎝⎣ 2
⎥ ⎟
0 ⎦ 0 2 7 ⎠
8 −3
⎡ ⎤
((9) (2) + (−3) (0)) ((9) (1) + (−3) (2)) ((9) (−5) + (−3) (7))
⎢ ((5) (2) + (−4) (0)) ((5) (1) + (−4) (2)) ((5) (−5) + (−4) (7)) ⎥
= D⎢⎣ ((2) (2) + (0) (0))
⎥
⎦
((2) (1) + (0) (2)) ((2) (−5) + (0) (7))
((8) (2) + (−3) (0)) ((8) (1) + (−3) (2)) ((8) (−5) + (−3) (7))
⎡ ⎤
⎡ ⎤ 18 3 −66
−1 4 3 7 ⎢
10 −3 −53 ⎥
=⎣ 2 1 7 5 ⎦⎢ ⎣ 4
⎥ = Z. Then,
2 −10 ⎦
0 5 5 −2
16 2 −61
11
= (−1) (18) + (4) (10) + (3) (4) + (7) (16) = 146
12
= (−1) (3) + (4) (−3) + (3) (2) + (7) (2) = 5
13
= (−1) (−66) + (4) (−53) + (3) (−10) + (7) (−61) = −603
21
= (2) (18) + (1) (10) + (7) (4) + (5) (16) = 154
22
= (2) (3) + (1) (−3) + (7) (2) + (5) (2) = 27
23
= (2) (−66) + (1) (−53) + (7) (−10) + (5) (−61) = −560
31
= (0) (18) + (5) (10) + (5) (4) + (−2) (16) = 38
32
= (0) (3) + (5) (−3) + (5) (2) + (−2) (2) = −9
33
= (0) (−66) + (5) (−53) + (5) (−10) + (−2) (−61) = −193
⎡ ⎤
146 5 −603
Hence, D(FK) = Z = ⎣ 154 27 −560 ⎦.
38 −9 −193
∙ ¸∙ ¸ ∙ ¸
10 9 7 −1 ((10) (7) + (9) (11)) ((10) (−1) + (9) (3))
(2) (a) No. LM = =
8 7 11 3 ((8) (7) + (7) (11)) ((8) (−1) + (7) (3))
∙ ¸ ∙ ¸∙ ¸
169 17 7 −1 10 9
= , but ML =
133 13 11 3 8 7
∙ ¸ ∙ ¸
((7) (10) + (−1) (8)) ((7) (9) + (−1) (7)) 62 56
= = . Hence, LM 6= ML.
((11) (10) + (3) (8)) ((11) (9) + (3) (7)) 134 120
(c) No. Since A is a 3 × 2 matrix and K is a 2 × 3 matrix, AK is a 3 × 3 matrix, while KA is a 2 × 2
matrix. Therefore AK can not equal KA, since they are different sizes.
∙ ¸∙ ¸ ∙ ¸ ∙ ¸
0 0 3 −1 ((0) (3) + (0) (4)) ((0) (−1) + (0) (7)) 0 0
(d) Yes. NP = = = .
0 0 4 7 ((0) (3) + (0) (4)) ((0) (−1) + (0) (7)) 0 0

Copyright ° 15
∙ ¸∙ ¸ ∙ ¸ ∙ ¸
3 −1 0 0 ((3) (0) + (−1) (0)) ((3) (0) + (−1) (0)) 0 0
Also, PN = = = .
4 7 0 0 ((4) (0) + (7) (0)) ((4) (0) + (7) (0)) 0 0
Hence, NP = PN, and so N and P commute.
⎡ ⎤
£ ¤ 5 1 0
(3) (a) (2nd row of BG) = (2nd row of B)G = 3 8 0 ⎣ 0 −2 −1 ⎦. The entries obtained from
1 0 3
this are:
1st column entry = ((3) (5) + (8) (0) + (0) (1)) = 15,
2nd column entry = ((3) (1) + (8) (−2) + (0) (0)) = −13,
3rd column entry = ((3) (0) + (8) (−1) + (0) (3)) = −8.
Hence, (2nd row of BG) = [15 −13 −8].
⎤ ⎡
1
£ ¤⎢ 1 ⎥
(c) (1st column of SE) = S(1st column of E) = 6 −4 3 2 ⎢ ⎥
⎣ 0 ⎦
1
= [(6) (1) + (−4) (1) + (3) (0) + (2) (1)] = [4]
(4) (a) Valid, by Theorem 1.16, part (1).
(b) Invalid. The equation claims that all pairs of matrices that can be multiplied in both orders
commute. However, parts (a) and (c) of Exercise 2 illustrate two different pairs of matrices that
do not commute (see above).
(c) Valid, by Theorem 1.16, part (1).
(d) Valid, by Theorem 1.16, part (2).
(e) Valid, by Theorem 1.18.
(f) Invalid. For a counterexample, consider the matrices L and M from∙ Exercises ¸ ∙1 through 3.
¸
10 9 62 56
Using our computation of ML from Exercise 2(a), above, L(ML) =
8 7 134 120
∙ ¸ ∙ ¸
((10) (62) + (9) (134)) ((10) (56) + (9) (120)) 1826 1640
= = ,
((8) (62) + (7) (134)) ((8) (56) + (7) (120)) 1434 1288
µ∙ ¸∙ ¸¶
2 10 9 10 9
but L M = (LL)M = M
8 7 8 7
∙ ¸ ∙ ¸∙ ¸
((10) (10) + (9) (8)) ((10) (9) + (9) (7)) 172 153 7 −1
= M=
((8) (10) + (7) (8)) ((8) (9) + (7) (7)) 136 121 11 3
∙ ¸ ∙ ¸
((172) (7) + (153) (11)) ((172) (−1) + (153) (3)) 2887 287
= = .
((136) (7) + (121) (11)) ((136) (−1) + (121) (3)) 2283 227
(g) Valid, by Theorem 1.16, part (3).
(h) Valid, by Theorem 1.16, part (2).
(i) Invalid. For a counterexample, consider the matrices A and K from Exercises 1 through 3. Note
that A is a 3 × 2 matrix and K is a 2 × 3 matrix. Therefore, AK is a 3 × 3 matrix. Hence,
(AK) is a 3 × 3 matrix. However, A is a 2 × 3 matrix and K is a 3 × 2 matrix. Thus, A K
is a 2 × 2 matrix, and so can not equal (AK) .
The equation is also false in general for square matrices, where it is not the sizes of the matrices

Copyright ° 16
∙ ¸ ∙ ¸
1 1 1 −1
that cause the problem. For example, let A = , and let K = . Then,
0 0 0 0
µ∙ ¸∙ ¸¶ ∙ ¸
 1 1 1 −1 ((1) (1) + (1) (0)) ((1) (−1) + (1) (0))
(AK) = =
0 0 0 0 ((0) (1) + (0) (0)) ((0) (−1) + (0) (0))
∙ ¸ ∙ ¸ ∙ ¸∙ ¸
1 −1 1 0 1 0 1 0
= = , while A K =
0 0 −1 0 1 0 −1 0
∙ ¸ ∙ ¸
((1) (1) + (0) (−1)) ((1) (0) + (0) (0)) 1 0
= = .
((1) (1) + (0) (−1)) ((1) (0) + (0) (0)) 1 0
However, there are some rare instances for which the equation is true, such as when A = K, or
when either A or K equals I . Another example for which the equation holds is for A = G and
K = H, where G and H are the matrices used in Exercises 1, 2, and 3.
(j) Valid, by Theorem 1.16, part (3), and Theorem 1.18.
(5) To find the total in salaries paid by Outlet 1, we must compute the total amount paid to executives, the
total amount paid to salespersons, and the total amount paid to others, and then add these amounts.
But each of these totals is found by multiplying the number of that type of employee working at Outlet
1 by the salary for that type of employee. Hence, the total salary paid at Outlet 1 is
(3) (30000) + (7) (22500) + (8) (15000) = |367500

{z } .
| {z } | {z } | {z }
Executives Salesp ersons Others Salary Total
Note that this is the (1 1) entry obtained when multiplying the two given matrices. A similar analysis
shows that multiplying the two given matrices gives all the desired salary and fringe benefit totals. In
particular, if
⎡ ⎤
3 7 8 ⎡ ⎤
⎢ 2 4 5 ⎥ 30000 7500
W=⎢ ⎥⎣
⎣ 6 14 18 ⎦ 22500 4500 , then
⎦
15000 3000
3 6 9
11 = (3) (30000) + (7) (22500) + (8) (15000) = 367500
12 = (3) (7500) + (7) (4500) + (8) (3000) = 78000
21 = (2) (30000) + (4) (22500) + (5) (15000) = 225000
22 = (2) (7500) + (4) (4500) + (5) (3000) = 48000
31 = (6) (30000) + (14) (22500) + (18) (15000) = 765000
32 = (6) (7500) + (14) (4500) + (18) (3000) = 162000
41 = (3) (30000) + (6) (22500) + (9) (15000) = 360000
42 = (3) (7500) + (6) (4500) + (9) (3000) = 76500
Salary Fringe Benefits
⎡ ⎤
Outlet 1 $367500 $78000
Outlet 2 ⎢ $225000 $48000 ⎥
Hence, we have: W = ⎢ ⎥.
Outlet 3 ⎣ $765000 $162000 ⎦
Outlet 4 $360000 $76500
(7) To compute the tonnage of a particular chemical applied to a given field, for each type of fertilizer we
must multiply the percent concentration of the chemical in the fertilizer by the number of tons of that
fertilizer applied to the given field. After this is done for each fertilizer type, we add these results to

Copyright ° 17
get the total tonnage of the chemical that was applied. For example, to compute the number of tons
of potash applied to field 2, we compute
005
|{z} · 2
|{z} + 005
|{z} · 1
|{z}
% Potash in Fert. 1 Tons of Fert. 1 % Potash in Fert. 2 Tons of Fert. 2
+ 020
|{z} · 1
|{z} = 035
|{z} 
% Potash in Fert. 3 Tons of Fert. 3 Tons of Potash
Note that this is the dot product (3rd column of A)·(2nd column of B). Since this is the dot product
of two columns, it is not in the form of an entry of a matrix product. To turn this into a form that
looks like an entry of a matrix product, we consider the transpose of A , and express it as (3rd row of
A )·(2nd column of B). Thus, this is the (3 2) entry of A B. A similar analysis shows that computing
all of the entries of A B produces all of the information requested in the problem. Hence, to solve the
problem, we compute
⎡ ⎤⎡ ⎤
010 025 000 5 2 4
Y = A B = ⎣ 010 005 010 ⎦ ⎣ 2 1 1 ⎦ 
005 005 020 3 1 3
Solving for each entry produces
11 = (010) (5) + (025) (2) + (000) (3) = 100
12 = (010) (2) + (025) (1) + (000) (1) = 045
13 = (010) (4) + (025) (1) + (000) (3) = 065
21 = (010) (5) + (005) (2) + (010) (3) = 090
22 = (010) (2) + (005) (1) + (010) (1) = 035
23 = (010) (4) + (005) (1) + (010) (3) = 075
31 = (005) (5) + (005) (2) + (020) (3) = 095
32 = (005) (2) + (005) (1) + (020) (1) = 035
33 = (005) (4) + (005) (1) + (020) (3) = 085
Field 1 Field 2 Field 3
⎡ ⎤
Nitrogen 100 045 065
Hence, Y = Phosphate ⎣ 090 035 075 ⎦(in tons).
Potash 095 035 085
∙ ¸ ∙ ¸∙ ¸
1 1 1 1 1 1
(9) (a) An example: A = . Note that A2 =
0 −1 0 −1 0 −1
∙ ¸
((1) (1) + (1) (0)) ((1) (1) + (1) (−1))
= = I2 .
((0) (1) + (−1) (0)) ((0) (1) + (−1) (−1))
⎡ ⎤ ⎡ ⎤⎡ ⎤
1 1 0 1 1 0 1 1 0
(b) One example: Suppose A = ⎣ 0 −1 0 ⎦. Let W = A2 = ⎣ 0 −1 0 ⎦ ⎣ 0 −1 0 ⎦.
0 0 1 0 0 1 0 0 1
Computing each entry yields
11 = (1) (1) + (1) (0) + (0) (0) = 1
12 = (1) (1) + (1) (−1) + (0) (0) = 0
13 = (1) (0) + (1) (0) + (0) (1) = 0
21 = (0) (1) + (−1) (0) + (0) (0) = 0
22 = (0) (1) + (−1) (−1) + (0) (0) = 1

Copyright ° 18
23 = (0) (0) + (−1) (0) + (0) (1) = 0

31 = (0) (1) + (0) (0) + (1) (0) = 0
32 = (0) (1) + (0) (−1) + (1) (0) = 0
33 = (0) (0) + (0) (0) + (1) (1) = 1
Hence, A2 = W = I3 .
⎡ ⎤ ⎡ ⎤⎡ ⎤
0 0 1 0 0 1 0 0 1
(c) Consider A = ⎣ 1 0 0 ⎦. Let Y = A2 = ⎣ 1 0 0 ⎦ ⎣ 1 0 0 ⎦. First, we compute each
0 1 0 0 1 0 0 1 0
entry of Y.
11= (0) (0) + (0) (1) + (1) (0) = 0
12= (0) (0) + (0) (0) + (1) (1) = 1
13= (0) (1) + (0) (0) + (1) (0) = 0
21= (1) (0) + (0) (1) + (0) (0) = 0
22= (1) (0) + (0) (0) + (0) (1) = 0
23= (1) (1) + (0) (0) + (0) (0) = 1
31= (0) (0) + (1) (1) + (0) (0) = 1
32= (0) (0) + (1) (0) + (0) (1) = 0
33= (0) (1) + (1) (0) + (0) (0) = 0
⎡ ⎤ ⎡ ⎤⎡ ⎤
0 1 0 0 1 0 0 0 1
And so Y = A2 = ⎣ 0 0 1 ⎦. Hence, A3 = A2 A = YA = ⎣ 0 0 1 ⎦ ⎣ 1 0 0 ⎦.
1 0 0 1 0 0 0 1 0
Letting this product equal Z, we compute each entry as follows:
11 = (0) (0) + (1) (1) + (0) (0) = 1
12 = (0) (0) + (1) (0) + (0) (1) = 0
13 = (0) (1) + (1) (0) + (0) (0) = 0
21 = (0) (0) + (0) (1) + (1) (0) = 0
22 = (0) (0) + (0) (0) + (1) (1) = 1
23 = (0) (1) + (0) (0) + (1) (0) = 0
31 = (1) (0) + (0) (1) + (0) (0) = 0
32 = (1) (0) + (0) (0) + (0) (1) = 0
33 = (1) (1) + (0) (0) + (0) (0) = 1
Therefore, A3 = Z = I3 .
(10) (a) This is the dot product of the 3rd row of A with the 4th column of B. Hence, the result is the
3rd row, 4th column entry of AB.
(c) This is (2nd column of A)·(3rd row of B) = (3rd row of B)·(2nd column of A) = 3rd row, 2nd
column entry of BA.
P
(11) (a) ((3 2) entry of AB) = (3rd row of A)·(2nd column of B) = =1 3 2
(12) (a) 3v1 − 2v2 + 5v3 = 3[4 7 −2] − 2[−3 −6 5] + 5[−9 2 −8]
= [12 21 −6] + [6 12 −10] + [−45 10 −40] = [−27 43 −56]
⎡ ⎤ ⎡ ⎤ ⎡ ⎤
4 7 −2
(b) 2w1 + 6w2 − 3w3 = 2 ⎣ −3 ⎦ + 6 ⎣ −6 ⎦ − 3 ⎣ 5 ⎦
−9 2 −8

Copyright ° 19
⎡ ⎤ ⎡ ⎤ ⎡ ⎤ ⎡ ⎤
8 42 6 56
= ⎣ −6 ⎦ + ⎣ −36 ⎦ + ⎣ −15 ⎦ = ⎣ −57 ⎦
−18 12 24 18
(15) Several crucial steps in the following proofs rely on Theorem 1.5 for their validity.
(a) Proof of Part (2): The ( ) entry of A(B + C)

= (th row of A)·(th column of (B + C))
= (th row of A)·(th column of B + th column of C)
= (th row of A)·(th column of B)
+ (th row of A)·(th column of C)
= (( ) entry of AB) + (( ) entry of AC)
= ( ) entry of (AB + AC).
(b) Proof of Part (3): The ( ) entry of (A + B)C

= (th row of (A + B))·(th column of C)
= ((th row of A) + (th row of B)) · (th column of C)
= (th row of A)·(th column of C)
+ (th row of B)·(th column of C)
= (( ) entry of AC) + (( ) entry of BC)
= ( ) entry of (AC + BC).
(c) For the first equation in Part (4), the ( ) entry of (AB)
= ((th row of A)·(th column of B))
= ((th row of A))·(th column of B)
= (th row of A)·(th column of B)
= ( ) entry of (A)B.
Similarly, the ( ) entry of (AB)
= ((th row of A)·(th column of B))
= (th row of A)·((th column of B))
= (th row of A)·(th column of B)
= ( ) entry of A(B).
(20) (a) Proof of Part (1): We use induction on the variable . Base Step: A+0 = A = A I = A A0 .
Inductive Step: Assume A+ = A A for some  ≥ 0. We must prove A+(+1) = A A+1 . But
A+(+1) = A(+)+1 = A+ A = (A A )A (by the inductive hypothesis) = A (A A) = A A+1 .
(b) Proof of Part (2): Again, we use induction on the variable . Base Step: (A )0 = I = A0 = A0 .
Inductive Step: Assume (A ) = A for some integer  ≥ 0. We must prove (A )+1 = A(+1) .
But (A )+1 = (A ) A (by definition) = A A (by the inductive hypothesis) = A+ (by part
(1)) = A(+1) . Finally, reversing the roles of  and  in the proof above shows that (A ) = A ,
which equals A .
∙ ¸ ∙ ¸∙ ¸
1 0 1 0 1 0
(29) (a) Consider any matrix A of the form . Then A2 =
 0  0  0
∙ ¸ ∙ ¸
((1) (1) + (0) ()) ((1) (0) + (0) (0)) 1 0
= = A. So, for example, is idempotent.
(() (1) + (0) ()) (() (0) + (0) (0)) 1 0

Copyright ° 20
⎡ ⎤ ⎡ ⎤
∙ ¸ 1 −2 ∙ ¸ 1 −2
1 2 −1 1 2 −1 ⎣
(30) (b) Consider A = and B = ⎣ 0 1 ⎦ . Then AB = 0 1 ⎦
2 4 −2 2 4 −2
1 0 1 0
∙ ¸
((1) (1) + (2) (0) + (−1) (1)) ((1) (−2) + (2) (1) + (−1) (0))
= = O2 .
((2) (1) + (4) (0) + (−2) (1)) ((2) (−2) + (4) (1) + (−2) (0))
(31) A 2 × 2 matrix A that commutes with every other 2 × 2 matrix must have the form A = I2 . To prove
∙ ¸
0 1
this, note that if A commutes with every other 2×2 matrix, then AB = BA, where B = . But
0 0
∙ ¸∙ ¸ ∙ ¸ ∙ ¸
11 12 0 1 ((11 ) (0) + (12 ) (0)) ((11 ) (1) + (12 ) (0)) 0 11
AB = = = and
21 22 0 0 ((21 ) (0) + (22 ) (0)) ((21 ) (1) + (22 ) (0)) 0 21
∙ ¸∙ ¸ ∙ ¸ ∙ ¸
0 1 11 12 ((0) (11 ) + (1) (21 )) ((0) (12 ) + (1) (22 )) 21 22
BA = = = .
0 0 21 22 ((0) (11 ) + (0) (21 )) ((0) (12 ) + (0) (22 )) 0 0
∙ ¸
 12
Setting these equal shows that 21 = 0 and 11 = 22 . Let  = 11 = 22 . Then A = .
0 
∙ ¸ ∙ ¸∙ ¸
0 0  12 0 0
Let D = . Then AD =
1 0 0  1 0
∙ ¸ ∙ ¸ ∙ ¸∙ ¸
(() (0) + (12 ) (1)) (() (0) + (12 ) (0)) 12 0 0 0  12
= = and DA =
((0) (0) + () (1)) ((0) (0) + () (0))  0 1 0 0 
∙ ¸ ∙ ¸
((0) () + (0) (0)) ((0) (12 ) + (0) ()) 0 0
= = .
((1) () + (0) (0)) ((1) (12 ) + (0) ())  12
Setting AD = DA shows that 12 = 0, and so A = I2 .

Finally, we must show that I2 actually does commute with every 2 × 2 matrix. If M is a 2 × 2 matrix,
then (I2 )M = (I2 M) = M. Similarly, M(I2 ) = (MI2 ) = M. Hence I2 commutes with M.
(32) (a) True. This is a “boxed” result given in the section.
(b) True. D (A + B) = DA+DB (by part (2) of Theorem 1.16) = DB+DA (by part (1) of Theorem
1.12)
(c) True. This is part (4) of Theorem 1.16.
∙ ¸ ∙ ¸ ∙ ¸∙ ¸
1 1 1 −2 1 1 1 −2
(d) False. Let D = , and let E = . Now, DE =
0 −1 0 1 0 −1 0 1
∙ ¸ ∙ ¸
((1) (1) + (1) (0)) ((1) (−2) + (1) (1)) 1 −1
= = . Hence,
((0) (1) + (−1) (0)) ((0) (−2) + (−1) (1)) 0 −1
∙ ¸∙ ¸ ∙ ¸
2 1 −1 1 −1 ((1) (1) + (−1) (0)) ((1) (−1) + (−1) (−1))
(DE) = = = I2 .
0 −1 0 −1 ((0) (1) + (−1) (0)) ((0) (−1) + (−1) (−1))
∙ ¸∙ ¸ ∙ ¸
1 1 1 1 ((1) (1) + (1) (0)) ((1) (1) + (1) (−1))
But, D2 = = = I2 . Also,
0 −1 0 −1 ((0) (1) + (−1) (0)) ((0) (1) + (−1) (−1))
∙ ¸∙ ¸ ∙ ¸ ∙ ¸
1 −2 1 −2 ((1) (1) + (−2) (0)) ((1) (−2) + (−2) (1)) 1 −4
E2 = = = .
0 1 0 1 ((0) (1) + (1) (0)) ((0) (−2) + (1) (1)) 0 1
Hence, D2 E2 = I2 E2 = E2 6= I2 . Thus, (DE)2 6= D2 E2 . The problem here is that D and E do

Copyright ° 21
Student Manual for Andrilli and Hecker - Elementary Linear Algebra, 5th edition Chapter 1 Review
not commute. For, if they did, we would have (DE)2 = (DE) (DE) = D(ED)E = D(DE)E =
(DD)(EE) = D2 E2 .
(e) False. See the answer for part (i) of Exercise 4 for a counterexample. We know from Theorem
1.18 that (DE) = E D . So if D and E do not commute, then (DE) 6= D E .
(f) False. See the answer for part (b) of Exercise 30 for a counterexample. DE = O whenever every
row of D is orthogonal to every column of E, but neither matrix is forced to be zero for DE = O
to be true. ∙ ¸ ∙ ¸ ∙ ¸
1 −1 1 0 2 −1
(g) False. Consider A =  Then A =  and AA =  while
∙ ¸ 0 1 −1 1 −1 1
1 −1
A A =  Thus, AA 6= A A in this case.
−1 2
Chapter 1 Review Exercises

q¡ ¢ ¡ ¢2 ¡ ¢2 q 1 q √
1 2 394
(2) kxk = 4 + − 35 + 34 = 16 9
+ 25 9
+ 16 394
= 16·25 = 20 ≈ 099247.
h i
x 5
Thus, u = kxk = √394  − √12
394
 √15
394
≈ [02481 −05955 07444]. This is slightly longer than x
because we have divided x by a scalar with absolute value less than 1, which amounts to multiplying
x by a scalar having absolute value greater than 1.
1
(4) We will use Newton’s Second Law which µ states that¶ f = a, or equivalently, a =  f . For the force
³ ³ ´´ ³ ´
[617−6]
f1 , a1 = 17 133 k[617−6]k = 19 √ 2[617−6] = 19 [617−6]
√
361
= [6 17 −6]. Similarly, for the
6 +172 +(−6)2
³ ³ ´´ µ ¶ ³ ´
[−8−48]
force f2 , a2 = 17 168 k[−8−48]k = 24 √ [−8−48]
2 2 2
= 24 [−8−48]
√
144
= [−16 −8 16]. Hence,
(−8) +(−4) +8
a = a1 + a2 = [6 17 −6] + [−16 −8 16] = [−10 9 10], in m sec2 .
³ ´ ³ ´ ¡ −69 ¢
x·y −69
(6) The angle  = cos−1 kxkkyk ≈ cos−1 (1005)(949) ≈ cos−1 9534 ≈ cos−1 (−07237) ≈ 136◦ .
³ ³ ´´ ³ ³ ´´ µ µ ¶¶ µ µ ¶¶
[15−8] [−724] [15−8] [−724]
(8) Work = f · d = 34 k[15−8]k · 75 k[−724]k = 34 √ · 75 √ =
152 +(−8)2 (−7)2 +242
³ ³ ´´ ³ ³ ´´
34 [15−8]
17 · 75 [−724]
25 = (2 [15 −8])·(3 [−7 24]) = [30 −16]·[−21 72] = (30)(−21)+(−16)(72)
= −1782 joules.
(10) First, x 6= 0, or else projx y is not defined. Also, y 6= 0, since that would imply³ proj´x y = ³y. Now,
´
x·y x·x
assume x k y. Then, there is a scalar  6= 0 such that y = x. Hence, projx y = kxk 2 x = kxk 2 x
³ 2
´
= kxk
kxk2
x = x = y, contradicting the assumption that y 6= projx y.
⎤⎡
∙ ¸
3 5 ∙ ¸ ∙ ¸
5 −2 −1 5 −2 −1 3 −2 −4
(11) (a) 3A − 4C = 3 − 4 ⎣ −2 4 ⎦ = 3 −4
3 −1 4 3 −1 4 5 4 3
∙ ¸ ∙ −4¸ 3∙ ¸
15 −6 −3 12 −8 −16 3 2 13
= − = ;
9 −3 12 20 16 12 −11 −19 0
⎡ ⎤
∙ ¸ 2 −3 −1
5 −2 −1 ⎣
AB = −4 5 −2 ⎦
3 −1 4
3 −4 3

Copyright ° 22
∙ ¸
(5)(2) + (−2)(−4) + (−1)(3) (5)(−3) + (−2)(5) + (−1)(−4) (5)(−1) + (−2)(−2) + (−1)(3)
=
(3)(2) + (−1)(−4) + (4)(3) (3)(−3) + (−1)(5) + (4)(−4) (3)(−1) + (−1)(−2) + (4)(3)
∙ ¸
15 −21 −4
= ;
22 −30 11
BA is not defined because B has 3 columns, which does not match the number of rows of A,
which is 2;
⎡ ⎤
∙ ¸ 3 5
5 −2 −1 ⎣
AC = −2 4 ⎦
3 −1 4
−4 3
∙ ¸ ∙ ¸
(5)(3) + (−2)(−2) + (−1)(−4) (5)(5) + (−2)(4) + (−1)(3) 23 14
= = ;
(3)(3) + (−1)(−2) + (4)(−4) (3)(5) + (−1)(4) + (4)(3) −5 23
⎡ ⎤
3 5 ∙ ¸
5 −2 −1
CA = ⎣ −2 4 ⎦
3 −1 4
−4 3
⎡ ⎤ ⎡ ⎤
(3)(5) + (5)(3) (3)(−2) + (5)(−1) (3)(−1) + (5)(4) 30 −11 17
= ⎣ (−2)(5) + (4)(3) (−2)(−2) + (4)(−1) (−2)(−1) + (4)(4) ⎦ = ⎣ 2 0 18 ⎦;
(−4)(5) + (3)(3) (−4)(−2) + (3)(−1) (−4)(−1) + (3)(4) −11 5 16
A3 is not defined. (Powers of matrices are only defined for square matrices.);
⎤⎡ ⎛⎡ ⎤⎞
2 −3 −1 2 −3 −1
B3 = (B2 )(B). Now B2 = ⎝⎣ −4 5 −2 ⎦ ⎣ −4 5 −2 ⎦⎠ . Thus,
3 −4 3 3 −4 3
(1 1) entry of B2 = (2)(2) + (−3)(−4) + (−1)(3) = 13;
(1 2) entry of B2 = (2)(−3) + (−3)(5) + (−1)(−4) = −17;
(1 3) entry of B2 = (2)(−1) + (−3)(−2) + (−1)(3) = 1;
(2 1) entry of B2 = (−4)(2) + (5)(−4) + (−2)(3) = −34;
(2 2) entry of B2 = (−4)(−3) + (5)(5) + (−2)(−4) = 45;
(2 3) entry of B2 = (−4)(−1) + (5)(−2) + (−2)(3) = −12;
(3 1) entry of B2 = (3)(2) + (−4)(−4) + (3)(3) = 31;
(3 2) entry of B2 = (3)(−3) + (−4)(5) + (3)(−4) = −41;
(3 3) entry of B2 = (3)(−1) + (−4)(−2) + (3)(3) = 14.
⎡ ⎤
13 −17 1
Thus, B2 = ⎣ −34 45 −12 ⎦ . Hence,
31 −41 14
⎡ ⎤⎡ ⎤
13 −17 1 2 −3 −1
B3 = B2 (B) = ⎣ −34 45 −12 ⎦ ⎣ −4 5 −2 ⎦ . Thus,
31 −41 14 3 −4 3
(1 1) entry of B3 = (13)(2) + (−17)(−4) + (1)(3) = 97;
(1 2) entry of B3 = (13)(−3) + (−17)(5) + (1)(−4) = −128;

Copyright ° 23
(1 3) entry of B3 = (13)(−1) + (−17)(−2) + (1)(3) = 24;

(2 1) entry of B3 = (−34)(2) + (45)(−4) + (−12)(3) = −284;
(2 2) entry of B3 = (−34)(−3) + (45)(5) + (−12)(−4) = 375;
(2 3) entry of B3 = (−34)(−1) + (45)(−2) + (−12)(3) = −92;
(3 1) entry of B3 = (31)(2) + (−41)(−4) + (14)(3) = 268;
(3 2) entry of B3 = (31)(−3) + (−41)(5) + (14)(−4) = −354;
(3 3) entry of B3 = (31)(−1) + (−41)(−2) + (14)(3) = 93.
⎡ ⎤
97 −128 24
Hence, B3 = ⎣ −284 375 −92 ⎦ .
268 −354 93
⎡ ⎤
£ ¤ 3 5
(b) Third row of BC = (3rd row of B)C = 3 −4 3 ⎣ −2 4 ⎦
−4 3
= [(3)(3) + (−4)(−2) + (3)(−4) (3)(5) + (−4)(4) + (3)(3)] = [5 8].
¡ ¢
(13) Now, (3(A − B) ) = 3 (A − B) (by part (3) of Theorem 1.13) = 3(A − B) (by part (1) of
Theorem 1.13). Also, −(3(A − B) ) = 3(−1)(A − B ) (parts (2) and (3) of Theorem 1.13) =
3(−1)((−A)−(−B)) (definition of skew-symmetric) = 3(A−B). Hence, (3(A−B) ) = −(3(A−B) ),
and so 3(A − B) is skew-symmetric.
⎡ ⎤
∙ ¸ 5200 4300
20 15
(15) Let A = , the matrix of costs vs. commodities (steel and iron), and B = ⎣ 6300 5100 ⎦,
3 2
4600 4200
the matrix of companies vs. commodities. In order for the units to line up properly for matrix
multiplication, the “commodities” label, the shared unit, must represent the columns of the first
matrix in the product as well as the rows of the second matrix. One way to do this is to compute the
product BA . Now,
⎡ ⎤ ⎡ ⎤
5200 4300 ∙ ¸ (5200)(20) + (4300)(15) (5200)(3) + (4300)(2)
20 3
BA = ⎣ 6300 5100 ⎦ = ⎣ (6300)(20) + (5100)(15) (6300)(3) + (5100)(2) ⎦
15 2
4600 4200 (4600)(20) + (4200)(15) (4600)(3) + (4200)(2)
Price Shipping Cost

⎡ ⎤
Company I $168500 $24200
= Company II ⎣ $202500 $29100 ⎦ .
Company III $155000 $22200
¡ ¢ ¡ ¢
(16) Take the transpose of both sides of A B = B A to get A B = B A , which by The-
orem 1.18 and part (1) of Theorem 1.13 implies that BA = AB. Then, (AB)2 = (AB)(AB) =
A(BA)B = A(AB)B = A2 B2 .
(18) If A 6= O22 , then some row of A, say the th row, is nonzero. Let x = (th row of A). Then,∙ by ¸ Result
1
5 in Section 1.3, either x · [1 0] 6= 0 or x · [0 1] 6= 0. But x · [1 0] is the ( 1) entry of A , and
∙ ¸ ∙ ¸ 0
0 1
x · [0 1] is the ( 1) entry of A . Thus, either at least one of the entries of A is nonzero or
1
∙ ¸ 0
0
at least one of the entries of A is nonzero.
1

Copyright ° 24
(19) (a) Let A and B be  ×  matrices having the properties given in the exercise. Let C = AB. Then
we know that  = 0 for all   ,  = 0 for all   ,  = 0 for all  6= , and that  6= 0 and
 6= 0 for all . We need to prove that  = 0 for all   .PWe use induction on . P
 
Base Step P ( = 1): Let    = 1. Then 0 = 1 = =1  1 = 1 11 + =2  1

= 1 11 + =2  · 0 = 1 11 . Since 11 6= 0, this implies that 1 = 0, completing the Base
Step.
Inductive Step: Assume for  = 1 2      − 1 that  = 0 for all    That is, assume
we have already proved that, for some  ≥ 2, that the first  − 1 columns of A have all
zeros below the main diagonal. To complete the inductive step, we need to prove that the th
column of A has all zeros below the main
P diagonal. That P−1is, we must prove thatP = 0 for all
  . Let   . Then, 0 =  = =1   = =1   +   + =+1  
P−1 P
= =1 0 ·  +   + =+1  · 0 =   . But, since  6= 0, we must have
 = 0, completing the proof.
(20) (a) False. If A is a nonzero matrix, there must exist some  and  such that  6= 0. For this  and
, the ( ) entry of A, which equals  , must be nonzero.
1
(b) True. A nonzero vector x is parallel to the unit vector u = kxk x.
(c) False. For example, [1 4 3] − [2 5 4] = [−1 −1 −1] is a linear combination of [1 4 3] and [2 5 4]
having negative entries.
3
(d) False. By definition, an angle between vectors has a measure from 0 to . But 2  . The
measure of the angle between [1 0] and [0 −1] is 2 .
(e) False. projx y could have the opposite direction from x. For example, if x = [1 0] and y = [−1 1],
then projx y = [−1 0].
(f) True. Apply the Triangle Inequality twice: kx + y + zk = kx + (y + z)k°P≤ kxk° + ky + zk ≤
°  ° P
kxk+kyk+kzk. Note that a proof by induction can be used to prove that ° =1 x ° ≤ =1 kx k
(see Exercise 16 in Section 1.3).
(g) False. Recall that a set {v1      v } of vectors is mutually orthogonal if and only if for every pair
of distinct vectors v , v in the set, v · v = 0. When negating statements involving a universal
quantifier, such as this, the universal quantifier must change to an existential quantifier. The
correct negation is: There is a pair of distinct vectors v , v in {v1      v } such that v · v 6= 0.
(h) False. Disproving a statement involving a universal quantifier typically involves finding a coun-
terexample. To disprove a statement involving an existential quantifier, we must prove its nega-
tion, which is a universally quantified statement. Thus, the negation must be proven in all cases.
For example, to disprove the statement “There is a 2 × 2 matrix A such that AO22 6= O22 ” we
must show that all 2 × 2 matrices A have the property AO22 = O22  It is not enough to provide
just one specific matrix A for which AO22 6= O22 . ∙ ¸
1 1
As a further illustration, consider the following statement: “Let A = . Then there is
1 1
a nonzero 2×2 ∙ matrix B¸such that AB = O22 .” This statement is actually true, since the nonzero
1 1
matrix B = does satisfy AB = O22  Now it is possible to find other matrices, such
−1 −1
as B = I2  for which AB 6= O22 . However, the existence of such possibilities for B does not prove
the original existential statement false. The moral here is that finding a “counterexample” to an
existential statement is not enough to ensure that the statement is false.
∙ ¸ ∙ ¸ ∙ ¸
1 1 2 0 3 1
(i) False. For a counterexample, note that + = (not symmetric).
0 1 2 2 2 3

Copyright ° 25
Another random document with
no related content on Scribd:
Hodeida. Eine arabische Stadt, buntes Leben, Freunde, Bitten
um ein Boot, das sie weiterbringen kann, Wahl der Begleiter und
endlich die Stunde, in der es wieder weitergeht. Hat der Aufenthalt
lange gedauert, zwei Tage, zehn, vierzehn? Weiter, nur
weiter! — — —
Vom niedrigen Sambuk aus sind die flachen Dächer Hodeidas
noch eben zu sehen, dann beim Runden der nächsten Huck
verschwinden auch sie. Nach kurzem Aufenthalt in Hodeida hat von
Möller mit seinen Begleitern einen Sambuk, eines der
Segelfahrzeuge, die dem Verkehr der Anwohner des Roten Meeres
dienen, zur Verfügung gestellt erhalten. Der geringe Tiefgang
ermöglicht ein Fahren unmittelbar unter der Küste, zum Teil
zwischen den vorgelagerten Inseln und Riffen hindurch, wohin selbst
kleine Kanonenboote nicht zu folgen vermögen. Bis Djidda soll die
Fahrt gehen, dann quer durch die Wüste zur Hedschasbahn.
Die Seefahrt ist nicht ganz einfach. Dicht unter der
Wasseroberfläche verborgen liegen zahlreiche Riffe und Klippen.
Noch gefährlicher aber sind die feindlichen, im Roten Meer
kreuzenden Kriegsschiffe, die die Küste ständig unter scharfer
Bewachung halten.
Ohne Zwischenfälle verläuft der Tag. Glühendheiß brennt die
Sonne herunter, ununterbrochen gleitet an Steuerbord die trostlose
Wüstenlandschaft vorbei. Einzelne kleine Inselchen und Korallenriffe
werden umfahren. Nichts zeigt sich auf dem Wasser. Ganz fern nur
verweht der Rauch eines auf die Insel Perim zusteuernden
Dampfers. Die Nacht kommt, erfrischende Brise setzt mit der
Dunkelheit ein. Sie verleiht dem Sambuk gute Fahrt, verlangt aber
auch schärfsten Ausguck nach der Brandung, um ein Auflaufen zu
vermeiden. Mitternacht. Eben wird die Wache übergeben: „Nichts in
Sicht“, als plötzlich aus dem Dunkel ein greller Lichtkegel über das
Wasser schießt. Ein feindliches Bewachungsschiff. Im Nu ist das
Segel herunter, und regungslos, hinter einem Riff verborgen, liegt
der Sambuk. Näher flutet das Licht, zittert bald hierhin, bald dorthin,
gleitet heran. Entdeckt! Sekunden höchster Spannung vergehen,
dann sucht der Lichtkegel wieder weiter, um schließlich ganz zu
erlöschen. Gleichförmig vergehen die Tage. Hie und da streifen an
Land Beduinen bis an die Küste heran. Sie verschwinden aber, als
sie nur ein einheimisches Fahrzeug, das nicht weiter verdächtig ist,
erblicken.
Nur noch fünfzig Meilen trennen die kleine Schar von Konfuda,
als mehrere feindliche Wachschiffe in bedrohliche Nähe kommen.
Mit hoher Fahrt braust eines der niedrigen Kanonenboote bis auf
etwa drei Seemeilen heran, stoppt. Von der Brücke spähen mit
Kiekern und Doppelgläsern bewaffnete Augen nach dem Sambuk,
der ruhig weitergleitet, aber auf alle Fälle gerüstet, dicht unter Land
fährt. Drüben rührt sich nichts; wahrscheinlich ist ihnen das
Fahrzeug nicht verdächtig und daß Araber, für die man sie
augenscheinlich hält, auf ein Signal eingehen, kann nicht erwartet
werden. Vielleicht auch trösten sie sich damit, daß weiter nördlich
andere Kanonenboote stehen. Dort gibt es keine Riffe, die, wie hier,
eine unmittelbare Durchsuchung hindern.
Die gleichen Erwägungen aber sind es, die auf dem Sambuk
angestellt werden, als weit voraus Rauchwolken auftauchen. Die
Sache wird brenzlich. Jetzt heißt es an Land gehen. Südlich Konfuda
landet Kapitänleutnant von Möller am Nachmittag in der Nähe eines
kleinen Küstenplatzes. Dank seiner arabischen Begleitung sind bald
Kamele zur Stelle, auf denen der Weitermarsch angetreten wird.
Drei Tage später, am 28. April, reiten sie ungefährdet in die Stadt
ein, und ebenso heil kommen sie nach einem weiteren Kamelritt, der
sie über vierhundert Kilometer führt, am 16. Mai nach Djidda, dem
Sitze eines türkischen Oberkommandos.
Hier aber scheint die Reise ein Ende finden zu sollen. Schon in
Friedenszeiten sind die in der Umgebung hausenden
Wüstenstämme ihres religiösen Fanatismus wegen berüchtigt. Dazu
kommt noch, daß sie ganz im Solde der Engländer stehen, die sie
mit modernen Handwaffen ausgerüstet haben. Über fünfhundert
Kilometer führt der Weg zur Bahn durch ihr Gebiet. Ohne überaus
starke Deckungsmannschaften, die gerade jetzt nicht abkömmlich
sind, ist das Unternehmen mehr als gefährlich. In überzeugender
Weise versucht der Oberkommandierende von Möller von seinem
Vorhaben abzubringen, hält ihm immer wieder das Tollkühne seiner
Absichten vor. Umsonst ......
Die Kamele stehen bereit, ein arabischer Soldat und ein Basch
Tschausch, die als Führer dienen sollen, warten auf den Befehl zum
Abmarsch. Noch einmal tritt der Kommandeur an von Möller heran.
„Herr Kapitänleutnant, ich habe leider nicht die Macht, Sie an
Ihrem Vorhaben zu hindern, aber bitten kann ich Sie wieder und
wieder, bleiben Sie hier. Sie wissen nicht, wie gefährlich der Weg ist,
den Sie gehen wollen, wie verhetzt die Beduinen, die seit langem
schon nur englisches Gold kennen. Denken Sie an die „Ayesha“-
Leute!“ Eindringlich spricht der türkische Offizier auf den Deutschen
ein, dessen hohe Gestalt ihn weit überragt. Einen Augenblick scheint
es wie ein Zögern über das dunkelbraune, hager gewordene Gesicht
von Möllers zu gehen, dann lächelt er: „Wenn Sie nun wüßten, Ihr
Vaterland braucht Sie, über kurz oder lang kommt es zu einer
großen, vielleicht zur Entscheidungsschlacht, in der jedermann nötig
ist, würden Sie zögern, weil es gefährlich ist?“ Nicht einen
Augenblick besinnt sich der Angeredete. „Ich würde gehen.
Trotzdem möchte ich Sie warnen und bitten, bleiben Sie, tun Sie es
nicht. Freilich, Sie sind ja fest entschlossen! So wünsche ich Ihnen
nur, Ihr Gott möge mit Ihnen sein und Sie glücklich nach dem
ersehnten Ziele geleiten.“
Ein fester Händedruck, dann wendet sich Kapitänleutnant von
Möller an seine Begleiter, die mit ihm so manche Gefahr bestanden
haben und die wie er bereit sind, neue aufzusuchen, um heim, in
den Krieg zu kommen.
Langsam setzt sich der Zug in Bewegung. In gleichmäßigem
Schritt geht es durch die Straßen in die Wüste hinaus, die im
Scheine der untergehenden Sonne blutigrot leuchtet .... Jetzt winden
sie sich zwischen zwei Dünen hindurch, überschreiten den Wadi,
sind draußen .... Kleiner und kleiner werden die Gestalten ...
bläuliche Nebel fallen ein ... ein weißer Burnus leuchtet ... der letzte
Sonnenstrahl blitzt auf einem Gewehrlauf .... Wie Pünktchen noch
sind sie zu erkennen ... dann verschwinden sie dort, wo der gelbe
Sand in die violetten Abendschatten übergeht .. fern ... in der
Wüste ...........
Telegramm des syrischen Armeekorps vom 3. Juni 1916:
Wir haben zu unserem Bedauern erfahren, daß Kapitänleutnant
von Möller und seine Begleiter neun Stunden von Djidda entfernt von
Arabern ermordet wurden.
Verlag August Scherl G. m. b. H., Berlin
Deutsche Taten zur See

Emden-Ayesha. DK ai ep i t ä n bl eeui dt neann t Bücher
Hellmuth
von
von
Mücke. Selbsterlebtes von den
sagenhaften Fahrten des ruhmreichen Schiffes, die abenteuerliche Fahrt des
Verfassers auf See und der gefahrvolle Zug von Hodeida durch die arabische
Wüste. — Als Geschenkwerk in einem geschmackvoll gebundenen Bande
vereinigt. Preis 3 Mark. Jeder Band einzeln: geheftet 1 Mark, gebunden 2
Mark.
Oberheizer Zenne. D„ We ire s b al edteznt e“ . Mann der

Nach
Mitteilungen des
Oberheizers Zenne von Freiherrn Spiegel von und zu
P e c k e l s h e i m , K a p i t ä n l e u t n a n t . In der Seeschlacht am Skagerrak
ging der Kleine Kreuzer „Wiesbaden“ verloren. Der einzig Überlebende erzählt
durch die Feder des Verfassers vom Kriegstagebuch „U 202“ seine
Beobachtungen über die Schlacht bis zum Untergang des Schiffes und seine
Errettung nach 40stündigem Treiben auf den tosenden Wogen. Die schlichte
Schilderung ist in Wahrheit ein Heldensang von deutschem Todesmute. — Mit
vier Abbildungen. — Preis 1 Mark. Gebunden 2 Mark.
Kriegstagebuch „U 202“. KK oa mp imt äannl ed ua tnnt a: n t

Freiherr von
S p i e g e l . Wahrheitsgetreue, glänzende Schilderung unserer geheimnisvollen
Unterseebootswaffe in ihrer gefahrvollen Tätigkeit vor dem Feinde. —
Geheftet 1 Mark. Elegant gebunden 2 Mark.
U-Boote im Eismeer. Unsere U-Boote ziehen

Kreuzerkrieg! Weit über
auf
den
Polarkreis dringen sie vor, über
das Nordkap, bis ins Weiße Meer. Schiff nach Schiff wird versenkt. Fast
übermenschlich ist der Dienst. Ein Sturm nach dem anderen braust über die
kleinen Fahrzeuge hinweg, tausende von Meilen trennen sie von der Heimat,
nirgends ein Stützpunkt. In schwerster See, im Nebel gehen sie auf den
Kreuzerkrieg. Gehetzt und gejagt, zeigen sie sich trotzdem wieder, vernichten
und versenken. Ungezählte Millionen Schaden fügen sie dem Feinde zu. —
Preis 1 Mark. Gebunden 2 Mark.
„V 188“. MKapitänleutnant
e i n e To r p e d o b o o t - K r i e g s f a h r t e n . Der Verfasser,
Callisen, Kommandant eines
Torpedobootes, schildert in diesen wahrheitsgetreuen
Aufzeichnungen seine gefährlichen und abenteuerlichen Erlebnisse im
Seekrieg, seine wechselvollen Fahrten in Nord- und Ostsee, die ihn bis an die
Küste Englands und bis nach Windau führen. — Mit 16 photographischen
Aufnahmen. 1 Mark, gebunden 2 Mark.
Im Torpedoboot gegen England. Ke rrlieebgns

isse
von F r i t z G r a f . I n h a l t : Ausreise — Durchbruch durch feindliche Kreuzer
— Rückkehr von New York — In französischer Gefangenschaft — Flucht und
Ankunft in Kiel — Torpedoboot im Vorpostendienst — Fernunternehmen in der
Nordsee — Beschießung der Ostküste Englands — Eine Fahrt durch
Minenfelder — Fliegerangriff auf Cuxhaven — Die Kreuzerschlacht am 24.
Januar — Wachtdienst im Sund. — Preis 1 M.
Verlag August Scherl G. m. b. H., Berlin
Die neuesten Bücher

Rund um die Erde zur Front. Dv oenm OFt tloü cAh nt ltihnegs . nDie
acherzählt
fesselnde
Geschichte eines Deutschen, dem es
nach zwei mißlungenen Fluchtversuchen endlich glückte, unter schrecklichen Gefahren und
Entbehrungen durch Sibirien in die Mongolei und nach Peking zu entkommen. Von hier aus
gelangte der Flüchtling über Japan, Amerika und Norwegen in die Heimat. — Preis 2 Mark.
Gebunden 3 Mark.
Aus der Hölle empor. Erlebnisse eines

Kriegsgefangenschaft
aus russischer
Ausgetauschten. Vo n
H a n s Z u c h h o l d . Ein in seiner Schlichtheit
ergreifender Bericht über die unsäglichen Leiden, denen unsere verwundeten Kriegsgefangenen in
Rußland preisgegeben sind. — Preis 1 Mark.
Seine Hoheit — der Kohlentrimmer. Die Kriegsheimfahrt

des Herzogs Heinrich
Borwin zu
Mecklenburg. Von J o h a n n z u r P l a s s o w . Der Herzog wird in Amerika vom Ausbruch des
Krieges überrascht. Die Engländer erschweren ihm die Rückkehr durch Aussetzen eines
Fanggeldes von 2000 Pfund. Zahlreiche Spione heften sich dem kostbaren Wild an die Fersen.
Aber mit stählerner Willenskraft kämpft sich der Herzog durch alle Schwierigkeiten und Gefahren
hindurch und gelangt von New York aus als Kohlentrimmer über Kirkwall und Kristiania glücklich in
die Heimat. — Mit vier Aufnahmen. — Preis 1 Mark. Vorzugs-Ausgabe: geheftet 3 Mark, gebunden
4 Mark.
Kriegsgefangen — üNbeeurb aEun. g l aDer

nd e n t f l o h e n ! Von Lt. d. R. R o b e r t
Verfasser, der in französische
Gefangenschaft geraten war, erzählt seine Schicksale in
Feindesland und die ihm mit geradezu indianerhafter List gelungene Flucht. — Preis 1 Mark.
Breslau-Midilli. En ai nc hJ aTa
hr unter türkischer Flagge. Selbsterlebtes
g e b u c h b l ä t t e r n v o n W. W a t h . Das Buch
behandelt die Schicksale unseres Kleinen Kreuzers „Breslau“, der
bei Kriegsbeginn in türkischen Besitz überging. Wir erfahren, in welch hinterlistiger Weise die
englische Marinemisson die osmanische Flotte entwertet hatte, wie unsere deutschen Seeoffiziere
Ordnung schafften, wie tapfer dann unsere blauen Jungens unter der türkischen Flagge fochten und
im Schwarzen Meere dem zahlenmäßig weit überlegenen russischen Feinde schweren Schaden
zufügten. — Mit vier Abbildungen. — Preis 1 Mark.
Sachsen im Felde (Ostfront). Von Georg

Ompteda,
Freiherrn
Rittmeister.
v.
Der
bekannte Romanschriftsteller stellt
seine Landsleute in allen Kriegslagen dar, im Schützengraben, auf einsamer Wacht am Düna-Ufer,
im Stabsquartier, im Unterstand, im Waldgefecht, bei der Attacke, dem einsamen Patrouillenritt und
in fleißiger Etappenarbeit. Die Skizzen erwecken unsere Freude an dem frischen Lebenshumor der
sächsischen Truppen und an der liebenswürdigen Erzählerkunst des Dichter-Rittmeisters. — Preis
1 Mark.
*** END OF THE PROJECT GUTENBERG EBOOK
KAPITÄNLEUTNANT V. MÖLLERS LETZTE FAHRT ***
Updated editions will replace the previous one—the old editions will
be renamed.
Creating the works from print editions not protected by U.S.

copyright law means that no one owns a United States copyright in
these works, so the Foundation (and you!) can copy and distribute it
in the United States without permission and without paying copyright
royalties. Special rules, set forth in the General Terms of Use part of
this license, apply to copying and distributing Project Gutenberg™
electronic works to protect the PROJECT GUTENBERG™ concept
and trademark. Project Gutenberg is a registered trademark, and
may not be used if you charge for an eBook, except by following the
terms of the trademark license, including paying royalties for use of
the Project Gutenberg trademark. If you do not charge anything for
copies of this eBook, complying with the trademark license is very
easy. You may use this eBook for nearly any purpose such as
creation of derivative works, reports, performances and research.
Project Gutenberg eBooks may be modified and printed and given
away—you may do practically ANYTHING in the United States with
eBooks not protected by U.S. copyright law. Redistribution is subject
to the trademark license, especially commercial redistribution.
START: FULL LICENSE

THE FULL PROJECT GUTENBERG LICENSE
PLEASE READ THIS BEFORE YOU DISTRIBUTE OR USE THIS WORK
To protect the Project Gutenberg™ mission of promoting the free

distribution of electronic works, by using or distributing this work (or
any other work associated in any way with the phrase “Project
Gutenberg”), you agree to comply with all the terms of the Full
Project Gutenberg™ License available with this file or online at
www.gutenberg.org/license.
Section 1. General Terms of Use and

Redistributing Project Gutenberg™
electronic works
1.A. By reading or using any part of this Project Gutenberg™
electronic work, you indicate that you have read, understand, agree
to and accept all the terms of this license and intellectual property
(trademark/copyright) agreement. If you do not agree to abide by all
the terms of this agreement, you must cease using and return or
destroy all copies of Project Gutenberg™ electronic works in your
possession. If you paid a fee for obtaining a copy of or access to a
Project Gutenberg™ electronic work and you do not agree to be
bound by the terms of this agreement, you may obtain a refund from
the person or entity to whom you paid the fee as set forth in
paragraph 1.E.8.
1.B. “Project Gutenberg” is a registered trademark. It may only be

used on or associated in any way with an electronic work by people
who agree to be bound by the terms of this agreement. There are a
few things that you can do with most Project Gutenberg™ electronic
works even without complying with the full terms of this agreement.
See paragraph 1.C below. There are a lot of things you can do with
Project Gutenberg™ electronic works if you follow the terms of this
agreement and help preserve free future access to Project
Gutenberg™ electronic works. See paragraph 1.E below.
1.C. The Project Gutenberg Literary Archive Foundation (“the
Foundation” or PGLAF), owns a compilation copyright in the
collection of Project Gutenberg™ electronic works. Nearly all the
individual works in the collection are in the public domain in the
United States. If an individual work is unprotected by copyright law in
the United States and you are located in the United States, we do
not claim a right to prevent you from copying, distributing,
performing, displaying or creating derivative works based on the
work as long as all references to Project Gutenberg are removed. Of
course, we hope that you will support the Project Gutenberg™
mission of promoting free access to electronic works by freely
sharing Project Gutenberg™ works in compliance with the terms of
this agreement for keeping the Project Gutenberg™ name
associated with the work. You can easily comply with the terms of
this agreement by keeping this work in the same format with its
attached full Project Gutenberg™ License when you share it without
charge with others.
1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside the
United States, check the laws of your country in addition to the terms
of this agreement before downloading, copying, displaying,
performing, distributing or creating derivative works based on this
work or any other Project Gutenberg™ work. The Foundation makes
no representations concerning the copyright status of any work in
any country other than the United States.
1.E. Unless you have removed all references to Project Gutenberg:
1.E.1. The following sentence, with active links to, or other

immediate access to, the full Project Gutenberg™ License must
appear prominently whenever any copy of a Project Gutenberg™
work (any work on which the phrase “Project Gutenberg” appears, or
with which the phrase “Project Gutenberg” is associated) is
accessed, displayed, performed, viewed, copied or distributed:
This eBook is for the use of anyone anywhere in the United
States and most other parts of the world at no cost and with
almost no restrictions whatsoever. You may copy it, give it away
or re-use it under the terms of the Project Gutenberg License
included with this eBook or online at www.gutenberg.org. If you
are not located in the United States, you will have to check the
laws of the country where you are located before using this
eBook.
1.E.2. If an individual Project Gutenberg™ electronic work is derived

from texts not protected by U.S. copyright law (does not contain a
notice indicating that it is posted with permission of the copyright
holder), the work can be copied and distributed to anyone in the
United States without paying any fees or charges. If you are
redistributing or providing access to a work with the phrase “Project
Gutenberg” associated with or appearing on the work, you must
comply either with the requirements of paragraphs 1.E.1 through
1.E.7 or obtain permission for the use of the work and the Project
Gutenberg™ trademark as set forth in paragraphs 1.E.8 or 1.E.9.
1.E.3. If an individual Project Gutenberg™ electronic work is posted

with the permission of the copyright holder, your use and distribution
must comply with both paragraphs 1.E.1 through 1.E.7 and any
additional terms imposed by the copyright holder. Additional terms
will be linked to the Project Gutenberg™ License for all works posted
with the permission of the copyright holder found at the beginning of
this work.
1.E.4. Do not unlink or detach or remove the full Project

Gutenberg™ License terms from this work, or any files containing a
part of this work or any other work associated with Project
Gutenberg™.
1.E.5. Do not copy, display, perform, distribute or redistribute this

electronic work, or any part of this electronic work, without
prominently displaying the sentence set forth in paragraph 1.E.1 with
active links or immediate access to the full terms of the Project
Gutenberg™ License.
1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if you
provide access to or distribute copies of a Project Gutenberg™ work
in a format other than “Plain Vanilla ASCII” or other format used in
the official version posted on the official Project Gutenberg™ website
(www.gutenberg.org), you must, at no additional cost, fee or expense
to the user, provide a copy, a means of exporting a copy, or a means
of obtaining a copy upon request, of the work in its original “Plain
Vanilla ASCII” or other form. Any alternate format must include the
full Project Gutenberg™ License as specified in paragraph 1.E.1.
1.E.7. Do not charge a fee for access to, viewing, displaying,

performing, copying or distributing any Project Gutenberg™ works
unless you comply with paragraph 1.E.8 or 1.E.9.
1.E.8. You may charge a reasonable fee for copies of or providing

access to or distributing Project Gutenberg™ electronic works
provided that:
• You pay a royalty fee of 20% of the gross profits you derive from
the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to
the Project Gutenberg Literary Archive Foundation. Royalty
payments must be paid within 60 days following each date on
which you prepare (or are legally required to prepare) your
periodic tax returns. Royalty payments should be clearly marked
as such and sent to the Project Gutenberg Literary Archive
Foundation at the address specified in Section 4, “Information
about donations to the Project Gutenberg Literary Archive
Foundation.”
• You provide a full refund of any money paid by a user who

notifies you in writing (or by e-mail) within 30 days of receipt that
s/he does not agree to the terms of the full Project Gutenberg™
License. You must require such a user to return or destroy all
copies of the works possessed in a physical medium and
discontinue all use of and all access to other copies of Project
Gutenberg™ works.
• You provide, in accordance with paragraph 1.F.3, a full refund of

any money paid for a work or a replacement copy, if a defect in
the electronic work is discovered and reported to you within 90
days of receipt of the work.
• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.
1.E.9. If you wish to charge a fee or distribute a Project Gutenberg™

electronic work or group of works on different terms than are set
forth in this agreement, you must obtain permission in writing from
the Project Gutenberg Literary Archive Foundation, the manager of
the Project Gutenberg™ trademark. Contact the Foundation as set
forth in Section 3 below.
1.F.
1.F.1. Project Gutenberg volunteers and employees expend

considerable effort to identify, do copyright research on, transcribe
and proofread works not protected by U.S. copyright law in creating
the Project Gutenberg™ collection. Despite these efforts, Project
Gutenberg™ electronic works, and the medium on which they may
be stored, may contain “Defects,” such as, but not limited to,
incomplete, inaccurate or corrupt data, transcription errors, a
copyright or other intellectual property infringement, a defective or
damaged disk or other medium, a computer virus, or computer
codes that damage or cannot be read by your equipment.
1.F.2. LIMITED WARRANTY, DISCLAIMER OF DAMAGES - Except

for the “Right of Replacement or Refund” described in paragraph
1.F.3, the Project Gutenberg Literary Archive Foundation, the owner
of the Project Gutenberg™ trademark, and any other party
distributing a Project Gutenberg™ electronic work under this
agreement, disclaim all liability to you for damages, costs and
expenses, including legal fees. YOU AGREE THAT YOU HAVE NO
REMEDIES FOR NEGLIGENCE, STRICT LIABILITY, BREACH OF
WARRANTY OR BREACH OF CONTRACT EXCEPT THOSE
PROVIDED IN PARAGRAPH 1.F.3. YOU AGREE THAT THE
FOUNDATION, THE TRADEMARK OWNER, AND ANY
DISTRIBUTOR UNDER THIS AGREEMENT WILL NOT BE LIABLE
TO YOU FOR ACTUAL, DIRECT, INDIRECT, CONSEQUENTIAL,
PUNITIVE OR INCIDENTAL DAMAGES EVEN IF YOU GIVE
NOTICE OF THE POSSIBILITY OF SUCH DAMAGE.
1.F.3. LIMITED RIGHT OF REPLACEMENT OR REFUND - If you

discover a defect in this electronic work within 90 days of receiving it,
you can receive a refund of the money (if any) you paid for it by
sending a written explanation to the person you received the work
from. If you received the work on a physical medium, you must
return the medium with your written explanation. The person or entity
that provided you with the defective work may elect to provide a
replacement copy in lieu of a refund. If you received the work
electronically, the person or entity providing it to you may choose to
give you a second opportunity to receive the work electronically in
lieu of a refund. 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.

Elementary Linear Algebra 5Th Student Solutions Manual 5Th Edition Andrilli Hecker Full Chapter

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Elementary Linear Algebra 5Th Student Solutions Manual 5Th Edition Andrilli Hecker Full Chapter

Uploaded by

Copyright:

Available Formats

Elementary Linear Algebra 5th Student

Solutions Manual 5th Edition Andrilli

To all the students who have used

Chapter 1 Solutions ……………………………………....1

The solutions presented are generally self-contained,

We hope you find these solutions helpful. You can

Solutions to Selected Exercises

c 2016 Elsevier Ltd. All rights reserved.

(7) (a) 3[−2 4 5] = [3(−2) 3(4) 3(5)] = [−6 12 15]

c 2016 Elsevier Ltd. All rights reserved.

c 2016 Elsevier Ltd. All rights reserved.

(22) In each part, let x = [1  2       ], y = [1  2       ], and  ∈ R.

c 2016 Elsevier Ltd. All rights reserved.

x·y [−43]·[6−1] (−4)(6)+(3)(−1) −27

(4) When a force f moves an object by a displacement d, the work performed is f · d.

(6) In all parts, let x = [1  2       ]  y = [1  2       ]  and z = [1  2       ] 

(a) x · y = [1  2       ] · [1  2       ] = 1 1 + · · · +   = 1 1 + · · · +   =

c 2016 Elsevier Ltd. All rights reserved.

c 2016 Elsevier Ltd. All rights reserved.

(23) (a) Note that projx y = [ 85  − 65  2] = 25 x and y − projx y = [ 75  − 24

c 2016 Elsevier Ltd. All rights reserved.

kx + yk2 = (x + y) · (x + y) by part (2) of Theorem 1.5

Taking the square root of both sides yields kx + yk ≥ kyk. √

c 2016 Elsevier Ltd. All rights reserved.

c 2016 Elsevier Ltd. All rights reserved.

c 2016 Elsevier Ltd. All rights reserved.

c 2016 Elsevier Ltd. All rights reserved.

c 2016 Elsevier Ltd. All rights reserved.

c 2016 Elsevier Ltd. All rights reserved.

(c) Impossible; (number of columns of J) = 1 6= 2 = (number of rows of M)

c 2016 Elsevier Ltd. All rights reserved.

41= (1) (3) + (0) (1) + (1) (1) + (0) (1) = 4

c 2016 Elsevier Ltd. All rights reserved.

c 2016 Elsevier Ltd. All rights reserved.

(3) (30000) + (7) (22500) + (8) (15000) = |367500

c 2016 Elsevier Ltd. All rights reserved.

c 2016 Elsevier Ltd. All rights reserved.

23 = (0) (0) + (−1) (0) + (0) (1) = 0

c 2016 Elsevier Ltd. All rights reserved.

(a) Proof of Part (2): The ( ) entry of A(B + C)

(b) Proof of Part (3): The ( ) entry of (A + B)C

c 2016 Elsevier Ltd. All rights reserved.

Setting AD = DA shows that 12 = 0, and so A = I2 .

c 2016 Elsevier Ltd. All rights reserved.

Chapter 1 Review Exercises

c 2016 Elsevier Ltd. All rights reserved.

c 2016 Elsevier Ltd. All rights reserved.

(1 3) entry of B3 = (13)(−1) + (−17)(−2) + (1)(3) = 24;

Price Shipping Cost

c 2016 Elsevier Ltd. All rights reserved.

c 2016 Elsevier Ltd. All rights reserved.

Deutsche Taten zur See

Oberheizer Zenne. D„ We ire s b al edteznt e“ . Mann der

Kriegstagebuch „U 202“. KK oa mp imt äannl ed ua tnnt a: n t

U-Boote im Eismeer. Unsere U-Boote ziehen

Im Torpedoboot gegen England. Ke rrlieebgns

Die neuesten Bücher

Aus der Hölle empor. Erlebnisse eines

Seine Hoheit — der Kohlentrimmer. Die Kriegsheimfahrt

Kriegsgefangen — üNbeeurb aEun. g l aDer

Sachsen im Felde (Ostfront). Von Georg

Creating the works from print editions not protected by U.S.

START: FULL LICENSE