RELATION
ORDERED PAIR: Two numbers and listed in a specific order and enclosed in parentheses form an
ordered pair .By interchanging the position of the components,the ordered pair is
changed.Thus,
Equality of two ordered pairs:
We have and
Ex. Find and ,when
CARTESIAN PRODUCT OF TWO SETS:
Let and be two non empty sets.Then , the Cartesian product of and is the set denoted by
,consisting of all ordered pairs such that and .
and }
Example: if and ,find and
Soln: We have
And
EX. If , and , find (i) (ii)
(iii)
RELATION : Let and be two non empty sets. Then , a relation from to is a subset of
Thus , is a relation from to . If then we say that ‘
and we write . If then ‘ is not related to
DOMAIN,RANGE AND CODOMAIN OF A RELATION.
Let be a relation from to .Then ,
(i) The set of all first coordinates of elements of is called the domain of , written as
(ii) The set of all second coordinates of elements of is called the range of ,denoted by
(iii) The set is called the co-domain of
Thus, and
EX. Let and .Show that is a relation from to
. Find (i) dom(R)(ii) co-domain(R) (iii) range (R).
Soln: Here, m and
Since ,then is a relation from to .
(i)
(ii)
(iii)
EX. Let and . Let be a relation ‘ from to .
(i) List the elements of
(ii) Find the domain,codomain and range of
VARIOUS TYPES OF RELATION: Let A be a non empty set. Then, a relation R on A is said to be
(i) Reflexive : If for all , i.e. for all
(ii) Symmetric : If for all , i.e. for all
(iii) Transitive : If and for all
i.e. for all
EQUIVALENCE RELATION: A relation which is reflexive ,symmetric and transitive is called an
equivalence relation.
EX. Let be a relation on , defined by and }.Show that is an
equivalence relation.
Soln: Given : and }.
(i) Let . Then ,
S for all
So, is reflexive.
(ii) Let
Thus,
is symmetric.
(iii) Let and
and
Thus, and
is transitive.
Thus , is reflexive,symmetric and transitive.
Hence , is equivalence relation.
Ex.1. Let be a given fixed positive integer. Let and
. Show that is an equivalence relation on
2. Let be the set of all integers and let be a relation on ,defined by is
even}. Show that is an equivalence relation on
3. Let and is even}. Show that is an equivalence relation on
4. Let and is divisible by 5}, Show that is an equivalence relation on
.
