Continuous poset

From HandWiki
Short description: Partially ordered set

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 a,b∈P be two elements of a preordered set (P,≲). Then we say that a approximates b, or that a is way-below b, if the following two equivalent conditions are satisfied.

  • For any directed set D⊆P such that b≲sup⁡D, there is a d∈D such that a≲d.
  • For any ideal I⊆P such that b≲sup⁡I, a∈I.

If a approximates b, we write a≪b. The approximation relation ≪ is a transitive relation that is weaker than the original order, also antisymmetric if P is a partially ordered set, but not necessarily a preorder. It is a preorder if and only if (P,≲) satisfies the ascending chain condition.[1]: p.52, Examples I-1.3, (4) 

For any a∈P, let

⇑a={b∈L∣a≪b}
⇓a={b∈L∣b≪a}

Then ⇑a is an upper set, and ⇓a a lower set. If P is an upper-semilattice, ⇓a is a directed set (that is, b,c≪a implies b∨c≪a), and therefore an ideal.

A preordered set (P,≲) is called a continuous preordered set if for any a∈P, the subset ⇓a is directed and a=sup⁡⇓a.

Properties

The interpolation property

For any two elements a,b∈P of a continuous preordered set (P,≲), a≪b if and only if for any directed set D⊆P such that b≲sup⁡D, there is a d∈D such that a≪d. From this follows the interpolation property of the continuous preordered set (P,≲): for any a,b∈P such that a≪b there is a c∈P such that a≪c≪b.

Continuous dcpos

For any two elements a,b∈P of a continuous dcpo (P,≤), the following two conditions are equivalent.[1]: p.61, Proposition I-1.19(i) 

  • a≪b and a≠b.
  • For any directed set D⊆P such that b≤sup⁡D, there is a d∈D such that a≪d and a≠d.

Using this it can be shown that the following stronger interpolation property is true for continuous dcpos. For any a,b∈P such that a≪b and a≠b, there is a c∈P such that a≪c≪b and a≠c.[1]: p.61, Proposition I-1.19(ii) 

For a dcpo (P,≤), the following conditions are equivalent.[1]: Theorem I-1.10 

In this case, the actual left adjoint is

⇓:P→Ideal⁡(P)
⇓⊣sup

Continuous complete lattices

For any two elements a,b∈L of a complete lattice L, a≪b if and only if for any subset A⊆L such that b≤sup⁡A, there is a finite subset F⊆A such that a≤sup⁡F.

Let L be a complete lattice. Then the following conditions are equivalent.

  • L is continuous.
  • The supremum map sup⁡:Ideal⁡(L)→L from the complete lattice of ideals of L to L preserves arbitrary infima.
  • For any family 𝒟 of directed sets of L, infD∈𝒟sup⁡D=supf∈∏𝒟infD∈𝒟f(D).
  • L is isomorphic to the image of a Scott-continuous idempotent map r:{0,1}κ→{0,1}κ on the direct power of arbitrarily many two-point lattices {0,1}.[2]: p.56, Theorem 44 

A continuous complete lattice is often called a continuous lattice.

Examples

Lattices of open sets

For a topological space X, the following conditions are equivalent.

References

  1. ↑ 1.0 1.1 1.2 1.3 1.4 Gierz, Gerhard; Hofmann, Karl; Keimel, Klaus; Lawson, Jimmie; Mislove, Michael; Scott, Dana S. (2003) (in en). Continuous lattices and domains. Encyclopedia of Mathematics and Its Applications. 93. Cambridge: Cambridge University Press. doi:10.1017/CBO9780511542725. ISBN 978-0-521-80338-0. 
  2. ↑ Grätzer, George (2011) (in en). Lattice Theory: Foundation. Basel: Springer. doi:10.1007/978-3-0348-0018-1. ISBN 978-3-0348-0017-4.