This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

The category of well-filtered dcpo’s is not Γ\Gamma-faithful

Hualin Miao, Huijun Hou, Xiaodong Jia111Corresponding author, Email: jiaxiaodong@hnu.edu.cn  and Qingguo Li
School of Mathematics, Hunan University, Changsha, Hunan 410082, China
Abstract

The Ho-Zhao problem asks whether any two dcpo’s with isomorphic Scott closed set lattices are themselves isomorphic, that is, whether the category 𝐃𝐂𝐏𝐎\mathbf{DCPO} of dcpo’s and Scott-continuous maps is Γ\Gamma-faithful. In 2018, Ho, Goubault-Larrecq, Jung and Xi answered this question in the negative, and they introduced the category 𝐃𝐎𝐌𝐈\mathbf{DOMI} of dominated dcpo’s and proved that it is Γ\Gamma-faithful. Dominated dcpo’s subsume many familiar families of dcpo’s in domain theory, such as the category of bounded-complete dcpo’s and that of sober dcpo’s, among others. However, it is unknown whether the category of dominated dcpo’s dominates all well-filtered dcpo’s, a class strictly larger than that of bounded-complete lattices and that of sober dcpo’s. In this paper, we address this very natural question and show that the category 𝐖𝐅\mathbf{WF} of well-filtered dcpo’s is not Γ\Gamma-faithful, and as a result of it, well-filtered dcpo’s need not be dominated in general. Since not all dcpo’s are well-filtered, our work refines the results of Ho, Goubault-Larrecq, Jung and Xi.

As a second contribution, we confirm that the Lawson’s category of Ω\Omega^{*}-compact dcpo’s is Γ\Gamma-faithful. Moreover, we locate a class of dcpo’s which we call weakly dominated dcpo’s, and show that this class is Γ\Gamma-faithful and strictly larger than 𝐃𝐎𝐌𝐈\mathbf{DOMI}.

Keywords: Ho-Zhao Problem, Γ\Gamma-faithfulness, well-filtered dcpo’s, weakly dominated dcpo’s.

1 Introduction

One of the most important topologies on posets is the so-called Scott topology, which consists of upper subsets that are inaccessible by suprema of directed subsets in given posets, and has been playing prominent rôle in domain theory, non-Hausdorff topology and denotational semantics, among others. As can be seen from definition, Scott topologies are uniquely determined by the order structure on posets. A more intriguing question is the converse: does the Scott topology of a poset determine the order of the poset? In order to form this question more rigorously, we let ΓP\Gamma P denote the set of all Scott closed subsets of a poset PP, ordered by inclusion. The poset ΓP\Gamma P is a complete lattice for each PP. The aforementioned question is then formalized as:

If PP and QQ are posets with ΓP\Gamma P isomorphic to ΓQ\Gamma Q (ΓPΓQ\Gamma P\cong\Gamma Q, in symbols), is it true that PQP\cong Q?

This question was perfectly answered by Zhao and Fan in [15], where they showed that each poset PP admits a so-called dcpo-completion E(P)E(P), with the property that E(P)E(P) is a directly-complete poset (dcpo for short) and ΓPΓE(P)\Gamma P\cong\Gamma E(P). Hence, any poset which fails to be a dcpo, together with its dcpo-completion E(P)E(P), fails the above question. This observation has led Ho and Zhao narrow this question to the category 𝐃𝐂𝐏𝐎\mathbf{DCPO} of dcpo’s and Scott-continuous maps [7], and they call a full subcategory 𝐂\mathbf{C} of 𝐃𝐂𝐏𝐎\mathbf{DCPO} Γ\Gamma-faithful if for every pair PP and QQ in 𝐂\mathbf{C}, ΓPΓQ\Gamma P\cong\Gamma Q implies PQP\cong Q. In [7], Ho and Zhao identified the category of bounded complete dcpo’s as one of Γ\Gamma-faithful subcategories of 𝐃𝐂𝐏𝐎\mathbf{DCPO}, and asked whether the category 𝐃𝐂𝐏𝐎\mathbf{DCPO} itself is Γ\Gamma-faithful. The question was later dubbed the Ho-Zhao problem. In 2016, Ho, Goubault-Larrecq, Jung and Xi exhibited a dcpo \mathcal{H} which is not sober in the Scott topology, and showed that \mathcal{H} and its sobrification ^\hat{\mathcal{H}} serve as instances for the fact that 𝐃𝐂𝐏𝐎\mathbf{DCPO} fails to be Γ\Gamma-faithful. In addition, they gave a Γ\Gamma-faithful full subcategory 𝐃𝐎𝐌𝐈\mathbf{DOMI} of 𝐃𝐂𝐏𝐎\mathbf{DCPO}, which consists of the so-called dominated dcpo’s. Notably, the category 𝐃𝐎𝐌𝐈\mathbf{DOMI} of dominated dcpo’s subsumes many known Γ\Gamma-faithful subcategories of dcpo’s, for example, the category of sober dcpo’s and that of bounded-complete lattices, to name a few. In Section 33, we show that the category 𝐃𝐎𝐌𝐈\mathbf{DOMI} of dominated dcpo’s also includes the category of Ω\Omega^{*}-compact dcpo’s.

Generalizing both sober dcpo’s and Ω\Omega^{*}-compact dcpo’s, well-filtered dcpo’s are ones that are well-filtered in the Scott topology, and the category 𝐖𝐅\mathbf{WF} of well-filtered dcpo’s is a strictly smaller subclass of 𝐃𝐂𝐏𝐎\mathbf{DCPO}. A natural question arises as whether well-filtered dcpo’s also are subsumed under dominated dcpo’s, or whether the category 𝐖𝐅\mathbf{WF} is Γ\Gamma-faithful? In this paper, we will mainly investigate this natural question and give concrete examples to deduce that 𝐖𝐅\mathbf{WF} is not Γ\Gamma-faithful. Hence, well-filtered dcpo’s may fail to be dominated. Our examples make use of an example YY given by Zhao and Xi in [16], where they showed that YY is a well-filtered dcpo, but not sober in its Scott topology.

While the paper itself displays a negative result, it refines the results of Ho, Goubault-Larrecq, Jung and Xi, and it also reveals the distinction between the category 𝐖𝐅\mathbf{WF} and the newly found 𝐃𝐎𝐌𝐈\mathbf{DOMI}, where the later class 𝐃𝐎𝐌𝐈\mathbf{DOMI} definitely needs more clarification. Finally, we introduce the category of weak dominated dcpo’s, and show that it is a Γ\Gamma-faithful category that is strictly larger than the class of dominated dcpo’s.

2 Preliminaries

In this section, we introduce some basic concepts and notations that will be used in this paper.

Let PP be a partially ordered set (poset, for short), DPD\subseteq P is directed (resp., filtered) if DD is nonempty and for any finite subset FDF\subseteq D, there is a dDd\in D such that dd is an upper bound (resp., a lower bound) of FF. A poset PP is called directed complete (dcpo, for short) if every directed subset DD of PP has a least upper bound, which we denote by supD\sup D, or D\bigvee D. For any subset APA\subseteq P, let \uparrowAA = {xP:x\{x\in P:x\geq a for some aA}a\in A\} and \downarrowAA = {xP:xa\{x\in P:x\leq a for some aA}a\in A\}. Specifically, we write \uparrowxx = \uparrow{x}\{x\} and \downarrowxx = \downarrow{x}\{x\}. We will call APA\subseteq P an upper set (resp., a lower set) if AA = \uparrowAA (resp., AA = \downarrowAA).

A subset UU of PP is Scott open if UU = \uparrowUU and for any directed subset DD for which supDD exists, supDD U\in U implies DUD\cap U\neq\emptyset. Accordingly, APA\subseteq P is Scott closed if AA = \downarrowAA and for any directed subset DD of PP with supDD existing, DAD\subseteq A implies supDD A\in A. The set of all Scott open sets of PP forms the Scott topology on PP, which is denoted by σP\sigma P, and the set of all Scott closed sets of PP is denoted by ΓP\Gamma P. Furthermore, for a subset AA of PP, we will use A¯\overline{A} or cl(A)\mathrm{cl}(A) to denote the closure of AA with respect to the Scott topology on PP. The space (P,σP)(P,\sigma P) also is denoted by ΣP\Sigma P, some authors refer such a space, a poset endowed with the Scott topology, a Scott space. Recall that the lower topology ω(L)\omega(L) on LL is defined to have the principal filters a\mathord{\uparrow}a for aLa\in L as subbasic closed sets.

For a T0T_{0} space XX, the partial order \leqX, defined by xXyx\leq_{X}y if and only if xx is in the closure of yy, is called the specialization order on XX. Naturally, the closure of a single point xx is \downarrowxx, the order considered here is, of course, the specialization order. The specialization order on a Scott space ΣP\Sigma P coincides with the original order on PP. A subset KK of XX is compact if every open cover of KK admits a finite subcover, and the saturation of a subset AA is the intersection of all open sets that contain it. A subset KK is called to be saturated if it equals its saturation. Besides, for every subset AA of XX, the saturation of AA coincides with \uparrowAA under the specialization order. Every compact saturated subset KK in a Scott space is of the form minK\mathord{\uparrow}\mathrm{min}K, where minK\mathrm{min}K is the set of minimal elements of KK [8]. And usually, we use Q(X)Q(X) to denote the set of all non-empty compact saturated subsets of XX.

A T0T_{0} space XX is sober if every irreducible closed subset CC of XX is the closure of some unique singleton set {c}\{c\}, where CC is called irreducible if CABC\subseteq A\cup B for closed subsets AA and BB implies that CAC\subseteq A or CBC\subseteq B. We denote the set of all closed irreducible subsets of XX by IRR(X)IRR(X). Every sober space XX is a well-filtered space, in the sense that for every filtered family (in the conclusion order) of compact saturated subsets Ki,iIK_{i},i\in I and every open subset UU of XX, iIKiU\bigcap_{i\in I}K_{i}\subseteq U implies that there is already some KiK_{i} with KiUK_{i}\subseteq U. Well-filtered spaces can also be characterized by the so-called KF-sets. In a T0T_{0} space XX, a nonempty subset AA of XX is said to have the compactly filtered property (KFKF property), if there exists a filtered family 𝒦fltQ(X)\mathcal{K}\subseteq_{\mathrm{flt}}Q(X) such that cl(A)\mathrm{cl}(A) is a minimal closed set that intersects all members of 𝒦\mathcal{K}. We call such a set a KFKF-set and denote by KF(X)KF(X) the set of all closed KFKF-sets of XX. It is shown in [14] that a T0T_{0} space is well-filtered if and only if every KFKF-set KK of XX is the closure of some unique singleton set {k}\{k\}. Finally, we remark that every KFKF-set is irreducible, i.e., KF(X)IRR(X)KF(X)\subseteq IRR(X) for each T0T_{0} space XX [14].

3 Ω\Omega^{*}-compact dcpo’s are dominated

In this section, we deduce that the category 𝐃𝐎𝐌𝐈\mathbf{DOMI} of dominated dcpo’s subsumes the category of Ω\Omega^{*}-compact dcpo’s.

Definition 3.1.

[9] Let XX be a T0T_{0} space and \leq be its order of specialization. We equip X also with its ω\omega-topology defined from the order of specialization. We say that XX is Ω\Omega^{*}-compact if every closed subset of XX is compact in the ω\omega-topology.

Definition 3.2.

[6] Given A,BIRR(L)A,B\in IRR(L), we write ABA\lhd B if there is bBb\in B such that AbA\subseteq\mathord{\downarrow}b. We write B\nabla B for the set {AIRR(L)AB}\{A\in IRR(L)\mid A\lhd B\}. A dcpo LL is called dominated if for every closed irreducible subset AA of LL, the collection A\nabla A is Scott closed in IRR(L)IRR(L).

Lemma 3.3.

Let LL be an Ω\Omega^{*}-compact dcpo. Then LL is a dominated dcpo.

Proof.

From the definition of dominated dcpo’s, it suffices to prove that A\nabla A is a Scott closed subset of IRR(L)IRR(L) for any AIRR(L)A\in IRR(L). To this end, let (Ai)iI(A_{i})_{i\in I} be a directed subset of A\nabla A. Then there exists aiAa_{i}\in A such that AiaiA_{i}\subseteq\mathord{\downarrow}a_{i} for any iIi\in I. This means that (xAix)A(\bigcap_{x\in A_{i}}\mathord{\uparrow}x)\cap A\neq\emptyset for any iIi\in I. Note that xAix\bigcap_{x\in A_{i}}\mathord{\uparrow}x is closed in the lower topology and (xAix)iI(\bigcap_{x\in A_{i}}\mathord{\uparrow}x)_{i\in I} is filtered. Then the fact that LL is Ω\Omega^{*}-compact reveals that AxiIAixA\cap\bigcap_{x\in\bigcup_{i\in I}A_{i}}\mathord{\uparrow}x\neq\emptyset. Since xcl(iIAi)x=xiIAix\bigcap_{x\in cl(\bigcup_{i\in I}A_{i})}\mathord{\uparrow}x=\bigcap_{x\in\bigcup_{i\in I}A_{i}}\mathord{\uparrow}x, we have A(xcl(iIAi)x)A\cap(\bigcap_{x\in cl(\bigcup_{i\in I}A_{i})}\mathord{\uparrow}x)\neq\emptyset. Hence, supiIAi=cl(iIAi)L\sup_{i\in I}A_{i}=cl(\bigcup_{i\in I}A_{i})\in\nabla L. ∎

From the above lemma, we can arrive at the following theorem immediately.

Theorem 3.4.

The category of Ω\Omega^{*}-compact dcpo’s is Γ\Gamma-faithful.

We know that Ω\Omega^{*}-compact dcpo’s are well-filtered dcpo’s. It is nature to ask whether the category 𝐖𝐅\mathbf{WF} of well-filtered dcpo’s is Γ\Gamma-faithful. Next, we study the problem.

4 The category of well-filtered dcpo’s is not Γ\Gamma-faithful

In this section, we first give the definition of a dcpo 𝒵\mathcal{Z}, which will be shown to be well-filtered but not sober in the Scott topology. Moreover, we will see that Γ𝒵\Gamma\mathcal{Z} is isomorphic to Γ𝒵^\Gamma\hat{\mathcal{Z}}, where 𝒵^\hat{\mathcal{Z}} is the poset of all irreducible closed subsets of 𝒵\mathcal{Z} in the set inclusion order, and 𝒵^\hat{\mathcal{Z}} is a sober dcpo. Since 𝒵\mathcal{Z} is not sober, it cannot be isomorphic to 𝒵^\hat{\mathcal{Z}}. Hence, the pair of well-filtered dcpo’s 𝒵\mathcal{Z} and 𝒵^\hat{\mathcal{Z}} illustrates that the category of well-filtered dcpo’s is not Γ\Gamma-faithful.

4.1 The definition of the counterexample 𝒵\mathcal{Z}

Let ω1\omega_{1} be the first non-countable ordinal and 𝕎=[0,ω1)\mathbb{W}=[0,\omega_{1}) be the set of all ordinals strictly less than ω1\omega_{1}. Then 𝕎\mathbb{W} consists of all finite and infinite countable ordinals.

Remark 4.1.

[3] The following results about 𝕎\mathbb{W} are well-known:

  1. 1.

    |𝕎|=1|\mathbb{W}|=\aleph_{1}, where |𝕎||\mathbb{W}| denotes the cardinality of 𝕎\mathbb{W}.

  2. 2.

    𝕎\mathbb{W} is sequentially complete. That is, for every countable subsequence D𝕎D\subseteq\mathbb{W}, supD𝕎\sup D\in\mathbb{W}, here the supD\sup D is taken with respect to the usual linear order on ordinals.

  3. 3.

    For any α𝕎\alpha\in\mathbb{W}, {β:βα}\{\beta:\beta\leq\alpha\} is a finite or countably infinite subset of 𝕎\mathbb{W}.

Now let us review a poset YY given by Zhao and Xi in [16]. We will use this poset as building blocks for our dcpo 𝒵\mathcal{Z}. Let 𝕎1=[0,ω1]=𝕎{ω1}\mathbb{W}_{1}=[0,\omega_{1}]=\mathbb{W}\cup\{\omega_{1}\} and Y=𝕎×𝕎1Y=\mathbb{W}\times\mathbb{W}_{1}. The order on YY is given by (m,u)(m,u)(m,u)\leq(m^{\prime},u^{\prime}) if and only if:

  • m=mm=m^{\prime} and uuu\leq u^{\prime}, or

  • u=ω1u^{\prime}=\omega_{1} and if umu\leq m^{\prime},

and the order structure of YY can be easily depicted, as in Figure 11.

(0,0)(0,1)(0,ω0\omega_{0}\!)(0\!0,ω0+1\omega_{0}\!\!+\!\!1\!)(0,ω1\omega_{1}\!)(1,0)(1,1)(1,ω0\omega_{0}\!)(1,ω0+1)(\!1\!,\!\omega_{0}\!\!+\!\!1\!)(1,ω1\omega_{1}\!)(ω0\omega_{0},0)(ω0\omega_{0},1)(ω0\omega_{0},ω0\omega_{0}\!)(ω0,ω0+1)(\!\omega_{0}\!,\!\omega_{0}\!\!+\!\!1\!)(ω0\omega_{0},ω1\omega_{1}\!)(ω0+1\!\omega_{0}\!\!+\!\!1\!,0)(ω0+1\!\omega_{0}\!\!+\!\!1\!,1)(ω0+1\!\omega_{0}\!\!+\!\!1\!,ω0\omega_{0}\!)(ω0+1,ω0+1)(\!\omega_{0}\!\!+\!\!1\!,\!\omega_{0}\!\!+\!\!1\!)(ω0+1\!\omega_{0}\!\!+\!\!1\!,ω1\omega_{1}\!)

Figure 1: A non-sober well-filtered dcpo YY.

We gather some known results about YY. The reader can find details in [16].

Lemma 4.2.
  1. 1.

    The poset YY is a dcpo;

  2. 2.

    YY is well-filtered, but not sober in the Scott topology;

  3. 3.

    The only closed irreducible subset of YY that is not a principal ideal is YY itself.

For each u[0,ω1)u\in[0,\omega_{1}), we use the convention LuL_{u} to denote the set of elements on the uu-th level of YY. That is, Lu={(x,u)Yx[0,ω1)}L_{u}=\{(x,u)\in Y\mid x\in[0,\omega_{1})\}. We call Lω1L_{\omega_{1}} the maximal level in YY. Similarly, we say that elements of the form (u,x),x[0,ω1](u,x),x\in[0,\omega_{1}], are in the uu-th column of YY.

The process of constructing 𝒵\mathcal{Z} is similar to that of \mathcal{H} in [6]. An informal description of this construction is as follows: We begin with YY and for each level LuL_{u} of YY, we add a copy YuY_{u} of YY below LuL_{u} and identify maximal points of YuY_{u} with elements in LuL_{u} in the canonical way – identifying (x,ω1)(x,\omega_{1}) in YuY_{u} with (x,u)(x,u) in LuL_{u}. No order relation between the non-maximal elements of two different Yu,YuY_{u},Y_{u^{\prime}} is introduced. Now, we repeat this copy-and-identify process and add copies of YY below non-maximal levels of Yu,u[0,ω1)Y_{u},u\in[0,\omega_{1}), copies of YY below non-maximal levels of these copies of YY which are already added in the previous step, and proceed infinitely countable many times.

In order to keep all copies of YY in right place, we use strings on 𝕎=[0,ω1)\mathbb{W}=[0,\omega_{1}) to index them. To start with, we let 𝕎\mathbb{W}^{*} be the set of finite strings of elements in [0,ω1)[0,\omega_{1}), and for any s,t𝕎,u𝕎s,t\in\mathbb{W}^{*},u\in\mathbb{W}, u.su.s is such that adding the element uu to the front of ss, and tsts is the concatenation of tt and ss. Now, we use YεY_{\varepsilon} to denote the original YY, where ε\varepsilon is the empty string; for strings ss of length 11, i.e., s[0,ω1)s\in[0,\omega_{1}), YsY_{s} denotes the copy of YY that is attached below LsL_{s} of YεY_{\varepsilon}, the ss-th level of YεY_{\varepsilon}; for strings ss of length larger than or equal to 22, say s=x1.ss=x_{1}.s^{\prime} with x1[0,ω1)x_{1}\in[0,\omega_{1}) and ss^{\prime} being the obvious remaining substring of ss, YsY_{s} denotes the copy of YY that is attached below the x1x_{1}-level of YsY_{s^{\prime}} which is already well placed by induction. Then, the union s𝕎Ys\bigcup_{s\in\mathbb{W}^{*}}Y_{s} will be the underlying set of our poset 𝒵\mathcal{Z}. However, there are two issues to be settled. First, we need to denote elements in this big union. This is easy, as we can use (m,u,s)(m,u,s) with (m,u,s)[0,ω1)×[0,ω1]×𝕎(m,u,s)\in[0,\omega_{1})\times[0,\omega_{1}]\times\mathbb{W}^{*} to denote the element (m,u)(m,u) in YsY_{s} in the canonical way. Second, we need to take the identifying process into the consideration. In this scenario, we will identify (m,u,s),uω1,sε(m,u,s),u\neq\omega_{1},s\neq\varepsilon, the element (m,u)(m,u) in YsY_{s}, with (m,ω1,u.s)(m,\omega_{1},u.s), the maximal point (m,ω1)(m,\omega_{1}) in Yu.sY_{u.s}. What we get after this identification is the correct underlying set of our poset 𝒵\mathcal{Z}.

Note that we equate the elements (m,u,s)(m,u,s) of YsY_{s} with (m,ω1,u.s)(m,\omega_{1},u.s) of Yu.sY_{u.s}, each element of 𝒵\mathcal{Z} can be marked as the form of (m,ω1,s)(m,\omega_{1},s), m𝕎,s𝕎m\in\mathbb{W},s\in\mathbb{W}^{*}, and ss may be ε\varepsilon. As ω1\omega_{1} appears as the second coordinate of each element in 𝒵\mathcal{Z}, we simply omit it. By doing so it enables us to use {(m,s):(m,s)𝕎×𝕎}\{(m,s):(m,s)\in\mathbb{W}\times\mathbb{W}^{*}\} to label all elements of 𝒵\mathcal{Z}. With this all in mind, we now give the rigorous definition of 𝒵\mathcal{Z}.

Let 𝒵\mathcal{Z} be 𝕎×𝕎\mathbb{W}\times\mathbb{W}^{*}. We define the following relations on 𝒵\mathcal{Z} (where m,m,u,u𝕎,s,t𝕎m,m^{\prime},u,u^{\prime}\in\mathbb{W},s,t\in\mathbb{W}^{*}), which is reminiscent of the order on \mathcal{H} in [6].

  • (m,u.s)<1(m,u.s)(m,u.s)<_{1}(m,u^{\prime}.s) if u<uu<u^{\prime};

  • (m,ts)<2(m,s)(m,ts)<_{2}(m,s) if tεt\neq\varepsilon;

  • (m,ts)<3(m,s)(m,ts)<_{3}(m^{\prime},s) if tεt\neq\varepsilon and min(t)m\mathrm{min}(t)\leq m^{\prime}.

In the third dotted item, min(t)\mathrm{min}(t) denotes the least ordinal appearing in the string tt, hence min(t)m\mathrm{min}(t)\leq m^{\prime} makes sense. The definitions of these three kinds of relations are similar to that on \mathcal{H} given by Ho et al. in [6], and we can obtain a partial order through the following results, where we use ``;"``;" to mean composition of relations.

Proposition 4.3.
  1. 1.

    <1,<2,<3<_{1},<_{2},<_{3} are transitive and irreflexive, respectively.

  2. 2.

    <1;<2=<2<_{1};<_{2}\;=\;<_{2}

  3. 3.

    <1;<3<3<_{1};<_{3}\;\subseteq\;<_{3}

  4. 4.

    <2;<3<3<_{2};<_{3}\;\subseteq\;<_{3}

  5. 5.

    <3;<2<3<_{3};<_{2}\;\subseteq\;<_{3}

  6. 6.

    <:=<1<2<3(<2;<1)(<3;<1)<\;:=\;<_{1}\cup<_{2}\cup<_{3}\cup\;(<_{2};<_{1})\cup(<_{3};<_{1}) is transitive and irreflexive.

  7. 7.

    :=(<=)\leq\;:=(<\cup=) is a partial order relation on 𝒵\mathcal{Z}.

Definition 4.4.

We define 𝒵\mathcal{Z} to be the poset which consists of the set 𝕎×𝕎\mathbb{W}\times\mathbb{W}^{*} and the order relation \leq in 4.3.

In the rest of this section, we will prove in steps that 𝒵\mathcal{Z} is a well-filtered dcpo and that the pair 𝒵\mathcal{Z} and its sobrification 𝒵^\hat{\mathcal{Z}} witness the fact that the category of well-filtered dcpos\mathrm{dcpo^{\prime}s} is not Γ\Gamma-faithful.

4.2 𝒵\mathcal{Z} is a dcpo

Sketch of the proof. We prove that 𝒵\mathcal{Z} is a dcpo by showing that every chain CC in 𝒵\mathcal{Z} has a supremum [10, Corollary 2]. Since supC\sup C always exists when CC itself has a largest element, we only need to take care of the case where CC is a strictly increasing chain without a largest element. And of course, in the latter case CC must be infinite and we call such chains non-trivial. Similar to Proposition 5.3 in [6], we will be able to show that every non-trivial chain in 𝒵\mathcal{Z} contains a cofinal chain of the form (m,u.s)uW(m,u.s)_{u\in W}, where m𝕎m\in\mathbb{W} and s𝕎s\in\mathbb{W}^{*} are fixed, and WW is an infinite subset of 𝕎\mathbb{W}. This means that every non-trivial chain in 𝒵\mathcal{Z} eventually stays in the mm-column of copy YsY_{s} for some string ss. Hence, in order to prove that 𝒵\mathcal{Z} is a dcpo, we only need to verify the existence of suprema of non-trivial chains in that particular form, which is then doable.

Proposition 4.5.

𝒵\mathcal{Z} is a dcpodcpo.

Proof.

Let CC be a non-trivial chain in 𝒵\mathcal{Z}.

𝐂𝐥𝐚𝐢𝐦𝟏\mathbf{Claim~{}1}: CC contains a cofinal chain of the form (m,u.s)uW(m,u.s)_{u\in W}, with mm and ss fixed.

Let (m1,s1)<(m2,s2)<(m_{1},s_{1})<(m_{2},s_{2})<\cdots be a non-trivial chain. Each relationship (mi,si)<(mi+1,si+1)(m_{i},s_{i})<(m_{i+1},s_{i+1}) has to be one of the five types listed in item (6) of Proposition 4.3. All of these, except <1<_{1}, strictly reduce the length of the string sis_{i}, so they can occur only finitely often along the chain. Therefore, from some index i0i_{0} onward, the connecting relationship must always be <1<_{1} which implies that the shape of the entries (mi,si)(m_{i},s_{i}), ii0i\geq i_{0}, is as stated.

𝐂𝐥𝐚𝐢𝐦𝟐\mathbf{Claim~{}2}: If WW is uncountable, then supuW(m,u.s)=(m,s)\sup_{u\in W}(m,u.s)=(m,s).

Since (m,u.s)<2(m,s)(m,u.s)<_{2}(m,s) for any uWu\in W, (m,s)(m,s) is an upper bound of {(m,u.s):uW}\{(m,u.s):u\in W\}. It remains to confirm that (m,s)(m,s) is the least upper bound of {(m,u.s):uW}\{(m,u.s):u\in W\}. Assume that (m,s)(m^{\prime},s^{\prime}) is another upper bound of {(m,u.s):uW}\{(m,u.s):u\in W\}. Then each (m,u.s)(m,u.s) must be related to it by one of the five types listed in Proposition 4.3. We set

A<r={(m,u.s):uWand(m,u.s)<r(m,s)}A_{<_{r}}=\{(m,u.s):u\in W\ \mathrm{and}\ (m,u.s)<_{r}(m^{\prime},s^{\prime})\},

where <r{<1,<2,<3,<2;<1,<3;<1}<_{r}\in\{<_{1},\ <_{2},\ <_{3},\ <_{2};<_{1},\ <_{3};<_{1}\}. It follows that at least one of the five sets is uncountable from the uncountability of WW.

Case 1, A<1A_{<_{1}} is uncountable. For any (m,u.s)A<1(m,u.s)\in A_{<_{1}}, (m,u.s)<1(m,s)(m,u.s)<_{1}(m^{\prime},s^{\prime}), then m=mm=m^{\prime} and ss^{\prime} can be written as u.su^{\prime}.s for some fixed u𝕎u^{\prime}\in\mathbb{W}. It is obvious that u\downarrow\!u^{\prime} is countable, which contradicts the fact that A<1A_{<_{1}} is uncountable.

Case 2, A<2A_{<_{2}} is uncountable. For any (m,u.s)A<2(m,u.s)\in A_{<_{2}}, (m,u.s)<2(m,s)(m,u.s)<_{2}(m^{\prime},s^{\prime}), so we have m=mm=m^{\prime} and sss^{\prime}\subseteq s. Assume that s=tss=ts^{\prime}, where t𝕎t\in\mathbb{W^{*}}. Then (m,s)=(m,s)(m,s)=(m^{\prime},s^{\prime}) when t=εt=\varepsilon or (m,s)<2(m,s)(m,s)<_{2}(m^{\prime},s^{\prime}) when tεt\neq\varepsilon.

Case 3, A<2;<1A_{<_{2};<_{1}} is uncountable. For any (m,u.s)A<2;<1(m,u.s)\in A_{<_{2};<_{1}}, (m,u.s)<2;<1(m,s)(m,u.s)<_{2};<_{1}(m^{\prime},s^{\prime}), that is, there exists (mu,su)𝒵(m_{u},s_{u})\in\mathcal{Z} such that (m,u.s)<2(mu,su)<1(m,s)(m,u.s)<_{2}(m_{u},s_{u})<_{1}(m^{\prime},s^{\prime}). Then m=mu=mm=m_{u}=m^{\prime} and sus_{u} can be fixed since all of these sus_{u} have the same lengths as ss^{\prime}, and suss_{u}\subseteq s. Set su=ss_{u}=s^{*} which has been fixed. So we have (m,s)=(m,s)<1(m,s)(m,s)=(m^{\prime},s^{*})<_{1}(m^{\prime},s^{\prime}) or (m,s)<2(m,s)<1(m,s)(m,s)<_{2}(m^{\prime},s^{*})<_{1}(m^{\prime},s^{\prime}).

Case 4, A<3A_{<_{3}} is uncountable. For any (m,u.s)A<3(m,u.s)\in A_{<_{3}}, (m,u.s)<3(m,s)(m,u.s)<_{3}(m^{\prime},s^{\prime}), then s=tss=ts^{\prime} for some t𝕎t\in\mathbb{W^{*}}. If t=εt=\varepsilon, then umu\leq m^{\prime} for all uWu\in W, which will result in a contradiction as m\downarrow\!m^{\prime} is countable, but WW is uncountable. Thus tεt\neq\varepsilon and min(ut)m\min(ut)\leq m^{\prime} for any uWu\in W. The fact that mint𝕎\min t\in\mathbb{W} is a fixed countable ordinal guarantees the existence of u0u_{0} with u0mintu_{0}\geq\min t. It follows that mintm\min t\leq m^{\prime} according to (m,u0.s)<3(m,s)(m,u_{0}.s)<_{3}(m^{\prime},s^{\prime}). Hence, it turns out that (m,s)=(m,ts)<3(m,s)(m,s)=(m,ts^{\prime})<_{3}(m^{\prime},s^{\prime}).

Case 5, A<3;<1A_{<_{3};<_{1}} is uncountable. For any (m,u.s)A<3;<1(m,u.s)\in A_{<_{3};<_{1}}, (m,u.s)<3;<1(m,s)(m,u.s)<_{3};<_{1}(m^{\prime},s^{\prime}), that is, there exists (mu,su)𝒵(m_{u},s_{u})\in\mathcal{Z} such that (m,u.s)<3(mu,su)<1(m,s)(m,u.s)<_{3}(m_{u},s_{u})<_{1}(m^{\prime},s^{\prime}) for any uWu\in W. Then mu=mm_{u}=m^{\prime} and sus_{u} can be fixed because all of these sus_{u} have the same lengths as ss^{\prime}, and suss_{u}\subseteq s. Set su=ss_{u}=s^{*} which has been fixed. Thus (m,u.s)<3(m,s)<1(m,s)(m,u.s)<_{3}(m^{\prime},s^{*})<_{1}(m^{\prime},s^{\prime}). Similar to the proof of Case 44, we can get that (m,s)<3(m,s)<1(m,s)(m,s)<_{3}(m^{\prime},s^{*})<_{1}(m^{\prime},s^{\prime}).

𝐂𝐥𝐚𝐢𝐦𝟑\mathbf{Claim~{}3}: If WW is countably infinite, then supuW(m,u.s)=(m,u0.s)\sup_{u\in W}(m,u.s)=(m,u_{0}.s), where u0=supWu_{0}=\sup W.

It is evident that (m,u0.s)(m,u_{0}.s) is an upper bound of {(m,u.s):uW}\{(m,u.s):u\in W\} because (m,u.s)<1(m,u0.s)(m,u.s)<_{1}(m,u_{0}.s) for each uWu\in W. Assume that (m,s)(m^{\prime},s^{\prime}) is another upper bound. Now we set the same set A<r{A_{<_{r}}} as which in Claim 22. Then there must exist at least one of the five sets being the cofinal subset of {(m,u.s):uW}\{(m,u.s):u\in W\}. One sees directly that supA<r=supuW(m,u.s)\sup A_{<_{r}}\!=\sup_{u\in W}(m,u.s) if A<rA_{<_{r}} is a cofinal subset of {(m,u.s):uW}\{(m,u.s):u\in W\}.

Case 1, A<1A_{<_{1}} is cofinal in {(m,u.s):uW}\{(m,u.s):u\in W\}. For each (m,u.s)A<1(m,u.s)\in A_{<_{1}}, (m,u.s)<1(m,s)(m,u.s)<_{1}(m^{\prime},s^{\prime}), this means m=mm=m^{\prime} and u<uu<u^{\prime} if we set s=u.ss^{\prime}=u^{\prime}.s for some u𝕎u^{\prime}\in\mathbb{W} fixed. Then u0=supW=sup{u:(m,u.s)A<1}uu_{0}=\sup W=\sup\{u:(m,u.s)\in A_{<_{1}}\}\leq u^{\prime}. Thus (m,u0.s)=(m,u.s)=(m,s)(m,u_{0}.s)=(m,u^{\prime}.s)=(m^{\prime},s^{\prime}) or (m,u0.s)<1(m,u.s)=(m,s)(m,u_{0}.s)<_{1}(m,u^{\prime}.s)=(m^{\prime},s^{\prime}).

Case 2, A<2A_{<_{2}} is cofinal in {(m,u.s):uW}\{(m,u.s):u\in W\}. For each (m,u.s)A<2(m,u.s)\in A_{<_{2}}, (m,u.s)<2(m,s)(m,u.s)<_{2}(m^{\prime},s^{\prime}), then m=mm=m^{\prime} and sss^{\prime}\subseteq s, which yields that (m,u0.s)<2(m,s)(m,u_{0}.s)<_{2}(m^{\prime},s^{\prime}).

Case 3, A<2;<1A_{<_{2};<_{1}} is cofinal in {(m,u.s):uW}\{(m,u.s):u\in W\}. Then for each (m,u.s)A<2;<1(m,u.s)\in A_{<_{2};<_{1}}, (m,u.s)<2;<1(m,s)(m,u.s)<_{2};<_{1}(m^{\prime},s^{\prime}), that is, there is (mu,su)𝒵(m_{u},s_{u})\in\mathcal{Z} such that (m,u.s)<2(mu,su)<1(m,s)(m,u.s)<_{2}(m_{u},s_{u})<_{1}(m^{\prime},s^{\prime}). This implies that m=mu=mm=m_{u}=m^{\prime} and sus_{u} can be fixed because all of these sus_{u} have the same lengths as ss^{\prime}, and suss_{u}\subseteq s. Set su=ss_{u}=s^{*} which has been fixed. Hence, (m,u0.s)<2(m,s)<1(m,s)(m,u_{0}.s)<_{2}(m^{\prime},s^{*})<_{1}(m^{\prime},s^{\prime}) holds.

Case 4, A<3A_{<_{3}} is cofinal in {(m,u.s):uW}\{(m,u.s):u\in W\}. Then for each (m,u.s)A<3(m,u.s)\in A_{<_{3}}, (m,u.s)<3(m,s)(m,u.s)<_{3}(m^{\prime},s^{\prime}), so s=tss=ts^{\prime} for some t𝕎t\in\mathbb{W}^{*} and min(ut)m\min(ut)\leq m^{\prime}. If t=εt=\varepsilon or umintu\leq\min t for all uu, then min(ut)=um\min(ut)=u\leq m^{\prime} for each uWu\in W. This manifests that u0mu_{0}\leq m^{\prime}. Note that u0.s=u0.tsu_{0}.s=u_{0}.ts^{\prime} and min(u0.t)=u0m\min(u_{0}.t)=u_{0}\leq m^{\prime}. As a result, (m,u0.s)<3(m,s)(m,u_{0}.s)<_{3}(m^{\prime},s^{\prime}). If tεt\neq\varepsilon and there is a u1>mintu_{1}>\min t for some u1{uW:(m,u.s)A<3}u_{1}\in\{u\in W:(m,u.s)\in A_{<_{3}}\}, then mintm\min t\leq m^{\prime} because of (m,u1.s)<3(m,s)(m,u_{1}.s)<_{3}(m^{\prime},s^{\prime}). It follows that min(u0t)=mint\min(u_{0}t)=\min t. So we can gain that (m,u0.s)<3(m,s)(m,u_{0}.s)<_{3}(m^{\prime},s^{\prime}).

Case 5, A<3;<1A_{<_{3};<_{1}} is cofinal in {(m,u.s):uW}\{(m,u.s):u\in W\}. For each (m,u.s)A<3;<1(m,u.s)\in A_{<_{3};<_{1}}, we know (m,u.s)<3;<1(m,s)(m,u.s)<_{3};<_{1}(m^{\prime},s^{\prime}). This means that there exists (mu,su)𝒵(m_{u},s_{u})\in\mathcal{Z} satisfying (m,u.s)<3(mu,su)(m,u.s)<_{3}(m_{u},s_{u}) <1(m,s)<_{1}(m^{\prime},s^{\prime}) for each u{uW:(m,u.s)A<3;<1}u\in\{u\in W:(m,u.s)\in A_{<_{3};<_{1}}\}. So mu=mm_{u}=m^{\prime} and sus_{u} can be fixed as ss^{*} since the length of each sus_{u} is same as ss^{\prime}, and suss_{u}\subseteq s. This suggests that (m,u.s)<3(m,s)<1(m,s)(m,u.s)<_{3}(m^{\prime},s^{*})<_{1}(m^{\prime},s^{\prime}). By using similar analysis of Case 44, we can obtain that (m,u0.s)<3(m,s)<1(m,s)(m,u_{0}.s)<_{3}(m^{\prime},s^{*})<_{1}(m^{\prime},s^{\prime}).

This covers all cases to be considered and we conclude that 𝒵\mathcal{Z} is a dcpo\mathrm{dcpo}. ∎

4.3 The Scott closed irreducible subsets of 𝒵\mathcal{Z}

Next, we shall characterize the Scott closed irreducible subsets of 𝒵\mathcal{Z} and make a conclusion that IRR(𝒵)={(m,s):(m,s)𝒵}{Ls:s𝕎}I\!R\!R(\mathcal{Z})=\{\downarrow\!(m,s):(m,s)\in\mathcal{Z}\}\bigcup\;\{\downarrow\!L_{s}:s\in\mathbb{W}^{*}\}, where Ls={(m,s)𝒵:m𝕎}L_{s}=\{(m,s)\in\mathcal{Z}:m\in\mathbb{W}\}.

The following lemma is immediate and we omit the proof.

Lemma 4.6.

Let AA be a subset of 𝒵\mathcal{Z}. Then AA is Scott closed if it is downward closed and contains the sups of every non-trivial chain of the form (m,u.s)uW(m,u.s)_{u\in W} contained in AA, where W𝕎W\subseteq\mathbb{W}.

Lemma 4.7.

Let A𝒵A\subseteq\mathcal{Z} be a Scott closed subset. If AA contains uncountable number of elements of LsL_{s} for some s𝕎s\in\mathbb{W}^{*}, then LsAL_{s}\subseteq A.

Proof.

Let {(m,s):mW}\{(m,s):m\in W\} be a subset of AA with an uncountable set WW. For any mWm\in W, Lm.sAL_{m.s}\subseteq A since each element of Lm.sL_{m.s} is related to (m,s)(m,s) by the relation <3<_{3} and AA is a downward closed set. Thus for any a𝕎a\in\mathbb{W}, supmW(a,m.s)=(a,s)A\sup_{m\in W}(a,m.s)=(a,s)\in A, which implies that LsAL_{s}\subseteq A. ∎

Proposition 4.8.

For any s𝕎s\in\mathbb{W}^{*}, Ls\downarrow\!L_{s} is Scott closed and irreducible.

Proof.

𝐂𝐥𝐚𝐢𝐦𝟏\mathbf{Claim~{}1}: Ls\downarrow\!L_{s} is Scott closed.

Obviously, Ls\mathord{\downarrow}L_{s} is a lower set. Now it remains to confirm that Ls\mathord{\downarrow}L_{s} contains the supremum of every non-trivial chain of the form (m,u.s)uW(m,u.s)_{u\in W} contained in Ls\mathord{\downarrow}L_{s} by Lemma 4.6. To this end, let (m,u.s0)uWLs(m,u.s_{0})_{u\in W}\subseteq\ \downarrow\!L_{s} be a non-trivial chain. We set

A<r={(m,u.s0):uW,(mu,s)Lss.t.(m,u.s0)<r(mu,s)}A_{<_{r}}=\{(m,u.s_{0}):u\in W,\ \exists\ (m_{u},s)\in L_{s}\ s.t.\ (m,u.s_{0})<_{r}(m_{u},s)\},

where <r{<1,<2,<3,<2;<1,<3;<1}<_{r}\in\!\{<_{1},\ <_{2},\ <_{3},\ <_{2};<_{1},\ <_{3};<_{1}\}. Then there exists at least one of the five sets being the cofinal subset of {(m,u.s0):uW}\{(m,u.s_{0}):u\in W\} whether WW is countable infinite or uncountable.

Case 1, A<1A_{<_{1}} is cofinal in {(m,u.s0):uW}\{(m,u.s_{0}):u\in W\}. For any (m,u.s0)A<1(m,u.s_{0})\in A_{<_{1}}, (m,u.s0)<1(mu,s)(m,u.s_{0})<_{1}(m_{u},s) for some mu𝕎m_{u}\in\mathbb{W}. Then we have mu=m,u<um_{u}=m,u<u^{\prime} if we set ss as u.s0u^{\prime}.s_{0} for some u𝕎u^{\prime}\in\mathbb{W}. Under this condition, WW is countable and supWu\sup W\leq u^{\prime}. So supuW(m,u.s0)=(m,supW.s)=(m,u.s0)=(m,s)\sup_{u\in W}(m,u.s_{0})=(m,\sup W.s)=(m,u^{\prime}.s_{0})=(m,s) or supuW(m,u.s0)=(m,supW.s)<1(m,u.s0)=(m,s)\sup_{u\in W}(m,u.s_{0})=(m,\sup W.s)<_{1}(m,u^{\prime}.s_{0})=(m,s).

Case 2, A<2A_{<_{2}} is cofinal in {(m,u.s0):uW}\{(m,u.s_{0}):u\in W\}. For any (m,u.s0)A<2(m,u.s_{0})\in A_{<_{2}}, (m,u.s0)<2(mu,s)(m,u.s_{0})<_{2}(m_{u},s) for some mu𝕎m_{u}\in\mathbb{W}. We can get that mu=mm_{u}=m and ss0s\subseteq s_{0}, so supuW(m,u.s0)=(m,s)\sup_{u\in W}(m,u.s_{0})=(m,s) or supuW(m,u.s0)<2(m,s)\sup_{u\in W}(m,u.s_{0})<_{2}(m,s).

Case 3, A<2;<1A_{<_{2};<_{1}} is cofinal in {(m,u.s0):uW}\{(m,u.s_{0}):u\in W\}. For any (m,u.s0)A<2;<1(m,u.s_{0})\in A_{<_{2};<_{1}}, there is (mu,su)𝒵(m_{u},s_{u})\in\mathcal{Z} such that (m,u.s0)<2(mu,su)<1(mu,s)(m,u.s_{0})<_{2}(m_{u},s_{u})<_{1}(m_{u},s). Then we have mu=mm_{u}=m , sus0s_{u}\subseteq s_{0} and sus_{u} has the same length as ss, which leads to the result that sus_{u} can be fixed as ss^{*}. Thus supuW(m,u.s0)=(m,s)<1(m,s)\sup_{u\in W}(m,u.s_{0})=(m,s^{*})<_{1}(m,s) or supuW(m,u.s0)<2(m,s)<1(m,s)\sup_{u\in W}(m,u.s_{0})<_{2}(m,s^{*})<_{1}(m,s).

Case 4, A<3A_{<_{3}} is cofinal in {(m,u.s0):uW}\{(m,u.s_{0}):u\in W\}. For any (m,u.s0)A<3(m,u.s_{0})\in A_{<_{3}}, (m,u.s0)<3(mu,s)(m,u.s_{0})<_{3}(m_{u},s) for some mu𝕎m_{u}\in\mathbb{W}. Then ss0s\subseteq s_{0} and hence, supuW(m,u.s0)=(m,s)\sup_{u\in W}(m,u.s_{0})=(m,s) or supuW(m,u.s0)<2(m,s)\sup_{u\in W}(m,u.s_{0})<_{2}(m,s).

Case 5, A<3;<1A_{<_{3};<_{1}} is cofinal in {(m,u.s0):uW}\{(m,u.s_{0}):u\in W\}. For any (m,u.s0)A<3;<1(m,u.s_{0})\in A_{<_{3};<_{1}}, (m,u.s0)<3;<1(mu,s)(m,u.s_{0})<_{3};<_{1}(m_{u},s) for some mu𝕎m_{u}\in\mathbb{W}, which implies that there exists su𝕎s_{u}\in\mathbb{W}^{*} such that (m,u.s0)<3(mu,su)<1(mu,s)(m,u.s_{0})<_{3}(m_{u},s_{u})<_{1}(m_{u},s). Then sus0s_{u}\subseteq s_{0} and sus_{u} has the same length as ss. This yields that sus_{u} can be fixed as ss^{*}. It follows that supuW(m,u.s0)=(m,s)<1(m,s)\sup_{u\in W}(m,u.s_{0})=(m,s^{*})<_{1}(m,s) or supuW(m,u.s0)<2(m,s)<1(m,s)\sup_{u\in W}(m,u.s_{0})<_{2}(m,s^{*})<_{1}(m,s).

Now we can gain our desired result that Ls\mathord{\downarrow}L_{s} is Scott closed.

𝐂𝐥𝐚𝐢𝐦𝟐\mathbf{Claim~{}2}: Ls\downarrow\!L_{s} is irreducible.

It suffices to deduce that LsL_{s} is irreducible. Let U1,U2U_{1},U_{2} be two Scott open subsets of 𝒵\mathcal{Z} with LsU1,LsU2L_{s}\cap U_{1}\neq\emptyset,\ L_{s}\cap U_{2}\neq\emptyset. Then choose (m1,s)LsU1(m_{1},s)\in L_{s}\cap U_{1} and (m2,s)LsU2(m_{2},s)\in L_{s}\cap U_{2}. Because (m1,s)=supu𝕎(m1,u.s),(m2,s)=supu𝕎(m2,u.s)(m_{1},s)=\sup_{u\in\mathbb{W}}(m_{1},u.s),\ (m_{2},s)=\sup_{u\in\mathbb{W}}(m_{2},u.s), we can find (m1,u1.s)U1(m_{1},u_{1}.s)\in U_{1} and (m2,u2.s)U2(m_{2},u_{2}.s)\in U_{2} for some ui𝕎,i=1,2u_{i}\in\mathbb{W},\ i=1,2 from the Scott openness of U1U_{1} and U2U_{2}. Without loss of generality, suppose that u1u2u_{1}\leq u_{2}, then (m,ui.s)<3(u2,s),i=1,2(m,u_{i}.s)<_{3}(u_{2},s),\ i=1,2, which result in the conclusion that (u2,s)LsU1U2(u_{2},s)\in L_{s}\cap U_{1}\cap U_{2}. Therefore, LsL_{s} is irreducible. ∎

From the above proposition, we know that Ls\mathord{\downarrow}L_{s} must be Scott irreducible closed sets. Conversely, to prove that IRR(𝒵){Ls:s𝕎}IRR(\mathcal{Z})\subseteq\{\mathord{\downarrow}L_{s}:s\in\mathbb{W}^{*}\}, we need to consider 𝕎\mathbb{W}^{*} endowed with the order \sqsubseteq at first, which is defined in the following.

Based on the observation of the definition of the order relation on 𝒵\mathcal{Z}, we can find that the two relations <1,<2<_{1},<_{2} concern only the strings component of points (m,s)(m,s). We use them to define an order \sqsubseteq on 𝕎\mathbb{W}^{*}(where u,u𝕎u,u^{\prime}\in\mathbb{W}, s,t𝕎s,t\in\mathbb{W}^{*}):

  • u.s1u.su.s\sqsubset_{1}u^{\prime}.s if u<uu<u^{\prime}

  • ts2sts\sqsubset_{2}s if tεt\neq\varepsilon.

Then :=12(2;1)\sqsubset\ :=\ \sqsubset_{1}\cup\sqsubset_{2}\cup\ (\sqsubset_{2};\sqsubset_{1}) is transitive and irreflexive, hence, :=(=)\sqsubseteq\ :=(\sqsubset\cup=) is an order relation on 𝕎\mathbb{W}^{*}, and 𝕎\mathbb{W}^{*} with the order relation \sqsubseteq is a poset. We denote it by 𝒯\mathcal{T} and describe parts of 𝒯\mathcal{T} in Figure 22.

Remark 4.9.

Combine with the order on 𝒵\mathcal{Z}, we have:

  1. 1.

    If sss\sqsubseteq s^{\prime}, then (m,s)(m,s)(m,s)\leq(m,s^{\prime});

  2. 2.

    If (m,s)(m,s)(m,s)\leq(m^{\prime},s^{\prime}), then sss\sqsubseteq s^{\prime},

where m,m𝕎m,m^{\prime}\in\mathbb{W}, s,s𝕎s,s^{\prime}\in\mathbb{W}^{*}.

We state and derive an analogous result for 𝒯\mathcal{T} with the aid of [6, Proposition 5.9] and Proposition 4.5.

Proposition 4.10.
  1. 1.

    For any s𝕎s\in\mathbb{W}^{*}, s\uparrow\!s is a linear ordered subset of 𝒯\mathcal{T}.

  2. 2.

    The poset 𝒯\mathcal{T} endowed with the Scott topology is sober.

  3. 3.

    The map f:𝒵𝒯f:\mathcal{Z}\rightarrow\mathcal{T} defined by f(m,s)=sf(m,s)=s is Scott continuous.

123ω0\omega_{0}ω0+1\omega_{0}\!+\!1ε\varepsilon(ω0+1).1(\!\omega_{0}\!\!+\!\!1\!).1ω0.1\omega_{0}.13.12.11.1(ω0+1).3(\!\omega_{0}\!\!+\!\!1\!).3ω0.3\omega_{0}.33.32.31.3(ω0+1).3.3(\!\omega_{0}\!\!+\!\!1\!).3.3ω0.3.3\omega_{0}.3.33.3.32.3.31.3.3

Figure 2: The order \sqsubseteq on 𝕎\mathbb{W}^{*}.

We remark that for any chain C𝕎C\subseteq\mathbb{W}^{*} (or C𝒵C^{\prime}\subseteq\mathcal{Z}), supC(supC)\sup C\ (\sup C^{\prime}) exists and supC=supuW1u.s\sup C=\sup_{u\in W_{1}}u.s (or supC=supuW2(m,u.s)\sup C^{\prime}=\sup_{u\in W_{2}}(m,u.s)) since there exists {u.s:uW1}\{u.s:u\in W_{1}\} (or {(m,u.s):uW2}\{(m,u.s):u\in W_{2}\}) being a cofinal subset of CC (or CC^{\prime}), where W1W_{1} (or W2W_{2}) is the subset of 𝕎\mathbb{W}. Thus in the following context, we can regard any non-trivial chain in 𝒯\mathcal{T} (or in 𝒵\mathcal{Z}) as the form of {u.s:uW0}\{u.s:u\in W_{0}\} (or {(m,u.s):uW}\{(m,u.s):u\in W^{\prime}\}) with some W0W_{0} (or WW^{\prime})𝕎\subseteq\mathbb{W}. In addition, a straightforward verification establishes that supuW0u.s=s\sup_{u\in W_{0}}u.s=s when W0W_{0} is uncountable, and supuW0u.s=supW0.s\sup_{u\in W_{0}}u.s=\sup W_{0}.s when W0W_{0} is countable.

Lemma 4.11.

Let BB be a subset of  𝕎\mathbb{W}^{*}. If BB is closed for the sups\mathrm{sups} of any uncountable non-trivial chain, then we have B¯=B\overline{B}=B^{\prime}, where

B={supC:CBisacountablechain}B^{\prime}=\bigcup\;\{\downarrow\!\sup C:C\subseteq\ \downarrow\!B\ \mathrm{is}\ \mathrm{a}\ \mathrm{countable}\ \mathrm{chain}\}.

Proof.

One sees immediately that BB¯B^{\prime}\subseteq\overline{B} and BBB\subseteq B^{\prime}, then it remains to prove that BB^{\prime} is Scott closed.

Claim 1: B\downarrow\!B is closed for the sups\mathrm{sups} of any uncountable chain contained in B\downarrow\!B.

Assume that {u.s:uW}B\{u.s^{\prime}:u\in W\}\subseteq\;\downarrow\!B be an uncountable chain. Then there exists suBs_{u}\in B such that u.ssuu.s^{\prime}\sqsubseteq s_{u} for each uWu\in W. If for any uWu\in W, u.s=suu.s^{\prime}=s_{u} or u.s1suu.s^{\prime}\sqsubset_{1}s_{u}, then {su:uW}\{s_{u}:u\in W\} is an uncountable chain of BB, so supuWsuB\sup_{u\in W}s_{u}\in B by the assumption that BB is closed for the sups\mathrm{sups} of any uncountable non-trivial chain. This yields that supuWu.s=ssupuWsu\sup_{u\in W}u.s^{\prime}=s^{\prime}\sqsubseteq\sup_{u\in W}s_{u}. If there exists u.s2suu^{\prime}.s^{\prime}\sqsubset_{2}s_{u^{\prime}}, then u.s2suu.s^{\prime}\sqsubset_{2}s_{u^{\prime}} for all uWu\in W. Thus s=sus^{\prime}=s_{u^{\prime}} or s2sus^{\prime}\sqsubset_{2}s_{u^{\prime}}. The case of which there exists u.s2;1suu^{\prime}.s^{\prime}\sqsubset_{2};\sqsubset_{1}s_{u^{\prime}} is similar to the former. So supuWu.s=sB\sup_{u\in W}u.s^{\prime}=s^{\prime}\in\downarrow\!B.

Claim 2: BB^{\prime} is Scott closed.

Let {v.s:vW1}\{v.s:v\in W_{1}\} be a non-trivial chain of BB^{\prime} with W1𝕎W_{1}\subseteq\mathbb{W} being uncountable. Then there exists CvBC_{v}\subseteq B being a countable chain such that v.ssupCvv.s\sqsubseteq\sup C_{v} for any vW1v\in W_{1}. We distinguish the following two cases:

Case 1, For each vW1v\in W_{1}, v.s=supCvv.s=\sup C_{v} or v.s1supCvv.s\sqsubset_{1}\sup C_{v}. If {supCv:vW1}\{\sup C_{v}:v\in W_{1}\} is uncountable, then there must exist W2𝕎W_{2}\subseteq\mathbb{W} being uncountable such that {a.s:aW2}\{a.s:a\in W_{2}\} is a cofinal subset of vW1Cv\bigcup_{v\in W_{1}}C_{v}. By Claim 11, we have s=supaW2a.sBs=\sup_{a\in W_{2}}a.s\in\ \downarrow\!B. Thus sBs\in B^{\prime}. If {supCv:vW1}\{\sup C_{v}:v\in W_{1}\} is countable, then there exists a vW1v^{\prime}\in W_{1} such that the set {v.s:vW1,v.s1supCv}\{v.s:v\in W_{1},v.s\sqsubset_{1}\sup C_{v^{\prime}}\} is uncountable, which implies that {v.s:vW1,v.s1supCv}\{v.s:v\in W_{1},v.s\sqsubset_{1}\sup C_{v^{\prime}}\} is a cofinal subset of {v.s:vW1}\{v.s:v\in W_{1}\}. It follows that vv0v\leq v_{0} if we set supCv\sup C_{v^{\prime}} as v0.sv_{0}.s for some v0𝕎v_{0}\in\mathbb{W}. This means that W1{a𝕎:av0}W_{1}\subseteq\{a\in\mathbb{W}:a\leq v_{0}\}. So we can obtain that W1W_{1} is a countable set, which is impossible.

Case 2, There exists v0W1v_{0}\in W_{1} such that v0.s2supCv0v_{0}.s\sqsubset_{2}\sup C_{v_{0}} or v0.s2;1supCv0v_{0}.s\sqsubset_{2};\sqsubset_{1}\sup C_{v_{0}} (since the proof of the two cases are similar, we omit that of the latter). Then we have v.s2supCv0v.s\sqsubset_{2}\sup C_{v_{0}} for all vW1v\in W_{1}. Hence, supvW1v.s=s=supCv0\sup_{v\in W_{1}}v.s=s=\sup C_{v_{0}} or supvW1v.s=s2supCv0\sup_{v\in W_{1}}v.s=s\sqsubset_{2}\sup C_{v_{0}}, so sBs\in B^{\prime}.

So we have proved that BB^{\prime} is closed for the sups\mathrm{sups} of any uncountable chain. Ones sees obviously that BB^{\prime} is closed for the sups\mathrm{sups} of any countable chain and BB^{\prime} is a lower set. We can conclude that BB^{\prime} is Scott closed. ∎

Lemma 4.12.

Let AA be a Scott closed irreducible subset of 𝒵\mathcal{Z}. Then supf(A)\sup f(A) exists and supf(A)f(A)\sup f(A)\in f(A), where ff is the Scott continuous map defined in Proposition 4.10.

Proof.

By reason that AA is irreducible in 𝒵\mathcal{Z} and ff is Scott continuous, we have f(A)¯IRR(𝒯)\overline{f(A)}\in I\!R\!R(\mathcal{T}). Then there exists s0𝕎s_{0}\in\mathbb{W}^{*} such that f(A)¯={s0}¯=s0\overline{f(A)}=\overline{\{s_{0}\}}=\ \downarrow\!\!s_{0} from the sobriety of 𝒯\mathcal{T}, which results in supf(A)=s0\sup f(A)=s_{0}. It suffices to show that s0f(A)s_{0}\in f(A).

𝐂𝐥𝐚𝐢𝐦𝟏\mathbf{Claim~{}1}: f(A)f(A) is closed for the sups\mathrm{sups} of any uncountable non-trivial chain, and a lower set.

Due to the item (2) in Remark 4.9, the result that f(A)f(A) is a lower set follows immediately. Let {u.s:uW}\{u.s:u\in W\} be an uncountable non-trivial chain in f(A)f(A). If for any uWu\in W, Au.sA_{u.s} is uncountable, where Au.s={m𝕎:(m,u.s)A}A_{u.s}=\{m\in\mathbb{W}:(m,u.s)\in A\}, then Lu.sAL_{u.s}\subseteq A by Lemma 4.7, so for each m𝕎,{(m,u.s):uW}Am\in\mathbb{W},\{(m,u.s):u\in W\}\subseteq A. Because WW is uncountable and AA is Scott closed, supuW(m,u.s)=(m,s)A\sup_{u\in W}(m,u.s)=(m,s)\in A for any m𝕎m\in\mathbb{W}. It follows that sf(A)s\in f(A). If Au.sA_{u^{\prime}.s} is countable for some uWu^{\prime}\in W, then the fact that AA is a lower set implies that Au.sAu.sA_{u.s}\subseteq A_{u^{\prime}.s} for any uuu\geq u^{\prime}. This means that Au.sA_{u.s} is countable for any uuu\geq u^{\prime}, which guarantees the existence of u1uu_{1}\geq u^{\prime} with the property Au.s=Au1.sA_{u.s}=A_{u_{1}.s} for all uu1u\geq u_{1}, owing to the uncountability of WW. Thus for each mAu1.s,{(m,u.s):uu1}Am\in A_{u_{1}.s},\{(m,u.s):u\geq u_{1}\}\subseteq A. Therefore, we have supuu1(m,u.s)=(m,s)A\sup_{u\geq u_{1}}(m,u.s)=(m,s)\in A for any mAu1.sm\in A_{u_{1}.s} as AA is Scott closed, that is, sf(A)s\in f(A).

Assume for the sake of a contradiction that s0f(A)s_{0}\notin f(A). By Claim 1, we know f(A)¯=f(A)\overline{f(A)}=f(A)^{\prime}. This infers that s0f(A)¯f(A)=f(A)f(A)s_{0}\in\overline{f(A)}\setminus f(A)=f(A)^{\prime}\setminus f(A), where

f(A)={supC:Cf(A)=f(A)isacountablechain}f(A)^{\prime}=\bigcup\{\downarrow\!\sup C:C\subseteq\;\downarrow\!f(A)=f(A)\ \mathrm{is}\ \mathrm{a}\ \mathrm{countable}\ \mathrm{chain}\}.

This implies that there exists a countable chain Cf(A)C\subseteq f(A) satisfying s0=supCs_{0}=\sup C. Assume that supC=supuDu.s=supD.s\sup C=\sup_{u\in D}u.s^{\prime}=\sup D.s^{\prime}, where D𝕎D\subseteq\mathbb{W} is a countable subset, that is, s0=supD.ss_{0}=\sup D.s^{\prime}. Then there must exist uDu^{\prime}\in D such that Au.sA_{u^{\prime}.s^{\prime}} is countable. If not, Au.sA_{u.s^{\prime}} is uncountable for all uDu\in D, then Lu.sAL_{u.s^{\prime}}\subseteq A by Lemma 4.7, and for each m𝕎m\in\mathbb{W}, {(m,u.s):uD}A\{(m,u.s^{\prime}):u\in D\}\subseteq A, which reveals that (m,s0)=(m,supuDu.s)A(m,s_{0})=(m,\sup_{u\in D}u.s^{\prime})\in A, that is, s0f(A)s_{0}\in f(A), a contradiction. Thus Au.sA_{u^{\prime}.s^{\prime}} is countable for some uDu^{\prime}\in D. This guarantees the existence of supAu.s\sup A_{u^{\prime}.s^{\prime}}. Now we let m0=supAu.sm_{0}=\sup A_{u^{\prime}.s^{\prime}}, B={sf(A):su.s}B=\{s\in f(A):s\geq u^{\prime}.s^{\prime}\}. Set

P=sBmAs(m,s)(m0,s0)P=\bigcup_{s\in B}\bigcup_{m\in A_{s}}\downarrow\!(m,s)\bigcup\downarrow\!(m_{0},s_{0}).

𝐂𝐥𝐚𝐢𝐦𝟐\mathbf{Claim~{}2}: PP is Scott closed.

Let {(a,u.s):uD}\{(a,u.s):u\in D^{\prime}\} be a non-trivial chain in PP. If {(a,u.s):uD}(m0,s0)\{(a,u.s):u\in D^{\prime}\}\bigcap\downarrow\!(m_{0},s_{0}) is cofinal in {(a,u.s):uD}\{(a,u.s):u\in D^{\prime}\}, then obviously, supuD(a,u.s)\sup_{u\in D^{\prime}}(a,u.s) is less than or equal to (m0,s0)(m_{0},s_{0}). Therefore, it belongs to PP. If {(a,u.s):uD}(sBmAs(m,s))\{(a,u.s):u\in D^{\prime}\}\bigcap\,(\bigcup_{s\in B}\bigcup_{m\in A_{s}}\downarrow\!(m,s)) is cofinal in {(a,u.s):uD}\{(a,u.s):u\in D^{\prime}\}, then for any uDu\in D^{\prime}, there exist suBs_{u}\in B and muAsum_{u}\in A_{s_{u}} such that (a,u.s)<(mu,su)(a,u.s)<(m_{u},s_{u}). Let

A<r={(a,u.s):uDand(a,u.s)<r(mu,su)forsomesuB,muAsu}A_{<_{r}}=\{(a,u.s):u\in D^{\prime}\ \mathrm{and}\ (a,u.s)<_{r}(m_{u},s_{u})\ \mathrm{for}\ \mathrm{some}\ s_{u}\in B,\ m_{u}\in A_{s_{u}}\},

and

U<r={uD:(a,u.s)A<r}U_{<_{r}}=\{u\in D^{\prime}:(a,u.s)\in A_{<_{r}}\},

where <r{<1,<2,<3,<2;<1,<3;<1}<_{r}\in\{<_{1},\;<_{2},\;<_{3},\;<_{2};<_{1},\;<_{3};<_{1}\}. Now we need to distinguish the following cases.

Case 1, A<1A_{<_{1}} is cofinal in {(a,u.s):uD}\{(a,u.s):u\in D^{\prime}\}. For any (a,u.s)A<1(a,u.s)\in A_{<_{1}}, there exist suBs_{u}\in B and muAsum_{u}\in A_{s_{u}} such that (a,u.s)<1(mu,su)(a,u.s)<_{1}(m_{u},s_{u}). Then mu=am_{u}=a and {su:uU<1}\{s_{u}:u\in U_{<_{1}}\} is a chain contained in BB, so supuU<1su\sup_{u\in U_{<_{1}}}s_{u} exists and (a,supuU<1su)A(a,\sup_{u\in U_{<_{1}}}s_{u})\in A. This means that supuU<1suB\sup_{u\in U_{<_{1}}}s_{u}\in B and supuD(a,u.s)(a,supuU<1su)\sup_{u\in D^{\prime}}(a,u.s)\leq(a,\sup_{u\in U_{<_{1}}}s_{u}). We conclude that supuD(a,u.s)P\sup_{u\in D^{\prime}}(a,u.s)\in P.

Case 2, A<2A_{<_{2}} or A<2;<1A_{<_{2};<_{1}} is cofinal in {(a,u.s):uD}\{(a,u.s):u\in D^{\prime}\}. It is easy to verify that supuD(a,u.s)P\sup_{u\in D^{\prime}}(a,u.s)\in P , so we omit the proof here.

Case 3, A<3A_{<_{3}} is cofinal in {(a,u.s):uD}\{(a,u.s):u\in D^{\prime}\}. For any (a,u.s)A<3(a,u.s)\in A_{<_{3}}, there exist suBs_{u}\in B and muAsum_{u}\in A_{s_{u}} such that (a,u.s)<3(mu,su)(a,u.s)<_{3}(m_{u},s_{u}), so suss_{u}\subseteq s. The finiteness of the length of ss ensures the existence of su0Bs_{u_{0}}\in B such that {(a,u.s):uU<3,(a,u.s)<3(mu,su0)}\{(a,u.s):u\in U_{<_{3}},(a,u.s)<_{3}(m_{u},s_{u_{0}})\} is cofinal in A<3A_{<_{3}}. Assume that s=tsu0s=ts_{u_{0}}, then min(ut)mu\min(ut)\leq m_{u}. If t=εt=\varepsilon or umintu\leq\min t for all uU<3u\in U_{<_{3}}, then umuu\leq m_{u} for any uU<3u\in U_{<_{3}} and DD^{\prime} is countable under this condition. It follows that Asu0Au.sA_{s_{u_{0}}}\subseteq A_{u^{\prime}.s^{\prime}} as su0u.ss_{u_{0}}\sqsupseteq u^{\prime}.s^{\prime}. This indicates that supD=supU<3supuU<3mum0\sup D^{\prime}=\sup U_{<_{3}}\leq\sup_{u\in U_{<_{3}}}m_{u}\leq m_{0}. Thus that supuD(a,u.s)<3(m0,su0)<(m0,s0)\sup_{u\in D^{\prime}}(a,u.s)<_{3}(m_{0},s_{u_{0}})<(m_{0},s_{0}) holds. Else, tεt\neq\varepsilon and there is a u1Du_{1}\in D^{\prime} such that u1>mintu_{1}\!>\min t. Then we have mintmu1\min t\leq m_{u_{1}} according to (a,u1.s)<3(mu1,su0)(a,u_{1}.s)<_{3}(m_{u_{1}},s_{u_{0}}), which leads that supuD(a,u.s)<3(mu1,su0)\sup_{u\in D^{\prime}}(a,u.s)<_{3}(m_{u_{1}},s_{u_{0}}). Hence supuD(a,u.s)P\sup_{u\in D^{\prime}}(a,u.s)\in P.

Case 4, A<3;<1A_{<_{3};<_{1}} is cofinal in {(a,u.s):uD}\{(a,u.s):u\in D^{\prime}\}. For any (a,u.s)A<3;<1(a,u.s)\in A_{<_{3};<_{1}}, there exist suBs_{u}\in B and muAsum_{u}\in A_{s_{u}} such that (a,u.s)<3;<1(mu,su)(a,u.s)<_{3};<_{1}(m_{u},s_{u}), that is, (a,u.s)<3(mu,su)<1(mu,su)(a,u.s)<_{3}(m_{u},s_{u}^{\prime})<_{1}(m_{u},s_{u}) for some su𝕎s_{u}^{\prime}\in\mathbb{W}^{*}. Then there exists s𝕎s^{*}\in\mathbb{W}^{*} such that {(a,u.s):uU<3;<1and(a,u.s)<3(mu,s)<1(mu,su)}\{(a,u.s):u\in U_{<_{3};<_{1}}\ \mathrm{and}\ (a,u.s)<_{3}(m_{u},s^{*})<_{1}(m_{u},s_{u})\} is cofinal in A<3;<1A_{<_{3};<_{1}} as the length of ss is finite and suss_{u}^{\prime}\subseteq s. The rest of the proof is similar to Case 33. Thus we have supuD(a,u.s)P\sup_{u\in D^{\prime}}(a,u.s)\in P.

Therefore, PP is Scott closed.

Note that AP(AP)¯A\subseteq P\cup\overline{(A\setminus\!P)} and AA is irreducible. Then APA\subseteq P or AAP¯A\subseteq\overline{A\setminus\!P}.

Claim 3: APA\subseteq P.

Suppose APA\not\subseteq P. Then AAP¯A\subseteq\overline{A\setminus\!P}. The continuity of ff results in f(A)¯f(AP)¯\overline{f(A)}\subseteq\overline{f(A\setminus\!P)}. It follows that f(A)¯f(AP)\overline{f(A)}\subseteq f(A\setminus\!P)^{\prime} as f(AP)f(A\setminus\!P) is closed for the sups of any uncountable non-trivial chain (the proof is similar to that of f(A)f(A)). Then s0f(AP)s_{0}\in f(A\setminus\!P)^{\prime}. This means s0=supC0s_{0}=\sup C_{0} for some countable chain C0f(AP)C_{0}\subseteq\ \downarrow\!\!f(A\setminus\!P). Since s0=supuDu.ss_{0}=\sup_{u\in D}u.s^{\prime}, we can obtain that C0C_{0} is a cofinal subset of {u.suD}\{u.s^{\prime}\mid u\in D\}, which yields that there exists a s′′f(AP)s^{\prime\prime}\in f(A\setminus\!P) such that u.ss′′u^{\prime}.s^{\prime}\sqsubseteq s^{\prime\prime}. So we can find m𝕎m^{\prime}\in\mathbb{W} such that (m,s′′)AP(m^{\prime},s^{\prime\prime})\in A\setminus\!P. However, according to the construction of PP, the result that (m,s′′)P(m^{\prime},s^{\prime\prime})\in P follows immediately, which is a contradiction to the fact that (m,s′′)A\P(m^{\prime},s^{\prime\prime})\in A\backslash P. Hence, APA\subseteq P.

Now we claim that for any uDu\in D, there is a uuu^{*}\geq u such that Au.sAu.sA_{u^{*}.s^{\prime}}\subsetneqq A_{u.s^{\prime}}. Suppose not, if there is a uDu^{*}\in D such that for any uDu\in D with uuu\geq u^{*}, Au.s=Au.sA_{u.s^{\prime}}=A_{u^{*}.s^{\prime}}, then for each mAu.sm\in A_{u^{*}.s^{\prime}}, {(m,u.s):uD,uu}A\{(m,u.s^{\prime}):u\in D,u\geq u^{*}\}\subseteq A, and we know that (m,s0)=(m,supuuDu.s)A(m,s_{0})=(m,\sup_{u\in\uparrow\!u^{*}\cap D}u.s^{\prime})\in A, which contradicts the assumption that s0f(A)s_{0}\notin f(A).

Thus for any uDu\in D, there is a uuu^{*}\geq u such that Au.sAu.sA_{u^{*}.s^{\prime}}\subsetneqq A_{u.s^{\prime}}. It follows that for uDu^{\prime}\in D, we can find u′′Du^{\prime\prime}\in D such that u′′>uu^{\prime\prime}>u^{\prime}, Au′′.sAu.sA_{u^{\prime\prime}.s^{\prime}}\subsetneqq A_{u^{\prime}.s^{\prime}}. The assumption that s0f(A)s_{0}\notin f(A) reveals that m0Au1.sm_{0}\notin A_{u_{1}.s^{\prime}} for some u1>u′′u_{1}>u^{\prime\prime}. It turns out that there is u2>u1u_{2}>u_{1} in DD satisfying that Au2.sAu1.sA_{u_{2}.s^{\prime}}\subsetneqq A_{u_{1}.s^{\prime}}. Write E={uD:Au.s=Au1.s}E=\{u\in D:A_{u.s^{\prime}}=A_{u_{1}.s^{\prime}}\}. The Scott closedness of AA indicates that supEE\sup E\in E. Let u^=supE\hat{u}=\sup E. Then Au^+1.sAu^.sA_{\hat{u}+1.s^{\prime}}\subsetneqq A_{\hat{u}.s^{\prime}} as u^+1E\hat{u}+1\notin E and u^+1u2\hat{u}+1\leq u_{2}, which yields Au2.sAu^+1.sA_{u_{2}.s^{\prime}}\subseteq A_{\hat{u}+1.s^{\prime}}. Note that Au2.sA_{u_{2}.s^{\prime}} is nonempty by reason of u2.sf(A)u_{2}.s^{\prime}\in f(A). Then Au^+1.sA_{\hat{u}+1.s^{\prime}} is nonempty. Pick m1Au^.sAu^+1.sm_{1}\in A_{\hat{u}.s^{\prime}}\setminus A_{\hat{u}+1.s^{\prime}}. We can get that m0m1m_{0}\neq m_{1} from Au^.s=Au1.sA_{\hat{u}.s^{\prime}}=A_{u_{1}.s^{\prime}}.

Now we set Q=(P(m1,u^.s))Q=\downarrow\!(P\setminus\downarrow\!(m_{1},\hat{u}.s^{\prime})), then P=(m1,u^.s)QP=\downarrow\!(m_{1},\hat{u}.s^{\prime})\cup Q.

𝐂𝐥𝐚𝐢𝐦𝟒\mathbf{Claim~{}4}: QQ is Scott closed.

By the construction of PP, we know

Q=(sBmAs(m,s)(m1,u^.s))((m0,s0)(m1,u^.s))Q=\downarrow(\bigcup_{s\in B}\bigcup_{m\in A_{s}}\downarrow\!(m,s)\setminus\downarrow\!(m_{1},\hat{u}.s^{\prime}))\bigcup\downarrow(\downarrow\!(m_{0},s_{0})\setminus\downarrow\!(m_{1},\hat{u}.s^{\prime})).

The set QQ is obviously a lower set. So it remains to prove that QQ is closed for the sups\mathrm{sups} of any non-trivial chain. To begin with, we first notice that (m0,s0)(m1,u^.s)(m_{0},s_{0})\notin\downarrow\!(m_{1},\hat{u}.s^{\prime}). Suppose (m0,s0)(m1,u^.s)(m_{0},s_{0})\leq(m_{1},\hat{u}.s^{\prime}), then (m0,s0)A(m_{0},s_{0})\in A because of the fact that (m1,u^.s)A(m_{1},\hat{u}.s^{\prime})\in A, which is a contradiction to the assumption that s0f(A)s_{0}\notin f(A). It follows that ((m0,s0)(m1,u^.s))=(m0,s0)\downarrow(\downarrow\!(m_{0},s_{0})\setminus\downarrow\!(m_{1},\hat{u}.s^{\prime}))=\mathord{\downarrow}(m_{0},s_{0}). In other words,

Q=(sBmAs(m,s)(m1,u^.s))(m0,s0)Q=\downarrow(\bigcup_{s\in B}\bigcup_{m\in A_{s}}\downarrow\!(m,s)\setminus\downarrow\!(m_{1},\hat{u}.s^{\prime}))\bigcup\downarrow\!(m_{0},s_{0}).

Let {(a,u.s):uD0}\{(a,u.s):u\in D_{0}\} be a non-trivial chain in QQ. If {(a,u.s):uD0}(m0,s0)\{(a,u.s):u\in D_{0}\}\bigcap\downarrow(m_{0},s_{0}) is cofinal in {(a,u.s):uD0}\{(a,u.s):u\in D_{0}\}, then supuD0(a,u.s)(m0,s0)\sup_{u\in D_{0}}(a,u.s)\leq(m_{0},s_{0}). Else, {(a,u.s):uD0}(sBmAs(m,s)(m1,u^.s))\{(a,u.s):u\in D_{0}\}\bigcap\downarrow(\bigcup_{s\in B}\bigcup_{m\in A_{s}}\downarrow\!(m,s)\setminus\downarrow\!(m_{1},\hat{u}.s^{\prime})) is cofinal in {(a,u.s):uD0}\{(a,u.s):u\in D_{0}\}. Then, for any uD0u\in D_{0}, there exists suB,muAsus_{u}\in B,m_{u}\in A_{s_{u}} such that (a,u.s)<(mu,su)(a,u.s)<(m_{u},s_{u}) and (mu,su)(m1,u^.s)(m_{u},s_{u})\nleq(m_{1},\hat{u}.s^{\prime}). We set

A<r={(a,u.s):uD0,suB,muAsuwith(mu,su)(m1,u^.s)s.t.(a,u.s)<r(mu,su)}A_{<_{r}}=\{(a,u.s):u\in D_{0},\ \exists s_{u}\in B,m_{u}\in A_{s_{u}}\ \mathrm{with}\ (m_{u},s_{u})\nleq(m_{1},\hat{u}.s^{\prime})\ \mathrm{s.t.}\ (a,u.s)<_{r}(m_{u},s_{u})\},

and

U<r={uD0:(a,u.s)A<r}U_{<_{r}}=\{u\in D_{0}:(a,u.s)\in A_{<_{r}}\},

where <r{<1,<2,<3,<2;<1,<3;<1}<_{r}\in\{<_{1},\ <_{2},\ <_{3},\ <_{2};<_{1},\ <_{3};<_{1}\}. Now we need to distinguish the following cases.

Case 1, A<1A_{<_{1}} is cofinal in {(a,u.s):uD0}\{(a,u.s):u\in D_{0}\}. For any (a,u.s)A<1(a,u.s)\in A_{<_{1}}, there exist suBs_{u}\in B and muAsum_{u}\in A_{s_{u}} with (mu,su)(m1,u^.s)(m_{u},s_{u})\nleq(m_{1},\hat{u}.s^{\prime}) such that (a,u.s)<1(mu,su)(a,u.s)<_{1}(m_{u},s_{u}). Then we have mu=am_{u}=a and {su:uU<1}\{s_{u}:u\in U_{<_{1}}\} is a chain in BB. It follows that (a,supuU<1su)A(a,\sup_{u\in U_{<_{1}}}s_{u})\in A from the Scott closedness of AA. Furthermore, supuD0(a,u.s)(a,supuU<1su)\sup_{u\in D_{0}}(a,u.s)\leq(a,\sup_{u\in U_{<_{1}}}s_{u}). It is obvious that (a,supuU<1su)⩽̸(m1,u^.s)(a,\sup_{u\in U_{<_{1}}}s_{u})\nleqslant(m_{1},\hat{u}.s^{\prime}) since (a,su)⩽̸(m1,u^.s)(a,s_{u})\nleqslant(m_{1},\hat{u}.s^{\prime}) for each uU<1u\in U_{<_{1}}. So we have supuD0(a,u.s)Q\sup_{u\in D_{0}}(a,u.s)\in Q.

Case 2, A<2A_{<_{2}} or A<2;<1A_{<_{2};<_{1}} is cofinal in {(a,u.s):uD0}\{(a,u.s):u\in D_{0}\}. Clearly, supuD0(a,u.s)Q\sup_{u\in D_{0}}(a,u.s)\in Q in this case.

Case 3, A<3A_{<_{3}} is cofinal in {(a,u.s):uD0}\{(a,u.s):u\in D_{0}\}. For any (a,u.s)A<3(a,u.s)\in A_{<_{3}}, there exist suBs_{u}\in B and muAsum_{u}\in A_{s_{u}} with (mu,su)(m1,u^.s)(m_{u},s_{u})\nleq(m_{1},\hat{u}.s^{\prime}) such that (a,u.s)<3(mu,su)(a,u.s)<_{3}(m_{u},s_{u}). Then suss_{u}\subseteq s. Since the length of ss is finite, there exists su0Bs_{u_{0}}\in B such that {(a,u.s):uU<3,(a,u.s)<3(mu,su0)}\{(a,u.s):u\in U_{<_{3}},(a,u.s)<_{3}(m_{u},s_{u_{0}})\} is cofinal in A<3A_{<_{3}}. Let s=tsu0s=ts_{u_{0}}. Then min(ut)mu\min(ut)\leq m_{u} and muAsu0Au.sm_{u}\in A_{s_{u_{0}}}\subseteq A_{u^{\prime}.s^{\prime}} for all uu. If t=εt=\varepsilon or umintu\leq\min t for each uu, then u=min(ut)muu=\min(ut)\leq m_{u}, which implies that supU<3m0,supU<3mint\sup U_{<_{3}}\leq m_{0},\sup U_{<_{3}}\leq\min t and D0D_{0} is countable. So supuD0(a,u.s)<3(m0,su0)(m0,s0)\sup_{u\in D_{0}}(a,u.s)<_{3}(m_{0},s_{u_{0}})\leq(m_{0},s_{0}). Thus supuD0(a,u.s)Q\sup_{u\in D_{0}}(a,u.s)\in Q. If tεt\neq\varepsilon and u1>mintu_{1}>\min t for some u1U<3u_{1}\in U_{<_{3}}, then mintmu1\min t\leq m_{u_{1}}, which yields that supuD0(a,u.s)<3(mu1,su0)\sup_{u\in D_{0}}(a,u.s)<_{3}(m_{u_{1}},s_{u_{0}}). This means that supuD0(a,u.s)Q\sup_{u\in D_{0}}(a,u.s)\in Q by the fact that (mu1,su0)(m1,u^.s)(m_{u_{1}},s_{u_{0}})\nleq(m_{1},\hat{u}.s^{\prime}).

Case 4, A<3;<1A_{<_{3};<_{1}} is cofinal in {(a,u.s):uD0}\{(a,u.s):u\in D_{0}\}. For any (a,u.s)A<3;<1(a,u.s)\in A_{<_{3};<_{1}}, there exist suBs_{u}\in B and muAsum_{u}\in A_{s_{u}} with (mu,su)(m1,u^.s)(m_{u},s_{u})\nleq(m_{1},\hat{u}.s^{\prime}) such that (a,u.s)<3;<1(mu,su)(a,u.s)<_{3};<_{1}(m_{u},s_{u}), that is, there is a sus_{u}^{\prime} for each uu such that (a,u.s)<3(mu,su)<1(mu,su)(a,u.s)<_{3}(m_{u},s_{u}^{\prime})<_{1}(m_{u},s_{u}). We can also find s𝕎s^{*}\in\mathbb{W}^{*} to make {(a,u.s):uU<3;<1,(a,u.s)<3(mu,s)<1(mu,su)}\{(a,u.s):u\in U_{<_{3};<_{1}},(a,u.s)<_{3}(m_{u},s^{*})<_{1}(m_{u},s_{u})\} cofinal in A<3;<1A_{<_{3};<_{1}}. Then with a process similar to that in Case 33, we conclude that supuD0(a,u.s)Q\sup_{u\in D_{0}}(a,u.s)\in Q.

Therefore, QQ is Scott closed. Since APA\subseteq P is irreducible in 𝒵\mathcal{Z}, we have A(m1,u^.s)A\subseteq\ \downarrow\!(m_{1},\hat{u}.s^{\prime}) or AQ=(P(m1,u^.s))A\subseteq Q=\ \downarrow\!(P\setminus\downarrow\!(m_{1},\hat{u}.s^{\prime})). If A(m1,u^.s)A\subseteq\ \downarrow\!(m_{1},\hat{u}.s^{\prime}), then for any mAu^+1.sm\in A_{\hat{u}+1.s^{\prime}}, (m,u^+1.s)A(m1,u^.s)(m,\hat{u}+1.s^{\prime})\in A\subseteq\ \downarrow\!(m_{1},\hat{u}.s^{\prime}). This means that u^+1.su^.s\hat{u}+1.s^{\prime}\leq\hat{u}.s^{\prime}, a contradiction. Thus AQ=(P(m1,u^.s))A\subseteq Q=\ \downarrow\!(P\setminus\downarrow\!(m_{1},\hat{u}.s^{\prime})). It follows that (m1,u^.s)(P(m1,u^.s))(m_{1},\hat{u}.s^{\prime})\in\ \downarrow\!(P\setminus\downarrow\!(m_{1},\hat{u}.s^{\prime})), that is, there exists (m2,s2)P(m1,u^.s)(m_{2},s_{2})\in P\setminus\downarrow\!(m_{1},\hat{u}.s^{\prime}) such that (m1,u^.s)(m2,s2)(m_{1},\hat{u}.s^{\prime})\leq(m_{2},s_{2}). Now we need to distinguish the following two cases.

Case 11, (m2,s2)(sBmAs(m,s)(m1,u^.s))(m_{2},s_{2})\in(\bigcup_{s\in B}\bigcup_{m\in A_{s}}\downarrow\!(m,s)\setminus\downarrow\!(m_{1},\hat{u}.s^{\prime})). Then (m2,s2)(m3,s3)(m_{2},s_{2})\leq(m_{3},s_{3}), where s3Bs_{3}\in B, m3As3m_{3}\in A_{s_{3}} and (m3,s3)(m1,u^.s)(m_{3},s_{3})\nleq(m_{1},\hat{u}.s^{\prime}). Via (m1,u^.s)(m2,s2)(m3,s3)(m_{1},\hat{u}.s^{\prime})\leq(m_{2},s_{2})\leq(m_{3},s_{3}), we have u^.ss2s3s0=supuDu.s\hat{u}.s^{\prime}\sqsubseteq s_{2}\sqsubseteq s_{3}\sqsubset s_{0}=\sup_{u\in D}u.s^{\prime}. So m1=m2=m3m_{1}=m_{2}=m_{3}. The assumption that (m3,s3)⩽̸(m1,u^.s)(m_{3},s_{3})\nleqslant(m_{1},\hat{u}.s^{\prime}) indicates that (m1,u^.s)<1(m3,s3)(m_{1},\hat{u}.s^{\prime})<_{1}(m_{3},s_{3}). Then u^.s1s3\hat{u}.s^{\prime}\sqsubset_{1}s_{3}. This implies (u^+1).s1s3(\hat{u}\!+\!1).s^{\prime}\sqsubset_{1}s_{3} or (u^+1).s=s3(\hat{u}\!+\!1).s^{\prime}=s_{3}. Hence, it turns out that (u^+1).ss3(\hat{u}\!\!+\!\!1).s^{\prime}\sqsubseteq s_{3}, which yields that As3Au^+1.sA_{s_{3}}\subseteq A_{\hat{u}+1.s^{\prime}} and m1Au^+1.sm_{1}\in A_{\hat{u}+1.s^{\prime}} by reason of the fact that m1=m3As3m_{1}=m_{3}\in A_{s_{3}}. This is a contradiction to the assumption that m1Au^+1.sm_{1}\notin A_{\hat{u}+1.s^{\prime}}.

Case 22, (m2,s2)(m0,s0)(m1,u^.s)(m_{2},s_{2})\in\downarrow\!(m_{0},s_{0})\setminus\downarrow\!(m_{1},\hat{u}.s^{\prime}). Then (m1,u^.s)<(m2,s2)<(m0,s0)(m_{1},\hat{u}.s^{\prime})<(m_{2},s_{2})<(m_{0},s_{0}). This means that u^.s1s0\hat{u}.s^{\prime}\sqsubset_{1}s_{0}, which leads that m1=m0m_{1}=m_{0}. It violates the assumption that m1m0m_{1}\neq m_{0}.

In a conclusion, s0f(A)s_{0}\in f(A). ∎

Theorem 4.13.

The irreducible closed subsets of 𝒵\mathcal{Z} are just closures of single elements and the closures of levels.

Proof.

Let AA be an irreducible closed subset of 𝒵\mathcal{Z} and s0=supf(A)s_{0}=\sup f(A). Then we have s0f(A)s_{0}\in f(A) by Lemma 4.12, which implies that As0A_{s_{0}}\neq\emptyset and f(A)s0f(A)\subseteq\ \downarrow\!s_{0}, it is equal to saying that ALs0A\subseteq\ \downarrow\!L_{s_{0}}. Next we want to show that A=Ls0A=\downarrow\!L_{s_{0}} or A=(m0,s0)A=\downarrow\!(m_{0},s_{0}) for some m0𝕎m_{0}\in\mathbb{W}. If As0A_{s_{0}} is uncountable, then Ls0AL_{s_{0}}\subseteq A and so A=Ls0A=\downarrow\!L_{s_{0}} holds. Else, the set As0A_{s_{0}} is countable, pick m0𝕎m_{0}\in\mathbb{W} such that (m0,s0)A(m_{0},s_{0})\in A. Let M=(A(m0,s0))M=\downarrow\!(A\setminus\downarrow\!(m_{0},s_{0})). Then A(m0,s0)MA\subseteq\ \downarrow\!(m_{0},s_{0})\bigcup M. Now we construct a Scott closed set WW containing MM. For MM, we know maxM\max M exists and maxM=max(A(m0,s0))\max M=\max(A\setminus\downarrow\!(m_{0},s_{0})). Let

E={sf(maxM):Msiscountable}E=\{s\in f(\max M):M_{s}\ \mathrm{is}\ \mathrm{countable}\},  B={sE:supMsMs}B=\{s\in E:\sup M_{s}\notin M_{s}\},

where Ms={m𝕎:(m,s)M}M_{s}=\{m\in\mathbb{W}:(m,s)\in M\}. And for any sBs\in B, we set

Ts={(Ms).t.p:p=sorp<1s,Msmintort=ε}T_{s}=\{(\vee M_{s}).t.p:p=s\ \mathrm{or}\ p<_{1}s,\ \vee M_{s}\leq\min t\ \mathrm{or}\ t=\varepsilon\}.

Now let W=sf(maxM)WsW=\bigcup_{s\in f(\max M)}W_{s}, where {Ws:sf(maxM)}\{W_{s}:s\in f(\max M)\} are defined as follows:

  • Ws=LsW_{s}=\downarrow\!L_{s} if sf(maxM)Es\in f(\max M)\setminus E

  • Ws=aMs(a,s)W_{s}=\bigcup_{a\in M_{s}}\downarrow\!(a,s) if sEBs\in E\setminus B

  • Ws=aMs(a,s)({LC:CsBTsisachain})W_{s}=\bigcup_{a\in M_{s}}\downarrow\!(a,s)\bigcup\,(\bigcup\{\downarrow\!L_{\vee C}:C\subseteq\bigcup_{s\in B}T_{s}\ \mathrm{is\ a\ chain}\}) if sBs\in B.

𝐂𝐥𝐚𝐢𝐦𝟏\mathbf{Claim~{}1}: If CsBTsC\subseteq\bigcup_{s\in B}T_{s} is a non-trivial chain, then CC is countable.

Assume that there exists an uncountable non-trivial chain C={u.s:uD}C=\{u.s:u\in D\} contained in sBTs\bigcup_{s\in B}T_{s}. Then for any u.sCu.s\in C, there is a suBs_{u}\in B such that u.sTsuu.s\in T_{s_{u}}, that is, u.s=(Msu).tu.puu.s=(\vee M_{s_{u}}).t_{u}.p_{u} with pu=suorpu1su,Msumintuortu=εp_{u}=s_{u}\ \mathrm{or}\ p_{u}\sqsubset_{1}s_{u},\ \vee M_{s_{u}}\leq\min t_{u}\ \mathrm{or}\ t_{u}=\varepsilon. It is easy to verify that susu′′s_{u^{\prime}}\neq s_{u^{\prime\prime}} and MsuMsu′′M_{s_{u^{\prime}}}\neq M_{s_{u^{\prime\prime}}}if uu′′u^{\prime}\neq u^{\prime\prime} for any u,u′′Du^{\prime},u^{\prime\prime}\in D. In addition, note that tu.pu=st_{u}.p_{u}=s for each uDu\in D, which means that spus\sqsubseteq p_{u}. The fact that pusup_{u}\sqsubseteq s_{u} for any uDu\in D suggests that {su:uD}s\{s_{u}:u\in D\}\subseteq\ \uparrow\!s. This reveals that {suuD}\{s_{u}\mid u\in D\} is a chain by Proposition 4.10, which ensures that we can find a cofinal subset {su:uD}\{s_{u}:u\in D^{\prime}\} of {su:uD}\{s_{u}:u\in D\} in which there is only the relation 1\sqsubset_{1} among all elements. For any u1,u2Du_{1},u_{2}\in D^{\prime} with u1<u2u_{1}<u_{2}, it turns out that Msu1<Msu2\vee M_{s_{u_{1}}}<\vee M_{s_{u_{2}}}. Note that for any s1,s2𝕎s_{1},s_{2}\in\mathbb{W}^{*} with s1s2s_{1}\sqsubseteq s_{2}, we can conclude that Ms2Ms1M_{s_{2}}\subseteq M_{s_{1}} because (m,s1)(m,s2)(m,s_{1})\leq(m,s_{2}) for any m𝕎m\in\mathbb{W} and MM is a lower set. Then the fact that {su:uD}\{s_{u}:u\in D^{\prime}\} is a chain infers that MsuMsu′′M_{s_{u^{\prime}}}\subsetneqq M_{s_{u^{\prime\prime}}} or Msu′′MsuM_{s_{u^{\prime\prime}}}\subsetneqq M_{s_{u^{\prime}}} for any u,u′′Du^{\prime},u^{\prime\prime}\in D^{\prime} with uu′′u^{\prime}\neq u^{\prime\prime}. Due to the assumption that Msu1<Msu2\vee M_{s_{u_{1}}}<\vee M_{s_{u_{2}}}, we can deduce that Msu1Msu2M_{s_{u_{1}}}\subsetneqq M_{s_{u_{2}}}, so su1su2s_{u_{1}}\!\sqsupseteq\!s_{u_{2}}. Now for a fixed u0Du_{0}\in D^{\prime}, we have {su:uD,u>u0}{s𝕎:s1su0}\{s_{u}:u\in D^{\prime},u>u_{0}\}\subseteq\{s\in\mathbb{W}^{*}:s\sqsubset_{1}s_{u_{0}}\}. Because DD is uncountable and u=Msuu=\vee M_{s_{u}} for any uDu\in D, the set {su:uD}\{s_{u}:u\in D\} is uncountable. It follows that {su:uD}\{s_{u}:u\in D^{\prime}\} is uncountable. Furthermore, {su:uD,u>u0}\{s_{u}:u\in D^{\prime},u>u_{0}\} is uncountable, which contradicts the fact that {s𝕎:s1su0}\{s\in\mathbb{W}^{*}:s\sqsubset_{1}s_{u_{0}}\} is countable.

𝐂𝐥𝐚𝐢𝐦𝟐\mathbf{Claim~{}2}: W=sf(maxM)WsW=\bigcup_{s\in f(\max M)}W_{s} is Scott closed.

One sees clearly that WW is a lower set. So it remains to confirm that WW is closed for the sups\mathrm{sups} of any non-trivial chain.

Let {(m,u.s):uD0}\{(m,u.s):u\in D_{0}\} be a non-trivial chain in WW, where D0𝕎D_{0}\subseteq\mathbb{W}. Now we need to distinguish the following cases.

Case 1, {(m,u.s):uD0}(sEaMs(a,s))\{(m,u.s):u\in D_{0}\}\bigcap\ (\bigcup_{s\in E}\bigcup_{a\in M_{s}}\downarrow\!(a,s)) is cofinal in {(m,u.s):uD0}\{(m,u.s):u\in D_{0}\}. For any uD0u\in D_{0}, there are suEs_{u}\in E and auMsua_{u}\in M_{s_{u}} such that (m,u.s)<(au,su)(m,u.s)<(a_{u},s_{u}), without loss of generality, assume that (au,su)maxM(a_{u},s_{u})\in\max M. We set

A<r={(m,u.s):uD0,(au,su)maxMwithsuEs.t.(m,u.s)<r(au,su)}A_{<_{r}}=\{(m,u.s):u\in D_{0},\exists(a_{u},s_{u})\in\max M\ \mathrm{with}\ s_{u}\in E\ s.t.\ (m,u.s)<_{r}(a_{u},s_{u})\}

and

U<r={uD0:(m,u.s)A<r}U_{<_{r}}=\{u\in D_{0}:(m,u.s)\in A_{<_{r}}\},

where <r{<1,<2,<3,<2;<1,<3;<1}<_{r}\in\{<_{1},\ <_{2},\ <_{3},\ <_{2};<_{1},\ <_{3};<_{1}\}.

Case 1.1, A<1A_{<_{1}} is cofinal in {(m,u.s):uD0}\{(m,u.s):u\in D_{0}\}. For any (m,u.s)A<1(m,u.s)\in A_{<_{1}}, there exists (au,su)maxM(a_{u},s_{u})\in\max M with suEs_{u}\in E such that (m,u.s)<1(au,su)(m,u.s)<_{1}(a_{u},s_{u}). Then au=ma_{u}=m and there is a unique (m,su0)(m,s_{u_{0}}) such that (m,u.s)<1(m,su0)(m,u.s)<_{1}(m,s_{u_{0}}) since (au,su)maxM(a_{u},s_{u})\in\max M for each uU<1u\in U_{<_{1}}. Thus supuD0(m,u.s)(m,su0)W\sup_{u\in D_{0}}(m,u.s)\leq(m,s_{u_{0}})\in W.

Case 1.2, A<2A_{<_{2}} or A<2;<1A_{<_{2};<_{1}} is cofinal in {(m,u.s):uD0}\{(m,u.s):u\in D_{0}\}. It can be easily verified that supuD0(a,u.s)W\sup_{u\in D_{0}}(a,u.s)\in W in both cases, so we omit the proof here.

Case 1.3, A<3A_{<_{3}} is cofinal in {(m,u.s):uD0}\{(m,u.s):u\in D_{0}\}. For any (m,u.s)A<3(m,u.s)\in A_{<_{3}}, there exists (au,su)maxM(a_{u},s_{u})\in\max M with suEs_{u}\in E such that (m,u.s)<3(au,su)(m,u.s)<_{3}(a_{u},s_{u}). We can find su0s_{u_{0}} such that {(m,u.s):uU<3,(m,u.s)<3(au,su0)}\{(m,u.s):u\in U_{<_{3}},(m,u.s)<_{3}(a_{u},s_{u_{0}})\} is cofinal in A<3A_{<_{3}} by reason that suss_{u}\subseteq s for each uU<3u\in U_{<_{3}} and the length of ss is finite. If su0EBs_{u_{0}}\in E\setminus B, that is, Msu0Msu0\vee M_{s_{u_{0}}}\!\in M_{s_{u_{0}}}, then auMsu0a_{u}\leq\vee M_{s_{u_{0}}}. It follows that (m,u.s)<3(Msu0,su0)(m,u.s)<_{3}(\vee M_{s_{u_{0}}},s_{u_{0}}) for each uu, which implies that supuD0(m,u.s)(Msu0,su0)M\sup_{u\in D_{0}}(m,u.s)\leq(\vee M_{s_{u_{0}}},s_{u_{0}})\in M. Hence, supuD0(m,u.s)W\sup_{u\in D_{0}}(m,u.s)\in W. Suppose that su0Bs_{u_{0}}\in B, that is, Msu0Msu0\vee M_{s_{u_{0}}}\!\!\notin M_{s_{u_{0}}}. Under this condition, we assume s=tsu0s=ts_{u_{0}}, where t=εt=\varepsilon or tεt\neq\varepsilon. In the case that tεt\neq\varepsilon and there exists a u1>mintu_{1}>\min t, then mintau1\min t\leq a_{u_{1}}, and so supuD0(m,u.s)<3(au1,su0)\sup_{u\in D_{0}}(m,u.s)<_{3}(a_{u_{1}},s_{u_{0}}). In the case that t=εt=\varepsilon or umintu\leq\min t for all uu, we can get that uauu\leq a_{u} for each uu. Since auMsu0a_{u}\in M_{s_{u_{0}}} and Msu0M_{s_{u_{0}}} is countable, D0D_{0} is countable under each case and supU<3Msu0\sup U_{<_{3}}\leq\vee M_{s_{u_{0}}}. Thus we have supuD0(m,u.s)=(m,U<3.t.su0)(m,Msu0.t.su0)\sup_{u\in D_{0}}(m,u.s)=(m,\vee U_{<_{3}}.t.s_{u_{0}})\leq(m,\vee M_{s_{u_{0}}}.t.s_{u_{0}}). Note that Msu0.t.su0Tsu0\vee M_{s_{u_{0}}}.t.s_{u_{0}}\in T_{s_{u_{0}}}. Hence, supuD0(m,u.s)W\sup_{u\in D_{0}}(m,u.s)\in W.

Case 1.4, A<3;<1A_{<_{3};<_{1}} is cofinal in {(m,u.s):uD0}\{(m,u.s):u\in D_{0}\}. The argument of this case is similar to the above case.

Case 2, {(m,u.s):uD0}(sf(maxM)ELs)\{(m,u.s):u\in D_{0}\}\bigcap\ (\bigcup_{s\in f(\max M)\setminus E}\downarrow\!L_{s}) is cofinal in {(m,u.s):uD0}\{(m,u.s):u\in D_{0}\}. For any uD0u\in D_{0}, there are suf(maxM)E,au𝕎s_{u}\in f(\max M)\setminus E,a_{u}\in\mathbb{W} such that (m,u.s)<(au,su)(m,u.s)<(a_{u},s_{u}). We set

A<r={(m,u.s):uD0,suf(maxM)E,au𝕎s.t.(m,u.s)<r(au,su)}A_{<_{r}}=\{(m,u.s):u\in D_{0},\exists s_{u}\in f(\max M)\setminus E,a_{u}\in\mathbb{W}\ s.t.\ (m,u.s)<_{r}(a_{u},s_{u})\}

and

U<r={uD0:(m,u.s)A<r}U_{<_{r}}=\{u\in D_{0}:(m,u.s)\in A_{<_{r}}\},

where <r{<1,<2,<3,<2;<1,<3;<1}<_{r}\in\{<_{1},\ <_{2},\ <_{3},\ <_{2};<_{1},\ <_{3};<_{1}\}.

Case 2.1, A<1A_{<_{1}} is cofinal in {(m,u.s):uD0}\{(m,u.s):u\in D_{0}\}. For any (m,u.s)A<1(m,u.s)\in A_{<_{1}}, there exist suf(maxM)Es_{u}\in f(\max M)\setminus E and au𝕎a_{u}\in\mathbb{W} such that (m,u.s)<1(au,su)(m,u.s)<_{1}(a_{u},s_{u}). Then au=m,u.s1sua_{u}=m,u.s\sqsubset_{1}s_{u}. It turns out that su=su′′s_{u^{\prime}}=s_{u^{\prime\prime}} or su1su′′s_{u^{\prime}}\sqsubset_{1}s_{u^{\prime\prime}}. As suf(maxM)Es_{u}\in f(\max M)\setminus E, that is, MsuM_{s_{u}} is uncountable for any uD0u\in D_{0}. Next, we claim that Msu=𝕎{m0}M_{s_{u}}=\mathbb{W}\setminus\{m_{0}\}. Assume that there is a mMsum\in M_{s_{u}} such that m=m0m=m_{0}. By (m,su)M=(A(m0,s0))(m,s_{u})\in M=\downarrow\!(A\setminus\downarrow\!(m_{0},s_{0})), we have (m,su)(m1,s1)(m,s_{u})\leq(m_{1},s_{1}) for some (m1,s1)A(m0,s0)(m_{1},s_{1})\in A\setminus\downarrow\!(m_{0},s_{0}). This indicates that m1m0m_{1}\neq m_{0}, or else, (m1,s1)(m0,s0)(m_{1},s_{1})\leq(m_{0},s_{0}) since s1f(A)s_{1}\in f(A) and s0=supf(A)s_{0}=\sup f(A), a contradiction. Thus (m,su)<3(m1,s1)(m,s_{u})<_{3}(m_{1},s_{1}) or (m,su)<3;<1(m1,s1)(m,s_{u})<_{3};<_{1}(m_{1},s_{1}). The assumption that suf(maxM)s_{u}\in f(\max M) guarantees the existence of nu𝕎n_{u}\in\mathbb{W} such that (nu,su)maxM(n_{u},s_{u})\in\max M. It follows that (nu,su)<3(m1,s1)(n_{u},s_{u})<_{3}(m_{1},s_{1}) or (nu,su)<3;<1(m1,s1)(n_{u},s_{u})<_{3};<_{1}(m_{1},s_{1}), which will result in a contradiction since there would be a maximal element of MM being strictly less than an element of MM. Therefore, Msu𝕎{m0}M_{s_{u}}\subseteq\mathbb{W}\setminus\{m_{0}\}. For the converse, By reason that AsuA_{s_{u}} contains a uncountable set MsuM_{s_{u}}, we know that LsuAL_{s_{u}}\subseteq A. Let m𝕎{m0}m\in\mathbb{W}\setminus\{m_{0}\}. If (m,su)(m0,s0)(m,s_{u})\leq(m_{0},s_{0}), then (m,su)<3(m0,s0)(m,s_{u})<_{3}(m_{0},s_{0}) or (m,su)<3;<1(m0,s0)(m,s_{u})<_{3};<_{1}(m_{0},s_{0}) since mm0m\neq m_{0}. By the assumption that suf(maxM)s_{u}\in f(\max M) again, we can find cu𝕎c_{u}\in\mathbb{W} satisfying (cu,su)maxM(c_{u},s_{u})\in\max M. Then (cu,su)<3(m0,s0)(c_{u},s_{u})<_{3}(m_{0},s_{0}) or (cu,su)<3;<1(m0,s0)(c_{u},s_{u})<_{3};<_{1}(m_{0},s_{0}), but this will contradict to the fact that (cu,su)maxMA(m0,s0)(c_{u},s_{u})\in\max M\subseteq A\setminus\downarrow\!(m_{0},s_{0}). Hence, we can obtain 𝕎{m0}=Msu\mathbb{W}\setminus\{m_{0}\}=M_{s_{u}}. Now suppose that there are u1,u2D0u_{1},u_{2}\in D_{0} such that su11su2s_{u_{1}}\sqsubset_{1}s_{u_{2}}. From su1f(maxM)s_{u_{1}}\in f(\max M), we can identify (n1,su1)maxM(n_{1},s_{u_{1}})\in\max M for some n1𝕎{m0}n_{1}\in\mathbb{W}\setminus\{m_{0}\}. Furthermore, n1Msu2n_{1}\in M_{s_{u_{2}}} as Msu=𝕎{m0}M_{s_{u}}=\mathbb{W}\setminus\{m_{0}\} for any uD0u\in D_{0}, this is to say (n1,su2)M(n_{1},s_{u_{2}})\in M. Note that we have assumed that su11su2s_{u_{1}}\sqsubset_{1}s_{u_{2}}, we have (n1,su1)<1(n1,su2)(n_{1},s_{u_{1}})<_{1}(n_{1},s_{u_{2}}), a contradiction. So for any uD0u\in D_{0}, there exists a unique sf(maxM)Es^{*}\in f(\max M)\setminus E such that (m,u.s)<1(m,s)(m,u.s)<_{1}(m,s^{*}), which leads to the result that supuD0(m,u.s)(m,s)\sup_{u\in D_{0}}(m,u.s)\leq(m,s^{*}), and we can conclude that supuD0(m,u.s)W\sup_{u\in D_{0}}(m,u.s)\in W.

Case 2.2, A<2A_{<_{2}} or A<2;<1A_{<_{2};<_{1}} is cofinal in {(m,u.s):uD0}\{(m,u.s):u\in D_{0}\}. One sees immediately that supuD0(m,u.s)W\sup_{u\in D_{0}}(m,u.s)\in W in the case.

Case 2.3, A<3A_{<_{3}} is cofinal in {(m,u.s):uD0}\{(m,u.s):u\in D_{0}\}. For any (m,u.s)A<3(m,u.s)\in A_{<_{3}}, there exist suf(maxM)Es_{u}\in f(\max M)\setminus E and au𝕎\ a_{u}\in\mathbb{W} such that (m,u.s)<3(au,su)(m,u.s)<_{3}(a_{u},s_{u}). Then we have suss_{u}\subseteq s for any uU<3u\in U_{<_{3}}, which implies ssus\sqsubseteq s_{u}. Thus for any given uU<3u^{\prime}\in U_{<_{3}}, supuD0(m,u.s)=supuU<3(m,u.s)(m,su)LsuW\sup_{u\in D_{0}}(m,u.s)=\sup_{u\in U_{<_{3}}}(m,u.s)\leq(m,s_{u^{\prime}})\in L_{s_{u^{\prime}}}\subseteq W.

Case 2.4, A<3;<1A_{<_{3};<_{1}} is cofinal in {(m,u.s):uD0}\{(m,u.s):u\in D_{0}\}. The proof is similar to Case 2.32.3.

Case 3, {(m,u.s):uD0}({LC:CsBTsisachain})\{(m,u.s):u\in D_{0}\}\bigcap\ (\bigcup\{\downarrow\!L_{\vee C}:C\subseteq\bigcup_{s\in B}T_{s}\ \mathrm{is}\ \mathrm{a}\ \mathrm{chain}\}) is cofinal in {(m,u.s):uD0}\{(m,u.s):u\in D_{0}\}. For any uD0u\in D_{0}, there exist CusBTsandmu𝕎C_{u}\subseteq\bigcup_{s\in B}T_{s}\ \mathrm{and}\ m_{u}\in\mathbb{W} such that (m,u.s)<(mu,Cu)(m,u.s)<(m_{u},\vee C_{u}). Set

A<r={(m,u.s):uD0,CusBTsandmu𝕎s.t.(m,u.s)<r(mu,Cu)}A_{<_{r}}=\{(m,u.s):u\in D_{0},\exists\ C_{u}\subseteq\bigcup_{s\in B}T_{s}\ \mathrm{and}\ m_{u}\in\mathbb{W}\ s.t.\ (m,u.s)<_{r}(m_{u},\vee C_{u})\}

and

U<r={uD0:(m,u.s)A<r}U_{<_{r}}=\{u\in D_{0}:(m,u.s)\in A_{<_{r}}\},

where <r{<1,<2,<3,<2;<1,<3;<1}<_{r}\in\{<_{1},\ <_{2},\ <_{3},\ <_{2};<_{1},\ <_{3};<_{1}\}.

Case 3.1, A<1A_{<_{1}} is cofinal in {(m,u.s):uD0}\{(m,u.s):u\in D_{0}\}. For any (m,u.s)A<1(m,u.s)\in A_{<_{1}}, there are CusBTsandmu𝕎C_{u}\subseteq\bigcup_{s\in B}T_{s}\ \mathrm{and}\ m_{u}\in\mathbb{W} such that (m,u.s)<1(mu,Cu)(m,u.s)<_{1}(m_{u},\vee C_{u}). Then mu=mm_{u}=m and u.s<1Cuu.s<_{1}\vee C_{u}. We know each CuC_{u} is countable by Claim 1, so there exists a chain EuE_{u} of the form {a.s:aDu}\{a.s:a\in D_{u}\} is cofinal in CuC_{u}. It follows that uU<1Eu\bigcup_{u\in U_{<_{1}}}E_{u} is a chain in sBTs\bigcup_{s\in B}T_{s}. Again applying Claim 1, we know that uU<1Eu\bigcup_{u\in U_{<_{1}}}E_{u} is a countable chain. So there exists a chain CC^{\prime} of the form {a.s:aD}\{a.s:a\in D^{\prime}\} contained in uU<1Cu\bigcup_{u\in U_{<_{1}}}C_{u} as a cofinal subset, and CsBTsC^{\prime}\subseteq\bigcup_{s\in B}T_{s}. Hence, we can get that supuD(m,u.s)(m,C)\sup_{u\in D^{\prime}}(m,u.s)\leq(m,\vee C^{\prime}), and hence supuD0(m,u.s)W\sup_{u\in D_{0}}(m,u.s)\in W.

The proof of the residual cases are similar to that of the case 2.2, case 2.3, case 2.4, respectively. Therefore, WW is Scott closed. Because A(m0,s0)MA\subseteq\downarrow\!(m_{0},s_{0})\bigcup M and MWM\subseteq W, A(m0,s0)WA\subseteq\ \downarrow\!(m_{0},s_{0})\bigcup W. So our proof will be complete if we can illustrate that AA cannot be contained in WW. Suppose not, AWA\subseteq W, then (m0,s0)W(m_{0},s_{0})\in W.

  • If (m0,s0)sEaMs(a,s)(m_{0},s_{0})\in\bigcup_{s\in E}\bigcup_{a\in M_{s}}\downarrow\!(a,s), then there is (a1,s1)maxM(a_{1},s_{1})\in\max M with s1Es_{1}\in E such that (m0,s0)(a1,s1)(m_{0},s_{0})\leq(a_{1},s_{1}), so s0s1s_{0}\sqsubseteq s_{1}. Since s1f(maxM)f(A)s_{1}\in f(\max M)\subseteq f(A), s1s0s_{1}\sqsubseteq s_{0}, that is, s1=s0s_{1}=s_{0}. Thus m0=a1m_{0}=a_{1} and so (m0,s0)=(a1,s1)(m_{0},s_{0})=(a_{1},s_{1}), but this contradicts to the fact that (a1,s1)maxMA(m0,s0)(a_{1},s_{1})\in\max M\subseteq A\setminus\downarrow\!(m_{0},s_{0}).

  • If (m0,s0)sf(maxM)ELs(m_{0},s_{0})\in\bigcup_{s\in f(\max M)\setminus E}\downarrow\!L_{s}, then there are m𝕎,sf(maxM)Em^{\prime}\in\mathbb{W},\ s^{\prime}\in f(\max M)\setminus E such that (m0,s0)(m,s)(m_{0},s_{0})\leq(m^{\prime},s^{\prime}). This yields that s0ss_{0}\leq s^{\prime}. As MsM_{s^{\prime}} is uncountable, so is AsA_{s^{\prime}}. This means that sf(A)s^{\prime}\in f(A), which induces ss0s^{\prime}\sqsubseteq s_{0}. As a result, s=s0s^{\prime}=s_{0}. It follows that s0f(maxM)Es_{0}\in f(\max M)\setminus E, so we know that Ms0M_{s_{0}} is uncountable, which indicates that As0A_{s_{0}} is uncountable, but this violates the assumption that As0A_{s_{0}} is countable.

  • If (m0,s0){LC:CsBTsisachain}(m_{0},s_{0})\in\bigcup\{\downarrow\!L_{\vee C}:C\subseteq\bigcup_{s\in B}T_{s}\ \mathrm{is\ a\ chain}\}, then there are CsBTsC^{\prime}\subseteq\bigcup_{s\in B}T_{s} being a countable chain and m𝕎m^{\prime}\in\mathbb{W} with (m0,s0)(m,C)(m_{0},s_{0})\leq(m^{\prime},\vee C^{\prime}). For any cCc\in C^{\prime}, there is a scBs_{c}\in B such that c=Msc.tc.pcc=\vee M_{s_{c}}.t_{c}.p_{c}, where Mscmintc\vee M_{s_{c}}\leq\min t_{c}, or t=εt=\varepsilon and pc=sc\ p_{c}=s_{c} or pc1scp_{c}\sqsubset_{1}s_{c}. Then there must exist CC^{*} being a cofinal subset of CC^{\prime}, where c=Msc.tc.pc=Msc.sc=\vee M_{s_{c}}.t_{c}.p_{c}=\vee M_{s_{c}}.s^{*} for any cCc\in C^{*}. Because for any cCc\in C^{*}, we have scBf(maxM)f(A)s_{c}\in B\subseteq f(\max M)\subseteq f(A), scs0s_{c}\sqsubseteq s_{0}. This implies that cscs0c\sqsubseteq s_{c}\sqsubseteq s_{0} for each cCc\in C^{*}, thus Cs0\vee C^{*}\sqsubseteq s_{0}. As (m0,s0)(m,C)(m_{0},s_{0})\leq(m^{\prime},\vee C^{\prime}), s0C=Cs_{0}\sqsubseteq\vee C^{\prime}=\vee C^{*}. We can conclude that s0=C=cCMsc.ss_{0}=\vee C^{*}=\bigvee_{c\in C^{*}}\vee M_{s_{c}}.s^{*}. This means that |pc||s|<|s0||p_{c}|\leq|s^{*}|<|s_{0}|, where |s||s| denotes the string length of ss for any s𝕎s\in\mathbb{W}^{*}. But from pcscs0p_{c}\sqsubseteq s_{c}\sqsubseteq s_{0}, we know |pc||s0||p_{c}|\geq|s_{0}|, a contradiction. Hence, AWA\not\subseteq W, and so A(m0,s0)A\subseteq\ \downarrow\!(m_{0},s_{0}).

In a conclusion, for every irreducible closed subset AA of 𝒵\mathcal{Z}, we have proved that either A=(m0,s0)A={\downarrow}(m_{0},s_{0}) or A=Ls0A=\downarrow\!L_{s_{0}}. ∎

4.4 𝒵\mathcal{Z} is well-filtered

In this subsection, we confirm that 𝒵\mathcal{Z} is well-filtered. First, we consider the compact saturated subsets of 𝒵\mathcal{Z}.

Lemma 4.14.

If KK is a compact saturated subset of 𝒯\mathcal{T}, then minK\min K is finite, that is, K=FK=\uparrow\!F for some finite subset F𝕎F\subseteq\!\mathbb{W}^{*}.

Proof.

Assume for the sake of a contradiction that minK\min K is infinite. Then for any finite subset FF contained in minK\min K, we set BF=(minKF)B_{F}=\ \downarrow\!(\min K\setminus F). We claim that BFB_{F} is Scott closed. To this end, let {u.s:uD}\{u.s:u\in D\} be a non-trivial chain contained in BFB_{F}. For any uDu\in D, there is a suminKFs_{u}\in\min K\setminus F such that u.ssuu.s\sqsubset s_{u}. Assume that u1<u2u_{1}<u_{2} for some u1,u2Du_{1},u_{2}\in D, then {su1,su2}u1.s\{s_{u_{1}},s_{u_{2}}\}\subseteq\ \uparrow\!\!u_{1}.s. So su1su2s_{u_{1}}\sqsubseteq s_{u_{2}} or su2su1s_{u_{2}}\sqsubseteq s_{u_{1}} from Proposition 4.10. Since {su1,su2}minK\{s_{u_{1}},s_{u_{2}}\}\subseteq\min K, su1=su2s_{u_{1}}=s_{u_{2}}. Thus for any uDu\in D, there exists a unique s0minKFs_{0}\in\min K\setminus F such that u.ss0u.s\sqsubset s_{0}. It follows that supuDu.ss0\sup_{u\in D}u.s\sqsubseteq s_{0}, which yields that supuDu.sBF\sup_{u\in D}u.s\in B_{F}. The set BFB_{F} is obviously a lower set, and therefore, BFB_{F} is Scott closed. Note that {BF:FfminK}\{B_{F}:F\subseteq_{f}\min K\} is filtered and BFminKB_{F}\cap\min K\neq\emptyset, where FfminKF\subseteq_{f}\min K denotes FF is a finite subset of minK\min K. Then we arrive at FfminKBFminK\bigcap_{F\subseteq_{f}\min K}B_{F}\bigcap\min K\neq\emptyset. Pick sFfminKBFminKs\in\bigcap_{F\subseteq_{f}\min K}B_{F}\bigcap\min K, which means that sB{s}=(minK{s})s\in B_{\{s\}}=\mathord{\downarrow}(\min K\setminus\{s\}), which is absurd. ∎

Lemma 4.15.

If KK is a compact saturated subset of 𝒵\mathcal{Z}, then for any sf(minK)s\in f(\min K), KsK_{s} is countable, where Ks={m𝕎:(m,s)minK}K_{s}=\{m\in\mathbb{W}:(m,s)\in\min K\}.

Proof.

Assume that there is a s0f(minK)s_{0}\in f(\min K) such that Ks0K_{s_{0}} is uncountable. Then pick M={mn:n}Ks0M=\{m_{n}:n\in\mathbb{N}\}\subseteq K_{s_{0}}, where \mathbb{N} denotes the set of all positive integers. We know that MM is countable, which ensures the existence of M\vee M. Now for each nn\in\mathbb{N}, we set

Bn=i{1,2,,n1}(mi,s0)({Ls:sT})B_{n}=\bigcup_{i\in\mathbb{N}\setminus\{1,2,...,n-1\}}\downarrow\!(m_{i},s_{0})\ \bigcup\ (\bigcup\{\downarrow\!L_{s}:s\in T\}),

where T={M.t.a:t=εorMmint,a=s0ora1s0}T=\{\vee M.t.a:t=\varepsilon\ \mathrm{or}\vee M\leq\min t,a=s_{0}\ \mathrm{or}\ a\sqsubset_{1}s_{0}\}.

𝐂𝐥𝐚𝐢𝐦\mathbf{Claim}: For each nn\in\mathbb{N}, BnB_{n} is Scott closed.

Let {(a,u.s):uD}\{(a,u.s):u\in D\} be a non-trivial chain contained in BnB_{n}.

Case 1, {(a,u.s):uD}(i{1,2,,n1}(mi,s0))\{(a,u.s):u\in D\}\bigcap\,(\bigcup_{i\in\mathbb{N}\setminus\{1,2,...,n-1\}}\downarrow\!(m_{i},s_{0})) is cofinal in {(a,u.s):uD}\{(a,u.s):u\in D\}. Then for any uDu\in D, there is muM{m1,m2,m3,,mn1}m_{u}\in M\setminus\{m_{1},m_{2},m_{3},...,m_{n-1}\} such that (a,u.s)<(mu,s0)(a,u.s)<(m_{u},s_{0}). For convenience we set

A<r={(a,u.s):uD,muM{m1,m2,m3,,mn1}s.t.(a,u.s)<r(mu,s0)}A_{<_{r}}=\{(a,u.s):u\in D,\exists m_{u}\in M\setminus\{m_{1},m_{2},m_{3},...,m_{n-1}\}\ s.t.\ (a,u.s)<_{r}(m_{u},s_{0})\},

where <r{<1,<2,<3,<2;<1,<3;<1}<_{r}\in\{<_{1},\ <_{2},\ <_{3},\ <_{2};<_{1},\ <_{3};<_{1}\}.

Case 1.1, A<1A_{<_{1}} is cofinal in {(a,u.s):uD}\{(a,u.s):u\in D\}. For any (a,u.s)A<1(a,u.s)\in A_{<_{1}}, (a,u.s)<1(mu,s0)(a,u.s)<_{1}(m_{u},s_{0}) for some muM{m1,m2,m3,,mn1}m_{u}\in M\setminus\{m_{1},m_{2},m_{3},...,m_{n-1}\}, which implies that mu=am_{u}=a, and (a,u.s)<1(a,s0)(a,u.s)<_{1}(a,s_{0}). So supuD(a,u.s)(a,s0)Bn\sup_{u\in D}(a,u.s)\leq(a,s_{0})\in B_{n}.

Case 1.2, A<2A_{<_{2}} or A<2;<1A_{<_{2};<_{1}} is cofinal in {(a,u.s):uD}\{(a,u.s):u\in D\}. In this case, for any uDu\in D, (a,u.s)(a,u.s) is less than a fixed point (m0,s0)(m_{0},s_{0}), where a=m0M{m1,m2,m3,,mn1}a=m_{0}\in M\setminus\{m_{1},m_{2},m_{3},...,m_{n-1}\}. Hence supuD(a,u.s)Bn\sup_{u\in D}(a,u.s)\in B_{n}.

Case 1.3, A<3A_{<_{3}} is cofinal in {(a,u.s):uD}\{(a,u.s):u\in D\}. For any (a,u.s)A<3(a,u.s)\in A_{<_{3}}, (a,u.s)<3(mu,s0)(a,u.s)<_{3}(m_{u},s_{0}) for some muM{m1,m2,m3,,mn1}m_{u}\in M\setminus\{m_{1},m_{2},m_{3},...,m_{n-1}\}. Then s=ts0s=ts_{0} for some t𝕎t\in\mathbb{W}^{*}. If tεt\neq\varepsilon and there is a u0>mintu_{0}>\min t, then mintmu0\min t\leq m_{u_{0}} and we can get that supuD(a,u.s)<3(mu0,s0)\sup_{u\in D}(a,u.s)<_{3}(m_{u_{0}},s_{0}). If t=εt=\varepsilon or umintu\leq\min t for all uu, then DD is countable and umuu\leq m_{u}. So we have supDM\sup D\leq\vee M and supDmint\sup D\leq\min t or t=εt=\varepsilon. Now we need to distinguish the following two cases.

Case 1.3.1, supD=M\sup D=\vee M. Then Mmint\vee M\leq\min t or t=εt=\varepsilon. This implies that M.t.s0T\vee M.t.s_{0}\in T. One sees immediately that supuD(a,u.s)(a,M.t.s0)Bn\sup_{u\in D}(a,u.s)\leq(a,\vee M.t.s_{0})\in B_{n}. Hence, supuD(a,u.s)Bn\sup_{u\in D}(a,u.s)\in B_{n}.

Case 1.3.2, supD<M\sup D<\vee M. Then we can find mn1M{m1,m2,m3,,mn1}m_{n_{1}}\in M\setminus\{m_{1},m_{2},m_{3},...,m_{n-1}\} such that supDmn1\sup D\leq m_{n_{1}}. This means that supuD(a,u.s)<3(mn1,s0)\sup_{u\in D}(a,u.s)<_{3}(m_{n_{1}},s_{0}), and we also have that supuD(a,u.s)Bn\sup_{u\in D}(a,u.s)\in B_{n}.

Case 1.4, A<3;<1A_{<_{3};<_{1}} is cofinal in {(a,u.s):uD}\{(a,u.s):u\in D\}. For any (a,u.s)A<3;<1(a,u.s)\in A_{<_{3};<_{1}}, (a,u.s)<3;<1(mu,s0)(a,u.s)<_{3};<_{1}(m_{u},s_{0}) for some muM{m1,m2,m3,,mn1}m_{u}\in M\setminus\{m_{1},m_{2},m_{3},...,m_{n-1}\}. That is, there is an su𝕎s_{u}\in\mathbb{W}^{*}, such that (a,u.s)<3(mu,su)<1(mu,s0)(a,u.s)<_{3}(m_{u},s_{u})<_{1}(m_{u},s_{0}). Then there is a fixed s𝕎s^{*}\in\mathbb{W}^{*} such that {(a,u.s):muM{m1,m2,m3,,mn1}s.t.(a,u.s)<3(mu,s)<1(mu,s0)}\{(a,u.s):\exists\ m_{u}\in M\setminus\{m_{1},m_{2},m_{3},...,m_{n-1}\}\ s.t.\ (a,u.s)<_{3}(m_{u},s^{*})<_{1}(m_{u},s_{0})\} being a cofinal subset of A<3;<1A_{<_{3};<_{1}} since each suss_{u}\subseteq s and the length of ss is finite. Then s=tss=ts^{*} and the residual analysis is similar to that of the above case.

Case 2, {(a,u.s):uD}({Ls:sT})\{(a,u.s):u\in D\}\bigcap\ (\bigcup\{\downarrow\!L_{s}:s\in T\}) is cofinal in {(a,u.s):uD}\{(a,u.s):u\in D\}. That is, for any uDu\in D, there exists mu𝕎m_{u}\in\mathbb{W} and su=M.tu.puTs_{u}=\vee M.t_{u}.p_{u}\in T such that (a,u.s)<(mu,su)(a,u.s)<(m_{u},s_{u}), with t=εorMmint,pu=s0orpu1s0t=\varepsilon\ \mathrm{or}\vee M\leq\min t,p_{u}=s_{0}\ \mathrm{or}\ p_{u}\sqsubset_{1}s_{0}. Similar to the above case, we set

A<r={(a,u.s):uD,mu𝕎,su=M.tu.puTs.t.(a,u.s)<r(mu,su)}A^{\prime}_{<_{r}}=\{(a,u.s):u\in D,\exists m_{u}\in\mathbb{W},s_{u}=\vee M.t_{u}.p_{u}\in T\ s.t.\ (a,u.s)<_{r}(m_{u},s_{u})\},

where <r{<1,<2,<3,<2;<1,<3;<1}<_{r}\in\{<_{1},\ <_{2},\ <_{3},\ <_{2};<_{1},\ <_{3};<_{1}\}.

Case 2.1, A<1A^{\prime}_{<_{1}} is cofinal in {(a,u.s):uD}\{(a,u.s):u\in D\}. For any (a,u.s)A<1(a,u.s)\in A^{\prime}_{<_{1}}, there exist mu𝕎m_{u}\in\mathbb{W} and su=M.tu.puTs_{u}=\vee M.t_{u}.p_{u}\in T such that (a,u.s)<1(mu,su)(a,u.s)<_{1}(m_{u},s_{u}). Then mu=a,u.s1su=M.tu.pum_{u}=a,\ u.s\sqsubset_{1}s_{u}=\vee M.t_{u}.p_{u}. Thus tu.pu=st_{u}.p_{u}=s for each uu. It follows that (mu,su)=(a,M.s)(m_{u},s_{u})=(a,\vee M.s) for any uDu\in D. This means that supuD(a,u.s)(a,M.s)\sup_{u\in D}(a,u.s)\leq(a,\vee M.s). Hence, supuD(a,u.s)Bn\sup_{u\in D}(a,u.s)\in B_{n}.

Case 2.2, A<2A^{\prime}_{<_{2}} or A<2;<1A^{\prime}_{<_{2};<_{1}} is cofinal in {(a,u.s):uD}\{(a,u.s):u\in D\}. For the case, it is easy to verify that supuD(a,u.s)Bn\sup_{u\in D}(a,u.s)\in B_{n}.

Case 2.3, A<3A^{\prime}_{<_{3}} is cofinal in {(a,u.s):uD}\{(a,u.s):u\in D\}. For any (a,u.s)A<3(a,u.s)\in A^{\prime}_{<_{3}}, there exist mu𝕎m_{u}\in\mathbb{W} and su=M.tu.puTs_{u}=\vee M.t_{u}.p_{u}\in T such that (a,u.s)<3(mu,su)(a,u.s)<_{3}(m_{u},s_{u}). Then we have suss_{u}\subseteq s, that is ssus\sqsubseteq s_{u}. Thus for any fixed (a,u0.s)A<3(a,u_{0}.s)\in A^{\prime}_{<_{3}}, we have supuD(a,u.s)(a,su0)Bn\sup_{u\in D}(a,u.s)\leq(a,s_{u_{0}})\in B_{n}. Therefore, supuD(a,u.s)Bn\sup_{u\in D}(a,u.s)\in B_{n}.

Case 2.4, A<3;<1A^{\prime}_{<_{3};<_{1}} is cofinal in {(a,u.s):uD}\{(a,u.s):u\in D\}. The proof is similar to Case 2.32.3.

One sees immediately that BnB_{n} is a lower set for any nn\in\mathbb{N}. Thus BnB_{n} is Scott closed for each nn\in\mathbb{N}.

Since {Bn:n}\{B_{n}:n\in\mathbb{N}\} is filtered and BnminKB_{n}\cap\min K\neq\emptyset, nBnminK\bigcap_{n\in\mathbb{N}}B_{n}\bigcap\min K\neq\emptyset. Choose (m,s)nBnminK(m,s)\in\bigcap_{n\in\mathbb{N}}B_{n}\bigcap\min K. We claim that (m,s)Lt(m,s)\notin\downarrow\!L_{t} for any tTt\in T. Suppose not, there are m𝕎,sTm^{\prime}\in\mathbb{W},s^{\prime}\in T such that (m,s)(m,s)(m,s)\leq(m^{\prime},s^{\prime}). Assume that s=M.t.ps^{\prime}=\vee M.t^{\prime}.p^{\prime} with Mmint\vee M\leq\min t^{\prime} or t=εt=\varepsilon, and p=s0p^{\prime}=s_{0} or p1s0p^{\prime}\sqsubset_{1}s_{0}, then we can obtain that MKs0\mathord{\uparrow}\vee M\cap K_{s_{0}}\neq\emptyset from the uncountability of Ks0K_{s_{0}}. It follows that

(m,s)(m,s)=(m,M.t.p)<3(m1,p)(m1,s0)(m,s)\leq(m^{\prime},s^{\prime})=(m^{\prime},\vee M.t^{\prime}.p^{\prime})<_{3}(m_{1},p^{\prime})\leq(m_{1},s_{0})

for some m1MKs0m_{1}\in\mathord{\uparrow}\vee M\cap K_{s_{0}}, which implies contradiction as (m1,s0)minK(m_{1},s_{0})\in\min K. Now we suppose that (m,s)Bn0(m,s)\in B_{n_{0}} for some n0n_{0}\in\mathbb{N}, then (m,s)i{1,2,,n01}(mi,s0)(m,s)\in\bigcup_{i\in\mathbb{N}\setminus\{1,2,...,n_{0}-1\}}\downarrow\!(m_{i},s_{0}). This means that there is an i0n0i_{0}\geq n_{0} such that (m,s)(mi0,s0)(m,s)\leq(m_{i_{0}},s_{0}), and hence, (m,s)=(mi0,s0)(m,s)=(m_{i_{0}},s_{0}) since both of them are minimal elements of KK. The fact that (m,s)nBn(m,s)\in\bigcap_{n\in\mathbb{N}}B_{n} indicates that (m,s)Bi0+1(m,s)\in B_{i_{0}+1}, that is, (m,s)i{1,2,,i0}(mi,s0)(m,s)\in\bigcup_{i\in\mathbb{N}\setminus\{1,2,...,i_{0}\}}\downarrow\!(m_{i},s_{0}). However, this is impossible. Therefore, the original hypothesis doesn’t hold. So KsK_{s} is countable for any sf(minK)s\in f(\min K). ∎

Lemma 4.16.

If KK is a compact saturated subset of 𝒵\mathcal{Z}, then for any s𝕎s\in\mathbb{W}^{*}, (u𝕎Lu.s)minK(\bigcup_{u\in\mathbb{W}}L_{u.s})\bigcap\min K is countable, where Lu.s={(m,u.s):m𝕎}L_{u.s}=\{(m,u.s):m\in\mathbb{W}\}.

Proof.

Suppose that there exists s0𝕎s_{0}\in\mathbb{W}^{*} such that (u𝕎Lu.s0)minK(\bigcup_{u\in\mathbb{W}}L_{u.s_{0}})\bigcap\min K is uncountable. Let

A={u.s0:mu𝕎s.t.(mu,u.s0)minK}A=\{u.s_{0}:\exists\ m_{u}\in\mathbb{W}\ s.t.\ (m_{u},u.s_{0})\in\min K\}

By Lemma 4.15, we have Lu.s0minKL_{u.s_{0}}\cap\min K is countable for any u𝕎u\in\mathbb{W}, which implies that AA must be uncountable. Then pick {un.s0:n}\{u_{n}.s_{0}:n\in\mathbb{N}\} as a countable subset of AA, besides, for each nn\in\mathbb{N}, we extract mn𝕎m_{n}\in\mathbb{W} so that (mn,un.s0)minK(m_{n},u_{n}.s_{0})\in\min K, where \mathbb{N} denotes all positive integers. Then set

G=n(mn,un.s0)G=\bigcup_{n\in\mathbb{N}}\downarrow\!(m_{n},u_{n}.s_{0})

and

En=Gun.s0={a𝕎:(a,un.s0)G}E_{n}=G_{u_{n}.s_{0}}=\{a\in\mathbb{W}:(a,u_{n}.s_{0})\in G\}.

Note that each EnE_{n} is countable and En1En2E_{n_{1}}\subseteq E_{n_{2}} if n1n2n_{1}\geq n_{2}. Now we construct Bn(n)B_{n}\ (\forall n\in\mathbb{N}) as follows:

Bn=i{1,2,,n1}aEi(a,ui.s0)({LC:CnTun.s0isachain})B_{n}=\bigcup_{i\in\mathbb{N}\setminus\{1,2,...,n-1\}}\bigcup_{a\in E_{i}}\downarrow\!(a,u_{i}.s_{0})\bigcup\ (\bigcup\{\downarrow L_{\vee C}:C\subseteq\bigcup_{n\in\mathbb{N}}T_{u_{n}.s_{0}}\ \mathrm{is\ a\ chain}\}),

where Tun.s0={En.t.p:t=εorEnmint,p=un.s0orp1un.s0}T_{u_{n}.s_{0}}=\{\vee E_{n}.t.p:t=\varepsilon\ \mathrm{or}\ \vee E_{n}\leq\min t,\ p=u_{n}.s_{0}\ \mathrm{or}\ p\sqsubset_{1}u_{n}.s_{0}\}.

𝐂𝐥𝐚𝐢𝐦𝟏\mathbf{Claim~{}1}: For any chain CnTun.s0C\subseteq\bigcup_{n\in\mathbb{N}}T_{u_{n}.s_{0}}, CC is countable.

Suppose that there is a chain CnTun.s0C\subseteq\bigcup_{n\in\mathbb{N}}T_{u_{n}.s_{0}} being uncountable. Then there must exist an uncountable chain C0={v.s:vD0}CC_{0}=\{v.s:v\in D_{0}\}\subseteq C contained in Tun0.s0T_{u_{n_{0}}.s_{0}} for some n0n_{0}\in\mathbb{N}. That is to say, for any v.sC0v.s\in C_{0}, v.s=En0.tc.pcv.s=\vee E_{n_{0}}.t_{c}.p_{c} and so tc.pct_{c}.p_{c} is equal to ss. Then C0={En0.s}C_{0}=\{\vee E_{n_{0}}.s\} is a single set, which contradicts the uncountability of C0C_{0}.

𝐂𝐥𝐚𝐢𝐦𝟐\mathbf{Claim~{}2}: For any nn\in\mathbb{N}, BnB_{n} is Scott closed.

To this end, let {(m,b.s):bD}\{(m,b.s):b\in D\} be a non-trivial chain contained in BnB_{n}.

Case 1, {(m,b.s):bD}(i{1,2,,n1}aEi(a,ui.s0))\{(m,b.s):b\in D\}\bigcap(\bigcup_{i\in\mathbb{N}\setminus\{1,2,...,n-1\}}\bigcup_{a\in E_{i}}\downarrow\!(a,u_{i}.s_{0})) is cofinal in {(m,b.s):bD}\{(m,b.s):b\in D\}. For any bDb\in D, there are ib{1,2,,n1},abEibi_{b}\in\mathbb{N}\setminus\{1,2,...,n-1\},a_{b}\in E_{i_{b}} such that (m,b.s)<(ab,uib.s0)(m,b.s)<(a_{b},u_{i_{b}}.s_{0}), where each (ab,uib.s0)(a_{b},u_{i_{b}}.s_{0}) can be assumed to be the minimal element of KK by the constructions of GG and {En:n}\{E_{n}:n\in\mathbb{N}\}. We set

A<r={(m,b.s):bD,ib{1,2,,n1},abEibs.t.(m,b.s)<r(ab,uib.s0)}A_{<_{r}}=\{(m,b.s):b\in D,\exists\ i_{b}\in\mathbb{N}\setminus\{1,2,...,n-1\},\ a_{b}\in E_{i_{b}}\ s.t.\ (m,b.s)<_{r}(a_{b},u_{i_{b}}.s_{0})\},

where <r{<1,<2,<3,<2;<1,<3;<1}<_{r}\ \in\{<_{1},\ <_{2},\ <_{3},\ <_{2};<_{1},\ <_{3};<_{1}\}.

Case 1.1, A<1A_{<_{1}} is cofinal in {(m,b.s):bD}\{(m,b.s):b\in D\}. For any (m,b.s)A<1(m,b.s)\in\!A_{<_{1}}, there are some ib{1,2,,n1},abEibi_{b}\in\mathbb{N}\setminus\{1,2,...,n-1\},\ a_{b}\in E_{i_{b}} such that (m,b.s)<1(ab,uib.s0)(m,b.s)<_{1}(a_{b},u_{i_{b}}.s_{0}). Then ab=ma_{b}=m and there is an i0{1,2,,n1}i_{0}\in\mathbb{N}\setminus\{1,2,...,n-1\} such that (m,b.s)<1(m,ui0.s0)(m,b.s)<_{1}(m,u_{i_{0}}.s_{0}) from the minimality in KK of (ab,uib.s0)(a_{b},u_{i_{b}}.s_{0}) for any (m,b.s)A<1(m,b.s)\in A_{<_{1}}. Thus supbD(m,b.s)(m,ui0.s0)\sup_{b\in D}(m,b.s)\leq(m,u_{i_{0}}.s_{0}), which means supbD(m,b.s)Bn\sup_{b\in D}(m,b.s)\in B_{n}.

Case 1.2, A<2A_{<_{2}} or A<2;<1A_{<_{2};<_{1}} is cofinal in {(m,b.s):bD}\{(m,b.s):b\in D\}. It is easy to demonstrate that supbD(m,b.s)Bn\sup_{b\in D}(m,b.s)\in B_{n} in the case.

Case 1.3, A<3A_{<_{3}} is cofinal in {(m,b.s):bD}\{(m,b.s):b\in D\}. For any (m,b.s)A<3(m,b.s)\in A_{<_{3}}, there are some ib{1,2,,n1},abEibi_{b}\in\mathbb{N}\setminus\{1,2,...,n-1\},\ a_{b}\in E_{i_{b}} such that (m,b.s)<3(ab,uib.s0)(m,b.s)<_{3}(a_{b},u_{i_{b}}.s_{0}). Then uib.s0su_{i_{b}}.s_{0}\subseteq s, which yields that uib.s0u_{i_{b}}.s_{0} is unique at the moment, denoted by ui.s0u_{i^{\prime}}.s_{0}, that is, for any (m,b.s)A<3(m,b.s)\in A_{<_{3}}, there exists abEia_{b}\in E_{i^{\prime}} such that (m,b.s)<3(ab,ui.s0)(m,b.s)<_{3}(a_{b},u_{i^{\prime}}.s_{0}). Because (ab,ui.s0)minK(a_{b},u_{i^{\prime}}.s_{0})\in\min K, and we pick only a minimal element of KK on each level Lun.s0L_{u_{n}.s_{0}} for any nn\in\mathbb{N}, (ab,ui.s0)(a_{b},u_{i^{\prime}}.s_{0}) is a fixed point denoted by (a0,ui.s0)(a_{0},u_{i^{\prime}}.s_{0}). Thus supbD(m,b.s)(a0,ui.s0)\sup_{b\in D}(m,b.s)\leq(a_{0},u_{i^{\prime}}.s_{0}) and so supbD(m,b.s)Bn\sup_{b\in D}(m,b.s)\in B_{n}.

Case 1.4, A<3;<1A_{<_{3};<_{1}} is cofinal in {(m,b.s):bD}\{(m,b.s):b\in D\}. For any (m,b.s)A<3;<1(m,b.s)\in A_{<_{3};<_{1}}, there are some ib{1,2,,n1},abEibi_{b}\in\mathbb{N}\setminus\{1,2,...,n-1\},\ a_{b}\in E_{i_{b}} such that (m,b.s)<3;<1(ab,uib.s0)(m,b.s)<_{3};<_{1}(a_{b},u_{i_{b}}.s_{0}), that is, (m,b.s)<3(ab,sb)<1(ab,uib.s0)(m,b.s)<_{3}(a_{b},s_{b})<_{1}(a_{b},u_{i_{b}}.s_{0}) for some sb𝕎s_{b}\in\mathbb{W}^{*}. Then sbss_{b}\subseteq s is unique since the length of each sbs_{b} is same as that of uib.s0u_{i_{b}}.s_{0}, written as ss^{*}. Assume s=t.ss=t.s^{*} for some t𝕎t\in\mathbb{W}^{*}. It follows that min(bt)ab\min(bt)\leq a_{b} in light of (m,b.s)<3(ab,s)(m,b.s)<_{3}(a_{b},s^{*}), where tt may be ε\varepsilon.

Let ib0=infRi_{b_{0}}=\inf R, where R={uis1ui.s0}R=\{u_{i}\mid s^{*}\sqsubset_{1}u_{i}.s_{0}\}. Then EibEib0E_{i_{b}}\subseteq E_{i_{b_{0}}} for any bDb\in D with (m,b.s)A<3;<1(m,b.s)\in A_{<_{3};<_{1}}. Therefore, abEib0a_{b}\in E_{i_{b_{0}}}. If tεt\neq\varepsilon and there is b1>mintb_{1}>\min t, then mint=min(b1.t)ab1\min t=\min(b_{1}.t)\leq a_{b_{1}}. So we have supbD(a,b.s)<3(ab1,s)<1(ab1,uib1.s0)\sup_{b\in D}(a,b.s)<_{3}(a_{b_{1}},s^{*})<_{1}(a_{b_{1}},u_{i_{b_{1}}}.s_{0}). If t=εt=\varepsilon or bmintb\leq\min t for each bDb\in D, then supDmint\sup D\leq\min t or t=εt=\varepsilon. The fact that min(b.t)ab\min(b.t)\leq a_{b} suggests that min(b.t)=bab\min(b.t)=b\leq a_{b}, which leads to that supDEib0\sup D\leq\vee E_{i_{b_{0}}}. Now we need to distinguish the following two cases.

Case 1.4.1, supD=Eib0\sup D=\vee E_{i_{b_{0}}}. Then supbD(m,b.s)=(m,Eib0.s)=(m,Eib0.t.s)\sup_{b\in D}(m,b.s)=(m,\vee E_{i_{b_{0}}}.s)=(m,\vee E_{i_{b_{0}}}.t.s^{*}). Note that Eib0=supDmint\vee E_{i_{b_{0}}}=\sup D\leq\min t or t=εt=\varepsilon, which yields that Eib0.t.sTib0.s0\vee E_{i_{b_{0}}}.t.s^{*}\in T_{i_{b_{0}}.s_{0}}.

Case 1.4.2, supD<Eib0\sup D<\vee E_{i_{b_{0}}}. Then there exists aEib0a^{\prime}\in E_{i_{b_{0}}} such that supDa\sup D\leq a^{\prime}, which results in the conclusion that supbD(m,b.s)<3(a,s)<1(a,uib0.s0)Bn\sup_{b\in D}(m,b.s)<_{3}(a^{\prime},s^{*})<_{1}(a^{\prime},u_{i_{b_{0}}}.s_{0})\in B_{n}.

Case 2, {(m,b.s):bD}({LC:CnTun.s0isachain})\{(m,b.s):b\in D\}\bigcap\;(\bigcup\{\downarrow L_{\vee C}:C\subseteq\bigcup_{n\in\mathbb{N}}T_{u_{n}.s_{0}}\ \mathrm{is\ a\ chain}\}) is cofinal in {(m,b.s):bD}\{(m,b.s):b\in D\}. That is to say, for any bDb\in D, there are some mb𝕎m_{b}\in\mathbb{W} and a chain CbnTun.s0C_{b}\subseteq\bigcup_{n\in\mathbb{N}}T_{u_{n}.s_{0}} such that (m,b.s)<(mb,Cb)(m,b.s)<(m_{b},\vee C_{b}). Now we set

A<r={(m,b.s):bD,mb𝕎,CbnTun.s0s.t.(m,b.s)<r(mb,Cb)}A^{\prime}_{<_{r}}=\{(m,b.s):b\in D,\exists\ m_{b}\in\mathbb{W},\ C_{b}\subseteq\bigcup_{n\in\mathbb{N}}T_{u_{n}.s_{0}}\ s.t.\ (m,b.s)<_{r}(m_{b},\vee C_{b})\},

and

U<r={uD0:(m,u.s)A<r}U^{\prime}_{<_{r}}=\{u\in D_{0}:(m,u.s)\in A^{\prime}_{<_{r}}\},

where <r{<1,<2,<3,<2;<1,<3;<1}<_{r}\ \in\{<_{1},\ <_{2},\ <_{3},\ <_{2};<_{1},\ <_{3};<_{1}\}.

Case 2.1, A<1A^{\prime}_{<_{1}} is cofinal in {(m,b.s):bD}\{(m,b.s):b\in D\}. For any (m,b.s)A<1(m,b.s)\in A^{\prime}_{<_{1}}, there are mb𝕎m_{b}\in\mathbb{W} and CbnTun.s0C_{b}\subseteq\bigcup_{n\in\mathbb{N}}T_{u_{n}.s_{0}} such that (m,b.s)<1(mb,Cb)(m,b.s)<_{1}(m_{b},\vee C_{b}). Then mb=mm_{b}=m. By Claim 11, we know that CbC_{b} must be countable, which ensures the existence of the countable chain C0bU<1CbC_{0}\subseteq\bigcup_{b\in U^{\prime}_{<_{1}}}C_{b} being the cofinal subset of bU<1Cb\bigcup_{b\in U^{\prime}_{<_{1}}}C_{b}. It follows that C0bU<1CbnTun.s0C_{0}\subseteq\bigcup_{b\in U^{\prime}_{<_{1}}}C_{b}\subseteq\bigcup_{n\in\mathbb{N}}T_{u_{n}.s_{0}}. This implies that (m,b.s)<1(m,C0)(m,b.s)<_{1}(m,\vee C_{0}) for any bDb\in D. So supbD(m,b.s)(m,C0)Bn\sup_{b\in D}(m,b.s)\leq(m,\vee C_{0})\in B_{n}.

Case 2.2, A<2A^{\prime}_{<_{2}} or A<3A^{\prime}_{<_{3}} is cofinal in {(m,b.s):bD}\{(m,b.s):b\in D\}. For any (m,b.s)A<2(m,b.s)\in A^{\prime}_{<_{2}} or A<3A^{\prime}_{<_{3}}, there are some mb𝕎m_{b}\in\mathbb{W} and CbnTun.s0C_{b}\subseteq\bigcup_{n\in\mathbb{N}}T_{u_{n}.s_{0}} such that (m,b.s)<2(mb,Cb)(m,b.s)<_{2}(m_{b},\vee C_{b}) or (m,b.s)<3(mb,Cb)(m,b.s)<_{3}(m_{b},\vee C_{b}). Then Cbs\vee C_{b}\subseteq s, that is, sCbs\sqsubseteq\vee C_{b}. Hence, supbD(m,b.s)(m,Cb0)\sup_{b\in D}(m,b.s)\leq(m,\vee C_{b_{0}}) for any given b0U<2b_{0}\in U^{\prime}_{<_{2}} or b0U<3b_{0}\in U^{\prime}_{<_{3}}, which leads to that supbD(m,b.s)Bn\sup_{b\in D}(m,b.s)\in B_{n}.

Case 2.3, A<2;<1A^{\prime}_{<_{2};<_{1}} or A<3;<1A^{\prime}_{<_{3};<_{1}} is cofinal in {(m,b.s):bD}\{(m,b.s):b\in D\}. The analysis of this case is similar to Case 2.22.2.

As BnB_{n} is a lower set for each nn\in\mathbb{N}, BnB_{n} is Scott closed. Because {Bn:n}\{B_{n}:n\in\mathbb{N}\} is filtered and minKBn\min K\bigcap B_{n}\neq\emptyset for any nn\in\mathbb{N}, the set nBn\bigcap_{n\in\mathbb{N}}B_{n} meets minK\min K. Choose (m,s)nBnminK(m,s)\in\bigcap_{n\in\mathbb{N}}B_{n}\bigcap\min K. The uncountability of AA guarantees the existence of ununu^{*}\in\mathord{\uparrow}\vee_{n\in\mathbb{N}}u_{n} with u.s0Au^{*}.s_{0}\in A. Now we claim that there exist u>uu^{\prime}>u^{*}, m(nEn)=E1m^{\prime}\in\mathord{\uparrow}\vee(\bigcup_{n\in\mathbb{N}}E_{n})=\mathord{\uparrow}\vee E_{1} such that (m,u.s0)minK(m^{\prime},u^{\prime}.s_{0})\in\min K. Suppose not, for any u>uu>u^{*}, any m𝕎m\in\mathbb{W} with (m,u.s0)minK(m,u.s_{0})\in\min K, mE1um\notin{E_{1}}^{u}. Then we could find amE1a_{m}\in E_{1} such that am⩽̸ma_{m}\nleqslant m, i.e., am>ma_{m}>m. It follows that

{m𝕎:(m,u.s0)minKwithu>u}E1\{m\in\mathbb{W}:(m,u.s_{0})\in\min K\ \mathrm{with}\ u>u^{*}\}\subseteq\;\downarrow\!E_{1},

which is a contradiction since the left side of the inclusion is uncountable but the right is countable. Hence, there exists u>uu^{\prime}>u^{*}, m(nEn)=E1m^{\prime}\in\mathord{\uparrow}\vee(\bigcup_{n\in\mathbb{N}}E_{n})=\mathord{\uparrow}\vee E_{1} such that (m,u.s0)minK(m^{\prime},u^{\prime}.s_{0})\in\min K. Now based on the above discussion, we shall know that (m,s)LC(m,s)\notin\ \downarrow\!L_{\vee C} for any chain CnTun.s0C\subseteq\bigcup_{n\in\mathbb{N}}T_{u_{n}.s_{0}}. Suppose not, (m,s)(m0,C0)(m,s)\leq(m_{0},\vee C_{0}) for some m0𝕎m_{0}\in\mathbb{W} and C0nTun.s0C_{0}\subseteq\bigcup_{n\in\mathbb{N}}T_{u_{n}.s_{0}}. For each cC0c\in C_{0}, cc can be written as Enc.tc.pc\vee E_{n_{c}}.t_{c}.p_{c} with tc=εt_{c}=\varepsilon or Encmintc,pc=unc.s0\vee E_{n_{c}}\leq\min t_{c},\ p_{c}=u_{n_{c}}.s_{0} or pc1unc.s0p_{c}\sqsubset_{1}u_{n_{c}}.s_{0}. Note that there is a cofinal subset C0C^{\prime}_{0} of C0C_{0} of the form {mc.s^:cC0}\{m_{c}.\hat{s}:c\in C^{\prime}_{0}\}, in which mc=Enc,s^=tc.pct.pm_{c}=\vee E_{n_{c}},\ \hat{s}=t_{c}.p_{c}\triangleq t.p for each cC0c\in C^{\prime}_{0}, (cC0Enc)mint\bigvee(\bigcup_{c\in C^{\prime}_{0}}E_{n_{c}})\leq\min t or t=εt=\varepsilon. According to (cC0Enc)E1m\bigvee(\bigcup_{c\in C^{\prime}_{0}}E_{n_{c}})\leq\vee E_{1}\leq m^{\prime}, we can get that

(m,s)(m0,C0)=(m0,C0)(m0,(cC0Enc).t.p)<3(m,p)<1(m,u.s0)(m,s)\leq(m_{0},\vee C_{0})=(m_{0},\vee C^{\prime}_{0})\leq(m_{0},\bigvee(\bigcup_{c\in C^{\prime}_{0}}E_{n_{c}}).t.p)<_{3}(m^{\prime},p)<_{1}(m^{\prime},u^{\prime}.s_{0}).

This violates the assumption that both (m,s)(m,s) and (m,u.s0)(m^{\prime},u^{\prime}.s_{0}) are minimal elements of KK. As a result, for (m,s)nBnminK(m,s)\in\bigcap_{n\in\mathbb{N}}B_{n}\bigcap\min K, (m,s)n(i{1,2,,n1}aEi(a,ui.s0))(m,s)\in\bigcap_{n\in\mathbb{N}}(\bigcup_{i\in\mathbb{N}\setminus\{1,2,...,n-1\}}\bigcup_{a\in E_{i}}\downarrow\!(a,u_{i}.s_{0})). But this is impossible with a similar reason in the proof of Lemma 4.15. ∎

Lemma 4.17.

If KK is a compact saturated subset of 𝒵\mathcal{Z}, then minK\min K is countable.

Proof.

By way of contradiction, suppose that minK\min K is uncountable. In virtue of Lemma 4.15, we have minKLs\min K\cap L_{s} is countable for any sminKs\in\min K. The fact that minK=sf(minK)(minKLs)\min K=\bigcup_{s\in f(\min K)}(\min K\cap L_{s}) induces that f(minK)f(\min K) is uncountable, where the map f:𝒵𝒯f:\mathcal{Z}\rightarrow\mathcal{T} is defined by f(m,s)=sf(m,s)=s. In addition, the continuity of ff reveals that f(minK)f(\min K) is a compact subset of 𝒯\mathcal{T}. Then minf(minK)\min f(\min K) is finite due to Lemma 4.14, which yields that there is sminf(minK)s\in\min f(\min K) such that sf(minK)\uparrow\!s\cap f(\min K) is uncountable. Since the length of ss is finite, there exists s0ss_{0}\geq s such that minK(u𝕎Lu.s0)\min K\bigcap(\bigcup_{u\in\mathbb{W}}L_{u.s_{0}}) is uncountable. This contradicts the result of Lemma 4.16. Hence, minK\min K is countable. ∎

Theorem 4.18.

Σ𝒵\Sigma\mathcal{Z} is well-filtered.

Proof.

Recall that a T0T_{0} space if well-filtered if and only if all its KFK\!F-sets are closures of singletons. We assume that Σ𝒵\Sigma\mathcal{Z} is not well-filtered. Then there exists a KFK\!F-set Ls0\downarrow\!L_{s_{0}} for some s0𝕎s_{0}\in\mathbb{W}^{*} by Theorem 4.13 and that all KFK\!F-sets are irreducible. This implies that there is a filtered family {Qi:iI}\{Q_{i}:i\in I\} contained in Q(𝒵)Q(\mathcal{Z}) such that Ls0\downarrow\!\!L_{s_{0}} is a minimal closed set that intersects each QiQ_{i}. Set Ki=(QiLs0)K_{i}=\uparrow\!(Q_{i}\ \cap\downarrow\!L_{s_{0}}), then a straightforward verification establishes that {Ki:iI}fltQ(𝒵)\{K_{i}:i\in I\}\subseteq_{flt}Q(\mathcal{Z}) and Ls0\downarrow\!L_{s_{0}} is still a minimal closed set that intersects each KiK_{i}. Note that minKiLs0\min K_{i}\subseteq\ \downarrow\!L_{s_{0}} for each iIi\in I. Now we fix j1Ij_{1}\in I and let J=j1IJ=\uparrow\!j_{1}\cap I, then JJ is a cofinal subset of II and Ls0\downarrow\!L_{s_{0}} is a minimal closed set that intersects each Kj,jJK_{j},j\in J. The assumption that Ls0Kj\downarrow\!L_{s_{0}}\cap K_{j}\neq\emptyset implies that Ls0minKj\downarrow\!L_{s_{0}}\cap\min K_{j}\neq\emptyset for all jJj\in J. Pick (mj,sj)Ls0minKj(m_{j},s_{j})\in\ \downarrow\!L_{s_{0}}\cap\min K_{j} for each jJj\in J.

𝐂𝐥𝐚𝐢𝐦𝟏\mathbf{Claim~{}1}: There exists j0Jj_{0}\in J such that sj=s0s_{j}=s_{0} for any jj0j\geq j_{0}.

Assume for the sake of a contradiction that for any jJj\in J, there is iji\geq j such that sis0s_{i}\neq s_{0}, that is, sis0s_{i}\sqsubset s_{0}. Let J1={jJ:sjs0}J_{1}=\{j\in J:s_{j}\sqsubset s_{0}\}. Then J1J_{1} is cofinal in JJ and so Ls0\downarrow\!L_{s_{0}} is a minimal closed set that intersects each Kj,jJ1K_{j},j\in J_{1}. The minimality of Ls0\mathord{\downarrow}L_{s_{0}} infers that {(mj,sj):jJ1}¯=Ls0\overline{\{(m_{j},s_{j}):j\in J_{1}\}}=\downarrow\!L_{s_{0}}. This indicates that {(mj,sj):jJ1}\{(m_{j},s_{j}):j\in J_{1}\} is uncountable. If not, {(mj,sj):jJ1}\{(m_{j},s_{j}):j\in J_{1}\} is countable, we set B=jJ1(mj,s0)(jJ1mj,s0)B=\bigcup_{j\in J_{1}}\downarrow\!(m_{j},s_{0})\bigcup\ \downarrow\!(\vee_{j\in J_{1}}m_{j},s_{0}). Then it is easy to verify that BB is Scott closed and BKj,jJ1B\cap K_{j}\neq\emptyset,j\in J_{1}, but BLs0B\subsetneqq\downarrow\!L_{s_{0}}, which is a contradiction to the minimality of Ls0\downarrow\!L_{s_{0}}. The above discussion also reveals that {mj:jJ1}\{m_{j}:j\in J_{1}\} is uncountable. Now we let

Bj={(mi,si):ij,(mi,si)minKj},jJ1B_{j}=\{(m_{i},s_{i}):i\geq j,(m_{i},s_{i})\in\min K_{j}\},\forall j\in J_{1},

then it follows that each BjB_{j} is countable by Lemma 4.17. Note that for any given jJ1j\in J_{1}, Ij={iJi:ij}I_{j}=\{i\in J_{i}:i\geq j\} is a cofinal subset of II. This means that {(mr,sr):rIj}¯=Ls0\overline{\{(m_{r},s_{r}):r\in I_{j}\}}=\downarrow\!L_{s_{0}}, which yields that {mr:rIj}\{m_{r}:r\in I_{j}\} is uncountable for a similar reason as J1J_{1}. Therefore,

Bj={(mi,si):ij,(mi,si)minKj}B^{\prime}_{j}=\{(m_{i},s_{i}):i\geq j,(m_{i},s_{i})\notin\min K_{j}\}

is uncountable for all jJ1j\in J_{1}, and {mi:(mi,si)Bj}\{m_{i}:(m_{i},s_{i})\in B^{\prime}_{j}\} is uncountable. It turns out that Bj¯=Ls0\overline{B^{\prime}_{j}}=\mathord{\downarrow}L_{s_{0}}. Given jJ1j\in J_{1}, for any (mi,si)Bj(m_{i},s_{i})\in B^{\prime}_{j}, there is (nik,aik)minKj(n_{i_{k}},a_{i_{k}})\in\min K_{j} such that (nik,aik)<(mi,si)(n_{i_{k}},a_{i_{k}})<(m_{i},s_{i}). The countability of minKj\min K_{j} ensures the existence of (ni0,ai0)minKj(n_{i_{0}},a_{i_{0}})\in\min K_{j} with (ni0,ai0)Bj\uparrow\!\!(n_{i_{0}},a_{i_{0}})\bigcap B^{\prime}_{j} and Ei0={mi:(mi,si)(ni0,ai0)Bj}E_{i_{0}}=\{m_{i}:(m_{i},s_{i})\in\ \uparrow\!\!(n_{i_{0}},a_{i_{0}})\bigcap B^{\prime}_{j}\} being uncountable, by the aids of the equation {mi:(mi,si)Bj}=ij{mi:(mi,si)(nik,aik)Bj}\{m_{i}:(m_{i},s_{i})\in B^{\prime}_{j}\}=\bigcup_{i\geq j}\{m_{i}:(m_{i},s_{i})\in\ \uparrow\!(n_{i_{k}},a_{i_{k}})\bigcap B^{\prime}_{j}\} and the uncountability of the set {mi:(mi,si)Bj}\{m_{i}:(m_{i},s_{i})\in B^{\prime}_{j}\}. Thus there is a miEi0m_{i}\in E_{i_{0}} with mini0m_{i}\neq n_{i_{0}}. In a conclusion, we can find (mij,sij)Bj(m_{i_{j}},s_{i_{j}})\in B^{\prime}_{j} and (nij,aij)minKj(n_{i_{j}},a_{i_{j}})\in\min K_{j} satisfying (nij,aij)<(mij,sij)(n_{i_{j}},a_{i_{j}})<(m_{i_{j}},s_{i_{j}}), with nijmijn_{i_{j}}\neq m_{i_{j}} for any jJ1j\in J_{1}, which means that aij2sija_{i_{j}}\sqsubset_{2}s_{i_{j}} or aij2;1sija_{i_{j}}\sqsubset_{2};\sqsubset_{1}s_{i_{j}}. The fact that {(nij,aij):jJ1}¯Kj\overline{\{(n_{i_{j}},a_{i_{j}}):j\in J_{1}\}}\bigcap K_{j}\neq\emptyset, for any jJ1j\in J_{1} suggests that {(nij,aij):jJ1}¯=Ls0\overline{\{(n_{i_{j}},a_{i_{j}}):j\in J_{1}\}}=\downarrow\!L_{s_{0}} from the minimality of Ls0\mathord{\downarrow}L_{s_{0}}. This implies that {aij:jJ1}¯={s0}¯=s0\overline{\{a_{i_{j}}:j\in J_{1}\}}=\overline{\{s_{0}\}}=\ \downarrow\!\!s_{0}. It follows that s0=jJ1aijs_{0}=\vee_{j\in J_{1}}a_{i_{j}}. The fact that aijf(minKj)f(Kj1)minf(minKj1)=Fa_{i_{j}}\in f(\min K_{j})\subseteq\ f(K_{j_{1}})\subseteq\ \uparrow\!\min f(\min K_{j_{1}})=\ \uparrow\!F indicates that {aij:jJ1}=aF(a{aij:jJ1})\{a_{i_{j}}:j\in J_{1}\}=\bigcup_{a\in F}(\uparrow\!a\cap\{a_{i_{j}}:j\in J_{1}\}), where F=minf(minKj1)F=\min f(\min K_{j_{1}}). Then FF is finite by Lemma 4.14, which leads to

{aij:jJ1}¯aF(a{aij:jJ1})\overline{\{a_{i_{j}}:j\in J_{1}\}}\subseteq\bigcup_{a\in F}\downarrow\!\vee(\uparrow\!a\cap\{a_{i_{j}}:j\in J_{1}\}).

It follows that s0(a0{aij:jJ1})s_{0}\in\downarrow\!\vee(\uparrow\!a_{0}\cap\{a_{i_{j}}:j\in J_{1}\}) for some a0Fa_{0}\in F, that is, s0(a0{aij:jJ1})s_{0}\leq\vee(\uparrow\!a_{0}\cap\{a_{i_{j}}:j\in J_{1}\}). Then s0=(a0{aij:jJ1})s_{0}=\vee(\uparrow\!a_{0}\cap\{a_{i_{j}}:j\in J_{1}\}) according to s0=jJ1aijs_{0}=\vee_{j\in J_{1}}a_{i_{j}}. It turns out that there is a chain of the form {v.s:vD}\{v.s:v\in D\} being a cofinal subset of a0{aij:jJ1}\uparrow\!a_{0}\cap\{a_{i_{j}}:j\in J_{1}\} enjoying s0=supvDv.ss_{0}=\sup_{v\in D}v.s. This means that |s0|=|v.s||s_{0}|=|v.s| or |s0|+1=|v.s||s_{0}|+1=|v.s|. Note that v.s(a0{aij:jJ1})v.s\in(\uparrow\!a_{0}\cap\{a_{i_{j}}:j\in J_{1}\}) for any vDv\in D. Then assume v.s=aijvv.s=a_{i_{j_{v}}}. We notice that v.s2sijvv.s\sqsubset_{2}s_{i_{j_{v}}} or v.s2;1sijvv.s\sqsubset_{2};\sqsubset_{1}s_{i_{j_{v}}}, and conclude that |v.s|>|sijv||v.s|>|s_{i_{j_{v}}}|. We claim that |sijv|=|s0||s_{i_{j_{v}}}|=|s_{0}|. If not, |sijv||s0||s_{i_{j_{v}}}|\neq|s_{0}|. The fact that sijvs0s_{i_{j_{v}}}\sqsubset s_{0} deduces |sijv|>|s0||s_{i_{j_{v}}}|>|s_{0}|, then |v.s|>|sijv|>|s0||v.s|>|s_{i_{j_{v}}}|>|s_{0}|, that is, |v.s|>|s0|+1|v.s|>|s_{0}|+1, a contradiction. Hence, |sijv|=|s0||s_{i_{j_{v}}}|=|s_{0}|, so |v.s|>|s0||v.s|>|s_{0}|. This implies that DD is uncountable because s0=supvDv.ss_{0}=\sup_{v\in D}v.s, which in turn implies that s0=ss_{0}=s, and it means v.s02sijvv.s_{0}\sqsubset_{2}s_{i_{j_{v}}} or v.s02;1sijvv.s_{0}\sqsubset_{2};\sqsubset_{1}s_{i_{j_{v}}}. Then s0sijvs_{0}\sqsubseteq s_{i_{j_{v}}}. But this is a contradiction to the fact that sijvs0s_{i_{j_{v}}}\sqsubset s_{0}. Therefore, Claim 11 holds.

𝐂𝐥𝐚𝐢𝐦𝟐\mathbf{Claim~{}2}: There exists j2Jj_{2}\in J such that minKj2Ls0\min K_{j_{2}}\subseteq L_{s_{0}}.

Assume that for any jJj\in J, minKj\min K_{j} is not contained in Ls0L_{s_{0}}. Then minKj(Ls0Ls0)\min K_{j}\bigcap\ (\downarrow\!L_{s_{0}}\!\setminus L_{s_{0}})\neq\emptyset from the fact that minKjLs0\min K_{j}\subseteq\downarrow\!L_{s_{0}} for any jJj\in J. We pick (mj,sj)minKj(Ls0Ls0)(m_{j},s_{j})\in\min K_{j}\bigcap(\downarrow\!L_{s_{0}}\setminus\!L_{s_{0}}), then sjs0s_{j}\sqsubset s_{0} for all jJj\in J. This contradicts Claim 11.

𝐂𝐥𝐚𝐢𝐦𝟑\mathbf{Claim~{}3}: minKj2\min K_{j_{2}} is finite.

We proceed by contradiction. Suppose that minKj2\min K_{j_{2}} is infinite. By Lemma 4.17, we know that minKj2\min K_{j_{2}} is countable. Let minKj2={(mn,s0):n}\min K_{j_{2}}=\{(m_{n},s_{0}):n\in\mathbb{N}\}, where \mathbb{N} denotes all positive natural numbers. Then we can identify m𝕎m^{\prime}\in\mathbb{W}, which is an upper bound of {mn:n}\{m_{n}:n\in\mathbb{N}\}.

For any nn\in\mathbb{N}, set

Bn=i{1,2,,n1}(mi,s0)(m,s0)B_{n}=\bigcup_{i\in\mathbb{N}\setminus\{1,2,...,n-1\}}\downarrow\!(m_{i},s_{0})\bigcup\downarrow\!(m^{\prime},s_{0}).

It is easy to check that BnB_{n} is Scott closed for any nn\in\mathbb{N}. By the construction of BnB_{n}, we have minKj2Bn\min K_{j_{2}}\cap B_{n}\neq\emptyset for each nn\in\mathbb{N}. Then the compactness of minKj2\min K_{j_{2}} implies that nBnminKj2\bigcap_{n\in\mathbb{N}}B_{n}\bigcap\min K_{j_{2}}\neq\emptyset. Choose (mn0,s0)nBnminKj2(m_{n_{0}},s_{0})\in\bigcap_{n\in\mathbb{N}}B_{n}\bigcap\min K_{j_{2}}. It follows that (mn0,s0)Bn0+1(m_{n_{0}},s_{0})\in B_{n_{0}+1}. Now the remaining arguments are similar to that in Lemma 4.15.

𝐂𝐥𝐚𝐢𝐦𝟒\mathbf{Claim~{}4}: For any jj2,minKjminKj2j\geq j_{2},\min K_{j}\subseteq\min K_{j_{2}}.

By way of contradiction, assume that there is a jj2j^{\prime}\geq j_{2} such that minKjminKj2\min K_{j^{\prime}}\not\subseteq\min K_{j_{2}}, that is, there exists (m,s)minKjminKj2(m,s)\in\min K_{j^{\prime}}\setminus\min K_{j_{2}}. It follows that there is (m1,s1)minKj2(m_{1},s_{1})\in\min K_{j_{2}} such that (m,s)>(m1,s1)(m,s)>(m_{1},s_{1}), which implies s1ss_{1}\sqsubset s. The fact that minKj2Ls0\min K_{j_{2}}\subseteq L_{s_{0}} suggests that s1=s0s_{1}=s_{0}. It indicates that s0ss_{0}\sqsubset s, which contradicts ss0s\sqsubseteq s_{0} as minKj\min K_{j^{\prime}} is contained in Ls0\downarrow\!L_{s_{0}}.

Now let J={jJ:jj2}J^{\prime}=\{j\in J:j\geq j_{2}\}, which is a cofinal subset of JJ, and so Ls0\downarrow\!L_{s_{0}} is a minimal closed set intersects KjK_{j}, for any jJj\in J^{\prime}. Assume minKj2={(ai,s0):i=1,2,,n}\min K_{j_{2}}=\{(a_{i},s_{0}):i=1,2,...,n\} and set F=i{1,2,,n}(ai,s0)F=\bigcup_{i\in\{1,2,...,n\}}\downarrow\!(a_{i},s_{0}). Then FF is Scott closed. Note that FKjF\cap K_{j}\neq\emptyset for any jJj\in J^{\prime} from Cliam 4. But FLs0F\subsetneqq\ \downarrow\!L_{s_{0}}. This violates the minimality of Ls0\downarrow\!L_{s_{0}}. So our assumption that Σ𝒵\Sigma\mathcal{Z} is not well-filtered must have been wrong. ∎

4.5 𝐖𝐅\mathbf{WF} is not Γ\Gamma-faithful

In this subsection, we will show that 𝐖𝐅\mathbf{WF} is not Γ\Gamma-faithful by using the well-filtered dcpo 𝒵\mathcal{Z} constructed above. It is trivial to check that Σ𝒵\Sigma\mathcal{Z} and Σ(IRR(𝒵))Σ𝒵^\Sigma(I\!R\!R(\mathcal{Z}))\triangleq\Sigma\hat{\mathcal{Z}} are not homeomorphism. Thus if we derive Γ𝒵Γ𝒵^\Gamma\mathcal{Z}\cong\Gamma\hat{\mathcal{Z}} and Σ𝒵^\Sigma\hat{\mathcal{Z}} is well-filtered, then this suffices to show that the category 𝐖𝐅\mathbf{WF} is not Γ\Gamma-faithful.

Theorem 4.19.

Γ𝒵Γ𝒵^\Gamma\mathcal{Z}\cong\Gamma\hat{\mathcal{Z}}, that is, the family of Scott closed subsets of 𝒵\mathcal{Z} and 𝒵^\hat{\mathcal{Z}} are isomorphic.

Proof.

One sees clearly that the Scott topology of 𝒵\mathcal{Z} is isomorphic to the lower Vietoris topology of 𝒵^\hat{\mathcal{Z}}, which is the family τ={U:Uσ(𝒵)}\tau=\{\lozenge U:U\in\sigma(\mathcal{Z})\}, where U={A𝒵^:AU}\lozenge U=\{A\in\hat{\mathcal{Z}}:A\cap U\neq\emptyset\}. Note that 𝒵^\hat{\mathcal{Z}} endowed with the lower Vietoris topology is well-filtered. So it remain to prove that the Scott topology of 𝒵^\hat{\mathcal{Z}} and the lower Vietoris topology of 𝒵^\hat{\mathcal{Z}} coincide. It is clear to see that each closed set in the lower Vietoris topology is Scott closed. Now we show the converse. To this end, for each AΓ(𝒵)A\in\Gamma(\mathcal{Z}), we write A={B𝒵^:BA}\Box A=\{B\in\hat{\mathcal{Z}}:B\subseteq A\} and choose 𝒜Γ(𝒵^)\mathcal{A}\in\Gamma(\hat{\mathcal{Z}}). Then it suffices to show that 𝒜\bigcup\mathcal{A} is Scott closed and 𝒜=(𝒜)\mathcal{A}=\Box(\bigcup\mathcal{A}).

First, by Proposition 2.2 (4) in [6], we know that for the dcpo 𝒵\mathcal{Z}, 𝒜\bigcup\mathcal{A} is Scott closed. Next, we confirm that 𝒜=(𝒜)\mathcal{A}=\Box(\bigcup\mathcal{A}). That 𝒜(𝒜)\mathcal{A}\subseteq\Box(\bigcup\mathcal{A}) is trivial. Conversely, let A(𝒜)A\in\Box(\bigcup\mathcal{A}). Then A𝒜A\subseteq\bigcup\mathcal{A}. By Theorem 4.13, we know that A{Ls:s𝕎}{(m,s):(m,s)𝕎×𝕎}A\in\{\mathord{\downarrow}L_{s}:s\in\mathbb{W}^{*}\}\cup\{\mathord{\downarrow}(m,s):(m,s)\in\mathbb{W}\times\mathbb{W}^{*}\}. If AA is the form (m,s)\downarrow\!(m,s) for some (m,s)𝕎×𝕎(m,s)\in\mathbb{W}\times\mathbb{W}^{*}, then A𝒜A\in\mathcal{A} evidently. Else, A=LsA=\ \downarrow\!L_{s} for some s𝕎s\in\mathbb{W}^{*}. It follows that for each m𝕎m\in\mathbb{W}, there is Am𝒜A_{m}\in\mathcal{A} such that (m,s)Am(m,s)\in A_{m}. It turns out that (m,s)𝒜\downarrow\!(m,s)\in\mathcal{A} since 𝒜\mathcal{A} is a lower set. Furthermore, we get that Lm.s𝒜\downarrow\!L_{m.s}\in\mathcal{A} for each m𝕎m\in\mathbb{W} as Lm.s(m,s)\downarrow\!L_{m.s}\subseteq\ \downarrow\!(m,s). Note that {Lm.s:m𝕎}\{\downarrow\!L_{m.s}:m\in\mathbb{W}\} is a directed family contained in 𝒜\mathcal{A} and 𝒜\mathcal{A} is Scott closed. Then A=Ls=supm𝕎Lm.s𝒜A=\downarrow\!L_{s}=\sup_{m\in\mathbb{W}}\downarrow\!L_{m.s}\in\mathcal{A}. So (𝒜)𝒜\Box(\bigcup\mathcal{A})\subseteq\mathcal{A}. Indeed, we have proved that Γ𝒵Γ𝒵^\Gamma\mathcal{Z}\cong\Gamma\hat{\mathcal{Z}}. ∎

5 The category of weak dominated dcpo’s is Γ\Gamma-faithful

Finally, we give a Γ\Gamma-faithful category, that of weakly dominated dcpo’s, which is strictly larger than the category of dominated dcpo’s.

Definition 5.1.

[7] Let PP be a poset and x,yPx,y\in P. We say that xx is beneath y, denoted by xyx\prec^{*}y, if for every nonempty Scott closed set CPC\subseteq P for which supC\sup C exists, the relation ysupCy\leq\sup C always implies that xCx\in C. An element xx of a poset PP is called CC-compact if xxx\prec^{*}x. If P=ΓLP=\Gamma L for some poset LL, then the set of all CC-compact elements of ΓL\Gamma L is denoted by C(ΓL)C(\Gamma L).

The following proposition is a corollary of [7, Proposition 3.4].

Proposition 5.2.

C(ΓL)C(\Gamma L) is a subdcpo of ΓL\Gamma L.

Corollary 5.3.

[7] The family of sets {x:xL}\{\mathord{\downarrow}x:x\in L\} is a subset of C(ΓL)C(\Gamma L).

The following results is crucial for further discussion.

Lemma 5.4.

Let LL be a poset. Then 𝒜\bigcup\mathcal{A} is a Scott closed subset of LL for each 𝒜Γ(C(ΓL))\mathcal{A}\in\Gamma(C(\Gamma L)).

Proof.

One sees directly that 𝒜\bigcup\mathcal{A} is a lower set since each element in 𝒜\mathcal{A} is a lower set. Let DD be a directed subset of 𝒜\bigcup\mathcal{A}. Then there exists Ad𝒜A_{d}\in\mathcal{A} such that dAdd\in A_{d} for any dDd\in D. It follows that dAd\mathord{\downarrow}d\subseteq A_{d} because AdA_{d} is a lower set. From Corollary 5.3, we know that dC(ΓL)\mathord{\downarrow}d\in C(\Gamma L) for any dDd\in D. The fact that 𝒜\mathcal{A} is a lower set in C(ΓL)C(\Gamma L) implies that d𝒜\mathord{\downarrow}d\in\mathcal{A}. This means that {d:dD}\{\mathord{\downarrow}d:d\in D\} is a directed subset of 𝒜\mathcal{A}, which yields that supdDd=supD𝒜\sup_{d\in D}\mathord{\downarrow}d=\mathord{\downarrow}\sup D\in\mathcal{A}. Hence, supD𝒜\sup D\in\bigcup\mathcal{A}. ∎

Definition 5.5.

Let LL be a poset. A set BB is said to be a CC-compact set, if cl(B)cl(B) is a CC-compact element of ΓL\Gamma L.

C-compact sets are preserved by Scott-continuous functions.

Lemma 5.6.

Let L,PL,P be two posets, if the function f:LPf:L\rightarrow P is Scott continuous, then f(A)f(A) is a CC-compact set of PP for any AC(ΓL)A\in C(\Gamma L).

Proof.

We prove that cl(f(A))cl(f(A))cl(f(A))\prec^{*}cl(f(A)). To this end, let 𝒜Γ(ΓP)\mathcal{A}\in\Gamma(\Gamma P) with cl(f(A))𝒜cl(f(A))\subseteq\bigcup\mathcal{A}. Then AB𝒜f1(B)A\subseteq\bigcup_{B\in\mathcal{A}}f^{-1}(B). We write ={f1(B):B𝒜}\mathcal{B}=\mathord{\downarrow}\{f^{-1}(B):B\in\mathcal{A}\}.

We claim that \mathcal{B} is a Scott closed set of ΓL\Gamma L. Obviously, \mathcal{B} is a lower set. Let (Ai)iI(A_{i})_{i\in I} be a directed subset of \mathcal{B}. Then we know that there is Bi𝒜B_{i}\in\mathcal{A} with Aif1(Bi)A_{i}\subseteq f^{-1}(B_{i}) for each iIi\in I. It follows that f(Ai)Bif(A_{i})\subseteq B_{i}, which means that cl(f(Ai))Bi𝒜cl(f(A_{i}))\subseteq B_{i}\in\mathcal{A} for any iIi\in I. The fact that 𝒜\mathcal{A} is a lower set in ΓP\Gamma P tells us that cl(f(Ai))𝒜cl(f(A_{i}))\in\mathcal{A} for each iIi\in I. Then we have cl(f(Ai))iIcl(f(A_{i}))_{i\in I} is a directed subset of 𝒜\mathcal{A}. As 𝒜\mathcal{A} is Scott closed, it follows that supiIcl(f(Ai))=cl(f(iIAi))𝒜\sup_{i\in I}cl(f(A_{i}))=cl(f(\bigcup_{i\in I}A_{i}))\in\mathcal{A}. Thus, supiIAi=cl(iIAi){f1(B)B𝒜}\sup_{i\in I}A_{i}=cl(\bigcup_{i\in I}A_{i})\in\mathord{\downarrow}\{f^{-1}(B)\mid B\in\mathcal{A}\}.

It is easy to see that Asup=A\subseteq\sup\mathcal{B}=\bigcup\mathcal{B}. Then the assumption that AA is a CC-compact element of ΓL\Gamma L guarantees the existence of B𝒜B\in\mathcal{A} such that Af1(B)A\subseteq f^{-1}(B). So we conclude cl(f(A))B𝒜cl(f(A))\subseteq B\in\mathcal{A}. Again, as 𝒜\mathcal{A} is Scott closed, hence a lower set, we obtain that cl(f(A))𝒜cl(f(A))\in\mathcal{A}. As a result, f(A)f(A) is a CC-compact set of PP. ∎

Lemma 5.7.

Let LL be a poset and Γ(C(ΓL))\mathcal{B}\in\Gamma(C(\Gamma L)). If \mathcal{B} is closed under suprema of CC-compact sets, then =={AC(ΓL):A}\mathcal{B}=\Box\bigcup\mathcal{B}=\{A\in C(\Gamma L):A\subseteq\bigcup\mathcal{B}\}.

Proof.

That \mathcal{B}\subseteq\Box\bigcup\mathcal{B} is trivial. Conversely, for any AA\in\Box\bigcup\mathcal{B}, similar to the proof of Lemma 5.4, we know that {x:xA}\{\mathord{\downarrow}x:x\in A\} is a subset of \bigcup\mathcal{B}. Then the function η=(xx):LC(ΓL)\eta=(x\mapsto\mathord{\downarrow}x):L\rightarrow C(\Gamma L) is well-defined and Scott continuous. Then η(A)={x:xA}\eta(A)=\{\mathord{\downarrow}x:x\in A\} is a CC-compact set of C(ΓL)C(\Gamma L) by Lemma 5.6. The assumption that \mathcal{B} is closed under suprema of CC-compact sets ensures that A=supxAx=supη(A)A=\sup_{x\in A}\mathord{\downarrow}x=\sup\eta(A)\in\mathcal{B}. ∎

By applying Lemma 5.4 and Lemma 5.7, we have the following lemma.

Lemma 5.8.

For arbitrary dcpo’s D and E, C(ΓD)C(ΓE)C(\Gamma D)\cong C(\Gamma E) if and only if ΓDΓE\Gamma D\cong\Gamma E.

Proof.

Assume that g:C(ΓD)C(ΓE)g\colon C(\Gamma D)\to C(\Gamma E) is an isomorphism. Then the map g:ΓDΓEg^{\prime}\colon\Gamma D\to\Gamma E that sends a Scott closed subset AA of DD to {g(K)KC(ΓD)andKA}\bigcup\{g(K)\mid K\in C(\Gamma D)~{}\text{and}~{}K\subseteq A\} witnesses an isomorphism between ΓD\Gamma D and ΓE\Gamma E. ∎

Definition 5.9.

Given A,BC(ΓP)A,B\in C(\Gamma P), we write ABA\lhd B if there is xBx\in B such that AxA\subseteq\mathord{\downarrow}x. We write B\nabla B for the set {AC(ΓP):AB}\{A\in C(\Gamma P):A\lhd B\}.

Lemma 5.10.

Let LL be a dcpo and AC(ΓL)A\in C(\Gamma L).

(1)(1) A=supAA=\sup\nabla A.

(2)(2) A\nabla A is a CC-compact set of C(ΓL)C(\Gamma L).

Proof.

The first statement is trivial because xA\mathord{\downarrow}x\lhd A for any xAx\in A.

For the second statement, it suffices to prove that cl(A)cl(A)cl(\nabla A)\prec^{*}cl(\nabla A). To this end, let 𝒜2Γ(Γ(C(ΓL)))\mathcal{A}^{2}\in\Gamma(\Gamma(C(\Gamma L))) with cl(A)𝒜2cl(\nabla A)\subseteq\bigcup\mathcal{A}^{2}.

𝐂𝐥𝐚𝐢𝐦𝟏\mathbf{Claim~{}1}: A𝒜𝒜2𝒜A\subseteq\bigcup_{\mathcal{A}\in\mathcal{A}^{2}}\bigcup\mathcal{A}.

For any xAx\in A, xA𝒜2\mathord{\downarrow}x\in\nabla A\subseteq\bigcup\mathcal{A}^{2}. Then there is 𝒜x𝒜2\mathcal{A}_{x}\in\mathcal{A}^{2} such that x𝒜x\mathord{\downarrow}x\in\mathcal{A}_{x} for each xAx\in A. It follows that x𝒜xx\in\bigcup\mathcal{A}_{x}, and we have A𝒜𝒜2𝒜A\subseteq\bigcup_{\mathcal{A}\in\mathcal{A}^{2}}\bigcup\mathcal{A}.

𝐂𝐥𝐚𝐢𝐦𝟐\mathbf{Claim~{}2}: ={𝒜𝒜𝒜2}Γ(ΓL)\mathcal{B}=\mathord{\downarrow}\{\bigcup\mathcal{A}\mid\mathcal{A}\in\mathcal{A}^{2}\}\in\Gamma(\Gamma L).

It is obvious that \mathcal{B} is a lower set. Let (Bi)iI(B_{i})_{i\in I} be a directed subset of \mathcal{B}. Then there exists 𝒜i𝒜2\mathcal{A}_{i}\in\mathcal{A}^{2} with Bi𝒜iB_{i}\subseteq\bigcup\mathcal{A}_{i} for every iIi\in I. By Corollary 5.3, we know that {xxBi}𝒜i\{\mathord{\downarrow}x\mid x\in B_{i}\}\subseteq\mathcal{A}_{i} for every iIi\in I. It follows that the Scott closure i=cl({xxBi})\mathcal{B}_{i}=cl(\{\mathord{\downarrow}x\mid x\in B_{i}\}), taken inside C(ΓL)C(\Gamma L), is contained in 𝒜i\mathcal{A}_{i}. Then i𝒜2\mathcal{B}_{i}\in\mathcal{A}^{2} as 𝒜2\mathcal{A}^{2} is a lower set. This deduces that supiIi=cl(iIi)𝒜2\sup_{i\in I}\mathcal{B}_{i}=cl(\bigcup_{i\in I}\mathcal{B}_{i})\in\mathcal{A}^{2} since (i)iI(\mathcal{B}_{i})_{i\in I} is a directed subset of 𝒜2\mathcal{A}^{2}. It turns out that cl(iIBi)cl(iIi)cl(\bigcup_{i\in I}B_{i})\subseteq\bigcup cl(\bigcup_{i\in I}\mathcal{B}_{i}). Therefore, supiIBi=cl(iIBi)\sup_{i\in I}B_{i}=cl(\bigcup_{i\in I}B_{i})\in\mathcal{B}. In a conclusion, \mathcal{B} is Scott closed in ΓL\Gamma L.

Since AA is a CC-compact element of ΓL\Gamma L and AA\subseteq\bigcup\mathcal{B}, that AA\in\mathcal{B} holds. This means that there exists 𝒜𝒜2\mathcal{A}\in\mathcal{A}^{2} such that A𝒜A\subseteq\bigcup\mathcal{A}. It turns out that {xxA}𝒜\{\mathord{\downarrow}x\mid x\in A\}\subseteq\mathcal{A}, which yields that A𝒜\nabla A\subseteq\mathcal{A}. So cl(A)𝒜2cl(\nabla A)\in\mathcal{A}^{2}. ∎

Definition 5.11.

A dcpo LL is called CC-compactly complete if every CC-compact subset of LL has a supremum.

Proposition 5.12.

Let LL be a dcpo. Then (C(ΓL),)(C(\Gamma L),\subseteq) is CC-compactly complete. Especially, sup𝒜=𝒜\sup\mathcal{A}=\bigcup\mathcal{A} for any 𝒜C(Γ(C(ΓL)))\mathcal{A}\in C(\Gamma(C(\Gamma L))).

Proof.

It suffices to prove that 𝒜C(ΓL)\bigcup\mathcal{A}\in C(\Gamma L). To this end, let Γ(ΓL)\mathcal{B}\in\Gamma(\Gamma L) with 𝒜\bigcup\mathcal{A}\subseteq\bigcup\mathcal{B}. Then AA\subseteq\bigcup\mathcal{B} for any A𝒜A\in\mathcal{A}. The fact that AA is a CC-compact element of ΓL\Gamma L implies that AA\in\mathcal{B}. This means that 𝒜BB\mathcal{A}\subseteq\bigcup_{B\in\mathcal{B}}\Box B, where B={DC(ΓL)DB}\Box B=\{D\in C(\Gamma L)\mid D\subseteq B\}. Ones sees obviously that B\Box B is a Scott closed set of C(ΓL)C(\Gamma L).

Now we claim that 2={BB}\mathcal{B}^{2}=\mathord{\downarrow}\{\Box B\mid B\in\mathcal{B}\} is a Scott closed set of Γ(C(ΓL))\Gamma(C(\Gamma L)). Clearly, 2\mathcal{B}^{2} is a lower set. Let (𝒜i)iI(\mathcal{A}_{i})_{i\in I} be a directed subset of 2\mathcal{B}^{2}. Then there exists BiB_{i}\in\mathcal{B} with 𝒜iBi\mathcal{A}_{i}\subseteq\Box B_{i} for any iIi\in I. This means that 𝒜iBi\bigcup\mathcal{A}_{i}\subseteq B_{i} for any iIi\in{I}. By Lemma 5.4, we know that the set 𝒜i\bigcup\mathcal{A}_{i} is Scott closed for iIi\in I, which leads to that 𝒜i\bigcup\mathcal{A}_{i}\in\mathcal{B}, as \mathcal{B} is Scott closed. It follows that (𝒜i)iI(\bigcup\mathcal{A}_{i})_{i\in I} is a directed subset of \mathcal{B}. So supiI𝒜i=cl(iI𝒜i)\sup_{i\in I}\bigcup\mathcal{A}_{i}=cl(\bigcup_{i\in I}\bigcup\mathcal{A}_{i})\in\mathcal{B}. This implies that supiI𝒜i(cl(iI𝒜i))\sup_{i\in I}\mathcal{A}_{i}\subseteq\Box(cl(\bigcup_{i\in I}\bigcup\mathcal{A}_{i})). So, supiI𝒜i2\sup_{i\in I}\mathcal{A}_{i}\in\mathcal{B}^{2}.

Note that 𝒜2\mathcal{A}\subseteq\bigcup\mathcal{B}^{2}. Then 𝒜2\mathcal{A}\in\mathcal{B}^{2} from the fact that 𝒜C(Γ(C(ΓL)))\mathcal{A}\in C(\Gamma(C(\Gamma L))). So there exists BB\in\mathcal{B} with 𝒜B\mathcal{A}\subseteq\Box B, and then 𝒜B\bigcup\mathcal{A}\subseteq B. Thus 𝒜\bigcup\mathcal{A}\in\mathcal{B} by Scott closedness of \mathcal{B}. ∎

Finally, we introduce the category of all weakly dominated dcpo’s which serves as a Γ\Gamma-faithful category.

Definition 5.13.

A dcpo LL is called weakly dominated if for every AC(ΓL)A\in C(\Gamma L), the collection A\nabla A is Scott closed in C(ΓL)C(\Gamma L).

Definition 5.14.

Let LL be a CC-compactly complete dcpo and x,yLx,y\in L. We write xyx\prec y if for all closed CC-compact subsets AA, ysupAy\leq\sup A implies that xAx\in A. We say that xLx\in L is \prec-compact if xxx\prec x, and denote the set of all \prec-compact elements by K(L)K(L).

Proposition 5.15.

ABA\lhd B implies that ABA\prec B for any A,BC(ΓL)A,B\in C(\Gamma L).

Proof.

One sees immediately by Proposition 5.12. ∎

Lemma 5.16.

A dcpo LL is weakly dominated, if and only if BAB\prec A implies BAB\lhd A for all A,BC(ΓL)A,B\in C(\Gamma L).

Proof.

If LL is weakly dominated, then AC(Γ(CΓ(L)))\nabla A\in C(\Gamma(C\Gamma(L))) by Lemma 5.10. Assume BAB\prec A, then BAAB\prec A\subseteq\bigcup\nabla A. This means that BAB\in\nabla A.

Conversely, if BAB\prec A implies BAB\lhd A for all A,BC(ΓL)A,B\in C(\Gamma L). We need to check that A\nabla A is Scott closed in C(ΓL)C(\Gamma L). The set A\nabla A is obviously a lower set. Let (Bi)iI(B_{i})_{i\in I} be a directed subset of A\nabla A. Then it remains to show that supiIBiA\sup_{i\in I}B_{i}\prec A by the assumption that BAB\prec A implies BAB\lhd A. For any 𝒜C(Γ(C(ΓL)))\mathcal{A}\in C(\Gamma(C(\Gamma L))), if A𝒜A\subseteq\bigcup\mathcal{A}, then hat BiAB_{i}\prec A implies that Bi𝒜B_{i}\in\mathcal{A}. Note that 𝒜\mathcal{A} is a Scott closed set of C(ΓL)C(\Gamma L) and (Bi)iI(B_{i})_{i\in I} is a directed subset of 𝒜\mathcal{A}. We conclude that supiIBi=cl(iIBi)𝒜\sup_{i\in I}B_{i}=cl(\bigcup_{i\in I}B_{i})\in\mathcal{A}. ∎

By observing the above results, we can get the following corollaries.

Proposition 5.17.

For a weakly dominated dcpo LL, the only \prec-compact elements of C(ΓL)C(\Gamma L) are exactly the principal ideals x\mathord{\downarrow}x, xLx\in L.

Theorem 5.18.

Let LL and PP be weakly dominated dcpo’s. The following are equivalent:

  1. 1.

    LPL\cong P;

  2. 2.

    ΓLΓP\Gamma L\cong\Gamma P;

  3. 3.

    C(ΓL)C(ΓP)C(\Gamma L)\cong C(\Gamma P). \Box

The following theorem follows immediately.

Theorem 5.19.

The category of all weakly dominated dcpo’s is Γ\Gamma-faithful. \Box

6 Weakly dominated dcpo’s may fail to be dominated

From the definitions of dominated dcpo’s and weakly dominated dcpo’s and the fact that C(ΓL)C(\Gamma L) is contained in IRR(L)IRR(L) for each dcpo LL, we could easily see that dominated dcpo’s are weakly dominated. We show in this section, by giving a concrete example, that weak dominated dcpo’s form a strictly larger class than that of dominated ones. As we will see, our example is given in Example 6.4, which relies on two steps of preliminary constructions that are based on Isbell’s complete lattice and Johnstone’s dcpo.

Example 6.1.

Let \mathbb{N}^{\mathbb{N}} denote the maps from \mathbb{N} to \mathbb{N}, S=×S=\mathbb{N}\times\mathbb{N}, T=×T=\mathbb{N}^{\mathbb{N}}\times\mathbb{N}, L=ST{}L=S\cup T\cup\{\top\}, where \mathbb{N} is the set of positive natural numbers. An order \leq on LL is defined as follows:

(m1,n1)(m2,n2)(m_{1},n_{1})\leq(m_{2},n_{2}) if and only if:

  • (m2,n2)=(m_{2},n_{2})=\top, (m1,n1)L(m_{1},n_{1})\in L;

  • m1=m2m_{1}=m_{2}, n1n2n_{1}\leq n_{2}.

Next, let P=L×P=L\times\mathbb{R}, where \mathbb{R} is the set of real numbers. Then there exists an injection i:×××i:\mathbb{R}\times\mathbb{R}\times\mathbb{N}^{\mathbb{N}}\times\mathbb{N}\rightarrow\mathbb{R} such that i(s,t,f,k)>s,ti(s,t,f,k)>s,t for any (s,t,f,k)×××(s,t,f,k)\in\mathbb{R}\times\mathbb{R}\times\mathbb{N}^{\mathbb{N}}\times\mathbb{N} with t>st>s. We write ((n,j),k)((n,j),k) by (n,j,k)(n,j,k) for any ((n,j),k)P((n,j),k)\in P and {(n,i,r):(n,i)L}\{(n,i,r):(n,i)\in L\} by LrL_{r} for any rr\in\mathbb{R}. An order \leq on PP is defined as: (n1,i1,j1)(n2,i2,j2)(n_{1},i_{1},j_{1})\leq(n_{2},i_{2},j_{2}) if and only if:

  • j1=j2j_{1}=j_{2}, (n1,i1)(n2,i2)(n_{1},i_{1})\leq(n_{2},i_{2}) in Lj1L_{j_{1}};

  • (n2,i2)=(n_{2},i_{2})=\top. If (n1,i1)S(n_{1},i_{1})\in S, then there exists t1t_{1}\in\mathbb{R}, f,kf\in\mathbb{N}^{\mathbb{N}},k\in\mathbb{N} such that j2=i(j1,t1,f,k)j_{2}=i(j_{1},t_{1},f,k), t1>j1t_{1}>j_{1} and (n1,i1)=(k,f(k))(n_{1},i_{1})=(k,f(k)). Else, (n1,i1)T(n_{1},i_{1})\in T, then there exists t2t_{2}\in\mathbb{R} such that j2=i(t2,j1,n1,i1)j_{2}=i(t_{2},j_{1},n_{1},i_{1}) and j1>t2j_{1}>t_{2}.

Lemma 6.2.

The poset PP is a dcpo with the fact that there are only finitely many minimal upper bounds for each pair of elements in PP.

Proof.

The proof is similar to [11, Fact 4.1]. ∎

Example 6.3.

Let 𝕁=×(×({ω}))\mathbb{J}_{\infty}=\mathbb{N}\times(\mathbb{N}\times(\mathbb{N}\cup\{\omega\})), where \mathbb{N} is the set of all positive natural numbers. We write (k,(n,j))(k,(n,j)) by (k,n,j)(k,n,j) for any (k,(n,j))𝕁(k,(n,j))\in\mathbb{J}_{\infty} and {(k,n,i):(n,i)×({ω})}\{(k,n,i):(n,i)\in\mathbb{N}\times(\mathbb{N}\cup\{\omega\})\} by 𝕁k\mathbb{J}_{k} for any kk\in\mathbb{N}. An order \leq on 𝕁\mathbb{J}_{\infty} is defined as: (k,m,n)(c,a,b)(k,m,n)\leq(c,a,b) if and only if:

  • k=ck=c, m=am=a, nbn\leq b;

  • kck\leq c, nan\leq a, b=ωb=\omega.

Then C(Γ𝕁)={x:x𝕁}{i=1n𝕁i:n}{𝕁}C(\Gamma\mathbb{J}_{\infty})=\{\mathord{\downarrow}x:x\in\mathbb{J}_{\infty}\}\cup\{\bigcup_{i=1}^{n}\mathbb{J}_{i}:n\in\mathbb{N}\}\cup\{\mathbb{J}_{\infty}\} (We depict 𝕁\mathbb{J}_{\infty} as in Figure 33).

Proof.

𝐂𝐥𝐚𝐢𝐦𝟏\mathbf{Claim~{}1}: rhs \subseteq lhs.

By Corollary 5.3, we know that {x:x𝕁}\{\mathord{\downarrow}x:x\in\mathbb{J}_{\infty}\} is contained in C(Γ𝕁)C(\Gamma\mathbb{J}_{\infty}). For any nn\in\mathbb{N}, i=1n𝕁i\bigcup_{i=1}^{n}\mathbb{J}_{i} is Scott closed. It remains to prove that i=1n𝕁i\bigcup_{i=1}^{n}\mathbb{J}_{i} and 𝕁\mathbb{J}_{\infty} are CC-compact elements of Γ𝕁\Gamma\mathbb{J}_{\infty}. To this end, let 𝒜Γ(Γ𝕁)\mathcal{A}\in\Gamma(\Gamma\mathbb{J}_{\infty}) with i=1n𝕁i𝒜\bigcup_{i=1}^{n}\mathbb{J}_{i}\subseteq\bigcup\mathcal{A}. For any (n,m,ω)𝕁n(n,m,\omega)\in\mathbb{J}_{n}, the result (n,m,ω)𝒜\mathord{\downarrow}(n,m,\omega)\in\mathcal{A} follows obviously. Observing the order on 𝕁\mathbb{J}_{\infty}, we get that the Scott closed set Am={(c,a,b)i=1n𝕁i:cn,a,bm}(n,m,ω)𝒜A_{m}=\{(c,a,b)\in\bigcup_{i=1}^{n}\mathbb{J}_{i}:c\leq n,a\in\mathbb{N},b\leq m\}\subseteq\mathord{\downarrow}(n,m,\omega)\in\mathcal{A}. Then AmA_{m} belongs to 𝒜\mathcal{A} for all mm\in\mathbb{N}. Note that (Am)m(A_{m})_{m\in\mathbb{N}} is a directed subset of 𝒜\mathcal{A}. Then supmAm=i=1n𝕁i𝒜\sup_{m\in\mathbb{N}}A_{m}=\bigcup_{i=1}^{n}\mathbb{J}_{i}\in\mathcal{A} as 𝒜\mathcal{A} is Scott closed. Therefore, i=1n𝕁i\bigcup_{i=1}^{n}\mathbb{J}_{i} is a CC-compact element of Γ𝕁\Gamma\mathbb{J}_{\infty}. The proof of that 𝕁C(Γ𝕁)\mathbb{J}_{\infty}\in C(\Gamma\mathbb{J}_{\infty}) runs similarly.

𝐂𝐥𝐢𝐚𝐦𝟐\mathbf{Cliam~{}2}: lhs \subseteq rhs.

Let AC(Γ𝕁)A\in C(\Gamma\mathbb{J}_{\infty}). For the sake of a contradiction we assume that A{x:x𝕁}{i=1n𝕁i:n}{𝕁}A\notin\{\mathord{\downarrow}x:x\in\mathbb{J}_{\infty}\}\cup\{\bigcup_{i=1}^{n}\mathbb{J}_{i}:n\in\mathbb{N}\}\cup\{\mathbb{J}_{\infty}\}.

  • 𝐂𝐥𝐚𝐢𝐦2.1\mathbf{Claim~{}2.1}: maxAmax𝕁\max A\subseteq\max\mathbb{J}_{\infty}.

    Assume that there is amaxA\max𝕁a\in\max A\backslash\max\mathbb{J}_{\infty}. Then A=maxAa(maxA\{a})A=\mathord{\downarrow}\max A\subseteq\mathord{\downarrow}a\cup\mathord{\downarrow}(\max A\backslash\{a\}). One sees immediately that maxA\{a}\mathord{\downarrow}\max A\backslash\{a\} is Scott closed from the order of 𝕁\mathbb{J}_{\infty}. Because C(Γ𝕁)C(\Gamma\mathbb{J}_{\infty}) is contained in IRR(𝕁)IRR(\mathbb{J}_{\infty}), AA is irreducible. It follows that A=aA=\mathord{\downarrow}a or A=(maxA\{a})A=\mathord{\downarrow}(\max A\backslash\{a\}). The assumption that A{x:x𝕁}A\notin\{\mathord{\downarrow}x:x\in\mathbb{J}_{\infty}\} implies that A=(maxA\{a})A=\mathord{\downarrow}(\max A\backslash\{a\}). This means that amaxA(maxA\{a})a\in\max A\subseteq\mathord{\downarrow}(\max A\backslash\{a\}), which yields that amaxA\{a}a\in\max A\backslash\{a\}. A contradiction.

  • 𝐂𝐥𝐚𝐢𝐦2.2\mathbf{Claim~{}2.2}: Define A={n:A𝕁n}A_{\mathbb{N}}=\{n\in\mathbb{N}:A\cap\mathbb{J}_{n}\neq\emptyset\}. Then AA_{\mathbb{N}} is infinite.

    Suppose AA_{\mathbb{N}} is finite. Let n0=maxAn_{0}=\max A_{\mathbb{N}}. According to A{i=1n𝕁i:n}A\notin\{\bigcup_{i=1}^{n}\mathbb{J}_{i}:n\in\mathbb{N}\}, we have that maxA𝕁n0\max A\cap\mathbb{J}_{n_{0}} is finite. Then A(maxA𝕁n0)i=1n01𝕁iA\subseteq\mathord{\downarrow}(\max A\cap\mathbb{J}_{{}_{n_{0}}})\cup\bigcup_{i=1}^{n_{0}-1}\mathbb{J}_{i}. The set (maxA𝕁n0)\mathord{\downarrow}(\max A\cap\mathbb{J}_{n_{0}}) is Scott closed as maxA𝕁n0\max A\cap\mathbb{J}_{n_{0}} is finite. It is easy to see that i=1n01𝕁i\bigcup_{i=1}^{n_{0}-1}\mathbb{J}_{i} is Scott closed. From the irreducibility of AA and the fact that n0n_{0} belongs to AA_{\mathbb{N}}, we know that A=(maxA𝕁n0)=amaxA𝕁n0aA=\mathord{\downarrow}(\max A\cap\mathbb{J}_{n_{0}})=\bigcup_{a\in\max A\cap\mathbb{J}_{n_{0}}}\mathord{\downarrow}a. This indicates that there exists amaxA𝕁n0a\in\max A\cap\mathbb{J}_{n_{0}} such that A=aA=\mathord{\downarrow}a, which is a contradiction. Hence, AA_{\mathbb{N}} is infinite.

The assumption that A𝕁A\neq\mathbb{J}_{\infty} implies that there exists a minimum natural number k0k_{0}\in\mathbb{N} such that maxA𝕁k\max A\cap\mathbb{J}_{k} is finite for any kk0k\geq k_{0}. If not, for any nn\in\mathbb{N}, there exists knnk_{n}\geq n such that maxA𝕁kn\max A\cap\mathbb{J}_{k_{n}} is infinite. As AA is Scott closed, we have that 𝕁nikn𝕁iA\mathbb{J}_{n}\subseteq\bigcup_{i\leq k_{n}}\mathbb{J}_{i}\subseteq A. This yields 𝕁=A\mathbb{J}_{\infty}=A, a contradiction. We write B={m:(n,m,ω)A,nk0}B=\{m\in\mathbb{N}:\exists(n,m,\omega)\in A,n\geq k_{0}\}, and distinguish the following two cases for BB.

Case 11: BB is finite. Then A(maxA𝕁k0)(maxA\𝕁k0)A\subseteq\mathord{\downarrow}(\max A\cap\mathbb{J}_{k_{0}})\cup\mathord{\downarrow}(\max A\backslash\mathbb{J}_{k_{0}}). Since maxA𝕁k\max A\cap\mathbb{J}_{k} is finite for any kk0k\geq k_{0}, we have (maxA𝕁k0)\mathord{\downarrow}(\max A\cap\mathbb{J}_{k_{0}}) is Scott closed. The finiteness of BB ensures that (maxA\𝕁k0)\mathord{\downarrow}(\max A\backslash\mathbb{J}_{k_{0}}) is Scott closed. Similar to the proof of Claim 2.2, we know that A=xA=\mathord{\downarrow}x for some x𝕁x\in\mathbb{J}_{\infty}. A contradiction.

Case 22: BB is infinite. Note that maxA𝕁i\max A\cap\mathbb{J}_{i} is infinite for any ik01i\leq k_{0}-1. Then i=1k01𝕁iA\bigcup_{i=1}^{k_{0}-1}\mathbb{J}_{i}\subseteq A as AA is Scott closed. It follows that for any (c,a,b)𝕁\max𝕁(c,a,b)\in\mathbb{J}_{\infty}\backslash\max\mathbb{J}_{\infty} with ck0c\geq k_{0}, the set C={mB:mb}C=\{m\in B:m\geq b\} is infinite from the infiniteness of BB. Define E={kk0:(k,m,ω)A,mC}E=\{k\geq k_{0}:\exists(k,m,\omega)\in A,m\in C\}. If E is finite, then there is kEk\in E such that maxA𝕁k\max A\cap\mathbb{J}_{k} is infinite. It follows that k0k+1k_{0}\geq k+1 as k0k_{0} is the minimum natural number with the property that maxA𝕁k\max A\cap\mathbb{J}_{k} is finite for any kk0k\geq k_{0}. This contradicts that kEk\in E. Else, EE is infinite. Then we could find kEk\in E with kck\geq c. This guarantees the existence of (k,m,ω)A(k,m,\omega)\in A such that (c,a,b)(k,m,ω)(c,a,b)\leq(k,m,\omega), which yields that (c,a,b)A(c,a,b)\in A for any (c,a,b)𝕁\max𝕁(c,a,b)\in\mathbb{J}_{\infty}\backslash\max\mathbb{J}_{\infty} with ck0c\geq k_{0}. Then we would know that A=𝕁A=\mathbb{J}_{\infty}, again from the Scott closedness of AA. But that violates the assumption that A𝕁A\neq\mathbb{J}_{\infty}. In summary, we have that Claim 2 holds.

In a conclusion, C(Γ𝕁)={x:x𝕁}{i=1n𝕁i:n}{𝕁}C(\Gamma\mathbb{J}_{\infty})=\{\mathord{\downarrow}x:x\in\mathbb{J}_{\infty}\}\cup\{\bigcup_{i=1}^{n}\mathbb{J}_{i}:n\in\mathbb{N}\}\cup\{\mathbb{J}_{\infty}\}. ∎

(1,3,2)(1,3,2)(2,1,)(2,1,\infty)(3,1,)(3,1,\infty)𝕁1\mathbb{J}_{1}𝕁2\mathbb{J}_{2}𝕁3\mathbb{J}_{3}

Figure 3: The order between different blocks on 𝕁\mathbb{J}_{\infty}.

Now we construct a weakly dominated dcpo MM based the above dcpo’s PP and 𝕁\mathbb{J}_{\infty}, which fails to be dominated.

Example 6.4.

Let M=P𝕁M=P\cup\mathbb{J}_{\infty}. Fix {a:n}\i(×××)\{a_{\mathbb{N}}:n\in\mathbb{N}\}\subseteq\mathbb{R}\backslash i(\mathbb{R}\times\mathbb{R}\times\mathbb{N}^{\mathbb{N}}\times\mathbb{N}), where the function ii is defined as in Example 6.1. An order \leq on MM is defined as xyx\leq y if and only if:

  • xyx\leq y in PP;

  • xyx\leq y in 𝕁\mathbb{J}_{\infty};

  • y=(an,)Py=(a_{n},\top)\in P, x=(c,a,b)𝕁x=(c,a,b)\in\mathbb{J}_{\infty}, cnc\leq n.

Then (M,)(M,\leq) is weak dominated, but not dominated.

Proof.

𝐂𝐥𝐚𝐢𝐦𝟏\mathbf{Claim~{}1}: MM is not dominated.

Similar to the argument of [11, Remark 4.1], MM is an irreducible closed set. Set M={BIRR(M):xM,s.t.Bx}\nabla^{*}M=\{B\in IRR(M):\exists x\in M,s.t.~{}B\subseteq\mathord{\downarrow}x\}. Notice that {i=1n𝕁i:n}\{\bigcup_{i=1}^{n}\mathbb{J}_{i}:n\in\mathbb{N}\} is a directed subset of M\nabla^{*}M, but supni=1n𝕁i=𝕁M\sup_{n\in\mathbb{N}}\bigcup_{i=1}^{n}\mathbb{J}_{i}=\mathbb{J}_{\infty}\notin\nabla^{*}M. Hence, by definition, MM is not dominated.

𝐂𝐥𝐚𝐢𝐦𝟐\mathbf{Claim~{}2}: C(ΓM)={x:xM}{i=1n𝕁i:n}{𝕁}C(\Gamma M)=\{\mathord{\downarrow}x:x\in M\}\cup\{\bigcup_{i=1}^{n}\mathbb{J}_{i}:n\in\mathbb{N}\}\cup\{\mathbb{J}_{\infty}\}.

The right side of the equation is obviously contained in the left side by Example 6.3. Conversely, let AC(ΓM)A\in C(\Gamma M). By way of contradiction we assume that A{x:xM}{i=1n𝕁i:n}{𝕁}A\notin\{\mathord{\downarrow}x:x\in M\}\cup\{\bigcup_{i=1}^{n}\mathbb{J}_{i}:n\in\mathbb{N}\}\cup\{\mathbb{J}_{\infty}\}.

We distinguish the cases whether AA is contained in 𝕁\mathbb{J}_{\infty}:

Case 11: A𝕁A\subseteq\mathbb{J}_{\infty}. In this case we claim that AA is a CC-compact element of Γ𝕁\Gamma\mathbb{J}_{\infty}. To this end, let 𝒜Γ(Γ𝕁)\mathcal{A}\in\Gamma(\Gamma\mathbb{J}_{\infty}) with A𝒜A\subseteq\bigcup\mathcal{A}. Then the fact that 𝕁\mathbb{J}_{\infty} is a Scott closed set of MM indicates that 𝒜\mathcal{A} is a Scott closed subset of ΓM\Gamma M. It follows that A𝒜A\in\mathcal{A} as AC(ΓM)A\in C(\Gamma M). So we have AA is a CC-compact element of Γ𝕁\Gamma\mathbb{J}_{\infty}, that is, AC(Γ𝕁)={x:x𝕁}{i=1n𝕁i:n}{𝕁}A\in C(\Gamma\mathbb{J}_{\infty})=\{\mathord{\downarrow}x:x\in\mathbb{J_{\infty}}\}\cup\{\bigcup_{i=1}^{n}\mathbb{J}_{i}:n\in\mathbb{N}\}\cup\{\mathbb{J}_{\infty}\}. That is a contradiction.

Case 22: A𝕁A\not\subseteq\mathbb{J}_{\infty}. Then APA\cap P\neq\emptyset. We claim that A=(AP)A=\mathord{\downarrow}(A\cap P). Note that A(AP)𝕁A\subseteq\mathord{\downarrow}(A\cap P)\cup\mathbb{J_{\infty}}. By the definition of MM, one sees immediately that (AP)\mathord{\downarrow}(A\cap P) is a Scott closed set of MM. Since AA is a CC-compact element of Γ(M)\Gamma(M), we know that AA is irreducible. This means that A(AP)A\subseteq\mathord{\downarrow}(A\cap P) or A𝕁A\subseteq\mathbb{J}_{\infty}. The assumption that A𝕁A\not\subseteq\mathbb{J}_{\infty} implies that A(AP)A\subseteq\mathord{\downarrow}(A\cap P). In other words, A=(AP)A=\mathord{\downarrow}(A\cap P). Similar to the proof of Example 6.3, we have maxAmaxP\max A\subseteq\max P. Define 𝒜=({x:xmaxA})𝕁\mathcal{A}=\mathord{\downarrow}(\{\mathord{\downarrow}x:x\in\max A\})\cup\mathord{\downarrow}\mathbb{J}_{\infty}. It is obvious that 𝒜\mathcal{A} is a lower set of ΓM\Gamma M. We want to show that 𝒜\mathcal{A} is Scott closed. To this end, let (Ai)iI(A_{i})_{i\in I} be a non-trivial chain of 𝒜\mathcal{A}. Now we distinguish the following two cases for (Ai)iI(A_{i})_{i\in I}.

Case 2.12.1: (Ai)iI𝕁(A_{i})_{i\in I}\subseteq\mathord{\downarrow}\mathbb{J_{\infty}}. Then the fact that 𝕁\mathbb{J}_{\infty} is Scott closed concludes that supiIAi=cl(iIAi)𝕁𝒜\sup_{i\in I}A_{i}=cl(\bigcup_{i\in I}A_{i})\in\mathord{\downarrow}\mathbb{J_{\infty}}\subseteq\mathcal{A}.

Case 2.22.2: (Ai)iI𝕁(A_{i})_{i\in I}\not\subseteq\mathord{\downarrow}\mathbb{J_{\infty}}. Then there exists i0Ii_{0}\in I such that AiPA_{i}\cap P\neq\emptyset for any ii0i\geq i_{0}. This means that there exists bib_{i}\in\mathbb{R} such that Ai(bi,)A_{i}\subseteq\mathord{\downarrow}(b_{i},\top) for all ii0i\geq i_{0}. Now we need to further distinguish the following two cases.

Case 2.2.12.2.1: AiPA_{i}\subseteq P for any ii0i\geq i_{0}. If {biii0}\{b_{i}\mid i\geq i_{0}\} is a finite set, then there exists bib_{i} such that Ai(bi,)A_{i}\subseteq\mathord{\downarrow}(b_{i},\top) for any iIi\in I. It follows that supiIAi((bi,))𝒜\sup_{i\in I}A_{i}\in\mathord{\downarrow}(\mathord{\downarrow}(b_{i},\top))\subseteq\mathcal{A}. Otherwise, {biii0}\{b_{i}\mid i\geq i_{0}\} is an infinite set. Then Aiji(bj,)A_{i}\subseteq\bigcap_{j\geq i}\mathord{\downarrow}(b_{j},\top) for any ii0i\geq i_{0}. In light of Example 6.1, we have that PP is a dcpo with the condition that there are only finitely many minimal upper bounds of each pair of elements in PP, which yields that for any ii0i\geq i_{0}, AiA_{i} must be the form of {(k,m,n):nni}\{(k,m,n):n\leq n_{i}\}, for some fixed ni,mn_{i}\in\mathbb{N},m\in\mathbb{N}\cup\mathbb{N}^{\mathbb{N}} and kk\in\mathbb{R}, and this reveals that {(k,m,n):n}\{(k,m,n):n\in\mathbb{N}\} is a directed subset of AA since AA is a lower set. Scott closedness of AA then implies that (k,m,ω)A(k,m,\omega)\in A. Hence, (k,m,ω)=cl(iIAi)=supiIAi𝒜\mathord{\downarrow}(k,m,\omega)=cl(\bigcup_{i\in I}A_{i})=\sup_{i\in I}A_{i}\in\mathcal{A}.

Case 2.2.22.2.2: there exists i1i0i_{1}\geq i_{0} such that Ai1𝕁A_{i_{1}}\cap\mathbb{J}_{\infty}\neq\emptyset. Then bi\i(×××)b_{i}\in\mathbb{R}\backslash i(\mathbb{R}\times\mathbb{R}\times\mathbb{N}^{\mathbb{N}}\times\mathbb{N}) for any ii1i\geq i_{1}. For any i,ji1i,j\geq i_{1} with jij\geq i, we know AiPAjP\emptyset\neq A_{i}\cap P\subseteq A_{j}\cap P. This implies that bi=bjb_{i}=b_{j} by the order defined on MM, which yields that bi=b0b_{i}=b_{0} for any ii1i\geq i_{1}. It turns out that Ai(b0,)A_{i}\subseteq\mathord{\downarrow}(b_{0},\top) for any iIi\in I. Thus, supiIAi(b0,)𝒜\sup_{i\in I}A_{i}\subseteq\mathord{\downarrow}(b_{0},\top)\in\mathcal{A}.

In the both sub-cases, hence in the Case 2.2, 𝒜\mathcal{A} is Scott closed.

Now in the Case 2, we then know that A𝒜A\in\mathcal{A} since AC(ΓM)A\in C(\Gamma M). This gives that A=xA=\mathord{\downarrow}x for some xAx\in A or A𝕁A\subseteq\mathbb{J}_{\infty}. A contradiction. Hence we finish proving Claim 2.

Now it is trivial to check that A\nabla A is Scott closed for AC(ΓM)A\in C(\Gamma M). So Indeed, (M,)(M,\leq) is weak dominated, but not dominated. ∎

Acknowledgement

This work is supported by the National Natural Science Foundation of China (No.12401596, No.12231007 and No.12371457).

References

  • [1] A. Alghoussein, A.S. Ibrahim, A Counterexample to the Generalized Ho-Zhao Problem, Journal of Mathematics Research, 7(3) (2015) 137-140.
  • [2] D. Drake, W.J. Thron, On the representations of an abstract lattice as the family of closed sets of a topological space, Transactions of the American Mathematical Society, 120(1) (1965) 57-71.
  • [3] R. Engelking, General Topology, Sigma Series in Pure Mathematics, 1989.
  • [4] G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove, D. S. Scott, Continuous Lattices and Domains, Cambridge University Press, 2003.
  • [5] J. Goubault-Larrecq, Non-Hausdorff Topology and Domain Theory, Cambridge University Press, 2013.
  • [6] W. Ho, J. Goubault-Larrecq, A. Jung, X. Xi, The Ho-Zhao Problem, Logical Methods in Computer science, 14(1:7) (2018) 1-19.
  • [7] W. Ho, D. Zhao, Lattices of Scott-closed sets, Commentationes Mathematicae Universitatis Carolinae, 50(2) (2009) 297-314.
  • [8] X. Jia, Meet-continuity and locally compact sober dcpo’s, PHD thesis, University of Birmingham, 2018.
  • [9] J. D. Lawson, G. Wu, X. Xi, Well-filtered spaces, compactness, and the lower topology, Houston Journal of Mathematics, 46 (2020) 283-294.
  • [10] G. Markowsky, Chain-complete posets and directed sets with applications, Algebra Universalis, 6 (1976) 53-68.
  • [11] H. Miao, Z. Yuan, Q. Li, A discussion of well-filteredness and sobriety, Topology and its Applications, 291 (2020) 107450.
  • [12] H. Miao, Q. Li, D. Zhao, On two problems about sobriety of topological spaces, Topology and its Applications, 295 (2021) 107667.
  • [13] H. Miao, L. Wang, Q. Li, D-completion, well-filterification and sobrification, arXiv: 2101.04894.
  • [14] C. Shen, X. Xi, X. Xu, D. Zhao, On well-filtered reflections of T0T_{0} spaces, Topology and its Applications, 267 (2019) 106869.
  • [15] D. Zhao, T. Fan, Dcpo-completion of posets, Theoretical Computer Science, 411 (2010) 2167-2173.
  • [16] D. Zhao, X. Xi, Y. Chen, A new dcpo whose Scott topology is well-filtered but not sober, Topology and its Applications, 252 (2019) 97-102.