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:

    I see no reason for calling my work poetry except that there is no other category in which to put it.
    Marianne Moore (1887–1972)

    [Anarchism] is the philosophy of the sovereignty of the individual. It is the theory of social harmony. It is the great, surging, living truth that is reconstructing the world, and that will usher in the Dawn.
    Emma Goldman (1869–1940)