Scribd
Upload
5 views

Ch-3 Discrete Methematics

Chapter 3 of the document focuses on relations in discrete mathematics, defining them as collections of ordered pairs that connect elements from two or more non-empty sets. It outlines various types of relations, including identity, inverse, reflexive, irreflexive, symmetric, antisymmetric, transitive, and equivalence relations, providing examples for clarity. The chapter emphasizes the interconnectedness of sets and relations, explaining how they establish connections between different sets of information.

Uploaded by

somaliyow17
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
5 views

Ch-3 Discrete Methematics

Chapter 3 of the document focuses on relations in discrete mathematics, defining them as collections of ordered pairs that connect elements from two or more non-empty sets. It outlines various types of relations, including identity, inverse, reflexive, irreflexive, symmetric, antisymmetric, transitive, and equivalence relations, providing examples for clarity. The chapter emphasizes the interconnectedness of sets and relations, explaining how they establish connections between different sets of information.

Uploaded by

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

Discrete mathematics

OR(Computer mathematics)
Chapter 3 Relations
Course Outline: Chapter 3 Relations
• Relations
• Identity Relation

• Inverse Relation

• Reflexive Relation

• Irreflexive Relation

• Symmetric Relation

• Antisymmetric Relation:

• Transitive Relations:

• Equivalence Relation
Relations

• In discrete mathematics, the relation can be described as a collection


of ordered pairs. It is used to relate an object from one set to the other
set, and the sets must be non-empty. The relation can contain two or
more than two sets.
Relations

• A relation in mathematics defines the relationship between two


different sets of information. If two sets are considered, the relation
between them will be established if there is a connection between the
elements of two or more non-empty sets.
Sets and Relations

• Sets and relation are interconnected with each other. The relation
defines the relation between two given sets.

• If there are two sets available, then to check if there is any connection
between the two sets, we use relations.
Types of Relations
• Identity Relation

• Inverse Relation

• Reflexive Relation

• Irreflexive Relation

• Symmetric Relation

• Antisymmetric Relation:

• Transitive Relations:

• Equivalence Relation
Identity Relation

• In an identity relation, every element of a set is related to itself only.


For example, in a set A = {a, b, c}, the identity relation will be I = {a,
a}, {b, b}, {c, c}. For identity relation,

• I = {(a, a), a ∈ A}
Inverse Relation

• Inverse relation is seen when a set has elements which are inverse
pairs of another set. For example if set A = {(a, b), (c, d)}, then inverse
relation will be R-1 = {(b, a), (d, c)}. So, for an inverse relation,

• R-1 = {(b, a): (a, b) ∈ R}


Inverse Relation Examples

• Have a look at the following relations and their inverse relations on two sets A
= {a, b, c, d, e} and B = {1, 2, 3, 4, 5}.

• If R = {(a, 2), (b, 4), (c, 1)} ⇔ R-1 = {(2, a), (4, b), (1, c)}

• If R = {(c, 1), (b, 2), (a, 3)} ⇔ R-1 = {(1, c), (2, b), (3, a)}

• If R = {(b, 3), (c, 2), (e, 1)} ⇔ R-1 = {(3, b), (2, c), (1, e)}
Reflexive Relation

• Reflexive relation is a relation of elements of a set A such that each


element of the set is related to itself. As it suggests, the image of every
element of the set is its own reflection. Reflexive relation is an
important concept in set theory
Reflexive Relation
Cont..

• In set theory, a binary relation on A is said to be a reflexive relation if


every element of the set is related to itself. Let us consider a
mathematical example to understand the meaning this concept. Define a
relation on the set of integers Z as ' is equal to'. Now, we know that each
integer is equal to itself such as 0 = 0, -1 = -1, 2 = 2, and so on. This
implies every integer is related to itself. Hence, the relation 'is equal to'
on the set of integers is a reflexive relation.
Cont..

• If there is a single element of the set that is not related to itself, then R
is not a reflexive relation. For example, if for b ∈ A and b is not
related to itself (it is denoted by (b, b) ∉ R or 'not bRb') then R is NOT
reflexive.
Reflexive Relation Example

aRa or (a,a)εR

A={1,2,3}

R1 ={(1,1),(2,2)}

R2={((1,1),(2,2),(3,3)}

R3={(1,1),(2,2),(3,3),(1,2)}

R4={(1,1),(2,2),(3,2)}
Irreflexive Relation
Symmetric Relation
• Symmetric Relation

• In a symmetric relation, if a=b is true then b=a is also true. In other


words, a relation R is symmetric only if (b, a) ∈ R is true when (a,b) ∈
R. An example of symmetric relation will be R = {(1, 2), (2, 1)} for a
set A = {1, 2}. So, for a symmetric relation,

• aRb ⇒ bRa, ∀ a, b ∈ A
Symmetric Relation
Cont..

• Symmetric:

• “arrows back”

• If (x,y) then (y,x)


Antisymmetric Relation:
Asymmetric Relation
Transitive relations

• Transitive relations are binary relations defined on a set such that if


the first element is related to the second element, and the second
element is related to the third element of the set, then the first element
must be related to the third element.
Transitive relations
A A
B B
C C
D D
Cont..

• For example, if for three elements a, b, c in set A, if a = b and b = c,


then a = c. Here, equality '=' is a transitive relation. There are mainly
three types of relations in discrete mathematics, namely reflexive,
symmetric and transitive relations among many others.
Transitive Relations

• Transitive Relations: A Relation R on set A is said to be transitive iff


(a, b) ∈ R and (b, c) ∈ R ⟺ (a, c) ∈ R.
Equivalence Relation

• If a relation is reflexive, symmetric and transitive at the same time, it


is known as an equivalence relation.
Thanks

You might also like