Next Article in Journal / Special Issue
Baryonic Matter, Ising Anyons and Strong Quantum Gravity
Previous Article in Journal
Existence and Mass Gap in Quantum Yang–Mills Theory
Previous Article in Special Issue
Counting Polynomials in Chemistry II
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Johnstone’e Non-Sober Dcpo and Extensions

Department of Mathematics and Mathematics Education, National Institute of Education Singapore, Nanyang Technological University, 1 Nanyang Walk, Singapore 637616, Singapore
Int. J. Topol. 2025, 2(1), 3; https://doi.org/10.3390/ijt2010003
Submission received: 21 November 2024 / Revised: 7 February 2025 / Accepted: 19 February 2025 / Published: 3 March 2025
(This article belongs to the Special Issue Feature Papers in Topology and Its Applications)

Abstract

:
One classic result in domain theory is that the Scott space of every domain (continuous directed complete poset) is sober. Johnstone constructed the first directed complete poset (dcpo for short) whose Scott space is not sober. This non-sober dcpo has been used in many other parts of domain theory and more properties of it have been uncovered. In this survey paper, we first collect and prove the major properties (some of which are new as far as we know) of Johnstone’s dcpo. We then propose a general method of constructing a dcpo from given posets and prove some properties. Some problems are posed for further investigation. This paper can serve as a relatively complete resource on Johnstone’s dcpo.

1. Introduction

Sobriety is one of the most important properties for non-Hausdorff topological spaces. It is a classic result in domain theory that the Scott space of every domain (continuous directed complete posets) is sober. Johnstone [1] constructed the first dcpo whose Scott space is not sober (this dcpo will be called Johnstone’s dcpo). This elegant example inspired many in-depth work on the properties of Scott spaces of posets. For example, Isbell [2] constructed the first complete lattice whose Scott space is not sober. Kou [3] gave the first dcpo whose Scott space is well filtered but not sober (see [4] for another more straightforwardly defined example of such a dcpo), thus answering the problem posed by Heckmann in [5]. Jia [6] found the first countable dcpo with a well-filtered and non-sober Scott space. In [7], Xu, Xi and Zhao constructed a complete Heyting algebra whose Scott space is not sober, thus answering the problem posed by Achim Jung. Applying Johnstone’s dcpo, Ho, Goubault-Larrecq, Jung and Xi [8] constructed a dcpo P whose Scott space is not sober and the sobrification of the Scott space of P is the Scott space of a dcpo Q, showing that there are two non-isomorphic dcpos such that their Scott closed set lattices are isomorphic. In [9], Miao, Li, Xi and Zhao constructed a countable complete lattice with a non-sober Scott space. Recently, Miao, Xi, Jia, Li and Zhao found two sober dcpos such that their order product is not sober [10]. In [11], Xi and Lawson proved that the Scott space of every complete lattice is well filtered; thus, the non-sober complete lattice constructed by Isbell was actually the first example of a well-filtered and non-sober dcpo.
In the current paper, we will collect the major properties of Johnstone’s dcpo, then suggest a general method of constructing a dcpo from the given posets. Some open problems related to Johnstone’s dcpo will be posed for further study.

2. Preliminaries

We quickly recall some basic concepts and results in domain theory that will be used later.
For any subset A of poset P, A ( A , resp.) will denote the supremum (infimum, resp.) of A in P.
A nonempty subset D of a poset is directed if every two elements in D have an upper bound in D (for any x , y D , there is a d D such that x d and y d ).
A subset U of a poset ( P , ) is Scott open if (i) U is an upper set ( U = U = { x P : y x   for   some   y U } ), and (ii) for any directed subset D P , D U implies D U whenever D exists. All Scott open sets of a poset P form a topology on P, denoted by σ ( P ) and called the Scott topology on P. The space ( P , σ ( P ) ) is denoted by Σ P , called the Scott space of P. The complements of Scott open sets are called Scott closed sets.
Remark 1.
(1) For any element x of poset P, the closure c l ( { x } ) of { x } with respect to the Scott topology equals
x = { y P : y x } .
(2) 
A mapping f : P Q between two posets is continuous with respect to the Scott topologies on P and Q, respectively, if and only if for any directed subset D P with D existing, it holds that f ( D ) = f ( D ) . Such a mapping f is said to be Scott continuous.
(3) 
A subset F P is Scott closed if it is a lower set ( F = F = { x P : x y   f o r   s o m e   y F } ) and for any directed set D F , it holds that D F whenever D exists.
A poset is called a directed complete poset (dcpo for short) if every directed subset of the poset has a supremum. For more about Scott topology and dcpos, we refer the reader to [12,13].
For two elements x and y in poset P, x is way below y, written as x y , if, for any directed set D P with D existing and D y , there is some d D such that x d .
An element x P is called compact if x x . The set of all compact elements of P is denoted by K ( P ) .
A poset L is called continuous if, for each x L , { z L : z x } is directed and x = { z L : z x } .
A continuous dcpo is often called a domain.
A poset L is algebraic if, for each x L , { z L : z x , z K ( L ) } is directed and x = { z L : z x , z K ( L ) } .
A nonempty subset F of topological space X is irreducible if, for any closed subsets F 1 , F 2 of X, F F 1 F 2 implies F F 1 or F F 2 .
Clearly, every singleton set is irreducible. Also, the closure of every singleton set is irreducible (see the remark after Definition O-5.5 in [12]). A space X is called sober if every irreducible closed set F of X is the closure of a unique singleton set: there is a unique x X , such that F = c l ( { x } ) .
A subset A of a topological space is called saturated if A equals the intersection of all open sets containing it. A T 0 space X is well filtered if, for any open set U and filtered family F of saturated compact subsets of X, F U implies F U for some F F . Every sober space is well filtered (Theorem II-1.21 of [12]).
The specialization order  τ on a T 0 space ( X , τ ) is defined by x τ y if x c l ( { y } ) (for x , y X ).
A T 0 space X is called bounded -sober if every upper bounded (with respect to the specialization order) irreducible closed set equals the closure of a singleton set [14]. Clearly, every sober space is bounded sober. The converse conclusion is not true.

3. Johnstone’s Dcpo

One of the classic results in domain theory is that the Scott space of every domain is sober (Corollary II-1.13 [12]). However, it is not trivial whether the Scott space of every dcpo is sober. Peter Johnstone constructed the first example of a dcpo whose Scott space is not sober.
Example 1
([1]). Let N be the set of all positive integers with the ordinary order ≤ of numbers. Let J = N × ( N { } ) . Extend the order on N to N { } by letting n < for all n N .
Define the order ≤ on J by ( m , n ) ( m , n ) i f either
(i) m = m   a n d   n n ;
(ii) Or n = and n m .
All the major properties of J will be numbered as ( J k ) with k a number. Among the nine properties listed below, (J5), (J7), (J8) and (J9) are new (as far as we know).
The properties (J1) and (J2) below are from [1].
(J1) A subset D J is directed if either it has a largest element, or there is an m such that D = { ( m , d i ) : i I } ( m , ) .
In the latter case, D = ( m , { d i : i I } ) . Here, either { d i : i I } = or { d i : i I } = n for some n N .
Thus, in both cases, D exists, showing that J is a dcpo.
(J2) A nonempty Scott closed set F of J is irreducible if and only if either F = ( m , n ) for some ( m , n ) J or F = J .
Clearly, J ( m , n ) = c l ( { ( m , n ) } ) for any ( m , n ) J ; thus, the Scott space ( J , σ ( J ) ) is not sober.
However, as J does not have the top element, we see that Σ J is bounded sober. Hence, J is a dcpo whose Scott space is bounded sober but not sober.
(J3) Σ J is not well filtered.
To see this, for each n N , let A n = { ( k , ) : k n } and U = . Then, one can verify that each A n is a compact saturated set, { A n : n N } is a filtered family and { A n : n N } = = U . Since not one of the A n is contained in = U , we see that Σ J is not well filtered.
In the following, we shall show some less trivial properties of J . Some of them have been mentioned or proved elsewhere. However, for the reader’s convenience, we shall provide a brief explanation of them.
An element a of poset P is a maximal element (or maximal point) if, for any y P , a y implies a = y . The set of all maximal points of P is denoted by Max(P). In the following, the set Max(P) with the relative Scott topology on P will be called the maximal point space of P. By Zorn’s Lemma, one deduces that for any dcpo P, P = Max ( P ) ; that is, every element of P is below some maximal point(s).
The following result has been known for quite some time; however, we could not find a resource where a complete proof was provided. Here, we give a brief explanation. See the more general Proposition 3 in Section 4.
Proposition 1.
The space Max( J ) is homeomorphic to ( N , τ c o f ) , where τ c o f is the co-finite topology on N ( U τ c o f if either U = or N U is a finite set).
To see this, first note that Max( J ) = { ( m , ) : m N } .
Let F J be a nonempty Scott closed set. If F Max ( J ) is an infinite set, then one can deduce that F = J .
Now, for any finite subset G Max ( J ) , G is a Scott closed set of J and G = ( G Max ( J ) ) .
It follows that a subset of Max( J ) is closed (with respect to the relative Scott topology) if and only if it is either a finite set or the whole set of Max( J ). That is, the relative Scott topology on Max( J ) is the co-finite topology.
Clearly, there is a bijection between N and Max( J ); thus, the space Max( J ) is homeomorphic to ( N , τ c o f ) .
A poset model of a T 1 space X is a poset P such that X is homeomorphic to Max(P). For any P, Max(P) is T 1 [15]. By the above proposition, we have the following.
(J4) The dcpo J is a poset model of ( N , τ c o f ) .
Proposition 2.
For any continuous function f : M a x ( J ) M a x ( J ) , there is a continuous function F : Σ P Σ P such that F M a x ( J ) = f .
Proof. 
Let p : J N be a function defined by p ( m , n ) = m .
Let f : Max ( J ) Max ( J ) be a continuous function. For each n N , define
α ( n ) = i n f { p ( f ( k , ) ) : n k } .
Then, α : N N is a function and monotone: n 1 n 2 implies α ( n 1 ) α ( n 2 ) .
(1) If α is a bounded function (there is an l such that α ( n ) l for all n), then f is a constant function.
In fact, assume that α ( n ) l holds for all n. Then, for any n N , there exists n n such that f ( n , ) B = { ( m , ) : m l } , which is a closed set in Max ( J ) . Thus, f 1 ( B ) is an infinite and closed set; hence, f 1 ( B ) = Max ( J ) since the topology on Max ( J ) is the co-finite topology. But then Max ( J ) = f 1 ( B ) = m l f 1 ( { ( m , ) } ) . Note that each f 1 ( { ( m , ) } ) is a closed subset of Max ( J ) . Observe that Max ( J ) can not be expressed as the union of two proper closed subsets (a proper closed subset must be finite); it follows that Max ( J ) = f 1 ( { ( m , ) } ) for some m, showing that f is a constant function.
(2) Assume that f is a constant function and f ( m , ) = ( m 0 , ) for all m. Define F : J J by F ( m , n ) = ( m 0 , n ) . Then, it is easy to see that F is Scott continuous and an extension of f.
(3) Now assume that f is not a constant function. By (1), the function α is not bounded.
Define F : J J by
F ( m , n ) = f ( m , n ) , n = , ( p ( f ( m , ) ) , α ( n ) ) , n .
Clearly, F is an extension of f. It remains to show that F is Scott continuous. By its definition, one can easily verify that F is monotone.
By Remark 1(2), We need to verify that for any directed set D J , F ( D ) = F ( D ) .
If D has the largest element, say x 0 , then F ( D ) = F ( x 0 ) = F ( D ) because F is monotone.
Now assume that D does not have the largest element, then D = { ( a , n k ) : k = 1 , 2 , . . . } for some fixed a N and we can assume that
n 1 < n 2 < .
Now, F ( D ) = F ( a , ) = f ( a , ) = ( b , ) for some b N . For any l N , as α is not bounded, there is n such that α ( n ) l . Take one n k such that n n k . Then,
l α ( n ) α ( n k ) .
Hence, ( b , l ) ( b , α ( n k ) ) = ( p ( f ( a , ) ) , α ( n k ) ) = F ( a , n k ) F ( D ) . Therefore, F ( D ) = ( b , ) = { ( b , l ) : l N } F ( D ) . Since F is monotone, we have F ( D ) F ( D ) . At last, we have
F ( D ) = F ( D ) .
The proof is completed.
Definition 1.
A poset P is called continuously extendable if, for any continuous mapping f : M a x ( P ) M a x ( P ) , there is a continuous mapping of F : Σ P Σ P , which is an extension of f: for any x M a x ( P ) , F ( x ) = f ( x ) .
Remark 2.
(1) If a poset P has the top element T P , then Max(P) = { T P } . Then, every function f : M a x ( P ) M a x ( P ) has the continuous extension f ^ : P P , which is the constant function f ^ ( x ) = T P for all x P . Thus, P is continuously extendable. In particular, every complete lattice is continuously extendable.
(2) 
By Theorem 5.7 of [16], for dcpo P = I R of all closed intervals of real numbers with the reverse inclusion order, one can only prove that if the continuous function f : M a x ( I R ) M a x ( I R ) satisfies some extra conditions, then it has the continuous extension f ^ : I R I R .
By Proposition 2, we have the following.
(J5) J is continuously extendable.
By a classic result (Theorem II-1.14 of [12]), a dcpo P is continuous if and only if the lattice ( σ ( P ) , ) of all Scott open sets of P with the set inclusion order is a completely distributive lattice (this is equivalent to that the lattice of all Scott closed sets with the set inclusion order is completely distributive) [12]. In addition, the Scott space of every continuous dcpo is sober [12]. Using these facts, one can deduce the following property of continuous dcpo P, where C σ ( P ) denotes the lattice of all Scott closed sets of P:
For   any   dcpo   Q ,   C σ ( P ) C σ ( Q )   implies   P Q ,
here, ≅ is the isomorphism relation between posets.
A dcpo P satisfying the property (1) is called C σ -determined.
For two subsets F and G of a dcpo P, F is way below G, written F G , if, for any directed subset D, D G implies D F .
A dcpo P is called quasicontinuous if, for each x P , the set family
{ F P : F { x }   and   F   is   finite } is filtered (for any finite F 1 { x } , F 2 { x } , there is finite F { x } such that F F 1 F 2 ) and
x = { F : F { x } and   F   is   finite } .
Every continuous dcpo is quasicontinuous (Proposition III-3.10 of [12]).
A dcpo P is locally quasicontinuous (continuous, resp.) if each subposet x ( x P ) is quasicontinuous (continuous, resp.) By [17], the dcpo J is locally quasicontinuous.
Remark 3.
(1) Note that J is not locally continuous. For instance, the subposet ( 1 , ) is not continuous.
(2) 
The product of any finite number of quasicontinuous dcpos is quasicontinuous [12]. Hence, for any positive integer n, the Cartesian product J n is locally quasicontinuous.
The following result was proved in [18].
Theorem 1.
Every locally quasicontinuous dcpo is C σ -determined.
By the above result and Remark 3 (2), one deduces the following result proved in [18] and [17] using different methods.
(J6) For any n N , the dcpo J n is C σ -determined.
Given a dcpo P and a Scott closed subset G of P, the set ( G Max ( P ) ) need not be a Scott closed set, although it is a lower set.
Example 2.
Let P = N { a i : i N } { T , b } . The partial order ≤ on P is generated by
a i < i ,   a i < a i + 1 < b < T ,   f o r   e a c h   i N .
Then, ( P , ) is a dcpo, where Max(P) = N { T } . The set G = P { T } is a Scott closed set, ( G M a x ( P ) ) = P { T , b } , which is not Scott closed because D = { a i : i N } is a directed subset of P { T , b } and D = b P { T , b } .
However, for the dcpo J , this is true for all Scott closed sets G of J .
As a matter of fact, let G J be a Scott closed set and G Max ( J ) . Assume that G Max ( J ) = { ( n i , ) : i N } . Then,
( G Max ( J ) ) = { ( n i , ) : i N } G .
Let D ( G Max ( J ) ) be directed. Then, by Remark 1, either D has the largest element or D = { ( n i 0 , m k ) : k N } for some i 0 . If D has the largest element, then D D ( G Max ( J ) ) . Otherwise, D = ( n i 0 , t ) ( n i 0 , ) ( G Max ( J ) ) . Since ( G J ) is already a lower set, it is a Scott closed subset of J .
Hence, we have the following property of J .
(J7) For any Scott closed subset G of J , ( G Max ( J ) ) is a Scott closed subset of J .
A T 0 space X is called a T D space if, for any x X , c l ( { x } ) { x } is closed. A T 0 space X is called a B -space if there is T D space Y such that C ( X ) C ( Y )  [19]. This is equivalent to that there is T D space Y such that the sobrification of X is homeomorphic to the sobrification of Y.
A closed set A of space X is called completely irreducible if for any collection { F i : i I } of closed sets F i , A = c l ( i I ) F i implies A = F i for some i I .
Theorem 2
([19]). A T 0 space X is a B -space if and only if every closed set is the supremum of some completely irreducible closed sets: for any closed F X , there are completely irreducible closed sets F i ( i I ) such that
F = { F i : i I } = c l ( { F i : i I } ) .
If a closed set F Σ P , where P is a poset, is completely irreducible, then, as F = { x : x F } , we have F = x for some x F .
(J8) The space Σ J is a B -space.
For the proof, it is enough to observe that every ( m , n ) ( n ) is a completely irreducible closed set and every closed set is a supremum of such closed sets.
By Cramer [20], a topological space X is called T m , where m is a cardinal, if for any x X , c l ( { x } ) { x } is the union of at most m closed sets. Thus, T 1 spaces are exactly T D spaces. It is easy to verify the following.
(J9) The space Σ J is a T 0 space.

4. Extensions and Problems

In this section, we shall use Johnstone’s method to construct new dcpos and investigate their properties. Some open problems for further study will be listed.
Let Q be a poset, P a dcpo and ϕ : Q ( P Max ( P ) ) a monotone mapping. We define the partial order ϕ on Q × P by ( q 1 , p 1 ) ϕ ( q 2 , p 2 ) if
(i) either q 1 = q 2 and p 1 p 2 ;
(ii) or p 2 Max ( P ) and p 1 ϕ ( q 2 ) .
It is easy to see that ϕ is a partial order. We shall use Q × P ϕ to denote the poset ( Q × P , ϕ ) .
Remark 4.
(1) As in the case of J , a subset D Q × P is directed if either there is a q Q such that D = { ( q , p i ) : i I } with { p i : i I } , a directed subset of P, or D has the largest element (if there are ( q 1 , p 1 ) , ( q 2 , p 2 ) D with q 1 q 2 ). If D has the largest element, it would be the supremum of D. If D = { ( q , p i ) : i I } with { p i : i I } , a directed subset of P, then D = ( q , { p i : i I } ) . Hence, Q × P ϕ is a dcpo.
(2) Max( Q × P ϕ ) = Q × M a x ( P ) .
Example 3.
The subsequent examples serve to illustrate this concept.
(1) 
Let Q = ( N , ) be the poset of all positive integers with the ordinary order of numbers and P = ( N { } , ) be the extension of Q with the top element ∞ added. Then, Q × P i d = J , where i d : Q P is the embedding mapping: i d ( m ) = m for all m Q .
(2) 
Let Q = [ 0 , 1 ) = { x R : 0 x < 1 } and P = [ 0 , 1 ] = { x R : 0 x 1 } be the given sets of real numbers with the ordinary order of numbers. Let i d : Q P be the embedding mapping. Then, the poset Q × P i d has [ 0 , 1 ) × [ 0 , 1 ] as underlying set and ( x , y ) ( x , y ) holds if and only if either x = x and y y or y = 1 and y x .
(3) 
In general, let P be a dcpo, Q = P M a x ( P ) and i d : Q P be the identity mapping: x x ( x Q ) . Then, we have a natural dcpo, which will be denoted by J ( P ) . In particular, if N T is the complete chain N { } with ∞ as the top element, then J = J ( N T ) .
(4) 
Let P = N T be the dcpo defined in (3) and Q = [ 0 , + ) with the usual order of numbers. Define ϕ : Q P by ϕ ( x ) = [ x ] , the integer part of x for each x Q . Then, Q × P ϕ = { ( x , n ) : x [ 0 , + ) , n N T } and ( x , n ) ϕ ( y , m ) if and only if either x = y and n m or n [ y ] and m = .
Proposition 3.
Let P be a chain that is a dcpo and has the top element T P .
(1) 
A Scott closed subset F J ( P ) is irreducible if and only if either F = ( x , y ) for some ( x , y ) J ( P ) or F = J ( P ) . Thus, the Scott space of J ( P ) is not sober.
(2) 
For any Scott closed set G of J ( P ) , ( G M a x ( J ( P ) ) ) is a Scott closed subset of J ( P ) .
(3) 
Max( J ( P ) ) is homeomorphic to ( P { T P } , τ c o b ) , where U τ c o b if and only if either U = or P ( U { T P } ) has an upper bound in P { T P } .
(4) 
J ( P ) is C σ -determined.
Proof. 
The proofs of (1), (2) and (4) are similar to that of J , we skip the details.
We now prove (3). By the definition of τ c o b , H P { T P } is closed in ( P , τ c o b ) if and only if either H = P { T P } , or H has an upper bound in P { T P } .
Note that Max( J ( P ) ) = { ( p , T P ) : p P { T P } } .
Let ϕ : Max ( J(P) ) ( P { T P } ) be the mapping defined by ϕ ( p , T P ) = p . Then, clearly, ϕ is a bijection.
(1) Let F Max ( J ( P ) ) be a closed set in Max ( J ( P ) ) . Then, there is a Scott closed set F ^ of J ( P ) , such that F = F ^ Max ( J ( P ) ) .
If ϕ ( F ) is not upper bounded in P { T P } , then as in the proof of the Proposition 1, one deduces that F ^ = J ( P ) ; thus, ϕ ( F ) = ϕ ( J ( P ) Max ( J ( P ) ) ) = ϕ ( J ( P ) ) = P { T P } . Otherwise, ϕ ( F ) has an upper bound in P { T P } . Thus, ϕ sends each closed set of Max ( J ( P ) ) to a closed set in ( P { T P } , τ c o b ) . Therefore, ϕ is a closed mapping.
(2) Now assume that H P { T P } is a closed set in ( P { T P } , τ c o b ) . If H = P { T P } , then ϕ 1 ( H ) = Max ( J ( P ) ) , which is closed in Max ( J ( P ) . If H P { T P } , then H has an upper bound, say w in P { T P } . Hence, w < T P holds in P.
Let
H ̲ = { ( x , p ) J ( P ) : x H   and   p w } { ( h , p ) J ( P ) : h H   and   p P } .
(i) H ̲ is a lower set in J ( P )
In fact, assume that ( z , u ) ( x , p ) for some ( x , p ) H ̲ . If x H , then p w < T P . Hence, ( z , u ) ( x , p ) implies z = x , u p w . So, ( z , u ) H ̲ . Let x H . If z = x , then ( z , u ) = ( x , u ) H ̲ . If z x , by ( z , u ) ( x , p ) , we have p = T p and u x w , again implying ( z , u ) H ̲ . Hence, H ̲ is a lower set.
(ii) Assume that D H ̲ is a directed subset.
If D has the largest element d 0 , then D = d 0 D H ̲ , implying D H ̲ . If D does not have the largest element, by Remark 4(1), there is x P { T P } and directed set { d i : i I } P such that D = { ( x , d i ) : i I } .
If x H , then D = ( x , { d i : i I } ) H ̲ . If x H , then d i w for all i I , so { d i : i I } w holds in P. Thus, D = ( x , { d i : i I } ) H ̲ .
Therefore, H ̲ is a Scott closed set of J ( P ) .
Since w T P , we see that H ̲ Max ( J ( P ) ) = { ( h , T P ) : h H } is a closed set of Max ( J ( P ) ) ) . In addition, ϕ 1 ( H ) = H ̲ Max ( J ( P ) ) . Hence, ϕ : Max ( J ( P ) ) P { T P } is continuous.
The combination of (1) and (2) proves that ϕ is a homeomorphism.
The proof is completed. □
Example 4.
Let W 1 be the set of all countable ordinals plus the smallest non-countable ordinal ω 1 . Then, W 1 is a chain with ω 1 as the top element. A subset A W 1 { ω 1 } has an upper bound in W 1 { ω 1 } if and only if it is a countable set. Hence, by Proposition 3, M a x ( J ( W 1 ) ) is homeomorphic to ( W 1 { ω 1 } , τ c c ) , where τ c c is the co-countable topology: U τ c c if and only if either U = or U c is countable. Thus, we deduce the result in [4] as a special case. It was proved in [4] that J ( W 1 ) is well filtered.
Example 5.
Let P = [ 0 , 1 ] be the set of all real numbers in the unit interval. Then, 1 is the top element in chain P and P { 1 } = [ 0 , 1 ) . By Proposition 3, Max( J ( [ 0 , 1 ] ) is homeomorphic to ( [ 0 , 1 ) , τ ) , where F [ 0 , 1 ) is a closed set if and only if either F = [ 0 , 1 ) or F [ 0 , b ] for some 0 b < 1 . One can check that the Scott space Σ J ( [ 0 , 1 ] ) is not well filtered.
Example 6.
Let N T = N { } be chain N with the top element ∞ added. Max( N T ) is homeomorphic to ( N , τ ) , where U τ if and only if either U = or N U is upper bounded, which is equivalent to the notion that N U is a finite set. Hence, τ = τ c o f . Thus, we re-deduce (J4) as a special case.
The following are some problems related to dcpo J .
Problem 1. Is the countable self-product J N of J characterized as a C σ -determined dcpo?
Problem 2. Does every T 1 space have a continuously extendable dcpo model?
Note that it was proved in [15] that every T 1 space has a dcpo model.
Problem 3. In which context does dcpo P exhibit the property that its justification J ( P ) is well filtered?
Note that J is not well filtered and J ( W 1 ) is well filtered.

Funding

This research receives no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Johnstone, P. Scott is not always sober. In Continuous Lattices; Lecture Notes in Math; Springer: Berlin/Heidelberg, Germany, 1981; Volume 871, pp. 282–283. [Google Scholar]
  2. Isbell, J. Completion of a construction of Johnstone. Proc. Am. Math. Soci. 1982, 85, 333–334. [Google Scholar] [CrossRef]
  3. Kou, H. Uk-admitting dcpos need not be sober. In Domains and Processes, Semantic Structure on Domain Theory; Kluwer: Alphen aan den Rijn, The Netherlands, 2001; Volume 1, pp. 41–50. [Google Scholar]
  4. Zhao, D.; Xi, X.; Chen, Y. A new dcpo whose Scott topology is well-filtered but not sober. Topol. Appl. 2019, 252, 97–102. [Google Scholar]
  5. Heckmann, R. An upper power domain construction in terms of strongly compact sets. In Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 1992; Volume 598, pp. 272–293. [Google Scholar]
  6. Jia, X. Meet-Continuity and Locally Compact Sober Dcpos. Ph.D. Thesis, University of Birmingham, Birmingham, UK, 2018. [Google Scholar]
  7. Xu, X.; Xi, X.; Zhao, D. A complete Heyting algebra whose Scott space is non-sober. Fund. Math. 2021, 252, 315–323. [Google Scholar] [CrossRef]
  8. Ho, W.K.; Goubault-Larrecq, J.; Jung, A.; Xi, X. The Ho-Zhao problem. Log. Methods Comput. Sci. 2018, 14, 7. [Google Scholar]
  9. Miao, H.; Li, Q.; Xi, X.; Zhao, D. Not every countable complete distributive lattice is sober. Math. Struct. Comp. Sci. 2023, 33, 809–831. [Google Scholar] [CrossRef]
  10. Miao, H.; Xi, X.; Jia, X.; Li, Q.; Zhao, D. Products of two sober dcpo’s need not be sober. arXiv 2024, arXiv:2408.08587. [Google Scholar]
  11. Xi, X.; Lawson, J. On well-filtered spaces and ordered sets. Topol. Appl. 2017, 228, 139–144. [Google Scholar] [CrossRef]
  12. Gierz, G.; Hofmann, K.; Keimel, K.; Lawson, J.; Mislove, M.; Scott, D. Continuous Lattices and Domains; Cambridge University Press: Cambridge, UK, 2003. [Google Scholar]
  13. Goubault-Larrecq, J. Non-Hausdorff topology and Domain Theory; Cambridge University Press: Cambridge, UK, 2013. [Google Scholar]
  14. Zhao, D.; Fan, T. Dcpo-completion of posets. Theor. Comp. Sci. 2010, 411, 2167–2173. [Google Scholar] [CrossRef]
  15. Zhao, D.; Xi, X. Directed complete poset models of T1 spaces. Math. Proc. Camb. Phil. Soc. 2018, 164, 125–134. [Google Scholar] [CrossRef]
  16. He, Z.; Yang, Z.; Zhao, D. Maximal point spaces of posets of intervals. Top. Appl. 2022, 322, 108314. [Google Scholar] [CrossRef]
  17. Xu, L.; Zhao, D. Cσ-unique Dcpos and Non-maximality of the Class of Dominated Dcpos Regarding Γ-faithfulness. Electron. Notes Theor. Comput. Sci. 2019, 345, 249–260. [Google Scholar] [CrossRef]
  18. Zhao, D.; Xu, L. Uniqueness of directed complete posets based on Scott closed set lattices. Log. Method Comput. Sci. 2018, 14, 1–12. [Google Scholar]
  19. Hoffmann, R. On the sobrification remainder sXX. Pac. J. Math. 1979, 83, 145–156. [Google Scholar] [CrossRef]
  20. Cramer, T. A definition of separation axioms. Can. Math. Bull. 1974, 17, 485–491. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zhao, D. Johnstone’e Non-Sober Dcpo and Extensions. Int. J. Topol. 2025, 2, 3. https://doi.org/10.3390/ijt2010003

AMA Style

Zhao D. Johnstone’e Non-Sober Dcpo and Extensions. International Journal of Topology. 2025; 2(1):3. https://doi.org/10.3390/ijt2010003

Chicago/Turabian Style

Zhao, Dongsheng. 2025. "Johnstone’e Non-Sober Dcpo and Extensions" International Journal of Topology 2, no. 1: 3. https://doi.org/10.3390/ijt2010003

APA Style

Zhao, D. (2025). Johnstone’e Non-Sober Dcpo and Extensions. International Journal of Topology, 2(1), 3. https://doi.org/10.3390/ijt2010003

Article Metrics

Back to TopTop