02 Activity 1 – Discrete Structures 2
Determine the properties of the relation and whether the relation is an equivalence relation. Explain
why. Draw the digraph for the relation. Given:
1. The binary relation R = {(a, a), (a, b), (a, c), (b, b), (b, c), (c, c), (d, d)} is defined on the
set A = {a, b, c, d}
Reflexivity:
A relation R on a set A is reflexive if every element in A is related to itself (x, x) ∈ R for every x ∈ A.
The set A = {a, b, c, d}.
The relation R includes the pairs: (a, a), (b, b), (c, c), (d, d)
Since each element a, b, c, d is related to itself, the relation R is reflexive.
Symmetry:
A relation R on a set A is symmetric if whenever (x, y) ∈ R then (y, x) ∈ R as well.
In R, we have (a, b) but (b, a) is not in R.
We also have (a, c) but (c, a) is not in R.
The other pairs are (a, a), (b, b), (c, c), (d, d) and these pairs don’t violate symmetry as they are
self-relations.
Since R fails to include (b, a) when (a, b) is included (and similarly for c), the relation R is not symmetric.
Transitivity:
A relation R on a set A is transitive if whenever (x, y) ∈ R (y, z) ∈, then (x, z) ∈ R as well.
o (a, b) and (b, c) are in R, so for transitivity (a, c) should be in R. Indeed (a, c) ∈ R.
Check the pairs:
o No other pairs in R require further transitivity checks because any such combinations
either lead to already existing pairs or are self-relations.
Since there are no violations of transitivity, the relation R is transitive.
Overall: The relation of R is reflexive and transitive but not symmetric. Therefore, R is not equivalence
relation because it fails the symmetrical property.
Digraph of the relation R on set A
D B
C
2. Given the digraph, list the elements of the relation. Determine the properties of the relation and
state whether the relation is an equivalence relation.
Elements of the Relation:
a → a (self-loop)
b → b (self-loop)
c → c (self-loop)
d → d (self-loop)
a→d
d→a
b→c
c→b
a→b
Properties of the Relation:
Reflexive: A relation is reflexive if every element is related to itself. In this digraph, each vertex has a
self-loop (a, a), (b, b), (c, c), (d, d), so the relation is reflexive.
Symmetric: A relation is symmetric if whenever (x, y) is in the relation, (y, x) is also in the relation. In
this digraph:
(a, d) and (d, a) are present.
(b, c) and (c, b) are present.
(a, b) is present but (b, a) is not present.
Therefore, the relation is not symmetric.
Transitive: A relation is transitive if whenever (x, y) and (y, z) are in the relation, (x, z) is also in the
relation. For example:
(a, b) and (b, c) are in the relation, but (a, c) is not in the relation.
Therefore, the relation is not transitive.
Overall: Since the relation is reflexive but not symmetric or transitive, it is not an equivalence relation.
