Contact no.
- 9950439778 Website Link - Click Here
RELATIONS
This chapter deals with establishing binary relation between elements of one set and elements of
another set according to some particular rule of relationship.
1. CARTESIAN PRODUCT :
The Cartesian product of two sets A, B is a non–void set of all ordered pair (a, b),
where a A and b B. This is denoted by A × B
A × B = {(a, b) a A and b B}
e.g. A = {1, 2}, B = {a, b}
A × B = {(1, a), (1, b) (2, a) (2, b)}
Note :
(i) A × B B × A (Non-commutative)
(ii) n(A × B) = n(A) n(B) and n(P(A × B)) = 2n(A)n(B)
(iii) A = and B = A×B=
(iv) If A and B are two non–empty sets having n elements in common, then (A × B) and (B × A)
have n2 elements in common
(v) A ×(B C) = (A × B) (A × C)
(vi) A ×(B C) = (A × B) (A × C)
(vii) A ×(B – C) = (A × B) – (A × C)
Ex. If n(A) = 7, n(B) = 8 and n(A B) = 4, then match the following columns.
(i) n(A B) (a) 56
(ii) n(A × B) (b) 16
(iii) n((B × A) × A) (c) 392
(iv) n((A × B) (B × A)) (d) 96
(v) n((A × B) (B × A)) (e) 11
Sol. (i) n(A B) = n(A) + n(B) – n(A B) = 7 + 8 – 4 = 11
(ii) n(A × B) = n(A) n(B) = 7 × 8 = 56 = n(B × A)
(iii) n((B × A) × A) = n(B × A).n(A) = 56 ×7 = 392
(iv) n((A × B)(B × A)) = (n(A B))2 = 42 = 16
(v) n((A × B) (B × A)) = n(A × B) + n(B × A) – n((A × B) (B × A))
= 56 + 56 – 16 = 96
Ex. If A = {2, 4} and B = {3, 4, 5}, then (A B) × (A B) is
(1) {(2, 2), (3, 4), (4, 2), (5, 4)}
(2) {(2, 3), (4, 3), (4, 5)}
(3) {(2, 4), (3, 4), (4, 4), (4, 5)}
(4) {(4, 2), (4, 3), (4, 4), (4, 5)}
Sol. A B = {4} and A B = {2, 3, 4, 5}
(A B) × (A B) = {(4, 2), (4, 3), (4, 4), (4, 5)}
Join Telegram - t.me/amarnathanandsir https://annaacademy.com 1
Contact no. - 9950439778 Website Link - Click Here
2. RELATION :
Every subset of A × B defined a relation from set A to set B.
If R is relation from AB
R : {(a, b) | (a, b) A ×B and aRb}
Highlights :
Let A and B be two non empty sets and R : A B be a relation such that R : {(a, b) | (a, b) R,
a A and b B}.
(i) 'b' is called image of 'a' under R.
(ii) 'a' is called pre–image of 'b' under R.
(iii) Domain of R : Collection of all elements of A which has a image in B.
(iv) Range of R : Collection of all elements of B which has a pre–image in A.
Note :
(1) It is not necessary that each and every element of set A has a image in Set B and each
and every element of set B has preimage in Set A.
(2) Elements of set A having image in B is not necessarily unique.
(3) Basically relation is the number of subsets of A × B
Number of non empty relations = no. of ways of selecting a non zero subset of A×B
= mnC1 + mnC2 + …….. + mnCmn = 2 mn – 1
Total number of relation = 2mn(including void relation)
Examples :
(1) A = {1, 2, 3, 4, 5} and B = {2, 4, 5}
aRb a and b are relatively prime or co-prime (i.e. HCF is 1)
[Sol. R = {(1, 2), (1, 4), (1, 5), (2, 5), (3, 2), (3, 4), (3, 5), (4, 5), (5, 2), (5, 4)})]
Domain of R{1, 2, 3, 4, 5,}
Range of R{2, 4, 5}
(2) A = {Jaipur, Patna, Kanpur, Lucknow} and B = {Rajasthan, Uttar Pradesh, Bihar}
aRb a is capital of b, a A and b B
[Sol. R = {(Jaipur, Rajasthan), (Patna, Bihar), (Lucknow, Uttar Pradesh)}
(3) If A = {1, 3, 5, 7}, B = {2, 4, 6, 8}
Relation is aRb a > b, a A, b B
Sol. R = {(3, 2), (5, 2), (5, 4), (7, 2), (7, 4), (7, 6)}
Domain = {3, 5, 7}
Range = {2, 4, 6}
3. REPRESENTATION OF A RELATION :
1. Roaster form : In this form we represent set of all ordered pairs (a, b) such that (a, b) R,
where a A, b B.
2. Set builder notation : Here we denote the relation by the rule which co relates the two sets.
3. Arrow - diagram (Mapping) : This is the pictorial notation of any relation
Ex. Let A = {–2, –1, 4}, B = {1, 4, 9}
A relation from A to B i.e. a R b is defined as a is less than b.
This can be represented in the following ways.
1. Roster form :
Join Telegram - t.me/amarnathanandsir https://annaacademy.com 2
Contact no. - 9950439778 Website Link - Click Here
R = {(–2, 1), (–2, 4), (–2, 9), (–1, 1), (–1, 4), (–1, 9), (4, 9)}
2. Set builder notation :
R = {(a, b) : a A and b B, a is less than b}
3. Arrow - diagram :
Empty relation (Void relation) : No elements of A is related to any elements of B.
Universal relation : Each elements of A is related to every elements of B.
4. INVERSE RELATION
If relation R is defined from A to B, then the inverse relation would be defined from B to A, i.e.
R:AB aRb where a A, b B
R :BA
–1
bRa where a A, b B
Domain of R = Range of R–1
and Range of R = Domain of R–1
R–1 = {(b, a) | (a, b) R}
A relation R is defined on the set of 1st ten natural numbers.
e.g. N is a set of first 10 natural nos.
N = {1, 2, 3, ……., 10} & a, b N
aRb a + 2b = 10
R = {(2, 4), (4, 3), (6, 2), (8, 1)}
R–1 = {(4, 2), (3, 4), (2, 6), (1, 8)}
5. IDENTITY RELATION :
A relation defined on a set A is said to be an identity relation if each & every element of A is
related to itself & only to itself.
e.g. A relation defined on the set of natural numbers is
aRb a = b where a & b N
R = {(1, 1), (2, 2), (3, 3),………}
R is an identity relation
6. CLASSIFICATION OF RELATIONS :
(i) Reflexive : A relation R on a set A is said to be reflexive if every element of A is
related to itself.
Join Telegram - t.me/amarnathanandsir https://annaacademy.com 3
Contact no. - 9950439778 Website Link - Click Here
i.e. if (a, b) R, then (a, a) R. However if there is a single ordered pair of (a, b) R
such (a, a) R, then R is not reflexive.
e.g. A relation defined on (set of natural number)
aRb 'a' divides 'b' a, b N
R would always contain (a, a) because every natural number divides itself and
hence it is a reflexive relation.
Note : Every Identity relation is a reflexive relation but every reflexive relation need
not be an Identity.
(ii) Symmetric : A relation defined on a set is said to be symmetric if aRb bRa.
If (a, b) R, then (b, a) must be necessarily there in the same relation.
Examples :
A relation defined on the set of lines.
(1) aRb a||b
It is a symmetric relation because if line 'a' is | | to 'b' then the line 'b' is | | 'a'.
where (a, b) L {L is set of | | lines}
(2) L1 R L2 L1 L2 It is a symmetric relation
L1 , L2 L {L is a set of lines}
(3) aRb 'a' is brother of 'b' is not a symmetric relation as 'b' may be sister of 'a'
(4) aRb 'a' is a cousin of 'b'. This is symmetric relation.
If R is symmetric
(1) R = R–1
(2) Range of R = Domain of R
(iii) Transitive : A relation on set A is said to be a transitive if aRb and bRc implies aRc
i.e. (a, b) R and (b, c) R, then (a, c R
and a, b, c need not be distinct.
Examples :
(1) A relation R defined on a set of natural numbers N with rule aRb a b
Let R : {(1, 2), (1, 1)}. on set {1, 2}
In this relation a, b, c are not distinct but it is transitive. It is transitive but not
symmetric as (2, 1) is missing. Minimum number of ordered pair that must be added to
make it reflexive, symmetric and transitive is 2 i.e. (2, 1) and (2, 2).
(2) Only Transitive R = {(x, y) | x < y, x N, y N}
Only Symmetric R = {(x, y) | x + y = 10, x N, y N}
Only Reflexive R = {(x, y) | x = y, or x – y = 1, x N, y N}
Join Telegram - t.me/amarnathanandsir https://annaacademy.com 4
Contact no. - 9950439778 Website Link - Click Here
6. EQUIVALENCE RELATION :
If a relation is Reflexive, Symmetric and Transitive, then it is said to be an equivalence relation.
Examples :
(1) A relation defined on N
xRy x=y
R is an equivalence relation
(2) A relation defined on a set of | | lines in a plane
aRb a||b
It is an equivalence relation
(3) Relation defined on the set of integer (I)
Prove that : xRy (x – y) is even is an equivalence relation.
(4) R = {(1, 2,), (2, 3)} add minimum number of ordered pairs to make it an equivalence
relation.
{(1, 1), (2, 2), (3, 3), (2, 1), (3, 2), (1, 3), (3, 1)} = 7
(5) A = {1, 2, 3, ………….. 13, 14}
R = {(x, y) | 3x – y = 10} R ST
R = {(x, y) | x is coefficient of y} R S T
R = {(x, y) | x is father of y} R S T
7. PARTIAL ORDER RELATION :
Definition :
A relation R on a set P is called partial order relation if it is reflexive, antisymmetric and
transitive. That means that for all x, y and z in P we have :
x R x;
if x R y and y R x, then x = y;
if x R y and y R z, then x R z.
Example :
The identity relation I on a set P partial order relation.
On the set of real numbers the relation is partial order relation.
The relation "is a divisor of " defines partial order on the set of natural numbers N.
Join Telegram - t.me/amarnathanandsir https://annaacademy.com 5
Contact no. - 9950439778 Website Link - Click Here
EXERCISE # I
1. If R is a relation from a finite set A having m elements to a finite set B having n elements, then
the number of relation from A to B is-
(1) 2mn (2) 2mn –1 (3) 2mn (4) mn
2. In the set A = {1, 2, 3, 4, 5}, a relation R is defined by R = {(x, y) | x, y and x < y}. Then
R is-
(1) Reflexive (2) Symmetric (3) Transitive (4) None of these
3. For real numbers x and y, we write x R y x – y + 2 is an irrational number. Then the
relation R is.
(1) Reflexive (2) Symmetric (3) Transitive (4) None of these
4. Let X = {1, 2, 3, 4} and Y = {1, 3, 5, 7, 9}. Which of the following is relations from X to Y-
(1) R1 = {(x, y) | y = 2 + x, x X, y Y}
(2) R2 = {(1, 1), (2, 1), (3, 3), (4, 3), (5, 5)}
(3) R3 = {(1, 1), (1, 3), (3, 5), (3, 7), (5, 7)}
(4) R4 = {(1, 3), (2, 5), (2, 4), (7, 9)}
5. Let L denote the set of all straight lines in a plane. Let a relation R be defined by
R L. Then R is.
(1) Reflexive (2) Symmetric (3) Transitive (4) None of these
6. Let R be a relation defined in the set of real numbers by a R b 1 + ab > 0. Then R is-
(1) Equivalence relation (2) Transitive
(3) Symmetric (4) Anti–symmetric
7. Which one of the following relations on R is equivalence relation-
(1) x R1 y | x | = | y | (2) x R2 y x y
(3) x R3 y x | y (4) x R4 y x < y
8. Two points P and Q in a plane are related if OP = OQ, where O is a fixed point. This relation
is-
(1) Reflexive but not symmetric (2) Symmetric but not transitive
(3) An equivalence relation (4) none of these
9. The relation R defined in A = {1, 2, 3} by a R b if |a 2 – b2 | < 5. Which of the following is
false-
(1) R = {(1, 1), (2, 2), (3, 3), (2, 1), (1, 2), (2, 3), (3, 2)}
(2) R–1 = R
(3) Domain of R= {1, 2, 3}
(4) Range of R = {5}
Join Telegram - t.me/amarnathanandsir https://annaacademy.com 6
Contact no. - 9950439778 Website Link - Click Here
10. Let a relation R in the set N of natural numbers be defined as (x, y) R if and only if
x2 – 4xy + 3y2 = 0 for all x, y N. The relation R is-
(1) Reflexive (2) Symmetric
(3) Transitive (4) An Equivalence relation
11. Let A = {2, 3, 4, 5} and let R = {(2, 2), (3, 3),(4, 4), (5, 5), (2, 3), (3, 2), (3, 5), (5, 3)} be a
relation in A. Then R is-
(1) Reflexive and transitive (2) Reflexive and symmetric
(3) Reflexive and antisymmetric (4) none of these
12. If A = {2, 3} and B = {1, 2}, then A×B is equal to-
(1) {(2, 1), (2, 2), (3, 1), (3, 2)} (2) {(1, 2), (1, 3), (2, 2), (2, 3)}
(3) {(2, 1), (3, 2)} (4) {(1, 2), (2, 3)}
13. Let R be a relation over the set N × N and it is defined by (a, b) R(c, d) a + d = b + c. Then R
is.
(1) Reflexive only (2) Symmetric only
(3) Transitive only (4) An equivalence relation
14. Let N denote the set of all natural numbers and R be the relation on N × N defined by (a, b)
R(c, d) if ad(b + c) = bc(a + d), then R is-
(1) Symmetric only (2) Reflexive only
(3) Transitive only (4) An equivalence relation
15. If A = {1, 2, 3}, B = {1, 4, 6, 9} and R is a relation from A to B defined by 'x is greater than y'.
Then range of R is-
(1) {1, 4, 6, 9} (2) {4, 6, 9} (3) {1} (4) none of these
16. Let L be the set of all straight lines in the Euclidean plane. Two lines 1 and 2 are said to be
related by the relation R if 1 is parallel to 2 . Then the relation R is-
(1) Reflexive (2) Symmetric (3) Transitive (4) Equivalence
17. A and B are two sets having 3 and 4 elements respectively and having 2 element 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
18. For n, m N, n | m means that n is a factor of m, the relation | is -
(1) reflexive and symmetric
(2) transitive and symmetric
(3) reflexive, transitive and symmetric
(4) reflexive, transitive and not symmetric
Join Telegram - t.me/amarnathanandsir https://annaacademy.com 7
Contact no. - 9950439778 Website Link - Click Here
19. Let R = {(x, y) : x, y A, x + y = 5} where A = {1,2,3,4,5} then
(1) R is not reflexive, symmetric and not transitive
(2) R is an equivalence relation
(3) R is reflexive, symmetric but not transitive
(4) R is not reflexive, not symmetric but transitive
20. Let R be relation on a set A such that R = R–1 then R is-
(1) reflexive (2) symmetric (3) transitive (4) none of these
21. Let x, y I and suppose that a relation R on I is defined by x R y if and only if x y then
(1) R is partial order relation (2) R is an equivalence relation
(3) R is reflexive and symmetric (4) R is symmetric and transitive
22. Let R be a 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
23. Given the relation R = {(1,2),(2,3)} on the set A = {1, 2, 3}, then minimum number of ordered
pairs which when added to R make it an equivalence relation
(1) 5 (2) 6 (3) 7 (4) 8
24. Let P = {(x, y) | x2 + y2 = 1, x, y R} Then P is -
(1) reflexive (2) symmetric (3) transitive (4) anti-symmetric
25. Let X be a family of sets and R be a relation on X defined by 'A is disjoint from B'. Then R is-
(1) reflexive (2) symmetric (3) anti-symmetric (4) transitive
26. In order that a relation R defined in a non-empty set A is an equivalence relation, it is sufficient
that R
(1) is reflexive (2) is symmetric
(3) is transitive (4) possesses all the above three properties
27. If R is an equivalence relation in a set A, then R–1 is -
(1) reflexive but not symmetric (2) symmetric but not transitive
(3) an equivalence relation (4) none of these
28. Let A = {p,q,r}. Which of the following is an equivalence relation in A?
(1) R1 = {(p, q), (q, r), (p, r),(p, p)} (2) R2 = {(r, q),(r, p),(r, r),(q, q)}
(3) R3 = {(p, p), (q, q), (r, r), (p, q)} (4) none of these
Join Telegram - t.me/amarnathanandsir https://annaacademy.com 8
Contact no. - 9950439778 Website Link - Click Here
EXERCISE # II
PREVIOUS YEAR QUESTIONS
1. Let R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} be a relation on the set A = {1, 2, 3, 4}, The relation R is -
(1) transitive (2) not symmetric [AIEEE - 2004]
(3) reflexive (4) a function
2. Let R = {(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9), (3, 12), (3, 6)} be relation on the set
A = {3, 6, 9, 12}. The relation is- [AIEEE - 2005]
(1) reflexive and transitive only (2) reflexive only
(3) an equivalence relation (4) reflexive and symmetric only
3. Let W denote the words in the English dictionary. Define the relation R by :
R = {(x, y) W × W| the words x and y have at least one letter in common}.Then R is-
(1) reflexive, symmetric and not transitive [AIEEE - 2006]
(2) reflexive, symmetric and transitive
(3) reflexive, not symmetric and transitive
(4) not reflexive, symmetric and transitive
4. Consider the following relations :-
R = {(x, y) | x, y are real numbers and x = wy for some rational number w} ;
m p
S = { , | m, n, p and q are integers such that n,q 0 and qm = pn}. Then :
n q
(1) R is an equivalence relation but S is not an equivalence relation [AIEEE - 2010]
(2) Neither R nor S is an equivalence relation
(3) S is an equivalence relation but R is not an equivalence relation
(4) R and S both are equivalence relations
5. Let R be the set of real numbers. [AIEEE - 2011]
Statement-1 : A = {(x, y) R × R : y – x is an integer} is an equivalence relation on R.
Statement-2: B = {(x, y) R × R : x = y for some rational number } is an equivalence
relation on R.
(1) Statement-1 is true, Statement-2 is false.
(2) Statement-1 is false, Statement-2 is true
(3) Statement-1 is true, Statement-2 is true; Statement-2 is a correct explanation for Statement-1
(4) Statement-1 is true, Statement-2 is true; Statement-2 is not a correct explanation for
Statement-1.
Join Telegram - t.me/amarnathanandsir https://annaacademy.com 9
Contact no. - 9950439778 Website Link - Click Here
ANSWER KEY
EXERCISE # I
Que. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Ans. 1 3 1 1 2 3 1 3 4 1 2 1 4 4 3
Que. 16 17 18 19 20 21 22 23 24 25 26 27 28
Ans. 4 4 4 1 2 1 3 3 2 2 4 3 4
EXERCISE # II
Que. 1 2 3 4 5
Ans. 2 1 1 3 1
Join Telegram - t.me/amarnathanandsir https://annaacademy.com 10
