Scott topology
The Scott topology is a topology that can be defined on any complete partial order (cpo).
Thus, the Scott topology is important for domain theory and the semantics of recursion. However, because the resultant space is a
Definition
For \omega -cpos
Let
x \in O \land x \sqsubseteq y \Longrightarrow y \in O - If
(x_n)_{n \in \omega} is an increasing sequence inD with\sqcup_{n \in \omega} x_n \in O , then for somen ,x_n \in O .
For dcpos
Let
x \in O \land x \sqsubseteq y \Longrightarrow y \in O - If
D is a directed set and\sqcup D \in O , thenD \cap O \neq \emptyset .
More synthetically
The nLab gives a more synthetic definition.
Let
\Sigma \triangleq \{ \bot, \top \},
\quad
\bot \sqsubseteq \top
Let
\chi_O(x) \triangleq
\begin{cases}
\top & \text{ if $x \in O$} \\
\bot & \text{ if $x \not\in O$}
\end{cases}
We then define
Through closed sets
A topology can be equivalently described through its closed sets. We can then describe the Scott-topology through the Scott-closed sets.
From topology to order
We can recover the order from the topology, by defining
x \sqsubseteq y
\quad\triangleq\quad
\forall \text{open sets } O.\; x \in O \Longrightarrow y \in O
References
- The formulation for
\omega -cpo's is exercise 21 in the first chapter of
@techreport{plotkin_1983,
title = {Domains ({Pisa} {Notes})},
url = {https://homepages.inf.ed.ac.uk/gdp/publications/Domains_a4.ps},
author = {Plotkin, Gordon},
year = {1983},
}