Notes on the products of the lower topology and Lawson topology on posets (Q977461)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Notes on the products of the lower topology and Lawson topology on posets |
scientific article; zbMATH DE number 5724592
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Notes on the products of the lower topology and Lawson topology on posets |
scientific article; zbMATH DE number 5724592 |
Statements
Notes on the products of the lower topology and Lawson topology on posets (English)
0 references
22 June 2010
0 references
Recall the Scott topology and the Lawson topology. Let \(P\) be a poset. An upper set \(U=\uparrow U=\{ b\in P\mid a\leq b \text{ for some } a\in U\}\subseteq P\) is said to be Scott open iff for each directed set \(D\) in \(P\) the relation \(\sup D \in U\) implies \(D\cap U\not =\emptyset\). The collection of all Scott open subsets of \(P\) is called the Scott topology of \(P\) and it is denoted by \(\sigma(P)\). The space \((P,\sigma(P))\) is written as \(\Sigma (P)\). We call the topology generated by the complements \(P\setminus \uparrow x\) of principal filters (as subbasic open sets) the lower topology \(\omega(P)\). The space \((P,\omega(P))\) is written as \(\Omega (P)\). The common refinement \(\sigma(P)\vee\omega(P)\) of the Scott topology and the lower topology is called the Lawson topology and is denoted by \(\lambda (P)\). The space \((P,\lambda(P))\) is written as \(\Lambda (P)\). In this paper the authors consider the relation between the lower topology respectively the Lawson topology on a product of posets and their corresponding topological product. It is shown that if \(S\) and \(T\) are nonsingleton posets, then \(\Omega(S\times T)=\Omega(S)\times\Omega(T)\) iff both \(S\) and \(T\) are finitely generated upper sets. A poset \(P\) is said to be a directed complete partially ordered set, or dcpo for short, if every directed set \(D\subset P\) has a supremum. A poset in which every subset has a \(\sup\) and \(\inf\) is called complete lattice. If for all directed subsets \(D\subseteq P\) for which \(\sup D\) exists, the relation \(y\leq \sup D\) implies the existence of \(d\in D\) with \(x\leq d\) then we denote it as \(x\ll y\). A poset \(P\) is called continuous iff for all \(x\in P\) the set \(\{p\in P:p\ll x\}\) is directed and \(x=\sup \{p\in P:p\ll x\}\). A continuous dcpo which is a complete lattice is called a continuous lattice. The authors introduce a property \(\mathbf{K}\). A poset \(P\) is said to satisfy property \(\mathbf{K}\) if for any \(x\in P\) there exist a Scott open set \(U\in\sigma(P)\) and a finite \(F\subseteq P\) such that \(x\in U\subseteq \uparrow F\). They prove that if \(S\) and \(T\) are nontrivial posets with \(\sigma(S)\) or \(\sigma(T)\) being continuous, then \(\Lambda(S\times T)= \Lambda(S)\times\Lambda(T)\) iff \(S\) and \(T\) satisfy property \(\mathbf{K}\).
0 references
lower topology
0 references
Lawson topology
0 references
domain theory
0 references
Scott topology
0 references
0.8749507665634155
0 references
0.7814615964889526
0 references
0.7618330717086792
0 references