RELATION
Let A and B be two sets. Then a relation R from A to B is a subset of A ¥ B.
Thus, R is a relation from A to B ¤ R Õ A ¥ B.
If R is a relation from a non-void set A to a non-void set B and if (a, b) ϵ R, then we write aRb, which is read as ‘a is related
to b by the relation R’
Total Number of Relations
Let A and B be two non-empty finite sets consisting of m and n elements respectively. Then A ¥ B consists of mn ordered pairs. So,
total number of subsets of A ¥ B is 2mn. Since each subset of A ¥ B defines a relation from A to B, so total number of relations from A
to B is 2mn. Among these 2mn relations the void relation and the universal relation A ¥ B are trivial relations from A to B.
Domain and Range of a Relation
Let R be a relation from a set A to a set B. Then the set of all first components or coordinates of the ordered pairs belonging to R
is called the domain of R, while the set of all second components or coordinates of the ordered pairs in R is called the range of R.
Thus, Dom (R) = {a : (a, b) ϵ R} and Range (R) = {b : (a, b) ϵ R}.
It is evident from the definition that the domain of a relation from A to B is a subset of A and its range is a subset of B.
If A = {1, 3, 5, 7}, B = {2, 4, 6, 8, 10} and let R = {(1, 8), (3, 6), (5, 2), (1, 4)} be a relation from A to B.
Then Dom (R) = {1, 3, 5} and Range (R) = {8, 6, 2, 4}
Let A be a non-void set. Then, a relation from A to itself i.e. a subset of A ¥ A, is called a relation on set A.
Inverse Relation
Let A, B be two sets and let R be a relation from a set A to a set B. Then the inverse of R, denoted by R–1, is a relation from B to A
and is defined by R–1 = {(b, a) : (a, b) ϵ R}
Clearly, (a, b) ϵ R ¤ (b, a) ϵ R–1
Also, Dom (R) = Range (R–1) and Range (R) = Dom (R–1)
Types of Relations
Empty relation
Let A be a set. Then f Õ A ¥ A and so it is a relation on A. this relation is called the void or empty relation on A.
2 MATHEMATICS
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.
Note:
It is to note here that the void and the universal relations on a set A are respectively the smallest and the largest relations
on A.
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 order words, a relation IA on A is called the identity relation if every element of A is related to itself only.
Example: The relation IA = {(1, 1), (2, 2), (3, 3)} is the identity relation on set A = {1, 2, 3}. But relations R1 = {(1, 1), (2, 2)}
and R2 = {(1, 1), (2, 2), (3, 3), (1, 3)} are not identity relations on A, because (3, 3) œ R1 and in R2 element 1 is related to elements
1 and 3.
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 is reflexive ¤ (a, a) ϵ R for all a ϵ A.
A relation R on a set A is not reflexive if there exists an element a ϵ A such that (a, a) œ R.
Example: Let A = {1, 2, 3} be a set. Then R = {(1, 1), (2, 2), (3, 3), (1, 3), (2, 1)} is a reflexive relation on A. But R1 = {(1, 1),
(3, 2), (2, 1), (3, 2)} is not a reflexive relation on A, because 2 ϵ A but (2, 2) œ R1.
Note:
The identity relation on a non-void set A is always reflexive relation on A. However, a reflexive relation on A is not
necessarily the identity relation on A. For example, the relation R = {(a, a), (b, b), (c, c), (a, b)} is a reflexive relation on set
A = {a, b, c} but is not the identity relation on A.
The universal relation on a non-void set A is reflexive.
Example: A relation R on N defined by (x, y) ϵ R ¤ x ≥ y is a reflexive relation on N, because every natural number is greater
than or equal to itself.
Example: Let X be a non-void set and P(X) be the power set of X. A relation R on P(X) defined by (A, B) ϵ R ¤ A Õ B is a
reflexive relation since every set is subset of itself.
Example: Let L be the set of all lines in a plane. Then relation R on L defined by (l1, l2) ϵ R ¤ l1 is parallel to l2 is reflexive,
since every line is parallel to itself.
Symmetric relation
A relation R on a set A is said to be a symmetric relation if
(a, b) ϵ R ¤ (b, a) ϵ R for all a, b ϵ A
i.e., aRb ¤ bRa for all a, b ϵ A
Note:
The identity and the universal relations on a non-void set are symmetric relations.
A relation R on a set A is not a symmetric relation if there are at least two elements a, b ϵ A such that (a,
b) ϵ R but (b, a) œ R.
A reflexive relation on a set A is not necessarily symmetric.
RELATIONS AND FUNCTIONS 3
Transitive relation
Let A be any set. A relation R on set A is said to be a transitive relation if (a, b) ϵ R and (b, c) ϵ R
(a, c) ϵ R for all a, b, c ϵ A
i.e., aRb and bRc aRc for all a, b, c ϵ A.
In other words, if a is related to b, b is related to c, then a is related to c.
Example: The relation R on the set N of all natural numbers defined by (x, y) ϵ R ¤ x divides y, for all x, y ϵ N is transitive.
Equivalence relation
A relation R on a set A is said to be an equivalence relation on A if
(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, c ϵ A.
Illustration 1 Determine whether each of the following relations are reflexive, symmetric and transitive:
(i) Relation R in the set A = {1, 2, 3…13, 14} defined as R = {(x, y) : 3x − y = 0}
(ii) Relation R in the set N of natural numbers defined as R = {(x, y) : y = x + 5 and x < 4}
(iii) Relation R in the set A = {1, 2, 3, 4, 5, 6} as R = {(x, y) : y is divisible by x}
(iv) Relation R in the set Z of all integers defined as R = {(x, y) : x − y is an integer}
(v) Relation R in the set A of human beings in a town at a particular time given by
(a) R = {(x, y) : x and y work at the same place}
(b) R = {(x, y) : x and y live in the same locality}
(c) R = {(x, y) : x is exactly 7 cm taller than y}
(d) R = {(x, y) : x is wife of y}
(e) R = {(x, y) : x is father of y}
Solution
(i) A = {1, 2, 3 …. 12, 14}
R = {(x, y) : 3x – y = 0}
Therefore, R = {(1, 3), (2, 6), (3, 9), (4, 12)}
R is not reflexive since (1, 1), (2, 2) … (14, 14) œ R
Also, R is not symmetric as (1, 3) ϵ R, but (3, 1) œ R. Also,
R is not transitive as (1, 3), (3, 9) ϵ R, but (1, 9) œ R.
(ii) R = {(x, y) : y = x + 5 and x < 4} = {(1, 6), (2, 7), (3, 8)}
It is seen that (1, 1) œ R.
Therefore, R is not reflexive.
(6, 1) œ R. Therefore, R is not symmetric.
Now, since there is no pair in R such that (x, y) and (y, z) ϵ R, then (x, z) cannot belong to R.
Therefore, R is not transitive.
Hence, R is neither reflexive, nor symmetric, nor transitive.
(iii) A = {1, 2, 3, 4, 5, 6}
R = {(x, y) : y is divisible by x}
We know that any number (x) is divisible by itself.
(x, x) ϵ R. Therefore, R is reflexive.
Now, (2, 4) ϵ R [as 4 is divisible by 2]
But, (4, 2) œ R. [as 2 is not divisible by 4]
Therefore, R is not symmetric.
MATHEMATICS 4
Let (x, y), (y, z) ϵ R. Then, y is divisible by x and z is divisible by y.
Therefore, z is divisible by x.
(x, z) ϵ R.
Therefore, R is transitive.
Hence, R is reflexive and transitive but not symmetric.
(iv) R = {(x, y) : x – y is an integer}
Now, for every x ϵ Z, (x, x) ϵ R as x – x = 0 is an integer.
Therefore, R is reflexive.
Now, for every x, y ϵ Z if (x, y) ϵ R, then x – y is an integer. –
(x – y) is also an integer.
(y – x) is an integer.
Therefore, (y, x) ϵ R
Therefore, R is symmetric
Now,
Let (x, y) and (y, z) ϵ R, where x, y, z ϵ Z. (x
– y) and (y – z) are integers.
x – z = (x – y) + (y – z) is an integer.
Therefore, (x, z) ϵ R.
Therefore, R is transitive.
Hence, R is reflexive, symmetric, and transitive.
(v) (a) R = {(x, y) : x and y work at the same place}
(x, x) ϵ R
Therefore, R is reflexive.
If (x, y) ϵ R, then x and y work at the same place.
y and x work at the same place.
(y, x) ϵ R
Therefore, R is symmetric.
Now, let (x, y), (y, z) ϵ R
x and y work at the same place and y and z work at the same place.
x and z work at the same place.
(x, z) ϵ R
Therefore, R is transitive.
Hence, R is reflexive, symmetric, and transitive.
(b) R = {(x, y): x and y live in the same locality}
Clearly (x, x) ϵ R as x and x is the same human being.
Therefore, R is reflexive.
If (x, y) ϵ R then x and y live in the same locality.
y and x live in the same locality.
(x, y) ϵ R
Therefore, R is symmetric.
Now, let (x, y) ϵ R and (y, z) ϵ R.
x and y live in the same locality and y and z live in the same locality.
x and z live in the same locality.
(x, z) ϵ R
Therefore, R is transitive.
Hence, R is reflexive, symmetric, and transitive.
RELATIONS AND FUNCTIONS 5
(c) R = {(x, y)} : x is exactly 7 cm taller than y}
Now, (x, x) œ R
Since human being x cannot be taller than himself.
Therefore, R is not reflexive.
Now, let (x, y) ϵ R.
x is exactly 7 cm taller than y.
Then, y is not taller than x.
Therefore, (y, x) ϵ R
Indeed if x is exactly 7 cm taller than y, then y is exactly 7 cm shorter than x.
Therefore, R is not symmetric.
Now,
Let (x, y), (y, z) œ R.
x is exactly 7 cm taller than y and y is exactly 7 cm taller than z.
x is exactly 14 cm taller than z.
Therefore, R is not transitive.
Hence, R is neither reflexive, nor symmetric, not transitive.
(d) R = {(x, y) : x is the wife of y}
Now, (x, x) œ R
Since x cannot be the wife of herself.
Therefore, R is not reflexive.
Now, let (x, y) ϵ R
x is the wife of y.
Clearly y is not the wife of x.
Therefore (y, x) œ R.
Indeed if x is the wife of y, then y is the husband of x.
Therefore, R is not transitive.
Let (x, y), (y, z) ϵ R
x is the wife of y and y is the wife of z.
This case is not possible. Also, this does not imply that x is the wife of z.
Therefore, (x, z) œ R
Therefore, R is not transitive.
Hence, R is neither reflexive, nor symmetric, nor transitive.
(e) R = {(x, y) : x is the father of y}
(x, x) œ R
As x cannot be the father of himself.
Therefore, R is not reflexive.
Now, let (x, y) ϵ R.
x is the father of y.
y cannot be the father of y.
Indeed, y is the son or the daughter of y.
Therefore, (y, x) œ R.
Therefore, R is not symmetric.
Now, let (x, y) ϵ R and (y, z) ϵ R.
x is the father of y and y is the father of z.
x is not the father of z.
Indeed x is the grandfather of z.
Therefore, (x, z) œ R
Therefore, R is not transitive.
Hence, R is neither reflexive, nor symmetric, nor transitive.
MATHEMATICS 6
Illustration 2 Show that the relation R in the set A of all the books in a library of a college, given by R = {(x, y) : x and y have
same number of pages} is an equivalence relation.
Solution
Set A is the set of all books in the library of a college.
R = {(x, y) : x and y have the same number of pages}
Now, R is reflexive since (x, x) ϵ R as x and x has the same number of pages.
Let (x, y) ϵ R x and y have the same number of pages.
y and x have the same number of pages.
(y, x) ϵ R
Therefore, R is symmetric.
Now, let (x, y) ϵ R and (y, z) ϵ R.
x and y and have the same number of pages and y and z have the same number of pages.
x and z have the same number of pages.
(x, z) ϵ R
Therefore, R is transitive.
Hence, R is an equivalence relation.
Illustration 3 Show that the relation R in the set A = {1, 2, 3, 4, 5} given by R = {(a, b) : | a – b | is even}, is an equivalence
relation. Show that all the elements of {1, 3, 5} are related to each other and all the elements of {2, 4} are related to each other.
But no element of {1, 3, 5} is related to any element of {2, 4}.
Solution
A = {1, 2, 3, 4, 5}
R = {(a, b) : | a – b | is even}
It is clear that for any element a ϵ A,
we have | a – a | = 0 (which is even).
Therefore, R is reflexive.
Let (a, b) ϵ R.
| a – b | is even,
| – (a – b) | = | b – a | is also even
(b, a) ϵ R
Therefore, R is symmetric.
Now, let (a, b) ϵ R and (b, c) ϵ R.
| a – b | is even and | b – c | is even
(a – b) is even and (b – c) is even
(a – c) = (a – b) + (b – c) is even
[Sum of two even integers is even]
| a – c | is even
(a, c) ϵ R
Therefore, R is transitive.
Hence, R is an equivalence relation.
Now, all elements of the set {1, 3, 5} are related to each other as all the elements of this subset are odd. Thus, the modulus of
the difference between any two elements will be even.
Similarly, all elements of the set {2, 4} are related to each other as all the elements of this subset are even.
R E L A TIO N S A N D F U NCTIONS 7
Also, no ele ment of the subset {1, 3, 5} can be related to any ele ment of {2,
4} as all ele ments of {1, 3, 5} are odd and all ele ments of {2, 4} are even. Thus,
the modulus of the difference between the two ele ments (fro m each of these two
subsets) will not be even.
1. Show that the relation R defined in the set A of all triangles as R = {(T1, T2): T1 is similar to T2}, is equivalence relation.
2. Show that the relation R defined in the set A of all polygons as R = {(P1, P2): P1 and P2 have same number of sides}, is an
equivalence relation.
3. Given a non-empty set X, consider P(X) which is the set of all subsets of X.
Define the relation R in P(X) as follows:
For subsets A, B in P(X), ARB if and only if A B.
Is R an equivalence relation on P(X)? Justify your answer.
4. An integer m is said to be related to another integer n if m is a multiple of n. Then show that the relation is reflexive and
transitive.
