Scribd
Upload
13 views12 pages

Numerical Expressions_discrete mathematics

The document discusses relations in discrete mathematics, defining a relation as a subset of the Cartesian product of a set with itself. It outlines various properties of relations such as reflexive, irreflexive, symmetric, antisymmetric, asymmetric, transitive, and non-transitive, along with examples. Additionally, it covers representation methods for relations, closures of relations, equivalence relations, and partial order relations.

Uploaded by

vishnu
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
13 views12 pages

Numerical Expressions_discrete mathematics

The document discusses relations in discrete mathematics, defining a relation as a subset of the Cartesian product of a set with itself. It outlines various properties of relations such as reflexive, irreflexive, symmetric, antisymmetric, asymmetric, transitive, and non-transitive, along with examples. Additionally, it covers representation methods for relations, closures of relations, equivalence relations, and partial order relations.

Uploaded by

vishnu
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/ 12

vasundara degree

& pg college
presented by
PUNNA VISHNU PRIYA
MSc(computer science)
realtions
D i s c re t e
mathematics
Relations and Their Properties :
A relation on a set A is a subset of the Cartesian product A×A. If R is a relation
on A, we write (a,b)∈R to denote that a is related to b through R.

Properties of Relations:
A relation R on a set A can have the following properties:
1. Reflexive:-
A relation R on a set A is reflexive if for every element a∈A, the pair (a,a)is in
R.
• Formal definition: ∀a∈A,(a,a)∈R
• Example:
Set A={1,2,3}
Relation R={(1,1),(2,2),(3,3)}
This relation is reflexive because every element is related to itself.

2. Irreflexive:-
A relation R on a set A is irreflexive if for every element a∈A, the pair (a,a) is
not in R.
• Formal definition: ∀a∈A,(a,a)∉R
• Example:
Set A={1,2,3}
Relation R={(1,2),(2,3)}
Relations and Their Properties :
3. Symmetric:-
A relation R on a set A is symmetric if whenever (a,b)∈R, it follows that (b,a)∈R.
• Formal definition: ∀a,b∈A,(a,b)∈R⇒(b,a)∈R.
• Example:
Set A={1,2,3}
Relation R={(1,2),(2,1),(3,3)}
This relation is symmetric because if (1,2)∈R, then (2,1)∈R.

4. Antisymmetric:-
A relation R on a set A is antisymmetric if whenever (a,b)∈R and (b,a)∈R, it follows
that a=b.
• Formal definition: ∀a,b∈A,(a,b)∈R and (b,a)∈R⇒a=b.
• Example:
Set A={1,2,3}
Relation R={(1,2),(2,3),(3,3)}
This relation is antisymmetric because there are no pairs (a,b) and
(b,a)where a≠b.
Relations and Their Properties :
5. Asymmetric:-
A relation R on a set A is asymmetric if whenever (a,b)∈R, it follows that (b,a)∉R for all
a≠b.
• Formal definition: ∀a,b∈A,(a,b)∈R⇒(b,a)∉R
• Example:
Set A={1,2,3}
Relation R={(1,2),(2,3)}
This relation is asymmetric because if (1,2)∈R, then (2,1)∉R.

6. Transitive:-
A relation R on a set A is transitive if whenever (a,b)∈R and (b,c)∈R, it follows that
(a,c)∈R.
• Formal definition: ∀a,b,c∈A,(a,b)∈R and (b,c)∈R⇒(a,c)∈R.
• Example:
Set A={1,2,3}
Relation R={(1,2),(2,3),(1,3)}
This relation is transitive because if (1,2)∈R and (2,3)∈R, then (1,3)∈R.

7. Non-Transitive:-
A relation is non-transitive if it does not satisfy the transitive property. That is, there
exist pairs (a,b) and (b,c) such that (a,c)∉R.
• Formal definition: ∃a,b,c∈A such that (a,b)∈R and (b,c)∈R but (a,c)∉R.
• Example:
Set A={1,2,3}
Representing Relations :
Relations between finite sets can be represented using ordered
pairs, tables, zero-one matrices, and directed graphs. We focus on
binary relations and two key representation methods:
• Zero-One Matrices: Efficient for computer-based applications.
• Directed Graphs: Provide a visual understanding of relational
properties.
Matrix Representation of Relations:
• A relation between finite sets can be represented using a zero–one
matrix.
• R is a relation from A = {a1, a2, … , am} to B = {b1, b2, … , bn}
• relation R can be represented by the matrix MR = [mij],
• where mij = 1 if (ai , bj ) ∈ R,
0 if (ai , bj ) ∉ R.
Example:
Representing Relations Using Diagraphs :
• A directed graph, or digraph, consists of a set V of vertices (or nodes)
together with a set E of ordered pairs of elements of V called edges
(or arcs). The vertex a is called the initial vertex of the edge (a, b),
and the vertex b is called the terminal vertex of this edge.

Example:
Closures of Relations :
The closure of a relation R is a process of extending the relation to satisfy
certain properties. There are different types of closures:
• Reflexive Closure: (a,a) for all a ∈ A.
• Symmetric Closure: If (a,b) ∈ R, ensure (b,a) ∈ R.
• Transitive Closure: If (a,b) ∈ R and (b,c) ∈ R, then (a,c)∈ R.

Example:

Let A={1,2,3} and R={(1,2),(2,3)}.

Reflexive Closure: Add (1,1),(2,2),(3,3)→ RR={(1,2),(2,3),(1,1),


(2,2),(3,3)}.

Symmetric Closure: Add (2,1),(3,2)→ RS={(1,2),(2,1),(2,3),(3,2)}.

Transitive Closure: Add (1,3)(since 1→2 and 2→3) → RT={(1,2),


(2,3),(1,3)}.
Equivalence Relations :
An equivalence relation is a relation that satisfies three properties:
• Reflexive: (a,a) for all a ∈ A.
• Symmetric: If (a,b) ∈ R, ensure (b,a) ∈ R.
• Transitive: If (a,b) ∈ R and (b,c) ∈ R, then (a,c)∈ R.

Example:

Let Set A: A={1,2,3,4}


Define relation R: R={(1,1),(2,2),(3,3),(4,4),
(1,3),(3,1)}

Check Properties:
Reflexive: Each element relates to itself → ✔
Symmetric: If (1,3)∈R, then (3,1)∈R → ✔
Transitive: If (1,3)∈R and (3,1)∈R, then (1,1) is
in R → ✔
Since all properties hold, RRR is an equivalence
PARTIAL ORDER RELATION:
A partial order is a relation that satisfies the following properties:
• Reflexive: (a,a) for all a ∈ A.
• Antisymmetric: If (a,b) ∈ R and (b,a) ∈ R then a = b.
• Transitive: If (a,b) ∈ R and (b,c) ∈ R, then (a,c)∈ R.

Example:

Let Set A: A={1,2,3}


Define relation R: R={(1,1),(2,2),(3,3),(1,2),(2,3)}.
Check Properties:
• Reflexive: (1,1),(2,2),(3,3) are present → ✔
• Antisymmetric: Since (1,2)∈R but (2,1)∉R and (2,3)∈R but (3,2)∉R→
✔
• Transitive: (1,2)∈R and (2,3)∈R, so (1,3) should be added for
transitivity → Add (1,3) to satisfy
Since it satisfies reflexivity, antisymmetry, and transitivity, RRR is a
partial order relation.
THANK YOU

You might also like