Engineering Mathematics-III (common for CSE and IT)

Unit-I –FUNCTION AND RELATION

1. Let R be a binary relation on the set of all strings of 0s and 1s such that R = {(a, b)/ a and
b are strings that have the same number of 0s}. Is R reflexive? Symmetric?
Antisymmetric? Transitive? An equivalence relation? A partial ordering relation?
Ans: Yes, Yes, No, Yes, Yes, No
2. Let R be a binary relation on set of books such that (a, b) is in R, if a costs more and
contains fewer pages than book b. In general, is R is reflexive? Symmetric?
Antisymmetric? Transitive? Ans: No, No, Yes, Yes
3. Give an example of relation that is (a) both symmetric and antisymmetric;
(a) Neither symmetric nor antisymmetric
(b) Reflexive and symmetric but not transitive
(c) Reflexive and transitive but not symmetric
(d) Symmetric and transitive but not reflexive
(e) Equivalence relation
(f) Partial ordering relation
4. If R is the relation on the set of positive integers such that (a, b)  R  a2 + b is even.
Prove that R is equivalence relation.
5. (a) If A = {1, 2, 3, 4}  {1, 2, 3, 4} and the relation R is defined on A by (a, b)R(c, d) 
a + b = c + d, verify that R is an equivalence relation on A also find the quotient set of A
by R.
(b) If the relation R on ℤ is defined by aRb if a  b (mod 4) find the partition of ℤ by R.
Ans: (a) [(1, 1)], [(1, 2)], [(1, 3)], [(1, 4)], [(2, 4)], [(3, 4)], [(4, 4)]
(b) [0], [1], [2], [3]
6. Let A = {1, 2, 3, 4, 12}. Consider the partial order of divisibility on A. That is for a and
b  A, a ≤ b if and only if a|b. Draw the Hasse diagram of the poset (A, ≤).
12

4 3
Ans:

7. Let S = {a, b, c} and A = P(S). Draw the Hasse diagram of the poset A with the partial
1 {a, b, c}
order .

{a, b} {a, c} {b, c}

Ans:

{a} {b} {c}


8. Write the ordered pairs in the relation determined by the Hasse diagram on the set
A = {1, 2, 3, 4} 4

3
1 2
Ans: {(1,1), (2, 2), (3, 3), (4, 4), (1, 3), (1, 4), (2, 3), (2, 4), (3, 4)}

9. Determine the Hasse diagram of the relation on A = {1, 2, 3, 4, 5} whose matrix is shown:
1 1 1 1 1 5
0 1 1 1 1
 
0 0 1 1 1 4
 
0 0 0 1 1
0 0 0 0 1 3
Ans

10. Determine the matrix of the partial order whose hasse diagram is given
1
2 3 4 5

1
1 1 1 1 1
0 1 0 0 0 

Ans: 0 0 1 0 0
 
0 0 0 1 0
0 0 0 0 1 

11. Let A = {a1, a2, a3}; B = {b1, b2, b3}; C = {c1, c2} and D = {d1, d2, d3, d4}. Consider the
following four functions, A to B; A to D; B to C and D to B respectively:
(a) f1 = {(a1, b2), (a2, b3), (a3, b1)}
(b) f2 = {(a1, d2), (a2, d1), (a3, d4)}
(c) f3 = {(b1, c2), (b2, c2), (b3, c1)}
(d) f4 = {(d1, b1), (d2, b2), (d3, b1)}
 Determine whether each function is one-to-one, whether each function is onto and whether
each function is everywhere defined.
Ans: f1 is everywhere defined, one to one and onto; f2 is everywhere defined and one to
one but not onto; f3 is everywhere defined and onto but not one to one; f4 is not
everywhere defined, not one to one and not onto.
12. Let A = B = ℝ, the set of real numbers. Let f: A → B be given by the formula
1 1
f(x) = 2x3 – 1 and let g: B → A be given by g(y) = 3 y + . Show that f is a bijection
2 2
between A and B and g is a bijection between B and A.
13. Let f(x, y) = (2x – y, x – 2y), where (x, y)  ℝ  ℝ
(a) Show that f is one to one
 2 z − z z − 2 z2 
(b) Find f -1 Ans: (b)  1 2 , 1 
 3 3 
14. Let f(n) be the maximum of n and 50, n  ℤ+. Determine whether f is one to one or onto
(or both or neither). Ans: neither one to one nor onto
15. Let A = {0, 1} and define a1  a2 = a1 +2 a2. Let B = {1, 0}. Define f: A → B by f(0) = 1
and f(1) = 0.
(a) Prove or disprove that f(a1  a2) = max{f(a1), f(a2)}
(b) Prove or disprove that f(a1  a2) = min{f(a1), f(a2)}
Ans: (a), (b) not possible