−Table of Contents
Partially ordered groups
Abbreviation: PoGrp
Definition
A \emph{partially ordered group} is a structure G=⟨G,⋅,−1,1,≤⟩ such that
⟨G,⋅,−1,1⟩ is a group
⟨G,≤⟩ is a partially ordered set
⋅ is \emph{orderpreserving}: x≤y⟹wxz≤wyz
Morphisms
Let A and B be partially ordered groups. A morphism from A to B is a function h:A→B that is an orderpreserving homomorphism: h(x⋅y)=h(x)⋅h(y), x≤y⟹h(x)≤h(y)
Examples
Example 1: The integers, the rationals and the reals with the usual order.
Basic results
Any group is a partially ordered group with equality as partial order.
Any finite partially ordered group has only the equality relation as partial order.
Properties
Finite members
$\begin{array}{lr}
f(1)= &1\\ f(2)= &1\\ f(3)= &1\\ f(4)= &2\\ f(5)= &1\\
\end{array}\begin{array}{lr}
f(6)= &2\\ f(7)= &1\\ f(8)= &5\\ f(9)= &2\\ f(10)= &2\\
\end{array}$
Subclasses
Abelian partially ordered groups
Lattice-ordered groups expanded type
Superclasses
Partially ordered monoids reduced type