WorksMathematics
The Scott sobriety on countable Frechet-Urysohn dcpos and locally compact meet-continuous dcpos
Abstract
In this paper, we focus on the Scott Sobriety of countable dcpos and locally compact dcpos. Recently, Chen, Kou and Yang proved that every countable dcpo with its Scott topology first-countable is sober endowed with the Scott topology. A natural question is whether a countable dcpo whose Scott topology is a Frechet-Urysohn sapce must be sober. We show that a countable dcpo with condition FG is Scott sober if its Scott topology is Frechet-Urysohn. Besides, a countable Scott non sober Frechet-Urysohn dcpo is constructed. He and Zhang gave two sufficient conditions for the open problem whether every locally compact dcpo is Scott sober. One of their sufficient conditions is that any locally compact meet-continuous coherent dcpo is Scott sober. We further prove that each locally compact meet-continuous dcpo is always sober with respect to the Scott topology.
Keywords. Scott topology, sobriety, Fréchet–Urysohn space, countable dcpo, weak one-step closure, meet-continuity, local compactness.
Mathematics Subject Classification: 54D10; 54D55; 06B35
Introduction
Sobriety is probably the most important and useful property of non-Hausdorff topological spaces. In Domain theory, a classical result is that every quasicontinuous dcpos and in particular every continuous dcpos is sober with respect to the Scott topology ([4]). Countability alone gives some different examples. Johnstone constructed a countable dcpo with a non-sober Scott space ([8]). Miao, Xi, Li and Zhao later answered a question of Jung by constructing a countable complete lattice with non-sober Scott topology. Their construction even admits a distributive lattice order ([10]).
Countability nevertheless has a strong consequence for convergence. The Scott space of every countable dcpo is sequential. Indeed, a sequentially closed subset is lower, as the constant sequence at converges to each point below . It also contains the supremum of each of its directed subsets, since every countable directed set has an increasing cofinal sequence converging to its supremum. Chen, Kou and Yang obtained a positive sobriety result under a stronger assumption. They proved that first countability of forces a countable dcpo to be quasicontinuous and hence Scott sober ([3]). These two results single out the Fréchet–Urysohn property. First countability implies this property, which in turn implies sequentiality. Its distinctive requirement is that each individual point of be the limit of a sequence from . A related theorem of He concerns the square of a space. An -well-filtered coherent -space is sober if is Fréchet–Urysohn ([5]). Here we ask whether the Fréchet–Urysohn property of itself suffices when is countable.
We answer this question negatively. The countable dcpo constructed in Section 4 has an irreducible Fréchet-Urysohn Scott space and no greatest element. Its whole space is therefore a closed irreducible set without a generic point. To verify the Fréchet-Urysohn property we compute the Scott closure of an arbitrary subset. One sequence in the construction, , converges to every point of the space.
The positive result depends on the order structure of the common upper bounds. Suppose that for every , there is a finite set such that
Miao, Yuan and Li used this finite generation property in their study of join continuity and well-filteredness ([11]). Here its role is to recover directed approximation from a single convergent sequence. Given , countability allows us to pass to a subsequence on which, for each , the assertion has a constant truth value from some index onwards. Finite generation makes the set of eventual lower bounds directed. This yields weak one-step closure in the sense of Miao, Li and Zhao ([9]). We then prove that every countable dcpo with weak one-step closure is Scott sober. In that proof, an enumeration of an irreducible closed set without a greatest element would yield an increasing branch with no upper bound in the set, contrary to Scott closedness. Thus the Fréchet-Urysohn property suffices under FG. In particular, the counterexample constructed by Miao, Xi, Li and Zhao cannot be Fréchet-Urysohn, since binary joins give ([10]).
A second question arises when the cardinality restriction is lifted. Xu and Zhao asked whether local compactness of implies sobriety for an arbitrary dcpo ([13]). The countable case has an affirmative answer. In fact, He, Dong and Wang proved that a countable dcpo with core-compact Scott space is quasicontinuous ([6]). For arbitrary cardinality, He and Zhang proved sobriety when is locally compact and second countable. They also proved it when is meet-continuous and is locally compact and coherent ([7]).
Can coherence be removed from the latter result?
Chen constructed a meet-continuous dcpo with a compact second-countable core-compact dcpo that is neither locally compact nor sober ([1]). This gives a negative answer to the related question of Jia recorded in ([13]). Theorem 5.18 answers Question 3.14 affirmatively for meet-continuous dcpos of arbitrary cardinality. He and Zhang use coherence to make compact ([7]). This allows them to take infima along the decreasing columns of a triangular array. We instead work inside each of a sequence of prescribed Scott-compact sets . Meet-continuity supplies common lower bounds for finite families in suitably chosen neighbourhoods. By successive relatively closed refinements and a finitely branching tree argument, we obtain points with whenever for all . Inside an irreducible Scott-closed set , this selection puts a point in every countable intersection of nonempty relatively open sets. We can then adapt the minimal closed set argument of He and Zhang to show that the points with a countable neighbourhood base in form a dense directed set. Its supremum is the greatest element of .
Preliminaries
Write and . A countable set is a finite or countably infinite set. For a subset of a partially ordered set , put
For a singleton, we write and . A set is upper if and lower if .
A subset of is directed if it is nonempty and every pair of its elements has an upper bound in . A dcpo is a partially ordered set in which every directed subset admits a supremum, denoted by . A subset is cofinal in if each lies below some .
Let be a dcpo. Its Scott topology consists of the upper sets with the following property. For each directed , if , then . We denote the space by . The Scott closed sets are precisely the lower sets containing the suprema of their directed subsets.
A nonempty subset of a space is irreducible if with closed in implies or . Equivalently, if two open sets meet , then their intersection meets . A space is sober if each nonempty irreducible closed set is the closure of a unique point.
A space is Fréchet–Urysohn if for each and there exists a sequence of points of converging to . If in , then for every , since every open neighbourhood of contains . If and for all , then also , since any open set containing contains .
In a topological space , a set is a countable intersection of open sets and a subset is dense precisely when it meets every nonempty open set.
Definition 2.1 ([9]). A dcpo has weak one-step closure if for every and , there is a directed with .
For any dcpo, if is directed, then contains , its supremum and all points below that supremum. Thus the definition is equivalent to the identity
Definition 2.2. A poset satisfies the finite generation condition for intersections of principal upper sets if
Lemma 2.3. Let be a Scott closed subset of a dcpo . The induced order makes a dcpo, and is the subspace topology on from . If has weak one-step closure, then has weak one-step closure.
Proof. For a directed , Scott closedness gives . This is also the least upper bound in . Consequently the trace on of each Scott-closed subset of is Scott closed in . Conversely, a Scott-closed subset of is lower in since is lower in . The equality of the two suprema shows that contains the supremum in of each directed subset of . This proves that is Scott closed in and establishes the assertion about topologies.
Suppose now that has weak one-step closure. Take and . Then , so some directed has . Lowerness gives , and the equality proves the last assertion. ◁
A sufficient condition for Fréchet-Urysohn countable dcpo becoming sober
We begin with a property of Scott-convergent sequences that applies even when the dcpo is uncountable.
Lemma 3.1. Suppose in the Scott space of a dcpo . Every Scott-open neighbourhood of contains an element for which for infinitely many indices .
Proof. Suppose each lies below only finitely many terms. Applying this to , we can discard finitely many terms and reindex so that for every . The lower set
contains all the remaining terms and omits . We prove that is Scott closed. Let be directed and put . If , then . Otherwise take . The set is directed and cofinal in , so . Every belongs to and hence lies below some . For this index . Therefore
The right-hand side is a finite union of closed sets and is contained in . It contains , proving Scott closedness. The open neighbourhood of now contradicts convergence.
Lemma 3.2. Let in the Scott space of a countable dcpo . There is a subsequence such that for each the truth value of is constant for all sufficiently large . Its set of eventual lower bounds
is lower and satisfies .
Proof. Enumerate as , repeating elements if it is finite. Put . For , one of the two possible truth values of occurs on an infinite subset of . Choose such an , then choose strictly increasing indices . For we have , which gives the asserted constancy.
Transitivity makes lower. For any Scott-open neighbourhood of , apply Lemma 3.1 to the convergent subsequence. It supplies which lies below infinitely many . The stabilized comparison with this particular must therefore be true. Hence , proving .
Proposition 3.3. Let be a countable dcpo satisfying . If is Fréchet–Urysohn, then has weak one-step closure.
Proof. Fix and , and take a sequence in converging to . Pass to the subsequence given by Lemma 3.2, denoting it by and its set of eventual lower bounds by . We have and , so is nonempty.
For , all sufficiently late lie in . The finite set is therefore nonempty. At least one member lies below infinitely many . By the choice of the subsequence, eventually, so . As is a common upper bound of , this proves directedness. For any directed subset of a dcpo,
Indeed, the ideal on the right is closed and contains , while every closed set containing contains and its lower bounds. Taking gives , as required.
Lemma 3.4. If a countable dcpo has weak one-step closure, then is Fréchet–Urysohn.
Proof. For choose a directed with . Enumerate as , using repetitions if necessary. Set and choose above both and . The sequence is increasing and cofinal in . For each choose above . Every Scott-open neighbourhood of contains . Consequently some is in , and upperness puts every later and in . This proves .
Lemma 3.5. Let be a countable dcpo with weak one-step closure. Suppose is irreducible and has no greatest element. Then for each nonempty Scott-open set there exists a finite subset such that .
Proof. Write for the set of maximal elements of . Each lies below a maximal element. Indeed, in every nonempty chain has its supremum as an upper bound, and bounds the empty chain. Zorn’s lemma gives a maximal element of , which is also maximal in . Thus meets every nonempty Scott-open set and is dense. Fix . The closed set contains and hence is all of . The ideal is proper by the hypothesis on greatest elements. Irreducibility now implies .
Given , choose . Intersecting each open neighbourhood of with shows that . By Lemma 3.4 there is a sequence from this set converging to $m. Each of its values occurs only finitely often, since is a neighbourhood of . We may therefore take its terms pairwise distinct.
Suppose for a contradiction that for every finite . Enumerate as , put , and let . Each is lower and dense. Weak one-step closure supplies a directed subset of with supremum above . Its supremum is by maximality. Since , the subset meets . Its trace on is directed and cofinal, by directedness and upperness of . Call this trace . We have
Let . The closed set contains every , and hence their limit . Apply Lemma 3.4 once more to obtain converging to .
For each , only finitely many belong to , because and is a neighbourhood of . Fix . If and , then : otherwise would give . It follows that
The set on the right is finite. Thus no lies below infinitely many terms of , contradicting Lemma 3.1 for the neighbourhood of .
Theorem 3.6. Every countable dcpo with weak one-step closure has a sober Scott space.
Proof. Let be a nonempty irreducible Scott-closed subset of . By Lemma 2.3 we may work in with its induced order and Scott topology. Suppose has no greatest element. Enumerate as , allowing repetitions. Starting with , we construct nonempty open sets and finite sets . If has been chosen, the proper closed subset has empty interior in , because every nonempty open set meets its nonempty open complement by irreducibility. Hence is nonempty and open. Lemma 3.5 gives a finite with . In particular, . The set is upper in , so . Consequently
Take the tree of finite increasing lists with , ordered by extension and rooted at the empty list. For every one can start from any and choose predecessors backwards to obtain a list at level . Thus the tree has nodes at arbitrarily high levels. Each node has only finitely many immediate successors. König’s lemma gives an infinite branch . Indeed, at each step choose a child having descendants at arbitrarily high levels, which exists since the number of children is finite. Let in and take with . Now and , contradicting the construction. Therefore has a greatest element . Its lowerness in gives , and antisymmetry gives uniqueness.
Theorem 3.7. If is a countable dcpo satisfying FG and is Fréchet–Urysohn, then is sober.
Proof. Proposition 3.3 gives weak one-step closure. Apply Theorem 3.6.
Corollary 3.8. Suppose is a countable dcpo in which each pair with a common upper bound has a least upper bound. If is Fréchet–Urysohn, then is sober.
Proof. If have a common upper bound, the singleton generates . Otherwise the empty set generates this intersection. The hypotheses of Theorem 3.7 are satisfied.
Remark 3.9. The join assumption in Corollary 3.8 is strictly stronger than (FG). For example, let be incomparable and let be incomparable, with each of above both . Every upper set of this four-element poset is finitely generated. The common upper bounds of are exactly , so the pair has no least upper bound.
A countable non-sober Fréchet–Urysohn Scott space
We construct a countable dcpo whose Scott space is Fréchet–Urysohn and has a nonempty irreducible closed set without a generic point. This shows what can happen when the finite generation hypothesis in Theorem 3.7 is dropped.
Write and . Take distinct symbols
In particular there is no -element at layer zero. Give the reflexive and transitive closure of the following relations.
Denote the row by . The superscript of a - or -element is its layer. On these elements define the height by and . Along an upward path avoiding the -elements, layers can only decrease and heights can only increase, in the weak sense. An (R4) step strictly decreases the layer. Inside one layer a path can ascend a single row and, at a positive layer, pass from the row to an -element. Leaving this -element requires an (R4) step. It follows that there is no cycle of nonidentity steps. Since no nonidentity step starts at an -element, the relation is a partial order and all the are maximal. The indexing makes countable.
Lemma 4.1. Suppose and . Then and . If for a nonmaximal , then .
Proof. A path to a nonmaximal element avoids every -element, so the height inequality follows along the path. For a path ending at , consider its last step. If it is (R2), it starts at a point with . Before this step, comparison of the layers and the heights gives and . If the last step is (R1), the path has entered from another row, since the starting point is outside . Its first entry into must use (R4), from some with . Consequently and .
Proposition 4.2. The poset is a dcpo. Every directed subset has a greatest element or has a cofinal subset in a row with unbounded heights. In the latter case . In particular, for all and .
Proof. If , directedness and maximality make it the greatest element of . Otherwise let be the least layer of a point of . If , its only nonmaximal upper bound in a layer at least is itself. Given , apply this observation to a common upper bound of and in . Thus is greatest.
It remains to consider a least layer containing only row elements of . Fix and set
This set is directed and cofinal in . A point of lies at layer , since layer cannot increase along a path to it. At that layer the only possible targets of such a path are elements of and -elements. The latter have been excluded. Hence . If the heights in are bounded, the point of largest height is greatest in and, by cofinality, in . If they are unbounded, is cofinal in the row. It is bounded above by . Lemma 4.1 excludes a nonmaximal upper bound, since its height would bound all these heights. It also excludes a different maximal symbol , since it would give the same bound. Thus is the only upper bound of and . Taking gives the final assertion.
Lemma 4.3. Every nonempty Scott-open set contains a tail of for each and a tail of for each . In particular, as for every and every .
Proof. Let be nonempty and Scott open. Every row element lies below the maximal element of its row, and . Thus contains some . Since , some belongs to . Upperness and (R2) give for every . When , (R3) gives for every . In particular , so (R4) and (R1) give for all .
Starting with the first maximal symbol in and repeating these steps upwards and downwards, we obtain a maximal symbol in at every layer. For the full tail at a positive layer , use (R2) from layer . For the full tail at layer zero, use the downward step from layer one. For the -tail at positive layer , use (R3) at that layer. Every open neighbourhood of now contains a tail of , which gives the convergence.
Proposition 4.4. The Scott space is irreducible and non-sober.
Proof. Any two nonempty opens contain tails of the same sequence and therefore intersect. Hence itself is irreducible and closed. The distinct maximal points and preclude a greatest element. Since each point closure is a principal ideal, has no generic point.
Proposition 4.5. For a lower set let for . If some is unbounded, then . If every is bounded, then
Proof. Suppose is unbounded. For any , choose with . Relation (R4) gives . Thus the entire sequence belongs to . It converges to every point by Lemma 4.3, so .
Now let every be bounded, hence finite. Write for the right-hand side of the displayed formula. It is lower and satisfies , because each with is the supremum of a row contained in .
We first show that enlarging to does not complete any previously incomplete row. Fix . A missing element of bounds the heights of all earlier elements of that row in , since is lower. Thus some bounds the heights in , including when the intersection is empty. If , then for a pair with and . Lemma 4.1 gives and . Hence the heights in are bounded above by
This maximum exists by finiteness. In particular .
Let be directed. If has a greatest element, its supremum is already in . Otherwise Proposition 4.2 provides a cofinal subset of unbounded height in some , with . Lowerness now gives . The preceding paragraph forces , so . We have proved that is Scott closed. Since , the formula follows.
Theorem 4.6. The Scott space is Fréchet–Urysohn.
Proof. Let and . All Scott-closed sets are lower, so has . Define the sets from as in Proposition 4.5. If some is unbounded, the proof of that proposition gives for every . Choose with . Every Scott-open neighbourhood of contains eventually, and upperness then puts there eventually. Thus $b_r \to x. Suppose next that all the are bounded. For , take above . The constant sequence at converges to . For , the closure formula gives for some . For each take above . Every Scott-open neighbourhood of contains . It therefore meets and contains a tail of that row. It also contains eventually. This produces a sequence in converging to in every case.
Proposition 4.7. Put and . Their common upper bounds form the set
This set has no finite generating subset.
Proof. The first strict step from uses (R4), reaching a row element with . At layer zero a path can continue up that row, end at , or use (R2) to end at with . All these destinations are attained, so
In particular, and are incomparable. Intersect the cases and . In the intersection each row starts at , and all the displayed maximal elements lie above at least one such row element. This gives both equalities. Moreover, distinct layer-zero rows have incomparable row elements. Thus each for is minimal in the intersection. If , then is contained in the intersection and must contain every minimal element of it. The infinitely many distinct points rule out a finite .
Corollary 4.8. There exists a countable dcpo with a Fréchet–Urysohn, non-sober Scott space. Such a dcpo can fail weak one-step closure.
Proof. Proposition 4.2, Proposition 4.4, and Theorem 4.6 verify the assertions about and its Scott space. Weak one-step closure for would give sobriety by Theorem 3.6.
Every meet-continuous locally compact dcpo is Scott sober
The preceding results use the countability of the underlying order. We now consider a sufficient condition involving the order and its Scott topology that applies to dcpos of arbitrary cardinality. We work in ZFC. Compactness means that every open cover has a finite subcover. A compact neighbourhood of a point is a compact set whose interior contains the point. We use two consequences of compactness in subspaces. A closed subset of a compact space is compact. In a nonempty compact space, a family of closed sets has nonempty intersection whenever every finite subfamily does, since otherwise the complements form an open cover with no finite subcover. This condition on finite subfamilies is the finite intersection property.
Definition 5.1. A Scott space is locally compact if for every there are a Scott-open set and a compact saturated set such that
A set is saturated if it is an intersection of open sets. A dcpo is meet-continuous if for every and directed ,
Equivalently, if , every Scott-open neighbourhood of contains a point below both and some .
We use subscripts in , , and to indicate the ambient order or topology when it is not clear from the argument.
Lemma 5.2. For , the principal ideal is Scott closed and equals . The saturation of every is . In particular, is the intersection of all Scott-open neighbourhoods of .
Proof. The set is lower and closed under directed suprema. Every Scott-closed set containing contains , which proves the first assertion. Every open set containing contains . If , then is open, contains , and omits . This gives the reverse inclusion for the saturation.
It follows that the specialisation order of , given by if , is the original order. Thus the Scott space is . For a Scott-closed set , finding its generic point amounts to finding its greatest element.
Lemma 5.3. If is meet-continuous, then is Scott open for each and .
Proof. The set is upper. Suppose it contains for a directed . There is with . By (2), there exist and with . Thus , as required.
For a dcpo and a subset , put
We write when working in . This operation is monotone, , and . The selection result used below applies also to compact sets which need not be saturated or nested.
To choose the points simultaneously, we need neighbourhoods in which finitely many points have a common lower bound. Consider first the coordinatewise order on the finite product .
Lemma 5.4. Let be meet-continuous. For and , the set
is Scott open in .
Proof. The same lower bound works for any larger tuple, so is upper. Let be directed with supremum in . For the th projection , put . Directed suprema in are coordinatewise. Hence there is below every . For , apply (2) to and . It yields and with . Choose a common upper bound of the finitely many . The point lies below every coordinate of . Thus .
Lemma 5.5. If is a dcpo and is locally compact, the Scott topology on is the product of the Scott topologies on its factors.
Proof. The projections preserve directed suprema and are monotone, so all open rectangles are Scott open. For the converse let be Scott open in and let . Its sections are Scott open in , since is monotone and preserves directed suprema. Moreover implies . For every directed ,
Indeed, if , the directed set has supremum in and therefore meets . Upperness gives the opposite inclusion.
By local compactness take , where is open and compact saturated. The set is upper. If , then the sections , , cover . Finitely many suffice, and directedness gives one member of whose section contains all of . Thus is Scott open, and .
Lemma 5.6. Under the hypotheses of Theorem 5.17, let and . There is a Scott-open set , with , such that every nonempty subset of of size at most has a common lower bound in .
Proof. Lemmas 5.4 and 5.5 show that is open in the ordinary product , by induction on . It contains . Choose a product neighbourhood of this tuple inside , and put . Every -tuple in has a common lower bound in . Repeating an entry gives the assertion for nonempty subsets with fewer than elements.
In the rest of the proof satisfies the hypotheses of Theorem 5.17. We first show that if , then under a suitable restriction on one can remove from and retain in the interior of the upward closure.
Lemma 5.7. If and , there is an open neighbourhood of with for every . If for , there is a relatively closed such that and .
Proof. Apply Lemma 5.6 to with , obtaining . For any there is below them both. Since , some satisfies . Hence , proving the first assertion. If , the neighbourhood contains a point . The set is relatively closed by Lemma 5.2, is disjoint from , and satisfies .
Lemma 5.8. The operation preserves finite unions.
Proof. For , apply Lemma 5.7 with and . The resulting is contained in , so . This proves . Monotonicity gives equality. Induction and give the general assertion.
Lemma 5.9. Let be a nonempty Scott-compact set and a relatively open cover of . Then
Proof. Monotonicity puts the right-hand side in . Suppose some does not belong to that union. Take a finite subcover and put . If is closed in and , we claim for every . Otherwise Lemma 5.7 supplies a relatively closed disjoint from with . But is closed in and contained in , against the choice of . Starting from and intersecting successively with the closed sets would give . This proves the identity.
In particular, if a compact set lies in , finitely many of the open sets in (5.5) cover . The preceding identity concerns an open cover of in .
We next apply the refinement lemma successively to a finite list of compact sets. It is important that each new set is closed relative to the original set in the same position.
Lemma 5.10. Let , , and let be nonempty Scott-compact sets with for . For , denote by the family of lists with the following properties.
and each is a nonempty closed subset of .
for all .
For , each nonempty subset of of size at most has a common lower bound in .
For every one has
In particular, the last set in the list may be chosen so that for any prescribed .
Proof. For take . Assume the assertion at . For each , fix a list in such that . Lemma 5.6 gives a neighbourhood of in which each nonempty collection of at most points has a lower bound in . That lower bound dominates an element of , which serves as a lower bound in .
The traces of the cover . For any , Lemma 5.9 yields a closed subset of , contained in some , with . In particular is nonempty. Appending it to the list chosen for that satisfies all three requirements. This proves one inclusion in (5.6) at . The other follows from . Induction completes the proof. □
We shall use the following compactness argument to pass from the finite lists to an increasing sequence.
Lemma 5.11. Let each be a nonempty Scott-compact set. For let be a nonempty closed subset of such that . Assume that for every nonempty subset of of size at most has a lower bound in . Put . Each is nonempty, and one can choose below every point of . Any such choices satisfy and .
Proof. For fixed the nested nonempty closed sets have nonempty intersection by compactness of . Consider the closed subsets of in the family
Take a finite subfamily, and let consist of the finitely many points specified by it. Choose an integer at least , at least , and at least every stage index in the subfamily. As , some is below if is nonempty. For , choose any . In either case belongs to all the selected sets. This is the finite intersection property, so compactness gives . Choose from this intersection for each . Then implies . □
Theorem 5.12. Let be meet-continuous and locally compact. Suppose that is a sequence of nonempty Scott-compact subsets of such that for all . There are points such that for every .
Proof. We construct a rooted tree with a finite nonempty set of nodes at each level . A node there carries a list of nonempty sets closed in , respectively. We require the following.
For each node and , .
For each node and , every nonempty subset of of size at most has a common lower bound in .
Over all nodes at level , the sets cover .
A child’s first coordinates will be contained in the corresponding coordinates of its parent. The root has all the required properties since .
Suppose level has been constructed. To each list at this level apply Lemma 5.10 with . All its refined lists retain a record of their parent. Their last open sets cover the parent’s . Over all parents these opens therefore cover . For each , choose such a list with . Lemma 5.6 gives a neighbourhood of such that every nonempty subset of of size at most has a lower bound in , hence one in .
Apply Lemma 5.9 to and the relative cover by the . For each , there is a nonempty relatively closed contained in some , with . Adjoin to the particular list chosen for this . Such a list satisfies the first two conditions at level . Its old coordinates are closed in their respective by transitivity of relative closedness. The resulting cover and hence . By compactness, finitely many suffice to cover . Keep the associated nodes and their parent edges. This gives a finite nonempty level satisfying the third condition.
The tree has an infinite branch. Indeed, the root has descendants at arbitrarily large levels, and a node with this property has a child with the same property because the tree is finitely branching. Write for the lists on this branch. The parent relation gives nesting in each coordinate, and the second condition gives the finite lower bounds required in Lemma 5.11. Its conclusion yields the desired points . □
We continue to assume that is meet-continuous and is locally compact. When is Scott closed, write for , using the induced order on .
Lemma 5.13. Let be a nonempty Scott-closed subset of a dcpo . Its induced order is a dcpo and its Scott topology is the subspace topology. Local compactness of and meet-continuity of each pass to .
Proof. For the first two assertions apply Lemma 2.3. Let , where is Scott open in . If is locally compact, choose an open and a compact saturated with . Then is closed in , hence compact, and is upper in . It contains the relative open neighbourhood of and is contained in . For meet-continuity, let be directed with . Meet-continuity of gives below both and some . Lowerness of puts in , as required. □
Proposition 5.14. Let be a nonempty irreducible Scott-closed subset of . For every sequence of nonempty relatively open subsets of , there is an increasing sequence in with for each . In particular, .
Proof. Work in by Lemma 5.13. First choose a compact saturated with nonempty interior. If has been chosen, irreducibility gives a point of . Choose a compact saturated neighbourhood of this point within the intersection. Thus and . Theorem 5.12 gives with . Each is upper in , so the supremum belongs to every . □
Corollary 5.15. If is meet-continuous and is locally compact and first countable, then is sober.
Proof. Let belong to a nonempty irreducible Scott-closed set . Restrict countable open neighbourhood bases at to and denote the resulting bases by . Each is nonempty by irreducibility. Proposition 5.14 gives a point in their intersection for all . For any open local base at the intersection of its members is . Indeed, if then is a neighbourhood of omitting . The same applies to , so . Thus is directed, contains its supremum, and is the principal ideal of that supremum. □
Lemma 5.16. Let be nonempty, irreducible and Scott closed in . Given nonempty relatively open subsets of , , some has a countable open neighbourhood base in .
Proof. Put . Since is nonempty by irreducibility, local compactness gives a nonempty relatively open and a compact saturated in with
In particular . Among the closed subsets of meeting every choose an inclusion-minimal one, . Such sets exist because is one. For a nonempty chain of them and fixed , the traces on are closed and have the finite intersection property. Compactness gives a common point in . Thus the intersection of the chain meets each , and Zorn's lemma applies.
Whenever an open of meets , the proper closed subset of is closed in . Hence for some we have
For two such open sets take the larger of the two indices. This shows that their intersection meets , so is irreducible. It is also closed in . Each is a nonempty open subset of , as it contains . Proposition 5.14 applied to gives . Thus for every . Since is closed, lies in and meets every , minimality implies
Now put . By Lemma 5.3 in , these are open neighbourhoods of . If is any open neighbourhood of , take as above. Then . Since is upper, . This proves the base assertion. In particular is a subset of .
Theorem 5.17. Let be a meet-continuous locally compact dcpo with respect to the Scott topology. Then is sober.
Proof. Fix a nonempty irreducible Scott-closed set . Let be the set of points of having a countable open neighbourhood base in . By applying Lemma 5.16 to a constant sequence of nonempty open sets, we see that is dense in . Given , interleave the members of countable bases at and . The same lemma gives belonging to every one of these open sets. The neighbourhood calculation in Corollary 5.15 gives . Thus is nonempty and directed.
Let . Since is Scott closed, . The closed set contains the dense subset , and therefore contains . Conversely by lowerness. We have proved . If as well, then and , so .
Corollary 5.18. For every and countable family of Scott-open neighbourhoods of , there is a point in at which is first countable. Moreover, the set
is directed and has supremum .
Proof. Take . Every nonempty relative open contains , so is irreducible. By Lemma 5.16, some has a relative countable base . Write with Scott open in . Because , we have . The sets are open neighbourhoods of by Lemma 5.3. For any ambient open containing , choose with . Upperness of now gives . This proves first countability at in .
Taking all equal shows that meets every neighbourhood of . For , every Scott-open neighbourhood of either point contains . Apply the first assertion to the interleaved local bases at and to find a common upper bound in . Hence is directed, with . If , the open would contain and miss , a contradiction. Thus .
This is the approximation property obtained for locally compact sober web spaces in [2, Lemma 3.7.
The following two examples separate the hypotheses of Theorem 5.17 from first countability and coherence.
Example 5.19. Let be the least uncountable ordinal, and order by the ordinal order. This chain is a dcpo. Suppose for a directed set . If some dominates , then is itself below and . Otherwise and . Every Scott-open neighbourhood of then contains some member of . These two cases prove meet-continuity.
Every nonempty upper set has a least member . If is a nonzero limit ordinal, its predecessors form a directed set with supremum disjoint from . If , a directed set missing has supremum at most . Consequently the nonempty Scott opens are precisely and the upper sets generated by successor ordinals. Each is compact because any open cover has a member containing its least point. Thus is locally compact.
Every neighbourhood of contains a tail with . Given countably many neighbourhoods, choose one such for each. The ordinal is still countable and belongs to all of them. Since the intersection of all neighbourhoods of is , the top point has no countable local base. Its Scott space is sober by Theorem 5.17.
Example 5.20. Take two incomparable points below an infinite antichain . More precisely, order by and for , with no other strict inequalities. If a directed set meets , the point it contains there is greatest. A directed set disjoint from is a singleton. Hence is a dcpo, every upper set is Scott open, and (2) holds by using itself whenever . The principal upper sets are compact open neighbourhoods of their generators. The Scott space is therefore locally compact. But , and the cover of by Scott-open singletons has no finite subcover. In particular this Scott space is not coherent. See also [12 Section 1.5].
Chen’s example is a meet-continuous dcpo whose Scott space is compact, second countable and core-compact, but fails both local compactness and sobriety [1 Theorem 6.4]. Thus core-compactness cannot replace local compactness in Theorem 5.17.
AI Declaration For more readable, the authors just use AI tools to assist with English language editing. The author independently verified the mathematical statements, proofs and references. The author takes full responsibility for the manuscript.
References
- [1]Y. Chen, A non-sober core-compact meet-continuous dcpo, preprint, arXiv:2610.22033 2026.arxiv.org/abs/2610.22033
- [6]Z. He, Z. Dong and K. Wang, Sobriety of Scott topologies under countability conditions, preprint, arXiv:2609.24001v2, 2026.arxiv.org/abs/2609.24001
- [7]Z. He and Y. Zhang, The sobriety for locally compact dcpos, preprint, arXiv:2610.17759, 2026.arxiv.org/abs/2610.17759
- [9]H. Miao, Q. Li and D. Zhao, One-step closure, weak one-step closure and meet continuity, Electronic Notes in Theoretical Informatics and Computer Science, 2 (2023), article 8, 8 pp.DOI
- [10]H. Miao, X. Xi, Q. Li and D. Zhao, Not every countable complete distributive lattice is sober, Mathematical Structures in Computer Science, 33 (2023), no. 9, 809–831.DOI
- [11]H. Miao, Z. Yuan and Q. Li, A discussion of well-filteredness and sobriety, Topology and its Applications, 291 (2021), 107450.DOI
- [12]R. Tix, K. Keimel and G. Plotkin, Semantic domains for combining probability and non-determinism, Electronic Notes in Theoretical Computer Science, 222 (2009), 3–99.
- [13]X. Xu and D. Zhao, Some open problems on well-filtered spaces and sober spaces, Topology and its Applications, 301 (2021), 107540.arxiv.org/abs/2005.00539