Professional Documents
Culture Documents
Unit 1 Relation
Unit 1 Relation
Unit 1 Relation
Let A and B are non‐empty sets. Then a relation R from A to B is a subset of 𝐴 𝐵 .
Symbolically,
𝑅⊆ 𝐴 𝐵 or 𝑅 𝑥, 𝑦 : 𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 𝑎𝑛𝑑 𝑥𝑅𝑦
𝑥𝑅𝑦 indicates that ‘x is related to y’ and 𝑥𝑅𝑦 indicates that ‘x is not related to y’.
Example:
Let 𝐴 1,2,3 and 𝐵 2,3,4 then 𝐴 𝐵 1,2 , 1,3 , 1,4 , 2,2 , 2,3 , 2,4 , 3,2 , 3,3 , 3,4
𝑅 𝑥, 𝑦 : 𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 𝑎𝑛𝑑 𝑥 𝑦 then
Let 𝐴 1,2,3 and 𝐵 2,3,4 then 𝐴 𝐵 1,2 , 1,3 , 1,4 , 2,2 , 2,3 , 2,4 , 3,2 , 3,3 , 3,4
𝑆 𝑥, 𝑦 : 𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 𝑎𝑛𝑑 𝑥 𝑦 then
𝑆 2,2 , 3,3 ⊆ 𝐴 𝐵
𝑅 𝑥, 𝑦 : 𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 𝑎𝑛𝑑 𝑥 𝑦 4 then
𝑅 2,2 , 1,3 ⊆ 𝐴 𝐵
Domain and Range of a Relation
then the set of first coordinates of every element of R is called ‘Domain of R’ and
the set of the second coordinates of its every element is called ‘ Range of R’.
For example: Let 𝐴 1,2,3 and 𝐵 2,3,4 and the relation R from A to B is
𝑅 1,2 , 1,3 , 1,4 , 2,3 , 2,4 , 3,4 then
𝑑 𝑅 1, 2,3 𝑎𝑛𝑑 r 𝑅 2, 3, 4
Q. Find domain and range of the relation 𝑅 𝑎, 𝑏 ∶ 𝑎, 𝑏 ∈ 𝑁 𝑎𝑛𝑑 2𝑎 𝑏 10
𝑅 1, 8 , 2, 6 , 3, 4 , 4, 2
𝑑 𝑅 1, 2, 3, 4 𝑎𝑛𝑑 r 𝑅 2, 4, 6, 8
The prime numbers less than 8 are 2, 3, 5, 7
𝑅 2, 4 , 3,9 , 5, 25 , 7, 49
𝑑 𝑅 2, 3, 5, 7 𝑎𝑛𝑑 r 𝑅 4, 9, 25, 49
Remember:
called Universal relation from A to B.
4) Let A and B be two non‐empty sets having ‘m’ and ‘n’ elements then there may be 2
different relations from A and B.
Types of Relations
Identity Relation :
Let A be a non‐empty set and a relation ‘R’ from A to A is defined as
𝑅 𝑥, 𝑦 : 𝑥, 𝑦 ∈ 𝐴 𝑎𝑛𝑑 𝑥 𝑦 .
Then relation R is called Identity relation.
So, in identity relation, every element of a set is related to itself only.
Inverse Relation :
Let A and B be two non‐empty sets and R be a relation from A to B is defined as
𝑅 𝑥, 𝑦 : 𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 𝑎𝑛𝑑 𝑥𝑅𝑦
Then, the inverse relation, denoted by 𝑅 , from B to A is defined as
𝑅 𝑦, 𝑥 : 𝑦 ∈ 𝐵, 𝑥 ∈ 𝐴 𝑎𝑛𝑑 𝑥, 𝑦 ∈ 𝑅
Let R be a relation from A to B and defined as 𝑑 𝑅 1, 2,3 𝑑 𝑅 2, 3, 4
𝑅 1, 2 , 1, 3 , 1, 4 , 2, 3 , 2, 4 , 3, 4 r 𝑅 2, 3, 4 r 𝑅 1, 2,3
now the Inverse relation 𝑅 is defined as
𝑅 2, 1 , 3, 1 , 4, 1 , 3, 2 , 4, 2 , 4, 3 r 𝑅 𝑑 𝑅 𝑑 𝑅 r 𝑅
Types of Relations
Composite Relation :
Let A, B and C be three non‐empty sets and 𝑅 ⊆ 𝐴 𝐵 , 𝑆 ⊆ 𝐵 𝐶 i. e .
Then, composite relation, denoted by 𝑆𝑜𝑅, from A to C is defined as
Let 𝐴 1,2,3 , 𝐵 𝑎, 𝑏, 𝑐, 𝑑 , 𝐶 𝑝, 𝑞, 𝑟, 𝑠
𝑅 1, 𝑎 , 2, 𝑏 , 1, 𝑐 , 2, 𝑑
and 𝑆 𝑎, 𝑠 , 𝑏, 𝑟 , 𝑐, 𝑟
Then 𝑆𝑜𝑅 1, 𝑠 , 2, 𝑟 , 1, 𝑟
Types of Relations
Let A and B be non‐empty sets and consider a relation 𝑅 from set A to B.
The complement relation, denoted by 𝑅 , is a relation from A to B such that
𝑅 𝐴 𝐵 𝑅
𝑅 𝑥, 𝑦 ∶ 𝑥, 𝑦 ∉ 𝑅 𝑎𝑛𝑑 𝑥, 𝑦 ∈ 𝐴 𝐵
Reflexivity or Reflexive Relation :
𝑥, 𝑥 ∈ 𝑅 ∀ 𝑥 ∈ 𝐿 i.e.
𝑥, 𝑥 ∉ 𝑅 ∀ 𝑥 ∈ 𝐿
Cont….
Properties / Types of Relations
Symmetry or Symmetric Relation :
A relation R on set A is Symmetric relation if
𝑥, 𝑦 ∈ 𝑅 ⇒ 𝑥 ∥ 𝑦
⇒ 𝑦∥𝑥 ⇒ 𝑦, 𝑥 ∈ 𝑅
𝑥, 𝑦 ∈ 𝑅 ⇒ 𝑥 ⊥ 𝑦
⇒ 𝑦⊥𝑥 ⇒ 𝑦, 𝑥 ∈ 𝑅
Cont….
Properties / Types of Relations
Antisymmetric Relation :
A relation R on set A is Antisymmetric relation if
𝑥, 𝑦 ∈ 𝑅 𝑎𝑛𝑑 𝑦, 𝑥 ∈ 𝑅 ⟹ 𝑥 𝑦
1 𝑅 𝑥, 𝑦 ∶ 𝑥, 𝑦 ∈ 𝑁 𝑎𝑛𝑑 𝑥 𝑦 is Antisymmetric relation.
Properties / Types of Relations
Transitivity or Transitive Relation :
Let A be a non‐empty set and R be a binary relation on A i.e. 𝑅 ⊆ 𝐴 𝐴
then the relation R is Transitive relation if
𝑥 𝑅 𝑦 and 𝑦 𝑅 𝑧 ⟹ 𝑥𝑅𝑧
i.e. 𝑥, 𝑦 ∈ 𝑅 𝑎𝑛𝑑 𝑦, 𝑧 ∈ 𝑅 ⟹ 𝑥, 𝑧 ∈ 𝑅
Properties / Types of Relations
Equivalence Relation:
Let R be a relation defined on a non‐empty set A such that
(i) R is Reflexive i.e. 𝑥, 𝑥 ∈ 𝑅 ∀ 𝑥∈𝐴
(ii) R is Symmetric i.e. 𝑥, 𝑦 ∈ 𝑅 ⇒ 𝑦, 𝑥 ∈ 𝑅
(iii) R is Transitive i.e. 𝑥, 𝑦 ∈ R and 𝑦, 𝑧 ∈ 𝑅 ⇒ 𝑥, 𝑧 ∈ 𝑅
Then, relation R is called E.R.
Cont….
Properties / Types of Relations
Partial order Relation:
Let R be a relation defined on a non‐empty set A such that
(i) R is Reflexive i.e. 𝑥, 𝑥 ∈ 𝑅 ∀ 𝑥∈𝐴
(ii) R is Antisymmetric i.e. 𝑥, 𝑦 ∈ 𝑅 𝑎𝑛𝑑 𝑦, 𝑥 ∈ 𝑅 ⇒ 𝑥 𝑦
(iii) R is Transitive i.e. 𝑥, 𝑦 ∈ R and 𝑦, 𝑧 ∈ 𝑅 ⇒ 𝑥, 𝑧 ∈ 𝑅
Then, relation R is called Partial order relation.
Example : Let ‘S’ be the collection of all sets and the relation ‘R’ is defined as
𝑅 𝐴, 𝐵 ∶ 𝐴, 𝐵 ∈ 𝑆 and 𝐴 ⊆ 𝐵
Then
(i) R is Reflexive Since every set is subset of itself i.e. ∀ 𝐴 ∈ 𝑆 , 𝐴, 𝐴 ∈ 𝑅
i. e. A ⊆ 𝐵 and 𝐵 ⊆ 𝐴 ⟹ A 𝐵
i. e. A ⊆ 𝐵 and 𝐵 ⊆ 𝐶 ⟹ A⊆𝐶
Then, relation R is a Partial order relation.
Q. If W be the set of whole numbers and R 𝑥, 𝑦 ∶ 𝑥 𝑦 3𝑘, 𝑘 ∈ 𝐼 . Prove that the relation R is an E.R.
R is Symmetric relation.