Ordered semigroup

In mathematics, an ordered semigroup is a semigroup (S,•) together with a partial order ≤ that is compatible with the semigroup operation, meaning that x ≤ y implies z•x ≤ z•y and x•z ≤ y•z for all x, y, z in S.

An ordered monoid and an ordered group are, respectively, a group or a monoid that are endowed with a partial order that makes them ordered semigroups. The terms posemigroup, pogroup and pomonoid are sometimes used, where "po" is an abbreviation for "partially ordered".

The positive integers, the nonnegative integers and the integers form respectively a posemigroup, a pomonoid, and a pogroup under addition and the natural ordering.

Every semigroup can be considered as a posemigroup endowed with the trivial (discrete) partial order "=".

A morphism or homomorphism of posemigroups is a semigroup homomorphism that preserves the order (equivalently, that is monotonically increasing).

Category-theoretic interpretation

A pomonoid $(M, •, 1, \leq)$ can be considered as a monoidal category that is both skeletal and thin, with an object of for each element of $M$ , a unique morphism from $m$ to $n$ if and only if $m \leq n$ , the tensor product being given by $•$ , and the unit by $1$ .

gollark: I should really replace my 4-year-old 850 Evo with a 1TB disk.

gollark: You can buy decent SSDs for 8p/GB or so and they frequently charge 1.5x that...

gollark: Samsung SSDs are hilariously overpriced.

gollark: <@356209633313947648> Make sure to update the BIOS.

gollark: No.

References

T.S. Blyth, Lattices and Ordered Algebraic Structures, Springer, 2005, ISBN 1-85233-905-5, chap. 11.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.