In order theory, a continuous poset is a partially ordered set in which every element is the directed supremum of elements approximating it.
Definitions
Let be two elements of a preordered set . Then we say that approximates , or that is way-below , if the following two equivalent conditions are satisfied.
- For any directed set such that , there is a such that .
- For any ideal such that , .
If approximates , we write . The approximation relation is a transitive relation that is weaker than the original order, also antisymmetric if is a partially ordered set, but not necessarily a preorder. It is a preorder if and only if satisfies the ascending chain condition.[1]: p.52, Examples I-1.3, (4)
For any , let
Then is an upper set, and a lower set. If is an upper-semilattice, is a directed set (that is, implies ), and therefore an ideal.
A preordered set is called a continuous preordered set if for any , the subset is directed and .
Properties
The interpolation property
For any two elements of a continuous preordered set , if and only if for any directed set such that , there is a such that . From this follows the interpolation property of the continuous preordered set : for any such that there is a such that .
Continuous dcpos
For any two elements of a continuous dcpo , the following two conditions are equivalent.[1]: p.61, Proposition I-1.19(i)
- and .
- For any directed set such that , there is a such that and .
Using this it can be shown that the following stronger interpolation property is true for continuous dcpos. For any such that and , there is a such that and .[1]: p.61, Proposition I-1.19(ii)
For a dcpo , the following conditions are equivalent.[1]: Theorem I-1.10
- is continuous.
- The supremum map from the partially ordered set of ideals of to has a left adjoint.
In this case, the actual left adjoint is
Continuous complete lattices
For any two elements of a complete lattice , if and only if for any subset such that , there is a finite subset such that .
Let be a complete lattice. Then the following conditions are equivalent.
- is continuous.
- The supremum map from the complete lattice of ideals of to preserves arbitrary infima.
- For any family of directed sets of , .
- is isomorphic to the image of a Scott-continuous idempotent map on the direct power of arbitrarily many two-point lattices .[2]: p.56, Theorem 44
A continuous complete lattice is often called a continuous lattice.
Examples
Lattices of open sets
For a topological space , the following conditions are equivalent.
- The complete Heyting algebra of open sets of is a continuous complete Heyting algebra.
- The sobrification of is a locally compact space (in the sense that every point has a compact local base)
- is an exponentiable object in the category of topological spaces.[1]: p.196, Theorem II-4.12 That is, the functor has a right adjoint.
References
- 1 2 3 4 5 Gierz, Gerhard; Hofmann, Karl; Keimel, Klaus; Lawson, Jimmie; Mislove, Michael; Scott, Dana S. (2003). Continuous lattices and domains. Encyclopedia of Mathematics and Its Applications. Vol. 93. Cambridge: Cambridge University Press. doi:10.1017/CBO9780511542725. ISBN 978-0-521-80338-0. MR 1975381. Zbl 1088.06001.
- ↑ Grätzer, George (2011). Lattice Theory: Foundation. Basel: Springer. doi:10.1007/978-3-0348-0018-1. ISBN 978-3-0348-0017-4. LCCN 2011921250. MR 2768581. Zbl 1233.06001.
External links
- "Continuous lattice", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
- "Core-compact space", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
- Continuous poset at the nLab
- Continuous category at the nLab
- Exponential law for spaces at the nLab
- Continuous poset at PlanetMath.