Scribd
Upload
130 views4 pages

18.06 Problem Set 2 Solutions

This document contains solutions to problems from Gilbert Strang's Introduction to Linear Algebra textbook. The solutions cover topics related to Gaussian elimination, LU factorization, elementary row operations, symmetric matrices, subspaces, and column spaces. Key points addressed include determining whether a given set of vectors forms a subspace, using elementary row operations to put matrices in symmetric form, and conditions for a linear system Ax = b to have a solution based on the column space of A.

Uploaded by

gadas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
130 views4 pages

18.06 Problem Set 2 Solutions

This document contains solutions to problems from Gilbert Strang's Introduction to Linear Algebra textbook. The solutions cover topics related to Gaussian elimination, LU factorization, elementary row operations, symmetric matrices, subspaces, and column spaces. Key points addressed include determining whether a given set of vectors forms a subspace, using elementary row operations to put matrices in symmetric form, and conditions for a linear system Ax = b to have a solution based on the column space of A.

Uploaded by

gadas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

18.

06 Problem Set 2 Solutions


1. Do problem 5 from section 2.6.
Solution Doing the elimination process, with matrices:

2
A= 0
6

1
4
3

0
1
2 E31 A = 0
5
3

0 0
2
1 0 A = 0
0 1
0

Thus in this case

E = E31

1
= 0
3

0 0
1 0
0 1

With

L = E 1

1
= 0
3

1
A = LU = 0
3

0
1
0

1
0

0
0
1

2
0
1
0

1
4
0

0
2
5

2. Do problem 16 from section 2.6.


Solution

1
1
1

0
1
1


0
4
0 c = 5
1
6

gives

4
c = 1 .
1
Then

1
0
0

1
1
0


1
4
1 x = 1
1
1

gives

3
x = 0 .
1
Those are the forward elimination and back substitution steps for


1 0 0
1 1 1
4
Ax = 1 1 0 0 1 1 x = 5
1 1 1
0 0 1
6
1

1
4
0

0
2 =U
5

3. Do problem 21 from section 2.6.


Solution
(a) For the first matrix A. The elimination matrices E31 , E41 and E42 are all identity matrices. Thus
L = E 1 keeps the 3 lower zeros at the start of rows; the entries L31 , L41 and L42 are all zero
But U may not have the upper zero where A24 = 0. For example for

1 1 1 1
1 1 1 0

0 1 1 1
0 0 1 1
It can be seen at the first nontrivial elimination step that the entry U24 is 1.
(b) For the second matrix B. The elimination matrix E41 is the identity matrix, thus L = E 1
has entry L41 = 0. Also the first row is not changed during the elimination process, thus U14
remains 0. The other 0 entries however can get filled in, for example if

1 1 1 0
1 1 0 1

1 0 1 1
0 1 1 1
The entry U23 becomes 1 in E21 A (and it is not changed afterwards), and U32 becomes 1
also in E21 A, and since A23 = 0 it is not changed during further elimination.
4. Do problem 13 from section 2.7.
Solution A cyclic

0
P = 0
1

1
0
0

0
1
0

or its transpose will have P 3 = I: (1, 2, 3) (2, 3, 1) (3, 1, 2) (1, 2, 3).




1 0
P =
0 P
for the same P has P 4 = P 6= I.
5. Do problem 19 from section 2.7.
Solution
(a) RT AR is n by n, and it is symmetric:
(RT AT R)T = RT AT (RT )T = RT AR.
(b) The jth diagonal entry (RT R)jj is (column j of R)(column j of R)=(length squared of column
j) 0.
2

6. Do problem 34 from section 2.7.


Solution An elementary row operation matrix has the form


1 0
E=
x 1
with inverse
E


=

We want

1 0
x 1


H = E 1A = E =

1
4x

2
9 2x

to be symmetric, that is 2 = H12 = H21 = 4 x, thus x = 2. So the factorisation is



 


1 2
1 0
1 2
= (elementery matrix) (symmetric matrix).
EH =
=
4 9
2 1
2 5
7. Do problem 10 from section 3.1.
Solution
(a) this is subspace:
for v = (b1 , b2 , b3 ) with b1 = b2 and w = (c1 , c2 , c3 ) with c1 = c2 the sum v + w =
b1 + c1 , b2 + c2 , b3 + c3 is in the same set as b1 + c1 = b2 + c2 .
for an element v = (b1 , b2 , b3 ) with b1 = b2 . cv = (cb1 , cb2 , cb3 ) and cb1 = cb2 , thus it is
in the same set.
(b) this is not a subspace, for example for v = (1, 0, 0) v = (1, 0, 0) is not in the set.
(c) this is not a subspace, for example the vectors v = (1, 1, 0) and w = (1, 0, 1) are in the set, but
their sum v + w = (2, 1, 1) is not.
(d) this is a subspace:
for two vectors v1 = 1 v + 1 w and v2 = 2 v + 2 w the sum v1 + v2 = 1 v + 1 w +
2 v + 2 w = (1 + 2 )v + (1 + 2 )w) is still the linear combination of v and w.
for an element v1 = 1 v + 1 w. cv1 = c1 v + c1 w is a linear combination of v and w
thus it is in the same set.
(e) this is subspace:
for v = (b1 , b2 , b3 ) with b1 + b2 + b3 = 0 and w = (c1 , c2 , c3 ) with c1 + c2 + c3 = 0 the
sum v + w = b1 + c1 , b2 + c2 , b3 + c3 is in the same set as b1 + c1 + b2 + c2 + b3 + c3 = 0.
for an element v = (b1 , b2 , b3 ) with b1 + b2 + b3 = 0. cv = (cb1 , cb2 , cb3 ) and cb1 + cb2 +
cb3 = 0, thus it is in the same set.
(f) this is not a subspace, for example (1, 2, 3) is in the set, but 1(1, 2, 3) = (1, 2, 3) is not
in the set.
8. Do problem 22 from section 3.1.
Solution The system
Ax = b
has a solution if b is in the subspace spanned by the columns of A, thus
3

(a) Solution for every b;


(b) Solvable only if b3 = 0;
(c) Solvable only if b3 = b2 .
9. Do problem 24 from section 3.1.
Solution The column space of AB is contained in (possibly equal to) the column space of A. The
example B = 0 and A 6= 0 is a case when AB = 0 has a smaller column space than A.

You might also like