ha
ha
1. For
3 6
−1 4
u= , v= , w = −1 , x = −2
2 6
−5 3
evaluate the following:
(a) u · u
−1
SOL: Since u = , u · u = (−1)2 + 22 = 5.
2
(b) u · v
4
SOL: Since v = , u · v = 4(-1) + 6(2) = 8.
6
(c) w · w
3
SOL: Since w = −1, w · w = 32 + (−1)2 + (−5)2 = 35.
−5
(d) w · x
6
SOL: Since x = −2, w · x = 3(6) + (-1)(-2) + (-5)3 = 5.
3
1
(e) w·w w
3/35
SOL: −1/35
−1/7
(f) kwk √
SOL: 35
(g) kxk
SOL: 7
10 −1
3. Find the distance between and
−3 −5
√ √
10 −1 2
SOL: Since x = and y = , kx − yk = [10 − (−1)]2 + [−3 − (−5)2 ] = 125 and dist(x,y) = 125 = 5 5.
−3 −5
12 2
(b) 3 and −3 are orthogonal
−5 3
SOL: Since a · b = 12(2) + (3)(-3) + (-5)3 = 0, a and b are orthogonal.
SOL: TO BE GRADED:1/3
6. State the number of rows and columns of matrix
1 2 3
4 5 6
x1 − 3x2 =5
−x1 + x2 + 5x3 = 2
x2 + x3 = 0
SOL: Replace R2 by R2+R1. Then interchange R2 and R3. Next replace R3 by R3+2R2. Then divide R3 by
7. Next replace R2 by R2+(-1)R3. Finally, replace R1 by R1+3R2.
1 −3 0 5 1 −3 0 5 1 −3 0 5 1 −3 0 5 1 −3 0 5
−1 1 5 2 ∼ 0 −2 5 7 ∼ 0 1 1 0 ∼ 0 1 1 0 ∼ 0 1 1 0
0 1 1 0 0 1 1 0 0 −2 5 7 0 0 7 7 0 0 1 1
1 −3 0 5 1 0 0 2
∼ 0 1 0 −1 ∼ 0 1 0 −1
0 0 1 1 0 0 1 1
The solution is (2, -1, 1).
8. Find an equation involving g, h and k that makes this augmented matrix correspond to a consistent system.
1 −4 7 g
0 3 −5 h
−2 5 −9 k
SOL: TO BE GRADED:
1 −4 7 g 1 −4 7 g 1 −4 7 g
0 3 −5 h ∼ 0 3 −5 h ∼ 0 3 −5 h
−2 5 −9 k 0 −3 5 k + 2g 0 0 0 k + 2g + h
Let b denote the number k + 2g + h. Then the third equation represented by the augmented matrix above is 0 = b.
This equation is possible if and only if b is zero. So the original system has a solution if and only if k + 2g + h = 0.
9. Find the elementary row operation that transforms the first matrix into the second, and then find the reverse row
operation that transforms the second matrix into the first.
0 −2 5 1 4 −7
(a) 1 4 −7 , 0 −2 5
3 −1 6 3 −1 6
SOL: Swap R1 and R2. Swap R1 and R2.
1 2 −5 0 1 2 −5 0
(b) 0 1 −3 −2 , 0 1 −3 −2
0 −3 9 5 0 0 0 −1
SOL: Replace R3 by R3+(3)R2. Replace R3 by R3+(-3)R2.
10. Row reduce the matrices below to reduced echelon form. Circle the pivot positions in the final matrix and in the
original matrix, and list the pivot columns.
1 2 3 4
(a) 4 5 6 7
6 7 8 9
SOL: TO BE GRADED:
1 2 3 4 1 2 3 4 1 2 3 4
4 5 6 7 ∼ 0 −3 −6 −9 ∼ 0 1 2 3
6 7 8 9 0 −5 −10 −15 0 −5 −10 −15
1 2 3 4 1 0 −1 −2
∼ 0 1 2 3 ∼ 0 1 2 3
0 0 0 0 0 0 0 0
1 2 3 4
Pivot cols 1 and 2. 4 5 6 7.
6 7 8 9
1 3 5 7
(b) 3 5 7 9
5 7 9 1
SOL:
1 3 5 7 1 3 5 7 1 3 5 7 1 3 5 7
3 5 7 9 ∼ 0 −4 −8 −12 ∼ 0 1 2 3 ∼ 0 1 2 3
5 7 9 1 0 −8 −16 −34 0 −8 −16 −34 0 0 0 −10
1 3 5 7 1 3 5 7 1 0 −1 0
∼ 0 1 2 3 ∼ 0 1 2 0 ∼ 0 1 2 0
0 0 0 1 0 0 0 1 0 0 0 1
1 3 5 7
Pivot cols 1, 2, and 4. 3 5 7 9.
5 7 9 1
11. Find the general solution of the system whose augmented matrix is given.
1 −7 0 6 5
0 0 1 −2 −3
−1 7 −4 2 7
SOL:
1 −7 0 6 5 1 −7 0 6 5 1 −7 0 6 5
0 0 1 −2 −3 ∼ 0 0 1 −2 −3 ∼ 0 0 1 −2 −3
−1 7 −4 2 7 0 0 −4 8 12 0 0 0 0 0
Corresponding system:
x1 − 7x2 + 6x4 = 5
x3 − 2x4 = −3
0=0
SOL:
−7
−3
10
13. Write the solution set of the given homogeneous system in parametric vector form.
x1 + 3x2 + x3 = 0
−4x1 − 9x2 + 2x3 = 0
−3x2 − 6x3 = 0
SOL:
1 3 1 0 1 3 1 0 1 0 −5 0 1 0 −5 0
−4 −9 2 0 ∼ 0 3 6 0 ∼ 0 3 6 0 ∼ 0 1 2 0
0 −3 −6 0 0 −3 −6 0 0 0 0 0 0 0 0 0
x1 − 5x3 = 0
x2 + 2x3 = 0
0 =0
15. Find the value(s) of h for which the vectors are linearly dependent.
1 3 −1
−1 , −5 , 5
4 7 h
SOL: To study the linear dependence of three vectors, say v1 , v2 , v3 , row reduce the augmented matrix v1 v2 v3 0 :
1 3 −1 0 1 3 −1 0 1 3 −1 0
−1 −5 5 0 ∼ 0 −2 4 0 ∼ 0 -2 4 0
0 −3 −6 0 0 −5 h + 4 0 0 0 h−6 0
The equation x1 v1 + x2 v2 + x3 v3 = 0 has a nontrivial solution if and only if h-6 = 0 (which corresponds to x3 being
a free variable). Thus, the vectors are linearly dependent if and only if h = 6.
16. Mark each statement True or False. Justify each answer on the basis of a careful reading of the text.
(a) The columns of a matrix A are linearly independent if the equation Ax = 0 has the trivial solution.
SOL: False. A homogeneous system always has the trivial solution. See the box before Example 2(Section
1.7).
(b) If S is a linearly dependent set, then each vector is a linear combination of the other vectors in S.
SOL: False. See the warning after Theorem 7.
2 3 5
−5 1 −4
17. Given A = −3 −1
, observe that the third column is the sum of the first two columns. Find a nontrivial
−4
1 0 1
solution of Ax = 0.
SOL: Think of A = [a1 a2 a3 ]. The text points out that a3 = a1 + a2 . Rewrite this as a1 + a2 - a3 = 0. As a matrix
equation, Ax = 0 for x = (1, 1, -1).
18. Each statement is either true(in all cases) or false (for at least one example). If false, construct a specific example
to show that the statement is not always true. Such an example is called a counterexample to the statement. If a
statement is true, give a justification. (One specific example cannot explain why a statement is always true.)
(a) If v1 , ..., v4 are in R4 and v3 = 2v1 + v2 , then {v1 , v2 , v3 ,v4 } is linearly dependent.
SOL: True, by Theorem 7.
(c) If v1 , ..., v4 are in R4 and v3 is not a linear combination of v1 , v2 ,v4 , then {v1 , v2 , v3 ,v4 } is linearly indepen-
dent.
SOL: False. Counterexample: Take v1 , v2 and v4 all to be multiples of one vector. Take v3 to be no a multiple
of that vector. For example,
1 2 1 4
1 2 0 4
v1 = 1 , v2 = 2 , v3 = 0 , v4 = 4 .
1 2 0 4
2 0 2 2 1 a
19. Let A = , and define T : R → R by T (x) = Ax. Find the images under T of u = and v = .
0 2 3 b
SOL:
2 0 1 2 2 0 a 2a
T (u) = A(u) = = , T (v) = = .
0 2 3 6 0 2 b 2b
20. Show that the transformation T defined by T (x1 , x2 ) = (2x1 -3x2 , x1 +4, 5x2 ) is not linear.
SOL: One possibility is to show that T does not map the zero vector into zero vector, something that every linear
transformation does do. T (0, 0) = (0, 4, 0)