Here a pointed complete partial order is a partially ordered set with a least element in which every nonempty directed set has a least upper bound. Directed means that every pair of its elements has an upper bound within that set. A Scott continuous map is monotone and preserves these directed suprema. It is not required to preserve the least element; restricting to strict maps would change the categorical claim. If completeness is instead formulated only for increasing countable chains, the same arguments below work with those chains.
Order the function space of complete partial orders pointwise: means for every . Its least element is the constant function with value . For a directed family of continuous maps, define . This is well-defined and is its pointwise least upper bound. It is monotone. For any directed ,
The interchange is valid because the combined family is directed, and either iterated supremum is its least upper bound. Thus is a Scott continuous map, proving that is a pointed complete partial order.
Finite products carry the product order, componentwise suprema and least element . The one-element order is a terminal object. For the exponential, use the function space with evaluation . To check joint continuity, take a directed family of pairs . Then
Indeed, directedness supplies a above the pairs indexed by both and , giving . Thus the diagonal values are cofinal in the double family, and evaluation preserves its supremum.
For a continuous , its currying is , . Each section is continuous because is; pointwise directed suprema in the coordinate show that is continuous. Conversely a continuous gives the continuous map . The two constructions are inverse, because they agree on every pair . This gives the natural bijection
with the required evaluation map. Together with the terminal object and products, it proves cartesian closure of pointed complete partial orders with non-strict continuous maps.

Articles by others on the same topic (0)

There are currently no matching articles.