Order, lattices, ordered algebraic structures Definition
Lawson topology
Builds on Partial orderScott topologyTopological spaceSubbasis
Definition
Let be a partially ordered set. For , write . The lower topology on is the topology with subbasis the sets for . The Lawson topology on is the smallest topology on that contains both the Scott topology and the lower topology. Equivalently, it is the topology generated by the union of these two topologies as a subbasis.
Remarks
Example: on with the usual order, the Scott open sets are , and the intervals with . The lower open sets are generated by the intervals . Finite intersections of these sets give all intervals , and , so the Lawson topology is the usual topology of .
Non-example: the Scott topology of is not its Lawson topology. The set is Lawson open, but it is not an upper set, so it is not Scott open.
The Lawson topology of a continuous lattice is compact and Hausdorff. Some authors define the Lawson topology only for directed-complete partial orders or for continuous posets, where it is best behaved.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Partial order concept
- Scott topology concept
- Subbasis concept
- Topological space concept
- Lawson topology definition
Further reading
About this page
| Tag | QW999ZFZVN |
|---|---|
| URI | m2://QW999ZFZVN |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06B35, 54F05 |
| Defines | Lawson topology |
| Uses | Partial order, Scott topology, Topological space, Subbasis |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.