*** Welcome to piglix ***

Limit preserving function (order theory)


In the mathematical area of order theory, one often speaks about functions that preserve certain limits, i.e. certain suprema or infima. Roughly speaking, these functions map the supremum/infimum of a set to the supremum/infimum of the image of the set. Depending on the type of sets for which a function satisfies this property, it may preserve finite, directed, non-empty, or just arbitrary suprema or infima. Each of these requirements appears naturally and frequently in many areas of order theory and there are various important relationships among these concepts and other notions such as monotonicity. If the implication of limit preservation is inverted, such that the existence of limits in the range of a function implies the existence of limits in the domain, then one obtains functions that are limit-reflecting.

The purpose of this article is to clarify the definition of these basic concepts, which is necessary since the literature is not always consistent at this point, and to give general results and explanations on these issues.

In many specialized areas of order theory, one restricts to classes of partially ordered sets that are complete with respect to certain limit constructions. For example, in lattice theory, one is interested in orders where all finite non-empty sets have both a least upper bound and a greatest lower bound. In domain theory, on the other hand, one focuses on partially ordered sets in which every directed subset has a supremum. Complete lattices and orders with a least element (the "empty supremum") provide further examples.

In all these cases, limits play a central role for the theories, supported by their interpretations in practical applications of each discipline. One also is interested in specifying appropriate mappings between such orders. From an algebraic viewpoint, this means that one wants to find adequate notions of homomorphisms for the structures under consideration. This is achieved by considering those functions that are compatible with the constructions that are characteristic for the respective orders. For example, lattice homomorphisms are those functions that preserve non-empty finite suprema and infima, i.e. the image of a supremum/infimum of two elements is just the supremum/infimum of their images. In domain theory, one often deals with so-called Scott-continuous functions that preserve all directed suprema.


...
Wikipedia

...