Linear Algebra With Applications 8th Edition Leon Solutions Manual Full Download: http://testbankreal.com/download/linearalgebrawithapplications8theditionleonsolutionsmanual/
This solutions manual is designed to accompany the eighth edition of Linear Algebra with Applications by Steven J. Leon. The answers in this manual supple ment those given in the answer key of the textbook. In additio n this manual contains the complete solutions to all of the nonroutine exercises in the book. At the end of each chapter of the textbook there are two chapter tests (A and B) and a section of computer exercises to be solved using MATLAB. The questions in each Chapter Test A are to be answered as either true or false. Although the truefalse answers are given in the Answer Section of the textbook, students are required to explain or prove their answers. This manual i ncludes explanations, proofs, and counterexamples for all Chapter Test A questions. The chapter tests labeled B contain problems similar to the exercises in the chapter. The answers to these problems are not given in the Answers to Selected Exercises Section of the textbook, however, they are provided in this manual. Complete solutions are given for all of the nonroutine Chapter Test B exercises. In the MATLAB exercises most of the computations are straightforward. Con sequently they have not been included in this solutions manual. On the other hand, the text also includes questions related to the computations. The purpose of the questions is to emphasize the signiﬁcance of the computatio ns. The solutions man ual does provide the answers to most of these questions. There are some questions for which it is not possible to provide a single answer. For example, some exercises involve randomly generated matrices. In these cases the answers may depend on the particular random matrices that were generated.
Contents
1 Matrices and Systems of Equations 
1 
1 Systems of Linear Equations 
1 
2 Row Echelon Form 
3 
3 Matrix Arithmetic 
4 
4 Matrix Algebra 
7 
5 Elementary Matrices 
13 
6 Partitioned Matrices 
19 
MATLAB Exercises 
23 
Chapter Test A 
25 
Chapter Test B 
28 
2 Determinants 
31 
1 The Determinant of a Matrix 
31 
2 Properties of Determinants 
34 
3 Additional Topics and Applications 
38 
MATLAB Exercises 
40 
Chapter Test A 
40 
Chapter Test B 
42 
3 Vector Spaces 
44 
1 Deﬁnition and Examples 
44 
2 Subspaces 
49 
3 Linear Independence 
53 
4 Basis and Dimension 
57 
5 Change of Basis 
60 
6 Row Space and Column Space 
60 
MATLAB Exercises 
69 
Chapter Test A 
70 
Chapter Test B 
72 
iii 
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
4 Linear Transformations 
76 
1 Deﬁnition and Examples 
76 
2 Matrix Representations of Linear Transformations 
80 
3 Similarity 
82 
MATLAB Exercise 
84 
Chapter Test A 
84 
Chapter Test B 
86 
5 Orthogonality 
88 
1 The Scalar product in R ^{n} 
88 
2 Orthogonal Subspaces 
91 
3 Least Squares Problems 
94 
4 Inner Product Spaces 
98 
5 Orthonormal Sets 
104 
6 The GramSchmidt Process 
113 
7 Orthogonal Polynomials 
115 
MATLAB Exercises 
119 
Chapter Test A 
120 
Chapter Test B 
122 
6 Eigenvalues 
126 
1 Eigenvalues and Eigenvectors 
126 
2 Systems of Linear Diﬀerential Equations 
132 
3 Diagonalization 
133 
4 Hermitian Matrices 
142 
5 Singular Value Decomposition 
150 
6 Quadratic Forms 
153 
7 Positive Deﬁnite Matrices 
156 
8 Nonnegative Matrices 
159 
MATLAB Exercises 
161 
Chapter Test A 
165 
Chapter Test B 
167 
7 Numerical Linear Algebra 
171 
1 FloatingPoint Numbers 
171 
2 Gaussian Elimination 
171 
3 Pivoting Strategies 
173 
4 Matrix Norms and Condition Numbers 
174 
5 Orthogonal Transformations 
186 
6 The Eigenvalue Problem 
188 
7 Least Squares Problems 
192 
MATLAB Exercises 
195 
Chapter Test A 
197 
Chapter Test B 
198 
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
Chapter 1
Matrices and Systems of Equations
1 SYSTEMS OF LINEAR EQUATIONS
2.
5.
(d)
1
0
0
0
0
1
2
0
0
0
(a) 3 x _{1} + 2 x _{2} = 8
x _{1} + 5 x _{2} = 7
1
1
4
0
0
1
−2
1
1
0
−2
−3
1
1
2
1
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
2
Chapter 1 • Matrices and Systems of Equations
(b) 5 x _{1} − 2 x _{2} + x _{3} = 3
2 x _{1} + 3 x _{2}
(c) 2 x _{1} +
x
_{2}
4 x _{1} − 2 x _{2} 5 x _{1} + 2 x _{2}
− 4 x _{3} + 4 x _{3} + 3 x _{3}
+ 6 x _{2} = −1
= 0
= −1
= 4
(d) 4 x _{1} − 3 x _{2} + x _{3} + 2 x _{4} = 4
= 5
= 8
+ 3 x _{3} − 2 x _{4} = 7
3 x _{1} + x _{1} + 5 x _{1} +
9. Given the system
x
x
x
_{2}
_{2}
_{2}
− 5 x _{3} + 2 x _{3}
+ 6 x _{4} + 4 x _{4}
−m _{1} x _{1} + x _{2} = b _{1}
−m _{2} x _{1} + x _{2} = b _{2}
one can eliminate the variable x _{2} by subtracting the ﬁrst row from the second. One then obtains the equivalent system
(a)
(b)
(c)
−m _{1} x _{1} + x _{2} = b _{1}
(m _{1} − m _{2} )x _{1} = b _{2} − b _{1}
If m _{1} = m _{2} , then one can solve the second equation for x _{1}
_{x} 1 _{=} b _{2} − b _{1} m _{1} − m _{2} One can then plug this value of x _{1} into the ﬁrst equation and solve for x _{2} . Thus, if m _{1} = m _{2} , there will be a unique ordered pair (x _{1} , x _{2} ) that satisﬁes the two equations.
If m _{1} = m _{2} , then the x _{1} term drops out in the second equation
0 = b _{2} − b _{1}
This is possible if and only if b _{1} = b _{2} .
If m _{1} = m _{2} , then the two equations represent lines in the plane with diﬀerent slopes. Two nonparallel lines intersect in a point. That point
will be the unique solution to the system. If m _{1} = m _{2} and b _{1} = b _{2} , then both equations represent the same line and consequently every point on
that line will satisfy both equations. If m _{1} = m _{2} and b _{1} = b _{2} , then the
equations represent parallel lines. Since parallel lines do not intersect, there is no point on both lines and hence no solution to the system.
10. The system must be consistent since (0 , 0) is a solution.
11. A linear equation in 3 unknowns represents a plane in three space. The solution set to a 3 × 3 linear system would be the set of all points that lie on all three planes. If the planes are parallel or one plane is parallel to the line of intersection of the other two, then the solution set will be empty. The three equations could represent the same plane or the three planes could all intersect in a line. In either case the solution set will contain inﬁnitely many points. If the three planes intersect in a point then the solution set will contain only that point.
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
Section 2 • Row Echelon Form
3
2 ROW ECHELON FORM
2. 
(b) 
The system is consistent with a unique solution (4 , −1). 
4. 
(b) 
x _{1} and x _{3} are lead variables and x _{2} is a free variable. 
(d) 
x _{1} and x _{3} are lead variables and x _{2} and x _{4} are free variables. 

(f) 
x _{2} and x _{3} are lead variables and x _{1} is a free variable. 

5. 
(l) The solution is (0 , −1 . 5 , −3 . 5). 

6. 
(c) 
The solution set consists of all ordered triples of the fo rm (0 , −α, α ). 
7. 
A homogeneous linear equation in 3 unknowns corresponds to a plane that passes through the origin in 3space. Two such equations would correspond to two planes through the origin. If one equation is a multipl e of the other, then both represent the same plane through the origin and every point on that plane will be a solution to the system. If one equation is not a multiple of the other, then we have two distinct planes that intersect in a line through the origin. Every point on the line of intersection will be a solution to the linear system. So in either case the system must have inﬁnitely many solutions. In the case of a nonhomogeneous 2 × 3 linear system, the equations cor respond to planes that do not both pass through the origin. If one equation is a multiple of the other, then both represent the same plane and there are inﬁnitely many solutions. If the equations represent planes that are parallel, then they do not intersect and hence the system will not have a ny solutions. If the equations represent distinct planes that are not para llel, then they must intersect in a line and hence there will be inﬁnitely many solutions. So the only possibilities for a nonhomogeneous 2 × 3 linear system are 0 or inﬁnitely many solutions. 

9. 
(a) 
Since the system is homogeneous it must be consistent. 
13. 
A homogeneous system is always consistent since it has the trivial solution 

(0 , 
., 0). If the reduced row echelon form of the coeﬃcient matrix involves 

free variables, then there will be inﬁnitely many solutions. If there are no free variables, then the trivial solution will be the only so ltion. 

14. 
A nonhomogeneous system could be inconsistent in which case there would be no solutions. If the system is consistent and underdeterm ined, then there will be free variables and this would imply that we will have i nﬁnitely many solutions. 

16. 
At each intersection the number of vehicles entering must eq ual the number of vehicles leaving in order for the traﬃc to ﬂow. This condition leads to the following system of equations 
x
x
x
x
_{1}
_{2}
_{3}
_{4}
+ a _{1} = + a _{2} = =
+ a _{3}
+ a _{4} = x _{1}
x
x
x
_{2}
_{3}
_{4}
+ b _{1} + b _{2} + b _{3} + b _{4}
If we add all four equations we get
x _{1} + x _{2} + x _{3} + x _{4} + a _{1} + a _{2} + a _{3} + a _{4} = x _{1} + x _{2} + x _{3} + x _{4} + b _{1} + b _{2} + b _{3} + b _{4}
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
4
Chapter 1 • Matrices and Systems of Equations
and hence
a _{1} + a _{2} + a _{3} + a _{4} = b _{1} + b _{2} + b _{3} + b _{4}
17. If (c _{1} , c _{2} ) is a solution, then
0
a _{1}_{1} c _{1} + a _{1}_{2} c _{2} = a _{2}_{1} c _{1} + a _{2}_{2} c _{2} = 0
Multiplying both equations through by α , one obtains
α · 0 = 0
a _{2}_{1} (αc _{1} ) + a _{2}_{2} (αc _{2} ) = α · 0 = 0
a _{1}_{1} (αc _{1} ) + a _{1}_{2} (αc _{2} ) =
Thus (αc _{1} , αc _{2} ) is also a solution.
18. (a) If x _{4} = 0 then x _{1} , x _{2} , and x _{3} will all be 0. Thus if no glucose is produced then there is no reaction. (0 , 0 , 0 , 0) is the trivial solution in the sense that if there are no molecules of carbon dioxide and water, then there will be no reaction.
(b) If we choose another value of x _{4} , say x _{4} = 2, then we end up with
solution x _{1} = 12, x _{2} = 12, x _{3} = 12, x _{4} = 2. Note the ratios are still 6:6:6:1.
3 MATRIX ARITHMETIC
1. (e)
(g)
8
0
−1
5
5
8
−15
−4
−6
−10
−1
−9
2. (d)
_{} 36 10 56
10
3 16
5.
(a)
5 A =
15
5
10
−3
11
6
15
4
6
20
5
35
(b)
6
2 A + 3 A = 2
4
6 A =
18
6
12
24
6
42
6
3(2 A) = 3 2
4
(c) A ^{T} =
3
4
1
1
2
7
8
2
14
8
2
14
^{+}
^{=}
9
3
6
18
6
12
12
3
21
24
6
42
^{=}
15
5
10
20
5
35
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
Section 3 • Matrix Arithmetic
5
6.
(A ^{T} ) ^{T}
=
3
4
1
1
(a) A + B =
5
0
4
5
(b)
3(A + B ) = 3
5
0
3 A + 3 B =
_{} 12
6
=
_{} 15
0
(c)
(A + B ) ^{T} =
5
0
2
7
6
1
4
5
T
=
3
1
2
4
1 _{} = A
7
_{} = B + A
3
9
4
5
12
15
6
1
=
_{} 15
0
18
15
+
3
−6
18
3
6
1
T
=
5
4
6
0
5
1
12
15
18
3
9 0
6
−12
4
A ^{T} + B ^{T} = 1
6
5
3(AB ) = 3 15
0
2
3
5
14
42
16
3
^{+}
1
3
0
−2
2
−4
5
4
6
0
5
1
^{=}
126
45
0
15
42
48
45
0
15
45
15
0
7.
(a)
_{}
^{=}
_{}
2
1
_{}
T
6
18
−6
2
6
−2
126
126
42
48
42
48
(3 A)B =
4
6
9
12
=
=
1
3
4
14
42
16
A(3 B ) =
6
3 18
12
2
4
5
(b) (AB ) ^{T} = 15
0
1
6
4
3
5
7
4
3
18
13
4
3
=
2
1
6
3
+
+
_{}
_{} 3
2
1
2
_{}
3
2
−4
8
1
2
5 15
42
14
0
16
−2
=
4
1
1
2
5
1
1
= _{} 3
3
6
8
6
8
= _{} 3
3
=
=
=
_{} 24
20
−1
_{} 24
20
4
2
5
_{} 10
7
5
14
B ^{T} A ^{T} =
15
42
8. (A + B ) + C = _{} 0
1
(a)
+ (B + C ) = _{} 2
1
A
(b) (AB )C =
(c)
_{} −4
−2
14
11
A(BC ) = _{} 2
1
14
11
A(B + C ) = _{} 2
1
24
17
0
16
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
6
Chapter 1 • Matrices and Systems of Equations
(d)
9. (b)
AB + AC =
_{} −4
−2
(A + B )C = _{} 0
1
AC + BC =
_{} 14
9
5
7
18
13
_{}
_{} 14
9
4
5
17 8
6
+
3
2
+
1
1
=
_{} 10
=
_{} −4
8
6
4
−1
4
=
_{} 10
7
_{} 10
17
24
17
5
8
x = (2 , 1) ^{T} is a solution since b = 2 a _{1} + a _{2} . There are no other solutions
since the echelon form of A is strictly triangular.
11.
12.
13.
(c) The solution to Ax = c is x = (− ^{5}
The given information implies that
_{2} , − _{4} ) ^{T} . Therefore c = − ^{5}
1
_{2} a _{1} − _{4} a _{2} .
1
x _{1}
=
1
1
0
_{}
and x _{2} = 1
0
1
are both solutions to the system. So the system is consistent and since there is more than one solution the row echelon form of A must involve a free variable. A consistent system with a free variable has inﬁnitely many solutions.
The system is consistent since x = (1 , 1 , 1 , 1) ^{T} is a solution. The system can have at most 3 lead variables since A only has 3 rows. Therefore there must be at least one free variable. A consistent system with a free variable has inﬁnitely many solutions.
(a) It follows from the reduced row echelon form that the free variables are x _{2} , x _{4} , x _{5} . If we set x _{2} = a , x _{4} = b , x _{5} = c , then
x _{1} =
x _{3} = 5 − 2 b − 4 c
−2 − 2 a − 3 b − c
and hence the solution consists of all vectors of the form
14.
15.
16.
x = (−2 − 2 a − 3 b − c, a, 5 − 2 b − 4 c,
b, c ) ^{T}
(b) If we set the free variables equal to solution to Ax = b and hence
0, then x _{0} = (−2 , 0 , 5 , 0 , 0) ^{T} is a
b = Ax _{0} =
−2 a _{1} + 5 a _{3} = (8 , −7 , −1 , 7) ^{T}
A ^{T} is an n × m matrix. Since A ^{T} has m columns and A has m rows, the multiplication A ^{T} A is possible. The multiplication AA ^{T} is possible since A has n columns and A ^{T} has n rows.
If A is skewsymmetric then A ^{T} = −A. Since the (j, j ) entry of A ^{T} is a _{j}_{j} and the (j, j ) entry of −A is −a _{j}_{j} , it follows that is a _{j}_{j} = −a _{j}_{j} for each j and hence the diagonal entries of A must all be 0.
The search vector is x = (1 , 0 , 1 , 0 , 1 , 0) ^{T} . The search result is given by the vector
y =
A ^{T} x = (1 , 2 , 2 , 1 , 1 , 2, 1) ^{T}
The ith entry of y is equal to the number of search words in the title of the ith book.
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
Section 4 • Matrix Algebra
7
17. If α = a _{2}_{1} /a _{1}_{1} , then
1
α
0
1
_{} a 11
0
a
12
b
=
a 11
αa _{1}_{1}
a 12
αa _{1}_{2} + b
=
The product will equal A provided
Thus we must choose
αa _{1}_{2} + b =
a _{2}_{2}
b = a _{2}_{2} − αa _{1}_{2} = a _{2}_{2} −
a 21 a 12
a 11
_{} a 11
a
_{2}_{1}
a 12
αa _{1}_{2} + b
4 MATRIX ALGEBRA
1. (a) (A + B ) ^{2} = (A + B )(A + B ) = (A + B )A +(A + B )B = A ^{2} + BA + AB + B ^{2} In the case of real numbers ab + ba = 2 ab , however, with matrices AB + BA is generally not equal to 2 AB .
(b)
(A + B )(A − B ) =
(A + B )(A − B )
= (A + B )A − (A + B )B
= A ^{2} + BA − AB − B ^{2}
In the case of real numbers ab − ba = 0, however, with matrices AB − BA is generally not equal to O .
2. If we replace a by A and b by the identity matrix, I , then both rules will work, since
(A + I ) ^{2} = A ^{2} + IA + AI + B ^{2} = A ^{2} + AI + AI + B ^{2} =
and
A ^{2} + 2 AI + B ^{2}
(A + I )(A − I ) = A ^{2} + IA − AI − I ^{2} = A ^{2} + A − A − I ^{2} = A ^{2} − I ^{2}
3. There are many possible choices for A and B . For example, one could choose
A = _{} 0
0
More generally if
A =
a
ca
1
0
_{}
b
cb
_{}
and
B =
B =
db
−da
1
0
1
0
eb
−ea
then AB = O for any choice of the scalars a , b , c , d , e.
4. To construct nonzero matrices A, B , C with the desired properties, ﬁrst ﬁnd nonzero matrices C and D such that DC = O (see Exercise 3). Next, for any nonzero matrix A, set B = A + D . It follows that
BC = (A + D )C = AC + DC = AC + O = AC
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
8
Chapter 1 • Matrices and Systems of Equations
5. A 2 × 2 symmetric matrix is one of the form
Thus
A = _{} a
b
A 2 = _{}
+ b ^{2}
_{} ^{a} ab ^{2} + bc
b
c
ab + bc
b ^{2} + c ^{2}
If A ^{2} = O , then its diagonal entries must be 0.
a ^{2} + b ^{2} = 0
and
b ^{2} + c ^{2} = 0
Thus a = b = c = 0 and hence A = O .
6. Let
D = (AB )C =
_{}
It follows that
a 11 b 11 + a 12 b 21 a 21 b 11 + a 22 b 21
a 11 b 12 + a 12 b 22 a 21 b 12 + a 22 b 22
_{} c 11 c
21
d
11
= (a 11 b 11 + a 12 b 21 )c 11 + (a 11 b 12 + a 12 b 22 )c 21
c
c
12
22
= a 11 b 11 c 11 + a 12 b 21 c 11 + a 11 b 12 c 21 + a 12 b 22 c 21
d
12
= (a 11 b 11 + a 12 b 21 )c 12 + (a 11 b 12 + a 12 b 22 )c 22
= a 11 b 11 c 12 + a 12 b 21 c 12 + a 11 b 12 c 22 + a 12 b 22 c 22
d
21
= (a 21 b 11 + a 22 b 21 )c 11 + (a 21 b 12 + a 22 b 22 )c 21
= a 21 b 11 c 11 + a 22 b 21 c 11 + a 21 b 12 c 21 + a 22 b 22 c 21
d
22
= (a 21 b 11 + a 22 b 21 )c 12 + (a 21 b 12 + a 22 b 22 )c 22
= a 21 b 11 c 12 + a 22 b 21 c 12 + a 21 b 12 c 22 + a 22 b 22 c 22
If we set
E = A(BC ) =
_{} a 11
a
21
then it follows that
a
a
12
22
_{}
b
b
11
21
c
c
11
11
+ b 12 c 21 + b 22 c 21
b 11 c 12 + b 12 c 22 b 21 c 12 + b 22 c 22
e
11
= a 11 (b 11 c 11 + b 12 c 21 ) + a 12 (b 21 c 11 + b 22 c 21 )
= a 11 b 11 c 11 + a 11 b 12 c 21 + a 12 b 21 c 11 + a 12 b 22 c 21
e
12
= a 11 (b 11 c 12 + b 12 c 22 ) + a 12 (b 21 c 12 + b 22 c 22 )
= a 11 b 11 c 12 + a 11 b 12 c 22 + a 12 b 21 c 12 + a 12 b 22 c 22
e
21
= a 21 (b 11 c 11 + b 12 c 21 ) + a 22 (b 21 c 11 + b 22 c 21 )
= a 21 b 11 c 11 + a 21 b 12 c 21 + a 22 b 21 c 11 + a 22 b 22 c 21
e
22
= a 21 (b 11 c 12 + b 12 c 22 ) + a 22 (b 21 c 12 + b 22 c 22 )
= a 21 b 11 c 12 + a 21 b 12 c 22 + a 22 b 21 c 12 + a 22 b 22 c 22
Thus 

d 11 = e 11 
d 12 = e 12 
d 21 = e 21 
d 22 = e 22 

and hence 
(AB )C = D = E = A(BC )
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
9.
10.
11.
A ^{2} =
0
Mult mai mult decât documente.
Descoperiți tot ce are Scribd de oferit, inclusiv cărți și cărți audio de la editori majori.
Anulați oricând.