in Set Theory & Algebra edited by
312 views
1 vote
1 vote

Let $R$ be the relation on $M=\{1,2,3\}$ with the following diagraph representation:

Then

  1. $R$ is not reflexive, not symmetric, and not transitive
  2. $R$ is transitive but not reflexive
  3. $R$ is an equivalence relation
  4. $R$ is symmetric but not transitive
  5. $R$ is reflexive but not symmetric
in Set Theory & Algebra edited by
312 views

1 Answer

1 vote
1 vote

The relation $R$ is define using given digraph over the set $M=\left \{ 1,2,3 \right \}$ is:

$R=\left \{(1,1) (2,2) (1,2) (2,1) (3,1) (3,2) \right \}$

  • $R$ is not reflexive because $(3,3)$ is not present in $R$
  • $R$ is not symmetric relation because $(3,2)\in R$ but $(2,3)\notin R$
  • $R$ is transitive relation as $(3,1) (1,2) \in R\implies(3,2)\in R$. we can check other combinations also.
  • $R$ is not an equivalence relation (it should be reflexive, symmetric, and transitive) as it is not reflexive and symmetric.

Option (B) is correct.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true