Professional Documents
Culture Documents
Linear Algebra With Applications 9th Edition Leon Solutions Manual
Linear Algebra With Applications 9th Edition Leon Solutions Manual
Linear Algebra With Applications 9th Edition Leon Solutions Manual
MANUAL
Full download:
http://testbanklive.com/download/linear-algebra-with-applications-9th-
edition-leon-solutions-manual/
I NSTRUCTO R ’S
NSTR UCTOR
SOLUTIONS MANUAL
L INEAR A LGEBRA
WITH A PPLICATIONS
NINTH EDITION
Steven J. Leon
University of Massachusetts, Dartmout h
Boston Columbus Indianapolis New York San Francisco
Franci sco
Amsterdam Cape Town Dubai London
London Madrid Milan Munich
M unich Paris M ontreal
ontreal Toronto
Delhi Mexico City São Paulo Sydney Hong Kong Seoul Singapore Taipei Tokyo
The author and publisher of this book have used their best efforts in preparing this book. These efforts include the
development, research, and testing of the theories and programs to determine their effectiveness. The author and
publisher make no warranty of an y kind, expressed or implied, with regard t o these programs or the documen tation
contained in this book. The author and publisher shall not be liable in any event for incidental or consequential
damages in connection with, or arising out of, the furnishing, performance, or use of these programs.
All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any
form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written
permission of the publisher. Printed in the United States of Ameri ca.
ISBN-13: 978-0-321-98305-3
ISBN-10: 0-321-98305-X
1 2 3 4 5 6 OPM 17 16 15 14
www. pearsonhighered.c
pearsonhighered.com
om
Contents
Preface v
2 Determinants 27
1 The Determinant
nant of a M atrix 27
2 Properties of Determi nants 30
3 Additional Topics and Applicat ions 33
MATLAB Exercises
Exercises 35
Chapter Test A 35
Chapter Test B 36
3 Vector Spaces 38
1 Definition and
on and Exam ples 38
2 Subspaces 42
3 Linear Independence 47
4 Basis and Dimens
Dimension
ion 50
5 Change of Basis
Basis 52
6 Row Space and Column Space 52
MATLAB Exercises
Exercises 59
Chapter Test A 60
Chapter Test B 62
4 Linear
Linear Transformat
ransfo rmations
ions 66
1 Definition and
on and Exam ples 66
2 Matrix Represent ati ons
ns of Linear Transforma tions
tions 69
3 Similarity 71
MATLAB Exercise
Exercise 72
iii
iv Contents
Chapter Test A 73
Chapter Test B 74
5 Orthogonality 76
n
1 The Scalar produc t in R 76
2 Orthogonal Subspaces 78
3 Least Squares Problems
roblems 81
4 Inner Product Spaces 85
5 Orthonormal Sets 90
6 The Gram-Schmidt Pro cess 98
7 Orthogonal Polynomials
olynomials 100
MATLAB Exercises
Exercises 103
Chapter Test A 104
Chapter Test B 105
6 Eigenvalues 109
1 Eigenvalues and Eigenvectors 109
2 Systems
ms of Linear Differential Equat
Equations
ions 114
3 Diagonalizat ion
on 115
4 Hermitian Matrices
Matrices 123
5 Singular Value Decom
Deco m p
posi
osition
tion 130
6 Quadratic Forms
orms 132
7 Positive Definite Matrices
Matrices 135
8 Nonnegative Matr ices
ices 138
MATLAB Exercises
Exercises 140
Chapter Test A 144
Chapter Test B 145
Steven J. Leon
sleon@umassd
sleon@umassd.edu
.edu
v
C h a p t e r 1
Matrices and
Systems
Equations
of Equ
1 SYS TEM
TE M S OF LI N
NEAR EQU ATIONS
1 1 1 1 1
0 2 1 −2 1
2. (d) 0 0 4 1 −2
0 0 0 1 −3
0 0 0 0 2
5. (a) 3x1 + 2x2 = 8
x1 + 5x2 = 7
(b) 5x1 − 2x2 + x3 = 3
2x1 + 3x2 − 4x3 = 0
(c) 2x1 + x2 + 4x3 = 1
−
1
2 Chapter 1 • Matrices and Systems of Equations
−m1 x1 + x2 = b1
−m2 x1 + x2 = b2
one can eliminate the variable x2 by subtracting the first row from the second. One then
obtains the equival
equivalent syst em
− m 1 x1 + x2 = b1
origin. Every p oint on the line of intersection will be a solution to the linear system. So in
either case the system must have infinitely many solutions.
solutions.
In the case of a nonhomogeneous 2 × 3 linear system, the equations correspond to p to planes
lanes
equation is a multiple of the other, then both
that do not both pass through the origin. If one equation
repr esen
sent the same plane andand there are infinitely
infinitely many solutions. If the equations represe
repr esen
nt
planes that are parallel, then they do not inter sect and hence the system will not have any any
solutions. If the equations r e p
presen
resent distinct planes that are not parallel, then they mu musst
intersect in a line and
and hence
h ence there will be infinitely many s olutions. So the only p
only possibilities
ossibilities
for a nonhomogeneous 2 × 3 linear system are 0 or infinitely many solutions
utions.
onsistent.
9. (a) Since the system i s homogeneous it must be consisten
always consistent since it has the trivial solution (0, . . . , 0). If the
13. A homogeneous system is always
echelon form of the coe fficie nt matrix involves free variables, then there will b
reduced row echelon will be
infinitely many solutions. If there are no free variables, then the trivial solution will be the
only solution.
solution.
14. A nonhomogeneous system could be inconsiste
incons isten
nt in which
which case there would
would be no solutions.
ons istent and underdetermined, then there will be free variables
If the system is c onsisten variables and this
this
would imply that we will have infinitely many solutions.
16. At each intersection, the number of vehicles entering must equal the number of vehicles leaving
in order for the traffic to flow. This condition leads to the following system
system of equations
quations
x1 + a1 = x2 + b1
x2 + a2 = x3 + b2
x3 + a3 = x4 + b3
x4 + a4 = x1 + b4
If we add all four equations, we get
x1 + x2 + x3 + x4 + a1 + a2 + a3 + a4 = x1 + x2 + x3 + x4 + b1 + b2 + b3 + b4
and hence
a1 + a2 + a3 + a4 = b1 + b2 + b3 + b4
17. If (c1 , c2 ) is a solution, then
a11 c1 + a12 c2 = 0
a21 c1 + a22 c2 = 0
Multiplying both through by α, one obtains
Multiplying both equations through by obtains
a11 (αc1 ) + a12 (αc2 ) = α · 0 = 0
a21 (αc1 ) + a22 (αc2 ) = α · 0 = 0
(αc1 , αc2 ) is also a solution.
Thus (α solution.
18. (a) If x4 = 0, then x1 , x2 , and x3 will all be 0. Thus if no glucose is produced, then ther e
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
we choos
choosee another value of x4 , say x4 = 2, then we end up with solution x1 = 12,
x2 = 12, x3 = 12, x4 = 2. Note the ratios are still 6:6:6:1.
3 MATRI X ARITHMETIC
8 −15 11
1. (e) 0 −4 − 3
−1 −6 6
4 Chapter 1 • Matrices and Systems of Equations
5 −10 15
(g) 5 −1 4
8 −9 6
36 10 56
2. (d)
10 3 16
15 20
5. (a) 5A = 5 5
10 35
6 8 9 12 15 20
2A + 3A = 2 2 + 3 3 = 5 5
4 14 6 21 10 35
18 24
(b) 6A = 6 6
12 42
6 8 18 24
3(2A) = 3 2 2 = 6 6
4 14 12 42
3 1 2
(c) AT =
4 1 7
T 3 4
3 1 2
(AT )T = = 1 1 =A
4 1 7
2 7
5 4 6
6. (a) A + B = =B +A
0 5 1
5 4 6 15 12 18
(b) 3(A + B) = 3 =
0 5 1 0 15 3
12 3 18 3 9 0
3A + 3B = +
6 9 15 −6 6 − 12
15 12 18
=
0 15 3
T 5 0
T 5 4 6
(c) (A + B) = = 4 5
0 5 1
6 1
4 2 1 − 2 5 0
AT + BT = 1 3 + 3 2 = 4 5
6 5 0 − 4 6 1
5 14 15 42
7. (a) 3(AB) = 3 15 42 = 45 126
0 16 0 48
6 3 15 42
2 4
(3A)B = 18 9 = 45 126
1 6
−6 12 0 48
2 1 15 42
6 12
A(3B) = 6 3 = 45 126
3 18
−2 4 0 48
Section 3 • Matrix Arithmetic 5
T
5 14
5 15 0
(b) (AB) T = 15 42 =
14 42 16
0 16
2 1 2 6 2
− 5 15 0
BT AT =
=
4 6 1 3 4 14 42 16
0 5 3 1 3 6
8. (a) (A + B) + C = + =
1 7 2 1 3 8
2 4 1 2 3 6
A + (B + C ) = + =
1 3 2 5 3 8
− 4 18 3 1 24 14
(b) (AB)C = =
− 2 13 2 1 20 11
2 4 − 4 − 1 24 14
A(BC ) =
=
1 3 8 4 20 11
2 4 1 2 10 24
(c) A(B + C ) = =
1 3 2 5 7 17
−4 18 14 6 10 24
AB + AC = + =
−2 13 9 4 7 17
0 5 3 1 10 5
(d) (A + B)C = =
1 7 2 1 17 8
14 6 −4 −1 10 5
AC + BC = +
=
9 4 8 4 17 8
T
9. (b) x = (2, 1) is a solution
solution since b = 2a1 + a2 . There are no other solutions since the echelon
form of A is strictly triangular.
(c) The solution to Ax = c is x = (− 52 , − 14 )T . Therefore c = − 52 a1 − 14 a2 .
11. The given information implies that
1 0
x1 = 1 and x2 = 1
0 1
are both solutions to the system. So the system is consisten t and since there is more than one
solution, the row echelon
echelon form of A mu
musst involve
involve a free variable. consistent system with a
variable. A consisten
free variable has infinitely many solutions.
system is consist ent since x = (1, 1, 1, 1)T is a solution. The system can have at most 3
12. The system
lead variables
variables since A only has 3 rows. Therefore,
Therefore, there must be at least one free variable. A
consistent system with a free variable has infinitely many s olutions
utions.
13. (a) It follows
follows from the reduced row echelon form that the free variables
variables are x2 , x4 , x5 . If we
set x2 = a, x4 = b, x5 = c, then
x1 = − 2 − 2a − 3b − c
x3 = 5 − 2b − 4c
14. If w3 is the weight given to professional activities, then the weights for research and teaching
should be w1 = 3w3 and w2 = 2w3 . Note that
1.5w2 = 3w3 = w 1 ,
so the weight given times the weight given
given to research is 1.5 times given to teaching. Since the weights
musst all add up to 1, we hav
mu have
15. AT is an n × m matrix. Since AT has m columns and A has m rows, the multiplication AT A
is possible. The multiplication AAT is possible since A has n columns and AT has n rows
rows..
skew-s ymmetri c, then AT = −A. Since the (j, j) entry of AT is a jj and the (j, j) entry
16. If A is skew-symmetri
of −A is a jj , it follows that a jj = a jj for each j
− − each j and hence the diagonal entries of A mu
musst
all be 0.
search vector is x = (1, 0, 1, 0, 1, 0) T . The search result
17. The search r esult is given by the vector
y = AT x = (1, 2, 2, 1, 1, 2, 1)T
The ith entry of y is equal to the number of search words in the titl
titlee of the ith
i th bo ok.
18. If α = a21 /a 11 , then
αa12 + b = a22
Thus we must choose
a21 a12
b = a22 − αa12 = a22 −
a11
4 MATRI X ALGEBRA
1. (a) (A + B)2 = (A + B)(A + B) = (A + B)A + (A + B)B = A2 + BA + AB + B 2
For real numbers, ab + ba = 2ab; however,
however, with matrices AB + BA is generally not equal
to 2AB.
(b)
(A + B)(A − B) = (A + B)(A − B)
= (A + B)A − (A + B)B
2
= A + BA − AB − B2
For real numbers, ab − ba = 0; however, with matrices
matr ices AB − BA is generally not equal
to O.
Section 4 • Matrix Algebra 7
2. If we replace a by A and b by the identity matrix, I , then both rules will work, since
(A + I )2 = A2 + I A + AI + B 2 = A2 + AI + AI + B 2 = A2 + 2AI + B 2
and
(A + I )(A − I ) = A2 + I A − AI − I 2 = A2 + A − A − I 2 = A2 − I2
3. There are many possible choices for A and B.
B . For
For example, one could
could cho ose
0 1 1 1
A= and B =
0 0 0 0
More generally if
a b db eb
A= B =
ca cb −da ea
−
e12 = a11 (b11 c12 + b12 c22 ) + a12 (b21 c12 + b22 c22 )
= a11 b11 c12 + a11 b12 c22 + a12 b21 c12 + a12 b22 c22
e21 = a21 (b11 c11 + b12 c21 ) + a22 (b21 c11 + b22 c21 )
= a21 b11 c11 + a21 b12 c21 + a22 b21 c11 + a22 b22 c21
e22 = a21 (b11 c12 + b12 c22 ) + a22 (b21 c12 + b22 c22 )
= a21 b11 c12 + a21 b12 c22 + a22 b21 c12 + a22 b22 c22
Th us
d11 = e11 d12 = e12 d21 = e21 d22 = e22
and hence
(AB)C = D = E = A(BC )
9.
0 0 1 0 0 0 0 1
0 0 0 1 0 0 0 0
A2 = A3 =
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
and A4 = O. If n > 4, then
An = An −4 A4 = An − 4 O = O
10. (a) The matrix C is symmetri c since
C T = (A + B)T = AT + BT = A + B = C
(b) The matrix D is symmetric
symmetr ic since
DT = (AA)T = AT AT = A2 = D
(c) The matrix E = AB is not symmetric since
E T = (AB) T = BT AT = B A
and in general, AB = B A.
(d) The matrix F is symmetric
symmetr ic since
F T = (ABA) T = AT BT AT = ABA = F
(e) The matrix G is symmetr ic since
GT = (AB + BA)T = (AB) T + (BA)T = BT AT + AT B T = BA + AB = G
(f ) The matrix H is not symmetric
symm etric sin ce
H T = (AB − BA)T = (AB)T − (BA) T = BT AT − AT BT = BA − AB = H
−
A−1 Ax = A− 1 Ay
x = y
18. For m = 1,
(A1 )−1 = A− 1 = ( A−1 )1
Assume the result holds in the case m = k, that is,
(Ak )−1 = (A−1 )k
It follows that
(A−1 )k +1
+1 k+1
A = A−1 ( A− 1 )k Ak A = A− 1 A = I
and
Ak +1
+1
(A− 1 )k+1 = AAk ( A−1 )k A−1 = AA− 1 = I
10 Chapter 1 • Matrices and Systems of Equations
Therefore
(A−1 )k+1 = ( Ak +1
+1 −1
)
and the result follows by mathematical induction.
tion.
2
19. If A = O, then
(I + A)(I − A) = I + A − A + A2 = I
and
A)(I + A) = I − A + A + A2 = I
(I −
Since each diagonal entry of D is equal to either 0 or 1, it follows that d2 = d jj , for
j = 1, . . . , n and hence D2 = D .
(b) If A = X DX −1 , then
1 1 1
BC = (I + A)(I − A) = (I + A − A − A2 ) = (I + A − A − I ) = O
4 4 4
28. (AT A)T = AT (AT )T = AT A
(AAT )T = (AT )T AT = AAT
29. Let A and B be symmetric n × n matrices. If (AB)T = AB, then
BA = BT AT = (AB) T = AB
Conversel y, if BA = AB, then
Conversely
(AB)T = BT AT = BA = AB
30. (a)
BT = (A + AT )T = AT + (AT )T = AT + A = B
C T = (A − AT )T = AT − (AT )T = AT − A= −C
(b) A = 12 (A + AT ) + 12 (A − AT )
34. False. For
For example, if
2 3 1 4 1
A= , B = , x =
2 3 1 4 1
then
5
Ax = Bx =
5
however, A = B .
35. False. For
For example, if
1 0 0 0
A= and B =
0 0 0 1
then it is easy to see that both A and B mu
musst be singular, however, A + B = I , which is
nonssingular.
non
36. True. If A and B are nonsingular, then their pr oduct AB mu
musst also be nonsingular. Using the
result from Exercise 23, we have that (AB) is nonsingular and ((AB)T )−1 = (( AB ) − 1 )T . It
T
5 ELEMENTARY M ATRICES
0 1
2. (a) , ty pe I
1 0
(b) The given
given matrix
matrix is not an elementary matrix. Its inverse is given b
by
y
1
2
0
1
0 3
1 0 0
(c) 0 1 0 , ty pe III
− 5 0 1
1 0 0
(d) 0 1/5 0 , ty pe II
0 0 1
5. (c) Since
C = F B = F EA
equivalent to A.
where F and E are elementary matrices, it follows that C is row equivalen
1 0 0 1 0 0 1 0 0
6. (b) E −1 = 3 1 0 , E2 = 0 1 0 , E3 = 0 1 0
−1 −1
1
0 0 1 2 0 1 0 −1 1
1 0 2 4
8. (b)
− 1 1 0 5
1 0 0 − 2 1 2
(d) − 2 1 0 0 3 2
3 − 2 1 0 0 2
1 0 1 1 2 −3 1 0 0
9. (a) 3 3 4 −1 1 −1 = 0 1 0
2 2 3 0 −2 3 0 0 1
Section 5 • Elementary Matrices 13
1 2 − 3 1 0 1 1 0 0
− 1 1 − 1 3 3 4 = 0 1 0
0 −2 − 3 2 2 3 0 0 1
1 −1 0
10. (e) 0 1 −1
0 0 1
12. (b) X A + B = C
X = (C − B )A− 1
8 − 14
=
− 13 19
(d) X A + C = X X
A − X I = −C X
(A − I ) = C −
X = −C (A − I )−1
2 4
−
=
− 3 6
13. (a) If E is an elementary matrix of type I or ty p e II, then E is symmetric. Thus E T = E is
an elementary matrix of the same type. If E is the elemen
lementary matrix of type III for med
by adding α times the ith row of the identity ity matrix to the j th row, then E T is the
elementary matrix of type III formed from the identity matrix by adding α times the jth j th
row to the ith row.
(b) In general, the pr oduc t of two elementary matrices will not be an elementary mat matrix.
rix.
Generally, the pr oduct of two elementary matrices will be a matrix formed from the
identity per formance of two row operations. For example, if
ity matrix by the performance
1 0 0 1 0 0
E1 = 2 1 0 and E2 = 0 1 0
0 0 0 2 0 1
then E1 and E2 are elementary matrices, but
1 0 0
E1 E2 = 2 1 0
2 0 1
is not an elementary matrix.
14. If T = U R, then
n
X
tij = u ik r k
k j
k =1
=1
j n
X X
= +
0 r k
k j u ik 0
k =1
=1 k = j+1
j +1
= 0
14 Chapter 1 • Matrices and Systems of Equations
21. (a) If the diagonal entries of D1 are α1 , α2 , . . . , αn and the diagonal entries of D2 are
β1 , β2 , . . . , βn , then D1 D2 will be a diagonal matrix with diagonal entries α1 β1 , . . . , αn βn
and D2 D1 will be a diagonal matrix with diagonal entries β1 α1 , β2 α2 , . . . , βn αn . Since
the two have the same diagonal entries, it follows that D1 D2 = D2 D1 .
(b)
AB = A(a0 I + a1 A + · · · + ak Ak )
= a0 A + a1 A2 + · · · + ak Ak +1
+1
= (a0 I + a1 A + · · · + ak Ak ) A
= BA
22. If A is symmetric and nonsingular, then
−1 · · · E1 B
A = Ek Ek −1
B = H j H j −1 · · · H1 C
Thus
A = Ek Ek −1
−1 · · · E1 H j H j −1 · · · H1 C
and hence A is row equivalen
equivalent to C .
(b) If A and B are nonsingular n × n matrices, then A and B are row equivalent to I . Since
equivalent to I and I is row equival
A is row equival equivale nt to B, it follows from part (a) that A is
row equ
quiv alent to B .
ivalen
25. If U is any row echelon form of A, then A can be reduced to U using r ow operations, so
A is row equ
quivalent to U . If B is row equ
ivalen ivalen
quiv alent to A, then it follows from the result in
equivalent to U .
Exercise 24(a) that B is row equivalen
equivalent to A, then there exist elementary matrices E1 , E2 , . . . , E k such that
26. If B is row equivalen
B = Ek Ek −1
−1 · · · E1 A
Let M = Ek Ek −1−1 · · · E1 . The matrix M is nonsingular since each of the Ei ’s is nonssingular.
’s is non
Conversely, suppose there exists a nonsingular matrix M such that B = M A. A. Since M
is nonsingular, it is row equivalen
equivalent to I . Thus, there exist elementary matrices E1 , E2 , . . . , Ek
such that
M = Ek Ek −1
−1 · · · E1 I
It follows that
B = M A = Ek Ek −1
−1 · · · E1 A
1 x1 x21 ··· xn c1 y1
1 x2 x22 ··· x2n c2 y2
. .
. =
. . .
1 xn+1 x2+ ··· x n+1 cn+1 yn+1
c1 + c2 xi + · · · + cn+1 xin = yi
Thus
p(x i ) = yi i = 1, 2, . . . , n + 1
(b) If x1 , x2 , . . . , xn+1 are distinct and V c = 0, then we can apply part (a) with y = 0. Th us
if p(x) = c1 + c2 x + · · · + cn+1 x n , then
p(x i ) = 0 i = 1, 2, . . . , n + 1
The polynomial p(x) has n + 1 roots. Since the degree of p(x) is less than n + 1, p(x)
less than
musst be the zero polynomial. Hence
mu
c1 = c2 = · · · = cn+1 = 0
Since the system V c = 0 has only the trivial solution, the matrix V musst be nonsingular.
mu onsingular.
29. True. If A is row equival can multi ply
equivalent to I , then A is nonsingular, so if AB = AC , then we can ply
1
both sides of this equation by A . −
A−1 AB = A−1 AC
B = C
30. True. If E and F are elementary matrices, then they are both n onsingular and the pr oduct
of two nonsingular matrices is a nonsingular matrix. Indeed, G−1 = F −1 E −1 .
31. True. If a + a2 = a3 + 2a4 , then
a + a2 − a3 − 2a4 = 0
C = 2 0
0 1
Since B and C are nonsingular, they are both row equivalent to A; however,
equivalen
1 0
B +C =
0 0
is singular,
singular, so it cannot be row equivalen
equivalent to A.
Section 6 • Partitioned Matrices 17
6 PART
AR TITIONED M ATRICES
aT1 aT1 a1 aT1 a2 ··· aT1 an
T
aT2 aT2 a1 aT2 a2 ··· aT2 an
2. B = A A =
(a , a , . . . , a ) =
n .
. 1 2
. T
.
anT aTa T
an a2 ··· an an
n 1
4 − 2 1
1 1 1 1 6 0 1
5. (a) (1 2 3) =
2 3 1 +
2 1 2 11 − 1 4
1 1 2 −
− 1
(c) Let
3 4
−
5 5 0 0
A11 =
A12 =
4 3 0 0
5 5
A21 = (0 0) A22 = (1 0)
The block multiplication is performed as follows:
follows:
T AT T + A AT
A11 A11 T + A AT
A11 A21
A11 A12 A11 21 12 12 12 22
=
T
A21 A22 AT A21 AT 22 12 A21 A21 + A22 A22
A22 T T T
12 11 +A A
1 0 0
= 0 1 0
0 0 0
6. (a)
T
X Y T = x1 yT1 + x2 yT2 + x3 y 3
2 1 5
1 2 + +
4 2 3 4 1
2 3
=
2 4 2 3 20 5
= + +
4 8 4 6 12 3
(b)
AD = A(d11 e1 , d22 e2 , . . . , d nn en )
= (d11 Ae1 , d22 Ae2 , . . . , d nn Aen )
= (d11 a1 , d22 a2 , . . . , dnn an )
10. (a)
Σ1
UΣ = U1 U2 = U 1 Σ1 + U 2 O = U 1 Σ1
O
(b) If we let X = U Σ, then
X = U1 Σ1 = (σ1 u1 , σ2 u2 , . . . , σn un )
and it follows that
then
1 −1
C = − A−
11 A12 A 22
Let
−1 −1 A A −1
A11
A11 − 12 22
B =
1
O A−
22
of S −1 is given b
16. The block form of y
by
I − A
S −1 =
O I
It follows that
I A
− AB O I A
S −1 M S =
O I B O O I
I A
− AB ABA
=
O I B BA
O O
=
B BA
17. The block multiplication of the two factors yields
I O A11 A12 A11 A12
=
B I O C B A11 BA 12 + C
If we equate this matrix with the block form of A and solve for
for B and C , we get
1 1
B = A A− 21 and
11 C = A − A A− A 22 21 11 12
and hence
I O A11 A12 A11 A12
= =A
B I O C A21 A22
18. In order for the block multiplication to work, we must hav
have
XB =S and Y M =T
choosin g X = S B −1
Since both B and M are nonsingular, we can satisfy th ese conditi ons by choosing
1
and Y = T M .−
19. (a)
b1 b1 c
b2 b2 c
BC = . (c) = . = c b
. .
bn bn c
(b)
x1
x2
Ax = (a1 , a2 , . . . , an ) .
.
xn
= a1 (x1 ) + a2 (x2 ) + · · · + an (x n )
(c) It follows from parts (a) and (b) that
Ax = a1 (x1 ) + a2 (x2 ) + · · · + an (x n )
= x1 a1 + x2 a2 + · · · + xn an
20 Chapter 1 • Matrices and Systems of Equations
I A−1 a x A−1 b
=
0T −c
T
A −1 a + β xn+1 −c
T
A−1 b + bn+1
(b) If
y = A−1 a and z = A−1 b
then
( cT y + β )xn+1 =
− − cT z + bn+1
−cT z + bn+1
xn+1 = (β − cT y = 0)
− cT y + β
and
x + xn+1 A− 1 a = A−1 b
x = A− 1 b − xn+1 A−1 a = z − x n+1 y
MATL AB E XERCISE S
should turn out that A1 = A4 and A2 = A3. In part (d) A1 = A3
1. In parts (a), (b), (c) it should
and A2 = A4. Exact equality will not occur in parts (c) and (d) because of roundoff error.
2. The solution x obtained using the \ operation will be more accurate and yield the smaller
residual vector. The computation of x is also more effic ient since the solution is computed
using Gaussian elimination with partial pivoting and this involves
involves less arithmetic than com-
puting the inverse matrix and multiplying it times b.
3. (a) Since Ax = 0 and x = 0, it follows from Theorem 1.5.2 that A is singular.
singular.
(b) The columns of B are all multiples of x. Indeed,
B = (x, 2x, 3x, 4x, 5x, 6x)
and hence
AB = (Ax, 2Ax, 3Ax, 4Ax, 5Ax, 6Ax) = O
(c) If D = B + C , then
AD = AB + AC = O + AC = AC
4. By construction, B is upper triangular whose diagonal entries are all equal to 1. Thus
Thus B is
row equ
quivale
ivalen
nt to I and hence B is nonsingular. If one changes B by setting b10
10,,1 = 1/256 −
me ntary
5. (a) Since A is nonsingular, its reduced row echelon form is I . If E 1 , . . . , E k are ele men
matrices such that Ek · · · E1 A = I , then these same matrices can be used to transform
(A b) to its reduced row echelon form U . It follows then that
For this solution, the free variable x3 = v3 = 3. To determine the general solution jus
just
set x = w + tz. This will give the solution corresponding to x3 = t for any real numbe r
t.
6. (c) There will be no walks even length from Vi to V j whenever i + j is odd.
walks of even
(d) There will be no walks of length k from Vi to V j whenever i + j + k is odd.
(e) The conjecture is still valid
valid for the graph containing the additional edges.
edges .
(f ) valid. There is now a
If the edge {V6 , V 8 } is included, then the conjecture is no longer valid.
walk of length 1 from
from V6 to V8 and i + j + k = 6 + 8 + 1 is odd.
8. The change in part (b) should not have a significant eff ec ect on the survival potential
potentia l for the
turtles. The change in part will eff ec
part (c) will ect the (2, 2) and (3, 2) of the Leslie matrix. The new
values for these entries will be l22 = 0.9540 and l32 = 0.0101. With these values, the Leslie
population model should predict that the survival period will double but the turtles will still
eventually die out.
9. (b) x1 = c − V x2 .
10. (b)
I kB
A2k =
kB I
This can be proved using mathematical induction. In the case k = 1
O I O I I B
A2 =
=
I B I B B I
If the result holds for k = m
I mB
A2m =
mB I
then
A2m+2 = A2 A2 m
I B I mB
=
B I mB I
I (m + 1)B
=
(m + 1)B I
It follows by mathematical
mathematic al induction that the result holds for all positive integers k .
22 Chapter 1 • Matrices and Systems of Equations
(b)
O I I kB kB I
A2k+1 = AA2k = =
I B k B I I (k + 1)B
(b)
I O B11 O I ET
LDL T =
E I O F O I
B11 B11 E T
=
E B11 E B 11 E T + F
where
−1
E = B21 B 11 and F = B22 −
−1 B
B21 B 11 12
It follows that
−1 T T −1
B11 E T = B11 (B 11 ) B 21 = B11 B11 B12 = B 12
1
E B11 = B21 B 11 B11 = B 21
−
1
E B 11 E T + F = B21 E T + B22 − B21 B − B 12
= B B −1 B + B − B B − 1 B
21 11 12 22 21 11 12
= B22
Therefore
LDL T = B
A = Ek Ek −1
−1 · · · E1 I = Ek Ek −1
−1 · · · E1
Then A = A−1 .
7. The statement is f alse.
alse.
(A − B)2 = A2 − BA − AB + B2 = A2 − 2AB + B 2
since in general BA = AB. For example, if
1 1 0 1
A= and B =
1 1 0 0
then
2
2 1 0 1 0
(A − B) = =
1 1 2 1
however,
2 2 0 2 0 0 2 0
A2 − 2AB + B2 = − + =
2 2 0 2 0 0 2 0
8. The statement is false. If A is nonsingular and AB = AC , then we can multiply both sides of
the equation by A− 1 and conclude that B = C . However,
However, if A is singular, then it is
i s p
possib
ossible
to have AB = AC and B = C . For example,
exampl e, if
1 1 1 1 2 2
A= , B = , C =
1 1 4 4 3 3
then
1 1 1 1 5 5
AB = =
1 1 4 4 5 5
1 1 2 2 5 5
AC = =
1 1 3 3 5 5
9. The statement is false. In general, AB and BA are usually not equal, so it is possible for
AB = O and BA to be a nonzero matrix. For example, if
1 1 − 1 − 1
A= and B =
1 1 1 1
then
0 0 − 2 − 2
AB = and BA =
0 0 2 2
10. The statement is true. If x = (1, 2, −1)T , then x = 0 and Ax = 0, so A mu
musst be singular.
singular.
11. The statement is true. If b = a1 + a3 and x = (1, 0, 1)T , then
Ax = x1 a1 + x2 a2 + x3 a3 = 1a1 + 0a2 + 1a3 = b
So x is a solution to Ax = b.
12. The statement is true. If b = a1 + a2 + a3 , then x = (1, 1, 1)T is a solution to Ax = b, since
Ax = x1 a1 + x2 a2 + x3 a3 = a1 + a2 + a3 = b
If a 2 = a3 , then we can also express b as a linear com bination
b = a1 + 0a2 + 2a3
24 Chapter 1 • Matrices and Systems of Equations
2 −2 7 7 1 1 3 −1
1 −1 0 − 7 4
1 3 − 1
0 0 0
The free variables are x2 and x4 . If we set x2 = a and x4 = b, then
x1 = 4 + a + 7b and x3 = −1 − 3b
and hence the solution set consists
consists of all vectors of the form
4 + a + 7b
a
x =
−1 − 3b
b
2. (a) A linear equation in 3 unknowns corresponds to a plane plane in 3-s pace.
pace.
(b) Given 2 equations in 3 unknowns,
unknowns, each equation
equation corresponds to a plane. If one equation
is a multiple of the other, then the equations r e p presen
resent the same plane and any p oint on
the that plane b e a solution to the system. If the two planes are distinct, then they
that plane will be
are either parallel or they intersect in a line. If they are parallel they do not intersect, so
Linear Algebra with Applications 9th Edition Leon SOLUTIONS MANUAL
Full download:
http://testbanklive.com/download/linear-al
http://testbanklive.com/download/linear-algebra-with-applica
gebra-with-applications-9th-
tions-9th-
edition-leon-solutions-manual/