Linear Algebra Exam Answer Key: Systems of Equations, Bases, and Projection Matrices, Exams of Linear Algebra

The answer key for a linear algebra exam covering topics such as solving systems of equations using elimination and finding bases for row spaces, column spaces, and null spaces. It also includes information on projection matrices and their properties.

Typology: Exams

2012/2013

Uploaded on 02/27/2013

senajit_98
senajit_98 🇮🇳

3

(5)

93 documents

1 / 6

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Answer Key for Exam #2
1. Use elimination on an augmented matrix:
1 2 3 2 1 3
2 3 1 3 2 10
3 2 11 1 8 25
1 2 3 2 1 3
0151 0 4
0420 5 5 16
107 0 1 11
0 1 5 1 0 4
0 0 0 1 5 0
107 0 1 11
0 1 5 0 5 4
0 0 0 1 5 0
.
The corresponding system is
x17x3+x5= 11, x2+ 5x3+ 5x5=4, x45x5= 0
which we solve for the pivot variables x1,x2and x4:
x1= 11 +7x3x5
x2=45x35x5
x3=x3
x4= 5x5
x5=x5
Therefore
x1
x2
x3
x4
x5
=
11
4
0
0
0
+x3
7
5
1
0
0
+x5
1
5
0
5
1
2. We perform the eliminations
A=
1 1 2 1
1 2 1 2
14 7 4
1 1 2 1
0 1 1 1
05 5 5
1 0 3 0
0 1 1 1
0 0 0 0
=R.
A basis for the row space is the pivot rows of R, or of A. A basis for the column space is the pivot columns
of A(but not of R). A basis for the nullspace can be found as in problem 1 or by taking the negative of the
upper right corner
µ3 0
1 1
of R, putting a 2 ×2 identity matrix below it, and taking the two columns of that. So the only basis that
requires more work is the left nullspace. To get it we transpose the pivot columns of Aand eliminate:
µ1 1 1
1 2 4 µ1 1 1
0 1 5 µ1 0 6
0 1 5.
Here we can solve the corresponding system, or throw away the 2 ×2 identity on the left, negate the rest,
and put a 1 ×1 identity under it. We also have another basis for the column space in the rows of the last
matrix above. In conclusion
Arow space basis is
1
0
3
0
and
0
1
1
1
or
1
1
2
1
and
1
2
1
2
pf3
pf4
pf5

Partial preview of the text

Download Linear Algebra Exam Answer Key: Systems of Equations, Bases, and Projection Matrices and more Exams Linear Algebra in PDF only on Docsity!

Answer Key for Exam #

  1. Use elimination on an augmented matrix:  

The corresponding system is x 1 − 7 x 3 + x 5 = 11, x 2 + 5x 3 + 5x 5 = −4, x 4 − 5 x 5 = 0

which we solve for the pivot variables x 1 , x 2 and x 4 :

x 1 = 11 +7x 3 −x 5 x 2 = − 4 − 5 x 3 − 5 x 5 x 3 = x 3 x 4 = 5 x 5 x 5 = x 5

Therefore (^) 

   

x 1 x 2 x 3 x 4 x 5

  • x 3
  • x 5
  1. We perform the eliminations

A =

 = R.

A basis for the row space is the pivot rows of R, or of A. A basis for the column space is the pivot columns of A (but not of R). A basis for the nullspace can be found as in problem 1 or by taking the negative of the upper right corner (^) ( 3 0 − 1 1

of R, putting a 2 × 2 identity matrix below it, and taking the two columns of that. So the only basis that requires more work is the left nullspace. To get it we transpose the pivot columns of A and eliminate: ( 1 1 1 1 2 − 4

Here we can solve the corresponding system, or throw away the 2 × 2 identity on the left, negate the rest, and put a 1 × 1 identity under it. We also have another basis for the column space in the rows of the last matrix above. In conclusion

A row space basis is

 and

 or

 and

A null space basis is

 and

A column space basis is

 (^) and

 (^) or

 (^) and

A left null space basis is

The factored form of A that displays bases for all four is

A =

  1. To see which vector to keep we start by computing all the dot products for the three vectors. If

~v 1 =

 and^ ~v 2 =

 and^ ~v 3 =

then

~v 1 · ~v 2 = 4 − 2 + 5 − 2 = 5, ~v 1 · ~v 3 = 2 + 2 + 3 + 2 = 9, ~v 2 · ~v 3 = 8 − 1 + 15 − 4 = 18, ~v 1 · ~v 1 = 1 + 4 + 1 + 1 = 7, ~v 2 · ~v 2 = 16 + 1 + 25 + 4 = 46, ~v 3 · ~v 3 = 4 + 1 + 9 + 4 = 18

Recall that the projection of ~b onto ~a is

~b · ~a ~a · ~a ~a. If we take ~a = ~v 3 then the ratios will be 189 and 1818 , so ~v 3

seems like a good one to keep. Then the projection of ~v 1 onto ~v 3 is

~v 1 · ~v 3 ~v 3 · ~v 3

~v 3 =

and therefore

~v 1 =

 +^ ~e,

where ~e is the error in the projection. We want to replace ~v 1 by some multiple of ~e. We have

2 ~e =

 =^ w~ 1 ,

so we throw away ~v 1 and replace it by w~ 1. Next we do the same thing with ~v 2. The projection of ~v 2 onto ~v 3 is

~v 2 · ~v 3 ~v 3 · ~v 3 ~v 3 =

Some other possible answers are

 and^

 and^

 and

 and

 and^

 and^

 and^

 and^

 and^

 and^

  1. Let A be the matrix with ~v 1 and ~v 2 as columns. Then

AT^ A =

and (^) ( 35 10 10 10

so

P =

and so we find that the projection matrix P onto the subspace S is

P =

We also have that

R = 2P − I =

is the reflection matrix through S. The projection of ~v 3 =

 onto S is

P~v 3 =

and the reflection of ~v 3 through S is

R~v 3 =

 =^

The projection is the average of the reflection and ~v 3 itself, and this could have been used to avoid one of the last two matrix multiplications.

  1. If P =

then P is symmetric and

P 2 =

= P.

Any matrix P for which P 2 = P = P T^ is a projection matrix. The trace of P is 311 (2 + 28 + 2 + 2 + 28) = 2, so the subspace T that P projects onto is 2-dimensional. Therefore any two rows or columns of P will be a basis for it as long as they are not multiples of each other. But since we also have to find a basis for T ⊥, which must be 3-dimensional, let’s eliminate:

P =

P projects onto its own column space, or its row space since P is symmetric. This gives us a nice basis for T , and a basis for T ⊥^ comes from the null space of P :

A basis for T is

and

and A basis for T ⊥^ is

and

and