Partially Ordered Set - in Category Theory

In Category Theory

Every poset (and every preorder) may be considered as a category in which every hom-set has at most one element. More explicitly, let hom(x, y) = {(x, y)} if xy (and otherwise the empty set) and (y, z)(x, y) = (x, z). Posets are equivalent to one another if and only if they are isomorphic. In a poset, the smallest element, if it exists, is an initial object, and the largest element, if it exists, is a terminal object. Also, every preordered set is equivalent to a poset. Finally, every subcategory of a poset is isomorphism-closed.

A functor from a poset category (a diagram indexed by a poset category) is a commutative diagram.

Read more about this topic:  Partially Ordered Set

Famous quotes containing the words category and/or theory:

    The truth is, no matter how trying they become, babies two and under don’t have the ability to make moral choices, so they can’t be “bad.” That category only exists in the adult mind.
    Anne Cassidy (20th century)

    Many people have an oversimplified picture of bonding that could be called the “epoxy” theory of relationships...if you don’t get properly “glued” to your babies at exactly the right time, which only occurs very soon after birth, then you will have missed your chance.
    Pamela Patrick Novotny (20th century)