2

How do you draw a hasse Diagram for the following example

Consider a relation $R$ defined on the set $A = \{-7,-6,-5,-4,-3,-2,-1,0,1,2,3,4,5,6,7\}$. Determine for the $R = \{(a, b) : a^3 = b^3\}$ if the relation is reflexive, symmetric, anti -symmetric, transitive, partial orders or an equivalence relation.

I have figured out whether it is reflexive, symmetric, anti -symmetric, transitive, partial orders or equivalence relations. But cant draw the hasse diagram.

jack
  • 113

1 Answers1

3

We have a partial order $R$, so a Hasse diagram is possible. As always, we have an upward edge between two vertices $i$ and $j$, with $i \neq j$, whenever $iRj$ and there is no $k$ such that $iRkRj$.

In this case, as noted in the comments, \begin{align*} R &= \{(a,b):a^3=b^3\} \\ &= \{(a,b):a=b\} \\ &= \{(a,a):a \in \{-7,\ldots,7\}\}. \\ \end{align*} So $R$ is the partial order $=$.

So, the edges are between $i,j \in \{-7,\ldots,7\}$, with $i \neq j$, such that $i=j$. This never happens, so there's no edges. So here is the Hasse diagram:

Hasse diagram