Homework Set #3
Correction
8-C-2. Let f : X Y and B Y.
(a) Prove that f (f (B)) B.
(b) Provide a counterexample of B f (f (B)).
(c) Provide a necessary and sufficient condition (or conditions) for f (f (B)) = B.
(d) Prove your assertion in (c) is true.
Solutions to Homework #3
Answer:
(a) Proof:
Let ys (»C).
Then there exists x»C such that (x,y)s.
This implies that xA for all AC.
Hence for every AC, we have xA and (x,y)s.
Thus ys(A) for every AC.
This implies that y»{ s(A) : AC }.
Therefore s (»C) »{ s(A) : AC }. ■
(b) Take X = Y = 2 = { 0, 1 } with s = { (0,0), (1,0) } and C = { { 0 }, { 1 } }. The image of the sets
in C are s({ 0 }) = s({ 1 }) = { 0 }. This implies that »{ s(A) : AC } = { 0 } whereas s (»C) =
s () = . Therefore, it is certainly not the case that »{ s(A) : AC } s (»C).
(c) Equality comes from the condition given for the definition of an injection of a function. Using part
(a), we only have to establish the following theorem.
Proof:
: Suppose x1, x2s({y}). [Now show x1 = x2.]
Choose the collection to be C = { A, B } where A = { x1 } and B = { x2 }.
Then s(A) = s(B) = { y }.
This implies that »{ s(A) | AC } = s(A) s(B) = { y } and s (»C) = s (A B).
If x1 x2, then s(A B) = s() = , which would contradict the fact that
»{ s(A) : AC } s(»C).
Therefore, we must have that x1 = x2.
7-E-6. Let s be a relation on X. Prove that if s is transitive and reflexive, then s2 = s. Is the converse
true?
Proof:
Suppose s is transitive and reflexive.
Since s is transitive, then s2 s by Exercise 7-E-1(g). [Show s s2.]
Suppose (x,y)s. [Show (x,y)s2.]
Since (x,y)s, then yX.
Since s is reflexive, then (y,y)s.
Since (x,y), (y,y)s, then (x,y)s s = s2.
Thus s s2 which implies that s2 = s. ■
The converse is not true. Take X = { 0 } and s = . Then s2 = s but s is not reflexive.
Answer
Let X = { a }, Y = { b, c }, and define f = { (a,b) }.
Then f –1 Y X is the relation f –1 = { (b,a) } but f –1 is not a function since dom f –1 = { b } Y.
Answer
Since 2 = { 0, 1 } and 3 = { 0, 1, 2 }, then 23 = { f1, f2, f3, f4, f5, f6, f7, f8 } where
f1 = { (0, 0), (1, 0), (2, 0) }, f2 = { (0, 0), (1, 0), (2, 1) }, f3 = { (0, 0), (1, 1), (2, 0) },
f4 = { (0, 0), (1, 1), (2, 1) }, f5 = { (0, 1), (1, 0), (2, 0) }, f6 = { (0, 1), (1, 0), (2, 1) },
f7 = { (0, 1), (1, 1), (2, 0) }, and f8 = { (0, 1), (1, 1), (2, 1) }.
Instructor’s Note: We could have given a simplified answer using the characteristic function. It is
23 = { c0, c1, c{1}, c{2}, c2, c{0,2}, c{1,2}, c3 }.
It would have been helpful to do some of Exercise 8-A-9 to know that 00 = 1, 10 = 1, and 01 = 0.
Proof:
: Proof of the contrapositive.
Suppose it is not true that X = and Y .
This implies that either X or Y = .
Case 1: Suppose X . Then either Y = or Y .
If Y = , then X Y = { } .
If Y , then choose any aX. Define fX Y by f (y) = a for all yY. Thus X Y .
Case 2: Suppose Y = . Then X Y = { } .
In both cases we have X Y .
Thus X Y = implies X = and Y .
Answer
(a) Proof:
Suppose yf (f (B)).
Then there exists xf (B) such that f (x) = y.
Since xf (B), then there exists zB such that f (x) = z.
Since f is a function, then z = y and so yB. ■
(b) Let X = 1 = { 0 }, Y = 2 = { 0, 1 } and define f : X Y as f (0) = 0 with B = { 1 }. Since f (B) = ,
then f (f (B)) = and so it is not true that B f (f (B)).
Proof:
Let f : A ⤖ B and g : B ⤖ C be surjections.
To show g f : A C is a surjection, suppose zC. [Now show there is an element in the domain
of g f that maps to z.]
Since g is a surjection, then there exists yB such that g(y) = z.
Since yB and f is a surjection, then there exists xA such that f (x) = y.
Since g(y) = z and f (x) = y then g(f (x)) = z.
This implies that (g f )(x) = z.
Thus, g f is a surjection. ■
Proof:
Let y»{ f (A) : AC }. [Show yf (»C).]
Then yf (A) for every AC.
To each AC there is associated xA such that f (x) = y.
Because f is an injection, there is only one preimage of y. Let’s call this preimage x.
Since xA for every AC, then we must have x»C.
Since f (x) = y, then yf (»C). ■
Answer
Since 2 3 = { (0,0), (0,1), (0,2), (1,0), (1,1), (1,2) } and 6 = { 0, 1, 2, 3, 4, 5 }, then define a bijection
f : 2 3 6 by f = { ((0,0), 0), ((0,1), 1), ((0,2), 2), ((1,0), 3), ((1,1), 4), ((1,2), 5) }.
Answer
Since 0 = { 0, 1, {1}, 2 } by Exercise 5-H(d) and 4 = { 0, 1, 2, 3 }, then define a bijection f :
0 4 by f = { (0, 0), (1, 1), ({1}, 2), (2, 3) }.