Editing Duality (order theory) (section)

{{Short description|Term in the mathematical area of order theory}}
{{Other uses|Order dual (disambiguation)}}
In the [[mathematics|mathematical]] area of [[order theory]], every [[partially ordered set]] ''P'' gives rise to a '''dual''' (or '''opposite''') partially ordered set which is often denoted by ''P''<sup>op</sup> or ''P''<sup>''d''</sup>. This dual order ''P''<sup>op</sup> is defined to be the same set, but with the '''inverse order''', i.e. ''x'' ≤ ''y'' holds in ''P''<sup>op</sup> [[if and only if]] ''y'' ≤ ''x'' holds in ''P''. It is easy to see that this construction, which can be depicted by flipping the [[Hasse diagram]] for ''P'' upside down, will indeed yield a partially ordered set. In a broader sense, two partially ordered sets are also said to be duals if they are '''dually isomorphic''', i.e. if one poset is [[order isomorphism|order isomorphic]] to the dual of the other.

The importance of this simple definition stems from the fact that every definition and theorem of order theory can readily be transferred to the dual order. Formally, this is captured by the '''Duality Principle''' for ordered sets:

: If a given statement is valid for all partially ordered sets, then its dual statement, obtained by inverting the direction of all order relations and by dualizing all order theoretic definitions involved, is also valid for all partially ordered sets.

If a statement or definition is equivalent to its dual then it is said to be '''self-dual'''. Note that the consideration of dual orders is so fundamental that it often occurs implicitly when writing ≥ for the dual order of ≤ without giving any prior definition of this "new" symbol.