In mathematics, especially order theory, a partially ordered set (or poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary relation that indicates that, for certain pairs of elements in the set, one of the elements precedes the other. Such a relation is called a partial order to reflect the fact that not every pair of elements need be related: for some pairs, it may be that neither element precedes the other in the poset. Thus, partial orders generalize the more familiar total orders, in which every pair is related. A finite poset can be visualized through its Hasse diagram, which depicts the ordering relation.
A familiar real-life example of a partially ordered set is a collection of people ordered by genealogical descendancy. Some pairs of people bear the descendant-ancestor relationship, but other pairs bear no such relationship.
Read more about Partially Ordered Set: Formal Definition, Examples, Extrema, Orders On The Cartesian Product of Partially Ordered Sets, Strict and Non-strict Partial Orders, Inverse and Order Dual, Number of Partial Orders, Linear Extension, In Category Theory, Partial Orders in Topological Spaces, Interval
Famous quotes containing the words partially, ordered and/or set:
“He who gives himself entirely to his fellow-men appears to them useless and selfish; but he who gives himself partially to them is pronounced a benefactor and philanthropist.”
—Henry David Thoreau (1817–1862)
“Your mind was wrought in cosmic solitude,
Through which careered an undulous pageantry
Of fiends and suns, darkness and boiling sea,
All held in ordered sway by beauty’s mood.”
—Allen Tate (1899–1979)
“I grew wild
Even accusing Heaven because
It had set down among its laws:
Nothing that we love over-much
Is ponderable to our touch.”
—William Butler Yeats (1865–1939)