The difference between a Partial Order Set and a Group

group-theoryorder-theoryrelations

According to my what I read everywhere…

A partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary relation indicating that, for certain pairs of elements in the set, one of the elements precedes the other in the ordering.

And,

A group is a set equipped with a binary operation that combines any two elements to form a third element in such a way that three conditions called group axioms are satisfied, namely associativity, identity and invertibility.

So in both cases there is a set with respect to a binary operation. Yet in posets we explore topics such as lattice and boolean algebra while in group theory there are semi-groups, monoids etc.

I just dont get the subtle difference between the two.

Best Answer

No, these are very different structures with very different requirements.

An operation is different than a relation. An operation is a function $A \times A \to A$ while a relation is simply a subset of $A \times A$. We can think of any relation also as a function $A \times A \to \{0, 1\}$. This way it becomes obvious that an operation is not the same as a relation.

To be more concrete for us to have a group noone requires from us to have ordering (even partial) between the elements of the group. While for a partially ordered set this ordering requirement is essential.