Scribd
Upload
14 views3 pages

Lesson 3

The document outlines various types of relations in set theory, including reflexive, irreflexive, symmetric, antisymmetric, asymmetric, transitive, identity, void, and universal relations. Each type is defined with examples to illustrate their properties and characteristics. The document emphasizes the conditions that determine whether a relation falls into each category.

Uploaded by

Bangkal Ml
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
14 views3 pages

Lesson 3

The document outlines various types of relations in set theory, including reflexive, irreflexive, symmetric, antisymmetric, asymmetric, transitive, identity, void, and universal relations. Each type is defined with examples to illustrate their properties and characteristics. The document emphasizes the conditions that determine whether a relation falls into each category.

Uploaded by

Bangkal Ml
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Lesson 3

Types of Relations
1. Reflexive Relation: A relation R on set A is said to be a reflexive if (a, a) ∈ R for
every a ∈ A.

Example : If A = {1, 2, 3, 4} then R = {(1, 1) (2, 2), (1, 3), (2, 4), (3, 3), (3, 4), (4, 4)}. Is

Solution: The relation is reflexive as for every a ∈ A. (a, a) ∈ R, i.e. (1, 1), (2, 2), (3, 3),
a relation reflexive?

(4, 4) ∈ R.

Example 2: X = Y ={1, 2, 3, 4}. Determine which relation is reflexive.

R1= {(1, 1) (2, 2), (1, 3), (2, 4), (3, 3), (3, 4), (4, 4} = reflexive
R2= {(1, 1) (2, 2), (2, 3), (3, 1), (3, 2), (4, 4} = not reflexive
R3 = {(1, 1) (2, 2), (3, 3), (4, 4} = reflexive

2. Irreflexive Relation: A relation R on set A is said to be irreflexive if (a, a) ∉


R for every a ∈ A.

Example 1: Let A = {1, 2, 3} and R = {(1, 2), (2, 2), (3, 1), (1, 3)}. Is the relation R

Solution: The relation R is not reflexive as for every a ∈ A, (a, a) ∉ R, i.e., (1, 1) and (3,
reflexive or irreflexive?

3) ∉ R. The relation R is not irreflexive as (a, a) ∉ R, for some a ∈ A, i.e., (2, 2)


∈ R.

Example 2: X = Y ={1, 2, 3, 4}. Determine which relation is reflexive.


R1= {(1, 2) (1, 3), (2, 2), (2, 3), (3, 4), = not irreflexive because there is (2, 2),
R2= {(1, 2) (1, 3), (1, 4), (2, 3), (2, 4), (3, 4} = irreflexive
R3 = {(1, 1) (1, 3), (3, 1), (4, 3} =not irreflexive because there is (1, 1)

3. Symmetric Relation: A relation R on set A is said to be symmetric iff (a, b) ∈ R


⟺ (b, a) ∈ R.

Example 1: Let A = {1, 2, 3} and R = {(1, 1), (2, 2), (1, 2), (2, 1), (2, 3), (3, 2)}. Is a

Solution: The relation is symmetric as for every (a, b) ∈ R, we have (b, a) ∈ R, i.e., (1,
relation R symmetric or not?

2), (2, 1), (2, 3), (3, 2) ∈ R but not reflexive because (3, 3) ∉ R.

1. Relation ⊥r is symmetric since a line a is ⊥r to b, then b is ⊥r to a.


Example of Symmetric Relation:

2. Also, Parallel is symmetric, since if a line a is ∥ to b then b is also ∥ to a.


Example 2: X = Y ={1, 2, 3, 4}. Determine which relation is symmetric

R1= {(1, 1) (1, 2), (2, 1), (2, 3), (3, 2), (4,4) = symmetric because of this (1, 2),
(2, 1), (2, 3), (3, 2),
R2= {(1, 2) (1, 3), (1, 4), (2, 3), (2, 4), (3, 4} = not symmetric
R3 = {(1, 1) (1, 3), (3, 1), (4, 3} = symmetric because of this (1, 3), (3, 1)

4. Antisymmetric Relation: A relation R on a set A is antisymmetric iff (a, b) ∈ R and (b,


a) ∈ R then a = b.

Example1: Let A = {1, 2, 3} and R = {(1, 1), (2, 2)}. Is the relation R antisymmetric?
Solution: The relation R is antisymmetric as a = b when (a, b) and (b, a) both belong to
R.
Example2: Let A = {4, 5, 6} and R = {(4, 4), (4, 5), (5, 4), (5, 6), (4, 6)}. Is the relation
R antisymmetric?
Solution: The relation R is not antisymmetric as 4 ≠ 5 but (4, 5) and (5, 4) both belong to
R.

if for every (a, b) ∈ R implies that (b, a) does not belong to R.


5. Asymmetric Relation: A relation R on a set A is called an Asymmetric Relation

Example: X = Y ={1, 2, 3, 4}. Determine which relation is asymmetric

R1= {(1, 2), (1, 3), (2, 2), (2, 3), (3,4) = asymmetric
R2= {(1, 2) (1, 3), (2, 2), (2, 3), (3, 1), (4, 4} = not asymmetric because there is
(1, 3) and (3, 1) in the relation
R3 = {(1, 1) (1, 3), (3, 1), (4, 3} = not asymmetric because there is (1, 3) and (3, 1)
in the relation

6. Transitive Relations: A Relation R on set A is said to be transitive iff (a, b) ∈ R


and (b, c) ∈ R ⟺ (a, c) ∈ R.
Example1: Let A = {1, 2, 3} and R = {(1, 2), (2, 1), (1, 1), (2, 2)}. Is the relation
transitive?

∈ R i.e, (1, 2) (2, 1) ∈ R ⇒ (1, 1) ∈ R.


Solution: The relation R is transitive as for every (a, b) (b, c) belong to R, we have (a, c)

Note1: The Relation ≤, ⊆ and / are transitive, i.e., a ≤ b, b ≤ c then a ≤ c


(ii) Let a ⊆ b, b ⊆ c then a ⊆ c

Note2: ⊥r is not transitive since a ⊥r b, b ⊥r c then it is not true that a ⊥r c. Since no line is ∥
(iii) Let a/b, b/c then a/c.

∥ b, b ∥ a but a ∦ a.
Thus ∥ is not transitive, but it will be transitive in the plane.
to itself, we can have a

7. Identity Relation: Identity relation I on set A is reflexive, transitive and


symmetric. So identity relation I is an Equivalence Relation.
Example: A= {1, 2, 3} = {(1, 1), (2, 2), (3, 3)}

8. Void Relation: It is given by R: A →B such that R = ∅ (⊆ A x B) is a null relation.


Void Relation R = ∅ is symmetric and transitive but not reflexive.

9. Universal Relation: A relation R: A →B such that R = A x B (⊆ A x B) is a universal


relation. Universal Relation from A →B is reflexive, symmetric and transitive. So
this is an equivalence relation.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy