MATH 111 PS 11

1. Let X = f1; 2; 3g

(a) Find all the mappings f : X ! X

(b) Find all the one-to-one mappings f : X ! X
(c) Find all the onto mappings f : X ! X
(d) Find all the bijective mappings f : X ! X

2. Let f : fa; bg ! fx; y; zg be a one-to-one mapping. Show that there exists an onto
mapping g : fx; y; zg ! fa; bg such that g(f (a)) = a and g(f (b)) = b

3. Let f : fx; y; zg ! fa; bg be an onto mapping. Show that there exists a one-to-one
mapping g : fa; bg ! fx; y; zg such that f (g(a)) = a and f (g(b)) = b

4. Let for x 2 R, f (x) = ax2 + x + 1: Determine a for f to be onto. Same question for
g(x) = x2 + ax + 1:

5. Prove or disprove that the following mappings are invertible. Find the inverses of the
invertible ones.

(a) f : x 2 R 7 !f (x) = x3 2 R.
(b) f : x 2 R 7 !f (x) = 3x 5 2 R.
2x
(c) f : x 2 R 7 !f (x) = e 2 (0; 1).
1 2 x
(d) f : (x; y) 2 R2 7 !f (x; y) = 2 R2 .
3 7 y
1
6. Let X; Y be two sets, f : X!Y be an invertible mapping. Show that f : Y ! X is
a bijection.

7. Let X; Y be two sets, f : X!Y a mapping, A a subset of X; B a subset of Y: Prove

the followings

(a) f (;) = ;
(b) f (;) = ;
(c) f (Y ) = X
(d) f is onto if and only if f (X) = Y
(e) A f (B) , f (A) B
(f) A f (f (A))
(g) f (f (B)) B
(h) f is one-to-one ) f (f (A)) = A
(i) f is onto ) f (f (B)) = B

8. Let X; Y be two sets and f : X!Y; g; h : Y !X three mappings

 (a) Assume that, for any x 2 X; (g f )(x) = x: Prove that then f is one-to-one.
(b) Assume that, for any y 2 Y; (f h)(y) = y: Prove that then g = h; f is bijective
and f 1 = g = h

9. Let X; Y be two sets and f : X!Y a mapping.

(a) If for any A X f (f (A)) = A then prove that f is one-to-one.

(b) If for any B Y f (f (B)) = B then prove that f is onto

10. Let f : X!Y be an onto function. Let A; B Y . Show that

f (A) f (B) ) A B:

What can you say about the statement if f is not onto?