alphaFeedback

WorksMathematics

H-sober spaces and Hofmann-Mislove type theorems

AI contributions
  • ChatGPT · OpenAI
View details

Abstract

A T0T_0-space is called ωω-sober if every irreducible closed subset having a countable dense subset is the closure of a unique point. This is precisely HH-sobriety for the countable irreducible subset system Rω\mathcal R^ω. We give two natural Hofmann–Mislove representations in the general HH-sobriety framework: filters induced by HH-sets of XX characterize HH-sobriety, whereas filters induced by HH-sets of the Smyth power space characterize super HH-sobriety. Their relation is expressed by property QQ. A minimal closed set argument with a countable selection proves that Rω\mathcal R^ω has property QQ. Consequently, XX 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 T0T_0-space XX, an open filter means a Scott-open filter on the open-set lattice O(X)\mathcal{O}(X). A filter on O(X)\mathcal{O}(X) is countably generated if it is generated by countably many open members of the filter. The notion of ω\omega-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 Rω\mathcal{R}^{\omega}-sobriety [5], where

Rω(X)={A⊆X:A is countable, nonempty and irreducible}.\mathcal{R}^{\omega}(X)=\{A\subseteq X:A\text{ is countable, nonempty and irreducible}\}.

Thus ω\omega-sobriety is a special case of HH-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 HH. The first consists of FA={U∈O(X):U∩A≠∅}\mathcal{F}_A=\{U\in\mathcal{O}(X):U\cap A\ne\varnothing\} for A∈H(X)A\in H(X). The second consists of ΦX(A)=⋃G∈AΦX(G)\Phi_X(\mathcal{A})=\bigcup_{G\in\mathcal{A}}\Phi_X(G) for A∈H(PS(X))\mathcal{A}\in H(\mathcal{P}_{S}(X)), where PS(X)\mathcal{P}_{S}(X) is the Smyth power space of XX. Their representation properties characterize,

Email addresses: [email protected] (Xiaoquan Xu), [email protected] (Xinjie Huang) respectively, HH-sobriety of XX and HH-sobriety of PS(X)\mathcal{P}_{S}(X) (Theorems 2.10 and 2.11). These are filter formulations of the existing HH-sobriety and super HH-sobriety framework [4 Theorems 3.6 and 5.7], [5 Theorem 5.5]. The local property-QQ criterion [4 Theorem 6.4] explains when the two conditions coincide.

For an arbitrary HH, its restriction HωH^\omega to countable members is again an irreducible subset system, so both representation theorems apply. For Rω\mathcal{R}^{\omega} we prove property QQ directly, using a minimal closed set and one chosen point from each member of a countable irreducible family in PS(X)\mathcal{P}_{S}(X) (Lemma 3.5). This gives

X is ω-sober⟺PS(X) is ω-sober.X\text{ is }\omega\text{-sober}\quad\Longleftrightarrow\quad\mathcal{P}_{S}(X)\text{ is }\omega\text{-sober}.

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 ω\omega-sobriety. Indeed, it already holds in every ω\omega-well-filtered space by the theorem of Goubault-Larrecq [1 Theorem 1 and the following remark]. We denote this open-generator representation property by HcoH_{\mathrm{co}}, 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 FA\mathcal{F}_{A} induced by countable irreducible subsets already characterize ω\omega-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 Fω(X)\mathcal{F}_{\omega}(X) 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 ω\omega-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 ω\omega-well-filtered versions are compared through their inducing families. The examples establish that both implications ω\omega-sobriety ⇒\Rightarrow ω\omega-well-filteredness ⇒\Rightarrow HcoH_{\mathrm{co}} 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 T0T_{0}, and “countable” includes finite. We write N={1,2,…}\mathbb{N}=\{1,2,\ldots\}. For a space XX, let O(X)\mathcal{O}(X) denote its lattice of open subsets, ordered by inclusion, and write A‾\overline{A} for the closure of A⊆XA\subseteq X.

A nonempty subset AA of XX is irreducible if, whenever A⊆C1∪C2A\subseteq C_{1}\cup C_{2} for closed subsets C1,C2C_{1},C_{2} of XX, one has A⊆C1A\subseteq C_{1} or A⊆C2A\subseteq C_{2}. Equivalently, for all U,V∈O(X)U,V\in\mathcal{O}(X),

A∩U≠∅ and A∩V≠∅⟹A∩U∩V≠∅.A\cap U\ne\varnothing\ \text{and}\ A\cap V\ne\varnothing\quad\Longrightarrow\quad A\cap U\cap V\ne\varnothing.

A subset is irreducible if and only if its closure is irreducible. A point xx is a generic point of a closed set CC if C={x}‾C=\overline{\{x\}}. The space XX is sober if every irreducible closed subset has a unique generic point.

The specialization order is

x≤Xy⟺x∈{y}‾.x\leq_X y\quad\Longleftrightarrow\quad x\in\overline{\{y\}}.

For A⊆XA\subseteq X, put

↑A={y∈X:a≤Xy for some a∈A},↑x=↑{x}.\uparrow A=\{y\in X:a\leq_X y\text{ for some }a\in A\},\qquad\uparrow x=\uparrow\{x\}.

The saturation of AA is the intersection of all open sets containing AA; it equals ↑A\uparrow A. 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 {x}‾\overline{\{x\}}, then it contains xx.

A subset K⊆XK\subseteq X is compact if every open cover of KK has a finite subcover; no separation assumption is included. We write Q(X)\mathcal{Q}(X) for the collection of nonempty compact saturated subsets of XX.

Definition 2.1. A space XX is ω\omega-sober if every irreducible closed subset AA for which

A=D‾A = \overline{D}

for some countable D⊆XD \subseteq X is {x}\{x\} for a unique x∈Xx \in X.

Equivalently, for every countable irreducible subset DD of XX there is a unique xx with D‾={x}‾\overline{D} = \overline{\{x\}}. This follows because a subset is irreducible if and only if its closure is irreducible. Uniqueness follows from the T0T_0 assumption. On a countable space, ω\omega-sobriety is exactly sobriety. In particular, Definition 2.1 is the HH-sobriety condition for the countable irreducible subset system Rω\mathcal{R}^{\omega}; the general definitions are given below.

A nonempty subset DD of a poset is directed if every pair of its members has an upper bound in DD. 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 F⊆O(X)\mathcal{F} \subseteq\mathcal{O}(X) is a nonempty upper set closed under finite intersections and not containing ∅\varnothing. It is Scott-open if, for every nonempty directed family {Ui:i∈I}⊆O(X)\{U_i : i \in I\} \subseteq\mathcal{O}(X),

⋃i∈IUi∈F⟹Ui∈F for some i∈I.\bigcup_{i \in I} U_i \in\mathcal{F} \quad\Longrightarrow\quad U_i \in\mathcal{F}\ \text{for some } i \in I.

For a subset K⊆XK \subseteq X, put

ΦX(K)={U∈O(X):K⊆U}.\Phi_X(K) = \{U \in\mathcal{O}(X) : K \subseteq U\}.

For a nonempty irreducible subset A⊆XA \subseteq X, define

FA={U∈O(X):A∩U≠∅}.(1)\mathcal{F}_A = \{U \in\mathcal{O}(X) : A \cap U \ne\varnothing\}. \tag*{(1)}

Irreducibility makes FA\mathcal{F}_A a proper filter. It is completely prime: if an arbitrary union belongs to FA\mathcal{F}_A, some member of that union belongs to FA\mathcal{F}_A. In particular, FA\mathcal{F}_A is Scott-open. If A={x}A = \{x\}, then

FA={U∈O(X):x∈U}=ΦX(↑x).(2)\mathcal{F}_A = \{U \in\mathcal{O}(X) : x \in U\} = \Phi_X(\mathord{\uparrow} x). \tag*{(2)}

The set ↑x\mathord{\uparrow} x is always nonempty, compact and saturated: any open set containing xx contains all of ↑x\mathord{\uparrow} x.

Lemma 2.2. If K∈Q(X)K \in Q(X), then ΦX(K)\Phi_X(K) is a proper Scott-open filter, and K=⋂ΦX(K)K = \bigcap\Phi_X(K). Conversely, if a proper Scott-open filter F\mathcal{F} satisfies

F=ΦX(⋂F),\mathcal{F} = \Phi_X\left(\bigcap\mathcal{F}\right),

then ⋂F\bigcap\mathcal{F} is a nonempty compact saturated set. Thus a compact saturated set representing F\mathcal{F} 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 K=⋂ΦX(K)K = \bigcap\Phi_X(K).

Conversely, write K=⋂FK = \bigcap\mathcal{F}. It is saturated, and properness and the displayed equality imply K≠∅K \ne\varnothing. Given an open cover of KK, its union belongs to F\mathcal{F}. The finite unions of members of the cover form a directed family, so Scott openness gives a finite union in F\mathcal{F}. That finite union contains KK.

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 XX be a T0T_0-space and F\mathcal{F} a proper Scott-open filter on O(X)\mathcal{O}(X), and let CC be a closed subset of XX meeting every member of F\mathcal{F}. There exists a closed set A⊆CA \subseteq C minimal among the closed sets meeting every member of F\mathcal{F}. Every such minimal set is irreducible.

Proof. Consider the closed subsets of CC meeting every member of F\mathcal{F}. For a nonempty descending chain {Ci:i∈I}\{C_i : i \in I\} in this collection, suppose that ⋂i∈ICi\bigcap_{i \in I} C_i misses some U∈FU \in\mathcal{F}. Then

U⊆⋃i∈I(X∖Ci).(3)U \subseteq\bigcup_{i \in I} (X \setminus C_i). \tag*{(3)}

The union belongs to F\mathcal{F}, and the open complements form a directed family. Scott openness gives X∖Ci∈FX \setminus C_i \in\mathcal{F} for some ii, a contradiction. Zorn’s lemma therefore gives a minimal member AA.

If A⊆C1∪C2A \subseteq C_1 \cup C_2 for closed sets C1,C2C_1,C_2 and neither contains AA, both A∩C1A \cap C_1 and A∩C2A \cap C_2 are proper closed subsets of AA. There are U1,U2∈FU_1,U_2 \in\mathcal{F} with A∩Ci∩Ui=∅A \cap C_i \cap U_i = \varnothing. But then A∩U1∩U2=∅A \cap U_1 \cap U_2 = \varnothing, contradicting U1∩U2∈FU_1 \cap U_2 \in\mathcal{F}.

Irreducible sets and families

The Smyth power space PS(X)P_S(X) is the set Q(X)Q(X) equipped with the upper Vietoris topology, whose basic open sets are

□U={G∈Q(X):G⊆U},U∈O(X).\Box U = \{G \in Q(X) : G \subseteq U\},\quad U \in\mathcal{O}(X).

Its specialization order is reverse inclusion. For a nonempty family A⊆Q(X)\mathcal{A} \subseteq Q(X), extend the notation ΦX\Phi_X by putting

ΦX(A)=⋃G∈AΦX(G)={U∈O(X):G⊆U for some G∈A}.(4)\Phi_X(\mathcal{A}) = \bigcup_{G \in\mathcal{A}} \Phi_X(G) = \{U \in\mathcal{O}(X) : G \subseteq U \text{ for some } G \in\mathcal{A}\}. \tag*{(4)}

The role of irreducibility is described by the following standard fact [5 Lemma 2.23 and Remark 2.24].

Lemma 2.4. Let ∅≠A⊆Q(X)\varnothing\ne\mathcal{A} \subseteq Q(X). The set ΦX(A)\Phi_X(\mathcal{A}) is a nonempty Scott-open upper set that does not contain ∅\varnothing. It is a filter if and only if A\mathcal{A} is irreducible in PS(X)P_S(X). Moreover,

⋂ΦX(A)=⋂A,ΦX(A)=ΦX(A‾PS(X)).(5)\bigcap\Phi_X(\mathcal{A}) = \bigcap\mathcal{A},\quad\Phi_X(\mathcal{A}) = \Phi_X\left(\overline{\mathcal{A}}^{P_S(X)}\right). \tag*{(5)}

Proof. For each G∈AG \in\mathcal{A}, Lemma 2.2 shows that ΦX(G)\Phi_X(G) is Scott-open in O(X)\mathcal{O}(X). Hence their union ΦX(A)\Phi_X(\mathcal{A}) is a Scott-open upper set. It contains XX and does not contain ∅\varnothing, because A\mathcal{A} and all its members are nonempty.

We next characterize closure under finite intersections. Suppose first that A\mathcal{A} is irreducible in PS(X)P_S(X), and let U,V∈ΦX(A)U,V \in\Phi_X(\mathcal{A}). Then A\mathcal{A} meets both □U\Box U and □V\Box V. By irreducibility, it meets

□U∩□V=□(U∩V).\Box U \cap\Box V = \Box(U \cap V).

Consequently, some G∈AG \in\mathcal{A} is contained in U∩VU \cap V, so U∩V∈ΦX(A)U \cap V \in\Phi_X(\mathcal{A}). Thus ΦX(A)\Phi_X(\mathcal{A}) is a filter.

Conversely, suppose that ΦX(A)\Phi_X(\mathcal{A}) is a filter. Let V1,V2V_1,V_2 be open subsets of PS(X)P_S(X) that meet A\mathcal{A}. Since the sets □U\Box U, U∈O(X)U \in\mathcal{O}(X), form a base for the upper Vietoris topology, there exist U1,U2∈O(X)U_1,U_2 \in\mathcal{O}(X) such that

A∩□Ui≠∅,□Ui⊆Vi(i=1,2).\mathcal{A} \cap\Box U_i \ne\varnothing,\quad\Box U_i \subseteq V_i\quad(i = 1,2).

Thus U1,U2∈ΦX(A)U_1,U_2 \in\Phi_X(\mathcal{A}), and the filter property gives U1∩U2∈ΦX(A)U_1 \cap U_2 \in\Phi_X(\mathcal{A}). Hence A\mathcal{A} meets □(U1∩U2)⊆V1∩V2\Box(U_1 \cap U_2) \subseteq V_1 \cap V_2. This proves that A\mathcal{A} is irreducible in PS(X)P_S(X).

Using G=⋂ΦX(G)G = \bigcap\Phi_X(G) for each saturated GG, we obtain

⋂ΦX(A)=⋂G∈A⋂ΦX(G)=⋂G∈AG=⋂A.\bigcap\Phi_X(\mathcal{A}) = \bigcap_{G \in\mathcal{A}} \bigcap\Phi_X(G) = \bigcap_{G \in\mathcal{A}} G = \bigcap\mathcal{A}.

Finally, for every U∈O(X)U \in\mathcal{O}(X), the open set □U\Box U meets A\mathcal{A} if and only if it meets A‾PS(X)\overline{\mathcal{A}}^{P_S(X)}. By the definition of ΦX\Phi_X, 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 T0T_0-space XX, the following conditions are equivalent.

(1) XX is sober.

(2) Every proper Scott-open filter on O(X)\mathcal{O}(X) is ΦX(K)\Phi_X(K) for some K∈Q(X)K \in Q(X).

(3) For every irreducible subset A⊆XA \subseteq X, there exists K∈Q(X)K \in\mathcal{Q}(X) such that FA=ΦX(K)\mathcal{F}_A = \Phi_X(K).

(4) For every irreducible subset A⊆PS(X)A \subseteq P_S(X), there exists K∈Q(X)K \in\mathcal{Q}(X) such that ΦX(A)=ΦX(K)\Phi_X(A) = \Phi_X(K).

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 AA, and write FA=ΦX(K)\mathcal{F}_A = \Phi_X(K). The set KK meets C=A‾C = \overline{A}, since otherwise the open set X∖CX \setminus C would belong to FA\mathcal{F}_A. Choose x∈K∩Cx \in K \cap C. Every open neighbourhood of every y∈Cy \in C meets AA and hence contains KK, so it contains xx. Thus C⊆{x}C \subseteq\{x\}; the reverse inclusion follows from x∈Cx \in C. This proves (1).

For (4)⇒\Rightarrow(3), the map ηX:X→PS(X)\eta_X : X \to P_S(X), x↦↑xx \mapsto\uparrow x, is continuous because ηX−1(□U)=U\eta_X^{-1}(\Box U) = U. Consequently ηX(A)\eta_X(A) is irreducible and

ΦX(ηX(A))=⋃a∈AΦX(↑a)=FA.\Phi_X(\eta_X(A)) = \bigcup_{a \in A} \Phi_X(\uparrow a) = \mathcal{F}_A.

Finally, FA=FA‾\mathcal{F}_A = \overline{\mathcal{F}_A} 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 K⊆Q(X)\mathcal{K} \subseteq\mathcal{Q}(X) is filtered if for G,H∈KG,H \in\mathcal{K} some L∈KL \in\mathcal{K} satisfies L⊆G∩HL \subseteq G \cap H. Such a family is irreducible in PS(X)P_S(X) and therefore induces the proper Scott-open filter in (2.3). Recall that XX is well-filtered if, for every such family and every U∈O(X)U \in\mathcal{O}(X),

⋂K⊆U⟹G⊆U for some G∈K.(6)\bigcap\mathcal{K} \subseteq U \Longrightarrow G \subseteq U \text{ for some } G \in\mathcal{K}. \tag*{(6)}

Restricting to countable filtered families gives ω\omega-well-filteredness [6].

Proposition 2.6 (The well-filtered versions). Let XX be a T0T_0-space.

(1) XX is well-filtered if and only if, for every nonempty filtered family K⊆Q(X)\mathcal{K} \subseteq\mathcal{Q}(X), ΦX(K)=ΦX(⋂K)\Phi_X(\mathcal{K}) = \Phi_X(\bigcap\mathcal{K}).

(2) XX is ω\omega-well-filtered if and only if the same equality holds for every nonempty countable filtered family K⊆Q(X)\mathcal{K} \subseteq\mathcal{Q}(X).

In either assertion, the equality implies that ⋂K\bigcap\mathcal{K} is nonempty, compact and saturated. Equivalently, one may require the existence of K∈Q(X)K \in\mathcal{Q}(X) with ΦX(K)=ΦX(K)\Phi_X(\mathcal{K}) = \Phi_X(K). In (2), it suffices to test descending sequences in Q(X)\mathcal{Q}(X).

Proof. For a filtered K\mathcal{K}, equation (6) says precisely that an open set containing ⋂K\bigcap\mathcal{K} belongs to ΦX(K)\Phi_X(\mathcal{K}). 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 K={Gn:n∈N}\mathcal{K} = \{G_n : n \in\mathbb{N}\} is filtered, choose K1=G1K_1 = G_1 and recursively choose Kn+1∈KK_{n+1} \in\mathcal{K} with Kn+1⊆Kn∩Gn+1K_{n+1} \subseteq K_n \cap G_{n+1}. Then {Kn}\{K_n\} is a decreasing cofinal subset. It has the same intersection and induces the same filter as K\mathcal{K}. This also proves the final assertion; compare [6 Definition 3.9 and Proposition 3.10].

Definition 2.7. For a nonempty filtered family U⊆O(X)∖{∅}\mathcal{U} \subseteq\mathcal{O}(X) \setminus\{\varnothing\}, put

ΨX(U)=⋃U∈U↑O(X)U={V∈O(X):U⊆V for some U∈U}.(7)\Psi_X(\mathcal{U}) = \bigcup_{U \in\mathcal{U}} \uparrow_{\mathcal{O}(X)} U = \{V \in\mathcal{O}(X) : U \subseteq V \text{ for some } U \in\mathcal{U}\}. \tag*{(7)}

The space XX satisfies (Hco)(H_{\mathrm{co}}) if, for every such countable family U\mathcal{U} for which ΨX(U)\Psi_X(\mathcal{U}) is Scott-open, there exists K∈Q(X)K \in\mathcal{Q}(X) such that ΨX(U)=ΦX(K)\Psi_X(\mathcal{U}) = \Phi_X(K). 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 U\mathcal{U} to be replaced by a decreasing sequence of nonempty open sets. Hence Hco\mathrm{H}_{\mathrm{co}} 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 B1⊇B2⊇⋯B_1 \supseteq B_2 \supseteq\cdots, not necessarily open, as generators:

G=⋃nΦX(Bn)={U∈O(X):Bn⊆U for some n}.\mathcal{G}=\bigcup_{n}\Phi_X(B_n)=\{U\in\mathcal{O}(X):B_n\subseteq U\text{ for some }n\}.

Whenever G\mathcal{G} is Scott-open, his result represents it under ω\omega-well-filteredness. Taking the BnB_n open gives ω\omega-well-filteredness ⇒Hco\Rightarrow\mathrm{H}_{\mathrm{co}}.

Requiring representation for all such Scott-open filters with arbitrary subset generators is in fact equivalent to ω\omega-well-filteredness: the converse follows by taking Bn=Kn∈Q(X)B_n=K_n\in\mathcal{Q}(X) and applying Proposition 2.6. Thus Hco\mathrm{H}_{\mathrm{co}} is specifically the open-generator case of the result.

Irreducible subset systems and the two HH-versions

We use the irreducible subset systems of [5]; their Hofmann–Mislove formulation is developed in [4]. Here Top0\mathbf{Top}_0 is the category of T0T_0-spaces and continuous maps, and Set\mathbf{Set} is the category of sets and maps.

Definition 2.9. An irreducible subset system is a functor H:Top0→SetH:\mathbf{Top}_0\to\mathbf{Set} such that, for each space XX,

{{x}:x∈X}⊆H(X)⊆{A⊆X:A is nonempty and irreducible}.\{\{x\}:x\in X\}\subseteq H(X)\subseteq\{A\subseteq X:A\text{ is nonempty and irreducible}\}.

and, for every continuous map f:X→Yf:X\to Y, the map H(f)H(f) is given by H(f)(A)=f(A)H(f)(A)=f(A). A member of H(X)H(X) is called an HH-set. Put

Hc(X)={A‾:A∈H(X)}.H_c(X)=\{\overline{A}:A\in H(X)\}.

A closed HH-set means a member of Hc(X)H_c(X). The space XX is HH-sober if every A∈H(X)A\in H(X) has A‾={x‾}\overline{A}=\{\overline{x}\} for a unique x∈Xx\in X. It is super HH-sober if PS(X)P_S(X) is HH-sober.

The use of Hc(X)H_c(X) matters: it consists of closures of HH-sets, rather than just those members of H(X)H(X) 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 HH-version). Let HH be an irreducible subset system. For a T0T_0-space XX, the following conditions are equivalent.

  1. XX is HH-sober.

  1. For every A∈H(X)A\in H(X), FA=ΦX(⋂FA)\mathcal{F}_A=\Phi_X(\bigcap\mathcal{F}_A).

  1. For every A∈H(X)A\in H(X), the set ⋂FA\bigcap\mathcal{F}_A belongs to Q(X)\mathcal{Q}(X) and FA=ΦX(⋂FA)\mathcal{F}_A=\Phi_X(\bigcap\mathcal{F}_A).

  1. For every A∈H(X)A\in H(X), there exists K∈Q(X)K\in\mathcal{Q}(X) such that FA=ΦX(K)\mathcal{F}_A=\Phi_X(K).

The representing set is unique and equals ⋂FA=↑x\bigcap\mathcal{F}_A=\mathord{\uparrow}x, where A‾={x‾}\overline{A}=\{\overline{x}\}. The same equivalences hold with the test sets taken from Hc(X)H_c(X).

Proof. If XX is HH-sober, equation (2) gives (4). Conversely, suppose (4), fix A∈H(X)A\in H(X), and write FA=ΦX(K)\mathcal{F}_A=\Phi_X(K). Since X∖A‾∉FAX\setminus\overline{A}\notin\mathcal{F}_A, there is x∈K∩A‾x\in K\cap\overline{A}. Every open neighbourhood of any y∈A‾y\in\overline{A} meets AA, belongs to FA\mathcal{F}_A, and therefore contains xx. Thus A‾⊆{x‾}\overline{A}\subseteq\{\overline{x}\}. The reverse inclusion follows from x∈A‾x\in\overline{A}, and uniqueness follows from T0T_0. 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 ↑x\mathord{\uparrow}x. Finally, FA=FA‾\mathcal{F}_A=\mathcal{F}_{\overline{A}} gives the formulation using Hc(X)H_c(X). ∎

The second formulation concerns HH-sets of the Smyth power space. It is the filter representation form of [5 Theorem 5.5].

Theorem 2.11 (The Smyth HH-version). Let HH be an irreducible subset system. For a T0T_{0}-space XX, the following conditions are equivalent.

  1. PS(X)P_{S}(X) is HH-sober, that is, XX is super HH-sober.

  2. For every A∈H(PS(X))A \in H(P_{S}(X)), ΦX(A)=ΦX(⋂A)\Phi_{X}(A) = \Phi_{X}(\bigcap A).

  3. For every A∈H(PS(X))A \in H(P_{S}(X)), the set ⋂A\bigcap A belongs to Q(X)Q(X) and ΦX(A)=ΦX(⋂A)\Phi_{X}(A) = \Phi_{X}(\bigcap A).

  4. For every A∈H(PS(X))A \in H(P_{S}(X)), there exists K∈Q(X)K \in Q(X) such that ΦX(A)=ΦX(K)\Phi_{X}(A) = \Phi_{X}(K).

The representing set is unique and equals ⋂A\bigcap A. Equivalently, the test families may be taken from Hc(PS(X))H_{c}(P_{S}(X)).

Proof. For A∈H(PS(X))A \in H(P_{S}(X)), K∈Q(X)K \in Q(X) and U∈O(X)U \in\mathcal{O}(X),

A∩□U≠∅⟺U∈ΦX(A);K∈□U⟺U∈ΦX(K).A \cap\Box U \ne\varnothing\Longleftrightarrow U \in\Phi_{X}(A);\quad K \in\Box U \Longleftrightarrow U \in\Phi_{X}(K).

Since the sets □U\Box U form a base, it follows that

ΦX(A)=ΦX(K)⟺A‾PS(X)={K}‾PS(X).(8)\Phi_{X}(A) = \Phi_{X}(K) \Longleftrightarrow\overline{A}^{P_{S}(X)} = \overline{\{K\}}^{P_{S}(X)}. \tag*{(8)}

This proves (1)⟺\Longleftrightarrow(4). The filter ΦX(A)\Phi_{X}(A) is proper and Scott-open, and ⋂ΦX(A)=⋂A\bigcap\Phi_{X}(A) = \bigcap A, by Lemma 2.4. Lemma 2.2 therefore gives the remaining equivalences and uniqueness. The second identity in (5) gives the formulation using Hc(PS(X))H_{c}(P_{S}(X)).

These two classes are related by the continuous map

ηX:X⟶PS(X),x⟼↑x,ηX−1(□U)=U.\eta_{X}: X \longrightarrow P_{S}(X),\quad x \longmapsto\uparrow x,\quad\eta_{X}^{-1}(\Box U) = U.

Functoriality gives ηX(A)∈H(PS(X))\eta_{X}(A) \in H(P_{S}(X)) for A∈H(X)A \in H(X), and ΦX(ηX(A))=FA\Phi_{X}(\eta_{X}(A)) = \mathcal{F}_{A}. Consequently,

{FA:A∈H(X)}⊆{ΦX(A):A∈H(PS(X))}.(9)\{\mathcal{F}_{A}: A \in H(X)\} \subseteq\{\Phi_{X}(A): A \in H(P_{S}(X))\}. \tag*{(9)}

In particular, super HH-sobriety always implies HH-sobriety. The class on the right also contains every ΦX(K)\Phi_{X}(K) with K∈Q(X)K \in Q(X), by taking A={K}A = \{K\}.

Property QQ and countable restrictions

Property QQ was introduced in [5 Definition 5.10]. We use its local form from [4 Definition 6.2].

Definition 2.12. An irreducible subset system HH has property QQ for XX if, whenever A∈H(PS(X))A \in H(P_{S}(X)) and a closed set C⊆XC \subseteq X meets every G∈AG \in A, there exists B∈Hc(X)B \in H_{c}(X) such that

B⊆C,B∩G≠∅ for every G∈A.B \subseteq C,\quad B \cap G \ne\varnothing\text{ for every } G \in A.

It has property QQ if it has property QQ for every T0T_{0}-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-QQ comparison). Let HH be an irreducible subset system and XX a T0T_{0}-space. Then

PS(X) is H-sober⟺{X is H-sober,H has property Q for X.P_{S}(X)\text{ is }H\text{-sober} \Longleftrightarrow \begin{cases} X\text{ is }H\text{-sober},\\ H\text{ has property }Q\text{ for }X. \end{cases}

In particular, if HH has property QQ, the representation properties in Theorems 2.10 and 2.11 are equivalent for every T0T_{0}-space.

Proof. Suppose that PS(X)P_S(X) is HH-sober. Equation (9) and the two representation theorems show that XX is HH-sober. Let A\mathcal{A} and CC be as in Definition 2.12. Theorem 2.11 gives K=⋂A∈Q(X)K = \bigcap\mathcal{A} \in Q(X) and ΦX(A)=ΦX(K)\Phi_X(\mathcal{A}) = \Phi_X(K). If C∩K=∅C \cap K = \varnothing, then X∖C∈ΦX(A)X \setminus C \in\Phi_X(\mathcal{A}), so some G∈AG \in\mathcal{A} misses CC, a contradiction. Choose x∈C∩Kx \in C \cap K. The closed set B={x}∈Hc(X)B = \{x\} \in H_c(X) is contained in CC and meets every G∈AG \in\mathcal{A}, proving property QQ for XX.

Conversely, suppose that XX is HH-sober and HH has property QQ for XX. Let A∈H(PS(X))\mathcal{A} \in H(P_S(X)) and suppose that ⋂A⊆U\bigcap\mathcal{A} \subseteq U for an open set UU. If no G∈AG \in\mathcal{A} is contained in UU, the closed set C=X∖UC = X \setminus U meets every G∈AG \in\mathcal{A}. Property QQ gives B∈Hc(X)B \in H_c(X), contained in CC, that still meets every GG. By HH-sobriety, B={x}B = \{x\} for some x∈Xx \in X. Each saturated GG meeting {x}\{x\} contains xx. Hence x∈C∩⋂Ax \in C \cap\bigcap\mathcal{A}, a contradiction. We have proved ΦX(⋂A)⊆ΦX(A)\Phi_X(\bigcap\mathcal{A}) \subseteq\Phi_X(\mathcal{A}); the opposite inclusion is automatic. Apply Theorem 2.11.

Definition 2.14 (Countable restriction). For an irreducible subset system HH, define

Hω(X)={A∈H(X):A is countable}.H^\omega(X) = \{A \in H(X) : A\text{ is countable}\}.

This is again an irreducible subset system, since direct images preserve countability. Its closed-set family is

(Hω)c(X)={A‾:A∈H(X), A is countable}.(H^\omega)_c(X) = \{\overline{A} : A \in H(X),\ A\text{ is countable}\}.

In particular, writing R(X)\mathcal{R}(X) for all nonempty irreducible subsets of XX, its countable restriction is

Rω(X)={A⊆X:A is countable, nonempty and irreducible}.\mathcal{R}^\omega(X) = \{A \subseteq X : A\text{ is countable, nonempty and irreducible}\}.

Thus (Hω)c(X)(H^\omega)_c(X) consists of closures of countable HH-sets; its members need not themselves be countable. In particular,

X is ω-sober ⟺ X is Rω-sober.(10)X\text{ is }\omega\text{-sober}\ \Longleftrightarrow\ X\text{ is }\mathcal{R}^\omega\text{-sober.} \tag*{(10)}

Applying Theorems 2.10 and 2.11 to HωH^\omega gives the two countable HH-versions: the point-induced filters characterize HωH^\omega-sobriety of XX, and the Smyth-induced filters characterize HωH^\omega-sobriety of PS(X)P_S(X). Theorem 2.13 compares them when HωH^\omega has property QQ for XX. For Rω\mathcal{R}^\omega this property will be proved in Lemma 3.5.

For a countable family A⊆PS(X)\mathcal{A} \subseteq P_S(X), the countability condition concerns the number of compact saturated members of A\mathcal{A}. 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 F⊆O(X)\mathcal{F} \subseteq\mathcal{O}(X) is countably generated, or countably based, if there are Un∈FU_n \in\mathcal{F}, n∈Nn \in\mathbb{N}, such that

F={U∈O(X):Un⊆U for some n∈N}.(11)\mathcal{F} = \{U \in\mathcal{O}(X) : U_n \subseteq U\text{ for some }n \in\mathbb{N}\}. \tag*{(11)}

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 Un+1⊆UnU_{n+1} \subseteq U_n. These sets form a base of the filter, not necessarily a base of the topology of XX.

Let OFilt⁡cb(X)\operatorname{OFilt}_{\mathrm{cb}}(X) denote the family of proper Scott-open filters on O(X)\mathcal{O}(X) having a countable open base, where the subscript “cb” stands for “countably based”. We define the enlarged class

Fω(X)=OFilt⁡cb(X)∪{FA:A⊆X is countable and irreducible}.(12)\mathcal{F}_\omega(X) = \operatorname{OFilt}_{\mathrm{cb}}(X) \cup\{\mathcal{F}_{\mathcal{A}} : \mathcal{A} \subseteq X\text{ is countable and irreducible}\}. \tag*{(12)}

Every member of Fω(X)\mathcal{F}_\omega(X) is a proper Scott-open filter. Members of the second subfamily need not have countable open bases.

By Theorem 2.10, applied to H=RωH = \mathbb{R}^{\omega}, ω\omega-sobriety is already equivalent to compact saturated representation of all filters FA\mathcal{F}_{A} induced by countable irreducible subsets AA of XX. The next theorem shows that adjoining OFilt⁡cb(X)\operatorname{OFilt}_{\mathrm{cb}}(X) to this test class preserves the equivalence. Its additional assertion is that ω\omega-sobriety also represents every proper Scott-open filter having a countable open base. In general, the filters FA\mathcal{F}_{A} cannot be omitted: representation for OFilt⁡cb(X)\operatorname{OFilt}_{\mathrm{cb}}(X) 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 T0T_{0}-space XX, the following conditions are equivalent:

  1. XX is ω\omega-sober.

  2. For every F∈Fω(X)\mathcal{F} \in\mathcal{F}_{\omega}(X), F=ΦX(⋂F)\mathcal{F} = \Phi_{X}(\bigcap\mathcal{F}).

  3. For every F∈Fω(X)\mathcal{F} \in\mathcal{F}_{\omega}(X), the set ⋂F\bigcap\mathcal{F} is nonempty, compact and saturated, and F=ΦX(⋂F)\mathcal{F} = \Phi_{X}(\bigcap\mathcal{F}).

  4. For every F∈Fω(X)\mathcal{F} \in\mathcal{F}_{\omega}(X), there exists a nonempty compact saturated subset KK of XX such that F=ΦX(K)\mathcal{F} = \Phi_{X}(K).

The representing set in (4) is unique and equals ⋂F\bigcap\mathcal{F}. For F=FA\mathcal{F} = \mathcal{F}_{A}, it is ↑x\uparrow x, where xx is the unique point satisfying A‾={x}\overline{A} = \{x\}.

Proof. We first prove (1)⇒\Rightarrow(4). Suppose that XX is ω\omega-sober and F∈OFilt⁡cb(X)\mathcal{F} \in\operatorname{OFilt}_{\mathrm{cb}}(X), with a countable open base {Un:n∈N}\{U_{n}: n \in\mathbb{N}\}. Let W∈O(X)∖FW \in\mathcal{O}(X) \setminus\mathcal{F}. Every member of F\mathcal{F} meets C=X∖WC = X \setminus W: otherwise it would be contained in WW, forcing W∈FW \in\mathcal{F}. Apply Lemma 2.3 to obtain a minimal irreducible closed set A⊆CA \subseteq C meeting every member of F\mathcal{F}.

Choose xn∈A∩Unx_{n} \in A \cap U_{n} and put D={xn:n∈N}D = \{x_{n}: n \in\mathbb{N}\}. The closed set D‾⊆A\overline{D} \subseteq A still meets every member of F\mathcal{F}, because every member contains some UnU_{n}. Minimality gives A=D‾A = \overline{D}. Thus AA is an irreducible closed set with a countable dense subset. By ω\omega-sobriety, A={x}A = \{x\} for some x∈Xx \in X. Every U∈FU \in\mathcal{F} meets AA, so it contains xx. Since x∈A⊆Cx \in A \subseteq C, x∈⋂F∖Wx \in\bigcap\mathcal{F} \setminus W. Consequently an open set contains ⋂F\bigcap\mathcal{F} if and only if it belongs to F\mathcal{F}. Lemma 2.2 supplies the required nonempty compact saturated representing set.

For the other subfamily in (3.2), let AA be countable and irreducible. By ω\omega-sobriety, A‾={x}\overline{A} = \{x\} for some x∈Xx \in X. Equation (2) gives FA=ΦX(↑x)\mathcal{F}_{A} = \Phi_{X}(\uparrow x), proving (4) for every member of Fω(X)\mathcal{F}_{\omega}(X).

The implication (4)⇒\Rightarrow(2) follows from K=⋂ΦX(K)K = \bigcap\Phi_{X}(K) for saturated KK. The implication (2)⇒\Rightarrow(3) is Lemma 2.2, and (3)⇒\Rightarrow(4) is immediate.

Finally, (2) applied to the filters FA\mathcal{F}_{A} induced by countable irreducible subsets is condition (2) of Theorem 2.10 for H=RωH = \mathbb{R}^{\omega}. That theorem gives ω\omega-sobriety and hence (1). Uniqueness of the representing set follows from saturation, and (2.2) gives its stated form for FA\mathcal{F}_{A}. □

A subset KK has countable outer character if its open-neighbourhood filter has a countable open base. Let Qco(X)Q_{\mathrm{co}}(X) consist of the members of Q(X)Q(X) having this property.

Corollary 3.3. If XX is ω\omega-sober, then

ΦX:(Qco(X),⊇)⟶(OFilt⁡cb(X),⊆)\Phi_{X} : (Q_{\mathrm{co}}(X), \supseteq) \longrightarrow(\operatorname{OFilt}_{\mathrm{cb}}(X), \subseteq)

is an order isomorphism, with inverse F↦⋂F\mathcal{F} \mapsto\bigcap\mathcal{F}. With inclusion on both sides it is an order anti-isomorphism.

Proof. Theorem 3.2 gives the bijection and its inverse. For saturated K,LK,L, the equivalence K⊇L⟺ΦX(K)⊆ΦX(L)K \supseteq L \Longleftrightarrow\Phi_{X}(K) \subseteq\Phi_{X}(L) follows by intersecting their open neighbourhoods. □

Remark 3.4. The restriction to Qco(X)Q_{\mathrm{co}}(X) 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 XX with the cofinite topology, every proper countably generated filter has the form

ΦX(X∖E),E⊆X countable,\Phi_{X}(X \setminus E),\quad E \subseteq X\ \text{countable},

and X∖EX \setminus E is nonempty, compact and saturated. Consequently, all of conditions (2)–(4) in Theorem 3.2 hold when their test class is restricted to OFilt⁡cb(X)\operatorname{OFilt}_{\mathrm{cb}}(X). Nevertheless, XX is not ω\omega-sober. For every countably infinite D⊆XD \subseteq X, the filter FD=O(X)∖{∅}\mathcal{F}_D = \mathcal{O}(X) \setminus\{\varnothing\} has empty intersection and no countable open base. It belongs to Fω(X)∖OFilt⁡cb(X)\mathcal{F}_{\omega}(X) \setminus\operatorname{OFilt}_{\mathrm{cb}}(X) and fails the representation condition. The details are given in Example 5.3.

If XX is first-countable, however, then Fω(X)=OFilt⁡cb(X)\mathcal{F}_{\omega}(X) = \operatorname{OFilt}_{\mathrm{cb}}(X). Indeed, for a countable irreducible subset A⊆XA \subseteq X, choose a countable base Ba\mathcal{B}_a of open neighbourhoods at each a∈Aa \in A. The countable family ⋃a∈ABa\bigcup_{a\in A}\mathcal{B}_a is an open base of FA\mathcal{F}_A. Thus, within the class of first-countable T0T_0-spaces, representation for OFilt⁡cb(X)\operatorname{OFilt}_{\mathrm{cb}}(X) alone does characterize ω\omega-sobriety.

We retain the usual meaning of countably generated; the whole class Fω(X)\mathcal{F}_{\omega}(X) need not consist of countably generated filters.

The countable irreducible subset system

We now connect the enlarged-filter theorem with both general HH-versions. The following countable selection argument is the essential step.

Lemma 3.5. The countable irreducible subset system Rω\mathcal{R}^{\omega} has property QQ.

Proof. Let XX be a T0T_0-space, A={Kn:n∈N}∈Rω(PS(X))A = \{K_n : n \in\mathbb{N}\} \in\mathcal{R}^{\omega}(\mathcal{P}_S(X)), and let CC be a closed set meeting every KnK_n. For a finite family, we allow repetitions in this enumeration. By Lemma 2.4,

F=ΦX(A)=⋃n∈NΦX(Kn)\mathcal{F} = \Phi_X(A) = \bigcup_{n\in\mathbb{N}} \Phi_X(K_n)

is a proper Scott-open filter. A closed set BB meets every member of F\mathcal{F} if and only if it meets every KnK_n. Indeed, meeting each KnK_n suffices, since each member of F\mathcal{F} contains some KnK_n. Conversely, if BB misses KnK_n, then X∖B∈ΦX(Kn)⊆FX \setminus B \in\Phi_X(K_n) \subseteq\mathcal{F} witnesses failure to meet every member of F\mathcal{F}.

Apply Lemma 2.3 to obtain a minimal irreducible closed set B⊆CB \subseteq C meeting every KnK_n. Choose xn∈B∩Knx_n \in B \cap K_n and put D={xn:n∈N}D = \{x_n : n \in\mathbb{N}\}. The closed set D‾⊆B\overline{D} \subseteq B still meets every KnK_n, so minimality gives B=D‾B = \overline{D}. Since BB is irreducible, DD is irreducible. Thus D∈Rω(X)D \in\mathcal{R}^{\omega}(X) and B∈(Rω)c(X)B \in(\mathcal{R}^{\omega})_c(X), as required by Definition 2.12. □\square

The lemma requires the family AA to be countable and irreducible in PS(X)\mathcal{P}_S(X); 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 T0T_0-space XX, the following conditions are equivalent.

  1. XX is ω\omega-sober, that is, Rω\mathcal{R}^{\omega}-sober.

  2. For every countable irreducible subset A⊆XA \subseteq X, there exists K∈Q(X)K \in Q(X) such that FA=ΦX(K)\mathcal{F}_A = \Phi_X(K).

  3. PS(X)\mathcal{P}_S(X) is ω\omega-sober.

  4. For every countable irreducible subset A⊆PS(X)A \subseteq\mathcal{P}_S(X), ΦX(A)=ΦX(⋂A)\Phi_X(A) = \Phi_X(\bigcap A).

  5. For every AA as in (4), ⋂A\bigcap A is nonempty, compact and saturated, and ΦX(A)=ΦX(⋂A)\Phi_X(A) = \Phi_X(\bigcap A).

  6. For every AA as in (4), there exists K∈Q(X)K \in Q(X) such that ΦX(A)=ΦX(K)\Phi_X(A) = \Phi_X(K).

These conditions are also equivalent to the conditions of Theorem 3.2. All representing compact saturated sets are unique: in (2) the set is x^\hat{x}, where A^={x^}\hat{A} = \{\hat{x}\}, and in (6) it is ⋂A\bigcap A.

In (2), one may instead test irreducible closed subsets of XX having a countable dense subset. In (4)–(6), one may instead test irreducible closed subsets of PS(X)\mathcal{P}_S(X) having a countable dense subfamily.

Proof. Equation (10) and Theorem 2.10 give (1)⇔\Leftrightarrow(2). Lemma 3.5 and Theorem 2.13, applied to H=RωH = \mathcal{R}^{\omega}, give (1)⇔\Leftrightarrow(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 (Rω)c(X)(\mathcal{R}^{\omega})_c(X) and (Rω)c(PS(X))(\mathcal{R}^{\omega})_c(\mathcal{P}_S(X)). □\square

Traces on countable subspaces

A further equivalent formulation uses filters pulled back from countable subspaces. For D⊆XD \subseteq X let

ρD:O(X)⟶O(D),ρD(U)=U∩D,\rho_D:\mathcal{O}(X) \longrightarrow\mathcal{O}(D),\qquad\rho_D(U)=U\cap D,

where DD carries the subspace topology. This map preserves finite intersections and arbitrary unions. Hence, if G\mathcal{G} is a proper Scott-open filter on O(D)\mathcal{O}(D), then

ρD−1(G)={U∈O(X):U∩D∈G}(13)\rho_D^{-1}(\mathcal{G})=\{U\in\mathcal{O}(X):U\cap D\in\mathcal{G}\} \tag*{(13)}

is a proper Scott-open filter on O(X)\mathcal{O}(X). Its membership is determined by the traces of open sets on DD. For irreducible DD, the completely prime filter FD\mathcal{F}_D from (1) is the pullback of O(D)∖{∅}\mathcal{O}(D)\setminus\{\varnothing\}.

Theorem 4.1. For a T0T_0-space XX, the following conditions are equivalent.

  1. XX is ω\omega-sober.

  1. For every countable subspace D⊆XD\subseteq X and every proper Scott-open filter G⊆O(D)\mathcal{G}\subseteq\mathcal{O}(D), there exists K∈Q(X)K\in\mathcal{Q}(X) with ρD−1(G)=ΦX(K)\rho_D^{-1}(\mathcal{G})=\Phi_X(K).

  1. For every DD and G\mathcal{G} as in (2), writing F=ρD−1(G)\mathcal{F}=\rho_D^{-1}(\mathcal{G}), one has F=ΦX(⋂F)\mathcal{F}=\Phi_X(\bigcap\mathcal{F}).

  1. For every countable irreducible subset D⊆XD\subseteq X, FD=ΦX(⋂FD)\mathcal{F}_D=\Phi_X(\bigcap\mathcal{F}_D).

  1. For every countable irreducible subset D⊆XD\subseteq X, D‾∩⋂FD≠∅\overline{D}\cap\bigcap\mathcal{F}_D\ne\varnothing.

In (2) the representing compact saturated set is unique. In (4), it is ↑x\uparrow x, where xx is the unique point with D‾={x}\overline{D}=\{x\}.

Proof. Assume (1), and fix a countable DD, a proper Scott-open G\mathcal{G}, and F=ρD−1(G)\mathcal{F}=\rho_D^{-1}(\mathcal{G}). Let CC be a closed set meeting every member of F\mathcal{F}. By Lemma 2.3, it contains a minimal irreducible closed set AA with that property.

We claim that A∩DA\cap D still meets every member of F\mathcal{F}. Otherwise, for some U∈FU\in\mathcal{F} we would have

U∩D⊆(X∖A)∩D.U\cap D\subseteq(X\setminus A)\cap D.

The left side belongs to G\mathcal{G}, so upperness of G\mathcal{G} would give X∖A∈FX\setminus A\in\mathcal{F}, a contradiction. Thus A∩D‾⊆A\overline{A\cap D}\subseteq A is a closed set meeting every member of F\mathcal{F}. By minimality, A=A∩D‾A=\overline{A\cap D}. The set A∩DA\cap D is countable. Consequently A={x}A=\{x\} for some x∈Xx\in X, and x∈C∩⋂Fx\in C\cap\bigcap\mathcal{F}.

We have proved the closed-set intersection property for F\mathcal{F} and every closed CC. Its contrapositive, applied to complements of open sets, gives F=ΦX(⋂F)\mathcal{F}=\Phi_X(\bigcap\mathcal{F}). Lemma 2.2 proves (2).

The implication (2)⇒\Rightarrow(3) follows by saturation. For (3)⇒\Rightarrow(4), take a countable irreducible subspace DD and G=O(D)∖{∅}\mathcal{G}=\mathcal{O}(D)\setminus\{\varnothing\}. This is a proper completely prime filter, and its inverse image is FD\mathcal{F}_D.

Assume (4). The open set X∖D‾X\setminus\overline{D} does not belong to FD\mathcal{F}_D, so it cannot contain ⋂FD\bigcap\mathcal{F}_D. This proves (5).

Finally, assume (5) and choose x∈D‾∩⋂FDx\in\overline{D}\cap\bigcap\mathcal{F}_D. Every open set meeting DD contains xx. If y∈D‾y\in\overline{D}, each open neighbourhood of yy meets DD and therefore contains xx. Hence y∈{x}y\in\{x\}, proving D‾⊆{x}\overline{D}\subseteq\{x\}. The reverse inclusion follows from x∈D‾x\in\overline{D}. Uniqueness follows from T0T_0. Moreover, FD={U:x∈U}=ΦX(↑x)\mathcal{F}_D=\{U:x\in U\}=\Phi_X(\uparrow x).

Remark 4.2

The filters in Theorem 4.1 are not required to have countable open bases. For example,

FD=⋃d∈D{U∈O(X):d∈U}\mathcal{F}_D=\bigcup_{d\in D}\{U\in\mathcal{O}(X):d\in U\}

is a countable union of point-neighbourhood filters when DD is countable. This does not make it a countably generated filter on O(X)\mathcal{O}(X). The filter of all nonempty opens in Example 5.3 is an explicit instance. The completely prime formulation (4) is the H=RωH=\mathbb{R}^{\omega} case of the general approach in [4], Theorems 3.6 and 5.7.

ω\omega-well-filteredness and strictness

We now compare ω\omega-sobriety with the filtered-family and open-generator representation properties from § 2. Write D(X)\mathcal{D}(X) for the nonempty directed subsets of XX in the specialization order, and let Dω\mathcal{D}^{\omega} be its countable restriction. Both are irreducible subset systems. The D\mathcal{D}-sobriety condition is the usual dd-space property. Its countable version, the ω\omega-dd-space property, says that the closure of every countable directed set is a point closure [5, 6].

Since the specialization order of PS(X)P_S(X) is reverse inclusion, its directed subsets are exactly the filtered families in Q(X)Q(X). Thus Proposition 2.6 is the specialization of Theorem 2.11 to D\mathcal{D} and Dω\mathcal{D}^{\omega}, respectively. Together with Theorems 2.5 and 3.6, this gives Table 1.

HHPoint-induced version ( XX is HH-sober)Smyth version ( PS(X)P_S(X) is HH-sober)
R\mathcal{R}SobrietySobriety
D\mathcal{D}dd-space propertyWell-filteredness
Dω\mathcal{D}^{\omega}ω\omega-dd-space propertyω\omega-well-filteredness
Rω\mathcal{R}^{\omega}ω\omega-sobrietyω\omega-sobriety

Table 1. Specializations of the two HH-representation properties.

The distinction between ω\omega-well-filteredness and ω\omega-sobriety is therefore the distinction between testing countable filtered compact families and testing all countable irreducible subsets of PS(X)P_S(X).

Proposition 5.1. Every ω\omega-sober space is ω\omega-well-filtered.

Proof. Every nonempty countable filtered family in Q(X)Q(X) is a countable irreducible subset of PS(X)P_S(X). If XX is ω\omega-sober, Theorem 3.6(4) gives the recovery equality for each such family. Proposition 2.6(2) now yields ω\omega-well-filteredness.

With HcoH_{\mathrm{co}} as in Definition 2.7, Theorem 3.2 and Proposition 5.1, together with the known representation theorem under ω\omega-well-filteredness [1 Theorem 1 and subsequent remark], give

ω-sobriety⟹ω-well-filteredness⟹Hco.(14)\omega\text{-sobriety} \Longrightarrow\omega\text{-well-filteredness} \Longrightarrow H_{\mathrm{co}}. \tag*{(14)}

By Theorem 3.2, the first property is equivalent to the representation property for all filters in Fω(X)\mathcal{F}_{\omega}(X). Both implications in (14) are strict, as the following two examples show.

Example 5.2 (Well-filtered but not ω\omega-sober). Let U\mathcal{U} be a free ultrafilter on N\mathbb{N} and equip X=NX = \mathbb{N} with

τ={∅}∪U.\tau= \{\varnothing\} \cup\mathcal{U}.

This is a topology. Every cofinite set belongs to U\mathcal{U}, so XX is T1T_1. Two nonempty open sets have nonempty intersection, so XX is an irreducible closed set. It is countable and has no generic point, because point closures are singletons. Thus XX is not ω\omega-sober.

We prove that its compact subsets are exactly the finite subsets. Suppose K⊆NK \subseteq\mathbb{N} is infinite. Partition KK into two infinite pieces; at least one piece, say BB, does not belong to U\mathcal{U}. Enumerate B={b1,b2,…}B = \{b_1,b_2,\ldots\} and put

Vn=(N∖B)∪{b1,…,bn}.V_n = (\mathbb{N} \setminus B) \cup\{b_1,\ldots,b_n\}.

Each VnV_n is open, since N∖B∈U\mathbb{N} \setminus B \in\mathcal{U}. These sets increase to XX, but no finite subfamily covers KK. Hence KK is not compact.

Since XX is T1T_1, its nonempty compact saturated sets are exactly the nonempty finite sets. In any filtered family of such sets, choose a member K0K_0 of minimal cardinality. A common refinement of K0K_0 and any other member must equal K0K_0. Thus K0K_0 is contained in every member, and the intersection of the family is K0K_0. This proves well-filteredness, and hence ω\omega-well-filteredness. The example uses the usual existence of a free ultrafilter in ZFC.

Example 5.3 (The uncountable cofinite space). Let XX be an uncountable set with the cofinite topology. Every subset of XX is compact, since its subspace topology is cofinite. Every subset is also saturated, since XX is T1T_1.

For a proper countably generated filter F\mathcal{F}, choose a decreasing open base Un=X∖EnU_n = X \setminus E_n, where each EnE_n is finite and En⊆En+1E_n \subseteq E_{n+1}. Put

E=⋃nEn,K=X∖E.E = \bigcup_n E_n,\quad K = X \setminus E.

The set EE is countable; hence KK is nonempty, compact and saturated. It is plainly ⋂F\bigcap\mathcal{F}. If an open set WW contains KK, its finite complement is contained in EE, and therefore in some EnE_n. Thus Un⊆WU_n \subseteq W and W∈FW \in\mathcal{F}. We obtain F=ΦX(K)\mathcal{F} = \Phi_X(K). In fact this argument represents every proper countably generated filter, without initially assuming Scott openness. Conversely, every countable E⊆XE \subseteq X is the union of an increasing sequence of finite subsets EnE_n, and {X∖En:n∈N}\{X \setminus E_n : n \in\mathbb{N}\} is an open base of ΦX(X∖E)\Phi_X(X \setminus E). Lemma 2.2 therefore gives

OFilt⁡cb(X)={ΦX(X∖E):E⊆X is countable}.\operatorname{OFilt}_{\mathrm{cb}}(X) = \{\Phi_X(X \setminus E) : E \subseteq X\text{ is countable}\}.

In particular, XX satisfies (Hco)(\mathrm{H}_{\mathrm{co}}), and all of conditions (2)–(4) in Theorem 3.2 hold if the test class Fω(X)\mathcal{F}_{\omega}(X) is replaced by OFilt⁡cb(X)\operatorname{OFilt}_{\mathrm{cb}}(X).

Choose distinct dn∈Xd_n \in X and let Kn={dm:m≥n}K_n = \{d_m : m \ge n\}. These are nonempty compact saturated sets, they decrease, and ⋂nKn=∅\bigcap_n K_n = \varnothing. Equation (6) fails for U=∅U = \varnothing, so XX is not ω\omega-well-filtered.

The countable set D={dn:n∈N}D = \{d_n : n \in\mathbb{N}\} is irreducible and dense in XX. Its closure XX has no generic point, so XX is not ω\omega-sober either. Here

FD=O(X)∖{∅}\mathcal{F}_D = \mathcal{O}(X) \setminus\{\varnothing\}

is a completely prime Scott-open filter whose intersection is empty. In fact,

ΦX({Kn:n∈N})=FD,\Phi_X(\{K_n : n \in\mathbb{N}\}) = \mathcal{F}_D,

because every nonempty cofinite open set contains some tail KnK_n. 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 X∖EnX \setminus E_n, a point p∉⋃nEnp \notin\bigcup_n E_n belongs to every base member, whereas the nonempty open set X∖{p}X \setminus\{p\} contains none of them. Thus the countability of DD does not imply the countable generation of FD\mathcal{F}_D. In particular, FD∈Fω(X)\mathcal{F}_D \in\mathcal{F}_{\omega}(X) witnesses failure of the enlarged representation property:

FD≠ΦX(⋂FD)=ΦX(∅)=O(X).\mathcal{F}_D \ne\Phi_X\left(\bigcap\mathcal{F}_D\right) = \Phi_X(\varnothing) = \mathcal{O}(X).

Thus the equivalent conditions in Theorem 3.2 are strictly stronger than (Hco)(\mathrm{H}_{\mathrm{co}}).

This example also separates the two general HH-versions. Since XX is T1T_1, every directed subset is a singleton, so XX is both D\mathcal{D}-sober and Dω\mathcal{D}^{\omega}-sober. Its failure of ω\omega-well-filteredness shows that it is neither super D\mathcal{D}-sober nor super Dω\mathcal{D}^{\omega}-sober. By Theorem 2.13, neither D\mathcal{D} nor Dω\mathcal{D}^{\omega} has property QQ for this XX.

Remark 5.4 (Strict weakening of sobriety). For completeness, ω\omega-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 ω\omega-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 HH encode HH-sobriety of XX and of PS(X)P_S(X). Their relation is given by the local property-QQ 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 Rω\mathcal{R}^{\omega} has property QQ. In particular, the ω\omega-sober spaces considered here are exactly the Rω\mathcal{R}^{\omega}-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 ω\omega-well-filteredness.

The examples distinguish these conditions from the open-generator property HcoH_{\mathrm{co}}. The implication ω\omega-well-filteredness ⇒Hco\Rightarrow H_{\mathrm{co}} 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. [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. [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. [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. [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. [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. [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. [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. [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. [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

Paper details

vlnc:W_jbh2ympf
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

ChatGPT (OpenAI) · View statement →

Looking for related papers…
Contents