Algebra Lineal

Vector Spaces .....................................................................................
102
Subspaces of Vector Spaces...............................................................106
Spanning Sets and Linear Independence...........................................108
Basis and Dimension..........................................................................112
Rank of a Matrix and Systems of Linear Equations .........................115
Coordinates and Change of Basis ......................................................120
Applications of Vector Spaces...........................................................124
Section 4.2
Section 4.3
Section 4.4
Section 4.5
Section 4.6
Section 4.7
Section 4.8
Copyright Houghton Mifflin Harcourt Publishing Company. All rights reserved.
Project Solutions.........................................................................................................138
Review Exercises ........................................................................................................131
Vectors in R n .......................................................................................97
Section 4.1
C H A P T E R 4
Vector Spaces
(4, 3)
(2, 5)
u
u+v
(4, 2)
3 4 5
4, 2 2, 3
4 2, 2 3
2, 5
2 3 4 5
(3, 1)
u+v
6
7
(2, 3)
2 1
10. u v
3 2 1
2
3
4
( 1, 4)
4
5
6
1, 4 4, 3
1 4, 4 3
3, 1
( 2, 5)
5 4 3 2 1
4 3 2 1
1
(2, 3)
6, 3
8. u v
6.
4.
2. v
Section 4.1 Vectors in R n
C H A P T E R
Vector Spaces
12 v v
( 32 , 1(
03, 2
12 3, 2
43, 2
2w
12
0, 0
23 , 1
12, 8
v = u 2w
(6, 4)
(4, 7)
0v
4v
(3, 2)
8
(12, 8)
4
(c) 0 v
1, 5
2, 3 23, 2
v = u + w
(2, 3)
1 2 3 4
(3, 2)
(b) 12 v
18. (a) 4 v
( 2, 3)
u 2w
( 1, 5)
3
2
u
w
( 3, 2)
16. v
3, 2
2, 3 3, 2
u w
( 2, 3)
14. v
2
2 w
2
(3, 2)
(5, 1)
2, 3
( 2, 3) 4
u w
v=u+w
12. v
4, 7
5, 1
97
Chapter 4
(2, 0, 1)
(1, 0, 12 )
32
2
1,
2
(c) 2 v u
3
4
for any c, w is not
, v is a scalar
for any c, u is not
23 , 34
3
4
26, 8, 3, 3, 5 0, 4, 3, 4, 4
12, 16, 6, 6, 10 0, 4, 3, 4, 4
12, 12, 9, 2, 14
218, 28, 6, 13, 11

36, 56, 12, 26, 22
2 0, 4, 3, 4, 4 18, 24, 9, 9, 15
2 0, 4, 3, 4, 4 36, 8, 3, 3, 5
0, 4, 3, 4, 4 6, 8, 3, 3, 5
6, 4, 6, 1, 9
(b) 2u 3v
30. (a) u v
a scalar multiple of z.
(c) Because 12, 0, 9 z c 12 , 23 ,
multiple of z.
(b) Because 1,
4,
3
a scalar multiple of z.
28. (a) Because 6, 4, 9 z c 12 , 23 ,
2v
(4, 0, 2)
(2, 0, 1)
1, 0,
2, 0, 1
(c)
1
2
4, 0, 2
1
2
2 2, 0, 1
(b) 2 v
1
v
2
2, 0, 1
2, 0, 1
21, 2, 3 2, 2, 1 4, 0, 4
2, 4, 6 2, 2, 1 4, 0, 4 0, 6, 9.
1 0, 6, 9
0, 2, 3.
3
26. (a) v
3z
So,
24. 2u v w 3z
0 implies that
3z
2u v w.
1
2
4, 0, 4
5, 10, 15 6, 6, 3 2, 0, 2
3, 4, 20
51, 2, 3 3 2, 2, 1
1, 2, 3 2, 2, 1 24, 0, 4
1, 0, 4 8, 0, 8 7, 0, 4
Vector Spaces
22. 5u 3v 12 w
20. u v 2w
98
2 2,
5
,
3
43 ,
0, 0, 0, 0
1 6, 5, 4, 3
20, 0, 0, 0
1
2
4v
12 , 0, 3, 4
au bw
0, 3
1 and b
Solving this system produces a

u w.
So, v
0
3.
a b
2a b
yields the system
a1, 2 b1, 1
2, 2, 0, 2 0, 6, 9, 3
2, 4, 9, 1
21, 1, 0, 1 30, 2, 3, 1
2u 3v
2u
1, 1, 3, 0
0, 2, 3, 1 1, 1, 0, 1
v u
v
3u w
40. The equation
38. w 3v
36. w u
(d)
4, 4, 2, 11
72 , 5, 72 , 112
(c) 2u w 3v
(b) 2w 12 u
6, 4, 2, 7
2, 2, 1, 3 you have:
(a) v 3w
1.

4, 103 , 83 , 2 6, 5, 4, 3
10, 253 , 203 , 5
2 6, 5, 4, 3 6, 5, 4, 3
34. Using a graphing utility with

u
1, 2, 3, 1, v 0, 2, 1, 2, and
(c) 2 v u
2 6, 5, 4, 3 3 2, 53 , 43 , 1
8, 203 , 163 , 4
6, 5, 4, 3 2, 53 , 43 , 1
(b) 2u 3v
32. (a) u v
1, 1
4.
1, 4
au1 bu 2 cu3
1 and b
0 and b
5
0.
2, b
1 and c
1. So, v
2, 5, 4, 0
2.
1.
13 v
0, 0, 8, 1
8
0 0 2 7
1 1 1 2
2 4 2 4
1
u1 u 2 2u3 u 4 2u5 .
0 0 0 0 1
1 0 0 0 1
0 1 0 0 2.
0 0 1 0 1
0 0 0 1 2
b 2c
1
3
1, 8, 0, 7
2.
1
1, 7, 2
99
2u1 u 2 u 3.
Solving this system you discover that there is no

solution, so, v cannot be written as a linear combination
of u1 , u 2 and u3 .
5a 3b 4c
3a
a 2b 3c
yields the system
5, 8, 7, 2, 4.
1, 1, 1, 2, 1 2, 1, 2, 1, 1 21, 2, 0, 1, 2 0, 2, 0, 1, 4 21, 1, 2, 1, 2
Verify the solution by showing that
So, v
0
0
The reduced row-echelon form for A is
1 2
1 1
1 2
2 1
1 1
au1 bu 2 cu 3
16
,2
3 3
0, 0,
13 , 83 , 0, 73
1 , 8 , 16 , 3
3 3 3
2
3
2u
3
Vectors in R n
a1, 3, 5 b 2, 1, 3 c 3, 2, 4
48. The equation
46. 2u v 3w
52. Write a matrix using the given u1 , u 2 , !, u 5 as columns and argument this matrix with v as a column.
a 4b 6c
2a 5b 3c
4
a 2b 2c
3a 2b
yields the system
a1, 3, 2, 1 b 2, 2, 5, 4 c 2, 1, 3, 6
50. The equation

So, v
u 2 w.
2a b
a b
yields the system
a1, 2 b1, 1
au bw
44. The equation

w
So, v
0u 1w.
1
1.
a b
2a b
yields the system
a1, 2 b1, 1
au bw
42. The equation
Section 4.1
Chapter 4
Vector Spaces
1
1
2
.
2
0
4
u1 1u 2 2u 3 2u 4 4u 6 .
av1 bv 2 cv 3
0.
b
a 2b 3c
(4) u 0
(6) cu
4, 2, 6 is a vector in
R3.
0, 0, 0
2, 1, 3
2, 1, 3
0, 0, 0
u v w .
2, 1, 3
2, 1, 3
2 2, 1, 3
(5) u u
3, 4, 0
2, 1, 3
v u
0.
5, 3, 3 7, 8, 4 12, 11, 1
2, 1, 3 3, 4, 0 7, 8, 4
2, 1, 3 10, 12, 4 12, 11, 1
So, u v w
u v w
5, 3, 3
R.
1, and so, v1 v 2 v 3
5, 3, 3 is a vector in
1, c
t , where t is any real number.
2, 1, 3 3, 4, 0 7, 8, 4
3, 4, 0
v w
2, 1, 3
(2) u v
(3)
3, 4, 0
1, b
0, 0, 0
t and c
2, 1, 3
1, you obtain a
t , b
60. (1) u v
Let t
Solving this system a
a
yields the homogeneous system
a1, 0, 1 b 1, 1, 2 c0, 1, 3
58. The equation
(b) False. The zero vector is defined as an additive identity.
56. (a) True. See page 183.
equals 8, 17, 16, 26, 0, 4.
11, 3, 4, 5, 2, 1 13, 2, 4, 3, 2, 1 21, 1, 1, 1, 4, 1 23, 1, 3, 4, 2, 3 4 4, 2, 1, 3, 1, 1
Verify the solution by showing that
8, 17, 16, 26, 0, 4
0 0 0 0 1
0 0 0 1 0
0 0 1 0 0
0 1 0 0 0
1 0 0 0 0
0 0 0 0 0
So, v
0
0
0
0
The reduced row-echelon form for A is
1 4
8
1 3 1 3
3 2 1 1 2 2 17
4 4 1 3
1 1 16
.
5 3 1 4 5 3 26
2
2
4
2
3
1
0

1 1 1 3 4 1 4
54. Write a matrix using the given u1 , u 2 , ! , u 6 as columns and augment this matrix with v as a column.
100
cd u.
1 2, 1, 3
2, 1, 3
(8)
d u
(7) cu v
v1 , ! , un vn
u1
v1 , ! , un vn w1 , ! , wn
0, ! , 0
u1
cu cv
cu du
Vectors in R n
101
d un
cu1 v1 , ! , un vn
cu1 cv1, ! , cun cvn
Rn.
c d u1, ! , un c d u1, ! , c
cu1 du1, ! , cun dun
cu1, ! , cun du1, ! , dun
cu1, ! , cun cv1, ! , cvn

cu1 , ! , un cv1 , ! , cvn
vn
c u1 , ! , un v1 , ! , vn
cu1 v1 , ! , cun
cu1, ! , cun is a vector in
0, ! , un 0
u1, ! , un u1 , ! , un
u1 u1, ! , un un 0, ! , 0
u1, ! , un
u1, ! , un v1 w1, ! , vn wn
u1, ! , un v1, ! , vn w1, ! , wn
u v w
u1 v1 w1, ! , un vn wn
u1 v1 w1 , ! , un vn wn
u1, ! , un
v1 , ! , un vn is a vector in R n .
u1 , ! , un v1 , ! , vn w1 , ! , wn
cu1 , ! , un
(5) u u
(6) cu
u1
v u
u1
v1 , ! , vn
u1, ! , un v1, ! , vn
v1 u1, ! , vn un
v1 , ! , vn u1, ! , un
u1, ! , un
v w
(4) u 0
(3)
(2) u v
(1) u v
62. Prove each of the ten properties.
(10) 1u
2, 1, 3
2, 1, 3
2 2, 1, 3 4, 2, 6
22, 1, 3 4, 2, 6
2, 1, 3
cu du.
2 1 2, 1, 3
212, 1, 3
So, c du
cd u
(9) c du
So, c d u
4, 2, 6
2 2, 1, 3 1 2, 1, 3
cu du
1 2, 1, 3
2 12, 1, 3
cu cv.
25, 3, 3 10, 6, 6
4, 2, 6 6, 8, 0 10, 6, 6
c d u
So, cu v
2 2, 1, 3 23, 4, 0
cu cv
(8)
2 2, 1, 3 3, 4, 0
(7) cu v
Section 4.1
(10) 1u
(9) c du
1u1, ! , 1u1
0.
0 0 0@.
>v1
v2
v3
v4 @.
10. In M 1,4 , the additive inverse of >v1 v2
v3
v4 @ is
8. In C f, f, the additive inverse of f x is f x.
0 0
.
0 0
6. The additive identity of M 2,2 is the 2 u 2 zero matrix
>0
4. The additive identity of M 1,4 is the 1 u 4 zero matrix
f x
2. The additive identity of C f, f is the zero function,
Section 4.2 Vector Spaces
(f) Use properties 4 of Theorem 4.2.
(e) Use properties 5 and 6 of Theorem 4.2.
(d) Property 5 of Theorem 4.2 is applied to the left hand

side. Property 3 of Theorem 4.2 is applied to the
right hand side.
(c) The fact that an equality remains an equality if you

add the same vector to both sides. You also used
property 6 of Theorem 4.2 to conclude that 0v is a
vector in R n , so, 0 v is a vector in R n .
(b) Use property 8 of Theorem 4.2.
(a) Use the fact that c 0 0 for any real number c,

so, in particular, 0 0 0.
u1, ! , un
u
2

2 8
4
5

17
x1

# .

xn
is
a b
.
c d
x is not a quadratic function.
f x g x
18. The set is not a vector space. Axiom 1 fails. For

x 2 and g x
x 2 x,
example, given f x
polynomial.
16. This set is not a vector space. The set is not closed under
addition or scalar multiplication. For example,
x5 x 4 x5 x3 x 4 x3 is not a fifth-degree
ten vector space axioms hold.
14. M 1,1 with the standard operations is a vector space. All
a b
c d
12. In M 2,2 , the additive inverse of
b is inconsistent if b is not a linear

The system Ax
combination of the columns of A.
70. If b
x1a1 " xna n is a linear combination of the
columns of A, then a solution to Ax
b is
3

Yes. 9
6

1 2 3
1 0 1
68. 7 8 9 0 1 2
4 5 6
0 0 0
(d) Use property 10 of Theorem 4.2.
(c) Use the property of reals that states that the product
of multiplicative inverses is 1.
(b) Use property 9 of Theorem 4.2 on the left side and

property 4 of Theorem 4.3 (proved in exercise 65)
on the right side.
66. Justification for each step.

(a) Equality remains if both sides are multiplied by a
non-zero constant. Property 6 of Theorem 4.2
assures you that the results are still in R n .
c d u1 , ! , un
c du1 , ! , dun c du1 , ! , c dun
cd u1, ! , cd un cd u1, ! , un cd u
Vector Spaces
1u1 , ! , un
Chapter 4
64. Justification for each step:
102
2 2
.
2 2
2, 3, 0
z 2, 3, 4.
x, y , z
0, 0, 0
(d)
c x, y , z
x2 , y2 , z2
(6)
(5)
(4)
(3)
x2 , y2 , z2
x1, y1, z1
(2)
hold.
1
1
x 1 1, y
x, y , z
1 z3 1
z3 1 1
2 1
1 1, z 1 1
x, y, z x 2, y 2, z 2
x x 2 1, y y 2 1, z z
1, 1, 1
2, y 2, z 2:
1, 1, 1
x , y , z
x
c x, y , z R 3
x, y , z
x , y , z
1, 1, 1: x, y, z
x1, y1, z1 x2 , y2 , z2 x3 , y3 , z3
x1, y1, z1 x2 x3 1, y2 y3 1, z2 z3 1
x1 x2 x3 1 1, y1 y2 y3 1 1, z1 z2
x1 x2 1 x3 1, y1 y2 1 y3 1, z1 z2
x1 x2 1, y1 y2 1, z1 z2 1 x3 , y3 , z3
x1 , y1 , z1 x2 , y2 , z2 x3 , y3 , z3
0
2 0
.
0 0
28. C>0, 1@ is a vector space. All ten vector space axioms
x1 x2 1, y1 y2 1, z1 z2
x2 x1 1, y2 y1 1, z2 z1
x2 , y2 , z2 x1, y1, z1
x2 , y2 , z2 R 3
x1, y1, z1
(1)
103
Each matrix on the left is nonsingular, and the sum is

not.
1 0 1 0
0 1 0 1
x1 x2 1, y1 y2 1, z1 z2 1
cx c 1, cy c 1, cz c 1
This is a vector space. Verify the 10 axioms.
x1, y1, z1
Vector Spaces
addition nor scalar multiplication. A counterexample is
z 2, 3, 4 for all choices of x, y, z .
23, 3, 3 6, 6, 6
2, 2, 2 2, 2, 2 5, 5, 5
So, cu v z cu cv.
21, 1, 1 21, 1, 1
2 1, 1, 1 1, 1, 1
(c) Axiom 7 fails. For example,
2, 3, 4
(b) Axiom 4 fails because there is no zero vector. For instance,
1 2, 3, 4
30. (a) Axiom 10 fails. For example,
Each matrix on the left is in the set, but the sum is not in
the set.
1 1 1 1
1 1 1 1
addition nor scalar multiplication. A counterexample is
22. The set is a vector space.
because x 0, y 0.
20. The set is not a vector space. Axiom 6 fails. A

counterexample is 2 4, 1 8, 2 is not in the set
Section 4.2
1x 1 1, 1y
x, y , z
1 1, 1z 1 1
cd x, y, z
cdx d 1 c 1, cdy d 1 c 1, cdz d
cd x cd 1, cd y cd 1, cd z cd 1
c dx d 1, dy d 1, dz d 1
1 c 1
1, c d y c d 1, c d z c d 1
cx c 1 dx d 1 1, cy c 1 dy d 1 1, cz c 1 dz
cx c 1, cy c 1, cz c 1 dx d 1, dy d 1, dz d 1
c x, y , z d x, y , z
c d x c d
d 1 1
c 1 1
1, 1, 1
c u a a
c*u
is also a vector space. Letting a
u a v a a
u v
0, 0
u, 2u
0, 0
u, 2u
(6) cu
0, 0
u.
cu, 2cu is in the set.
u, 2u .
u, 2u u, 2u
cu , 2u
u, 2u
u u
(5) The additive inverse of u , 2u is
u 0
v u.
2 w
u, 2u v, 2v w, 2w u, 2u v w, 2v 2w
u v w, 2u 2v 2w u v w, 2u 2v
u v, 2u 2v w, 2w u, 2u v, 2v w, 2w
u v w
(4) The zero vector is
(3) u v w
u, 2u v, 2v u v, 2u 2v
v u, 2v 2u v, 2v u, 2u
(2) u v
2v
u, 2u v, 2v u v, 2u
u v, 2u v is in the set.
(1) u v
R 3 gives the above example.
Note: In general, if V is a vector space and a is a constant vector, then the set V together with the operations
(10) 1 x, y, z
c d x , y , z
(9)
d x, y, z
x2 1 c 1, c y1 y2 1 c 1, c z1 z2 1 c 1
cx1 c 1 cx2 c 1 1, cy1 c 1 cy2 c 1 1, cz1 c 1 cz2
cx1 c 1, cy1 c 1, cz1 c 1 cx2 c 1, cy2 c 1, cz2 c 1
c x1 , y1 , z1 c x2 , y2 , z2
c x1
c x1 x2 1, y1 y2 1, z1 z2 1
c x1 , y1 , z1 x2 , y2 , z2
Vector Spaces
(8)
(7)
Chapter 4
32. Verify the ten axioms in the definition of vector space.
104
cu v, 2u 2v
u, 2u
c d u , 2u
1
x
1
x
x
1
x1
x.
xd
x x
xdc
dc x
xc y c
x x
c
xc V .
xy c
c d
y z
Zero vector is 1
xy z
cd x
cx dx
xc y c
cx cy
additive inverse of x is
x
1 x
y z
Vector Spaces
105
1 is not a polynomial of degree 1, but is a sum of
0 v
0 v 0 v .
0 v 0 v 0 v
0 v 0.
0 v, as required.
But the right hand side is equal to 0v by property 4 of the definition of a vector space, and so you see that 0
By property 5 of the definition of a vector space applied to both sides you see that
0 v 0 v
Apply property 3 of the definition of a vector space to the right hand side to obtain
0 v 0 v
definition of a vector space. Add 0 v to both sides of the last equality to obtain
38. Prove that 0 v

0 for any element v of a vector space V. First note that 0v is a vector in V by property 6 of the definition of a
vector space. Because 0 0 0, you have 0 v
0 0 v 0 v 0 v. The last equality holds by property 8 of the
(c) True. This set is a vector space, because all ten vector space axioms hold.
polynomials of degree 1.
(b) False. The first axiom is not satisfied, because x 1 x
36. (a) True. For a set with two operations to be a vector space, all ten axioms must be satisfied. Therefore, if one of the axioms
fails then this set cannot be a vector space.
(10) 1x
y
cd
dxc
d x
(9) c dx
(8)
(7) c x y
(6) For c R, x V , cx
(5) x
1x
x yz
x1
x yz
xy V
y x
yx
(3) x y z
xy
(4) x 1
(2) x y
(1) x, y V x y
positive real numbers
c du , d 2u c du , c d 2u
cd u, cd 2u cd u, 2u cd u
cu du
d u , 2u c d u , c d 2u cu du , c 2u d 2u
cu, c2u du, d 2u cu, 2u d u, 2u
cu cv
34. Yes, V is a vector space. Verify the 10 axioms
(10) 1u
c u , 2u v, 2v
cu v, c2u 2v cu cv, c2u c2v
cu, c2u cv, c2v cu, 2u cv, 2v
1u , 2u
d u
(9) c du
(8)
(7) cu v
Section 4.2
Chapter 4
Vector Spaces
3 y1 and
x1
3 y2 ,
3 y1 x2 , y2 , 2 x2 3 y2
x2 , y2 , 2 x2
x2 , y1 y2 , 2 x1 x2 3 y1 y2 W .
cx, cy, 2cx 3cy W .
and
b2
0
c2
db
da
da db 0 W .
dc
0
4, 2 W
1
2
4, 3
2, 23 W .
10. This set is not closed under scalar multiplication. For

example,
4, 2 W .
2, 1
2 2, 1
and
2, 1
closed under addition or scalar multiplication. For

example,
8. The vectors in W are of the form a, 1. This set is not
any real number c and for any differentiable function

f W , cf is differentiable, and therefore cf W .
differentiable on >0, 1@, and so f g W . Also, for
6. Recall from calculus that differentiability implies

continuity. So, W V . Furthermore, because W is
nonempty, you need only check that W is closed under
addition and scalar multiplication. Given differentiable
functions f and g on [0, 1], it follows that f g is
b
a
d a b 0
0
c
b2
0 W
c2
3 W.
2 0
W.
0 2
2 0
W
0 2
5, 13 W
6, 18 W .
2, 4
23, 9
and
3, 9
closed under addition or scalar multiplication. For

example,
18. The vectors in W are of the form a, a 2 . This set is not
1 0
2
0 1
1 0 1 0
0 1 0 1
16. This set is not closed under addition or scalar

multiplication. For example,
14. This set is not closed under addition. For example,

3, 4, 5 5, 12, 13 8, 16, 18 W .
f x g x
12. This set is not closed under addition. For example,

consider f x
x 1 and g x
x 2, and
a1 a2
b1 b2
0 W.
a1 a2 b1 b2
c1 c2
0
a2
a2 b2
Furthermore, for any real number d,
b1 a2
a1

a1 b1 0 a2 b2
c1 0
0
it follows that
b1
a1
a1 b1 0 W
c1
0
4. Because W is nonempty and W M 3,2 , you need only check that W is closed under addition and scalar multiplication. Given
c x, y , 2 x 3 y
Furthermore, for any real number c and x, y, 2 x 3 y W , it follows that
x1, y1, 2 x1
it follows that
x1, y1, 2 x1
2. Because W is nonempty and W R 3 , you need only check that W is closed under addition and scalar multiplication. Given
Section 4.3 Subspaces of Vector Spaces
40. Suppose, by way of contradiction, that there are two distinct additive identities 0 and u 0 . Consider the vector 0 u 0 . On one
hand this vector is equal to u 0 because 0 is an additive identity. On the other hand, this vector is also equal to 0 because u 0 is
an additive identity. So in contradiction to the assumption that 0 and u 0 are distinct you obtain 0 u 0 . This proves that the
additive identity in a vector space is unique.
106
107
1, 1, 4
under addition.
0, 0, 4
1, 1, 8 W , so W is not closed
32. W is not a subspace of R 3 . For example,

0, 0, 4 W and 1, 1, 4 W , but
addition and scalar multiplication.
30. This set is a subspace of M m ,n because it is closed under
28. This set is not a subspace, because it is not closed under

addition.
26. This set is not a subspace, because it is not closed under

scalar multiplication.
Subspaces of Vector Spaces
t1 , t1 s2 , s2 t2 , t2
s1
cs1, cs1
ct1 , ct1 W .
^ x, 0 : x R` R 2 ,
^0, y : y R` R 2 .
1, 1 is not.
d ax by cz
dax dby dcz W .
Similarly, if ax by cz W and d R, then
a1x b1y c1z a2x b2y c2 z

a1x a2x b1y b2y c1z c2z
a1 a2 x b1 b2 y c1 c2 z W .
Then
a2 x b2 y c2 z W .
a1x b1y c1z W ,
40. Because W is not empty (for example, x W ) you

need only check that W is closed under addition and
scalar multiplication. Let
1, 0 0, 1
Then the set W U is not closed under addition,

because 1, 0, 0, 1 W U , but
(c) False. Let
(b) True. Because W must itself be a vector space under

inherited operations, it must contain an additive
identity.
not proper subspaces, even though they are

subspaces.
38. (a) False. Zero subspace and the whole vector space are
2, 2, 2 W . So, W is not closed under addition.
cAx
c0
Ax Ay
0.
0 0
0,
x R`,
R 2 . Consider
^ x, 0 :
^0, y :
y R`.
but 1, 1 (which is the sum of these two vectors) is not.
Then W U is not a subspace of V, because it is not

closed under addition. Indeed, 1, 0, 0, 1 W U ,
44. Let V
Therefore, x y W and cx W .
Acx
A x y
42. Because W is not empty you need only check that W is

closed under addition and scalar multiplication. Let
c R and x, y, W . Then Ax
0 and Ay
0. So,
s2 , s1 s2 t1 t2 , t1 t2 W .
36. W is not a subspace of R . For example,

1, 1, 1 W and 1, 1, 1 W , but their sum,
c s1 , s1 t1 , t1
Furthermore, if c is any real number,
s1, s1
sum is also in W.
34. W is a subspace of R 3 . Note first that W R 3 and W is nonempty. If s1 , s1 t1 , t1 and s2 , s2 t2 , t2 are in W, then their
closed under addition or scalar multiplication.
24. This set is not a subspace of C f, f because it is not
under addition and scalar multiplication.
22. This set is a subspace of C f, f because it is closed
under addition and scalar multiplication.
20. This set is a subspace of C f, f because it is closed
Section 4.3
Chapter 4
Vector Spaces
f1 f 2 xdx
f1 x f 2 xdx
00
0 cf xdx
c0
0 cf S .
f1 f 2 S
c f xdx
1, 5, 5
5.
5
6
c2
c2
2c1
2c1
14
and c2
5
2 . So,
5
v can be written as a linear combination of the vectors in S.
c2
c2
2c1
9 and c2
4. So, w can be written as a linear combination of the vectors in S.
3
c2
c2
2c1
The solution of this system is c1
4
c1 2c2
2c1
2 and c2
1. So, z can be written as a linear combination of vectors in S.
(d) Proceed as in (a), substituting 4, 3, 3 for 1, 5, 5, which yields the system
The solution to this system is c1
22.
1
22
c1 2c2
2c1
(c) Proceed as in (a), substituting 1, 22, 22 for 1, 5, 5. So, the system to be solved is
6.
2
c1 2c2
(b) Proceed as in (a), substituting 2, 6, 6 for 1, 5, 5. So, the system to be solved is
This system has no solution. So, u cannot be written as a linear combination of the vectors in S.
c2
c2
2c1
2c1
c1 2c2
for c1 and c2 yields the system
c1 1, 2, 2 c2 2, 1, 1
2. (a) Solving the equation
Section 4.4 Spanning Sets and Linear Independence
48. Let c be scalar and u V W . Then u V and u W , which are both subspaces. So, cu V and cu W , which
implies that cu V W .
So, S is closed under addition and scalar multiplication.
0 cf xdx
0 f1 xdx 0 f 2 xdx
If f S and c R, then
46. S is a subspace of C>0, 1@. S is nonempty because the zero function is in S. If f1 , f 2 S , then
108
60.
6c1
3
4
27
2
53 .
8
8c1 4c2
for 42, 113, 112, 60, which yields the system
5. So, v can be written as a linear combination of the vectors in S.
17
4.
8c1 4c2
6c1
c2
u1
u2 .
and c2
R 2 . Solving the
1
2
5
. So,
4
The system has a unique solution because the

determinant of the coefficient matrix is nonzero. So, S
spans R 2 .
c1
c1 2c2
u1, u2
u1, u2 be any vector in

c1 1, 1 c2 2, 1
equation
6. Let u
c2
4
1
7c1 6c2
6c1 4c2
c2
u1
u2 .
R 2 . Solving the
109
span(S). S spans a line in R 2 .
10. S does not span R 2 because only vectors of the form

t 1, 1 are in span(S). For example, 0, 1 is not in

spans R 2 .
2c1
u1, u2

c1 2, 0 c2 0, 1
equation
8. Let u
z can be written as a linear combination of vectors in S.

(d) Proceed as in (a), substituting 8, 4, 1, 17
4
This system has no solution. So, w cannot be written as a linear combination of the vectors in S.
c2
14
7c1 6c2
6c1
4
6c1 4c2
27 53
,
2 8
and c2
(c) Proceed as in (a), substituting 4, 14,
c2
19 .
2
14
8c1 4c2
6c1
7c1 6c2
6. So, u can be written as a linear combination of the vectors in S.
Spanning Sets and Linear Independence
14, 19
2
49 99
, ,
2 4
49
2
99
4
6c1 4c2
(b) Proceed as in (a), substituting
11 and c2
42, 113, 112, 60
c2
113
112
8c1 4c2
42
7c1 6c2
6c1 4c2
c1 6, 7, 8, 6 c2 4, 6, 4, 1
4. (a) Solving the equation
Section 4.4
Chapter 4
Vector Spaces
u2 .
2c1 4c2
R 2 . Solving the
u2 .
2c1
u3.
6c1 4c2 2c3
0.
c3 c4
c2 c3 c4
c1 c2 c3 c4
This system has only the trivial solution c1
c4
you obtain the homogeneous system
c2
c3
c1 0, 0, 0, 1 c2 0, 0, 1, 1 c3 0, 1, 1, 1 c4 1, 1, 1, 1
34. From the vector equation
This system has a unique solution because the

spans R 3 .
u1
u2
c3
7c1 2c2 3c3
6c1 3c2
for c1 , c2 and c3 yields the system
u1, u2 , u3
R 3 . Solving the
c1 6, 7, 6 c2 3, 2, 4 c3 1, 3, 2
equation
18. Let u
c1
u1 , u2 , u3 be any vector in
So, for any u
c3
2u1 u2 .
u1, u2
R 2 . Solving the
u1, u2 in R 2 , you can take

0, c2
2u1 u2 3, and
2c2 u1
u1 2u2 3. So, S spans R 2 .
3c2 3c3
This system is equivalent to

c1 2c2 c3
u1
c2 c3
u1
c1 2c2 c3
c1 1, 2 c2 2, 1 c3 1, 1
equation
16. Let u

spans R 2 .
u1
c2
u1 , u2
c1 0, 2 c2 1, 4
equation
14. Let u
span(S). S spans a line in R 2 .
12. S does not span R 2 because only vectors of the form

t 1, 2 are in span(S). For example, 0, 1 is not in
110
c1
u3.
c3
u1, u2 , u3
R 3 . Solving the
21, 0, 3
21, 0, 3 2, 0, 1
21, 2
0, 0.
0, 0.
c2 3, 4,
7
2
2c3
0.
7
c
2 2
0
0
3
c
2 3
4c2 6c3
3c2
0, 0, 0
1, 0, 0

5
4
0, 4, 0

1
2
0, 0, 6
0. So, the set S is linearly independent.
1, 5, 3
32. Because the fourth vector is a linear combination of the

first three, this set is linearly dependent.
This system has only the trivial solution

c1
c2
c3
0. So, the set S is linearly independent.
3
c
4 1
5
c
2 1
3
c
2 1
c3 32 , 6, 2
c1 34 , 52 ,
3
2
set S is linearly independent.
28. Because 1, 3, 2 is not a scalar multiple of 6, 2, 1, the
31, 0 1, 1 2, 1
26. This set is linearly dependent because
2, 4
24. This set is linearly dependent because
So, S spans a plane in R 3 .
4, 0, 5
2, 0, 6
22. This set does not span R 3 . Notice that the third and
fourth vectors are spanned by the first two.
This system has a unique solution because the

spans R 3 .
u2
u1
c2 c3
c1 c2
0, 0, 0, 0
c4
u1 , u2 , u3 be any vector in
c1 1, 0, 1 c2 1, 1, 0 c3 0, 1, 1
equation
20. Let u
2 1, 2 00, 6
0, 0.
2 1, 2 00, 6.
21, 2, 3, 4 1, 0, 1, 2.
c3
0.
c3
0
0.
c1 x 2 2 x c2 x3 8 c3 x3 x 2 c4 x 2 4
8c2
c4
4c4
c3
c2 c3
a3
a0 .
a1
a2
c1
0
0.
0 0 x 0 x 2 you obtain
i 1
ci vi , where
v i S . So, v i U ,
because U contains S. Because U is a subspace, u U .
50. Let U be another subspace of V that contains S. To show

that span S U , let u span S . Then
111
0 0x 0x2
0.
This system has only the trivial solution. So, S is linearly

independent.
c1 c2
c2
you obtain the homogenous system
c1 x 2 c2 x 2 1
This system has only the trivial solution. So, S is linearly

independent.
2c2
c1 5c2
the homogenous system

c1 x 2 1 c2 2 x 5
a0 a1 x a2 x 2 a3 x3
sets of vectors span R 3 .
0 0 2
1 0 0
52. The matrix 0 1 1 row reduces to 0 1 0 and

1 1 1
0 0 1
1 1 2
1 0 0
1 1 1 row reduces to 0 1 0 as well. So, both
0 0 1
1 2 1
This system has a unique solution because the determinant of the coefficient matrix is nonzero. So, S spans P3 .
2c1
c1
for c1 , c2 , c3 and c4 yields the system
0 0
0 0
Because this system has only the trivial solution

c1
c2
c3
0, the set of vectors is linearly
independent.
0.
5c1 3c2 23c3
4c1 2c2 22c3
0
0
c3
8c3
c1 4c2
c1 3c2
1 1
4 3
1 8
c1
c2
c3
4 5
2 3
22 23
Spanning Sets and Linear Independence
48. Let a0 a1 x a2 x 2 a3 x3 be any vector in P3 . Solving the equation
linearly independent if t z 0 or t z
1.
2
The coefficient matrix will have nonzero

determinant if 2t 2 t z 0. That is, the set will be
tc1
tc1 c2
(b) Proceeding as in (a), you obtain the homogeneous

system
0
tc1 tc2 tc3
c3
0, the set will be linearly
Because c2
independent if t z 0.
c2

0
tc1
c1 t , 0, 0 c2 0, 1, 0 c3 0, 0, 1
40. (a) From the vector equation
1, 4, 5, 6
0, 0, 0
0, 0, 0, 0.
Solving this equation for 1, 4, 5, 6 yields
21, 2, 3, 4 1, 0, 1, 2 1, 4, 5, 6
38. One example of a nontrivial linear combination of

vectors in S whose sum is the zero vector is
2, 4
Solving this equation for 2, 4 yields
2, 4
36. One example of a nontrivial linear combination of

vectors in S whose sum is the zero vector is
Section 4.4
Chapter 4
Vector Spaces
1 0 0
0 1 0 which
0 0 1
u1

u2
u3

0.
c1u1 " cnu n v
c1
c
u1 " n u n
c
c
8. A basis for R 2 can only have two vectors. Because S has

three vectors, it is not a basis for R 2 .
^1, x, x 2`
6. There are three vectors in the standard basis for P2 .
1 0 0 0

0 1 0 0
, , ,
0 0 1 0
0 0 0 1

4. There are four vectors in the standard basis for M 4,1.
2. There are four vectors in the standard basis for

R 4 . ^1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1`
Section 4.5 Basis and Dimension
cv
independent. So,
But, c z 0 because û1 , ! , u n` are linearly
c1u1 ! cnu n cv
scalars c1 , ! , cn , c not all zero, such that
60. Because û1 , ! , u n , v` is linearly dependent, there exist
S 2 , you have v
c1u1 " cnu n , which implies that
S 2 is linearly dependent.
58. If S1 is linearly dependent, then for some

u1 , ! , u n , v S1 , v
c1u1 " cnu n . So, in
is nonsingular.
1 3 0 c1

2 2 0c2
3 1 1c3
only has the trivial solution. So, the three vectors are
linearly independent. Furthermore, the vectors span
R 3 because the coefficient matrix of the linear system
c1 1, 2, 3 c2 3, 2, 1 c3 0, 0, 1
1 3 0
56. The matrix 2 2 0 row reduces to
3 1 1
shows that the equation
(b) True. See the definition of spanning set of a vector

space on page 209.
of the vectors of this set can be written as a linear

combination of the others.
54. (a) False. A set is linearly dependent if and only if one
112
d1
c1d k v1 " d k 1 ck 1d k v k 1
d1v1 " d k 1v k 1 d k c1v1 " ck 1v k 1
d1v1 " d k 1v k 1 d k v k
c1v1 " ck 1v k 1. For any vector
u w v u w
c2
c3
If A
0, then ^ Av1 , Av 2 , Av 3`
0, 0, 0
20. S is not a basis, because it has too many vectors. A basis

for R 3 can only have three vectors.
18. S does not span R 3 , although it is linearly independent.
S is linearly dependent and is, therefore, not a basis for

R3.
1 2, 1, 2 2, 1, 2 4, 2, 4
16. A basis for R 3 contains three linearly independent

vectors. Because
12. S is linearly dependent and does not span R 2 .
10. S is linearly dependent and does not span R 2 .
dependent.
^0` is linearly
0, proving that ^ Av1 , Av 2 , Av 3` are
linearly independent.
c1
Because ^v1 , v 2 , v 3` are linearly independent,
c1v1 c2 v 2 c3 v 3
A1 0
Ac1v1 c2 v 2 c3 v 3
A1 Ac1v1 c2 v 2 c3 v 3
0
0
c1 Av1 c2 Av 2 c3 Av 3
68. Consider
66. The vectors are linearly dependent because
64. A set consisting of just one vector is linearly independent

if it is not the zero vector.
which shows that u span v1 , ! , v k 1 .
62. Suppose the v k

u V,
0.
4c1 2c2 12c3 42c4
0
0
0.
0
3c3
3c4
2c4
5c2 5c3
c2
2, c2
1, c3
3 and c4
2, c4
1, the vectors
1 ), the set is linearly
1, c3
0, 0, 0
This system has only the trivial solution. So, S consists of exactly four linearly independent vectors. Therefore, S is a
basis for P3 .
4c1
c1
which yields the homogeneous system
c1 4t t 2 c2 5 t 3 c3 3t 5 c4 2t 3 3t 2
46. Form the equation
dependent, and is not a basis for M 2,2 .
2, c2
So, S is not a basis for R 3 .
10, 0, 0 01, 5, 6 06, 2, 1
40. This set contains the zero vector, and is, therefore,
linearly dependent.
0, 0, 0, 0.
0 0
0 0
Because this system has nontrivial solutions (for instance, c1
5c1 6c2 11c3 17c4
0
0
c1 2c2 4c3 12c4
2c1 7c2 9c3 16c4
1 2
2 7
4 9
12 16
c1
c2
c3
c4
5 4
6 2
11 12
17 42
are linearly dependent, and S is not a basis for R 4 .
113
36. Because the vectors in S are not scalar multiples of one

another, they are linearly independent. Because S
consists of exactly two linearly independent vectors, it is
a basis for R 2 .
independent vectors, it is a basis for R 2 .
Because the corresponding linear system has nontrivial solutions (for instance, c1
c1 1, 0, 0, 1 c2 0, 2, 0, 2 c3 1, 0, 1, 0 c4 0, 2, 2, 0
Basis and Dimension
34. Because ^v1 , v 2` consists of exactly two linearly
42. To determine if the vectors of S are linearly independent, find the solution to
28. S does not span M 2,2 , although it is linearly independent.
has two vectors, it is not a basis for M 2,2 .
26. A basis for M 2,2 must have four vectors. Because S only
16 x 3 13x 2 31 2 x x 2
24. S is not a basis because the vectors are linearly

dependent.
22. S is not a basis because it has too many vectors. A basis

for P2 can only have three vectors.
Section 4.5
Chapter 4
Vector Spaces
c3 2c4
0.
0.
2c4
3c3 5c4
2c2
c4
0, 0, 0
2, and c4
51, 0, 0 51, 1, 0 81, 1, 1
8, 3, 8.
0, 0, 0
8, 3, 8
1, c2
vectors, the dimension of M 3,2 is 6.
62. Because a basis for M 3,2 has six linearly independent
60. Because a basis for P4 has five linearly independent

vectors, the dimension of P4 is 5.
58. Because a basis for R 3 has three linearly independent

vectors, the dimension of R 3 is 3.
^1, 3, 2, 4, 1, 1, 2, 7, 3` is linearly dependent.
^1, 3, 2, 4, 1, 1, 2, 1, 1`, ^1, 3, 2, 2, 7, 3, 2, 1, 1`, ^4, 1, 1, 2, 7, 3, 2, 1, 1`
The set
1. So,
11, 4, 7 33, 0, 1 1 2, 1, 2.
3 and c3
66. Although there are four subsets of S that contain three vectors, only three of them are bases for R 3 .
Because this basis has 6 vectors, the dimension is 6.
c3
c2 2c3
56. Because a basis for R 4 has four linearly independent

vectors, the dimension of R 4 is 4.
yields c1
1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0
0 0 0, 1 0 0 , 0 0 0 , 0 1 0 , 0 0 1 , 0 0 0.
0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1

64. One basis for the space of all 3 u 3 symmetric matrices is
01, 0, 1 10, 0, 0 00, 1, 0
52. The set S contains the zero vector, and is, therefore,
linearly dependent.
8. So,
7c1
5, and c3
c3
5, c2
c1 3c2 2c3
4c1
c2 c3
yields c1
0.
This system has only the trivial solution, so S is a basis

for R 3 . Solving the system
c1 c2 c3
This system has only the trivial solution, so S is a basis

for R 3 . Solving the system
c2 2c3
0.
c3
2c3
4c1
7c1
c2 c3
c1 3c2 2c3
c1 1, 4, 7 c2 3, 0, 1 c3 2, 1, 2
0, 0, 0
1 ). Therefore, S is not a basis for
1, c3
1, c2
c1 c2 c3
c1 1, 0, 0 c2 1, 1, 0 c3 1, 1, 1
P3 because the vectors are linearly dependent.
This system has nontrivial solutions (for instance, c1
c1
c1
c1 t 3 1 c2 2t 2 c3 t 3 c4 5 2t 2t 2 t 3
114
R3.
^0, 1`.
1, t
0, and then s
^5, 3, 1, 1`.
^1, 0, 1, 2, 4, 1, 0, 1`.
1.
^ p1, ! , pn`. Let
Exercise 84, you could reduce this set to an independent

spanning set of less than n vectors. But then dimV z n.
86. If a set ^v1 , ! , v m` spans V where m n, then by
a linear combination of vectors in S1. You now consider

spanning set S1. If S1 is linearly independent, you are
done. If not repeat the process of removing a vector
which is a linear combination of other vectors in S1 to
obtain spanning set S 2 . Continue this process with
S2 . Note that this process would terminate because the
original set S is a finite set and each removal produces a
spanning set with fewer vectors than the previous
spanning set. So, in at most n 1 steps the process
would terminate leaving you with minimal spanning set,
which is linearly independent and is contained in S.
84. Let the number of vectors in S be n. If S is linearly

independent, then you are done. If not, some v S is a
linear combination of other vectors in S. Let
S1
S v. Note that span S span S1 because v is
But, n 1 vectors span a vector space of at most

dimension n 1, a contradiction. So, S is linearly
independent, and therefore a basis.
v1 , ! , v n 1 , and therefore, ^v1 , ! , v n 1` spans V.
contradiction, that S is linearly dependent. Then,

some v i S is a linear combination of the other
vectors in S. Without loss of generality, you can
assume that v n is a linear combination of
linearly independent, which is impossible by

Theorem 4.10. So, S does span V, and therefore is a
basis.
(2) Let S
^v1, ! , v n` span V. Suppose, by way of
1
2
^1, , 0, 1` or ^1, 0, 0, 1`.
So, a basis for the column space of the matrix is
1 1 1 0
2 or

.
0 1 0 1
(c) Row-reducing the transpose of the original matrix

produces
^1, 2, 0, 1` or ^1, 0, 0, 1`.
the rank of the matrix is 2.

(b) A basis for the row space of the matrix is
1 2 1 0
or
0 1 0 1
2. (a) Because this matrix row reduces to
^0, 1, 2`.
(c) A basis for the column space is ^>1@`.
(b) A basis for the row space is
4. (a) Because this matrix is row-reduced already, the rank

is 1.
Section 4.6 Rank of a Matrix and Systems of Linear Equations
m be the maximum degree of all polynomials in B. Then

the polynomial x m 1 is not in the span of B, and so, P is
not finite-dimensional.
80. Suppose that P had a finite basis B
(b) False. A set of n 1 vectors could be linearly

dependent, for instance, they can all be multiples of
each other.
^v1, ! , v n` be a linearly independent set of
115
vectors. Suppose, by way of contradiction, that S

does not span V. Then there exists v V such that
v span v1 , ! , v n . So, the set ^v1 , ! , v n , v` is
82. (1) Let S
Rank of a Matrix and Systems of Linear Equations
78. (a) True. See Theorem 4.10 and definition of dimension

on page 225.
(b) The dimension of W is 2.
76. (a) A basis for W is
(b) The dimension of W is 1.
74. (a) A basis for W
0, t
^2, 1, 0, 1, 0, 1`, obtained by
(c) The dimension of W is 2.
letting s
(b) A basis for W is
72. (a) W is a plane through the origin.
(c) The dimension of W is 1.
(b) A basis for W is
70. (a) W is a line through the origin (the y-axis)
^1, 0, 2, 0, 1, 1, 1, 0, 0` is a basis for
68. You can add any vector that is not in the span of
S
^1, 0, 2, 0, 1, 1`. For instance, the set
Section 4.6
Chapter 4
Vector Spaces
3
2
5
3
2
5
4
^1, 0, , 0, 1, `.
4
5
1
5
^1, 0, , 0, 1, `.
23
7
2 .
7
2
7
0 0 0 0
1 0 0 0
0 1 0 0
0 0 1 0
0 0 0 1
0 0 0 0
1 0 0 0
0 1 0 0.
0 0 1 0
0 0 0 1
^1, 2, 0, 3, 0, 0, 1, 4`.
2
9
2
9 .
0 0
0 0
5
9
94
^1, 0, , 0, 1,
`, or, the first and third
columns of the original matrix.
5 2
,
9 9
94 , 92
So, a basis for the column space is

produces
So, a basis for the column space is ^1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1`.
0
0
2 0 3
0 1 4
0 0 0
0 0 0
0
0
^1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1`.
(c) Row reducing the transpose of the original matrix produces
0
0
original matrix.
23
7
^1, 0, , 0, 1, `, or the first 2 columns of the
1 0
0 1
0 0

produces
1 0 4
5
0 1 15
0 0 0

^1, 0, 0, 1`.
1 0
0 1.
0 0

produces
1 0
0 1
116
4 2 1 v1
1 2 8 v 2 o B
0 1 2 v 3
w1
1, 0, 0, w 2
0, 1, 0, and
0, 0, 1,
1 0 0 w1
0 1 1 w 2
0 0 0
1, 0, 0 and w 2
0, 1, 1,
0 0 0
1 0 0
0 1 0
0 0 1
R4
0 13
1 19
0
0
0
solution space is 1, and a basis is
^1, 2`.
22. Solving the system Ax

0 yields solutions of the form
t , 2t , where t is any real number. The dimension of the
^1, 0, 0, 3, 0, 1, 0, 13, 0, 0, 1, 19`.
So, a basis for span(S) is
2 5 3 2
1 0
2 3 2 5 0 1
1 3 2 2
0 0
0 0
1 5 3 5
20. Form the matrix whose rows are the vectors in S, and
then row-reduce.
spanS
^1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1`.
So, a basis for span(S) is
0
0
This matrix reduces to
6 3 6 34
3 19
3 2
8 3 9 6

2 0 6 5
18. Begin by forming the matrix whose rows are vectors in S.
form a basis for the row space of A. That is, they form a
basis for the subspace spanned by S.
w1
So, the nonzero row vectors of B,
1 2 2 v1
1 0 0 v 2 o B
1 1 1 v 3
write A in row-echelon form.
16. Use v1 , v 2 , and v 3 to form the rows of matrix A. Then
117
^4, 1, 0`.
0 is the trivial
^0, 0, 0, 0` whose
^0, 0, 0`.
1
, 1,
3
0, 0 .
(b) The dimension of the solution space is 3.
^1, 4, 0, 0, 1, 2, 8, 0, 1, 0, 1,
t are any real numbers and a basis is
t 2s r, 4t 8s 13 r, r , s, t , where r, s and
40. (a) This system yields solutions of the form
^5, 15, 9, 8`
85 t , 158 t, 89 t , t , where t is any real number and a

, 9 , 1 or
basis for the solution space is ^ 58 , 15
8 8 `
and a basis for the solution space is

^2, 1, 0, 4, 0, 1`.

4t 2s, s, t , where s and t are any real numbers
is
34. (a) The only solution to this system is the trivial solution
0. So, the basis for the solution space
x
y
z
dimension is 0.
solution. So, the solution space is
32. The only solution to the system Ax
numbers. The dimension of the solution set is 2, and a

basis is ^ 5, 1, 0, 1, 2, 1, 1, 0`.

2s 5t , s t , s, t , where s and t are any real
dimension of the solution space is 2, and a basis is

^1, 0, 1, 2, 1, 0`.

2s t , s, t where s and t are any real numbers. The
the solution space is 1, and a basis is

4t , t , 0, where t is any real number. The dimension of
dimension of the solution space is 2, and a basis is

^4, 1, 0, 2, 0, 1`.

4s 2t , s, t , where s and t are any real numbers. The
form a basis for the row space of A. That is, they form a
basis for the subspace spanned by S.
w3
1 0 0 w1
0 1 0 w 2
0 0 1 w 3
So, the nonzero row vectors of B,
write A in row-echelon form.
14. Use v1 , v 2 , and v 3 to form the rows of matrix A. Then
Section 4.6
Chapter 4
Vector Spaces
2 0
0
.
1 0
2
0 1
0 0
0 1
1 0 12
0 0
2

t 1
0

and
xp
4

0 .
0

5s 4r , 1 4t 2 s 2r , r , s, t ,
4
5
6

2
2
4
r 1 s 0 t 0 and x p

0
1
0

0
0
1
0

1
0.

0

0
48. The vector b is not in the column space of A because the

linear system Ax
b is inconsistent.
xh
where
4
5
6 0

2
2
4 1
r 1 s 0 t 0 0 ,

0
1
0 0

0
0

1 0
where r , s and t are any real numbers. That is,
6t
(b) The solutions of the system are of the form
1 0 4 5 6 0
0 1 2 2 4 1 .
0 0 0 0 0 0
46. (a) The system Ax

b is consistent because its
augmented matrix reduces to
xh
where
2 4

t 1 0 ,
0 0

(b) The solutions of Ax

b are of the form
4 2t , t , 0, where t is any real number. That is,
1 2 0 4
0 0 1 0.
0 0 0 0

b is consistent because its
0
0

b is inconsistent because its
118
0 0
.
0 0
rank 0
e11, ! , e1 p , ! , e1q , !
0, ! , 0, e2 p , ! , e2q , !
0, ! , 0, 0, ! , 0, e3q , !,
0, c1e1 p c2e2 p
0, c1e1q c2e2 q c3e3q
0,
y1 1
y2 1
y3 1
x1 mx1 b 1
x2 mx2 b 1.
x3 mx3 b 1
y1 1
y2 1
y3 1
is less than three, then the determinant is zero, which

implies that the three points are collinear.
x1
x2
x3
On the other hand, if the rank of the matrix
Because the second column is a linear combination of

the first and third columns, this determinant is zero, and
the rank is less than 3.
x1
x2
x3
58. Suppose that the three points are collinear. If they are on
the same vertical line, then x1
x2
x3 . So, the matrix
has two equal columns, and its rank is less than 3.
Similarly, if the three points lie on the novertical line
y
mx b, you have
independent.
and so forth. You can conclude in turn that c1

0,
c2
0, ! , ck
0, and so the row vectors are linearly
c1e11
implies that
c1r1 c2r2 " ck rk
Then the equation
and so forth, where e11 , e2 p , e3q denote leading ones.
r3
r2
r1
the first column of A is not all zero)
56. Let aij

A be an m u n matrix in row-echelon form.
The nonzero row vectors r1 , ! , rk of A have the form (if
1 0 0 0
0 0 0 1
rank 1 rank 1
54. Many examples are possible. For instance,
52. The rank of the matrix is at most 3. So, the dimension of

the column space is at most 3, and any four vectors in the
column space must form a linearly dependent set.
50. The vector b is not in the column space of A because the

b is inconsistent.
linear system Ax
1 2 3
3, 4 5 6 has rank 2.
7 8 9
1 2
2,
has rank 2.
3 4
n rank A
2 R2 R1.
rank B
53
2
x3
3 x3
x2
0.
x4 2 x5
0
0
4 x5
2 x5
x1
t.
2t
s 2t
3s 4t
(b) False. See Theorem 4.19, page 244.
64. (a) False. See "Remark," page 234.
(b) True. The null space of A is the solution space of the

homogeneous system Ax
0.
3a1 a2 , â1 , a2 , a3` is linearly dependent. So, (i) and (iii) are linearly independent.
b is consistent.
70. Let x N A Ax
0 AT Ax
has only the trivial solution x1
xn
x1a1 " xna n
0 if and only if a1 , " , a n are linearly independent.

0 x N AT A.
"
(b) Ax is a linear combination x1a1 " xna n of the columns of A. So, Ax
all vectors b, which implies that Ax
rank > A # b@ for
b is consistent for all vectors b, then the augmented matrix > A # b@ cannot row-reduce to >U # bc@ where the last
row of U consists of all zeros. So, the rank of A is m. Conversely, if the rank of A is m, then rank A
(a) If Ax
68. Let A be an m u n matrix.
(f) Because a3
(e) Because the row-equivalent form B contains a row of zeros, the rows of A are linearly dependent.
(d) The columns of B with leading ones are the first, second, and fourth. The corresponding columns of A form a basis for the
column space of A: ^1, 2, 3, 4, 2, 5, 7, 9, 0, 1, 2, 1`.
(c) By Theorem 4.14, the nonzero row vectors of B form a basis for the row space of
A: ^1, 0, 3, 0, 4, 0, 1, 1, 0, 2, 0, 0, 0, 1, 2`.
3 4

1 2

1 , 0.

0 2
0 1
So, a basis for the null space of A is
x5
x4
x3
x2
119
62. (a) True. The null space of A is also called the solution
space of the system Ax
0.
Choosing the non-essential variables x3 and x5 as the free variables s and t produces the solution
x1
(b) Matrix B represents the linear system of equations
nullity A
66. (a) rank A
For example, R3
In general, for n t 2, the rank is 2, because rows

3, ! , n, are linear combinations of the first two rows.
For n
60. For n
Section 4.6
Chapter 4
Vector Spaces
2 1, 4 3 4, 1
14, 11,
2
, you can write
3
2 34 , 52 ,
3
2
03, 4, 72 4 32 , 6, 2 92 , 29, 11,
2 4, 0, 7, 3 30, 5, 1, 1 4 3, 4, 2, 1 10, 1, 5, 0
26, 32
c1 6, 7 c2 4, 3
32
7c1 3c2
5 and c2
1. So, x
5 6, 7 1 4, 3 and >x@B
3, 12 , 8
c1 32 , 4, 1 c2 34 , 52 , 0 c3 1, 12 , 2
3
c
4 2
5
c
2 2
c3
1c
2 3
2c3
12
c1
4c1
3
c
2 1
2, c2
4 and c3
2 32 , 4, 1 4 34 , 52 , 0 3 1, 12 , 2 and >x@B
5
.
1
2

4.
3

3. So, x
Equating corresponding components yields the following system of linear equations.
10. Begin by writing x as a linear combination of the vectors in B.
26
6c1 4c2
>x@S
20
32.
4
5
9
2
29.
11

14
.
11
20, 32, 4, 5,
which implies that the coordinates of x relative to the standard basis S are
6. Because >x@B
2

3, you can write
4

1
which implies that the coordinates of x relative to the standard basis S are >x S @
4. Because >x@B
2

0 , you can write
4

which implies that the coordinates of x relative to the standard basis S are >x@S
2. Because >x@B
Section 4.7 Coordinates and Change of Basis
120
0, 20, 7, 15
c1 9, 3, 15, 4 c2 3, 0, 0, 1 c3 0, 5, 6, 8 c4 3, 4, 2, 3
1, c3
1 5 # 1 0
1 6 # 0 1
1 0 # 6 5
.
0 1 # 1 1
6 5
.
1 1
3 and c4
1 1
.
1 0
2 # 1 0 0
1 2
9 # 0 1 0
3 7
1 4 7 # 0 0 1
1 0 0 # 13 6 4
0 1 0 # 12 5 3.
1
0 0 1 # 5 2
P 1
13 6 4
12 5 3.
5 2
So, the transition matrix from B to Bc is
1
I 3 # P
and then use Gauss-Jordan elimination to produce
> Bc # B@
18. Begin by forming the matrix
P 1
Bc is
Because this matrix is already in the form

I 2 # P 1 , you see that the transition matrix from B to
> B c # B@
1 0 # 1 1
.
0 1 # 1 0
1
I 2 # P 1
> B c # B@
1, c2
2.
1 1 # 2 3
1 2
2 0 #
1 0 #
0 1 #
1
2
5
2
1
.
2
1
52
2
1
.
2
1 0 0 # 2 0 3
0 1 0 # 1 2 2.
0 0 1 # 4 1 1
121
2 0 3
1 2 2.
4 1 1
1 0 1 # 3 1 1
1 1 4 # 2 1 2.
1 2 0 # 1 2 0
8
1 0 0 # 27
11
11
19
15
0 1 0 #
11
11
0 0 1 # 6 3
11
11
8
27
11
11
19
15
11
11
6 3
11
11
12
11
6
.
11
1
11
12
11
6 .
11
1
11
P 1
I 3 # P 1
> Bc # B@
P 1
Because this matrix is already in the form I 3 # P 1 ,

you see that the transition matrix from B to Bc is
> Bc # B@
P 1
1
I 2 # P
> B c # B@
19, 3, 15, 4 13, 0, 0, 1 30, 5, 6, 8 23, 4, 2, 3, and >x@B
So, 0, 20, 7, 15
15
c2 8c3 3c4
6c3 2c4
4c1
15c1
0
20
3c4
5c3 4c4
9c1 3c2
3c1
1

1.
3

2
Coordinates and Change of Basis
Section 4.7
Chapter 4
Vector Spaces
0 0 0 # 1 0 0 0
1 0 0 # 1 1 0 0
.
0 1 0 # 1 1 1 0
0 0 1 # 1 1 1 1
0 0 0
1 0 0
.
1 1 0
1 1 1
# 1 0 0 0 0
# 0 1 0 0 0
# 0 0 1 0 0
# 0 0 0 1 0
# 0 0 0 0 1
0 0 0 1 #
0 0 1 0 #
0 1 0 0 #
1 0 0 0 #
0 0 0 0 #
12
157
45
157
17
157
1
157
4
157
(d) >x@B
(c) PP
1
P>x@B c
1
6
92
1
6
2
9
5 2

7 1
5 126 90
4
3
7
14
3
59
9
1 0
0 1
>I
# P@ P
16
2
9
1
1
I # P P
7
157
13
157
23
157
25
314
57
314
5
.
7
126 90
4
3
>B # Bc@
5
(b)
7
157
13
157
23
.
157
25
314
57
314
1 0 # 16
2 6 # 1 32

2

2
3
1
31
#
0 1 #
10
157
41
157
12
157
103
314
59
314
10
157
41
157
12
157
103
314
59
314
1 32 # 2 6
1 0 # 126 90
4
3
1 31 # 2 3
0 1 #
5
314
99
314
3
157
287
628
49
628
5
314
99
314
3
157
287
628
49
628
> Bc # B@
32
157
37
157
7
157
47
314
31
314
32
157
37
157
7
157
47
314
31
314
30. (a)
1
12
157
45
157
17
157
1
157
4
157
I 5 # P 1
0
0
> B c # B@
2 3 0 2 0
4 1 0 1 1
2 0 2 2 2
1 1 4 1 3
0 2 5 1 1
P 1
1
1
Because this matrix is already in the form I 4 # P 1 , you see that the transition matrix from B to Bc is
> B c # B@
0
0
122
6

1
1

1 0 0
0 1 0
0 0 1
So, P
33
13
37
13
30
13
77
13
85
13
86
13
80
13
57
.
13
55
13
77
13
85
13
86
13
80
13
57
13
55
13
1 0 0 # 33
13
37
0 1 0 # 13
0 0 1 # 30
13
(d) >x@B
P>x@B c
1

P 0
2

193
13
151.
13
140
13
I.
73
16
83
32
29
32
> I # P@
73
16
.
83
32
29
32
55
16
45
32
3
32
>B # Bc@
11 55
16
16
45
25
32
32
23
3
32
32
1 0 0 #
0 1 0 #
0 0 1 #
11
16
25
32
23
32
1 4 2 # 1 2 4
1 5 # 3 5 2
2
2 4 8 # 4 2 6
1 1 2
2
2 2
1 1
0 2 2 3
2
1 0 1
14
1
2
1
2
1 4 2
1 2 4 #
1 5
3 5 2 # 2
4 2 6 # 2 4
So, P 1
I # P 1
> Bc # B@
P>x@B c
3
2
12
14
(c) Using a graphing utility, you have PP 1
(b)
34. (a)
(d) >x@B
1 1 1
2
2 2 4
1 1 1
0 2 2 2
2
1
1
0
14
> I # P@
0
2
I # P 1 P 1
131 114 x 3 x 2 ,
13

114.
3

2

3.
4

1 0 0

0, 1 , 0
0 0 1

1
0
0

2 0 1 1 4 0 ,

0
1
0

> X @S
2

1.
4

it follows that
and because
40. The standard basis in M 3,1 is
> p@S
21 3 x 4 x ,
it follows that
38. The standard basis in P2 is S
> p@S
it follows that
14
14
1
2
1
2
123
^1, x, x 2` and because
^1, x, x 2` and because
1
2
1 .
2
3
2
12
1 0
1
2
12
1
14
2
1
2
36. The standard basis in P2 is S
1
2
1
2
14
1
2
1
2
1 0
1
2
12
3
2
12
Coordinates and Change of Basis
1 0 0 # 2
1 1 0 # 2 0 1
1 1 0 # 2 1 0 0 1 0 # 0
0 0 1 # 2
1 1 1 # 0 1 1
>B # Bc@
1
4
1
2
1
2
1 0 0 #
2 0 1 # 1 1 0
2 1 0 # 1 1 0 0 1 0 #
0 0 1 #
0 1 1 # 1 1 1
> Bc # B@
(c) PP 1
(b)
32. (a)
Section 4.7
Chapter 4
Vector Spaces
1 0 0

0, 1 , 0
0 0 1

1
0
0

10 0 1 4 0 ,
0
0
1

1

0.
4

e x , ycc
e x , then yc
xe x , then yc
x, then yc
1
, then yc
x
xe x , then yc
6. (a) If y
(b) If y
(c) If y
(d) If y
ycc
e x , then yc
(d) If y
xe , then yc
ycccc
xe x is not a solution.
x
xe
x
xe
0, and xe x is a solution.
0, and y
1
is a solution.
x
2e
x
2e
x
xe
x

z 0, and
0, and
x xe
x
x xe x 2e x 2 xe x e x z 0, and
2
1
x 3 2 2
x
x
x is not a solution.
0, and e x is a solution.
2 z 0, and x 2 is not a solution.
0, and x is a solution.
2e . So, xycc 2 yc
x
e x 3e x 3e x e x
0, and 1 is a solution.
xe x 2e x . So, xycc 2 yc
x
Bc.
e x 3e x 3e x e x z 0, and e x is not a solution.
x0 21 z 0, and y
e x . So, ycccc 2 yccc ycc
and ycc
xe x e x and ycc
Q>x@B c .
3 x z 0, and x is not a solution.
0. So, ycccc 2 yccc ycc
2
. So, xycc 2 yc
x3
QP>x@B cc .
P 1Q 1.
3 xe x . So,
ycccc
Q>x@B c
e x . So, yccc 3 ycc 3 yc y
x 2e x and yccc
0. So, xycc 2 yc
1
and ycc
x2
x
yccc
ycccc
ycccc
>x@B
48. Yes, if the bases are the same, B
QP1
3 x 2e x 31 xe x xe x
2 and yccc
yccc
1 and ycc
2 x, ycc
1, ycc
x, then yc
yccc
x 2 , then yc
ycc
(b) If y
1, then yc
3 x e x
and
So the transition matrix from B to Bcc which is the

inverse of the transition matrix from Bcc to B, is equal to
>x@B
0. So, yccc 3 ycc 3 yc y
e x and yccc
P>x@B cc
Then the transition matrix from Bcc to B is QP because
>x@Bc
46. Let P be the transition matrix from Bcc to Bc and let Q be

the transition matrix from Bc to B. Then for any vector x
the coordinate matrices with respect to these bases are
related as follows.
(b) False. The transition matrix is Bc not B.
matrix from Bc to B.
P 1>x@B c , i.e., P 1 is the transition
>x@Bc . Multiplying both sides by P 1 you
see that >x@B
P>x@B
44. (a) True. If P is the transition matrix from B to Bc, then
e x . So, yccc 3 ycc 3 yc y
1 xe x , ycc
(c) If y
4. (a) If y
yccc 3 ycc 3 yc y
(d) If y
e x is a solution.
yccc
ycc
e x , then yc
(b) If y
(c) If y
0, and yccc
1, ycc
2. (a) If y
x, then yc
Section 4.8 Applications of Vector Spaces
> X @S
it follows that
and because
42. The standard basis in M 3,1 is
124

2 xe x
ex
2 x
2x
e x
2 x2
sin x
cos x
xe x
2e x
1 xe x
x2
x2
2x
2e 3 x z 0,
0 2 4 x 2
e 3 x 0
2 x
2x
x
0, and y
x 2e x
cos 2 x sin 2 x
x 2e x is not a solution.
x
2 x4 x3 3x2 x 3
2 x xe
2 x 2e x
xe
x
125
xe is not a solution.
z 0, and y
3e x is a solution.
x 2e x 2 xe x 2 x x 2e x z 0, and y
x
1 z 0, the set is linearly independent.
2 x x 2 e x
2
x 4 x 2e x
2 x x2
0, and y
e 4 x z 0, the set is linearly independent.
x 2 x2 4 x 2
x
sin x
cos x
2 xe 2 x
0 sin x cos x
x 2e x
2 xe x x 2e x
Applications of Vector Spaces
2 x 2e x e x 2 x xe x
2e 4 xe x e
x
xe 2 x
1
e 3 x 1 1 x
e x
e x
2 x
4x e
e 2 x
the set is linearly independent.
W e x , xe x , x 2e x
22. Because
20. Because W 1, sin x, cos x
2e 2 x
2e
x2
ex
2 xe x
ex
ex
e x
x2
ex
sin x
cos x
4 x
sin x cos x
e x
1 cos x
1 e x
18. Because W e 2 x , xe 2 x
x2
16. W x , e , x e
14. W x, e x , e x
x
xe . So, yc 2 xy
sin x
e x
2 xe x
xe , then yc
12. W x, sin x, cos x
10. W e x , e x
(d) If y
x
x 2e x 2 xe x . So, yc 2 xy
x
x 2e x , then yc
(c) If y
6 xe x 2 x 3e x
2 x 2e x e x . So, yc 2 xy
6 xe x . So, yc 2 xy
xe x , then yc
3e x , then yc
(b) If y
8. (a) If y
Section 4.8
Chapter 4
x
x
3e
2 e x
x 1e
x 2 e x
x 3e x
xe x
ae ax
ax
bx

bx
e ax sin bx
be 2 ax z 0,
because b z 0.
2
e ax a cos bx b sin bx e ax a sin bx b cos bx
e ax cos bx
12
6
8
y 2 + 8x = 0
8
6
The parabola opens to the left.
the vertex at the origin.
36. The graph of this equation is a parabola x
y2
with

8
1
x 2 /2 is a solution,
5x 2 + 3y 2 15 = 0
3 2 1
you see that this is the equation of an ellipse centered at

the origin with major axis falling along the y-axis.
x2
y2

3
5
38. By rewriting the equation as
1. Clearly, y
0, they are linearly independent.
34. No, this is not true. For instance, consider the nonhomogeneous differential equation ycc
whereas the scalar multiple 2 x 2 /2 is not.
0 is fourth order, it has a
0 is second order, it has a
0, the functions are linearly
ebx , and the functions are linearly dependent.
Because these functions satisfy the differential equation ycc 2ayc a b y
W e ax cos bx, e ax sin bx
32. First calculate the Wronskian.
b, then eax
ax
a e a b x .
z 0. Because e and e are solutions to ycc a b yc aby
independent. On the other hand, if a
bx
bebx
If a z b, then W e , e
W e ax , ebx
ax
30. First calculate the Wronskian of the two functions
general solution of the form C1 C2 x C3e C4 xe .
28. From Exercise 24 you have a set of four linearly independent solutions. Because ycccc 2 yccc ycc
general solution of the form C1e 2 x C2 xe 2 x .
26. From Exercise 18 you have a set of two linearly independent solutions. Because ycc 4 yc 4 y
the set is linearly independent.
e 2 x z 0,
e 2 x x 3 e 2 x x 2
ex
0 0 ex
0 0 ex
0 1 e
1 x ex
Vector Spaces
W 1, x, e x , xe x
24. Because
126
23
x2 y2 = 1
16 25
3
4
5
6
2
56
3
2
4 x 3 with the vertex at 3, 3. The
(3, 3)
x
1 with the center at 1, 0.
+ y 2 8x + 3 = 0
1
y2
1
4
4x 2
44. The graph of this equation is an ellipse
y 2 6y 4x + 21 = 0
2
2
parabola opens to the right.
42. The graph of this equation is a parabola
6
5
4
3
2
40. The graph of this equation is a hyperbola centered at the

origin with transverse axis along the x-axis.
2
4
6
8
4 6
127
(3, 0)
x
2
3
1 2 3
4x 2 y 2 + 4x + 2y 1 = 0
4 3 2
( 12 , 1(
5
4
3
2
x
y 1 1 centered at 1 , 1 with a
2
1
1
2
4
horizontal transverse axis.
50. The graph of this equation is a hyperbola
4y 2 + 4x 2 24x + 35 = 0
1
1
with the center at 3, 0 and a radius of 12 .
48. The graph of this equation is a circle x 3 y 2

2
1
4
1 centered at 2, with a

2
4y 2 2x 2 4y 8x 15 = 0
( 2, 12 (
8
6
4
2
y
x 2
2

2
4
vertical transverse axis.
46. The graph of this equation is a hyperbola
Section 4.8
Chapter 4
Vector Spaces
3
4 2 x 2
2
3
4
5
6
So, sin T
yc 4
xc2
0.
1
xc yc
2
yc2
1.
y'
4
3
2
1
45
2 3 4
x'
This is the equation of a hyperbola with a transverse axis

along the xc -axis.
In standard form
xc2
2. By substituting
1
xc yc
2
0 T
0 and simplifying, you obtain
xc sin T yc cos T
xy 2
into
and
2 and cos T
00
1
xc cos T yc sin T
cot 2T
a c
b
54. Begin by finding the rotation angle, T , where
y 2 + 8x + 6y + 25 = 0
(2, 3)
5 4
you see that this is the equation of a parabola with vertex

at 2, 3 and opening to the left.
52. Complete the square to find the standard form.
128
11
2
obtain xc
x'
1
xc yc
2
1
xc yc
2
45
3
xc sin T yc cos T
0.
1
xc yc
2
6.
45
3
x'
y'
This is an equation of a circle with the center at

0, 0 and a radius of 6.
In standard form xc yc
2 xc 2 yc 12
2. By substituting
1
xc yc
2
2 and cos T
xc cos T yc sin T
5 x 2 6 xy 5 y 2 12
into
and
So, sin T

a c
55
cot 2T
0, implying that T
b
6
y'
parabola.
1
. By substituting
2
0 T
0 and simplifying, you

1
2
4 2 yc or yc
xc , which is a
4 2
xc sin T yc cos T
xc cos T yc sin T
1
and cos T
2
a c
b
x 2 2 xy y 2 8 x 8 y
into
and
So, sin T
cot 2T

31
2 3
xc sin T yc cos T
xc cos T yc sin T
3
and cos T
2
a c
b
3
1
xc yc
2
2
1
3
xc
yc
2
2
xc sin T yc cos T
xc2
y'
60
x'
45
2
x'
1, which is an ellipse with
x'
60
yc2
y'
y'
yc , which is a parabola.
129
1
xc yc into 5 x 2 2 xy 5 y 2
2
1
xc yc
2
1
. By substituting
2
0 T
0, which is a single point, 0, 0.
xc sin T yc cos T
xc cos T yc sin T
4 xc 6 yc
and
So, sin T
55
2
1
and cos T
2
a c
b
3
1
xc yc
2
2

cot 2T
2S
T
3
1
. By substituting
2
1
2T
3
1
3
xc
yc
2
2
major axis along the xc -axis.
into 7 x 2 2 3 xy 5 y 2
and
xc cos T yc sin T
So, sin T
7 5
2 3
3
and cos T
2
a c
b
0 and simplifying, you obtain xc

cot 2T
2S
T
3
1
. By substituting
2
1
2T
3
into 3x 2 2 3 xy y 2 2 x 2 3 y
and
So, sin T
cot 2T
Section 4.8
Chapter 4
Vector Spaces
4
6
8
8
6
4
x'
4 6 8
45
b 2
b 2
bx 2cy
0, then b 2
xcyc a c sin 2T b cos 2T
0, which is the equation of a line.
0 b 2 x 2 4bcxy 4c 2 y 2
0 bx 2cy
c sin 2T which shows that the coefficient is zero.
4ac, and you have
a c
b cos 2T
b
acx 2 bcxy c 2 y 2
cos 2T
sin 2T
ax 2 bxy cy 2
70. If A
xcyc> a sin 2T b cos 2T c sin 2T @
c xc sin 2 T c yc cos 2 T 2cxcyc sin T cos T .
b xc cos T sin T bxcyc cos 2 T bxcyc sin 2 T b yc cos T sin T
a xc cos T a yc sin T 2axcyc cos T sin T
2axcyc cos T sin T bxcyccos 2 T sin 2 T 2cxcyc sin T cos T
But, cot 2T
xc sin T yc cos T into the equation
0. To show that the xy-term will be eliminated, analyze the first three terms under this
xc cos T yc sin T and y
6
xc.
3
a xc cos T yc sin T b xc cos T yc sin T xc sin T yc cos T c xc sin T yc cos T
So, the new xy-terms are
ax 2 bxy cy 2
c b. Substitute x
ax 2 bxy cy 2 dx ey f
substitution.
68. Let T satisfy cot 2T
y'
The graph of this equation is two lines yc
0.
1
xc yc
2
6 yc 4 xc
xc sin T yc cos T
2. By substituting
x 2 10 xy y 2
into
and
0, implying that T
1
xc yc
2
2 and cos T
11
10
xc cos T y sin T
So, sin T
a c
b
cot 2T
130

Algebra Lineal

Încărcat de

Informații document

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

Algebra Lineal

Încărcat de

Drepturi de autor:

Formate disponibile

Vector Spaces .....................................................................................

Subspaces of Vector Spaces...............................................................106

Spanning Sets and Linear Independence...........................................108

Basis and Dimension..........................................................................112

Rank of a Matrix and Systems of Linear Equations .........................115

Coordinates and Change of Basis ......................................................120

Applications of Vector Spaces...........................................................124

Copyright Houghton Mifflin Harcourt Publishing Company. All rights reserved.

Review Exercises ........................................................................................................131

Copyright Houghton Mifflin Harcourt Publishing Company. All rights reserved.

Section 4.1 Vectors in R n

for any c, w is not

for any c, u is not

2 18, 28,  6, 13, 11

2 0, 4, 3, 4, 4  18, 24,  9, 9, 15

(c) Because 12, 0, 9 z c 12 ,  23 ,

(b) Because 1,

28. (a) Because 6,  4, 9 z c 12 ,  23 ,

Copyright Houghton Mifflin Harcourt Publishing Company. All rights reserved.

Solving this system produces a

yields the system

40. The equation

34. Using a graphing utility with

u1  u 2  2u3  u 4  2u5 .

Solving this system you discover that there is no

yields the system

Copyright Houghton Mifflin Harcourt Publishing Company. All rights reserved.

 1, 1, 1, 2, 1  2, 1, 2, 1, 1  2 1, 2, 0, 1, 2  0, 2, 0, 1,  4  2 1, 1, 2, 1, 2

Verify the solution by showing that

The reduced row-echelon form for A is

48. The equation

Solving this system produces a

yields the system

50. The equation

Solving this system produces a

yields the system

44. The equation

Solving this system produces a

yields the system

42. The equation

Copyright Houghton Mifflin Harcourt Publishing Company. All rights reserved.

1, and so, v1  v 2  v 3

t , where t is any real number.

1, you obtain a

Solving this system a

yields the homogeneous system

58. The equation

(b) False. The zero vector is defined as an additive identity.

56. (a) True. See page 183.

equals 8, 17, 16, 26, 0,  4 .

1 1,  3, 4,  5, 2, 1  1 3,  2, 4,  3,  2, 1  2 1, 1, 1, 1, 4, 1  2 3, 1, 3,  4, 2, 3  4 4, 2, 1, 3, 1, 1

Verify the solution by showing that

8, 17, 16, 26, 0,  4

The reduced row-echelon form for A is

Copyright Houghton Mifflin Harcourt Publishing Company. All rights reserved.

cu1, ! , cun  cv1, ! , cvn

cu1, ! , cun is a vector in

62. Prove each of the ten properties.

10. In M 1,4 , the additive inverse of >v1 v2

8. In C f, f , the additive inverse of f x is  f x .

6. The additive identity of M 2,2 is the 2 u 2 zero matrix

4. The additive identity of M 1,4 is the 1 u 4 zero matrix

2. The additive identity of C f, f is the zero function,

218, 28, 6, 13, 11

2 0, 4, 3, 4, 4 18, 24, 9, 9, 15

(c) Because 12, 0, 9 z c 12 , 23 ,

(b) Because 1,

28. (a) Because 6, 4, 9 z c 12 , 23 ,

u1 u 2 2u3 u 4 2u5 .

1, 1, 1, 2, 1 2, 1, 2, 1, 1 21, 2, 0, 1, 2 0, 2, 0, 1, 4 21, 1, 2, 1, 2

1, and so, v1 v 2 v 3

1, you obtain a

equals 8, 17, 16, 26, 0, 4.

11, 3, 4, 5, 2, 1 13, 2, 4, 3, 2, 1 21, 1, 1, 1, 4, 1 23, 1, 3, 4, 2, 3 4 4, 2, 1, 3, 1, 1

8, 17, 16, 26, 0, 4

cu1, ! , cun cv1, ! , cvn

8. In C f, f, the additive inverse of f x is f x.

2. The additive identity of C f, f is the zero function,

(a) Use the fact that c 0 0 for any real number c,

cu, 2cu is in the set.

(b) False. The first axiom is not satisfied, because x 1 x

8. The vectors in W are of the form a, 1. This set is not

differentiable on >0, 1@, and so f g W . Also, for

Furthermore, for any real number c and x, y, 2 x 3 y W , it follows that

dax dby dcz W .

Similarly, if ax by cz W and d R, then

a1x b1y c1z a2x b2y c2 z

a1x b1y c1z W ,