Version 001 – Midtrem 2 – tsishchanka – (54165) 1

This print-out should have 12 questions.  

Multiple-choice questions may continue on −4 3
1. X =
the next column or page – find all choices −1 3
before answering.  
−4
3
2. X = correct
MatrixVecProd04 −67
001 10.0 points  
0 3
Determine vuT when 3. X =
−3 −6
   
−3 a  
−4 3
u =  2 , v = b .
 4. X =
−3 6
−5 c
 
0 3
1. vuT = −3a + 2b − 5c 5. X =
7 3
 
−3a 2a −5a Explanation:
2. vuT = −3b
 2b −5b  correct By the algebra of matrices,
−3c 2c −5c

−3a −3b −3c
 X = A−1 (C − B).
3. vuT =  2a 2b 2c 
−5a −5b −5c But the inverse of any 2 × 2 matrix
 
4. vuT = −5a + 2b − 3c D =
d11 d12
d21 d22
Explanation:
Since is given by
uT = [ −3 2 − 5 ] ,  d
22 d12 
−
we see that  ∆ ∆ 
D−1 = 
d21 d11

 
a −
∆ ∆
vuT = b  [ −3 2 − 5 ] .

c with ∆ = d11 d22 − d12 d21 .
Consequently, Thus
       
−3a 2a −5a 2 −1 3 2 4 2
X= −
vuT =  −3b 2b −5b  . −3 2 1 2 −1 5
−3c 2c −5c   
2 −1 −1 0
= .
−3 2 2 −3
InverseMatrix01a
002 10.0 points
Consequently,
Solve for X when AX + B = C,
 

2 1
 
4 2
 −4 3
A= , B= , X = .
3 2 −1 5 7 −6

and  
3 2 LUDecomp06h
C= .
1 2 003 10.0 points
 Version 001 – Midtrem 2 – tsishchanka – (54165) 2
Find L in an LU decomposition of matrices that represent these row operations:

  U = M0 A = M1 E 1 A
−4 0 4 −4 
1 0 0

−4 0 4 −4

A=  4 0 −7 9 . = M1  1 1 0   4 0 −7 9 
−12 0 0 3 0 0 1 −12 0 0 3
= M2 E2 (E1 A)
 
−1 0 0   
1 0 0 −4 0 4 −4
1. L = −1
 −1 0 
= M2  0 1 0   0 0 −3 5 
3 4 −1
  −3 0 1 −12 0 0 3
1 0 0
2. L = −1
 1 0 = E3 (E2 E1 A)
−3 −4 1 
1 0 0

−4 0 4 −4


=  0 1 0   0 0 −3 5 
  0 −4 1 0 0 −12 15
2 0 0 
−4 0 4 −4

3. L = −1
 2 0 =  0 0 −3 5 
3 4 2 0 0 0 −5

Next recall that all elementary matrices are

invertible, as is the product of elementary
 
1 0 0
4. L =  1 1 0 matrices. Thus we can change U = M0 A
3 −4 1 to M0−1 U = A. This shows that L = M0−1 .
Hence

  L = M0−1 = E1−1 E2−1E3−1

1 0 0   
1 0 0 1 0 0
5. L =  −1 1 0  correct −1 
= E1 0 1 0   0 1 0
3 4 1
3 0 1 0 4 1
  
1 0 0 1 0 0
  = −1 1 0
   0 1 0
1 0 0 0 0 1 3 4 1
6. L =  1 1 0  
−3 4 1 1 0 0
=  −1 1 0 
3 4 1

Consequently,
Explanation:
 
Recall that in a factorization A = LU of an 1 0 0
m × n matrix A, then L is an m × m lower L =  −1 1 0 .
triangular matrix with ones on the diagonal 3 4 1
and U is an m × n echelon form of A.
We begin by computing U . Now U = M0 A
where j is the number of row operations on A Subspace05a
needed to transform A into its echelon form 004 10.0 points
U and Mi is a product of j − i elementary
 Version 001 – Midtrem 2 – tsishchanka – (54165) 3
Let H be the set of all vectors in H. Then
a1 − 2b1 a2 − 2b2
   
a − 2b
 
v1 + v2 =  a1 b1 + 3a1  +  a2 b2 + 3a2 
   
 ab + 3a 
 

b b1 b2
(a1 + a2 ) − 2(b1 + b2 )
 
where a and b are real. Determine if H is
=  a1 b1 + a2 b2 + 3(a1 + a2 )  .
 
a subspace of R3 , and then check the correct
answer below. (b1 + b2 )

1. H is not a subspace of R3 because it is But in general,

not closed under vector addition. correct a1 b1 + a2 b2 6= (a1 + a2 )(b1 + b2 ) ,
in which case u + v is not in H.
2. H is a subspace of R3 because it can be
written as Nul(A) for some matrix A. Consequently, H is not a subspace of R3
because it is

3. H is a subspace of R3 because it can be not closed under vector addition .

written as Span{v1 , v2 } with v1 , v2 in R3 .

Invertible01/02
4. H is not a subspace of R3 because it does 005 10.0 points
not contain 0.
A is an n × n matrix. Which of the fol-
Explanation: lowing statements are equivalent to A being
To check if the set H of all vectors invertible?
a − 2b (i) There is no n × n matrix D such that
 

 ab + 3a 
  AD = I.
(ii) Col A = {0}.
b
(iii) A is row equivalent to the n × n
is a subspace of R3 we check the properties identity matrix.
defining a subspace:
1. ii
1. the zero vector 0 is in H: set a = b = 0.
Then 2. i
0−0 0
   

0 + 0 = 0 ,
    3. i and ii
0 0 4. iii correct
so H contains 0.
5. All of these
2. for each u, v in H the sum u + v is in
H: set 6. None of these

a1 − 2b1
   Explanation:
a2 − 2b2 (i) A is said to be invertible if there is an
v1 =  a1 b1 + 3a1  , v2 =  a2 b2 + 3a2  ,
 
n×n matrix D such that DA = I and AD = I
b2 where I is the n × n identity matrix.
b1
 Version 001 – Midtrem 2 – tsishchanka – (54165) 4
(ii) Because A is invertible, the equation where O is the origin in 3-space.
Ax = b has at least one solution for each b
in Rn . Col A is the set of all b such that 1. volume = 6
the equation Ax = b is consistent. Because
there is at least on solution for each b in Rn , 2. volume = 5
the equation is consistent for all b in Rn , and
hence all of Rn . 3. volume = 8
(iii) Since A is invertible, A has n pivot
4. volume = 7
positions. With n pivot positions, the pivots
must lie on the main diagonal, in which case
5. volume = 9 correct
the reduced echelon form of A is In .
Explanation:
Rank02c The parallelepiped is determined by the
006 10.0 points vectors
     
Determine the rank of the matrix 2 1 1
  u =  −1  , v =  4  , w =  4  .
1 1 3 −1 3 4
A =  −2 −2 −7  .
1 1 3 Thus its volume is the absolute value of
2 −1 −1
 
1. rank(A) = 1
det  1 4 3 
 

2. rank(A) = 3 1 4 4

3. rank(A) = 2 correct
     
4 3   1 3   1 4 
= 2 + − .

4 4 1 4 1 4
4. rank(A) = 5

5. rank(A) = 4 Consequently, the parallelepiped has

Explanation:
Since volume = 9 .
 
1 1 0
rref(A) =  0 0 1, BasisNul01a
0 0 0 008 10.0 points
Find a basis for the Null space of the matrix
the first two rows of rref(A) contain leading  
1’s, so 3 −3 −6 3
A =  2 −2 −7 −1  .
Rank(A) = 2 .
−1 1 1 −4

1 
 
DetVolume01a 
1
 
007 10.0 points 1.   correct
Compute the volume of the parallelepiped  0 
 
0
with adjacent edges OP , OQ, and OR deter-    
mined by vertices  3 −6 
2.  2  ,  −7 
P (2, −1, −1) , Q(1, 4, 3) , R(1, 4, 4) , −1 1
 
 Version 001 – Midtrem 2 – tsishchanka – (54165) 5

   
 3 3  1. { cos t, sin 2t }
3.  2  ,  −1 
−1 −4
 
2. { cos t, sin 2t, sin t cos t }
   
 3 −3 
4.  2  ,  −2  3. { sin 2t, sin t cos t }
−1 1
 
4. { sin t, sin 2t } correct
−1 
 

 1  5. { sin t, sin 2t, sin t cos t }
 
5.  0 
 
Explanation:
 
0
By double angle formula,
1 
 

0
 
6. sin 2t = 2 sin t cos t ,
 1 
 
 
0
so the functions
Explanation:
We first row reduce [A 0]: { sin t, sin 2t, sin t cos t }
 
1 −1 0 0 0
rref([A 0]) = 0 0 1
 0 0 are linearly dependent, while
0 0 0 1 0
{ sin t, sin 2t }
to identify the free variables for x in the ho-
mogeneous equation Ax = 0.
are linearly independent. Consequently,
Thus x1 , x3 , and x4 are basic variables,
while x2 is a free variable. So set x2 = s.
Then { sin t, sin 2t }
x1 = s, x2 = s, x3 = 0, x4 = 0 ,
is a basis for H.
and
1 
 


1
 PolyCoordVec01a
Nul(A) = Span   . 010 10.0 points
 0 
 
0
Find the coordinate vector [p]B in R3 for
Consequently, the polynomial
1 
 

1 p(t) = 1 + 4t + 7t2
 
B =  
 0 
 
0 with respect to the basis
is a basis for Nul(A).
1 + t2 , t + t2 , 1 + 2t + t2

B =
Basis03a
009 10.0 points for P2 .
In the vector space V of all real-valued 
−6
functions, find a basis for the subspace
1. [p]B =  1 
H = Span{ sin t, sin 2t, sin t cos t } . 2
 Version 001 – Midtrem 2 – tsishchanka – (54165) 6

  But then
−2  
2. [p]B =  −6  1 0 0 2
1 rref(A) =  0 1 0 6 .
  0 0 1 −1
6
3. [p]B =  −1 
Thus
−2  
  2
2 [x]B =  6  .
4. [p]B =  6  correct −1
−1
 
1 ChangeBasis01b
5. [p]B =  2  011 (part 1 of 2) 10.0 points
−6
  Determine the change of coordinates ma-
−1 trix PC←B from basis B = {b1 , b2 } to C =
6. [p]B =  2  {c1 , c2 } of a vector space V when
6
b1 = 6c1 − 2c2 , b2 = 9c1 − 4c2 .
Explanation:
The coordinate mapping from P2 to R3
maps  
69
 
a 1. PC←B = correct
−2
−4
p = a + bt + ct2 −→  b  .  
c 9 −6
2. PC←B =
4 −2
When
p(t) = 1 + 4t + 7t2
 
9 6
3. PC←B =
and −4 −2
 
1 + t2 , t + t2 , 1 + 2t + t2 ,

B = −6 9
4. PC←B =
−2 4
therefore, the entries c1 , c2 , c3 in [p]B are the
solutions of the polynomial equation
 
−9 6
5. PC←B =
−4 2
c1 (1 + t2 ) + c2 (t + t2 ) + c3 (1 + 2t + t2 )
 
6 −9
= p(t) = 1 + 4t + 7t2 . 6. PC←B =
2 −4
Equating coefficients thus shows that
c1 , c2 , c3 satisfy the matrix equation Explanation:
     The change of coordinates matrix PC←B is
1 0 1 c1 1 the 2 × 2 matrix
 0 1 2   c2  =  4  ,
1 1 1 c3 7 PC←B = [ [b1]C [b2 ]C ] .
which in augmented matrix form becomes
  Now
1 0 1 1    
A = 0 1 2 4. 6 9
[b1 ]C = , [b2 ]C = .
1 1 1 7 −2 −4
 Version 001 – Midtrem 2 – tsishchanka – (54165) 7
Consequently,
 
6 9
PC←B = .
−2 −4

012 (part 2 of 2) 10.0 points

Determine [x]C when

x = −3b1 + 2b2 .

 
−4
1. [x]C =
0
 
0
2. [x]C =
2
 
0
3. [x]C = correct
−2
 
2
4. [x]C =
0
 
0
5. [x]C =
−4
 
4
6. [x]C =
0
Explanation:
Now
x = −3b1 + 2b2
= −3(6c1 − 2c2 ) + 2(9c1 − 4c2 )
= 0c1 − 2c2 .

Consequently,
 
0
[x]C = .
−2