In a poset PP, a bottom is a least element: an element \bot of PP such that a\bot \leq a for every element aa. Such a bottom may not exist; if it does, then it is unique.

In a proset, a bottom may be defined similarly, but it need not be unique. (However, it is still unique up the natural equivalence in the proset.)

A bottom of PP can also be understood as a join of zero elements in PP.

A poset that has both top and bottom is called bounded.

As a poset is a special kind of category, a bottom is simply an initial object in that category.

The bottom of the poset of subsets or subobjects of a given set or object AA is called the empty subset or subobject. In a category (such as Set) with a strict initial object \varnothing, this will always serve as the bottom of any subobject poset.

Last revised on July 18, 2014 at 10:46:09. See the history of this page for a list of all contributions to it.