Assignment - I: Set, Relation and Function

MA5251: Discrete Mathematics

Dr. Hiranmoy Pal

Due date: 31-Aug-2022

1. Let U = {1, 2, 3, 4, 5}, A = {1, 5}, B = {1, 2, 3, 4}, and C = {2, 5}. Determine the following sets.
(a) A ∩ B
(b) A ∪ (B ∩ C)
(c) (A ∪ B) ∩ (A ∪ C)
(d) (A ∩ B) ∪ (B ∪ C)
(e) A ∪ B
2. Find the power set of A = {1, 2, 3}. If P(B) has 256 elements, how many elements are there in B.

3. Find whether the following relations are reflexive, symmetric and transitive. In each case, if it is an equivalence
relation then find the equivalence classes.
(a) Let X = {1, 2, 3, 4, 5, 6, 7} . Let f, g and h be three relations on X defined by

f: for a, b ∈ X, (a, b) ∈ f ⇔ a + b is an even integer.

g: for a, b ∈ X, (a, b) ∈ g ⇔ a + b is an odd integer.
h: for a, b ∈ X, (a, b) ∈ h ⇔ a − b is an integer multiple of 5.

(b) Let X = Z and n be a positive integer. Let f, g and h be three relations on X defined by

f: for a, b ∈ X, (a, b) ∈ f ⇔ a + b is an even integer.

g: for a, b ∈ X, (a, b) ∈ g ⇔ a + b is an odd integer.
h: for a, b ∈ X, (a, b) ∈ h ⇔ a − b is an integer multiple of n.

4. Find whether the relation represented by the following matrices are reflexive, symmetric and transitive.
 
1 0 1
a) 0 1 1
0 0 0
 
0 0 1
b) 0 1
 0
1 0 1
 
1 0 1
c) 0 1 1
0 0 1
 
1 1 0 1
1 1 0 0
d) 
0 0

1 0
1 0 0 1
5. Let R be the relation on natural numbers defined by

R := {(x, y) | x ∈ N, y ∈ N, x + 2y = 10}.

Find the domain and range of R. Also obtain R−1 .

6. Check whether the following is an equivalence relation. In the positive case find all equivalence classes. Notation:
(a, b) ∈ R ⇔ aRb ⇔ a is related to b under R.
(a) R1 := {(x, y) | x ∈ N, y ∈ N, x divides y} on N.
(b) R2 := {(x, y) | x ∈ Z, y ∈ Z, x − y is divisible by 5} on Z.
(c) Let S := {(x, y) | x ∈ Z, y ∈ Z, y 6= 0}. A relation R3 on S defined by:

(a, b)R3 (c, d) ⇔ ad = bc.

7. Prove or disprove:
(a) There exists a non-empty relation which is both symmetric and anti-symmetric.
(b) If a relation R is anti-symmetric then R−1 is also anti-symmetric.
(c) If a relation R is anti-symmetric then transitive closure of R is also anti-symmetric.
(d) If a relation R is reflexive and symmetric then transitive closure of R is an equivalence relation.

1
 8. Let X = {1, 2, 3} .
(a) Find the number of all relations on X.
(b) Find the number of all relations f on X so that f = f −1 .
(c) Find the number of all equivalence relations on X.
(d) Find the number of functions on X.
(e) Find the number of injective functions on X.
(f) Find the number of surjective functions on X.
(g) Find the number of bijective functions on X.
9. Let f and g be two equivalence relations on R. Then prove or disprove the following:

(a) f ◦ g is an equivalence relation.

(b) f ∩ g is an equivalence relation.
(c) f ∪ g is an equivalence relation.

10. Determine whether each of these functions from Z to Z is one-one and onto.
(a) f (n) = n − 1
(b) f (n) = n2 + 1
(c) f (n) = n3
(d) f (n) = bn/2c
11. Determine whether the function f : Z × Z → Z is one-one and onto if
(a) f (m, n) = 2m − n.
(b) f (m, n) = m2 + n2 .
(c) f (m, n) = m.
(d) f (m, n) = |n|.
(e) f (m, n) = m2 − n2 .
(f) f (m, n) = |m| − |n|.
12. Give an example of a function from N to N that is
(a) one-one but not onto.
(b) onto but not one-one.
(c) both onto and one-one (different from the identity function).
(d) neither one-to-one nor onto.
13. Give an explicit formula for a function from the set of integers to the set of positive integers that is
(a) one-one but not onto.
(b) onto but not one-one.
(c) both onto and one-one.
(d) neither one-to-one nor onto.
14. Let f : A → B be a function. Let U and V be subsets of A, and S and T be subsets of B. Prove or disprove the
following.

(a) f (U ∪ V ) = f (U ) ∪ f (V ).
(b) f (U ∩ V ) = f (U ) ∩ f (V ).
(c) f −1 (S ∪ T ) = f −1 (S) ∪ f −1 (T ).
(d) f −1 (S ∩ T ) = f −1 (S) ∩ f −1 (T ).

15. (a) Show that if f : A → B is injective and E ⊆ A then f −1 (f (E)) = E. Give an example to show that the equality
need not hold if f is not injective.
(b) Show that if f : A → B is surjective and F ⊆ B then f f −1 (F ) = F. Give an example to show that the

equality need not hold if f is not surjective.

16. Let g : A → B and f : B → C be functions.

(a) Show that if both f and g are one-one functions, then f ◦ g is also one-one.
(b) Show that if both f and g are onto functions, then f ◦ g is also onto.
(c) If f and f ◦ g are one-one, does it follow that g is one-one? Justify your answer.
(d) If f and f ◦ g are onto, does it follow that g is onto? Justify your answer.