−Table of Contents
Partially ordered monoids
Abbreviation: PoMon
Definition
A \emph{partially ordered monoid} is a structure A=⟨A,⋅,1,≤⟩ such that
⟨A,⋅,1⟩ is a monoid
⟨G,≤⟩ is a partially ordered set
⋅ is \emph{orderpreserving}: x≤y⟹wxz≤wyz
Morphisms
Let A and B be partially ordered monoids. A morphism from A to B is a function h:A→B that is an orderpreserving homomorphism: h(x⋅y)=h(x)⋅h(y), h(1)=1, x≤y⟹h(x)≤h(y)
Examples
Example 1:
Basic results
Every monoid with the discrete partial order is a po-monoid.
Properties
Finite members
$\begin{array}{lr}
f(1)= &1\\ f(2)= &4\\ f(3)= &37\\ f(4)= &549\\ f(5)= &\\
\end{array}$
Subclasses
Commutative partially ordered monoids
Lattice-ordered monoids expanded type
Superclasses
Partially ordered semigroups reduced type