Professional Documents
Culture Documents
RELATIONS
(1) Types of Relations
Universal Relation
1. Empty Relation
A relation in which no
2. A relation in which each 3. Identity Relation
4. Reflexive Relation:
A relation in which each (a, a)R, for every
element of A is related to element of A is related to
element is related to a A.
any other element of A, i.e., every element of A, i.e.,
R=ϕ A×A. R=A×A.
{
itself only. I = ( a, a ) , a ∈ A }
3. PROPERTIES
2. 3. 6.
1. 4. 5. R is reflexive implies
R is asymmetric implies R is not symmetric
that R is irreflexive. By does not imply R is R is not symmetric R is not antisymmetric that R is not
definition, for all antisymmetric. Counter does not imply R is does not imply R is asymmetric. By
R is not reflexive does
a, b ∈ A, ( a, b ) ∈ R example: asymmetric. Counter symmetric. Counter definition, for all
not imply R is irreflexive. a ∈ A, ( a,a ) ∈ R
Counter example: and ( b,a ) ∉ R This implies example: example:
A = {1, 2,3} , R = This implies that, both
A = {1, 2,3} , R = {(1,1)} that for all ( a, b ) ∈ R,a ≠ b A = {1, 2,3} , R = A = {1, 2,3} , R =
{(1, 2 ) , ( 2,3) , ( 3, 2 )} (a, b) and (b, a) are in
Thus, for all a ∈ A, ( a,a ) ∉ R {(1, 2 ) , ( 2, 2 )} {(1, 2 ) , ( 2,3) , ( 3, 2 )} R when a = b. Thus, R is
Therefore, R is irreflexive.
not asymmetric.
The number of binary The number of binary The number of There are at least 2n
transitive relations
relation on A which are relation which are both asymmetric binary
(lower bound) and
both symmetric and reflexive and antisymmetric relation possible on at most
2 2
asymmetric is 1. on the set A is3(n − n)/2 the set A is 3(n − n)/2 2
n2 −n
2n − 2 2 + 1 (upper bound)
5. OPERATION ON RELATIONS:
1. R1 − R 2 = {( a, b )∣( a, b ) ∈ R1 and ( a, b ) ∉ R 2 } 2.R 2 − R1 = {( a, b )∣( a, b ) ∈ R 2 and ( a, b ) ∉ R1} 3. R1 ∪ R 2 = {( a, b )∣( a, b ) ∈ R1 or ( a, b ) ∈ R 2 }
4. R1 ∩ R 2 = {( a, b )∣( a, b ) ∈ R1 and ( a, b ) ∈ R 2 }
PROPERTIES 6. COMPOSITON OF
1) If R1 and R2 are reflexive, and symmetric, then R1 R2
is reflexive, and symmetric. RELATIONS
2) If R1 is transitive and R 2 is transitive, then R1 ∪ R 2
need not be transitive. Let R1 ⊆ A × B and R 2 ⊆ B × C ,Composition of R 2 on
counter example: Let A = {1, 2} such that R1 = {(1, 2 )} and R1 , denoted as R1 R 2 or simply R1R 2 is
R 2 = {( 2,1)}.R1 ∪ R 2 = {(1, 2 ) , ( 2,1)} and (1,1) ∉ R1 ∪ R 2 implies that
R1 R 2 = {( a,c )∣a ∈ A,c ∈ C ∧ ∃b ∈ B such that
R1 ∪ R 2 is not transitive.
7. EQUIVALENCE CLASS
Equivalence class of a ∈ A is defined as [a] = {x∣( x,a ) ∈ R} , that is all the elements related to a under
the relation R.
Example
E=Even integers, O=odd integers.
(i) All elements of E are related to each other and all elements of O are related to each other.
(ii) No element of E is related to any element of O and vice-versa.
(iii) E and O are disjoint andZ = E ∪ O
The subset E is called the equivalence class containing zero and is denoted by [0].
4. For any two equivalence class[ a ] and [ b ], either [ a ] = [ b ] or [ a ] ∩ [ b ] = φ 5. For all a, b ∈ A , if a ∈ [ b ] then b ∈ [ a ]
8. BINARY OPERATIONS
Let S be a non-empty set. A function f : S × S S is called a binary opertion on set S.
Note
n2
Number of binary operations on a set containing n elements is n