Continuous poset explained

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\inP

be two elements of a preordered set

(P,\lesssim)

. Then we say that

a

approximates

b

, or that

a

is way-below

b

, if the following two equivalent conditions are satisfied.

D\subseteqP

such that

b\lesssim\supD

, there is a

d\inD

such that

a\lesssimd

.

I\subseteqP

such that

b\lesssim\supI

,

a\inI

.If

a

approximates

b

, we write

a\llb

. The approximation relation

\ll

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,\lesssim)

satisfies the ascending chain condition.[1]

For any

a\inP

, let

\Uparrowa=\{b\inL\mida\llb\}

\Downarrowa=\{b\inL\midb\lla\}

Then

\Uparrowa

is an upper set, and

\Downarrowa

a lower set. If

P

is an upper-semilattice,

\Downarrowa

is a directed set (that is,

b,c\lla

implies

b\veec\lla

), and therefore an ideal.

(P,\lesssim)

is called a continuous preordered set if for any

a\inP

, the subset

\Downarrowa

is directed and

a=\sup\Downarrowa

.

Properties

The interpolation property

For any two elements

a,b\inP

of a continuous preordered set

(P,\lesssim)

,

a\llb

if and only if for any directed set

D\subseteqP

such that

b\lesssim\supD

, there is a

d\inD

such that

a\lld

. From this follows the interpolation property of the continuous preordered set

(P,\lesssim)

: for any

a,b\inP

such that

a\llb

there is a

c\inP

such that

a\llc\llb

.

Continuous dcpos

For any two elements

a,b\inP

of a continuous dcpo

(P,\le)

, the following two conditions are equivalent.

a\llb

and

a\neb

.

D\subseteqP

such that

b\le\supD

, there is a

d\inD

such that

a\lld

and

a\ned

.Using this it can be shown that the following stronger interpolation property is true for continuous dcpos. For any

a,b\inP

such that

a\llb

and

a\neb

, there is a

c\inP

such that

a\llc\llb

and

a\nec

.

(P,\le)

, the following conditions are equivalent.

P

is continuous.

\sup\colon\operatorname{Ideal}(P)\toP

from the partially ordered set of ideals of

P

to

P

has a left adjoint.In this case, the actual left adjoint is

{\Downarrow}\colonP\to\operatorname{Ideal}(P)

d\Downarrow\dashv\sup

Continuous complete lattices

For any two elements

a,b\inL

of a complete lattice

L

,

a\llb

if and only if for any subset

A\subseteqL

such that

b\le\supA

, there is a finite subset

F\subseteqA

such that

a\le\supF

.

Let

L

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

L

is continuous.

\sup\colon\operatorname{Ideal}(L)\toL

from the complete lattice of ideals of

L

to

L

preserves arbitrary infima.

lD

of directed sets of

L

,

styleinfD\inlD\supD=\supf\in\prodlDinfD\inlDf(D)

.

L

is isomorphic to the image of a Scott-continuous idempotent map

r\colon\{0,1\}\kappa\to\{0,1\}\kappa

on the direct power of arbitrarily many two-point lattices

\{0,1\}

.[2]

A continuous complete lattice is often called a continuous lattice.

Examples

Lattices of open sets

X

, the following conditions are equivalent.

\operatorname{Open}(X)

of open sets of

X

is a continuous complete Heyting algebra.

X

is a locally compact space (in the sense that every point has a compact local base)

X

is an exponentiable object in the category

\operatorname{Top}

of topological spaces. That is, the functor

(-) x X\colon\operatorname{Top}\to\operatorname{Top}

has a right adjoint.

Notes and References

  1. Book: Dana Scott. 2003. 10.1017/CBO9780511542725. Gerhard. Karl. Klaus. Jimmie. Michael. Dana S.. 978-0-521-80338-0. en. Gierz. Hofmann. Keimel. Lawson. Mislove. Scott. Cambridge. 1975381. Cambridge University Press. Encyclopedia of Mathematics and Its Applications. Continuous lattices and domains. 93. 1088.06001.
  2. Book: Grätzer, George. George Grätzer

    . 2011. 10.1007/978-3-0348-0018-1. 978-3-0348-0017-4. en. George Grätzer. 2011921250. Basel. 2768581. Springer. Lattice Theory: Foundation. 1233.06001.