11M02 - Sets, Relations & Function (Theory) 60

Self Practice Problem :

(11) If (2x + y, 7) = (5, y – 3) then find x and y.

(12) If A × B = {(1, 2), (1, 3), (1, 6), (7, 2), (7, 3), (7, 6)} then find sets A and B.

(13) If A = {x, y, z} and B = {1, 2} then find number of relations from A to B.

(14) Write R = {(4x + 3, 1 – x) : x  2, x  N}

5
Answers (11) x = – , y = 10 (12) A = {1, 7}, B = {2, 3, 6}
2
(13) 64 (14) {(7, 0), (11, –1)}

TYPES OF RELATIONS : (SIMILER TO SETS)

In this section we intend to define various types of relations on a given set A.
(i) Void relation : Let A be a set. Then   A × A and so it is a relation on A. This relation is
called the void or empty relation on A.
(ii) Universal relation : Let A be a set. Then A × A  A × A and so it is a relation on A. This
relation is called the universal relation on A.
(iii) Identity relation : Let A be a set. Then the relation IA = {(a, a) : a  A} on A is called the
identity relation on A. In other words, a relation IA on A is called the identity relation if every
element of A is related to itself only.
(iv) Reflexive relation : A relation R on a set A is said to be reflexive if every element of A is
related to itself. Thus, R on a set A is not reflexive if there exists an element a  A such that
(a, a)  R.

Note : Every identity relation is reflexive but every reflexive relation in not identity.
(v) Symmetric relation : A relation R on a set A is said to be a symmetric relation
iff (a, b)  R  (b ,a)  R for all a, b  A. i.e. a R b  b R a for all a, b  A.
(vi) Transitive relation : Let A be any set. A relation R on A is said to be a transitive relation
iff (a, b)  R and (b, c)  R  (a, c)  R for all a, b, c  A
i.e. a R b and b R c  a R c for all a, b, c  A

(vii) Equivalence relation : A relation R on a set A is said to be an equivalence relation on A iff

(i) it is reflexive i.e. (a, a)  R for all a  A
(ii) it is symmetric i.e. (a, b)  R  (b, a)  R for all a, b  A
(iii) it is transitive i.e. (a, b)  R and (b, c)  R  (a, c)  R for all a, b  A
Example#17 : Which of the following are identity relations on set A = {1, 2, 3}.
R1 = {(1, 1), (2, 2)}, R2 = {(1, 1), (2, 2), (3, 3), (1, 3)}, R3 = {(1, 1), (2, 2), (3, 3)}.
Solution: The relation R3 is identity relation on set A.
R1 is not identity relation on set A as (3, 3)  R1.
R2 is not identity relation on set A as (1, 3)  R2

Example#18 : Which of the following are reflexive relations on set A = {1, 2, 3}.
R1 = {(1, 1), (2, 2), (3, 3), (1, 3), (2, 1)}, R2 = {(1, 1), (3, 3), (2, 1), (3, 2)}..
Solution : R1 is a reflexive relation on set A.
R2 is not a reflexive relation on A because 2  A but (2, 2)  R2.

Example#19 : Prove that on the set N of natural numbers, the relation R defined by x R y  x is less than y is
transitive.
Solution : Because for any x, y, z  N x < y and y < z  x < z  x R y and y R z  x R z. so R is
transitive.
11M02 - Sets, Relation & Function (Exercise) 66

C-5. In a town of 10,000 families it was found that 40% families buy newspaper A, 20% families buy
newspaper B and 10% families buy newspaper C, 5% families buy A and B, 3 % buy B and C and 4%
buy A and C. If 2% families buy all the three news papers, then number of families which buy
newspaper A only is
(1) 3100 (2) 3300 (3) 2900 (4) 1400

C-6. A class has 175 students. The following data shows the number of students obtaining one or more
subjects : Mathematics 100, Physics 70, Chemistry 40, Mathematics and Physics 30, Mathematics and
Chemistry 28, Physics and Chemistry 23, Mathematics & Physics & Chemistry 18. How many students
have offered Mathematics alone ?
(1) 35 (2) 48 (3) 60 (4) 22

C-7. 31 candidates appeared for an examination, 15 candidates passed in English, 15 candidates passed in
Hindi, 20 candidates passed in Sanskrit. 3 candidates passed only in English. 4. candidates passed
only in Hindi, 7 candidates passed only in Sanskrit. 2 candidates passed in all the three subjects How
many candidates passed only in two subjects ?
(1) 17 (2) 15 (3) 22 (4) 14

Comprehension (C-8 to C-10)

In a group of 1000 people, there are 750 people, who can speak Hindi and 400 people, who can speak
Bengali.

C-8. Number of people who can speak Hindi only is

(1) 300 (2) 400 (3) 500 (4) 600

C-9 Number of people who can speak Bengali only is

(1) 150 (2) 250 (3) 50 (4) 100

C-10 Number of people who can speak both Hindi and Bengali is
(1) 50 (2) 100 (3) 150 (4) 200

Section (D) : Ordered pair , Cartesion product, Relation, Domain and Range of Relation

D-1. If A = {a, b}, B = {c, d}, C = {d, e}, then {(a, c), (a, d), (a, e), (b, c), (b, d), (b, e)} is equal to
(1) A  (B  C) (2) A  (B  C) (3) A × (B  C) (4) A × (B  C)

D-2. If A = {2, 4, 5}, B = {7, 8, 9}, then n(A × B) is equal to

(1) 6 (2) 9 (3) 3 (4) 0

D-3. If A = {x : x2 – 5x + 6 = 0}, B = {2, 4}, C = {4, 5} then A × (B  C) is-

(1) {(2, 4), (3, 4)} (2) {(4, 2), (4, 3)} (3) {(2, 4), (3, 4), (4, 4)} (4) {(2, 2), (3, 3), (4, 4), (5, 5)}

D-4. If A = {1, 2, 3} and B = {1, 2} and C = {4, 5, 6}, then what is the number of elements in the set A  B  C
?
(1) 8 (2) 9 (3) 15 (4) 18

D-5. Let A = {a, b, c} and B = {1, 2}. Consider a relation R defined from set A to set B. Then R can equal to
set
(1) A (2) B (3) A × B (4) B × A

D-6. A and B are two sets having 3 and 4 elements respectively and having 2 elements in common. The
number of relation which can be defined from A to B is
(1) 25 (2) 210 – 1 (3) 212 – 1 (4) 212

D-7. Let R be relation from a set A to a set B, then

(1) R = A  B (2) R = A  B (3) R  A × B (4) R  B × A
 11M02 - Sets, Relation & Function (Exercise) 74

EXERCISE - 1
Section (A) :
A-1. (4) A-2. (2) A-3. (1) A-4. (4) A-5. (1) A-6. (4) A-7. (3)
A-8. (2) A-9. (2)

Section (B) :
B-1. (2) B-2. (2) B-3. (2) B-4. (2) B-5. (1) B-6. (4) B-7. (2)
B-8. (1) B-9. (2) B-10. (3) B-11. (1) B-12. (4)

Section (C) :
C-1. (2) C-2. (3) C-3. (3) C-4. (3) C-5. (2) C-6. (3) C-7. (2)
C-8. (4) C-9 (2) C-10 (3)

Section (D) :
D-1. (3) D-2. (2) D-3. (1) D-4. (4) D-5. (3) D-6. (4) D-7. (3)
D-8. (4) D-9. (2) D-10. (1) D-11. (2) D-12. (3) D-13. (1) D-14 (1)

Section (E) :
E-1. (1) E-2. (2) E-3. (1) E-4. (3) E-5. (1) E-6. (2) E-7. (4)
E-8. (2) E-9. (2) E-10. (1) E-11. (4) E-12. (2) E-13. (4) E-14. (4)
E-15. (4) E-16. (2) E-17. (4) E-18. (4)

Section (F) :
F-1. (1) F-2 (3) F-3 (2) F-4 (2) F-5 (1) F-6 (2) F-7 (2)
F-8 (4)

EXERCISE - 2
PART - I
1. (1) 2. (2) 3. (3) 4. (3) 5. (3) 6. (2) 7. (1)
8. (1) 9. (3) 10. (4)
PART - II
Section (A) :
A-1. (2) A-2 (1) A-3 (3)
Section (B) :
B-1. (1)  (q), (2)  (r), (3)  (s), (4)  (p)
B-2. (1)  (p), (2)  (r), (3)  (s), (4)  (q)

Section (C) :
C-1. (1,4) C-2. (1,2,4) C-3. (1,3) C-4. (1,2)

EXERCISE - 3

1. (2) 2. (1) 3. (1) 4. (2) 5. (2) 6. (3) 7. (2)

8. (2) 9. (3) 10. (2) 11. (3) 12. (2) 13. (1,2) 14. (1)