WorksMathematics
Sequential convergence in the lower topology and co-sobriety of Scott spaces
Abstract
We investigate how order structure controls sequential convergence in the lower topology of a poset and how this, in turn, governs topological duality and co-sobriety of Scott spaces. We first give a purely order-theoretic characterization of lower convergence. For complete lattices this yields a lower-limsup formula, and on complete chains the lower limsup coincides with the usual lattice limsup. We also characterize first countability of the lower topology at a point by the existence of a countable coinitial subset outside its principal ideal. We prove that every compact saturated subset of a Scott space is sequentially closed in the lower topology and deduce that, for every poset, the lower topology and the co-compact (de Groot dual) topology of its Scott space have exactly the same convergent sequences and limits. For coherent Scott spaces we identify the lower closure of a -irreducible compact saturated set with its double-cone closure and obtain an infimum criterion for co-sobriety. Consequently, every bounded-complete dcpo with sequential lower topology has a co-sober Scott space. In particular, every countable bounded-complete dcpo, and hence every countable complete lattice, has a co-sober Scott space.
Keywords: Lower topology; sequential convergence; Scott topology; bounded-complete dcpo; complete lattice; co-sobriety.
2020 Mathematics Subject Classification: 06F30, 06B35, 54A20, 54D30.
Funding: This research was supported by the National Natural Science Foundation of China (Nos. 12471070, 12071199, 12561083).
Introduction
Co-sobriety was introduced by Escardó, Lawson and Simpson in their study of a dual form of the Hofmann–Mislove theorem [2]. A -space is co-sober if every -irreducible compact saturated subset is the saturation of a point. Co-sobriety and sobriety are distinct: sober spaces need not be co-sober, and even a sober Scott space can fail to be co-sober [8, 9].
Let be a poset. We write for its lower topology, for its Scott topology, and for its Scott space. The co-compact, or de Groot dual, topology of will be denoted by ; it is generated by the complements of the compact saturated subsets of .
Topology-level duality between one-sided order topologies and de Groot duals has been studied under stable compactness and related structural hypotheses [5, 11, 12]. In particular, systematic criteria for when the de Groot dual of a Scott topology is the lower topology are developed in [12 Chapters 9–10]. Lawson and Xu developed a systematic account of the lower topology on general -spaces and its interaction with compactness, well-filteredness and coherence [6]. Zhao, He and Wang proved, by a different method, that every locally compact coherent -space is co-sober [14]. The present paper takes a different viewpoint, centered on the underlying order. Rather than assuming global topological hypotheses that force topology-level duality, we begin with the order relation itself and use ordinary sequences as the organizing principle. This leads from an order-theoretic description of lower convergence to topological consequences for de Groot duality and co-sobriety.
Our first result makes the order-theoretic nature of lower convergence explicit. For a poset and a sequence in , converges to in precisely when every element not below is eventually not below . Equivalently,
For a complete lattice this gives a natural lower limsup. If
then
On a complete chain, agrees with the usual lattice limsup
Thus, for the extended real line with its usual order, lower-topological convergence is exactly the one-sided condition .
The same order-theoretic viewpoint also identifies the precise local countability condition behind this convergence. The lower topology is first-countable at if and only if has a countable coinitial subset. This supplies a purely order-theoretic source of first countability, and hence of the Fréchet–Urysohn and sequential properties, even for uncountable posets.
The order-theoretic convergence description then interacts directly with the Scott topology. Our main sequential duality theorem states that, for an arbitrary poset , the topologies and have the same convergent sequences, with the same limits. The topologies themselves can differ [11], but they coincide whenever the lower topology is sequential. In particular, topology-level equality follows if the lower topology is Fréchet–Urysohn or first-countable, and it holds for every countable poset. Thus the global duality studied in the literature has an unconditional sequential analogue: ordinary sequences cannot distinguish from the de Groot dual of the Scott topology.
For coherent Scott spaces we then determine the lower closure of a -irreducible compact saturated set :
where is the set of lower bounds of and is the set of upper bounds of . If exists, the formula reduces to
Together with lower sequential closedness of compact saturated sets, this yields an infimum criterion for co-sobriety. We apply the criterion to bounded-complete dcpos. If the lower topology is sequential—in particular, if it is Fréchet–Urysohn or first-countable—then the Scott space is co-sober. Hence the first-countability criterion gives a purely order-theoretic sufficient condition without requiring the dcpo itself to be countable.
On the other hand, Scott co-sobriety can fail without a countability assumption even for complete Boolean algebras. Ji and Xu constructed a complete Boolean algebra whose Scott space is not co-sober [4]. Their example is necessarily uncountable, since every countable complete Boolean algebra is finite [4 Proposition 5.4]. Thus the uncountable and countable settings exhibit sharply different behavior. One of the main consequences below is therefore a structural theorem for countable ordered sets with sufficient completeness: every countable bounded-complete dcpo has a co-sober Scott space, and hence so does every countable complete lattice.
Miao, Xi, Li and Zhao constructed a countable complete distributive lattice whose Scott space is not sober [7]. Our result shows that their example is nevertheless co-sober. Thus, even among countable complete distributive lattices, Scott sobriety and Scott co-sobriety separate.
The paper is organized as follows. Section 2 develops the order theory of sequential convergence in the lower topology, including the lower-limsup and coinitiality criteria for first countability, and then connects this order convergence with compact saturated subsets of Scott spaces. Section 3 establishes sequential duality between the lower topology and the co-compact topology. Section 4 derives the lower-closure and infimum criteria for coherent Scott spaces. Section 5 applies these results to bounded-complete dcpos and complete lattices.
Sequential convergence in the lower topology
For , put
For a singleton, we write and .
The lower topology is generated by
as a subbase. Thus the finite intersections
form a base.
A set is Scott open if it is an upper set and, whenever a directed set has a supremum with , one has . The Scott open sets form the topology , called the Scott topology of .
For a -space , let be the family of its nonempty compact saturated subsets. No separation axiom is included in the meaning of compactness. A member is -irreducible if
implies or . The space is co-sober if every -irreducible member of is the saturation of a point. A -space is coherent if the intersection of any two compact saturated subsets is compact.
A subset of a topological space is said to be sequentially closed if for any sequence in , contains all its limits. The space is sequential if every sequentially closed subset is closed. It is known that every first-countable space is Fréchet–Urysohn and every Fréchet–Urysohn space is sequential (see, e.g., [1 Theorem 1.6.14]).
For , define
and
Proposition 2.1 (Order characterization of lower convergence). Let be a sequence in a poset and let . The following are equivalent.
in .
For every with , one has eventually.
3.
Proof. A subbasic lower-open set contains exactly when . Convergence to all subbasic neighbourhoods is equivalent to convergence in the topology, because eventual membership in finitely many subbasic neighbourhoods implies eventual membership in their intersection. This proves (1) (2).
Assume (2), and let belong to the intersection in (3). If , then (2) gives eventually. On the other hand, membership of in every tail-downset means that for every there is with , a contradiction. Thus .
Conversely, if (2) fails, there is a such that for infinitely many . Hence for every some satisfies , so
contradicting (3). Therefore (3) (2). □
For a sequence in a complete lattice , define its lower limsup by
We also write
for the usual lattice limsup.
Corollary 2.2. Let be a complete lattice and a sequence in . Then, for every ,
Moreover,
Proof. By Proposition 2.1, lower convergence to is equivalent to
which, in a complete lattice, is equivalent to the join of the left-hand side being at most .
Let
For and every , some satisfies , hence
Therefore for every . Taking joins gives .
Proposition 2.3. If is a complete chain, then for every sequence in ,
Consequently,
Proof. Put
By Corollary 2.2, . Suppose that .
If there is with , then for every we have
Since is a chain, some must satisfy ; otherwise would be an upper bound of the tail. Hence , contradicting .
It remains to consider the case where no element lies strictly between and . For every , since , some satisfies . By the absence of an element strictly between and , this implies . Thus , again contradicting . Hence .
Remark 2.4. For the extended real line with its usual order, Proposition 2.3 says
Thus lower-topological convergence is a direct order-topological extension of the familiar one-sided limsup condition from analysis.
We next isolate the exact local countability condition for the lower topology. A subset of a poset is called coinitial if for every there is with , or equivalently, .
Theorem 2.5 (First-countability criterion). Let be a poset and . The lower topology is first-countable at if and only if has a countable coinitial subset.
Proof. Suppose first that is first-countable at . Let be a countable local base at . For every , choose a basic lower-open neighbourhood , where is finite, such that
Put . Then is countable and . Let . Since is a neighbourhood of , there is with
Hence
so . In particular, , and therefore some satisfies . Thus is coinitial in .
Conversely, let be countable and coinitial. If , then , so is a greatest element and is a local base at . Assume therefore that , and enumerate it as , repeating elements if is finite. Put
Then each is a neighbourhood of . We show that is a local base at . Let
be a basic neighbourhood of , so each . By coinitiality, choose for . If , then
and hence . Thus is first-countable at .
Corollary 2.6. For a poset , the following are equivalent.
(1) is first-countable.
(2) For every , the poset has a countable coinitial subset.
In either case is Fréchet–Urysohn and hence sequential.
We now turn to compact saturated subsets of Scott spaces. The following compact-down lemma is standard; see, for example, [3 Section II-1] and [13 Lemma 3.14]. The proof is included because the topology on is otherwise arbitrary.
Lemma 2.7. Let be equipped with a topology in which every principal upper set is closed. If is compact in that topology, then is Scott closed.
Proof. The set is a lower set. Let be directed, suppose that exists, and assume that . Then for every . For each , choose such that . Thus
is an open cover of . Compactness gives with
Choose above all . Since for every , we have . On the other hand, , so for some , a contradiction. Hence .
Lemma 2.8. Suppose that in . For , let
Then every is Scott closed and
Proof. The set is a convergent sequence tail together with its limit, hence it is compact in . Principal upper sets are closed in the lower topology, so Lemma 2.7 shows that is Scott closed.
The inclusion is immediate. Conversely, let and suppose that . Then . As in , there is such that for all , and hence , which contradicts . Thus $\bigcap_{n\geq 1} F_n = \mathord{\downarrow}x.
Proposition 2.9. Every compact saturated subset of is sequentially closed in .
Proof. Let , and suppose that and in . Let be as in Lemma 2.8. The sets form a decreasing sequence of nonempty closed subsets of the compact subspace : indeed, . Hence
No separation axiom is used in this compactness argument. By Lemma 2.8, the intersection is . Choose . Since is an upper set and , it follows that .
Sequential duality with the co-compact topology
Let be the topology generated by
as a subbase.
Theorem 3.1 (Sequential duality theorem). For every poset , the topologies and have the same convergent sequences and the same limits.
Proof. For every , the principal upper set is compact and saturated in : a Scott open set containing contains all of . Therefore is open in , and
Thus convergence in implies convergence, to the same limit, in .
Conversely, suppose that in , and let with . If infinitely many belonged to , a subsequence contained in would still converge to in . Proposition 2.9 would then give , a contradiction. Hence eventually. The sequence is eventually in every subbasic -neighbourhood of , and therefore in every finite intersection of such neighbourhoods. Thus in .
Corollary 3.2. If is sequential, then
In particular, the equality holds whenever is Fréchet–Urysohn or first-countable, and it holds for every countable poset .
Proof. By Theorem 3.1, every -open set is sequentially open with respect to . If is sequential, it is therefore -open. The reverse inclusion always holds. The Fréchet–Urysohn and first-countable cases follow from the standard implications. If is countable, the defining subbase of is countable, so is second-countable and hence sequential.
Combining Theorem 2.5 with Corollary 3.2 gives a purely order-theoretic version.
Corollary 3.3. If, for every , the set has a countable coinitial subset, then
Remark 3.4. Corollary 3.2 concerns the co-compact topology of the Scott space. It does not identify this topology, or the lower topology, with the Scott topology of the order dual .
The distinction between Theorem 3.1 and topology-level de Groot duality is also worth emphasizing. Global criteria for involve additional structural hypotheses and are part of the theory of stable compactness and ordered patch spaces; see [5, 11, 12]. Theorem 3.1 requires no such hypothesis: it asserts an unconditional equality of the sequential convergence structures. Sequentiality of is exactly what is needed here to promote this sequential duality to equality of the topologies.
Coherent Scott spaces
Proposition 4.1. Suppose that is coherent. If is -irreducible, then
Proof. For every , one has . Since is closed in ,
For the reverse inclusion, let . There are such that
and
Hence
Discard the empty terms. Each principal upper set is compact saturated, and coherence implies that every remaining is compact saturated. Finite unions of compact saturated sets are compact saturated, so binary -irreducibility applies inductively to this finite union. Thus for some . Hence . Since , we have .
Corollary 4.2. Under the hypotheses of Proposition 4.1, if exists, then
Proof. If , then and .
Theorem 4.3. Suppose that is coherent and is sequential. Then is co-sober if and only if every -irreducible member of has an infimum in .
Proof. Suppose first that is co-sober. Its specialization order is the original order on , so the saturation of is . Hence every -irreducible has the form , and .
Conversely, let be -irreducible and suppose that exists. By Proposition 2.9, is sequentially closed in . Since is sequential, is closed. Corollary 4.2 now gives
Thus every -irreducible compact saturated set is the saturation of a point.
Bounded-complete dcpos
We use the convention that a bounded-complete dcpo is a dcpo in which every subset having an upper bound has a supremum, including the empty subset. In particular, exists. This convention is stated explicitly because a weaker usage of the term also occurs in the literature.
Xi and Lawson proved that the Scott space of every complete lattice or bounded-complete dcpo is well-filtered and coherent [10 Corollary 4.3].
Theorem 5.1. Let be a bounded-complete dcpo. If is sequential, then is co-sober.
Proof. We verify the infimum condition in Theorem 4.3. Let be nonempty. Its set of lower bounds
is nonempty because . It is bounded above by any fixed , so
exists. Every is an upper bound of , and therefore . Thus is the greatest lower bound of . In particular, every -irreducible compact saturated subset has an infimum. Coherence follows from the result of Xi and Lawson, so Theorem 4.3 applies.
Corollary 5.2. Let be a bounded-complete dcpo. If is Fréchet–Urysohn, then is co-sober. In particular, this holds if is first-countable.
Proof. Every Fréchet–Urysohn space is sequential, and every first-countable space is Fréchet–Urysohn. Apply Theorem 5.1.
Corollary 5.3. Let be a bounded-complete dcpo. If, for every , the set has a countable coinitial subset, then is co-sober.
Proof. By Theorem 2.5, is first-countable. Apply Corollary 5.2.
Corollary 5.4. Every countable bounded-complete dcpo has a co-sober Scott space.
Proof. The lower topology of a countable poset is second-countable and hence sequential. Apply Theorem 5.1.
Corollary 5.5. Every countable complete lattice, and hence every countable complete Heyting algebra, has a co-sober Scott space.
The countability hypothesis in Corollary 5.5 is essential for such a general statement. Indeed, Ji and Xu constructed a complete Boolean algebra whose Scott space is not co-sober [4]. Since every countable complete Boolean algebra is finite, this counterexample is necessarily uncountable. Consequently, even within complete Boolean algebras, Scott co-sobriety is automatic in the countable case but may fail once countability is dropped.
Corollary 5.6. There exists a countable complete distributive lattice whose Scott space is co-sober but not sober.
Proof. Miao, Xi, Li and Zhao constructed a countable complete distributive lattice whose Scott space is not sober [7]. Corollary 5.4 gives co-sobriety.
Concluding remarks
The results above show how order structure, sequential convergence and Scott topology interact in a direct way. Proposition 2.1 shows that lower convergence is controlled by eventual order avoidance; on complete chains it is exactly a limsup condition. Theorem 3.1 shows that ordinary sequences cannot distinguish the lower topology from the co-compact topology of the Scott space, even though the two topologies may be different. First countability and the Fréchet–Urysohn property provide natural bridges from this sequential duality to topology-level duality.
For coherent Scott spaces, Proposition 4.1 makes the order-theoretic content of lower closure explicit. When the relevant infima exist, co-sobriety is reduced to the passage from lower sequential closedness to lower closedness. This explains why sequential properties of the lower topology lead directly to co-sobriety results for bounded-complete dcpos.
Several questions suggested by this viewpoint remain open. First, it would be useful to obtain intrinsic order-theoretic characterizations of when is Fréchet–Urysohn or sequential, extending the first-countability criterion in Theorem 2.5. Second, for complete lattices one may ask for structural conditions under which the lower limsup agrees with the lattice limsup beyond the case of complete chains. Finally, the sequentiality hypothesis in Theorem 5.1 is sufficient but is not claimed to be necessary; weaker closure assumptions ensuring that -irreducible compact saturated subsets are lower closed would lead to further co-sobriety criteria.
Statements and Declarations
Funding. This research was supported by the National Natural Science Foundation of China (Nos. 12471070, 12071199, 12561083).
Competing interests. The authors have no relevant financial or nonfinancial interests to disclose.
Use of generative AI. During the preparation of this manuscript, the authors used ChatGPT (OpenAI) for language editing, presentation suggestions, and manuscript checking. The authors independently verified all mathematical arguments and references, revised the output as necessary, and take full responsibility for the final content.
Data availability. No data were used for the research described in this article.
References
- [1]R. Engelking, General Topology, Polish Scientific Publishers, Warsaw, 1989.
- [2]M. Escardó, J.D. Lawson, A. Simpson, Comparing Cartesian closed categories of (core) compactly generated spaces, Topology Appl. 143 (1–3) (2004) 105–145. https://doi.org/10.1016/j.topol.2004.02.011.
- [3]G. Gierz, K.H. Hofmann, K. Keimel, J.D. Lawson, M. Mislove, D.S. Scott, Continuous Lattices and Domains, Encyclopedia of Mathematics and its Applications, Vol. 93, Cambridge University Press, Cambridge, 2003. https://doi.org/10.1017/CBO9780511542725.
- [4]W. Ji, X. Xu, Scott spaces of complete Boolean algebras need not be co-sober, arXiv:2608.08484 (2026).
- [5]J.D. Lawson, Stably compact spaces, Math. Struct. Comput. Sci. 21 (1) (2011) 125–169. https://doi.org/10.1017/S0960129510000319.
- [6]J.D. Lawson, X. Xu, T₀-spaces and the lower topology, Math. Struct. Comput. Sci. 34 (6) (2024) 467–490. https://doi.org/10.1017/S0960129524000240.
- [7]H. Miao, X. Xi, Q. Li, D. Zhao, Not every countable complete distributive lattice is sober, Math. Struct. Comput. Sci. 33 (9) (2023) 809–831. https://doi.org/10.1017/S0960129523000269.
- [8]C. Shen, G. Wu, X. Xi, D. Zhao, Sober Scott spaces are not always co-sober, Topology Appl. 282 (2020) 107316. https://doi.org/10.1016/j.topol.2020.107316.
- [9]X. Wen, X. Xu, Sober is not always co-sober, Topology Appl. 250 (2018) 48–52. https://doi.org/10.1016/j.topol.2018.10.003.
- [10]X. Xi, J.D. Lawson, On well-filtered spaces and ordered sets, Topology Appl. 228 (2017) 139–144. https://doi.org/10.1016/j.topol.2017.06.002.
- [11]X. Xu, A note on duals of topologies, Topology Appl. 199 (2016) 95–101. https://doi.org/10.1016/j.topol.2015.12.006.
- [12]X. Xu, Order and Topology (in Chinese), 2nd ed., Science Press, Beijing, 2022.
- [13]X. Xu, D. Zhao, On topological Rudin’s lemma, well-filtered spaces and sober spaces, Topology Appl. 272 (2020) 107080. https://doi.org/10.1016/j.topol.2020.107080.
- [14]B. Zhao, Z. He, K. Wang, On co-sober spaces, Houston J. Math. 49 (4) (2023) 971–988.DOI