Relation

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.

Example: Writing the Ordered Pairs Shown by a Relationship Given in an Arrow

Diagram
Write the relation 𝑅 for the following arrow diagram:

The diagram shown is an arrow, or mapping, diagram. It links elements in an input set 𝑋 with
elements in an output set 𝑌. We can define a relation for the arrow diagram by writing it as a
list of ordered pairs in a set, 𝑅.
The first input number is 6, and the arrow points to the output number 8. Hence, the first
ordered pair is (6,8).Similarly, the second input number, 10, has an arrow leading to the
number 12, so the second ordered pair is (10,12).The third input number, 11, has an arrow
pointing to the output number 13, so the third ordered pair is (11,13).Since the final output
number does not have a corresponding input number, we do not include it in an ordered pair.
Hence, 𝑅={(6,8),(10,12),(11,13)}.

Exercise: A company has four categories of employees given by Assistants (A), Clerks (C),
Managers (M) and an Executive Officer (E). The company provide ₹10,000, ₹25,000, ₹50,000
and ₹1,00,000 as salaries to the people who work in the categories A, C, M and E respectively.
If A1, A2, A3, A4 and A5 were Assistants; C1, C2, C3, C4 were Clerks; M1, M2, M3 were
managers and E1, E2 were Executive officers and if the relation R is defined by xRy, where x is
the salary given to person y, express the relation R through an ordered pair and an arrow
diagram.
Solution:
"x" be the salary given to person

"y" be the set of employees