Homework 15W

Ho Yin Cheung

Recitation 202

1. Let G be a graph. There are two cases. Suppose there are no odd cycles in G. Then G
is bipartite, and we know bipartite graphs are two colorable. Otherwise suppose there exist
odd cycles in G. Since no two odd cycles can be disjoint, then all odd cycles must share at
least one common vertex. Take away the minimum odd cycle. Then there are no more odd
cycles in G since some vertex that was necessary to construct the cycle was taken away. Then
G is bipartite and two colorable as before. A minimum odd cycle requires three colors at
most. Then adding the cycle back, we require at most 5 colors to color the graph. Therefore
(G) 5 in all cases as desired.
2. Let X = {1, 2} and Y = {3, 4, 5}. Let f = {(1, 5), (2, 4)} and g = {(3, 1), (4, 1), (5, 2)}.
(a) X has exactly two elements is satisfied.
(b) g is not an injection since both 3, 4 map to 1.
(c) f is not an surjection since no element in X maps to 5 Y .
(d) g f is different from the identity function since g f (1) = 2 and 1 6= 2.
(e) gf is surjective since gf (1) = 2 and gf (2) = 1. gf is injective since gf (1) 6= gf (2)
and 1 =
6 2. Therefore g f is bijective.
3. (a) R S is not necessarily an equivalence relation. Consider A = {1, 2, 3} and R =
{(1, 2), (2, 1), (1, 1), (2, 2), (3, 3)} and S = {(1, 3), (3, 1), (1, 1), (2, 2), (3, 3)}. R and S are
clearly equivalence relations. Then RS = {(1, 2), (2, 1), (1, 3), (3, 1), (1, 1), (2, 2), (3, 3)}.
Then 2 1, 1 3 2 3. But (2, 3)
/ R S and (3, 2)
/ R S. Therefore R S is
not an equivalence relation.
We will show however that R S is a equivalence relation. Let R, S be equivalence
relations on A. We will show that R S is reflexive, transitive and symmetric.
First, we show it is reflexive. By definition of equivalence relations R and S must be
reflexive. Therefore (a, a) R and (a, a) S a A. Therefore (a, a) R S a A.
Therefore R S is reflexive.
Next, we show it is symmetric. Let (a, b) R S. Then (a, b) R. By definition of
equivalence relations R must be symmetric. Therefore (b, a) R. By the same reasoning, (b, a) S. Then (b, a) R S. Therefore R S is symmetric. Next, we show it is
transitive. Let (a, b) R S and (b, c) R S. Then (a, b), (b, c) R. By definition
of equivalence relations R must be transitive. Then (c, a) R. By similar reasoning
(c, a) S. Then (c, a) R S. Note all requisite (a, c) R S from the fact that R S
is symmetric. Therefore R S is transitive.
(b) We show that | R |=| A |. This is since an antisymmetric equivalence relation allows
only a b where a = b. Suppose otherwise. That is, suppose a b, b 6= a for an
antisymmetric equivalence relation R on A. Then b a by symmetry, so a = b by
antisymmetry. Contradiction! Therefore only pairs of the form (a, a) are in R. There
are exactly | A | of them.
4. Take f : X Y and X, Y as before. Let A, B Y . First we want to show that f 1 (AB)
f 1 (A) f 1 (B). Let x f 1 (A B). Then f (x) A B. Then f (x) A and f (x) B.
Then f 1 (f (x)) f 1 (A) and f 1 (f (x)) f 1 (B). Then f 1 (f (x)) f 1 (A) f 1 (B).
But f 1 (f (x)) = x since f is invertible. Therefore f 1 (A B) f 1 (A) f 1 (B).
Next we want to show that f 1 (A) f 1 (B) f 1 (A B). Let x f 1 (A) f 1 (B).
Therefore f (x) A and f (x) B. Therefore f (x) A B. Then f 1 (f (x)) f 1 (A B).

Homework 15W

Ho Yin Cheung

Recitation 202

But f 1 (f (x)) = x since f invertible. Therefore f 1 (A) f 1 (B) f 1 (A B).

Therefore
f 1 (A) f 1 (B) = f 1 (A B)
as desired.
5. Since there are n 2 equivalence classes and n elements then some equivalence classes must
have more than one element in them by the piegeonhole. By the additional stipulation that
no equivalence class can have three elements we know that two elements must be in two
different equivalence classes. We know that for each element a the ordered pair (a, a) R.
This gives n elements. We know that for some equivalence class with two elements b, c that
we additionally (a, b), (b, a) in R. We have two such equivalence classes. Therefore there are
4 additional such ordered pairs in R. This gives the required n + 4 elements in R.