Scribd
Upload
17 views2 pages

Relations and Functions 3

The document explains various types of relations in mathematics, including inverse, reflexive, symmetric, transitive, and equivalence relations. It also discusses how to determine if a relation is a function, emphasizing that a function must associate each X-value with only one Y-value. Examples are provided to illustrate these concepts, particularly in the context of throwing dice.

Uploaded by

anamariechanomuan100805
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
17 views2 pages

Relations and Functions 3

The document explains various types of relations in mathematics, including inverse, reflexive, symmetric, transitive, and equivalence relations. It also discusses how to determine if a relation is a function, emphasizing that a function must associate each X-value with only one Y-value. Examples are provided to illustrate these concepts, particularly in the context of throwing dice.

Uploaded by

anamariechanomuan100805
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

Inverse Relation

If R is a relation from set A to set B i.e., R ∈ A X B. The relation R-1= {(b,a):(a,b) ∈ R}.
For example,
If you throw two dice if R = {(1, 2) (2, 3)}, R-1 = {(2, 1) (3, 2)}. Here the domain is the range R-1 and vice
versa.

Reflexive Relation
A relation is a reflexive relation iIf every element of set A maps to itself, i.e for every a ∈ A, (a, a) ∈ R.

Symmetric Relation
A symmetric relation is a relation R on a set A if (a, b) ∈ R then (b, a) ∈ R, for all a & b ∈ A.

Transitive Relation
If (a, b) ∈ R, (b, c) ∈ R, then (a, c) ∈ R, for all a,b,c ∈ A and this relation in set A is transitive.

Equivalence Relation
If a relation is reflexive, symmetric and transitive, then the relation is called an equivalence relation.

How to Convert a Relation into a Function?


A special kind of relation (a set of ordered pairs) which follows a rule i.e every X-value should be associated
with only one y-value, then the relation is called a function.

Examples
Example 1: Is A = {(1, 5), (1, 5), (3, -8), (3, -8), (3, -8)} a function?

Solution: If there are any duplicates or repetitions in the X-value, the relation is not a function.

But there’s a twist here. Look at the following example:


Though X-values are getting repeated here, still it is a function because they are associating with
the same values of Y.
The point (1, 5) is repeated here twice and (3, -8) is written thrice. We can rewrite it by writing a
single copy of the repeated ordered pairs. So, “A” is a function.

Example 2: Give an example of an Equivalence relation.

Solution:
If we note down all the outcomes of throwing two dice, it would include reflexive, symmetry and transitive
relations. Then, throwing two dice is an example of an equivalence relation.
Example 3: All functions are relations, but not all relations are functions. Justify.

Solution:
Let’s suppose, we have two relations given in below table

You might also like