Structure

category of preordered sets

Notation PreOrd\PreOrd Objects preordered sets, i.e. sets equipped with a reflexive and transitive relation Morphisms order-preserving functions Related Pos\Pos, Cat\Cat, Bin\Bin, Binrefl\Bin_{\refl} External nLab link
Despite the many similarities with Pos\Pos, the main difference is that the forgetful functor PreOrd→Set\PreOrd \to \Set has a right adjoint, which maps XX to (X,X×X)(X, X \times X) (the chaotic preorder). It is a full subcategory of Bin\Bin. Preordered sets correspond to small thin categories.

Satisfied properties

Assigned properties

Deduced properties

Unsatisfied properties

Assigned properties

Deduced properties*

*This also uses the deduced satisfied properties.

Unknown properties

—

Special objects

  • terminal object: singleton preordered set
  • initial object: empty preordered set
  • products: direct products with the evident preorder
  • coproducts: disjoint union with the obvious preorder that leaves the distinct summands incomparable

Special morphisms

  • isomorphisms: bijective functions that are order-preserving and order-reflecting
  • monomorphisms: injective order-preserving functions
  • epimorphisms: surjective order-preserving functions
  • regular monomorphisms: embeddings
  • regular epimorphisms: