Editing Completeness (order theory) (section)

==Completeness in terms of adjunctions==

Another interesting way to characterize completeness properties is provided through the concept of (monotone) [[Galois connection]]s, i.e. adjunctions between partial orders. In fact this approach offers additional insights both into the nature of many completeness properties and into the importance of Galois connections for order theory. The general observation on which this reformulation of completeness is based is that the construction of certain suprema or infima provides left or right adjoint parts of suitable Galois connections.

Consider a partially ordered set (''X'', ≤). As a first simple example, let 1 = {*} be a specified one-element set with the only possible partial ordering. There is an obvious mapping ''j'': ''X'' → 1 with ''j''(''x'') = * for all ''x'' in ''X''. ''X'' has a least element if and only if the [[function (mathematics)|function]] ''j'' has a lower adjoint ''j''<sup>*</sup>: 1 → ''X''. Indeed the definition for Galois connections yields that in this case ''j''<sup>*</sup>(*) ≤ ''x'' if and only if * ≤ ''j''(''x''), where the right hand side obviously holds for any ''x''. Dually, the existence of an upper adjoint for ''j'' is equivalent to ''X'' having a greatest element.

Another simple mapping is the function ''q'': ''X'' → ''X'' × ''X'' given by ''q''(''x'') = (''x'', ''x''). Naturally, the intended ordering relation for ''X'' × ''X'' is just the usual [[product order]]. ''q'' has a lower adjoint ''q''<sup>*</sup> if and only if all binary joins in ''X'' exist. Conversely, the join operation <math>\vee</math>: ''X'' × ''X'' → ''X'' can always provide the (necessarily unique) lower adjoint for ''q''. Dually, ''q'' allows for an upper adjoint if and only if ''X'' has all binary meets. Thus the meet operation <math>\wedge</math>, if it exists, always is an upper adjoint. If both <math>\vee</math> and <math>\wedge</math> exist and, in addition, <math>\wedge</math> is also a lower adjoint, then the poset ''X'' is a [[Heyting algebra]]—another important special class of partial orders.

Further completeness statements can be obtained by exploiting suitable [[completion (order theory)|completion]] procedures. For example, it is well known that the collection of all [[lower set]]s of a poset ''X'', ordered by [[subset|subset inclusion]], yields a complete lattice '''D'''(''X'') (the downset-lattice). Furthermore, there is an obvious embedding ''e'': ''X'' → '''D'''(''X'') that maps each element ''x'' of ''X'' to its [[ideal (order theory)|principal ideal]] {''y'' in ''X'' | ''y'' ≤ ''x''}. A little reflection now shows that ''e'' has a lower adjoint if and only if ''X'' is a complete lattice. In fact, this lower adjoint will map any lower set of ''X'' to its supremum in ''X''. Composing this lower adjoint with the function that maps any subset of ''X'' to its [[lower set|lower closure]] (again an adjunction for the inclusion of lower sets in the [[powerset]]), one obtains the usual supremum map from the powerset 2<sup>''X''</sup> to ''X''. As before, another important situation occurs whenever this supremum map is also an upper adjoint: in this case the complete lattice ''X'' is ''constructively completely distributive''. See also the articles on [[completely distributive lattice|complete distributivity]] and [[distributivity (order theory)]].

The considerations in this section suggest a reformulation of (parts of) order theory in terms of [[category theory]], where properties are usually expressed by referring to the relationships ([[morphism]]s, more specifically: adjunctions) between objects, instead of considering their internal structure. For more detailed considerations of this relationship see the article on the [[categorical formulation of order theory]].