Relations
Relations
Relation in Mathematics is defined as the relationship between two sets. If we are given two sets set
A and set B and set A has a relation with set B then each value of set A is related to a value of set B
through some unique relation. Here, set A is called the domain of the relation, and set B is called the
range of the relation.
For example if we are given two sets, Set A = {1, 2, 3, 4} and Set B = {1, 4, 9, 16} then the ordered pair
{(1, 1), (2, 4), (3, 9), (4, 16)} represents the relation defined as, R, A: → B {(x, y): y = x2: y ϵ B, x ϵ A}.
Relations Definition
Relation is defined as the relation between two different sets of information. Suppose we are given
two sets containing two different values then a relation defined such that it connects the value of
the first set with the value of the second set is called the relation.
Suppose we are given a set A that contains the name of girls of a class and another set B that
contains the height of girls then a relation connects set A with set B. In mathematical terms, we can
say that,
Relations Examples
Suppose there are two sets X = {4, 36, 49, 50} and Y = {1, -2, -6, -7, 7, 6, 2}. A relation R states that
R = {(4, -2), (4, 2), (36, -6), (36, 6), (49, -7), (49, 7)}
Also, the image added below shows two sets A and B, and the relation between them,
Set A = {x, y, z}
Set B = {1, 2, 3}
Representation of Relations
In mathematics or in set theory we can represent the relation using different techniques and the two
important ways to represent the set are,
Roaster Notation
if are relation between two sets is represented using the logical formula then this type of
representation is called the set builder notation.
For example, if we are given two sets set X = {2, 4, 6} and set Y = {4, 8, 12}. Then after observing
clearly, we can see that each element of set Y is twice each element of set X the relation between
them is,
Roaster Form
Roaster form is another way of representing a relation. In roaster form, we use ordered pairs to
represent the relation.
For example, if we are given two sets set X = {2, 4, 6} and set Y = {4, 8, 12}. Then the relation
between set X and set Y is represented using the relation R such that,
Sets are the values that are arranged collectively. And relations are relationship that connects the
values of two sets. So sets and relations are connected to each other. For example, if we are given
two sets
Set B = {2, 3, 4, 5, 6}
Then the relation that connects the two sets, set A and set B,
R = {(-2, 2), (-1, 3), (0, 4), (1, 5), (2, 6)}
Types of Relation
Empty Relation
A relation R on a set A is called Empty if the set A is an empty set, i.e. any relation where no element
of set A is not related to the element of set B then it is called an empty relation. For example, A = {1,
2, 3} and B = {5, 6, 7} where, R = {(x, y) where x + y = 22}, then it is an empty relation.
Reflexive Relation
A relation R on a set A is called reflexive if (a, a) ∈ R holds for every element a∈ A . i.e. if set A = {a, b}
then R = {(a, a), (b, b)} is reflexive relation.
Symmetric Relation
A relation R on a set A is called symmetric if (b, a) ∈ R holds when (a, b) ∈ R i.e. The relation R = {(a,
b), (b, a)} is a reflexive relation on (a, b)
Transitive Relation
A relation R on a set A is called transitive if (a, b) ∈ R and (b, c) ∈ R then (a, c) ∈ R for all a,b,c ∈ A i.e.
Equivalence Relation
A relation is an Equivalence Relation if it is reflexive, symmetric, and transitive. i.e. relation R = {(1,
1), (2, 2), (3, 3), (1, 2), (2, 1), (2, 3), (3, 2), (1, 3), (3, 1)} on set A = {1, 2, 3} is equivalence relation as it
is reflexive, symmetric, and transitive.
Universal Relation
Universal relation is a relation in which all elements of set are mapped to other element of set then
it is called universal relation. For example, A = {4, 8, 12} and B = {1, 2, 3} then universal relation is, R =
{(x, y) where x > y}
Identity Relation
Identity relation is a relation defined such all elements in a set are related to itself. It is defined as, I =
{(x, x) : for all x ∈ X}.
For example P = {1, 2, 3} then Identity Relation(I) = {(1, 1), (2, 2), (3, 3)}
Inverse Relation
A relation is called the inverse of any relation if elements of one set is inverse pair of another set.
Inverse of a relation R is denoted as R-1. i.e., R-1 = {(y, x): (x, y) ∈ R}.
Examples on Relations
Q1: Find the inverse relation of R = {(1, 3), (2, 4), (3, 5)}
Solution:
Given,
R = {(1, 3), (2, 4), (3, 5)}
Q2: Find the inverse relation of R = {(a, x), (b, y), (c, z)}
Solution:
Given,
Q3: Is the relation R = {(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)} on set A = {1,2,3} an equivalence
relation?
Solution:
No, it’s not an equivalence relation. It’s reflexive and symmetric, but not transitive.
Q4: Find the domain and range of the relation R = {(1,2), (2,3), (3,4), (4,5)}.
Solution:
Q5: Is the relation R = {(x,y) | x² + y² = 25} on the set of real numbers a function?
Solution:
No, it’s not a function. For example, (0,5) and (0,-5) are both in the relation.
Q6: Find the inverse of the relation R = {(1,1), (2,4), (3,9), (4,16)}.
Solution:
Q7: Determine if the relation R = {(x,y) | x – y is even} on the set of integers is an equivalence
relation.
Solution:
Q8: Find the composition R ∘ S for R = {(1,2), (2,3), (3,4)} and S = {(1,1), (2,2), (3,3), (4,4)}.
Solution:
Q9: Is the relation R = {(a,b) | a is a multiple of b} on the set of positive integers transitive?
Solution:
Yes, it’s transitive.
Q10: Find the reflexive closure of R = {(1,2), (2,3), (3,1)} on set A = {1,2,3}.
Solution: