CatDat

category of preordered sets

  • Notation: PreOrd\PreOrd
  • Objects: preordered sets, i.e. sets equipped with a reflexive, transitive relation
  • Morphisms: order-preserving functions
  • Related categories: Pos\PosMono\Mono
  • nLab Link

Even though there are many similarities with Pos\Pos, the main difference is that the forgetful functor PreOrdSet\PreOrd \to \Set has a right adjoint, mapping XX to (X,X×X)(X , X \times X) (chaotic preorder).

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: