Unit 2

Ordered Pairs and Relations

Ordered Pairs
An ordered pair is a composition of the x coordinate (abscissa) and the y coordinate (ordinate), having two
values written in a fixed order within parentheses.
It helps to locate a point on the Cartesian plane for better visual comprehension. The numeric values in an
ordered pair can be integers or fractions.
 The concept of ordered pair is highly useful in data comprehension as well for word problems and
statistics.
 Ordered pair in modern math is widely used in the field of computing and programming languages.
 The coordinate geometry uses ordered pairs to represent geometric figures and objects in an open
space for visual comprehension. Geometric shapes like circle, triangle, square, rectangle and
polygons use the ordered pairs to represent the center, vertices and the length of the sides with
coordinates.

Ordered Pair = (x,y)

where, x = abscissa, the distance measure of a point from primary axis “x” and, y = ordinate, the distance
measure of a point from the secondary axis “y”

Cartesian Product
Let A and B be two non-empty sets. The set of ordered pairs (x,y) where x  A and y  B is called
Cartesian product of set A and B. It is denoted by A B.
Mathematically,
A  B  {( x, y ) : x  A and y  B}
Example: If A={1,2,5} and B={2,4} then
A  B  {(1,2), (1,4), (2,2), (2,4), (5,2), (5,4)}

Relation
Let A and B be two non-empty sets. A relation from A to B is any subset of the Cartesian product A  B
satisfying the given condition.
i.e. R  A  B

Types of Relations
1. Complementary Relation: Let R be a relation from a set A to B. The complementary relation of
R is denoted by R which consists of those ordered pairs which are not in R, that is
R  {(a, b)  A  B : (a, b)  R}.
2. Inverse Relation: Let R be a relation from a set A to B. The inverse relation of R, denoted by R 1
is the relation from set B to A which consists of the those ordered pairs which, when reversed,
belong to R; that is,
R 1  {(b, a) : (a, b)  R}
3. Identity Relation: A relation R in a set A i.e. a relation R from A to A is said to be a identity
relation, generally denoted by I A ,if
I A  {( x, x) : x  A}
Example: Let A={1,2,3} then I A  {(1,1), (2,2), (3,3)}
 4. Void Relation: A relation R from set A to B is said to be void relation if there is no any ordered
pair in relation R belongs to A  B satisfying given condition. i.e. If R   then R is called void
or an empty relation.
5. Universe Relation: A relation from set A to B is called universe relation if R  A  B.

Example: If A={1,2,3,4} and B={a,b,c}

Let R={(1,a),(1,b),(2,b),(2,c),(3,b),(4,a)} and S={(1,b),(2,c),(3,b),(4,b)}
Compute: a) R b) R 1 c) R  S d) R  S
Solution:
For A B
B a b c
A
1 (1,a) (1,b) (1,c)
2 (2,a) (2,b) (2,c)
3 (3,a) (3,b) (3,c)
4 (4,a) (4,b) (4,c)
 A  B  {(1, a ), (1, b), (1, c), (2, a ), (2, b), (2, c), (3, a ), (3, b), (3, c), (4, a ), (4, b), (4, c)}
a) R  A  B  R  {(1, c), (2, a), (3, a), (3, c), (4, b), (4, c)}
b) R 1  {( a,1), (b,1), (b,2), (c,2), (b,3), (a,4)}
c) R  S  {(1, b), (3, b), (2, c)}
d) R  S  {(1, a ), (1, b), (2, b), (2, c), (3, b), (4, a ), (4, b)}
Diagraph or Directed Graph of Relations
Let A and B be two finite sets and R be a relation from A to B. For graphical representation of relation on a
set, each element of the set is represented by a point called node or vertex. An arc is drawn from each point
to its related point. If the pair x  A, y  B is in the relation, the corresponding nodes are connected by arcs
called edges or arcs. The vertex x is called the initial vertex of the edge (x,y), and the vertex y is called the
terminal vertex of this edge. The direction is indicated by an arrow thus called as directed arc. The resulting
pictorial representation of R is called directed graph or diagraph of R. An edge of the form (a,a) is
represented using an arc from vertex ‘a’ back to itself. Such an edge is called a loop.

Example: Let A={1,2,3,4} and R={(1,1),(1,2),(2,1),(2,2),(2,3),(2,4),(3,4),(4,1)}.Draw diagraph of R.

Solution: The diagraph of R is as shown in figure.

Properties of Relation
A relation R on a set A satisfies certain properties which are defined as follows:

1. Reflexive Relation
A relation R on a set A is reflexive if ( a, a )  R for all a  A , that is, if aRa for all a  A . A
relation R is irreflexive if aRa for every a  A .
Example: If R={(1,1),(2,2),(3,3)} is a relation on A={1,2,3} then R is reflexive relation since for
every a  A, (a, a )  R.
 2. Symmetric Relation
A relation R on set A is symmetric if (b, a )  R whenever (a, b)  R for all a, b  R.
Example: R={(1,1),(1,2),(1,3),(2,3),(2,1),(3,1),(3,2)} on A={1,2,3} is a symmetric relation since
for (1,2),(1,3),(2,3) there are (2,1),(3,1) and (3,2) respectively.

3. Asymmetric Relation
A relation R on a set A is asymmetric if (a, b)  R then (b, a )  R for all a, b  R.
Example: R={(1,1),(1,2),(2,3),(3,1)} on A={1,2,3} is asymmetric since for (1,2)  R, there is no
(2,1) in R. Similarly (3,2)  R and (1,3)  R.

4. Antisymmetric Relation
A relation R on set A is antisymmetric if a=b whenever aRb and bRa. The contrapositive of this
definition is that R is antisymmetric if aRb or bRa whenever a  b.
Example: R={(1,2),(2,2),(2,3)} on A={1,2,3} is an antisymmetric since if we choose 1 and 2 then
for 1  2, (1,2)  R but (2,1)  R. Again if we choose 2 and 3 then for 2  3, ( 2,3)  R but
(3,2)  R.

5. Transitive Relation
A relation R on set A is transitive if whenever aRb and bRc, then aRc i.e. (a, b)  R and
(b, c)  R  (a, c)  R for all a, b, c  A.
Example: R={(1,2),(3,2),(2,3),(1,3),(2,2),(3,3)} on A={1,2,3} is transitive .

Equivalence Relation
A relation R on a set A is called an equivalence relation if it is reflexive, symmetrical and transitive.
An equivalence relation is often denoted by ‘tilde’ symbol ‘~’(read as ‘wiggle’).
Example: Let A={1,2,3,4,5}. Show that the relation R={(1,1),(1,5),(2,2),(2,4),(4,2),(4,4),(5,1),(5,5)}is an
equivalence relation.
Solution:
Given,
A={1,2,3,4,5}
R={(1,1),(1,5),(2,2),(2,4),(4,2),(4,4),(5,1),(5,5)}
To prove R is an equivalence, we need to show that R satisfies reflexive, symmetric and transitive property.
Now,
i) Reflexive: a  A, ( a, a )  R
Here, In relation R,
1,2,3,4,5  A,
(1,1)  R, (2,2)  R, (3,3)  R, (4,4)  R, (5,5)  R
Therefore, R is reflexive.
ii) Symmetric: a, b  A, (a, b)  R  (b, a )  R
In relation R,
1,5  A, (1,5)  R  (5,1)  R
2,4  A, (2,4)  R  (4,2)  R
Therefore, R is symmetric.
iii) Transitive: a, b, c  A, (a, b)  R  (b, c)  R  (a, c)  R
In relation R, 1,2,3,4,5  A,
 (1,5)  R  (5,1)  R  (1,1)  R
(2,4)  R  (4,2)  R  (2,2)  R
(2,4)  R  (4,4)  R  (2,4)  R
(5,1)  R  (1,5)  R  (5,5)  R
Therefore, R is transitive.
Since, R satisfies reflexive, symmetric and transitive behavior. So, R is equivalence.

Domain and Range

Suppose R is a relation from A to B then, the domain of relation R is the set of all first elements of
ordered pairs which belongs to R. It is denoted by Dom(R) or D.
Mathematically, Dom( R )  {a  A : (a, b)  R, for some b  B}
Similarly, the range of relation R is the set of all second elements of ordered pairs belongs to relation R.
Mathematically, Range( R )  {b  B : (a, b)  R, for some a  A}
Example: if R={(1,2),(1,4),(2,4)}, then
Dom(R)={1,2}
Ran(R)={2,4}

Restriction/Co-restriction of Domain and Range

Functions are correspondence between two sets, called domain and range. All the functions are restricted
to real number values. Thus, only real numbers can be used in domain, and only real numbers can be in
the range. There are two main reasons why domains are restricted.
 You cannot divide by 0.
 You cannot take the square (or other even) root of negative number, as the results will not be real
number.

Composition of Relation
Let A, B, C be three sets. Let R be a relation from A to B and S be a relation from B to C. Then the
composite of R and S is denoted by SoR and defined as
SoR  {( a, c)  A  C : for some b  B and (b, c)  S}
That is, a ( SoR)c, if for some b  B , we have aRb and bSc.
Example: If R and S be relations on A={1,2,3,4,5} defined by R={(1,1),(1,2),(3,4),(4,2)} and
S={(1,1),(2,1),(3,1),(4,4),(2,2)}. Find SoR and RoS.
Solution:

Given, A={1,2,3,4}
R:A→A={(1,1),(1,2),(3,4),(4,2)}
S:A→A={(1,1),(2,1),(3,1),(4,4),(2,2)}
Now,

 SoR= {(1,1),(1,2),(4,1),(4,2),(3,4)}
Again,

 RoS={(1,1),(1,2),(2,1),(3,1),(2,2),(3,2),(4,2)}

Exercise 2
1. Let A={a,b} and B={x,y,z}. Then find A  B and B  A.
2. Let A={4,5,6}. Find the relations in A  A under the conditions:
x
i) x  y  10 ii)
is an integer.
y
3. Let A={1,2,3,6}. If x, y  A.
R={(x,y):x≤y}
S={(x,y):x divides y}.
Write R and S as sets and find R  S.
4. List the ordered pairs in the relation R from A={0,1,2,3,4} to B={0,1,2,3} where (a, b)R if and
only if (i) a=b (ii) a+b=4 (iii) a>b (iv) a/b
5. If set A has ‘m’ elements and set B has ‘n’ elements then how many relations are there from A to B?
6. If set A has ‘m’ elements and set B has ‘n’ elements then how many ordered pairs are there from A to B?
7. If R and S be relation on {1,2,3,4} defined by R={(1,1), (1,2), (3,4), (4,2)} and S={(1,1), (2,1), (3,1), (4,4),
(2,2)} find RoS and SoR.
8. Is the relation R={(1,2), (2,3), (3,3), (2,1)} is anti-symmetric on A={1,2,3}.
9. The relation R on set A={1,2,3,4} is defined by R={(1,1), (1,2), (1,4), (2,2), (2,1), (2,4), (3,3),
(3,2), (4,3), (4,2), (4,1)}. Draw the diagraph of R and hence find R 1.
10. Consider the relation R from X to Y, where X={1,2,3}; Y={7,8} and R={(1,7), (2,7), (1,8),
(3,8)}. Find: i) R 1 (the inverse of R) ii) R (the complement of R)
11. Let A={0,1,2,3}, R={(x,y): x+y=3}, S={(x,y):3/(x+y)}, T={(x,y):max(x.y)=3}. Compute:
a) ToR b) RoT c) SoS
12. For each of this relations on the set {1,2,3,4}, decide whether it is reflexive, whether it is
symmetric, whether it is anti-symmetric, and whether it is transitive.
a) {(2,2), (2,3), (2,4), (3,2), (3,3), (3,4)}
b) {(1,1), (1,2), (2,1), (2,2), (3,3),(4,4)}
c) {(2,4), (4,2)}
d) {(1,2), (2,3), (3,4)}
e) {(1,1), (2,2), (3,3), (4,4)}
f) {(1,3), (1,4), (2,3), (2,4), (3,1), (3,4)}
13. Consider the following relation on {1,2,3,4,5,6}, R  {(i, j ) : i  j  2} . Is R reflexive? Is R
symmetric? Is R transitive?
14. Let A={1,2,3}, B={p,q,r}, C={x,y,z} and let R={(1,p), (1,r), (2,q), (3,q)} and S={(p,y), (q,x),
(r,z)}. Compute SoR.
15. Let R={(1,1), (2,1), (3,2)}, compute R 2 .
16. a) Display the diagraph with V={a,b,c,d}, E={(a,b), (a,d), (b,b), (b,d), (c,a), (c,b), (d,b)}.
b) Let A={2, 4, 6}, B={4,6,8} and R={(2,4), (2,6), (2,8), (4,4), (4,8), 6,6)}. Construct the diagraph
of R.
17. Write the relation as set of ordered pairs from the diagraph as shown in below:

18. Let A={1,2,3,4}. Show that the relation R={(1,1), (2,2), (3,3), (4,4), (1,2), (2,4), (2,3), (3,4), (4,1),
(2,1), (4,2), (4,3), (1,3), (3,1), (1,4), (3,2)}is an equivalence relation.
19. Determine whether the relation for the directed graph or diagraph shown in the figure below are
reflexive, symmetric and transitive.

20. Verify that the relation R={(1,1), (2,2), (3,3), (4,4), (5,5), (1,2), (2,1), (1,3), (3,1), (2,3), (3,2), (4,5),
(5,4)} on A={1,2,3,4,5} is an equivalence relation with the help of diagraph of the relation.