RELATIONS

Cartesian Product
Definition 1: The cartesian product of
two
sets A and B, denoted by a bB
A xAB, is the
set of
all ordered pairs (a,b) with and
 
A B  a,b |a  A and b  B
Thus 
2
A
A x A is denoted by ■
 Cartesian Product
Definition 2: The cartesian product
of “n” setsA1 , A2 ,...An consists of all
possible n – tuples a1 ,a2 ,...an 
where ai  Ai for every i; it is
denoted by

A1 A2 ...An ■
 Binary Relation
Definition 3: A binary relation
R
from a set A to a set B is a
subset of R  A B
AxB:

The domain of the relation

consists of
dom  R   x  A|  x, y   R for any y  B
the first elements in R :
 Binary Relation
The range of the relation consists of
the second elements in R:

range  R   y  B |  x, y   R for any x  A

If a, b  R , we say “a is related to b
by aRb
the relation R”, in symbols, we write:

Binary relation from A to itself is a

binary
 Examples
1) Let A = {2, 3, 5} and B= {2, 3, 4, 6,
7}.
Define a relation R from A to B as

R  a, b  | a is a factor of b
follows: 

 
R  2, 2 , 2, 4 , 2, 6 , 3,3, 3, 6  ,
Then
dom  R   2,3 , range  R   2,3, 4, 6
 Examples
2) A={Tom, Dick, Harry},
B={Amy, Betsy, Carol, Daisy};

R  a, b   A B | a is married to b 
Let
R = { (Tom, Daisy), (Dick, Carol),
(Harry, Amy)}.
 Examples
3) A 1,3,5, 7 , B  2, 4, 6 ,
R  a, b  | a  b 9 
R  3, 6 , 5, 4 , 7, 2 

4) Relation  
R   x, y  | x 2  y 2 9
is the circle with center at the origin
and radius 3
 Representation by
Graphs
1) 2 2 2) Tom Amy

3 3 Dick Betsy
5 4 Harry Carol
6 Daisy
7
Definition 4: A directed graph G is the
ordered
pair G=(V,E) of two sets: a nonempty finite
set V,
 Representation by
Graphs
5)
A 1, 2,3, 4 , R  a, b  | a, b  A; a  b 
R  1, 2 , 1,3, 1, 4 , 2,3, 2, 4 , 3, 4 

1 2 4
3
Representation by
Matrices
Relation 1):
R  2, 2 , 2, 4 , 2, 6 , 3,3 , 3, 6  ,

Relation 3): A, B 2 3 4 6 7
R  3, 6 , 5, 4 , 7, 2  2 1 0 1 1 0
3 0 1 0 1 0
A, B 2 4 6
5 0 0 0 0 0
1 0 0 0
3 0 0 1
5 0 1 0
7 1 0 0
 Function as Relation
Definition 5: For nonempty sets A and
B,
a relation f from A to B which
satisfies the
if a, b   f and a, c  f , then b c
condition:

is called a function, or mapping, from

f :A B
A to
B and denoted:
 Function as Relation
We often writef a  b 
whena, b  f
dom  f  is called the domain of
function f

range  f  is called the range of

function f ■
Which of the relations R, S, T and U are
functions?

R) 1 a S) 1 a
2 b 2 b
3 c 3 c

T) 1 a U) 1 a
2 b 2 b
3 c 3 c
 Functions
Definition 6: A function is
called range f 
one-to-one, if each element of

appears at most once as the image of

, a2  dom  f  : a1 a2  f a1   f a2 
a1an
element of :
f :A B
range  f  B
A function is called onto,
 Functions
A function f : A  B is called
bijection from A to B (or one-to-
one
correspondence from A to B), if :
1) it
dom  f  A
is one-to-one;
2) range  f  B;
3) .
■
 Relation on a set A
Definition 7: 1) A relation R on a set
A is reflexive if aRa for every element
a in A, that is:

a , a   R for every a  A
2) A relation R on a set A is symmetric
 
if b, a  Rwhenever  
a, b 
: R

a, b  R  b, a  R
 Relation on a set A
3) A relation R on a set A is

antisymmetric if a, b  R 
band
,a  R a b
  only if
a, b  R and a b  b, a :
  R

4) A relation R on a set aA, b
is  R
transitive if whenever
 
b, c  R
and
 
a, c  R
 Equivalence Relation
Definition 8: A relation on a set is an
equivalence relation if it is reflexive,
symmetric, and transitive ■
Examples:
1) The relation: …has the same color
hair as… on the set of people is
reflexive,
symmetric, and transitive. So it is an
equivalence relation.
 Equivalence Relation
2) Let A denote a set of all words.
Define a relation

R  a, b  A | a  b 
2

where a denotes the length of the

a
word . Is R an equivalence relation?
3)

R   x, y   \  0  | x y  0
2

 Congruence Relation
4) R  a, b    | a  b  Z 
2

5) Congruence Relation. Leta, b, m  Z

where m > 1. Then “a is congruent
to b
modulo m”,
a b mod m
denoted by
if a - b is divisible by m. Congruence
relation is an equivalence relation.
 Equivalence Class
Definition 9: Let R be an
equivalence a A
relation on a set A and let . The
equivalence class of a, denoted by
[a], is
 
 a  as a R  x  A | a, x  R
defined

x  a
If
then
a
x is a representative
of
 Equivalence Class
Example: 
A  1, 2,1  2, 2  2 
R  a, b  A | a  b  Z 
2

1  2 1, 2 , 
 1  2   2  2   1  2, 2  2
    
A 1  1  2 
 Partition of a set
 
Definition 10: P  A1 , A2 ,..., An
be a partition of a set A if:
1) A  , A  A, i 1, 2..., n;
i i
n
2) A Ai ;
i 1

3) Ai  Aj  , i  j ■
 Partition of a set
Teorem 1. Let R be an equivalence
relation on a set A. Then the set of
distinct equivalence classes forms a
partition of A.

A2 A4
A1 A6
A3 A5
 Partition of a set
Example: Find all equivalence classes
of
the congruence relation mod 4 on the
 
set Rof a, b  Z 2 | a b mod 4
integers:
 
 0 ...  12,  8,  4, 0, 4,8,12,... ;
1 ...  11,  7,  3,1,5,9,13,... ;
 2 ...  10,  6,  2, 2, 6,10,14,... ;
 3 ...  9,  5,  1,3, 7,11,15,... .
 Closures of Relation
Definition 11: Let R is a relation
without
property P (reflexive, symmetric,
transitive or equivalence). If there
R is
aS
relation S with property P such that

and S is a subset of every relation

with
property P containing R, then S is
called
 Closures of Relation
Example:A 1, 2,3, 4 , R  1,3, 1, 4 , 2,1, 3, 2 
Reflexive closure of R is:
R   1,1, 2, 2 , 3,3 , 4, 4 
Symmetric closure of R is:
R   3,1, 4,1, 1, 2 , 2,3 
Transitive closure of R is:

R   1,1, 1, 2 , 2, 2 , 2,3 , 2, 4 , 3,3 , 3,1, 3, 4 

 Partial Order
Definition 12: A relation R on a set
A is a
partial order if it is reflexive,
antisymmetric,
and transitive. The set A with its partial
order
R is a partially ordered set (or poset),
denoted by (A, R) ■ 
Examples: 1)The relation  R,  on R is
reflexive, antisymmetric, and transitive,
 Partial Order
2) The divisibility relation Z is a
partial
R  a, b   Z | a divides b
order: 2

3) The inclusion relation:


"  "   A, B  P S  | A  B
2

 Total Order
Definition 13: If any two
elements in
a poset are comparable, such a
partial
order is a total order or a linear
order.
The poset is then a totally ordered
set
or a linearly ordered set ■
 Equivalence Relation
Problem 1. Find the number of reflexive
relations R that can be defined on a set
with nn 1
2
n elements ( )
Problem 2. Find the number of
symmetric n n1 2
2
relations that can be defined on a set
with n
Elements ( )