Math 206, Spring 2016

Assignment 4 Solutions

Due: February 19, 2016

Part A.
(1) Find all vectors that are (simultaneously) orthogonal to the following three vectors:

0
2
1
2 2 1

1 , 2 , 0 .

1 0 1
1
3
3
Solution. Consider the matrix

2
A=
0

2
2
1

1
2
0

1
3
0
3 .
1 1

By a theorem from class, for a vector x R5 we have

Row1 (A) x
Ax = Row2 (A) x .
Row3 (A) x
Since two vectors are orthogonal if and only if their dot product is zero, it follows that x R5 is
orthogonal to all three original vectors if and only if Ax = 0. In other words, the set of x which are
orthogonal
to these three vectors is precisely the set of solutions to the system whose augmented matrix
is A 0 . Since row operations preserve solution sets and reduced row echelon form matrices have
solution sets that are easy to observe, our strategy will be the usual one: we compute the set of
solutions to this system by reducing it to a system in reduced row echelon form. We get

1 2 1
2 2 2
0 1 0

1
3
0
3
1 1

0
1
21 +2
0 0
0
0

1
2 1
0
0

1
(1/5)3
0
0

1
33 +2
0
0

0
2 3
0
0

5 0
22 +3
1 0
3 0

1
5 0
3 +2
1 0 0
1 0
0

0 0
0 0
1 0

2 1 1
3
2 0
2 3
1 0 1 1

1
0
0

2 1 1
3
1 0 1 1
2 0
2 3

0 1
1
1 0 1
2 0
2

1
0
0

0
1
0

0 1
1 0
0 0

1
1
0

0
1
0

1
1
0

1
0
0

Hence the set of all solutions to this system (and therefore the set of
of our original vectors) is

x3 x4
1
1

0
1
x4

: x3 , x4 R = x3 1 + x4 0
x3

0
1
x4

0
0
0

0
1
0

1
0
0

1
5
1 1
0 5

1
1 5
0 1 0
0
0 1

0
0
0

0
0
0

0
0
0

all vectors orthogonal to all three

: x3 , x4 R .

http://palmer.wellesley.edu/~aschultz/w16/math206

Page 1 of 4

Math 206, Spring 2016

Assignment 4 Solutions

Due: February 19, 2016

(2) Suppose that f : A B and g : B C are surjective. Prove that g f : A C is surjective.

Solution. Let c C be given. Note that since g : B C is surjective, there exists some b B with
g(b) = c. Likewise since f : A B is surjective, there must exist some a A with f (a) = b. Then we
have
(g f )(a) = g(f (a)) = g(b) = c.
Hence c is in the image of g f , as desired.

(3) Let M Rrc and b Rr be given, and suppose that p Rc is some vector so that M p = b. Define
K = {x Rc : M x = 0} .
Prove that
{y Rc : M y = b} = {p + x : x K} .
[Note: the statement says that two sets are equal. You might consider proving this using a dual
containment argument. As always, be careful to cite any significant reasoning you use in your proof.]
Solution. First we will show that {y Rc : M y = b} {p + x : x K}. So, let w {y Rc :
M y = b} be given. This means that w Rc , and furthermore that M w = b. Consider the element
x = w p; if we can show that this element satisfies x K and that w = p + x, then we will have
proved that w {p + x : x K} as desired.
First, observe that p + x = p + (w p) = w; hence the second condition is satisfied. To check that
x K, we compute
M x = M (w p)
= Mw Mp

(linearity of matrix multiplication)

=bb

(given properties of w, p)

= 0.
Hence x satisfies the necessary criterion to be an element of K, and we have our result.
Now we will argue that {p + x : x K} {y Rc : M y = b}. Let z {p + x : x K} be
given. This means that there is some x K such that z = p + x. Note that K Rc and p Rc by
assumption, and so their sum the vector z is also an element of Rc . Furthermore we have
M z = M (p + x)
= Mp + Mx

(linearity of matrix multiplication)

=b+0

(given properties of p, x)

= b.
Hence z satisfies the criterion to be an element of the set {y Rc : M y = b}, as desired.
Since we have verified both containments, we deduce the equality
{y Rc : M y = b} = {p + x : x K} .

http://palmer.wellesley.edu/~aschultz/w16/math206

Page 2 of 4

Math 206, Spring 2016

Assignment 4 Solutions

Due: February 19, 2016

Part B.
(1) Suppose that T : R3 R4 is linear. Let

1
1
w1 = 0 , w2 = 2 ,
1
0
and suppose you are told that

1
2

T (w1 ) =
3 ,
4

3
2

T (w2 ) =
5 ,
1

and

3
w3 = 1 ,
2

and

4
1

T (w3 ) =
1 .
7

Determine, with proof, the value of T (9e1 ). [Hint: Find constants c1 , c2 , c3 R so that 9e1 = c1 w1 +
c2 w2 + c3 w3 .]
Solution. First we attempt to solve for c1 , c2 , c3 R, as per the hint. Note that were looking to solve
the vector equation

1
3
9
1
c1 0 + c2 2 + c3 1 = 0 .
0
2
0
1
This is equivalent (after carrying out the scaling and additions on the left side) to the equation

c1 c2 + 3c3
9

= 0 .
2c2 c3
0
c1 2c3

1
0
1

Of course this is a simply a system of linear equations, and hence we can solve it using our usual
technique (row reduction) for the usual reasons (solution sets are preserved, and reduced row echelon
form matrices have easily observed solution sets). We get

1
3 9
1 1
3
9
1 1
3
9
1 0 2
0
1 +3
2 3
2 +1
2 1 0 0
2 1
1 5 9 0 1 5 9
0 0
0 2 0
0
1 5 9
0
2 1
0
0 2 1
0

1 0 2
0
1 0 2
0
1 0 2 0
(1/9)3
53 +2
22 +3
0 1
0 1 5 9 0 1 5 9 0 1
0 0
9 18
0 0
1
2
0 0
1 2

1 0 0 4
23 +1
0 1 0 1 .
0 0 1 2
Hence we get
4w1 + w2 + 2w3 = 9e1 .

With this in hand, we are prepared to evaluate T (9e1 ). Linearity of T

1
3
2 2

T (9e1 ) = T (4w1 + w2 + 2w3 ) = 4T (w1 ) + T (w2 ) + 2T (w3 ) = 4
3 + 5
4
1

tells us that

1
+ 2

1
7

15
8
=

15 .
31


http://palmer.wellesley.edu/~aschultz/w16/math206

Page 3 of 4

Math 206, Spring 2016

Assignment 4 Solutions

Due: February 19, 2016

(2) For each of the following statements, determine whether it is true or false. Prove your assertion. [Hint:
One is true and the other is false.]
(a) For any f : A B and g : B C, if g f is injective, then g is injective.
Solution. This is false. Consider the sets A = {1}, B = {, e} and C = {7}, and define
f : A B and g : B C by:
f (1) =

and

g() = g(e) = 7.

Note that g fails to be injective since the (distinct) inputs and e correspond to the same output
(namely 7). On the other hand, our definitions of f and g tell us that g f : A C is defined by
f (1) = 7.
Hence g f is injective, since each output of this function (namely, the output 7) comes from a
unique input (namely 1).

(b) For any f : A B and g : B C, if g f is injective, then f is injective.
Solution. This is true. Let f : A B and g : B C be given, and suppose further that we
know g f : A C is injective. To argue that f is injective, let a1 , a2 A be given so that
f (a1 ) = f (a2 ). We will attempt to argue that this forces a1 = a2 .
Since f (a1 ) and f (a2 ) are equal elements of B, they have the same image under the function g;
that is, we have g(f (a1 )) = g(f (a2 )). By the definition of composition, this says that (g f )(a1 ) =
(g f )(a2 ). Since we know that g f is injective, we can therefore conclude that a1 = a2 . This is
the desired result.


http://palmer.wellesley.edu/~aschultz/w16/math206

Page 4 of 4