In order theory, a continuous poset is a partially ordered set in which every element is the directed supremum of elements approximating it.
Let a , b ∈ P {\displaystyle a,b\in P} be two elements of a preordered set ( P , ≲ ) {\displaystyle (P,\lesssim )} . Then we say that a {\displaystyle a} approximates b {\displaystyle b} , or that a {\displaystyle a} is way-below b {\displaystyle b} , if the following two equivalent conditions are satisfied.
If a {\displaystyle a} approximates b {\displaystyle b} , we write a ≪ b {\displaystyle a\ll b} . The approximation relation ≪ {\displaystyle \ll } is a transitive relation that is weaker than the original order, also antisymmetric if P {\displaystyle P} is a partially ordered set, but not necessarily a preorder. It is a preorder if and only if ( P , ≲ ) {\displaystyle (P,\lesssim )} satisfies the ascending chain condition.[1]: p.52, Examples I-1.3, (4)
For any a ∈ P {\displaystyle a\in P} , let
Then ⇑ a {\displaystyle \mathop {\Uparrow } a} is an upper set, and ⇓ a {\displaystyle \mathop {\Downarrow } a} a lower set. If P {\displaystyle P} is an upper-semilattice, ⇓ a {\displaystyle \mathop {\Downarrow } a} is a directed set (that is, b , c ≪ a {\displaystyle b,c\ll a} implies b ∨ c ≪ a {\displaystyle b\vee c\ll a} ), and therefore an ideal.
A preordered set ( P , ≲ ) {\displaystyle (P,\lesssim )} is called a continuous preordered set if for any a ∈ P {\displaystyle a\in P} , the subset ⇓ a {\displaystyle \mathop {\Downarrow } a} is directed and a = sup ⇓ a {\displaystyle a=\sup \mathop {\Downarrow } a} .
For any two elements a , b ∈ P {\displaystyle a,b\in P} of a continuous preordered set ( P , ≲ ) {\displaystyle (P,\lesssim )} , a ≪ b {\displaystyle a\ll b} if and only if for any directed set D ⊆ P {\displaystyle D\subseteq P} such that b ≲ sup D {\displaystyle b\lesssim \sup D} , there is a d ∈ D {\displaystyle d\in D} such that a ≪ d {\displaystyle a\ll d} . From this follows the interpolation property of the continuous preordered set ( P , ≲ ) {\displaystyle (P,\lesssim )} : for any a , b ∈ P {\displaystyle a,b\in P} such that a ≪ b {\displaystyle a\ll b} there is a c ∈ P {\displaystyle c\in P} such that a ≪ c ≪ b {\displaystyle a\ll c\ll b} .
For any two elements a , b ∈ P {\displaystyle a,b\in P} of a continuous dcpo ( P , ≤ ) {\displaystyle (P,\leq )} , the following two conditions are equivalent.[1]: p.61, Proposition I-1.19(i)
Using this it can be shown that the following stronger interpolation property is true for continuous dcpos. For any a , b ∈ P {\displaystyle a,b\in P} such that a ≪ b {\displaystyle a\ll b} and a ≠ b {\displaystyle a\neq b} , there is a c ∈ P {\displaystyle c\in P} such that a ≪ c ≪ b {\displaystyle a\ll c\ll b} and a ≠ c {\displaystyle a\neq c} .[1]: p.61, Proposition I-1.19(ii)
For a dcpo ( P , ≤ ) {\displaystyle (P,\leq )} , the following conditions are equivalent.[1]: Theorem I-1.10
In this case, the actual left adjoint is
For any two elements a , b ∈ L {\displaystyle a,b\in L} of a complete lattice L {\displaystyle L} , a ≪ b {\displaystyle a\ll b} if and only if for any subset A ⊆ L {\displaystyle A\subseteq L} such that b ≤ sup A {\displaystyle b\leq \sup A} , there is a finite subset F ⊆ A {\displaystyle F\subseteq A} such that a ≤ sup F {\displaystyle a\leq \sup F} .
Let L {\displaystyle L} be a complete lattice. Then the following conditions are equivalent.
A continuous complete lattice is often called a continuous lattice.
For a topological space X {\displaystyle X} , the following conditions are equivalent.