Linear Algebra With Applications 2nd Edition Holt Solutions Manual 1

Solution Manual for Linear Algebra with Applications
2nd Edition Holt 1464193347 9781464193347

Download full solution manual at:
https://testbankpack.com/p/solution-manual-for-linear-algebra-with-
applications-2nd-edition-holt-1464193347-9781464193347/
Download full test bank at:

https://testbankpack.com/p/test-bank-for-linear-algebra-with-applications-
2nd-edition-holt-1464193347-9781464193347/
Chapter 4
Subspaces
4.1 Practice
Problems [ ]
0
1. (a) Not a subspace. The vector 0 = 0 is not in the set.
0
[ ]
0
(b) Let S be the set of vectors of the form a−b . Letting a = 0 and b = 0, we see that
−2a
[ ] [ ]
0 0
0 ∈ S. Suppose u and v are in S, then u = a1 − b1 and v = a2 − b2 . Thus u + v =
−2a1 −2a2
[ ] [ ] [ ]
0 0 0
a1 − b1 + a2 − b2 = (a1 + a2 ) − (b1 + b2 ) ∈ S. Let r ∈ R and u ∈ S, then ru =
−2a1 −2a2 −2 (a1 + a2 )
[ ] [ ]
0 0
r a1 − b1 = (ra1 ) − (rb1 ) ∈ S, and we conclude that S is a subspace. (Alternatively, we
−2a1 −2 (ra1 )
{[ ] [ ]}
0 0
have S = span 1 , −1 , and thus S is a subspace.).
−2 0
2. (a) We row-reduce
[ ] [ ]
1 3 −2 1 3 −2
3 0 −4
∼ 0 −9 2 .
Thus, Ax = 0 has solutions of the form
4
3
2
x =s 9
1
4
3
2
and, therefore, null (A) = span 9
.
1
(b) We row-reduce
[ ] [ ]
2 1 4 −1 2 1 4 −1
∼ 0 9
−1 7 .
1 5 1 3 2 2
447
448 Section 4.1: Introduction to Subspaces Chapter 4: Subspaces 448

− 19
9
8
9
2 7
x =s 9 +t −9 ,
1 0
0 1
− 199 8
9
and, therefore, null (A) = span

2
− 7
.
,
9 9
1 0
0 1
[ ][ ] [ ]
1 3 3 0
3. (a) Ab = −1
=
0 = 0, so b ∈ ker (T ). We row-reduce to determine a solution of
3 9
Ax = c,
[ ] [ ]
1 3 2 ∼ 1 3 2 .
3 9 5 0 0 −1
So Ax = c has no solution, and c ∈

/ range (T ).
[ ] [ ]
1 −2 [ ] 7
3
(b) Ab = 3 6 = −3 = 0, so b ∈/ ker (T ). We row-reduce to determine a
−2
−2 4 −14
solution of Ax = c, [ ] [ ]
1 −2 2 1 −2 2
3 6 1 ∼ 0 12 −5 .
−2 4 −1 0 0 3
So Ax = c has no solution, and c ∈

/ range (T ).
4. (a) False. ker(T ) is a subset of the domain space.
(b) False. ker(T ) is a subspace of R3 .
(c) False. The trivial subspace {0} contains a single vector.
(d) False. / S C , and S C cannot be a subspace.
If S is a subspace, then 0 ∈ S, so 0 ∈
4.1 Introduction to Subspaces

] [
a
1. Let S be the set of vectors of the form 0 . Letting a = 0 and b = 0, we see that 0 ∈ S. Suppose u
b
[ ] [ ] [ ] [ ] [ ]
a1 a2 a1 a2 a1 + a 2
and v are in S, then u = 0 and v = 0 . Thus u + v = 0 + 0 = 0 ∈ S.
b1 b2 b1 b2 b1 + b2
[ ] [ ]
a1 ra1
Let r ∈ R and u ∈ S, then ru = r 0 = 0 ∈ S, and we conclude that S is a subspace.
b1 rb1
{[ ] [ ]}
1 0
(Alternatively, we have S = span 0 , 0 , and hence S is a subspace.)
0 1
[ ]
a
2. Let S be the set of vectors of the form a . Letting a = 0, we see that 0 ∈ S. Suppose u and v
0
[ ] [ ] [ ] [ ] [ ]
a b a b a+b
are in S, then u = a and v = b . Thus u + v = a + b = a+b ∈ S. Let r ∈ R
0 0 0 0 0
[ ] [ ]
a ra
and u ∈ S, then ru = r a = ra ∈ S, and we conclude that S is a subspace. (Alternatively,
0 0
{[ ]}
1
we have S = span 1 , and hence S is a subspace.)
0
3. Not a subspace, because 0 + 0 = 1, and thus 0 is not in this set.

[ ]
a
4. Let S be the set of vectors of the form b where a = b = c. Letting a = b = c = 0, we see
c
] [ ] [
a1 a2
that 0 ∈ S. Suppose u and v are in S, then u = b1 and v = b2 , where a1 + b1 + c1 = 0
c1 c2
[ ] [ ] [ ]
a1 a2 a1 + a 2
and a2 + b2 + c2 = 0. Thus u + v = b1 + b2 = b1 + b 2 ∈ S, since (a1 + a2 ) +
c1 c2 c1 + c 2
] 1 + b1 + c1 ) + (a2 + b2 + c2 ) = 0 + 0 = 0. Let r ∈ R and u ∈ S, then

(b1 + b2[) + (c]1 + c[2 ) = (a
a1 ra1
ru = r b1 = rb1 ∈ S, since ra1 + rb1 + rc1 = r (a1 + b1 + c1 ) = r (0) = 0, and we conclude
c1 rc1
that S is a subspace. (Alternatively, we have S = null ([ 1 1 1 ]), and hence S is a subspace.)

5. Not a subspace,since 0 is not in this subset because the second component of 0 is 0 = 1.
a 1 0
a+b 1 1
6. Let S be the set of vectors of the form . Then S = span , , and hence S
2a − b 2 −1
3b 0 3
is a subspace.
[ ] [ ]
1 1 1/2
7. Not a subspace. Let r = and u = . Then u belongs to the set, but ru = does not.
2 0 1/2
8. The condition c = b − a is equivalent to a − b + c = 0, and therefore we see that this subset is equal to
null {[ 1 −1 1 ]}, which is a subspace.
[ ] [ ]
1 0
9. Not a subspace. Let u = 0 and v = 1 . Then both u and v belong to the subset, but
0 1
[ ]
1
u+v = 1 does not, since 1(1)(1) = 1 = 0.
1
[ ] [ ]
1 2
10. Not a subspace. Let r = 2 and u = 0 . Then u is in the subset, but ru = 0 is not, since
22 + 02 = 4 > 1.
[ ] [ ]
1 −1
11. Not a subspace. Let r = −1 and u = 0 . Then u is in the subset, but ru = 0 is not.
0 0
[ ] [ ] [ ]
1 0 1
12. Not a subspace. Let u = 0 and v = 1 . Then u and v are in the subset, but u + v = 1
0 0 0
is not.
[ ] [ ]
1 −1
13. Not a subspace. Let r = −1 and u = 2 . Then u is in the subset since 1 ≤ 2, but ru = −2 is
not, since −1 −2.
[ ] [ ]
1 and v = 1 . Then u and v are in the subset since | − 1 | = |1|, but
14. Not a subspace. Let u = −1 1
[ ]
2
u+v = is not.
0
15. This subset is equal to null ([ 1 ··· 1 ]), which is a subspace.
16. This subset is equal to null ([ 1 −1 −1 ···

−1 ]), which is a subspace.
1 1
[ ]
a
17. It would not be closed under scalar multiplication, since there is a vector , where 0 < a, which is
0
[ ] [ ]
a ra
in the set, but r 0 = 0 would not be in the set for r sufficiently large. One might also note
[ ] [ ] [ ]
b b 2b
that b
and
−b
are in the set, but the sum 0 is not, for b sufficiently large.
[ ]
18. It would not be closed under scalar multiplication, since there is a vector a , where 0 < a, which is
0
[ ] [ ]
a ra
in the set, but r 0 = 0 would not be in the set for r sufficiently large.
[ ] [ ]
19. It would not be closed under vector addition. For example, 1 and 0 are in the region, but
0 −1
[ ]
1
the sum −1 is not.
[ ]
20. It would not be closed under scalar multiplication, since there is a vector a , where 0 < a, which is
0
[ ] [ ]
a ra
in the set, but r = would not be in the set for r sufficiently large.
0 0
21. We row reduce [ ] [ ]
1 −3 ∼ 1 0 .
0 1 0 1
[ ] {[ ]}
0 0
Thus Ax = 0 has the trivial solution x = 0 , and thus null (A) = 0 .

3 5 ∼ 1 0 .
6 4 0 1
[ ] {[ ]}
0 0
23. A is row-reduced, and we see that Ax = 0 has solutions of the form

[ ]
5
x = s −2 ,
1
{[ ]}
5
and thus null (A) = span −2 .
1

1 2 −2 1 0 −10
0 1 4
∼ .
0 1 4
Thus Ax = 0 has solutions of the form [ ]

10
x=s −4 ,
1
{[ ]}
10
and therefore null (A) = span −4 .
1
25. We row reduce
[ ] [ ]
1 −2 2 1 0 −4
−2 5 −7
∼ 0 1 −3 .
Thus Ax = 0 has solutions of the form

[ ]
4
x=s 3 ,
1
{[ ]}
4
and therefore null (A) = span 3 .
1
26. We row reduce
[ ] [ ]
3 0 −4 1 0 − 43
−1 6 2 ∼ 1
.
0 1 9
4
3
x =s − 91 ,
1
4
3
and therefore null (A) = span −9
1 .
1

1 3 1 0
−2 1 ∼ 0 1 .
3 2 0 0
[ ] {[ ]}
0 0

2 −10 1 −5
−3 15 ∼ 0 0 .
1 −5 0 0

5 ,
x=s 1
{[ ]}
5


1 −1 1 1 0 0
0 1 3 ∼ 0 1 0 .
0 0 3 0 0 1
[ ] {[ ]}
0 0

0 0
30. We row reduce [ ]

1 2 0 1 0 1
−3 −4 −1 ∼ 0 1 −21 .
2 −2 3 0 0 0
−1
1
x=s 2 ,
1
−1
and therefore null (A) = span .
1
2
1
1 1 −2 1 1 0 −3 0
0 1 1 −1 ∼ 0 1 1 0 .
0 0 0 2 0 0 0 1

3
−1
x =s 1 ,
0
−1
1
0
32. We row reduce
1 0 0 1 1 0 0 1
0 2 1 0 ∼ 0 1 0 0
0 0 1 0 0 0 1 0 .
1 0 1 1 0 0 0 0

−1
0
x=s ,
0
1
−1
0
0
1
[ ][ ] [ ]
1 −2 2 0
33. Ab = = = 0, so b ∈/ker (T ). We row-reduce to determine a solution of
−3 −1 1 −7
Ax = c, [ ] [ ]
1 −2 4 1 0 18
7
−3 −1 −7 ∼ .
0 1 − 75
[ ]
18
7
Thus A = c, so c ∈ range (T ).
− 57
[ ][ 6 ] [ ]
2 −3 0 0
34. Ab = 4 = = 0, so b ∈ ker (T ). We row-reduce to determine a solution of

1 4 −2 11
0
Ax = c,
[ ] [ ]
2 −3 0 4 1 0 − 11
6
5
∼ .
1 4 −2 13 0 1 − 114 2
[ ]
5
Thus A 2 = c, so c ∈ range (T ).
0
[ ][ ] [ ]
4 −2 −5 −24
35. Ab = 1 3
2
= 1 = 0, so b ∈/ ker (T ). Since the range of T is a subset of R3 , and
2 7 4
c ∈ R2 , c ∈
/ range (T ).
[ ][ ] [ ]
1 2 3 1 0
36. Ab = 4 5 6 −2 = 0 = 0, so b ∈ ker (T ). We row-reduce to determine a solution of

7 8 9 1 0
Ax = c,
[ ] [ ]
1 2 3 2 1 0 −1 0
4 5 6 5 ∼ 0 1 2 1 .
7 8 9 8 0 0 0 0
[ ]
0
0
{[ ] }
x
37. For example, S = y : x> 0 .
{[ ]} {[ ]} [ ]
1 0 1
38. For example S1 = span 0 , S2 = span 1 . But S1 ∪ S2 is not a subspace, since 0
0 [ ]0 0
[ ] 1
0
and 1 are both in S1 ∪ S2 , but the sum 1 does not belong to S1 ∪ S2 , since this vector belongs
0 0
to neither S1 nor S2 .
{[ ] } {[ ] }
x x
39. For example, S1 = 0 : x≥ 0 0 and S2 =

0 : x< 0 , 0
{[ ]}
1
then S1 ∪ S2 = span 0 is a subspace.
0
{[ ] [ ]} {[ ] [ ]} {[ ]}
0 1 0 0 0
40. For example, S1 = 0 , 0 , S2 = 0 , 1 , then S1 ∩S2 = 0 is a subspace.
0 0 0 0 0
[ ] {[ ]}
1 0 1
41. Let T (x) = Ax, where A = 1 0 , then range (T ) = span .
1
[ ] {[ ]}
1 0 1
42. Let T (x) = Ax, where A = −1 0 , then range (T ) = span −1 .
2 0 2
43. Let T (x) = Ax, where A = I3 , then range (T ) = R3 .

[ ] {[ ] [ ]}
3 1 0 3 1
44. Let T (x) = Ax, where A = 1 2 0 , then range (T ) = span 1 , 2 .
4 −2 0 4 −2
45. (a) True. Since A0 = 0 = b, 0 is not a solution to Ax = b, and hence the set of solutions is not a
subspace.
(b) False. For any 5 × 3 matrix A, null(A) is a subspace of R3 , not R5 .
46. (a) True, by Theorem 4.3.
(b) True, by Theorem 4.5.
47. (a) False, because ker(T ) is a subspace of the domain R5 , not the codomainR8 .
(b) False, because range(T ) is a subspace of the codomain R7 , not the domain R2 .
{[ ]} {[ ]}
1 0
(b) False, the union of the subspaces span 0 and span 1 are the coordinate axes for
R2 , which is not a subspace.
49. (a) True. Proof: Let S1 and S2 be two subspaces of Rn . Since 0 must belong to both S1 and S2 ,
0 ∈ S1 ∩ S2 . Now let u and v be two vectors in S1 ∩ S2 . Since u and v are both in S1 , and S1 is
a subspace, u + v ∈ S1 . Likewise, since u and v are both in S2 , and S2 is a subspace, u + v ∈ S2 .
Thus u + v ∈ S1 ∩ S2 . Now let u ∈ S1 ∩ S2 and r ∈ R. Since u ∈ S1 and S1 is a subspace, ru ∈ S1 .
Likewise, since u ∈ S2 and S2 is a subspace, ru ∈ S2 . Thus ru ∈ S1 ∩ S2 , and we conclude that
S1 ∩ S2 is a subspace.
(b) True. Proof: Since S1 and S2 are two subspaces of Rn , 0 must belong to both S1 and S2 , and
hence 0 + 0 = 0 ∈ S. Now let u and v be two vectors in S. Then there exist u1 ∈ S1 and
u2 ∈ S2 with u = u1 + u2 . Likewise, there exist v1 ∈ S1 and v2 ∈ S2 with v = v1 + v2 , and thus
u + v = (u1 + u2 ) + (v1 + v2 ) = (u1 + v1 ) + (u2 + v2 ). Since S1 is a subspace, u1 + v1 ∈ S1 ,
and since S2 is a subspace u2 + v2 ∈ S2 Thus, u + v ∈ S. Now let u ∈ S and r ∈ R. Since u ∈ S
there exist u1 ∈ S1 and u2 ∈ S2 with u = u1 + u2 , and so ru = ru1 + ru2 . Since S1 is a subspace,
ru1 ∈ S1 , and likewise since S2 is a subspace, ru2 ∈ S2 . Hence, ru ∈ S. We conclude that S is a
subspace.
50. (a) True. Proof: Since S1 and S2 are two subspaces of Rn , 0 must belong to both S1 and S2 , and
hence 0 − 0 = 0 ∈ S. Now let u and v be two vectors in S. Then there exist u1 ∈ S1 and
u2 ∈ S2 with u = u1 − u2 . Likewise, there exist v1 ∈ S1 and v2 ∈ S2 with v = v1 − v2 , and thus
u + v = (u1 − u2 ) + (v1 − v2 ) = (u1 + v1 ) − (u2 + v2 ). Since S1 is a subspace, u1 + v1 ∈ S1 ,
and since S2 is a subspace u2 + v2 ∈ S2 Thus, u + v ∈ S. Now let u ∈ S and r ∈ R. Since u ∈ S
there exist u1 ∈ S1 and u2 ∈ S2 with u = u1 − u2 , and so ru = ru1 − ru2 . Since S1 is a subspace,
ru1 ∈ S1 , and likewise since S2 is a subspace, ru2 ∈ S2 . Hence, ru ∈ S. We conclude that S is a
subspace.
(b) False. The set of integers is not closed under scalar multiplication. For example, let r = 1/2, then
r (1) = 1/2 is not an integer.
51. (a) False. If S = {0}, then there exists v ∈ S with v = 0. Since S is a subspace, rv ∈ S for all
scalars r. Each rv is a distinct vector, for if r1 v = r2 v, then (r1 − r2 ) v = 0, and since v = 0 we
must have r1 − r2 = 0, and thus r1 = r2 . Thus, S must contain infinitely many vectors.
(b) True. Every point on the line connecting u and v is of the form (1 − s) u + sv for some scalar s.
Since S is a subspace, both (1 − s) u and sv belong to S, and hence (1 − s) u + sv belongs to S.
52. (a) False. For example, let S1 = {x ∈ R : x < 0} and S2 = {x ∈ R : x ≥ 0}. Then S1 and S2 are
not subspaces, but the union S1 ∪ S2 = R is a subspace.
(b) False . Let S1 = {0, u} and S2 = {0, v} be subsets of Rn , where u and v are distinct non-zero
vectors. Then S1 and S2 are not subspaces, but S1 ∩ S2 = {0} is a subspace.
53. Let S be a subspace of R, with S = {0}. Then there exists x ∈ S with x = 0. Let y ∈ R. Set r = yx ,
( )
then rx = yx x = y, and therefore since S is a subspace, y ∈ S. Since y was arbitrary, it follows that
S = R.
54. Since 0 ∈ S, c0 = 0 ∈ cS. Let u and v be two vectors in cS. Then there exists s1 ∈ S such that
u = cs1 and s2 ∈ S such that v = cs2 . Thus u + v = cs1 + cs2 = c (s1 + s2 ). Now S is a subspace,
so s1 + s2 ∈ S, and hence u + v ∈ S. Next let u ∈ cS and r ∈ R. Then there exists s ∈ S such that
u = cs, and hence ru = r (cs) = c (rs). Because S is a subspace, rs ∈ S, and hence ru ∈ cS. We
conclude that cS is a subspace.
55. Since A0 = 0 = b, 0 does not belong to the set of solutions to Ax = b, and therefore this set is not a
subspace.
56. The subspaces of R2 consist of {0}, R2 , and all lines which contain the origin.
57. The subspaces of R3 consist of {0}, R3 , all lines which contain the origin, and all planes which contain
the origin.
58. Provided there exists some vector v ∈ S, then if condition (c) is satisfied, we may use r = 0 to conclude
that rv = 0v = 0 ∈ S, so condition (a) is satisfied. So we can replace condition (a) by the condition
that S is not empty.
59. Since A0 = 0 = y, 0 does not belong to the set of solutions to Ax = y, and therefore this set is not a
subspace of Rm .
2
−5
60. Since x ∈ null (A), Ax = 0, and thus Ax = [ a1 a2 a3 a4 ] = 2a − 5a + 4a + a = 0.
4 1 2 3 4
1
Hence a4 = −2a1 + 5a2 − 4a3 .
61. Suppose ker (T ) = {0}. Then T (x) = Ax = 0 has the unique solution, x = 0. If A = [ a1 · · · an ],
then c1 a1 + · · · + cn an = Ac = 0 implies c = 0, and thus every ci = 0. Hence the columns of A are
linearly independent. Now suppose the columns of A = [ a1 · · · an ] are linearly independent. If
Ac = c1 a1 + · · · + cn an = 0, then every ci = 0. Thus, c = 0, which shows that T (x) = Ax = 0 has

the unique solution, x = 0. Thus, ker (T ) = {0}.
62. Since T is a linear transformation, we have T (0) = 0, and thus 0 ∈ ker (T ). (See Exercise 55 in Section
3.1.)
63. Since −v = (−1)v and S is closed under both addition and scalar multiplication, it follows that
u + (−1)v is in S and hence u − v is in S.
64. Suppose T is one-to-one, and let T (x) = 0. Since T (0) = 0 also, we must have that x = 0 because
T is one-to-one. Thus, ker (T ) = {0}. Now suppose ker (T ) = {0} and that T (x1 ) = T (x2 ). Since
T is a linear transformation, T (x1 − x2 ) = T (x1 ) − T (x2 ) = 0. Thus x1 − x2 ∈ ker (T ), and since
ker (T ) = {0}, we have x1 − x2 = 0 and hence x1 = x2 . We conclude that T is one-to-one.
65. We solve the linear system
6x1 − 2x2 − x3 = 0 (Carbon atoms)
12x1 − 6x2 = 0 (Hydrogen atoms)
6x1 − x2 − 2x3 = 0 (Oxygen atoms)
The general solution to this system is [ ]

1
x=s 2 ;
2
where s is any real number. The set of solutions is given by
([ ])
1
span 2 .
2

x1 − x3 = 0 (Carbon atoms)
4x1 − 2x4 = 0 (Hydrogen atoms)
2x2 − 2x3 − x4 = 0 (Oxygen atoms)
The general solution to this system is
1
2
x =s 1 ;
2
1
2
span .
1
2

x1 − x3 = 0 (Calcium atoms)
2x1 − x4 = 0 (Oxygen atoms)
2x1 + x2 − 2x4 = 0 (Hydrogen atoms)
x2 − 2x3 = 0 (Chlorine atoms)
1
2
x =s 1 ;
2
1
2
span .
1
2

2x1 − 2x3 = 0 (Carbon atoms)
6x1 − 4x3 − 2x4 = 0 (Hydrogen atoms)
x1 + 2x2 − 2x3 − x4 = 0 (Oxygen atoms)
1
1
x =s 1 ;
1
457 Section 4.2: Basis and Dimension Chapter 4: Subspaces 457

1
1
span .
1
1
69. Using a computer algebra system, we determine
3 − 56
43
7
([ ]) 5
1 7 −2 14 0 − 13 − 56
7
null 3 0 1 −2 3 = span 5 , − 39 .
6 1 −1 0 4 7 56
1 0
0 1

4 5 2
47 185 17
([ ]) − 4
− 12
− 3
−1 0 0 4 5 2
5 19 2
null 6 2 1 2 4 0 −2 − −3
= span , 6 , .
3 2 −5 −1 0 2 1 0 0
0 1 0
0 0 1

3 1 2 4
5 0 2 −1 0
0
null 2 2 2 2 = 0 .
−1 0 3 1
0
0 2 0 4

2 0 5
0
1 6 2
−
0 .
null 4 4 =
−1 0
5 1 0
0
4 1 1
4.2 Practice Problems

1. (a) Row-reduce the matrix with the given vectors as rows,
[ ] [ ]
2 −7 2 −7
∼
6 −14 0 7 .
{[ ] [ ]}
2 0
The basis for S is given by the non-zero row vectors, , , and dim (S) = 2.
−7 7
(b) Row-reduce the matrix with the given vectors as rows,
[ ] [ ]
1 −1 3 1 −1 3
2 1 0 ∼ 0 3 −6 .
−3 1 −4 0 0 1
{[ ] [ ] [ ]}
1 0 0
The basis for S is given by the non-zero row vectors, −1 , 3 , 0 , and dim (S) =
3 −6 1
3.
2. (a) Row-reduce the matrix with the given vectors as columns,

[ ] [ ]
2 6 ∼ 2 6 .
−7 −14 0 7
The basis for S is given by columns 1 and 2 of the original{[ matrix

] [corresponding
]} to the pivot
2 , 6 , and dim (S) = 2.
column of the row-reduced matrix. Thus, our basis for S is −7 −14
(b) Row-reduce the matrix with the given vectors as columns,
[ ] [ ]
1 2 −3 1 2 −3
−1 1 1 ∼ 0 3 −2 .
3 0 −4 0 0 1
The basis for S is given by columns 1, 2, and 3 of the original matrix

{[ corresponding
] [ ] [ to the
]}pivot
1 2 −3
columns of the row-reduced matrix. Thus, our basis for S is −1 , 1 , 1 , and
3 0 −4
dim (S) = 3.
3. (a) The second vector is −1

2 times the first, so we eliminate the second vector and obtain the basis
{[ ]}
2
−6 . The dimension is 1.
(b) The second vector is −2 times the first, and is eliminated as a dependent vector. Because the
remaining
{[ vectors
] [ are
]}not multiples of one another, they are linearly independent, and the basis
1 3
is −2 , −6 . The dimension is 2.
3 8
{[ ] [ ] [ ]}
1 0 −1
4. (a) One extension is 0 , 1 , 2 , as these three vectors are linearly independent.
0 0 1
{[ ] [ ] [ ]}
1 1 −1
(b) One extension is 0 , 2 , −2 , as these three vectors are linearly independent.
0 0 2
5. (a) We row-reduce [ ] [ ]
1 3 −2 1 3 −2
3 0 −4
∼ 0 −9 2 .

4
3
2
x=s 9 .
1
9
4
3
2
Therefore, the null space has basis
1
, and the dimension is 1.

(b) We row-reduce [ ] [ ]
2 1 4 −1 2 1 4 −1
∼ 0 9
−1 7 .
1 5 1 3 2 2
− 199 8
9
2 − 79
x = s1 9 + s2 .
1 0
0 1
− 19 8
9 9
−7
Therefore, the null space has basis 2
, , and the dimension is 2.
9 9
1 0
0 1
6. (a) False. If S = {0} , then dim (S) = 0.
(b) False. If the subspace is non-trivial, then it has a basis, and the dimension is the unique number
of vectors in a basis. If S = {0} , then dim (S) = 0.
(c) True. With a basis of two vectors, the span of a basis forms a plane.
(d) False. If A = [ 0 0 ], then n = 1 < 2 = m, but nullity(A) = 2 1.
4.2 Basis and Dimension

1. Not a basis, since u1 and u2 are not linearly independent. Also, they do not span R2 .
2. A basis, since u1 and u2 are linearly independent and span R2 .
3. Not a basis, since three vectors in a two-dimensional space must be linearly dependent.
4. Not a basis, since three vectors in a two-dimensional space must be linearly dependent. Also, since
{u1 , u3 } is linearly dependent, {u1 , u2 , u3 } must also be linearly dependent.
5. Row-reduce the matrix with the given vectors as rows,
[ ] [ ]
1 −4 1 −4
−5 20 ∼ 0 0
.
{[ ]}
1 .
Thus a basis for S is given by the non-zero row vector, −4
[ ] [ ]
3 5 3 5
−2
∼ .
9 0 −17
{[ ] [ ]}
3 0
Thus a basis for S is given by the non-zero row vectors, 5 , −17 .
[ ] [ ]
1 3 −2 1 3 −2
2 4 1 ∼ 0 −2 5 .
−1 1 −8 0 0 0
{[
Thus a basis for S is given by the non-zero row vectors, ] [ ]}

1 0
3 , −2 .
−2 5

[ ] [ ]
2 −1 3 2 −1 3
4 −1 2 ∼ 0 1 −4 .
2 1 −5 0 0 0
{[ ] [ ]}
2 0
Thus a basis for S is given by the non-zero row vectors, −1 , 1 .
3 −4
[ ] [ ]
1 −2 3 −2 1 −2 3 −2
0 2 −5 1 ∼ 0 2 −5 1 .
2 −2 1 −3 0 0 0 0
1 0
−2 2
Thus a basis for S is given by the non-zero row vectors, , .
3 −5
−2 1
1 0 −1 1 1 0 −1 1
2 1 0 2 0 1 2 0
0 1 2 0 ∼ 0 0 0 0 .
3 1 −1 3 0 0 0 0
1 0
0 1
Thus a basis for S is given by the non-zero row vectors, , .
−1 2
1 0
11. Row-reduce the matrix with the given vectors as columns,
[ ] [ ]
1 4 1 4
3 −12
∼ 0 −24
.
A basis for S is given by columns 1 and 2 of the {[

original
] matrix
[ corresponding
]} to the pivot columns of
1 4
the row-reduced matrix. Hence a basis for S is , .
3 −12

[ ] [ ]
2 −5 2 −5
−6 15
∼ 0 0
.
A basis for S is given by column 1 of the original

{[ matrix corresponding to the pivot column of the
]}
2 .
row-reduced matrix. Hence a basis for S is −6

[ ] [ ]
1 0 3 1 0 3
2 1 −2 ∼ 0 1 −8 .
4 −3 −1 0 0 −37
A basis for S is given by columns 1, 2, and 3 of the {[

original
] matrix
[ ]corresponding
[ ]} to the pivot columns
1 0 3
of the row-reduced matrix. Hence a basis for S is 2 , 1 , −2 .
4 −3 −1

[ ] [ ]
1 3 −1 1 3 −1
2 7 −3 ∼ 0 1 −1 .
3 5 1 0 0 0

original
] matrix
[ ]} corresponding to the pivot columns of
1 3
the row-reduced matrix. Hence a basis for S is 2 , 7 .
3 5

1 2 0 1 2 0
−1 −5 1 0 −3 1
0 9 −3
∼ .
0 0 0
2 7 −1 0 0 0
A basis for S is given by columns 1 and 2 of the original matrix corresponding to the pivot columns of
1 2
−1 −5
the row-reduced matrix. Hence a basis for S is 0 , 9 .
2 7
1 4 2 −1 1 4 2 −1
0 2 1 1 0 2 1 1
∼ .
3 13 6 −2 0 0 1 −1
1 4 3 −2 0 0 0 0
A basis for S is given by columns 1, 2, and 3 of the original matrix corresponding to the pivot columns
1 4 2
0 2 1
of the row-reduced matrix. Hence a basis for S is , , .
3 13 6
1 4 3
−3
17. Since
{[ the]}second vector is 2 times the first, we eliminate the second vector, and obtain the basis
2
−6 . The dimension is 1.
18. Since the vectors are not multiples of each other, they are linearly independent, and a basis is
{[ ] [ ]}
12 −18
, . The dimension is 2.
−3 6
19. The third vector is 3 times the first, and is eliminated as a dependent
{[ ]} vector. Likewise, the second
1
vector is 2 times the first and is eliminated, leaving the basis 1 . The dimension is 1.
1
20. The second vector is −5 times the first, and is eliminated as a dependent vector. Since the re-
maining vectors are not multiples of one another, they are linearly independent, and a basis is
{[ ] [ ]}
1 4
−1 , 3 . The dimension is 2.
1 2
21. The first vector is eliminated, as the zero vector is always linearly dependent. The other vectors are
linearly independent since the corresponding matrix
[ ]
3 2 1
0 1 2
0 0 3
{[ ] [ ] [ ]}
3 2 1
is row-reduced with 3 pivots. Hence a basis is 0 , 1 , 2 . The dimension is 3.
0 0 3
22. The fourth vector is the sum of the first two columns, hence is eliminated as linearly dependent. The re-
1 5 4
2 5 2
maining vectors can be shown to be linearly dependent, and thus our basis is , ,
3 5 2
.
4 5 1
The dimension is 3.
{[ ] [ ]}
1 1
23. One extension is −3 , 0 , as these two vectors are linearly independent.
{[ ] [ ]}
0 1
24. One extension is 4 , 0 , as these two vectors are linearly independent.
{[ ] [ ] [ ]}
1 0 −1
25. One extension is 0 , 1 , 2 , as these three vectors are linearly independent.
0 0 1
{[ ] [ ] [ ]}
1 0 1
26. One extension is 0 , 1 , 0 , as these three vectors are linearly independent.
0 0 5
27. To extend this set, we row-reduce

[ ]
1 2 1 0 0 1 2 1 0 0
3 −1 0 1 0 ∼ 0 −7 −3 1 0
−2 0 0 0 1 0 0 2
7
4
7 1
The extended basis is given by columns 1, 2, and 3 of the original matrix corresponding to the pivot
columns of the row-reduced
{[ ]matrix.
[ ] [ ]}
1 2 1
Hence our basis is 3 , −1 , 0 .
−2 0 0
28. To extend this set, we row-reduce
[ ]
2 3 1 0 0 2 3 1 0 0
1 2 0 1 0 ∼ 0 1
2
− 21 1 0
3 6 0 0 1
0 0 0 −3 1
The extended basis is given by columns 1, 2, and 4 of the original matrix corresponding to the pivot
columns of the row-reduced
{[ ] [matrix.
] [ ]}
2 3 0
Hence our basis is 1 , 2 , 1 .
3 6 0
[ ] [ ]
−2 −5 −2 −5
1 3
∼ 0 − 21
.
[ ] {[ ]}
0 0
Thus Ax = 0 has the trivial solution x = 0 , and thus null (A) = 0 . This subspace has no
basis, and nullity(A) = 0.

2 1 0 2 1 0
∼ 1 .
1 1 1 0 2 1
1
x=s −2 .
1
{[ ]}
1
A basis for the null space is −2 , and nullity(A) = 1.

1
31. The matrix [ ]

1 1 2 1
0 0 1 −3
is row-reduced. Thus Ax = 0 has solutions of the form
−7 −1
0 1
x = s1 + s2 .
3 0
1 0
−7 −1
0 1
A basis for the null space is , , and nullity(A) = 2.
3 0
1 0
32. The matrix [ ]
1 0 −2 1 −1
0 1 0 2 0
0 0 0 1 4
is row-reduced. Thus Ax = 0 has solutions of the form
5 2
8 0
x = s1 0 + s2 1 .
−4 0
1 0
5 2
8 0
A basis for the null space is 0 , 1 , and nullity(A) = 2.
−4 0
1 0
{[ ] [ ] [ ] [ ]}
1 1 0 −1
33. For example, 0 , 1 , 1 , 1 .
1 0 1 0 0
0 1 1 0 0
34. For example, , , . Remove the third vector, and then add and to
0 0 0 1 0
0 0 0 0 1
obtain a basis.
35. For example, take the span of the first m vectors of the n standard basis vectors of Rn .
1 0
0 1
36. For example, S1 = {0}, and S2 = span 0 , 0 .

0 0
0 0
1 0 0 0
0 1 0 0
37. For example, S1 = span , and S = span , .
0 2 1 0
0
0 0 0 1
1 0 0 1 0 0
0 1 0 0 0 0
38. For example, S1 = span 0 , 0 , 1 and S2 = span 0 , 0 , 0 .
0 0 0 0 1 0
0 0 0 0 0 1
[ ] [ ]
1 0
39. For example, u1 = 0 and u2 = 1 .

0 0
40. Let S = span {(1, 3, −2) , (1, 0, 0)} . Because {(1, 3, −2) , (1, 0, 0)} is linearly independent, dim (S) = 2.
41. Let S = span {(−1, 0, 2, 1) , (1, 0, 0, 0) , (0, 1, 0, 0)} . Because
{(−1, 0, 2, 1) , (1, 0, 0, 0) , (0, 1, 0, 0)} is linearly independent, dim (S) = 3.
[ ] [ ] [ ]
1 0 0
42. For example, u1 = 0 , u2 = 1 , and u3 = 0 .
0 0 1
43. (a) False. For example, let s1 = (1, 0) and s2 = (0, 1), then {s1 , s2 } is a basis for S = R2 , but the
vector s1 + s2 = (1, 1) is not a vector in the basis {s1 , s2 }.
(b) True. Because S1 is a proper subspace of S2 and dim (S2 ) = 1, we must have dim (S1 ) = 0. The
only subspace with dimension 0 is {0} .
{[ ]} {[ ]}
1 and S = span 0 . Then each subspace has
44. (a) False. For example, S1 = span 0 2
1
dimension 1, but S1 = S2 .
{[ ] [ ] [ ]}
1 0 1
(b) False. For example, if S = span 0 , 1 , 1 , then dim (S) < 3.
{[ ] [ ] [ ]}
1 , 0 , 1
45. (a) False. For example, if U = 1 , then U spans S = R , but adding additional vectors
2
0 1
will not yield a basis.
{[ ] [ ]}
1 0
(b) False. For example, if U = , , then U is linearly independent and is already a basis for
0 1
S = R2 , so adding additional vectors will not yield a basis.
46. (a) False. If the vectors in U are linearly independent, and thus a basis for S, then the removal of a
vector from U will no longer be a basis.
{[ ]}
1
(b) False. For example, if S = span , then removing the only vector will not leave a basis for
0
S.
47. (a) False. If the three vectors lie in the same plane, then they must be linearly dependent, and cannot
form a basis.
(b) True. If S1 ⊂ S2 and dim (S2 ) = 3, then S1 = S2 . If dim (S2 ) = 4, then S2 = R4 . Hence if
S1 ⊂ S2 then either S1 = S2 or S2 = R4 .
48. (a) False. The set {0} is linearly dependent, and thus cannot be a basis. The subspace {0} does not
have a basis.
{[ ]} {[ ]}
1 0
(b) False. For instance, S1 = span and S 2 = span are different subspaces of dimension
0 1
1 of R2 . (However, if n = 1 then the unique subspaces of dimension 0 and 1 are {0} and R.)
{[ ] [ ] [ ]}
1 2 3
49. (a) False. For example, if U = , , , then removing vectors from U will not form a basis
0 0 0
for R2 .
{[ ] [ ]}
1 2
(b) False. For example, U = 0 , 0 cannot be extended to a basis for R3 .
0 0
50. (a) True. The vectors {u1 , u2 } are linearly independent, and hence span a two-dimensional subspace,
a plane.
(b) False. The nullity is the dimension of the null space of A, which is equal to the number of free
variables in the row-reduced form of A; whereas the column space will have dimension equal to
the number of pivot variables in the row-reduced form of A.
51. (a) The dimension of S1 cannot exceed the dimension of S2 since S1 is contained in S2 . S1 is non-zero,
and thus its dimension can’t be 0. Hence the possible dimensions of S1 are 1, 2, and 3.
(b) If S1 = S2 , then S1 is properly contained in S2 , and the dimension of S1 is strictly less than the
dimension of S2 . Thus the possible dimensions of S1 are 1, and 2.
52. (a) The dimension of S1 cannot exceed the dimension of S2 since S1 is contained in S2 . S1 is non-zero,
and thus its dimension can’t be 0. Hence the possible dimensions of S1 are 1, 2, 3, and 4.
(b) If S1 = S2 , then S1 is properly contained in S2 , and the dimension of S1 is strictly less than the
dimension of S2 . So the possible dimensions of S1 are 1, 2, and 3.
53. Let S be a subspace of Rn of dimension n. Then S has a basis {u1 , u2 , . . . , un }. If S = Rn , then
there exists a vector v ∈ / S such that {u1 , u2 , . . . , un , v} is linearly independent, for otherwise one
could express v in terms of the vectors ui , and then v would belong to S. But now the subspace
span {u1 , u2 , . . . , un , v} is an n + 1 dimensional subspace of Rn , which is not possible. Hence we must
have that S = Rn .
cos θ
sin θ
0
54. For example, span is a one-dimensional subspace for each 0 ≤ θ < π, and each of these
.
0
subspaces is distinct.
55. The vectors {s1 , s2 , . . . , sm } span S, since every vector s in S can be written in terms of these vectors.
If we consider c1 s1 + c2 s2 + · · · + cm sm = 0, then since also 0s1 + 0s2 + · · · + 0sm = 0, we now have the
vector 0 ∈ S expressed in terms of the si in two ways. Since each vector in S is uniquely written in
terms of the si we must have that each ci = 0. Consequently, {s1 , s2 , . . . , sm } is linearly independent,
and therefore a basis for S.
56. Suppose {u1 , . . . , um } is not a basis for S. Then by Theorem 4.14(b) we can remove vectors to obtain
a collection of vectors which forms a basis for S. But this basis for S would contain fewer than m
vectors, contradicting the given dimension m of S. Thus we must have that {u1 , . . . , um } is a basis for
S.
57. Let {u1 , . . . , um } be a basis for S1 . By Theorem 4.14(a) either {u1 , . . . , um } is a basis for S2 or we
can add vectors to form a basis of S2 . If {u1 , . . . , um } is a basis for S2 ,then m = dim (S1 ) = dim (S2 ).
If we add k vectors, then dim (S1 ) = m < m + k = dim (S2 ). Hence dim (S1 ) ≤ dim (S2 ). Now
if the dimensions are equal, then the basis {u1 , . . . , um } for S1 is also a basis for S2 . Thus S1 =
span {u1 , . . . , um } = S2 .
58. (a) Suppose U spans S. By Theorem 4.14(b), either U is a basis for S, or we can remove vectors to
obtain a collection of vectors which forms a basis for S. Either way, we would have a basis with
no more than m vectors, which implies dim (S) ≤ m. But this contradicts dim (S) = k > m,
hence U does not span S.
(b) Suppose U is linearly independent. By Theorem 4.14(a) either {u1 , . . . , um } is a basis for S or
we can add vectors to form a basis of S. Either way, we would have a basis with more than m
vectors, which implies dim (S) ≥ m. But this contradicts dim (S) = k < m, hence U does is not
linearly independent.
59. Suppose the pivots occur in columns c1 , c2 , . . . , ck with c1 < c2 < · · · < ck . Let u1 , u2 , . . . , uk be the
nonzero row vectors, and consider the equation
a1 u1 + a2 u2 + · · · + ak uk = 0.
By considering the c1 component, we have a1 = 0, since each c1 component of ui for i > 1 is zero.
Hence we have
a2 u2 + a3 u3 + · · · + ak uk = 0.
Now consider the c2 component, and conclude that a2 = 0 as before. Continue in this way to conclude
that each ai = 0 for 1 ≤ i ≤ k. Thus the nonzero rows are linearly independent.
60. Since {u1 , u2 , u 3 } spans R3 , ker (A) = ker ([ u1 u2 u3 ]) = {0}, by the Unifying Theorem. Hence,
nullity(A) = 0.
61. The maximum value of m1 + m2 is n. To see why, suppose that m1 + m2 > n. Let {u1 , . . . , um1 } and
{v1 , . . . , vm2 } be bases for S1 and S2 , respectively. Since m1 + m2 > n, the combined set
{u1 , . . . , um1 , v1 , . . . , vm2 }
must be linearly dependent by Theorem 4.17b. Therefore there exists a nontrivial linear combination
a 1 u 1 + · · · + a m 1 u m 1 + b1 v1 + · · · + b m 2 v m 2 = 0 (∗ ∗ )
=⇒ a1 u1 + · · · + am1 um1 = −b1 v1 − · · · − bm2 vm2
Since S1 ∩ S2 = {0}, it follows that
a1 u 1 + · · · + a m 1 u m 1 = 0 and b1 v1 + · · · + b m 2 v m 2 = 0
As {u1 , . . . , um1 } and {v1 , . . . , vm2 } are bases, the above equations imply that a1 = · · · = am1 = 0 and
b1 = · · · = bm2 = 0. But this contradicts (∗ ∗ ) being a nontrivial linear combination. Hence it must be
that m1 + m2 ≤ n, as claimed.
62. Since B and A are equivalent, B results from a finite number of elementary row operations applied to
A. Hence we can just prove that the span of the rows is the same when B is obtained from A from a
single elementary row operation. Let {u1 , . . . , um } be the rows of A, and suppose we multiply row j
by cj = 0. Then the rows of B are {u1 , . . . , cj uj , . . . , um }. Since the factor cj does not change the set
of all linear combinations of the vectors ui , we conclude that the rows of A and the rows of B span the
same subspace. Now consider the row operation that interchanges two rows of A. This simply re-orders
the row vectors in B, which doesn’t change the span of the rows of A. Finally, we consider the row
operation which replaces row k of A by cj uj + uk . Then the rows of B are {u1 , . . . , cj uj + uk , . . . , um }.
If v ∈ span {u1 , . . . , cj uj + uk , . . . , um }, then
v = a1 u1 + · · · + aj uj + · · · + ak (cj uj + uk ) + · · · + cm um
= a1 u1 + · · · + (aj + ak cj ) uj + · · · + ak uk + · · · + cm um
and hence v ∈ span {u1 , . . . , uk , . . . , um }, so the span of the rows of B is contained within the span of
the rows of A. Now let v ∈ span {u1 , . . . , uk , . . . , um }. Then
v = a 1 u 1 + · · · + a j uj + · · · + ak uk + · · · + c m u m
= a1 u1 + · · · + (aj − ak cj ) uj + · · · + ak (cj uj + uk ) + · · · + cm um
and hence v ∈ span {u1 , . . . , cj uj + uk , . . . , um }, so the span of the rows of A is contained within the
span of the rows of B. Therefore we conclude that the span of the rows of A is the same as the span
of the rows of B.
63. A linear dependence in the vectors {u1 , . . . , um } is an expression of the form
a1 u1 + a2 u2 + · · · + ak uk = 0.
This implies U a = 0 where a is the vector with components ai . Since U and V are equivalent, we
know that V = EU where E is an invertible matrix. Thus V a = (EU ) a = E (U a) = E0 = 0. But
this implies the same linear dependence in the vectors {v1 , . . . , vm },
a1 v1 + a2 v2 + · · · + ak vk = 0.
Similarly, an initial linear dependence in {v1 , . . . , vm } corresponds to a linear dependence in {u1 , . . . , um },

by writing U = E −1 V .
64. Suppose U = {u1 , . . . , uj } and V = {v1 , . . . , vk } are two bases for a subspace S of Rn , with j ≤ k. We
can write for 1 ≤ i ≤ k,
vi = ci1 u1 + · · · + cij uj
Consider now
a 1 v 1 + a 2 v 2 + · · · + ak vk = 0
and substitute to obtain
a1 (c11 u1 + · · · + c1j uj ) + a2 (c21 u1 + · · · + c2j uj ) + · · · + ak (ck1 u1 + · · · + ckj uj ) = 0
Re-arrange to produce
(a1 c11 + a2 c21 + · · · + ak ck1 ) u1 + (a1 c12 + a2 c22 + · · · + ak ck2 ) u2

+ · · · + (a1 c1j + a2 c2j + · · · + ak ckj ) uj = 0
Since U is linearly independent, we now have
a1 c11 + a2 c21 + · · · + ak ck1 = 0

a1 c12 + a2 c22 + · · · + ak ck2 = 0
.
a1 c1j + a2 c2j + · · · + ak ckj = 0
Considering this as a system of equations in the unknowns ai we have j equations with k unknowns.
If j < k, we know that this system has infinitely many solutions, and therefore there exists a non-
trivial solution to a1 v1 + a2 v2 + · · · + ak vk = 0. Therefore V is linearly dependent, a contradiction.
We conclude that j = k, and that in general any two bases for a subspace has the same number of
vectors.
{[ ] [ ]}
2 −3
65. Using a computer algebra system, we determine that the span of the vectors has basis −1 , 4 ,
5 −2
with dimension 2. The vectors are not a basis for R3 .
66. Using
{[ a computer
] [ ]algebra
[ system,
]} we determine that the span of the vectors has basis
4 −1 3
2 , 5 , 7 , with dimension 3. The vectors are a basis for R3 .
−7 −3 −9
67. Using a computer algebra system, we determine that the span of the vectors has basis
3 2 −2 −2
0 −4 7 5
, , , , with dimension 4. The vectors thus span R4 .
1 5 0
−5
−2 0 4 4
6 5 −3 7
0 −1 4 −2
, , , with dimension 4. The vectors thus span R4 .
,
−5 1 1 6
2 3 −5 8
1 −1 2
1 0 1
−1 , 1 , −2 , with dimension 3. The vectors therefore do not span R5 .
1 2 1
1 −1 2
1 2 3 4 5
2 3 4 5 1
3 , 4 , 5 , 1 , 2 , with dimension 5. The vectors thus span R5 .
4 5 1 2 3
5 1 2 3 4
1. (a) We reduce A to echelon form:
[ ] [ ]
1 4 −6 1 4 −6
−2 −8 12 ∼ 0 0 0
]} {[
1
A basis for the column space, which is determined from the pivot column 1, is −2 . A basis
{[ ]}
1
for the row space is determined from the nonzero rows of the echelon form, 4 . We solve
−6
[ ] [ ] {[ [ ]]}
−4 6 −4 6
Ax = 0, to obtain x = s 1 + s2 0 , and so our nullspace basis is 1 , 0 . We
0 1 0 1
have rank (A) = 1, nullity (A) = 2, and rank (A) + nullity (A) = 1 + 2 = 3 = m.
(b) We reduce A to echelon form:
[ ] 2 1 0 53
2 1 0 3 9
−1 4 2 1 ∼ 0 2
2 2
0 3 2 −1 0 0 2
−38
3
A basis for the column space, determined from the pivot columns 1, 2, and 3, is
{[ ] [ ] [ ]}
2 1 0
−1 , 4 , 2 .
0 3 2
469 Section 4.3: Row and Column Spaces Chapter 4: Subspaces 469
A basis for the row space is determined from the nonzero rows of the echelon form,
2 0 0
9 0
1 2
, , 2 .
0 2 3
3
5
2
− 83
−1 −1
3 3
We solve Ax = 0, to obtain x = s −73 −73

, and so our nullspace basis is . We have
4 4
1 1
rank (A) = 3, nullity (A) = 1, and rank (A) + nullity (A) = 3 + 1 = 4 = m.
2. (a) The dimension of the row space is 7 − 2 = 5, the number of nonzero rows in the echelon form.
(b) The dimension of the column space is also 5.
(c) The dimension of the null space is 12 − 5 = 7, so nullity (A) = 7.
(d) The dimension of the row space is 5, so rank (A) = 5.
3. nullity (A) = m − rank (A) = 8 − 5 = 3.
4. (a) False. A = [ 1 0 ] has rank (A) = 1 = nullity (A) .

(b) False. A = [0] has rank (A) = 0.
[ ]
1
(c) False. A = 0 has nullity (A) = 0.
(d) True. A has, at most, n pivots, so rank (A) ≤ n.
4.3 Row and Column

Spaces {[
1
] [
−3
]}
1. A basis for the column space, determined from the pivot columns 1 and 2, is −2 , 5 . A
−3 8
{[ ] [ ]}
1 0
basis for the row space is determined from the nonzero rows of the echelon form, 0 , 1 .
−10 −4
[ ] {[ ]}
10 10
We solve Ax = 0, to obtain x = s 4 , and so our nullspace basis is 4 .
1 1
{[ ] [ ]}
1 0
2. A basis for the column space, determined from the pivot columns 1 and 2, is −2 , 1 . A
0 1
1 0
0 1
basis for the row space is determined from the nonzero rows of the echelon form, , .
−4 5
−3 −1
4 3 4 3
−5 1 −5 , 1
We solve Ax = 0, to obtain x = s1 +s2 , and so our nullspace basis is .
1 0
1 0
0 1 0 1
{[ ] [ ]}
1 0
3. A basis for the column space, determined from the pivot columns 1 and 2, is −2 , 1 . A basis
0 1
1 0
0 1
for the row space is determined from the nonzero rows of the echelon form, , . We
−4 5
−3 −1
4 3 4 3
−5 1 −5 1
solve Ax = 0, to obtain x = s1 +s , and so our nullspace basis is , .
2
1 0 1 0
0 1 0 1
4. A basis for the column space, determined from the pivot columns 1, 2 and 3,
1 −2 5
2 4 1
is 4 , 0 , 2 . A basis for the row space is determined from the nonzero rows of the
−
1 2
− 0
3 {[ 1 ] [ 1 ] [ ]}
1 0 [ ]
0 0
echelon form, 0 , 1 , 0 . We solve Ax = 0, to obtain x = 0 , and so our nullspace

0 0 1 0
has no basis.
5. We reduce A to echelon form:
[ ] [ ]
1 −2 2 1 −2 2
2 −2 3 ∼ 0 2 −1
−1 −2 0 0 0 0
]} {[ ] [
−2 1
A basis for the column space, determined from the pivot columns 1 and 2, is , −2 . A 2
−2 −1
{[ ] [ ]}
1 0
basis for the row space is determined from the nonzero rows of the echelon form, −2 , 2 .
2 −1
−1 −1
1 1
We solve Ax = 0, to obtain x = s 2
, and so our nullspace basis is 2
. We have
1 1
rank (A) = 2, nullity (A) = 1, and rank (A) + nullity (A) = 2 + 1 = 3 = m.

[ ] [ ]
1 2 −1 1 1 2 −1 1
2 1 −1 4 ∼ 0 −3 1 2
1 −4 1 5 0 0 0 0
{[ ] [ ]}
1 2
A basis for the column space, determined from the pivot columns 1 and 2, is 2 , 1 . A basis
1 −4
1 0
for the s
row p
ace is determined from the nonzero rows of the echelon form, 2 −3

, . We
−1 1
1 2
1
3
7
3
1
3
− 37
−
1 2 1 2
solve Ax = 0, to obtain x = s1 3 +s2 3 , and so our nullspace basis is 3 , 3 .

1 0 1 0
0 1 0 1
We have rank (A) = 2, nullity (A) = 2, and rank (A) + nullity (A) = 2 + 2 = 4 = m.

[ ] [ ]
1 3 2 0 1 3 2 0
3 11 7 1 ∼ 0 2 1 1
1 1 4 0 0 0 3 1
A basis
{[ for ] the
[ column
] [ space,
]} determined from the pivot columns 1, 2, and 3,
1 3 2
is 3 , 11 , 7 . A basis for the row space is determined from the nonzero rows of the
1 1 4
5
1 0 0 3
1
3 2 0 −3
echelon form, , , . We solve Ax = 0, to obtain x = s , and so our
2 1 3 1
−3
0 1 1 1
5
3
− 13
nullspace basis is . We have rank (A) = 3, nullity (A) = 1, and rank (A) + nullity (A) =
− 13
1
3 + 1 = 4 = m.

1 4 −1 1 1 4 −1 1
3 11 −1 4 0 −1 2 1
∼
1 5 2 3 0 0 5 3
2 8 −2 2 0 0 0 0
A basis for the column space, determined from the pivot columns 1, 2, and 3,
1 4 −1
3 11 −1
1 5
is , , . A basis for the row space is determined from the nonzero rows of the
2
2 8 −2
− 54
1 0 0
4 −1 0 −5
1
echelon form, , , . We solve Ax = 0, to obtain x = s , and so our

1 2 5
− 3
1 1 3
−5
−4
1
5
nullspace basis is −15

. We have rank (A) = 3, nullity (A) = 1, and rank (A) + nullity (A) =
− 35
1
3 + 1 = 4 = m.
9. We require that the rows are linearly independent, so therefore x = 8.
10. We require that the rows are linearly independent, so therefore x ∈ R.
11. We reduce A:
[ ] [ ]
−1 2 1 −1 2 1
3 1 11 ∼ 0 7 14
4 3 x 0 0 x − 18
Thus, for rank (A) = 2, we need two pivots, and hence x = 18.
12. We reduce A: [ ]
−2 1 0 7 −2 1 0 7
0 1 x 9 ∼ 0 1 x 9
1 0 −3 1 0 0 − 12 x − 3 0
Thus, for rank (A) = 2, we need two pivots, and hence x = −6.
13. The dimension of the column space is 5, the same as the dimension of the row space.
14. The dimension of the row space is 5, the same as the dimension of the column space.
15. The dimension of the row space is 4 − 1 = 3, the number of nonzero rows in the echelon form. The
dimension of the column space is also 3, and the dimension of the null space is 7 − 3 = 4.
16. The dimension of the row space is 6 − 2 = 4, the number of nonzero rows in the echelon form. The
dimension of the column space is also 4, and the dimension of the null space is 11 − 4 = 7.
17. rank (A) = m − nullity (A) = 5 − 3 = 2.
18. rank (A) = m − nullity (A) = 13 − 10 = 3.
19. nullity (A) = m − rank (A) = 11 − 4 = 7.
20. nullity (A) = m − rank (A) = 9 − 7 = 2.
21. dim (range (T )) = rank (A) = m − nullity (A) = 11 − 7 = 4.
22. dim (ker (T )) = nullity (A) = m − rank (A) = 12 − 8 = 4.
23. Since T is one-to-one, ker (T ) = 0, and dim (ker (T )) = 0. Hence nullity (A) = dim (null (A)) =
dim (ker (T )) = 0.
24. Since T is onto, dim (range (T )) = 5. Thus rank (A) = dim (col (A)) = dim (range (T )) = 5, and
nullity (A) = m − rank (A) = 13 − 5 = 8.
25. The maximum possible value for the rank of A is 5 since the echelon form can have at most 5 pivots.
The minimum possible value of the nullity of A is 8, since nullity (A) = m − rank (A) = 13 − rank (A) ≥
13 − 5 = 8.
26. The minimum possible value for the rank of A is 0 since the echelon form may have 0 pivots. The
maximum possible value of the nullity of A is 7, since nullity (A) = m − rank (A) = 7 − rank (A) ≤
7 − 0 = 7.
27. rank (A) = 3, the number of nonzero rows of B.
28. rank (A) = 2, the number of pivot columns of B.
29. nullity (A) = m − rank (A) = 5 − 3 = 2, since the rank of A is the number of nonzero rows of B.
30. nullity (A) = m − rank (A) = 5 − 1 = 4, since the rank of A is the number of pivot columns of B.
31. B has 3 nonzero rows, since the rank of A is equal to the number of nonzero rows of B.
32. B has 1 pivot column, since the rank of A is equal to the number of pivot columns of B.
33. A must be 7 × 5, since col (A) is a subspace of Rn , and row (A) is a subspace of Rm .
34. m = rank (A) + nullity (A) = 4 + 3 = 7. Since col (A) is a subspace of R5 , it must be that A is 5 × 7.
[ ]
1 0 0
35. For example, A = .
0 1 0
[ ]
I3×3
01×3
[ ]
I3×3 03×1
06×3 06×1
[ ]
I4×4 04×3
01×4 01×3
[ ]
1 0 0 0
39. For example, A = 0 1 0 0 .
0 0 1 0
[ ]
1 0 0 0
0 1 0 0
[ ]
1 0 .
41. For example, A =
0 1
[ ]
1 0 0
42. For example, A = 0 1 0 .
0 0 1
[ ]
1 0 0
43. For example, A = 0 0 0 .
0 0 0
[ ]
1 0 0
44. For example, A = 0 1 0 .
0 0 0
[ ]
1 0 0
45. For example, A = 0 1 0 .
0 0 0
[ ]
1 0 0
46. For example, A = 0 0 0 .
0 0 0

[ ] ([ ]) ([ ])
1 1 1 1
(b) False. Consider A = , then col (A) = span , but row (A) = span .
0 0 0 1
48. (a) True, since the rank is the number of pivots, which can not exceed the number of rows.
(b) True, by Theorem 4.10, and the definition of row space. In particular, if B is an echelon form of
A, then this is Theorem 4.20(a).
49. (a) False. For example, see A and B in Example 1.
(b) False, b is in col (A), not row (A).
50. (a) False. Solutions of Ax = b are not related to row (A).
(b) False. If nullity (A) = 5, then rank (A) = 13 − 5 = 8. But rank (A) ≤ 4, since A has 4 rows.
51. (a) False, since dim (range (T )) = rank (A) ≤ 5, T cannot map onto R9 .
[ ]
I5×5
(b) True. For example, if A = , then T is a one-to-one mapping.
04×5
52. (a) True. For example, if A = [ I4×4 04×9 ], then T maps onto R4 .
(b) False, since dim (ker (T )) = nullity (A) = m − rank (A) = 13 − rank (A) ≥ 13 − 4 = 9, T can not be
one-to-one, as the set of solutions to T x = 0, i.e. ker (T ), is at least a nine-dimensional subspace.
T
53. The span of the rows of A is the same subspace as the span (of the
) columns of A , since these subspaces
are determined by the same vectors. Hence row (A) = col A T , and thus rank (A) = dim (row (A)) =
( ( )) ( )
dim col AT = rank AT .
54. The matrix cA is equivalent to A if c = 0, as it results from multiplying each row of A by c. Since
equivalent matrices have the same row space (Exercise 48b), they also have the same rank, and thus
rank (A) = rank (cA).
55. If rank (A) < m, then nullity (A) = m − rank (A) > m − m = 0. Thus dim (null (A)) > 0, and therefore
there exists nontrivial solutions to Ax = 0.
56. The number of zero rows in the reduced row echelon form of A plus the rank of A is equal to the number
of rows. Thus, the number of nonzero rows in the reduced row echelon form of A is n − rank (A) >
n − n = 0. Hence the reduced row echelon form of A has a row of zeroes.
57. If m > n, then rank(A) ≤ n < m, so it must be that nullity(A) > 0. If m < n, then the same reasoning
applies to AT , which is m × n.
58. (a) Let A = [ a1 a2 · · · am ], then Ax = b if and only if
x1 a1 + x2 a2 + · · · + xm am = b.
This is equivalent to b ∈ col (A). Thus Ax = b is consistent if and only if b ∈ col (A).
(b) Ax = b has a solution if and only if b ∈ col (A), by part (a). If the columns of A are linearly
independent, then Ax = 0 has only the trivial solution. So if Ax = b and Ay = b, then
A (x − y) = Ax − Ay = 0 − 0 = 0, so x − y = 0, and x = y. Thus Ax = b has a unique solution.
Conversely, if Ax = b has a unique solution x, and Ay = 0, then A (x + y) = Ax+Ay = b+0 = 0,
so we must have x + y = x, and thus y = 0. Since Ay = 0 has only the trivial solution, the
columns of A are linearly independent. We now conclude that Ax = b has a unique solution if
and only if b is in the column space of A and the columns of A are linearly independent.
59. Using([a computer algebra system,
]) we determine ([ ])
1 3 2 4 −1 1 3 2 4 −1
rank 1 5 −3 3 −4 = 2, and nullity 1 5 −3 3 −4 = 3.
2 8 −1 7 −5 2 8 −1 7 −5

2 −1 0 1 2 −1 0 1
5 2 1 −4 5 2 1 −4
rank
−1 −4 −1 6 = 2, and nullity −1 −4 −1 6 = 2.
−8 −5 −2 9 −8 −5 −2 9
4 8 2 4 8 2
3 5 1 3 5 1
rank 9 19 5 = 2, and nullity 9 19 5 = 1.
7 13 3 7 13 3
5 11 3 5 11 3

4 3 2 1 4 3 2 1
2 1 3 6 2 1 3 6
rank = 3, and nullity = 1.
7 10 3 1 7 10 3 1
6 4 5 7 6 4 5 7
−2 −2 1 5 −2 −2 1 5
475 Section 4.4: Change of Basis Chapter 4: Subspaces 475

[ ][ ] [ ]
3 2 −1 5
1. (a) x = U [x] = =
B −7 6 4 31
B
[ ][ ] [ ]
1 1 −2 3 5
(b) x = U [x] B = 2 0 3 0 = 3
6 −5 4 −1 B
14
[ ]−1 [ ] [ ][ ] [ ]
2. (a) [x] = U−1 x =
1 2 1
=
5 −2 1
= 11
B 2 5 −3 −2 1 −3 −5
[ ]− 1 [ ] [ ][ ] [ ]
1 2 1 2 0 0 −1 2 1
(b) [x]B = U−1 x = 1 −1 0 1 = 0 −1 −1 1 = 0
−1 0 0 −1 1 2 3 −1 1
[ ]−1 [ ] [ ]
4 3 1 3 5 12
− −
3. (a) = 7 17
1 1 2 5
[ ]−1 [ ] 1 1 5
1 1 −2 1 2 1 3
(b) 2 1 2 0 1 0 = −1 0 −2
0 1 0 −1 0 −2 − 12 − 12 − 32
4. (a) True. Because A = W −1 V, where V has columns given by the basis vectors of B1 and W has
columns given by the basis vectors of B2 , it follows that A is invertible, with A−1 = V −1 W .
(b) True. Let A = W −1 V, where V has columns given by the basis vectors of B1 and W has columns
given by the basis vectors of B2 . Then A−1 = V −1 W , which is the change of basis matrix from
B2 to B1 .
(c) True. If A = W −1 V, where V has columns given by the basis vectors of B1 and W has columns
given by the basis vectors of B2 , it follows that W = V, so A = W −1 V = V −1 V = I.
(d) True, by Theorem 4.28.
4.4 Change of Basis
[ ][ ] [ ]
3 2 1 1
1. x = U [x] B = =
−2 5 −1 −7
[ ][ ] [ ]
2. x = U [x] = −5 −2 −2 4
=
B 3 1 3 −3
[ ][ ] [ ]
4 2 2 0
3. x = U [x] = =
B 3 1 −4 2
[ ][ ] [ ]
4. x = U [x] = −6 5 −3 28
=
B 1 −3 2 −9
[ ][ ] [
1 −1 2 1 1 ]
5. x = U [x] B = −2 2 −1 2 = 1
−1 0 3 1 2
[ ][ ] [ ]
0 1 0 1 1
6. x = U [x] B = 3 2 −1 1 = 7
1 3 2 −2 0
[ ]−1 [ ] [ ][ ] [ ]
7. [x] = U −1
x=
1 1 3
=
3 −1 3
= 10
B 2 3 −1 −2 1 −1 −7
[ ]−1 [ ] [ ][ ] [ ]
−1 5 1 1 1 −1 1 −1
8. [x] = U x= = =
B 4 1 2 −4 5 2 6
1 [ ] [ ][ ] [ ]
[ ]−
−2 5 1 −3 −5 1 2
9. [x]B = U −1 x = −3 = −1
=
1 −1 −1 −2 1
[ ]−1 [ ] [ ][ ] [ ]
10. [x] = U −1 x =
7 4 4
=
3 −4 4
= 24
B 5 3 −3 −5 7 −3 −41
[ ]−1 [ ] [ ][ ] [ ]
1 −1 1 1 1 1 −1 1 4
11. [x]B = U −1 x = 0 2 −1 2 = 0 0 1 2 = −1
0 1 0 −1 0 −1 2 −1 −4
[ ]−1 [ ] [ ][ ] [ ]
2 −1 1 −2 1 −2 −3 −2 −10
12. [x]B = U −1 x = 2 −2 −1 1 = 1 −3 −4 1 = −13

−1 1 1 2 0 1 2 2 5
[ ]−1 [ ] [ ]
5 3 2 1 −5 −1
13. =
7 4 1 1 9 2
[ ]− 1 [ ] [ ]
3 7 2 3 3 8
14. =
1 2 1 2 −1 −3
[ ]−1 [ ] [ ]
1 0 3 −1 2 1 −19 −4 16
15. 3 1 7 0 3 −1 = 15 1 −14
−1 −1 0 4 3 −2 6 2 −5
[ ]−1 [ ] [ ]
1 −2 1 2 1 −4 −8 −7 35
16. 3 −5 2 3 −1 1 = −7 −4 26
2 −4 3 0 2 5 −4 0 13
[ ]
I C
17. We row-reduce [ B2 B1 ] to row echelon form to solve for C, as [ B2 B1 ] ∼ :
[ ] [ ] 0 0
2 1 3 −1 1 0 2 −1
−1 3 −5 4 ∼ 0 1 −1 1
2 −1 5 −3 0 0 0 0
[ ]
2 −1
Thus the change of basis matrix from B1 to B2 is C = −1 1 .
[ ]
I C
18. We row-reduce [ B2 B1 ] to row echelon form to solve for C, as [ B2 B1 ] ∼ 0 0 :
[ ] [ ]
2 −3 5 −1 1 0 1 1
−1 5 −6 4 ∼ 0 1 −1 1
3 0 3 3 0 0 0 0
[ ]
1 1
Thus the change of basis matrix from B1 to B2 is C = −1 1
.
[ ]−1 [ ] [ ]
2 1 5 3 −2 −1
19. =
1 1 7 4 9 5
[ ]− 1 [ ] [ ]
2 3 3 7 3 8
20. =
1 2 1 2 −1 −3
[ ]−1 [ ] [ ]
−1 1 −2 −2 2 4 31 −15 −49
21. 1 0 5 1 0 1 = 17 −7 −25
−1 2 0 3 1 −1 −6 3 10
[ ]−1 [ ] [ ]
−1 1 −2 1 4 3 15 −44 −46
22. −3 4 −3 4 2 1 = 10 −28 −29

1 −2 −2 1 0 −2 −3 6 7
[ ]
I C
[ ] [ ] 0 0
−1 2 1 −4 1 0 1 2
4 3 7 5 ∼ 0 1 1 −1
2 1 3 3 0 0 0 0
[ ]
1 2
Thus the change of basis matrix from B2 to B1 is C = 1 −1
.
[ ]
I C
[ ] [ ] 0 0
−3 2 −5 1 1 0 1 1
1 −5 6 −9 ∼ 0 1 −1 2
1 4 −3 9 0 0 0 0
[ ]
1 1
Thus the change of basis matrix from B2 to B1 is C = −1 2
.
[ ]
−5 −1
25. Using the change of basis matrix from Exercise 13, we have [x] B2 = [x] B1
9 2
[ ][ ] [ ]
−5 −1 2 −9
= .
=
9 2 −1 16
[ ]
−8 −7 35
26. Using the change of basis matrix from Exercise 16, we have [x] B2 = −7 −4 26 [x]B1
[ ][ ] [ ]
−8 −7 35 1 −99
= −7 −4 26 3 = −71 .
−4 0 13 −2 −30
[ ]
2 −1
27. From Exercise 17 we know that the change of basis matrix from B1 to B2 is C = . Therefore
−1 1
[ ]
−1
[x]B2 = C [x]B1 =
3 .
[ ]
−2 −1
28. Using the change of basis matrix from Exercise 19, we have [x] B1 = [x]B2
9 5
[ ][ ] [ ]
−2 −1 1 −4
= .
=
9 5 2 19
[ ]
31 −15 −49
29. Using the change of basis matrix from Exercise 21, we have [x] B1 = 17 −7 −25 [x]B2 =
−6 3 10
[ ][ ] [ ]
31 −15 −49 −1 −193
17 −7 −25 1 = −99 .
−6 3 10
3 39
[ ]
1 1
30. From Exercise 24 we know that the change of basis matrix from B2 to B1 is C = . Therefore
[ ] −1 2
1
[x]B1 = C [x] B2 = .
8
31. The change of basis matrix from B1 to B2 is given by
( [ ])−1
−1 0 1
[ u2 u1 ] [ u1 u2 ] = [ u1 u2 ]
1 0 [ u1 u2 ]
[ ]−1 ( )
= 0 1 −1
[ u1 u2 ] [ u1 u2 ]
1 0
[ ] [ ]
0 1 0 1
1 0
= I2 = 1 0
[ ] [ ][ ] [ ]
0 1 0 1 a = b .
Thus [x]B2 = 1 0 [x]B1 = 1 0 b a
32. The change of basis matrix from B2 to B1 is given by

( [ ])−1
0 1 0
−1
[ u1 u2 u3 ] [ u2 u3 u1 ] = [ u2 u3 u1 ] 0 0 1 [ u2 u3 u1 ]
1 0 0
[ ]−1
0 1 0
( )
−1
= 0 0 1 [ u2 u3 u1 ] [ u2 u3 u1 ]
1 0 0
[ ] [ ]
0 0 1 0 0 1
= 1 0 0 I3 = 1 0 0
0 1 0 0 1 0
[ ] [ ][ ] [ ]
0 0 1 0 0 1 a c
Thus [x]B1 = 1 0 0 [x]B2 = 1 0 0 b = a .
0 1 0 0 1 0 c b
{[ ] [ ]}
−2 0
33. For example, B = 0 , 1/3 .
{[ ] [ ] [ ]}
1/3 0 0
34. For example, B = 0 , 2 , 0 .
0 0 −5/2
{[ ] [ ]} {[ ] [ ]}
2 0 1 , 0
35. For example, B1 = 0
,
−1/2 and B2 = 0 1
.
{[ ] [ ] [ ]} {[ ] [ ] [ ]}
2/3 0 0 1 0 0
36. For example, B1 = 0 , 1 , 4 and B2 = 0 , 1 , 0 .
0 0 1 0 0 1
{[ ] [ ]} {[ ] [ ]}
1 , 3 1 , 0
37. For example, B1 = 2 7 and B 2 = 0 1
.
{[ ] [ ] [ ]} {[ ] [ ] [ ]}
1 0 0 1 −1 2
38. For example, B1 = 0 , 1 , 0 and B2 = −2 , 3 , 0 .
0 0 1 1 4 1
39. (a) True, since U is a matrix corresponding to a transformation from a vector [x] B1 to [x] B2, both of
which have n components.
(b) True. If U [x] B2 = [x] B1 and V [x] B2 = [x] B1 for all vectors x, then by subtracting we have
(U − V ) [x]B2 = 0 for all vectors x. If B2 = {u1 , . . . , un } then we then have (U − V ) [ui ]B2 =
(U − V ) ei = 0, and hence the ith column of (U − V ) is the zero vector for all i. Hence U − V is
the zero matrix, and U = V .
40. (a) True. Since U = W −1 V where V has columns given by the basis vectors of B2 , and W has
columns given by the basis vectors of B1 , it follows that U is invertible, with U −1 = V −1 W .
(b) True. Since a change of basis matrix must be invertible, it will have linearly independent columns.
41. (a) False. The change of basis matrix from B1 to B2 is
( [ ])−1
−1 2 0
[ 2u1 5u2 ] [ u1 u2 ] = [ u1 u2 ] [ u1 u2 ]
0 5
[ ]−1
2 0 −1
= [ u1 u2 ] [ u1 u2 ]
0 5
][
1/2 0
=
0 1/5
(b) True. A change of basis matrix for a subspace S of dimension k will be k × k.
[ ]
a c
42. (a) False. The correct change of basis matrix is . To see why, note that if u = eu1 + f u2 , then
b d
we also have u = e(av1 + bv2 ) + f (cv1 + dv2 ) = (ae + cf )v1 + (be + df )v2 . Therefore
[ ][ ]
a c e
[u]B2 = b d f
( )
(b) False. We have [x] B2 = C1 [x] B1 and [x] B3 = C2 [x] B2 , so [x] B3 = C2 [x] B2 = C2 C1 [x]B1 =
(C2 C1 ) [x] B . Thus C 2 C 1 is the change of basis matrix from B1 to B 3 , not C 1 C 2 .

1
a1 b1
. .
43. Let B = {w1 , . . . , wn }. Suppose [u]B = . and [v]B = . . Then u = a1 w1 + · · · + an wn and
an bn
v = b1 w1 + · · · + bn wn . Hence u + v = (a1 w1 + · · · + an wn ) + (b1 w1 + · · · + bn wn ) = (a1 + b1 ) w1 +

· · · + (an + bn ) wn . This implies [u + v]B
a1 + b1 a1 b1
= . = . + . = [u]B + [v]B .
a n + bn an bn
a1
44. Let B = {w1 , . . . , wn }. Suppose [u]B = . . Then u = a1 w1 + · · · + an wn and
.
an
cu = c (a1 w1 + · · · + an wn ) = (ca1 ) w1 + · · · + (can ) wn .

ca1 a1
This implies [cu] B = . =c . = c [u]B .

can an
45. By Exercise 43, T (x + y) = [x + y]B = [x] B + y B = T (x) + T (y), and by Exercise 44, T (cx) =
[cx]B = c [x] B = cT (x). Hence T is a linear transformation.
46. Define T (x) = [x] B , then, by Exercise 45, T is a linear transformation. Consequently, [c 1u1 + · · · + cn un ]B =
T (c1 u1 + · · · + cn un ) = c1 T (u1 ) + · · · + cn T (un ) = c1 [u1 ]B + · · · + cn [un ]B .
c1 c1
. .
47. Let ui = c1 v1 + · · · + cn vn , then [ui ]B2 = . . Thus V [ui ]B2 = [ v1 ··· vn ] .
cn cn
[ ]
= c1 v1 + · · · + cn vn = ui . Hence V [u1 ]B2 ··· [un ]B2 = [ u1 ··· un ]
⇒ VC = U ⇒ C = V −1 U .
48. The row operations

[ that reduce
] V to In determine the inverse V −1 , since
[ V In ] ∼ In V −1 . Therefore V −1 is the matrix which corresponds to the product of elemen-
tary matrices which reduce V to In ; V −1 V = En · · · E2 E1 V = In . Now apply

[ these operations
] to
[ V U ], which is equivalent to multiplying on the left by V −1 , to produce In V −1 U .
49. Row-reduce [ V U ]:
61 48 316
[
3 2 −4 3 4 2
]
35 5
− 35
2 5 −6 5 −2 11 ∼ I3 17
7 8 − 517
−7 8 1 9 7 −6 62 51
− 382
35 5 35
61
35
48
5
− 316
35
17 51
Hence the change of basis matrix is 7
8 − 7
.
62 51 382
35 5
− 35
46 5 119
[
7 4 −8 6 5 −3
] − 33 −9 − 99
−2 3 1 4 0 3 ∼ I3 10
11
0 4
11
−1 9 5 2 −5 2 50 10 49
− 33 − 9
− 99
46 5 119
− 33 −9 − 99
0
10 4
Hence the change of basis matrix is 11 11 .
− 33
50
− 10
9
− 99
49
− 538 55
269
3
538
364
269
3 7 5 4 1 2 5 3
4 −2 −3 0 0 −2 0 7 538 269 538 269
−2 −1 2 3 1 −5 0 −9
∼ I4 45 112 129 369
− 269 − 269 − 269

1 0 3 −1 −1 3 −2 −2 269
219 416 305 205

538
− 269 538
− 269
− 538
49 55
269
3
538
364
269
37 211 393 340
538 269 538 269
Hence the change of basis matrix is .
45 112 129 369
− 269 269
− 269 − 269
219 416 305 205
538
− 269 538 − 269
11 1 1 9
3 −3 2 1 7 −3 0 5 14
−2 −2 14
5 −4 0 7 −2 0 4 4 32 8 16
7 −5 1 4 −2 1 −4 3 7
−3 3 7
−8 −6 4 2 3 1 7 1 ∼ 813 25 55 417
I4
98 − 6 14 98
173 7 37 139
98
−6 14 98
481 Supplementary Exercises Chapter 4: Subspaces 481
11
−1 1 9
14 2
−2 14
32 8 16
7
−3 3 7
Hence the change of basis matrix is 813 25 55 417
.
98 −6 14 98
173
98
− 67 37
14
139
98
2 −3 6 −10 −5 −8 1 0 0 1 2 2
1 0 −3 4 5 5 0 1 0 2 1 2
0 2 2 ∼ −1 −1 −1
2 0 2 0 0 1
−1 −2 0 −5 −4 −6 0 0 0 0 0 0
[ ]
1 2 2
Hence the change of basis matrix is 2 1 2 .
−1 −1 −1
3 4 −5 7 −5 −12 1 0 0 2 3 −2
−2 −1 4 −7 3 11 0 1 0 −1 −1 1
−1 −1 3 −4 4 7 ∼ −1 2 2
0 0 1
2 3 −4 5 −5 −9 0 0 0 0 0 0
[ ]
2 3 −2
Hence the change of basis matrix is −1 −1 1 .
−1 2 2
Chapter 4 Supplementary Exercises

[ ]
0
1. Let S be the set of vectors of the form a . Letting a = 0 and c = 0, we see that 0 ∈ S.
2c
[ ] [ ] [ ] [ ]
0 0 0 0
Suppose u and v are in S, then u = a1 and v = a2 . Thus u + v = a1 + a2 =
2c1 2c2 2c1 2c2
[ ] [ ] [ ]
0 0 0
a 1 + a2 ∈ S. Let r ∈ R and u ∈ S, then ru = r a1 = ra1 ∈ S, and we conclude
2 (c1 + c2 ) 2c1 2 (rc1 )
{[ ] [ ]}
0 0
that S is a subspace. (Alternatively, we have S = span 1 , 0 , and hence S is a subspace.)
0 1
[ ]
a+b
2. Let S be the set of vectors of the form . Letting a = 0, b = 0, and c = −1, we see that
c+1
[ ] [ ]
a1 + b1 a2 + b2
0 ∈ S. Suppose u and v are in S, then u = c1 + 1
and v =
c2 + 1
. Thus u + v =
[ ] [ ] [ ]
a1 + b1 a2 + b 2 (a1 + a2 ) + (b1 + b2 )
c1 + 1
+
c2 + 1
=
(c1 + c2 + 1) + 1 ∈ S. Let r ∈ R and u ∈ S, then ru =
[ ] [ ]
a1 + b 1 (ra1 ) + (rb1 )
r c1 + 1 =
(rc1 + r − 1) + 1 ∈ S, and we conclude that S is a subspace.
[ ] a+c b+c [ ]
a+b 1
=a 1 [ ] [
1
0 +b 0 0
1 ]
+c 1
1
[ ] {[ ] [ ] [ ]}
a+b 1 1 0
and so the set of vectors S or the form a+c is span 1 , 0 , 1 and, therefore, a
b+c 0 1 1
subspace.
[ ] [ ] [ ]
4. Because b − a = 0, we have b = a, and a = a 1
=a . Thus, the set of vectors of the form
b a 1
[ ] { }
a 1
b where a − b = 0 is span 1 and, therefore, a subspace.
2 6 ∼ 1 0 .
−1 3 0 1
[ ] {[ ]}
0 0
1 −2 4 1 0 −3
−1 0 3
∼ 0 1 − 27 .

3
7
x=s 2 ,
1
3
7
1
7. We row reduce
[ ] [ ]
−1 5 1 0
4 3 ∼ 0 1 .
−2 1 0 0
[ ] {[ ]}
0 0
8. We row reduce
[ ] [ ]
3 2 6 1 0 0
−1 1 2 ∼ 0 1 0 .
4 −2 3 0 0 1
[ ] {[ ]}
0 0
0 0
[ ][ ] [ ]
−1 5 2 52
9. Ab = = = 0, so b / ker (T ). We row-reduce to determine a solution
−
3 −15 −10 156
∈
of Ax = c,
[ ] [ ]
−1 5 −3 1 −5 0
3 −15 15
∼ .
0 0 1
Because no solutions exist, c ∈

/ range (T ) .
[ ][ 1
] [ ]
−1 3 1 −6
10. Ab = −2 = = 0, so b ∈/ ker (T ). We row-reduce to determine a solution
3 2 1 0
1
of Ax = c,
[ ] [ ]
−1 3 1 2 ∼
1 0 1
11 1
3 2 1 5 4 .
0 1 11 1
[ ]
1
0
[ ][ ] [ ]
1 −2 0
6
11. Ab = −1 2 = 0 = 0, so b ∈ ker (T ). We row-reduce to determine a solution of
3
−2 4 0
Ax = c, [ ] [ ]
1 −2 −1 1 −2 0
−1 2 3 ∼ 0 0 1 .
−2 4 2 0 0 0
Because no solutions exist, c ∈

/ range (T ) .
[ ][ ] [ ]
1 0 −3 1 7
12. Ab = −1 2 5 4 = −3 = 0, so b ∈/ ker (T ). We row-reduce to determine a solution
1 2 −1 −2 11
of Ax = c, [ ] [ ]
1 0 −3 −1 1 0 −3 −1
−1 2 5 5 ∼ 0 1 1 2 .
1 2 −1 3 0 0 0 0
[ ]
−1
0

[ ] [ ]
−1 3 1 0
2 1 ∼ 0 1 .
4 2 0 0

original ]matrix
[ ]} corresponding to the pivot columns of
−1 3
the row-reduced matrix. Hence a basis for S is 2 , 1 , and dim (S) = 2.
4 2

[ ] [ ]
3 −6 1 −2
2 −4 ∼ 0 0 .
−5 10 0 0
A basis for S is given by column 1 of the original

{[ matrix
]} corresponding to the pivot column of the
3
row-reduced matrix. Hence a basis for S is 2 , and dim (S) = 1.
−5
[ ] [ ]
2 1 4 1 0 3
1 5 −7 ∼ 0 1 −2 .
−4 −2 −8 0 0 0

original ]matrix
[ corresponding
]} to the pivot columns of
2 1
the row-reduced matrix. Hence a basis for S is 1 , 5 , and dim (S) = 2.
−4 −2

−1 2 1 1 0 3
2 −3 0 0 1 2
∼ .
0 2 4 0 0 0
1 −1 1 0 0 0
A basis for S is given by columns 1 and 2 of the original matrix corresponding to the pivot columns of
−1 2
2 −3
the row-reduced matrix. Hence a basis for S is , , and dim (S) = 2.
0 2
1 −1
17. We can express [ ]

[ ] [ ]
a 1 0
−b =a 0 +b −1
0 0 0
[ ] {[ ] [ ]} {[ ] [ ]}
a 1 0 1 0
and so the set of vectors S or the form −b is span 0 , −1 . Because 0 , −1
0 0 0 0 0
is a linearly independent set, it is a basis for S, and dim (S) = 2.

18. We can express
[ ] [ ] [ ]
a + 4b 1 4
a−b =a 1 +b −1
2a + 3b 2 3
[ ] {[ ] [ ]} {[ ] [ ]}
a + 4b 1 4 1 4
and so the set of vectors S or the form a−b is span 1 , −1 . Because 1 , −1
2a + 3b 0 3 0 3
is a linearly independent set, it is a basis for S, and dim (S) = 2.
−4 8 1 0
−1 3 ∼ 0 1 .
2 −4 0 0
[ ] {[ ]}
0 0
20. We row reduce
[ ] 1 0 2
1 4 2 7
−1 3 1 ∼ 0 1 3
.
7
0 14 6 0 0 0
− 27
x =s −3 .
7
1
− 72
7
1

−1 3 1 1 0 2
2 5 9 ∼ 0 1 1 .
{[ −2]} 3 −1 0 0 0
−2
1
22. We row reduce

1 2 −2 1 0 0
1 0 2 0 1 0
4 2 2 ∼ .
0 0 1
3 3 1 0 0 0
[ ] {[ ]}
0 0
0 0

−1 5 1 0
2 1 ∼ 0 1 .
3 1 0 0
] [ ]} {[
−1 5
A basis for the column space, determined from the pivot columns 1 and 2, is 2 , 1 . A
3
{[ ] [ 1 ]}
1 0
basis for the row space is determined from the nonzero rows of the echelon form, , . We
0 1
solve Ax = 0 and obtain null (A) = {0}, and so our null space has no basis.
24. We row reduce

[ ] 1 0 −11
13
2 1 −2
−1 5 3 ∼ 0 1 4 .
11
3 7 −1 0 0 0
{[ ] [ ]}
2 1
A basis for the column space, determined from the pivot columns 1 and 2, is −1 , 5 . A basis
3 7
1 0
for the row space is determined from the nonzero rows of the echelon form, 0 , 1 .
−13
11
4
11
13 13
11 11
Ax = 0 has solutions of the form x = s − 4

.A basis for the null space is − 4
, and
11 11
1 1
nullity(A) = 1.

1 −3 2 1 0 5
1 −2 3
∼ 0 1 1
.
{[ ] [ ]}
1 −3
A basis for the column space, determined from the pivot columns 1 and 2, is 1 , −2 . A
{[ ] [ ]}
1 0
basis for the row space is determined from the nonzero rows of the echelon form, 0 , 1 .
5 1
We solve Ax = 0 and obtain null (A) = {0}, and so our null space has no basis.
26. We row reduce

0 2 −1 1 0 0
1 −2 2 0 1 0
2 3 0
∼ .
0 0 1
−2 3 1 0 0 0
0 2 −1
1 −2 2
A basis for the column space, determined from the pivot columns 1, 2, and 3, is , , .
2 3 0
−2 3 1
{[ ] [ ] [ ]}
1 0 0
A basis for the row space is determined from the nonzero rows of the echelon form, 0 , 1 , 0 .
0 0 1
We solve Ax = 0 and obtain null (A) = {0}, and so our null space has no basis.
27. We row reduce

[ ] 1 0 −2
−1 1 3
37
2 1 1 ∼ 0 1 .
3
3 3 5 0 0 0
{[ ] [ ]}
−1 1
A basis for the range(T ), determined from the pivot columns 1 and 2, is 2 , 1 . Ax = 0
3 3
2 2
3 3
3
has solutions of the form x = s −7 , so a basis for ker (T ) is −7 .
3
1 1
{[ ] [ 1 ]}
−1
A basis for col(A) is also a basis for range(T ) , 2 , 1 . A basis for null (A) is also a basis
3 3
2
3
for ker (T ) , − 7 . A basis for the row space is determined from the nonzero rows of the echelon
3
1
1 0
form, 0 , 71
2
−3 3
28. We row reduce [ ] [ ] {[
1 1 −2 1 1 −2
−2 −2 4 ∼ 0 0 0 .
5 5 −10 0 0 0
]}
1
A basis for the range(T ), determined from the pivot column 1, is −2 . Ax = 0 has solutions
[ ] [ ] {[ 5
] [ ]}
−1 2 −1 2
of the form x = s1 1 + s2 0 , so a basis for ker (T ) is 1 , 0 .
0 1 0 1
{[ ]}
1
A basis for col(A) is also a basis for range(T ) , −2 . A basis for null (A) is also a basis for
5
{[ ] [ ]}
−1 2
ker (T ) , 1 , 0 . A basis for the row space is determined from the nonzero rows of the
0
{[ 1]}
1
echelon form, 1 .
−2
29. We row reduce [ ] [ 7

1 4 −1
2 −5 3 ] 1 0
∼ 13 .
0 1 − 13
5
{[ ] [ ]}
1 4
A basis for the range(T ), determined from the pivot columns 1 and 2, is , . Ax = 0
2 −5
7 − 7
− 13 13
has solutions of the form x = s 5 , so a basis for ker (T ) is 5 .

13 13
1 1
{[ ] [ ]}
1 4
A basis for col(A) is also a basis for range(T ) , , . A basis for null (A) is also a basis for
2 −5
− 13 7
5
ker (T ) , 13 . A basis for the row space is determined from the nonzero rows of the echelon
1
1 0
form, 0 , 1 .
7
13
− 13
5
30. We row reduce

0 2 −2 1 0 0
1 −2 3 0 1 0
−1 3 1
∼ .
0 0 1
−2 3 1 0 0 0
0 2 −2
1 −2 3
A basis for the range(T ), determined from the pivot columns 1, 2, and 3, is , ,
.
−1 3 1
−2 3 1
We solve Ax = 0 and obtain null (A) = {0}, and so ker (T ) = {0} , and ker (T ) has no basis.
0 2 −2
1 −2 3
A basis for (A) is also a basis for range(T ) , , , . A basis for null (A) is
−1 3 1
−2 3 1
also a basis for ker (T ) , and so there is no basis. A basis for the row space is determined from the
{[ ] [ ] [ ]}
1 0 0
nonzero rows of the echelon form, 0 , 1 , 0 .

0 0 1
[ ][ ] [ ]
2 3 1 −7
31. x = U [x] = =
B −1 5 −3 −16
[ ][ ] [ ]
2 1 −1 2 8
32. x = U [x] B = 1 1 0 3 = 5
0 3 2 −1 7
[ ]−1 [ ] [ ]
−1 1 2 3 19
33. [x] = U x= =
B 2 5 −2 −8
[ ]−1 [ ] [ ]
1 2 3 2 −2
34. [x]B = U −1
x= 1 1 1 −1 = −1
0 3 2 1 2
35. (a) True. If x ∈ null (A) , then T (x) = Ax = 0, and so x ∈ ker (T ) . And if x ∈ ker (T ) , then
Ax = T (x) = 0, so x ∈ null (A) .
[ ]
0 0
(b) False. For example, let A = , then null (A) = R2 , but range (T ) = 0 .
{ }
0 0
[ ] {[ ]}
1 0 0 = {0} .
36. (a) False. For example, let A = , then ker (T ) = span
0 0 1
[ ] {[ ]}
1 0 0
(b) False. For example, let A = , then ker (T ) = span = {0} .
0 0 1

(b) True, because null (A) is a subspace of R4 .
1 0
0 1
38. (a) False. For example, let S1 = span 0 , and S2 = span 0 . Then S1 ∩ S2 = {0} ,
0 0
0 0
so dim (S1 ∩ S2 ) = 0 < min (dim (S1 ) , dim (S2 )) = min (1, 1) = 1.
[ ] {[ ]} {[ ]}
0 1 1 0
(b) False. For example, let A = . Then col(A) = span , but row (A) = span .
0 0 0 1
39. (a) True. Suppose {a1 , . . . , an } is a basis for S. Let A be the matrix with columns a1 , . . . , an . Then
S = col (A) .
(b) True, by Theorem 4.14(a).
40. (a) True, because dim (S) ≤ n for all subspaces of Rn .
(b) False. By the rank–nullity theorem, for an 5 × 9 matrix A, rank (A) + nullity (A) = 9 = 5.

Linear Algebra With Applications 2nd Edition Holt Solutions Manual 1

Uploaded by

Document Information

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

Linear Algebra With Applications 2nd Edition Holt Solutions Manual 1

Uploaded by

Copyright:

Available Formats

Solution Manual for Linear Algebra with Applications

2nd Edition Holt 1464193347 9781464193347

Download full test bank at:

Thus, Ax = 0 has solutions of the form

Thus, Ax = 0 has solutions of the form

and, therefore, null (A) = span

So Ax = c has no solution, and c ∈

So Ax = c has no solution, and c ∈

4.1 Introduction to Subspaces

3. Not a subspace, because 0 + 0 = 1, and thus 0 is not in this set.

] 1 + b1 + c1 ) + (a2 + b2 + c2 ) = 0 + 0 = 0. Let r ∈ R and u ∈ S, then

that S is a subspace. (Alternatively, we have S = null ([ 1 1 1 ]), and hence S is a subspace.)

15. This subset is equal to null ([ 1 ··· 1 ]), which is a subspace.

16. This subset is equal to null ([ 1 −1 −1 ···

22. We row reduce [ ] [ ]

23. A is row-reduced, and we see that Ax = 0 has solutions of the form

24. We row reduce [ ] [ ]

Thus Ax = 0 has solutions of the form [ ]

Thus Ax = 0 has solutions of the form

Thus Ax = 0 has solutions of the form

27. We row reduce [ ] [ ]

28. We row reduce [ ] [ ]

Thus Ax = 0 has solutions of the form [ ]

and therefore null (A) = span 1 .

29. We row reduce [ ] [ ]

Thus Ax = 0 has the trivial solution x = 0 , and thus null (A) = 0 .

30. We row reduce [ ]

Thus Ax = 0 has solutions of the form

Thus Ax = 0 has solutions of the form

34. Ab = 4 = = 0, so b ∈ ker (T ). We row-reduce to determine a solution of

36. Ab = 4 5 6 −2 = 0 = 0, so b ∈ ker (T ). We row-reduce to determine a solution of

38. For example S1 = span 0 , S2 = span 1 . But S1 ∪ S2 is not a subspace, since 0

39. For example, S1 = 0 : x≥ 0 0 and S2 =

40. For example, S1 = 0 , 0 , S2 = 0 , 1 , then S1 ∩S2 = 0 is a subspace.

43. Let T (x) = Ax, where A = I3 , then range (T ) = R3 .

Ac = c1 a1 + · · · + cn an = 0, then every ci = 0. Thus, c = 0, which shows that T (x) = Ax = 0 has

The general solution to this system is [ ]

66. We solve the linear system

67. We solve the linear system

68. We solve the linear system

where s is any real number. The set of solutions is given by

70. Using a computer algebra system, we determine

71. Using a computer algebra system, we determine

72. Using a computer algebra system, we determine

4.2 Practice Problems

2. (a) Row-reduce the matrix with the given vectors as columns,

The basis for S is given by columns 1 and 2 of the original{[ matrix

The basis for S is given by columns 1, 2, and 3 of the original matrix

3. (a) The second vector is −1

Thus, Ax = 0 has solutions of the form

, and the dimension is 1.

Thus, Ax = 0 has solutions of the form

4.2 Basis and Dimension

6. Row-reduce the matrix with the given vectors as rows,

7. Row-reduce the matrix with the given vectors as rows,

Thus a basis for S is given by the non-zero row vectors, ] [ ]}

8. Row-reduce the matrix with the given vectors as rows,

A basis for S is given by columns 1 and 2 of the {[

12. Row-reduce the matrix with the given vectors as columns,

A basis for S is given by column 1 of the original

13. Row-reduce the matrix with the given vectors as columns,

A basis for S is given by columns 1, 2, and 3 of the {[

14. Row-reduce the matrix with the given vectors as columns,

A basis for S is given by columns 1 and 2 of the {[