1. ## Hasse Diagram

Hello!

I've just learned about Hasse Diagrams.
Is this a correct Hasse Diagram for this problem, or am I missing something here?

Draw the Hasse Diagram for a Partially ordered set R over a set A, and find all the maximal and minimal elements.
A = { 1,2,3,4,5,6,7,8,9 }
R = { (a,b) from AxA | a<=b-3 or a=b }

So minimal elements would be 1,2,3 and maximal 9,8,7?

Thank you (:

2. ## Re: Hasse Diagram

Originally Posted by sapsapz
I've just learned about Hasse Diagrams.
Is this a correct Hasse Diagram for this problem, or am I missing something here?
Draw the Hasse Diagram for a Partially ordered set R over a set A, and find all the maximal and minimal elements.
A = { 1,2,3,4,5,6,7,8,9 }
R = { (a,b) from AxA | b is divisable by a }

So minimal elements would be 1,2,3 and maximal 9,8,7?
If $\displaystyle (a,b)\in\mathcal{R}$ means $\displaystyle a\text{ divides }b$, then no. There is very little correct about it.

There is only one minimal element in that set. $\displaystyle 1$ divides every integer.
You have three maximal elements correct there is another.

3. ## Re: Hasse Diagram

Originally Posted by Plato
If $\displaystyle (a,b)\in\mathcal{R}$ means $\displaystyle a\text{ divides }b$, then no. There is very little correct about it.

There is only one minimal element in that set. $\displaystyle 1$ divides every integer.
You have three maximal elements correct there is another.
Oh! I'm sorry! I wrote the wrong Relation for this problem! I corrected the post now.