Stemfield International School
Shrashti Pandey
XII ‘A’
PPT presentation
Topic:- Relation
Sonam Agrawal
Content
What is relation?
Sets and relation
Types of relation i.e., SYMMERTIC,
REFLEXIVE, TRANSITIVE AND
EQUIVALENCE RELATION.
Examples.
What is Relation?
Relation word means the way that people,
groups, countries etc feel connection about or
behave towards each other…
For example:- parents, siblings, friends,
teacher and students…etc
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.
In the morning assembly at schools,
students are supposed to stand in a
queue in ascending order of the heights
of all the students. This defines an
ordered relation between the students
and their heights.
Therefore, we can say,
‘A set of ordered pairs is defined as
a relation.’
# set {1, 2, 5, 7} represents the domain.
# set {a, c, n} represents the range.
Sets and Relation
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.
For example, an empty relation denotes none
of the elements in the two sets is same.
Types of Relation
Reflexive Relation
Symmetric Relation
Transitive Relation
Equivalence Relation
Reflexive relation:-A binary Relation R defined
on a Set A is said to be reflexive if for each
element a ∈ A, we have aRa.
R is reflexive if for each a ∈ A, (a, a) ∈ R.
This proves that when each element of a set is
related to itself, only then can a relation be said
to be reflexive. R will not be a reflexive relation if
even one element of the set is not related to itself.
Que 1. Is the relation R = {(0,0), (0,1)} defined on A
= {0, 1} reflexive?
Solution:-
For R to be reflexive, we must have (m, m) R for all m
A
0 ∈ A and (0, 0) ∈ R
1 ∈ A but (1, 1) ∉ R
Hence, R is not a reflexive 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
Transitive Relations
A binary relation R defined on a set A is
said to be a transitive relation for all a, b,
c in A if a R b and b R c, then a R c, that
is, if a is related to b and b is related to c,
then a must be related to c.
Mathematically, we can write it as: a
relation R defined on a set A is a
transitive relation for all a, b, c ∈ A, if (a,
b) ∈ R and (b, c) ∈ R, then (a, c) ∈ R.
Que. Define a relation R on a set A = {a, b, c} as R =
{(a, b), (b, c), (b, b)}. Determine if R is a transitive
relation.
Solution: As we can see that (a, b) ∈ R and (b, c) ∈
R, and for R to be transitive (a, c) ∈ R must hold,
but (a, c) ∉ R.
So, R is not a transitive relation.
Answer: R is not a transitive relation
Equivalence Relation Definition
A relation R on a set A is said to be
an equivalence relation if and only if the relation
R is reflexive, symmetric and transitive. The
equivalence relation is a relationship on the set
which is generally represented by the symbol “∼”.
Reflexive: A relation is said to be reflexive, if
(a, a) ∈ R, for every a ∈ A.
Symmetric: A relation is said to be
symmetric, if (a, b) ∈ R, then (b, a) ∈ R.
Transitive: A relation is said to be transitive
if (a, b) ∈ R and (b, c) ∈ R, then (a, c) ∈ R.
Note:-
All functions are relations, but all
relations are not functions. This is
because, in a function, one input can
connect to only one output and not
more than one, while there is no such
condition in a relation.
THANK
YOU!!!!!!
