Courses
Courses for Kids
Free study material
Offline Centres
More
Store Icon
Store
seo-qna
SearchIcon
banner

Let R and S be two transitive relations on set A, then prove that \[R\bigcup S\] is not a transitive relation on A.

Answer
VerifiedVerified
594k+ views
Hint:-For solving these questions, we would be requiring knowledge about symmetric, reflexive and transitive functions.

Complete step-by-step answer:
A relation is a relationship between sets of values. In math, the relation is between the x-values and y-values of ordered pairs. The set of all x-values is called the domain, and the set of all y-values is called the range.
The types of relations are as follows
Reflexive Relation
A relation is a reflexive relation if every element of set A maps to itself. i.e. for every a \[\in \] A, (a, a) \[\in \] R.
Symmetric Relation
A symmetric relation is a relation R on a set A if (a, b) \[\in \] R then (b, a) \[\in \] R, for all a and b \[\in \] A.
Transitive Relation
If (a, b) \[\in \] R, (b, c) \[\in \] R, then (a, c) \[\in \] R, for all a, b, c \[\in \] A and this relation in set A is transitive.
Equivalence Relation
If and only if a relation is reflexive, symmetric and transitive, it is called an equivalence relation.

As mentioned in the question, we have to prove that \[R\bigcup S\] is not a transitive relation on A.
Now, let A= {a, b, c}.
So, we can now let R as {(a, a), (a, b), (b, a), (b, b)} and let S as {(b, b), (b, c), (c, b), (c, c)} because we know that both of these relations are transitive.
Now, we can write \[R\bigcup S\] as {(a, a), (a, b), (b, a), (b, b), (b, c), (c, b), (c, c)}.
On observing, we can see that
(a, b) belongs to \[R\bigcup S\] , (b, c) belongs to \[R\bigcup S\] but (a, c) does not belong to \[R\bigcup S\] .
Hence, it is proved that \[R\bigcup S\] is not a transitive relation on A.

Note:-The students can make an error if they don’t know about the definitions and the meaning of different types of relations.
Also, it is important to know about the different types of set representations that are the rooster form or the set builder form as without knowing these one could never understand the question properly.