(g 0 J) for part(a) 9 for part (b) f for part (c)

8. For part (a), gof has domain {1,2,3,4}, codomain {x,y,z}, and rule {(1,y),(2,x),(3,x), (4,z)}. Part
(b) is impossible because the codomain of f does not match the domain of g. In part (c), no choice for
f(l) can make (g 0 J)(I) = w.
10. (a) f(11011) = 4, f(01101) = 3, and f(11000) = 2. This function is not invertible because it is not
one-to-one. For example, f(11011) = f(11110).
(b) g(O) = 00000, g(2) = 11000, and g(4) = 11110. This function is not invertible because it is not onto.
For example, there is no value n for which g( n) = 101Ol.
(c) • (f 0 g)(2) = f(g(2» = f(11000) = 2
• (f 0 g)(O) = f(g(O» = f(OOOOO) = 0
• (g 0 J)(11010) = g(f(11010» = g(3) = 11100
• (g 0 J)(11100) = g(f(11100» = g(3) = 11100
(d) No. The previous parts show that it is possible to have f(x) = y and g(y) =f: x at the same time-
when x = 11010 and y = 3, for example.

11. Proof. Let f: A - t Band 9 : B - t A be functions that are inverses of each other. From our definition in
the previous section, this means that the following equation (*) is true:

For all a E A and bE B, f(a) = b if and only if g(Q) = g

We must show both go f = "A and fog = "B.
Let a E A be given, and set b = f(a). In this case, (g 0 J)(a) = g(f(a» = g(b). The fact that b = f(a)
tells us, by equation (*), that g(b) = g. Hence, (g 0 J)(a) = g for all a E A, proving that (g 0 J) has the
same rule as "A.
Now let bE B be given, and set a = g(b). In this case, (f 0 g)(Q) = f(a). The fact that a = g(b) tells us,
by equation (*), that f(g) = b. Hence, (f 0 g)(b) = Qfor all bE B, proving that (f 0 g) has the same rule
as "B.
13. Here are the diagrams of R (on the left) and R 0 R (on the right) for each relation.

1 1

2 6 2

3 5 3

(a) 4 4

51