WorksMathematics
H-sober spaces and Hofmann-Mislove type theorems
Abstract
A -space is called -sober if every irreducible closed subset having a countable dense subset is the closure of a unique point. This is precisely -sobriety for the countable irreducible subset system . We give two natural Hofmann–Mislove representations in the general -sobriety framework: filters induced by -sets of characterize -sobriety, whereas filters induced by -sets of the Smyth power space characterize super -sobriety. Their relation is expressed by property . A minimal closed set argument with a countable selection proves that has property . Consequently, is -sober if and only if its Smyth power space is -sober, equivalently, every countable irreducible compact-family filter has a compact saturated representation. We also obtain equivalent recovery, compact-intersection and representation conditions for an enlarged class containing the proper Scott-open filters with countable open bases and the filters induced by countable irreducible subsets. A further equivalent formulation uses traces on countable subspaces. The filtered-family specializations recover well-filteredness and -well-filteredness. Explicit examples show that -sobriety strictly implies -well-filteredness, which strictly implies representation for countable open bases alone.
Introduction
The Hofmann–Mislove theorem identifies the Scott-open filters of the open-set lattice of a sober space with its compact saturated subsets [2, 3]. Its countable variants require care: countability of a filter, existence of a countable filter base, and countability of a set whose closure is irreducible impose different restrictions.
In this paper, for a -space , an open filter means a Scott-open filter on the open-set lattice . A filter on is countably generated if it is generated by countably many open members of the filter. The notion of -sobriety concerns irreducible closed sets with a countable dense subset, and does not require those closed sets themselves to be countable. In the language of irreducible subset systems, this is precisely -sobriety [5], where
Thus -sobriety is a special case of -sobriety, with the countability restriction placed on the inducing irreducible subset.
We distinguish two natural classes of proper Scott-open filters for an irreducible subset system . The first consists of for . The second consists of for , where is the Smyth power space of . Their representation properties characterize,
Email addresses: [email protected] (Xiaoquan Xu), [email protected] (Xinjie Huang) respectively, -sobriety of and -sobriety of (Theorems 2.10 and 2.11). These are filter formulations of the existing -sobriety and super -sobriety framework [4 Theorems 3.6 and 5.7], [5 Theorem 5.5]. The local property- criterion [4 Theorem 6.4] explains when the two conditions coincide.
For an arbitrary , its restriction to countable members is again an irreducible subset system, so both representation theorems apply. For we prove property directly, using a minimal closed set and one chosen point from each member of a countable irreducible family in (Lemma 3.5). This gives
Theorem 3.6 expresses this equivalence in terms of both point-induced filters and countable irreducible compact-family filters. In the latter case, countable counts the members of the family, without imposing a countable open base on the induced filter.
Representation for countably generated Scott-open filters alone is weaker than -sobriety. Indeed, it already holds in every -well-filtered space by the theorem of Goubault-Larrecq [1 Theorem 1 and the following remark]. We denote this open-generator representation property by , with “c” standing for countable and “o” for open. Goubault-Larrecq allows a broader notion of generation by descending subsets, which we distinguish in Remark 2.8. By Theorem 2.10, the filters induced by countable irreducible subsets already characterize -sobriety. Theorem 3.2 shows that one may enlarge this test class by adjoining all proper Scott-open filters with countable open bases. The resulting class is defined explicitly in Section 3. The theorem gives equivalent recovery and representation conditions for this enlarged class, whereas the countably based filters alone do not characterize -sobriety in general.
Theorem 3.2 has a direct minimal-closed-set proof, and Theorem 4.1 gives a further equivalent formulation using traces on countable subspaces. The classical, well-filtered and -well-filtered versions are compared through their inducing families. The examples establish that both implications -sobriety -well-filteredness are strict.
The terminology here also differs from countably sober in [8, 9], where the defining irreducibility condition involves countable closed covers. No identification with that condition is intended.
Preliminaries and Hofmann–Mislove representations
All spaces are , and “countable” includes finite. We write . For a space , let denote its lattice of open subsets, ordered by inclusion, and write for the closure of .
A nonempty subset of is irreducible if, whenever for closed subsets of , one has or . Equivalently, for all ,
A subset is irreducible if and only if its closure is irreducible. A point is a generic point of a closed set if . The space is sober if every irreducible closed subset has a unique generic point.
The specialization order is
For , put
The saturation of is the intersection of all open sets containing ; it equals . Thus a subset is saturated if and only if it is an upper set for the specialization order. Open sets are upper sets as well. In particular, if an open or saturated set meets , then it contains .
A subset is compact if every open cover of has a finite subcover; no separation assumption is included. We write for the collection of nonempty compact saturated subsets of .
Definition 2.1. A space is -sober if every irreducible closed subset for which
for some countable is for a unique .
Equivalently, for every countable irreducible subset of there is a unique with . This follows because a subset is irreducible if and only if its closure is irreducible. Uniqueness follows from the assumption. On a countable space, -sobriety is exactly sobriety. In particular, Definition 2.1 is the -sobriety condition for the countable irreducible subset system ; the general definitions are given below.
A nonempty subset of a poset is directed if every pair of its members has an upper bound in . For a family of open sets ordered by inclusion, this means that any two members are contained in a third member of the family.
A proper filter is a nonempty upper set closed under finite intersections and not containing . It is Scott-open if, for every nonempty directed family ,
For a subset , put
For a nonempty irreducible subset , define
Irreducibility makes a proper filter. It is completely prime: if an arbitrary union belongs to , some member of that union belongs to . In particular, is Scott-open. If , then
The set is always nonempty, compact and saturated: any open set containing contains all of .
Lemma 2.2. If , then is a proper Scott-open filter, and . Conversely, if a proper Scott-open filter satisfies
then is a nonempty compact saturated set. Thus a compact saturated set representing is unique.
Proof. For a directed open cover of a compact set, a finite subcover is contained in one member of the directed family. This proves Scott openness. Saturation gives .
Conversely, write . It is saturated, and properness and the displayed equality imply . Given an open cover of , its union belongs to . The finite unions of members of the cover form a directed family, so Scott openness gives a finite union in . That finite union contains .
We recall the following minimal closed set lemma [4 Lemma 2.12], including its proof for completeness.
Lemma 2.3 (Minimal closed set lemma). Let be a -space and a proper Scott-open filter on , and let be a closed subset of meeting every member of . There exists a closed set minimal among the closed sets meeting every member of . Every such minimal set is irreducible.
Proof. Consider the closed subsets of meeting every member of . For a nonempty descending chain in this collection, suppose that misses some . Then
The union belongs to , and the open complements form a directed family. Scott openness gives for some , a contradiction. Zorn’s lemma therefore gives a minimal member .
If for closed sets and neither contains , both and are proper closed subsets of . There are with . But then , contradicting .
Irreducible sets and families
The Smyth power space is the set equipped with the upper Vietoris topology, whose basic open sets are
Its specialization order is reverse inclusion. For a nonempty family , extend the notation by putting
The role of irreducibility is described by the following standard fact [5 Lemma 2.23 and Remark 2.24].
Lemma 2.4. Let . The set is a nonempty Scott-open upper set that does not contain . It is a filter if and only if is irreducible in . Moreover,
Proof. For each , Lemma 2.2 shows that is Scott-open in . Hence their union is a Scott-open upper set. It contains and does not contain , because and all its members are nonempty.
We next characterize closure under finite intersections. Suppose first that is irreducible in , and let . Then meets both and . By irreducibility, it meets
Consequently, some is contained in , so . Thus is a filter.
Conversely, suppose that is a filter. Let be open subsets of that meet . Since the sets , , form a base for the upper Vietoris topology, there exist such that
Thus , and the filter property gives . Hence meets . This proves that is irreducible in .
Using for each saturated , we obtain
Finally, for every , the open set meets if and only if it meets . By the definition of , this gives the second identity in (5).
The following combines the classical Hofmann–Mislove theorem with its irreducible-set and Smyth-power formulations; see [2, 3], [4 Theorems 3.6 and 5.7], and [7 Corollaries 4.3 and 4.4].
Theorem 2.5. For a -space , the following conditions are equivalent.
(1) is sober.
(2) Every proper Scott-open filter on is for some .
(3) For every irreducible subset , there exists such that .
(4) For every irreducible subset , there exists such that .
In (3) and (4), one may equivalently restrict the respective test sets to irreducible closed sets. Each representation may equivalently be written as recovery from the intersection of the filter; the representing set is unique.
Proof. The equivalence of (1) and (2) is the classical Hofmann–Mislove theorem. Condition (2) implies (3) and, by Lemma 2.4, (4). Conversely, suppose (3), fix an irreducible , and write . The set meets , since otherwise the open set would belong to . Choose . Every open neighbourhood of every meets and hence contains , so it contains . Thus ; the reverse inclusion follows from . This proves (1).
For (4)(3), the map , , is continuous because . Consequently is irreducible and
Finally, and the second identity in (5) justify the closed-set restrictions. The assertions about recovery and uniqueness follow from Lemma 2.2.
Filtered compact families and countable open bases
A nonempty family is filtered if for some satisfies . Such a family is irreducible in and therefore induces the proper Scott-open filter in (2.3). Recall that is well-filtered if, for every such family and every ,
Restricting to countable filtered families gives -well-filteredness [6].
Proposition 2.6 (The well-filtered versions). Let be a -space.
(1) is well-filtered if and only if, for every nonempty filtered family , .
(2) is -well-filtered if and only if the same equality holds for every nonempty countable filtered family .
In either assertion, the equality implies that is nonempty, compact and saturated. Equivalently, one may require the existence of with . In (2), it suffices to test descending sequences in .
Proof. For a filtered , equation (6) says precisely that an open set containing belongs to . The reverse inclusion is automatic. Apply Lemmas 2.2 and 2.4 to obtain all the representation assertions. This is the filter form of well-filteredness in [4 Theorem 3.11], with the same argument for its countable version.
If is filtered, choose and recursively choose with . Then is a decreasing cofinal subset. It has the same intersection and induces the same filter as . This also proves the final assertion; compare [6 Definition 3.9 and Proposition 3.10].
Definition 2.7. For a nonempty filtered family , put
The space satisfies if, for every such countable family for which is Scott-open, there exists such that . Here “c” stands for countable and “o” for open.
The Scott-open requirement in Definition 2.7 is an additional hypothesis. In contrast, for filtered compact saturated families the induced filter is automatically Scott-open. The same cofinal-sequence argument as above allows to be replaced by a decreasing sequence of nonempty open sets. Hence is exactly representation for proper Scott-open filters with countable open bases.
Remark 2.8 (The scope of Goubault-Larrecq’s theorem). Goubault-Larrecq [1 Theorem 1 and subsequent remark] permits descending nonempty subsets , not necessarily open, as generators:
Whenever is Scott-open, his result represents it under -well-filteredness. Taking the open gives -well-filteredness .
Requiring representation for all such Scott-open filters with arbitrary subset generators is in fact equivalent to -well-filteredness: the converse follows by taking and applying Proposition 2.6. Thus is specifically the open-generator case of the result.
Irreducible subset systems and the two -versions
We use the irreducible subset systems of [5]; their Hofmann–Mislove formulation is developed in [4]. Here is the category of -spaces and continuous maps, and is the category of sets and maps.
Definition 2.9. An irreducible subset system is a functor such that, for each space ,
and, for every continuous map , the map is given by . A member of is called an -set. Put
A closed -set means a member of . The space is -sober if every has for a unique . It is super -sober if is -sober.
The use of matters: it consists of closures of -sets, rather than just those members of that happen to be closed. The two filter classes below consist of proper Scott-open filters, by (1) and Lemma 2.4. We first state the point-induced formulation of [4 Theorems 3.6 and 5.7].
Theorem 2.10 (The point-induced -version). Let be an irreducible subset system. For a -space , the following conditions are equivalent.
is -sober.
For every , .
For every , the set belongs to and .
For every , there exists such that .
The representing set is unique and equals , where . The same equivalences hold with the test sets taken from .
Proof. If is -sober, equation (2) gives (4). Conversely, suppose (4), fix , and write . Since , there is . Every open neighbourhood of any meets , belongs to , and therefore contains . Thus . The reverse inclusion follows from , and uniqueness follows from . This proves (1).
Lemma 2.2 gives the equivalence of (2), (3) and (4), as well as uniqueness of the representing set. Equation (2) identifies it as . Finally, gives the formulation using . ∎
The second formulation concerns -sets of the Smyth power space. It is the filter representation form of [5 Theorem 5.5].
Theorem 2.11 (The Smyth -version). Let be an irreducible subset system. For a -space , the following conditions are equivalent.
is -sober, that is, is super -sober.
For every , .
For every , the set belongs to and .
For every , there exists such that .
The representing set is unique and equals . Equivalently, the test families may be taken from .
Proof. For , and ,
Since the sets form a base, it follows that
This proves (1)(4). The filter is proper and Scott-open, and , by Lemma 2.4. Lemma 2.2 therefore gives the remaining equivalences and uniqueness. The second identity in (5) gives the formulation using .
These two classes are related by the continuous map
Functoriality gives for , and . Consequently,
In particular, super -sobriety always implies -sobriety. The class on the right also contains every with , by taking .
Property and countable restrictions
Property was introduced in [5 Definition 5.10]. We use its local form from [4 Definition 6.2].
Definition 2.12. An irreducible subset system has property for if, whenever and a closed set meets every , there exists such that
It has property if it has property for every -space.
The following exact comparison is [4 Theorem 6.4]. We include a proof to exhibit how the two filter representations enter the argument.
Theorem 2.13 (The property- comparison). Let be an irreducible subset system and a -space. Then
In particular, if has property , the representation properties in Theorems 2.10 and 2.11 are equivalent for every -space.
Proof. Suppose that is -sober. Equation (9) and the two representation theorems show that is -sober. Let and be as in Definition 2.12. Theorem 2.11 gives and . If , then , so some misses , a contradiction. Choose . The closed set is contained in and meets every , proving property for .
Conversely, suppose that is -sober and has property for . Let and suppose that for an open set . If no is contained in , the closed set meets every . Property gives , contained in , that still meets every . By -sobriety, for some . Each saturated meeting contains . Hence , a contradiction. We have proved ; the opposite inclusion is automatic. Apply Theorem 2.11.
Definition 2.14 (Countable restriction). For an irreducible subset system , define
This is again an irreducible subset system, since direct images preserve countability. Its closed-set family is
In particular, writing for all nonempty irreducible subsets of , its countable restriction is
Thus consists of closures of countable -sets; its members need not themselves be countable. In particular,
Applying Theorems 2.10 and 2.11 to gives the two countable -versions: the point-induced filters characterize -sobriety of , and the Smyth-induced filters characterize -sobriety of . Theorem 2.13 compares them when has property for . For this property will be proved in Lemma 3.5.
For a countable family , the countability condition concerns the number of compact saturated members of . Each such member may be uncountable, and the induced Scott-open filter need not have a countable open base.
An enlarged class of Scott-open filters
Definition 3.1. A proper filter is countably generated, or countably based, if there are , , such that
The base may equivalently be required to be a countable filtered family of nonempty open sets. Indeed, finite intersections give a decreasing base; conversely, from a countable filtered open base one can choose a decreasing cofinal sequence of its members. Thus we may assume . These sets form a base of the filter, not necessarily a base of the topology of .
Let denote the family of proper Scott-open filters on having a countable open base, where the subscript “cb” stands for “countably based”. We define the enlarged class
Every member of is a proper Scott-open filter. Members of the second subfamily need not have countable open bases.
By Theorem 2.10, applied to , -sobriety is already equivalent to compact saturated representation of all filters induced by countable irreducible subsets of . The next theorem shows that adjoining to this test class preserves the equivalence. Its additional assertion is that -sobriety also represents every proper Scott-open filter having a countable open base. In general, the filters cannot be omitted: representation for alone is strictly weaker, as Remark 3.4 and Example 5.3 explain.
Theorem 3.2 (A countable version of the Hofmann–Mislove theorem). For a -space , the following conditions are equivalent:
is -sober.
For every , .
For every , the set is nonempty, compact and saturated, and .
For every , there exists a nonempty compact saturated subset of such that .
The representing set in (4) is unique and equals . For , it is , where is the unique point satisfying .
Proof. We first prove (1)(4). Suppose that is -sober and , with a countable open base . Let . Every member of meets : otherwise it would be contained in , forcing . Apply Lemma 2.3 to obtain a minimal irreducible closed set meeting every member of .
Choose and put . The closed set still meets every member of , because every member contains some . Minimality gives . Thus is an irreducible closed set with a countable dense subset. By -sobriety, for some . Every meets , so it contains . Since , . Consequently an open set contains if and only if it belongs to . Lemma 2.2 supplies the required nonempty compact saturated representing set.
For the other subfamily in (3.2), let be countable and irreducible. By -sobriety, for some . Equation (2) gives , proving (4) for every member of .
The implication (4)(2) follows from for saturated . The implication (2)(3) is Lemma 2.2, and (3)(4) is immediate.
Finally, (2) applied to the filters induced by countable irreducible subsets is condition (2) of Theorem 2.10 for . That theorem gives -sobriety and hence (1). Uniqueness of the representing set follows from saturation, and (2.2) gives its stated form for . □
A subset has countable outer character if its open-neighbourhood filter has a countable open base. Let consist of the members of having this property.
Corollary 3.3. If is -sober, then
is an order isomorphism, with inverse . With inclusion on both sides it is an order anti-isomorphism.
Proof. Theorem 3.2 gives the bijection and its inverse. For saturated , the equivalence follows by intersecting their open neighbourhoods. □
Remark 3.4. The restriction to is necessary: a compact saturated set need not have a countable open-neighbourhood base.
The enlargement in (12) is necessary in general for the converse in Theorem 3.2. On an uncountable set with the cofinite topology, every proper countably generated filter has the form
and is nonempty, compact and saturated. Consequently, all of conditions (2)–(4) in Theorem 3.2 hold when their test class is restricted to . Nevertheless, is not -sober. For every countably infinite , the filter has empty intersection and no countable open base. It belongs to and fails the representation condition. The details are given in Example 5.3.
If is first-countable, however, then . Indeed, for a countable irreducible subset , choose a countable base of open neighbourhoods at each . The countable family is an open base of . Thus, within the class of first-countable -spaces, representation for alone does characterize -sobriety.
We retain the usual meaning of countably generated; the whole class need not consist of countably generated filters.
The countable irreducible subset system
We now connect the enlarged-filter theorem with both general -versions. The following countable selection argument is the essential step.
Lemma 3.5. The countable irreducible subset system has property .
Proof. Let be a -space, , and let be a closed set meeting every . For a finite family, we allow repetitions in this enumeration. By Lemma 2.4,
is a proper Scott-open filter. A closed set meets every member of if and only if it meets every . Indeed, meeting each suffices, since each member of contains some . Conversely, if misses , then witnesses failure to meet every member of .
Apply Lemma 2.3 to obtain a minimal irreducible closed set meeting every . Choose and put . The closed set still meets every , so minimality gives . Since is irreducible, is irreducible. Thus and , as required by Definition 2.12.
The lemma requires the family to be countable and irreducible in ; it need not be filtered under inclusion. It proves that the closed witness has a countable dense irreducible subset, without requiring the closed witness itself to be countable.
Theorem 3.6 (The countable Smyth version). For a -space , the following conditions are equivalent.
is -sober, that is, -sober.
For every countable irreducible subset , there exists such that .
is -sober.
For every countable irreducible subset , .
For every as in (4), is nonempty, compact and saturated, and .
For every as in (4), there exists such that .
These conditions are also equivalent to the conditions of Theorem 3.2. All representing compact saturated sets are unique: in (2) the set is , where , and in (6) it is .
In (2), one may instead test irreducible closed subsets of having a countable dense subset. In (4)–(6), one may instead test irreducible closed subsets of having a countable dense subfamily.
Proof. Equation (10) and Theorem 2.10 give (1)(2). Lemma 3.5 and Theorem 2.13, applied to , give (1)(3). Theorem 2.11 gives the equivalence of (3)–(6) and identifies the representing set in (6). Theorem 2.10 identifies the set in (2). The closed-set formulations follow from the descriptions of and .
Traces on countable subspaces
A further equivalent formulation uses filters pulled back from countable subspaces. For let
where carries the subspace topology. This map preserves finite intersections and arbitrary unions. Hence, if is a proper Scott-open filter on , then
is a proper Scott-open filter on . Its membership is determined by the traces of open sets on . For irreducible , the completely prime filter from (1) is the pullback of .
Theorem 4.1. For a -space , the following conditions are equivalent.
is -sober.
For every countable subspace and every proper Scott-open filter , there exists with .
For every and as in (2), writing , one has .
For every countable irreducible subset , .
For every countable irreducible subset , .
In (2) the representing compact saturated set is unique. In (4), it is , where is the unique point with .
Proof. Assume (1), and fix a countable , a proper Scott-open , and . Let be a closed set meeting every member of . By Lemma 2.3, it contains a minimal irreducible closed set with that property.
We claim that still meets every member of . Otherwise, for some we would have
The left side belongs to , so upperness of would give , a contradiction. Thus is a closed set meeting every member of . By minimality, . The set is countable. Consequently for some , and .
We have proved the closed-set intersection property for and every closed . Its contrapositive, applied to complements of open sets, gives . Lemma 2.2 proves (2).
The implication (2)(3) follows by saturation. For (3)(4), take a countable irreducible subspace and . This is a proper completely prime filter, and its inverse image is .
Assume (4). The open set does not belong to , so it cannot contain . This proves (5).
Finally, assume (5) and choose . Every open set meeting contains . If , each open neighbourhood of meets and therefore contains . Hence , proving . The reverse inclusion follows from . Uniqueness follows from . Moreover, .
Remark 4.2
The filters in Theorem 4.1 are not required to have countable open bases. For example,
is a countable union of point-neighbourhood filters when is countable. This does not make it a countably generated filter on . The filter of all nonempty opens in Example 5.3 is an explicit instance. The completely prime formulation (4) is the case of the general approach in [4], Theorems 3.6 and 5.7.
-well-filteredness and strictness
We now compare -sobriety with the filtered-family and open-generator representation properties from § 2. Write for the nonempty directed subsets of in the specialization order, and let be its countable restriction. Both are irreducible subset systems. The -sobriety condition is the usual -space property. Its countable version, the --space property, says that the closure of every countable directed set is a point closure [5, 6].
Since the specialization order of is reverse inclusion, its directed subsets are exactly the filtered families in . Thus Proposition 2.6 is the specialization of Theorem 2.11 to and , respectively. Together with Theorems 2.5 and 3.6, this gives Table 1.
| Point-induced version ( is -sober) | Smyth version ( is -sober) | |
| Sobriety | Sobriety | |
| -space property | Well-filteredness | |
| --space property | -well-filteredness | |
| -sobriety | -sobriety |
Table 1. Specializations of the two -representation properties.
The distinction between -well-filteredness and -sobriety is therefore the distinction between testing countable filtered compact families and testing all countable irreducible subsets of .
Proposition 5.1. Every -sober space is -well-filtered.
Proof. Every nonempty countable filtered family in is a countable irreducible subset of . If is -sober, Theorem 3.6(4) gives the recovery equality for each such family. Proposition 2.6(2) now yields -well-filteredness.
With as in Definition 2.7, Theorem 3.2 and Proposition 5.1, together with the known representation theorem under -well-filteredness [1 Theorem 1 and subsequent remark], give
By Theorem 3.2, the first property is equivalent to the representation property for all filters in . Both implications in (14) are strict, as the following two examples show.
Example 5.2 (Well-filtered but not -sober). Let be a free ultrafilter on and equip with
This is a topology. Every cofinite set belongs to , so is . Two nonempty open sets have nonempty intersection, so is an irreducible closed set. It is countable and has no generic point, because point closures are singletons. Thus is not -sober.
We prove that its compact subsets are exactly the finite subsets. Suppose is infinite. Partition into two infinite pieces; at least one piece, say , does not belong to . Enumerate and put
Each is open, since . These sets increase to , but no finite subfamily covers . Hence is not compact.
Since is , its nonempty compact saturated sets are exactly the nonempty finite sets. In any filtered family of such sets, choose a member of minimal cardinality. A common refinement of and any other member must equal . Thus is contained in every member, and the intersection of the family is . This proves well-filteredness, and hence -well-filteredness. The example uses the usual existence of a free ultrafilter in ZFC.
Example 5.3 (The uncountable cofinite space). Let be an uncountable set with the cofinite topology. Every subset of is compact, since its subspace topology is cofinite. Every subset is also saturated, since is .
For a proper countably generated filter , choose a decreasing open base , where each is finite and . Put
The set is countable; hence is nonempty, compact and saturated. It is plainly . If an open set contains , its finite complement is contained in , and therefore in some . Thus and . We obtain . In fact this argument represents every proper countably generated filter, without initially assuming Scott openness. Conversely, every countable is the union of an increasing sequence of finite subsets , and is an open base of . Lemma 2.2 therefore gives
In particular, satisfies , and all of conditions (2)–(4) in Theorem 3.2 hold if the test class is replaced by .
Choose distinct and let . These are nonempty compact saturated sets, they decrease, and . Equation (6) fails for , so is not -well-filtered.
The countable set is irreducible and dense in . Its closure has no generic point, so is not -sober either. Here
is a completely prime Scott-open filter whose intersection is empty. In fact,
because every nonempty cofinite open set contains some tail . Thus this filter is induced by a countable decreasing family of compact saturated sets, although it has no countable open base. Indeed, for any proposed countable open base , a point belongs to every base member, whereas the nonempty open set contains none of them. Thus the countability of does not imply the countable generation of . In particular, witnesses failure of the enlarged representation property:
Thus the equivalent conditions in Theorem 3.2 are strictly stronger than .
This example also separates the two general -versions. Since is , every directed subset is a singleton, so is both -sober and -sober. Its failure of -well-filteredness shows that it is neither super -sober nor super -sober. By Theorem 2.13, neither nor has property for this .
Remark 5.4 (Strict weakening of sobriety). For completeness, -sobriety is itself weaker than sobriety. On an uncountable set with the countable topology, each countable subspace is closed and discrete. Consequently, every countable irreducible subset is a singleton, so the space is -sober. However, the whole space is irreducible and has no generic point. It is therefore not sober.
Scope of the countable version
The two natural classes of filters induced by an irreducible subset system encode -sobriety of and of . Their relation is given by the local property- criterion [4 Theorem 6.4]. The point-induced formulation belongs to the framework of [4 Theorems 3.6 and 5.7], and the Smyth formulation is the filter version of [5 Theorem 5.5]. Theorem 3.6 is the countable specialization obtained by proving that has property . In particular, the -sober spaces considered here are exactly the -sober spaces.
Theorem 3.2 incorporates the proper Scott-open filters with countable open bases into an exact representation characterization, by adjoining the filters induced by countable irreducible subsets. Theorem 4.1 supplies the equivalent countable-trace formulation. The Smyth formulation tests countable irreducible families of compact saturated sets; restricting those families to filtered ones gives -well-filteredness.
The examples distinguish these conditions from the open-generator property . The implication -well-filteredness is the open-generator case of [1], and both implications in (14) are strict. These distinctions keep the different roles of countability explicit throughout the representation theorems.
Declaration of generative AI and AI-assisted technologies in the manuscript preparation process
During the revision of this manuscript, ChatGPT (OpenAI) was used to assist with checking mathematical arguments, clarifying definitions and proofs, organizing the exposition, and language editing. The authors take responsibility for the content of the manuscript.
References
- [1]J. Goubault-Larrecq, Core-compact+well-filtered T₀=sober locally compact, Non-Hausdorff Topology and Domain Theory: Electronic Supplements, 20 October 2019. https://projects.lsv.ens-paris-saclay.fr/ctopology/?page_id=2067.
- [2]K. H. Hofmann and M. W. Mislove, Local compactness and continuous lattices, in Continuous Lattices, B. Banaschewski and R.-E. Hoffmann (eds.), Lecture Notes in Mathematics, vol. 871, Springer, 1981, pp. 209–248. doi:10.1007/BFb0089908.DOI
- [3]K. Keimel and J. Paseka, A direct proof of the Hofmann–Mislove theorem, Proc. Amer. Math. Soc. 120 (1994), no. 1, 301–303. doi:10.1090/S0002-9939-1994-1195723-0.
- [4]C. Shen, X. Xi, X. Xu and D. Zhao, Hofmann–Mislove type definitions of non-Hausdorff spaces, Math. Structures Comput. Sci. 32 (2022), no. 1, 111–124. doi:10.1017/S0960129522000196.DOI
- [5]X. Xu, On H-sober spaces and H-sobrifications of T₀ spaces, Topology Appl. 289 (2021), 107548. doi:10.1016/j.topol.2020.107548. Author preprint: arXiv:2003.07737.DOI
- [6]X. Xu, C. Shen, X. Xi and D. Zhao, First countability, ω-well-filtered spaces and reflections, Topology Appl. 279 (2020), 107255. doi:10.1016/j.topol.2020.107255.DOI
- [7]X. Xu, Y. Yang and X. Yang, A generalized topological Rudin lemma and sober spaces, AIMS Math. 11 (2026), no. 6, 15513–15523. doi:10.3934/math.2026638.DOI
- [8]J. Yang, Y. Luo and Z. Ye, On c-sober spaces and ω*-well-filtered spaces, Filomat 37 (2023), no. 6, 1989–1996. doi:10.2298/FIL2306989Y.DOI
- [9]J. Yang and J. Shi, Countably sober spaces, Electron. Notes Theor. Comput. Sci. 333 (2017), 143–151. doi:10.1016/j.entcs.2017.08.011.DOI