{"id":2507,"date":"2020-06-20T10:12:34","date_gmt":"2020-06-20T08:12:34","guid":{"rendered":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=2507"},"modified":"2022-11-19T15:02:47","modified_gmt":"2022-11-19T14:02:47","slug":"zhao-xi-and-chens-well-filtered-non-sober-dcpo","status":"publish","type":"page","link":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=2507","title":{"rendered":"Zhao, Xi, and Chen&#8217;s well-filtered, non-sober dcpo"},"content":{"rendered":"\n<p class=\"wp-block-paragraph\">There are several known examples of dcpos that are well-filtered, but not sober, and I have mentioned a few ones <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=2259\">here<\/a>, where I have made a detailed description of one due to Xiaodong Jia.  I would like to explain another one, due to Dongsheng Zhao, Xiaoyong Xi, and Yixiang Chen [1].  This is a very simple modification of Johnstone&#8217;s non-sober dcpo <strong>J<\/strong> [2].  Contrarily to Xiaodong Jia&#8217;s dcpo (and to <strong>J<\/strong>), it is uncountable, but it may be easier to see why it must be well-filtered.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Let me remind you that a space is <em>well-filtered<\/em> if and only if for every open subset <em>U<\/em>, for every filtered family (<em>Q<sub>i<\/sub><\/em>)<sub><em>i <\/em>\u2208 <em>I<\/em><\/sub> of compact saturated subsets whose intersection is included in <em>U<\/em>, some <em>Q<sub>i<\/sub><\/em> is already included in <em>U<\/em>.  Every sober space is well-filtered, but the converse fails.  (See Section 8.3.1 of the <a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a> for further information.)<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">The cofinite and the cocountable topologies<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">Before we recall Johnstone&#8217;s dcpo <strong>J<\/strong> and its modification by Zhao, Xi, and Chen, we should first examine the difference between two funny topologies, the cofinite topology, and the cocountable topology.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The reason why I am starting with this is that  <strong>J<\/strong> has a so-called top row, and that the induced topology on that top row is the cofinite topology.  The dcpo constructed by Zhao, Xi, and Chen has a similar shape, but aims to obtain the related, but in fact rather different, cocountable topology on the top row.  Considering that I have seen Dongsheng Zhao use the cocountable topology as a counterexample in several papers, I would imagine that this is the way they came up with the construction of [1].<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The <em>cofinite topology<\/em> on a set <em>X<\/em> is defined by letting the closed sets be exactly the finite subsets of <em>X<\/em>, plus <em>X<\/em> itself.  If <em>X<\/em> is finite, that is just the discrete topology, and that is not specially interesting.  In general, this builds a topological space that is T<sub>1<\/sub> but not T<sub>2<\/sub>.  It is Noetherian, meaning that all its subsets are compact (Exercise 4.4.24 of the <a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>); when <em>X<\/em> is infinite, it is not sober (Example 8.2.8 in the <a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>\u2014although only the case of <strong>N<\/strong> is dealt with there, the argument is similar for any infinite set <em>X<\/em>); and, when <em>X<\/em> is infinite again, it is not well-filtered.  Why?  Because the family of all non-empty open subsets of <em>X<\/em> is a filtered family of compact saturated subsets (<em>X<\/em> is Noetherian), whose intersection is included in the open set \u2205, but no element of the family is included in \u2205.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The <em>cocountable topology<\/em> is defined similarly: its closed sets are exactly the (finite or infinite) countable subsets, plus the whole set <em>X<\/em> itself.  If <em>X<\/em> is countable, this is just the discrete topology, so only the case where <em>X<\/em> is uncountable is really interesting.  Whatever the case is, any set <em>X<\/em> with the cocountable topology is T<sub>1<\/sub> but not T<sub>2<\/sub>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">However, there is a big difference with the cofinite topology: in the cofinite topology, we had an incredible amount of compact subsets (all sets were compact); in the cocountable topology, there are very few of them:<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Lemma.<\/strong>  On a set <em>X<\/em> with the cocountable topology, the compact subsets are exactly the finite subsets.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><em>Proof.<\/em> Every finite subset is always compact.  Conversely, let <em>K<\/em> be a compact subset of <em>X<\/em>, and let us assume that <em>K<\/em> is infinite.  Then there is an infinite sequence <em>x<\/em><sub>0<\/sub>, <em>x<\/em><sub>1<\/sub>, &#8230;, <em>x<sub>n<\/sub><\/em>, &#8230; of pairwise distinct points in <em>K<\/em>.  Let <em>C<sub>n<\/sub><\/em> be the set {<em>x<sub>n<\/sub><\/em>, <em>x<sub>n<\/sub><\/em><sub>+1<\/sub>, &#8230;}.  This is a countable set, hence a closed set.  Each <em>C<sub>n<\/sub><\/em> intersects <em>K<\/em>, and the sets <em>C<sub>n<\/sub><\/em> form a filtered family (in fact a decreasing sequence) of closed sets.  Since <em>K<\/em> is compact, the intersection \u2229<sub><em>n<\/em> \u2208 <strong>N<\/strong><\/sub> <em>C<sub>n<\/sub><\/em> must also intersect <em>K<\/em>&#8230; but \u2229<sub><em>n<\/em> \u2208 <strong>N<\/strong><\/sub> <em>C<sub>n<\/sub><\/em> is empty: contradiction.  \u2610<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">It follows that any set with the cocountable topology is well-filtered: a filtered family (<em>Q<sub>i<\/sub><\/em>)<sub><em>i <\/em>\u2208 <em>I<\/em><\/sub> of compact saturated sets is just a filtered family of finite subsets, and its intersection <em>Q<\/em> must therefore be one of the sets <em>Q<sub>i<\/sub><\/em> already.  Hence, if <em>Q<\/em> is included in some open subset <em>U<\/em>, then <em>Q<sub>i<\/sub><\/em> is trivially also included in <em>U<\/em>.  We obtain the following.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Proposition A.<\/strong>  Given any set <em>X<\/em>, the space <em>X<\/em> with the cocountable topology is well-filtered.  If <em>X<\/em> is uncountable, then it is not sober.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><em>Proof.<\/em>   We have just proved well-filteredness.  As far as sobriety is concerned, the union of any two proper closed subsets (hence, countable subsets) is countable, hence proper (because <em>X<\/em> is uncountable; &#8220;proper&#8221; means different from the whole set <em>X<\/em>).  Passing to complements, any two non-empty open subsets have a non-empty intersection.  We claim that this says that <em>X<\/em> is itself an irreducible closed set: for any two open subsets <em>U<\/em> and <em>V<\/em> that intersect <em>X<\/em> (i.e., that are non-empty), <em>U<\/em> \u2229 <em>V<\/em> also intersects <em>X<\/em> (is non-empty). Clearly, <em>X<\/em> has no largest element (it is T<sub>1<\/sub>, so its specialization ordering is equality), or equivalently is not the closure of a point, so <em>X<\/em> is not sober.  \u2610<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Johnstone&#8217;s dcpo <strong>J<\/strong><\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">Let me recall how <strong>J<\/strong> is defined.  <strong>J<\/strong> is the set of pairs (<em>j<\/em>, <em>k<\/em>) in <strong>N<\/strong> \u00d7 (<strong>N<\/strong> \u222a {\u03c9}), ordered by (<em>j<\/em>, <em>k<\/em>) \u2264 (<em>j&#8217;<\/em>, <em>k&#8217;<\/em>) if and only if either <em>j<\/em>=<em>j&#8217;<\/em> and <em>k<\/em>\u2264<em>k&#8217;<\/em>, or <em>k<\/em>\u2264<em>j&#8217;<\/em> and <em>k&#8217;<\/em>=\u03c9. In pictures, this is the set of points displayed below. To go up in the Johnstone ordering, you can either go up vertically, following one of the black lines; or you can follow one of the colored arrows right to the top (for example, if you are on the third row from the bottom, colored with the lightest shade of blue, you can move right to the point (2,\u03c9 ).)<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-large is-resized\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/wp-content\/uploads\/2020\/06\/johnstone-J-improved.png\" alt=\"\" class=\"wp-image-2513\" width=\"454\" height=\"295\"\/><figcaption class=\"wp-element-caption\">Johnstone&#8217;s dcpo <strong>J<\/strong><\/figcaption><\/figure>\n<\/div>\n\n\n<p class=\"wp-block-paragraph\">The Zhao-Xi-Chen dcpo <strong>J<\/strong><sub>\u03b1<\/sub> is defined similarly, except that <strong>N<\/strong> is replaced by a regular ordinal \u03b1.  (I will explain what this is in a jiffy.)  <strong>J<\/strong> is obtained when \u03b1=\u03c9, the first infinite ordinal. The interesting new case, which is the one considered by Zhao, Xi, and Chen, is when \u03b1 is the first uncountable ordinal \u03c9<sub>1<\/sub>, where something different happens, just like as in the cofinite\/cocountable situation.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Ordinals, regular ordinals<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">In the sequel, let me remind you that \u03b1, as an <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=563\">ordinal<\/a>, is itself a poset of ordinals, namely the ordered set of ordinals strictly less than \u03b1.  For example, 0 is the empty set, 1 = {0}, 2 = {0, 1}, etc.  Those are the finite ordinals, but we can go on way further: the first infinite ordinal is \u03c9={0, 1, 2, &#8230;}, then we find \u03c9+1={0, 1, 2, &#8230;, \u03c9}, \u03c9+2={0, 1, 2, &#8230;, \u03c9, \u03c9+1}, and so on.  And those are only very low, countable ordinals.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">With this encoding, for any two ordinals \u03b1 and \u03b2, we say that \u03b1 is strictly smaller than \u03b2 (\u03b1&lt;\u03b2) if and only if \u03b1 is an element of \u03b2, seen as a set; \u03b1 is smaller than or equal to \u03b2 (\u03b1\u2264\u03b2) if and only if \u03b1&lt;\u03b2 or \u03b1=\u03b2, and that is equivalent to \u03b1\u2286\u03b2.  (Refer to the above examples, in order to check this on finite ordinals 0, 1, 2, &#8230;, if you don&#8217;t already know how this works.)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The limit of any chain of ordinals is their supremum, and since \u2264 is just inclusion, it should come as no surprise that the limit is just the union.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">With those definitions, one might guess that the ordinals that are dcpos are exactly the limit ordinals&#8230; but that is just the other way around!  For example, the limit ordinal \u03c9={0, 1, 2, &#8230;} is <em>not<\/em> a dcpo, because its supremum \u03c9 fails to be in it.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The ordinals that are dcpos are exactly those that are <em>not<\/em> limit ordinals.  For example, 0, 1, 2, &#8230;, \u03c9+1, \u03c9+2, &#8230;, are all dcpos.  The interesting ones are those of the form \u03b1+1, where \u03b1 is a limit ordinal: \u03b1+1 is the dcpo of all ordinals less than or equal to \u03b1, and in particular \u03b1 is its largest element.  We will need to keep that in mind when we see the description of the Zhao-Xi-Chen dcpo <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> below.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We will be specifically interested in certain ordinals called <em>regular ordinals<\/em>.  A regular ordinal is a limit ordinal \u03b1 such that, for every ordinal \u03b3&lt;\u03b1, for every monotonic chain (\u03b2<sub><em>i<\/em><\/sub>)<sub><em>i<\/em>&lt;\u03b3<\/sub> of ordinals \u03b2<sub><em>i<\/em><\/sub>&lt;\u03b1, sup<sub><em>i<\/em>&lt;\u03b3<\/sub> \u03b2<sub><em>i<\/em><\/sub> is again strictly less than \u03b1.  In other words, the supremum of any <em>small<\/em> family of <em>small<\/em> ordinals is again <em>small<\/em>, where by <em>small<\/em> I mean strictly less than \u03b1, or (for the whole family) indexed by a small ordinal.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The first regular ordinal is \u03c9.  In that case, <em>small<\/em> means finite, and indeed the supremum of any finite collection of finite ordinals (natural numbers) is a finite ordinal.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The one that Zhao, Xi, and Chen consider is \u03c9<sub>1<\/sub>, namely the first uncountable ordinal.  In that case, <em>small<\/em> means countable, and indeed the supremum of any countable collection of countable ordinals is countable.  In other words, the union of countably many countable ordinals (or even sets) is countable.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">There are other regular ordinals, but knowing that \u03c9 and \u03c9<sub>1<\/sub> are regular ordinals will be enough for our purposes.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">The dcpo <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub><\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">Let me give the actual definition of <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>, where \u03b1 is any limit ordinal.  (We do not require it to be a regular ordinal yet.)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is the set of pairs (<em>j<\/em>, <em>k<\/em>) in \u03b1 \u00d7 (\u03b1+1), ordered by (<em>j<\/em>, <em>k<\/em>) \u2264 (<em>j&#8217;<\/em>, <em>k&#8217;<\/em>) if and only if either <em>j<\/em>=<em>j&#8217;<\/em> and <em>k<\/em>\u2264<em>k&#8217;<\/em>, or <em>k<\/em>\u2264<em>j&#8217;<\/em> and <em>k&#8217;<\/em>=\u03b1. See the picture below, and compare with the picture given for <strong>J<\/strong> above. To go up in <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>, you can either go up vertically, following one of the black lines; or you can follow one of the colored arrows right to the top.<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-large is-resized\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/wp-content\/uploads\/2020\/06\/zhaoxichen.png\" alt=\"\" class=\"wp-image-2516\" width=\"750\" height=\"400\"\/><figcaption class=\"wp-element-caption\">The Zhao-Xi-Chen dcpo <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>.<\/figcaption><\/figure>\n<\/div>\n\n\n<p class=\"wp-block-paragraph\">This is very similar to <strong>J<\/strong>.  In fact, <strong>J<\/strong> is just <strong><strong>J<\/strong><\/strong><sub>\u03c9<\/sub>, of course.  When \u03b1&gt;\u03c9, beware that there are a few differences.  The most notable one, for now, is that, in <strong>J<\/strong>, all the chains (non-empty totally ordered families) are either trivial (contain their supremum), or their supremum is on the top row.  In <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> where \u03b1&gt;\u03c9, however, the chain of elements (0,0), (0,1), (0,2), &#8230;, has (0,\u03c9) as supremum, and that is <em>not<\/em> on the top row.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">At least, the shape of non-trivial directed families is simple.  Just as in <strong>J<\/strong>, those are just chains included in one of the columns.  (Zhao, Xi, and Chen call <em>pillars<\/em> those columns.)  We require \u03b1 to be a limit ordinal, so that every element of the top row is a limit of a chain of elements <em>strictly<\/em> below it.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">This allows us to use the following familiar argument to discover some of the properties of open subsets of <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>, just as in <strong>J<\/strong>.  Let <em>U<\/em> be an open subset of <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>, and let us imagine that <em>U<\/em> contains a point (<em>j<\/em>,\u03b1) on the top row of <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>.  Since (<em>j<\/em>,\u03b1) is the supremum of the chain of elements (<em>j<\/em>,<em>k<\/em>) with <em>k<\/em>&lt;\u03b1, at least one of these elements (<em>j<\/em>,<em>k<\/em>) is in <em>U<\/em>.  Since <em>U<\/em> is upwards-closed, all the points (<em>j&#8217;<\/em>,\u03b1) with <em>j&#8217;<\/em>\u2265<em>k<\/em> are in <em>U<\/em>.  In other words, all of the elements of the top row to the right of (<em>k<\/em>,\u03b1) are in <em>U<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">As a first, easy consequence, if we consider any two non-empty open subsets <em>U<\/em> and <em>V<\/em> of <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>, then their intersection must be non-empty.  Indeed, we pick a point of <em>U<\/em> on the top row of <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> (we are in a dcpo, and in a dcpo every element lies below some maximal element, by Zorn&#8217;s Lemma), and then all the points (<em>j&#8217;<\/em>,\u03b1) with <em>j&#8217;<\/em>\u2265<em>k<\/em> are in <em>U<\/em>, for some <em>k<\/em>&lt;\u03b1.  Similarly, all the points (<em>j&#8217;<\/em>,\u03b1) with <em>j&#8217;<\/em>\u2265<em>k<\/em>&#8216; are in <em>V<\/em>, for some <em>k&#8217;<\/em>&lt;\u03b1.  Then max(<em>k<\/em>,<em>k&#8217;<\/em>)&lt;\u03b1 (because  max(<em>k<\/em>,<em>k&#8217;<\/em>) is equal to <em>k<\/em> or to <em>k&#8217;<\/em>), and all the points (<em>j&#8217;<\/em>,\u03b1) with <em>j&#8217;<\/em>\u2265max(<em>k<\/em>,<em>k&#8217;<\/em>) are in both <em>U<\/em> and <em>V<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">It follows that <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is itself an irreducible closed set, in the sense that for any two open subsets <em>U<\/em> and <em>V<\/em> that intersect <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> (i.e., that are non-empty), <em>U<\/em> \u2229 <em>V<\/em> also intersects <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> (is non-empty).  Clearly, <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> has no largest element, or equivalently is not the closure of a point, so:<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Fact 0.<\/strong>  For every limit ordinal \u03b1, <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is a non-sober dcpo.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">The induced topology on the top row<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">The induced topology on the top row Max <strong>J<\/strong> of <strong>J<\/strong> is the cofinite topology, as I have already mentioned. (This is Exercise 8.2.14 in the <a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>.)  What is the induced topology on the top row Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> of <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>, for an arbitrary regular ordinal \u03b1?<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We first consider any non-empty open subset <em>U<\/em> of Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>.  Then <em>U<\/em> = <em>V<\/em> \u2229 Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> for some non-empty Scott-open subset <em>V<\/em> of <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>.  Since <em>U<\/em> is non-empty, it contains a point (<em>j<\/em>,\u03b1).  As before, since (<em>j<\/em>,\u03b1) is the supremum of the chain of elements (<em>j<\/em>,<em>k<\/em>), <em>k<\/em>&lt;\u03b1, at least one of these elements (<em>j<\/em>,<em>k<\/em>) is in <em>V<\/em>. Since <em>V<\/em> is upwards-closed, all the points (<em>j&#8217;<\/em>,\u03b1) with <em>j&#8217;<\/em>\u2265<em>k<\/em> are in <em>V<\/em>, and also in Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>, therefore in <em>U<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">This implies that Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> \u2013 <em>U<\/em> is <em>small<\/em>, in the sense that we have used earlier: we can enumerate its elements by using only the elements of some ordinal <em>k<\/em> strictly less than \u03b1.  It will be practical to make that notion more precise, and more suited to the special case of Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>, as follows.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Let me say that a subset <em>C<\/em> of Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>&#8211;<em>small<\/em> if and only if there is an ordinal <em>k<\/em>&lt;\u03b1 such that all the points (<em>j&#8217;<\/em>,\u03b1) of <em>C<\/em> are such that <em>j&#8217;<\/em>&lt;<em>k<\/em>.  (<em>Small<\/em> and <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>&#8211;<em>small<\/em> are really equivalent notions, but I do not want to have to justify this.)  We have just seen that every proper closed subset of <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>&#8211;<em>small<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">For example, when \u03b1=\u03c9, this means that Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> \u2013 <em>U<\/em> is finite (whereas Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is infinite), hence that <em>U<\/em> is open in the cofinite topology, as we expected.  When \u03b1=\u03c9<sub>1<\/sub>, this means that Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> \u2013 <em>U<\/em> is countable (whereas Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is uncountable), namely that <em>U<\/em> is open in the cocountable topology.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">In general, let us call <em>cosmall topology<\/em> the topology on Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> whose closed subsets are the whole set, plus all the <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>-small subsets <em>C<\/em>.  This is really a topology.  It is easy to see that any intersection of closed sets is closed, and finite unions of closed sets are closed: in fact, since \u03b1 is a regular ordinal, any union of a small family of closed sets (where small means indexed by some ordinal strictly less than \u03b1, as before) is again closed.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The following should now be expected.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Lemma B.<\/strong>  For every regular ordinal \u03b1, the induced topology on Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is the cosmall topology.  In other words, its proper closed subsets are exactly the <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>-small subsets.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><em>Proof.<\/em>  We have seen that every closed set is <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>-small.  It remains to show that, conversely, every <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>-small subset <em>C<\/em> of Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is closed.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Since <em>C<\/em> is <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>-small, by definition, there an ordinal <em>k<\/em><sub>0<\/sub>&lt;\u03b1 such that all the points (<em>j&#8217;<\/em>,\u03b1) of <em>C<\/em> are such that <em>j&#8217;<\/em>&lt;<em>k<\/em><sub>0<\/sub>.  Note that <em>k<\/em><sub>0<\/sub>+1&lt;\u03b1: otherwise we would have <em>k<\/em><sub>0<\/sub>+1=\u03b1, which is impossible since \u03b1 is a limit ordinal, and <em>k<\/em><sub>0<\/sub>+1 is not.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">In order to show that <em>C<\/em> is closed in Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>, we must exhibit a Scott-closed subset <em>C&#8217;<\/em> of <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> such that <em>C&#8217;<\/em> \u2229 Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> = <em>C<\/em>.  We start by taking the downward closure \u2193<em>C<\/em> of <em>C<\/em> in <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>, but that may fail to be closed under directed suprema.  Instead of closing it under directed suprema, and following Zhao, Xi, and Chen, we do a much simpler thing: we add all the points (<em>j<\/em>,<em>k<\/em>) in <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> such that <em>k<\/em>\u2264<em>k<\/em><sub>0<\/sub>.  In other words, we define <em>C&#8217;<\/em> as \u2193<em>C<\/em> \u222a (\u03b1 \u00d7 (<em>k<\/em><sub>0<\/sub>+1)).<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Note that, since <em>k<\/em><sub>0<\/sub>+1&lt;\u03b1, no element of \u03b1 \u00d7 (<em>k<\/em><sub>0<\/sub>+1) is on the top row; hence the elements of <em>C&#8217;<\/em> that are on the top row Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> are exactly those of <em>C<\/em>.  In pictures, <em>C&#8217;<\/em> looks like the following.  (<em>C<\/em> is in red, on top, \u03b1 \u00d7 (<em>k<\/em><sub>0<\/sub>+1) is shown in light pink, and the dark pink area is the part of \u2193<em>C<\/em> that is not covered by the other two areas, namely by \u03b1 \u00d7 (<em>k<\/em><sub>0<\/sub>+1) or by <em>C<\/em> itself.)<\/p>\n\n\n\n<figure class=\"wp-block-image size-large is-resized\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/wp-content\/uploads\/2020\/06\/zhaoxi-closed.png\" alt=\"\" class=\"wp-image-2531\" width=\"750\" height=\"400\"\/><figcaption class=\"wp-element-caption\">Showing that every <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>-small subset <em>C<\/em> of Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is closed.<\/figcaption><\/figure>\n\n\n\n<p class=\"wp-block-paragraph\">The reason why we add \u03b1 \u00d7 (<em>k<\/em><sub>0<\/sub>+1) to \u2193<em>C<\/em> in the definition of <em>C&#8217;<\/em> is that the shape of \u2193<em>C<\/em> is more complicated than what the picture above may suggest.  For every point (<em>j&#8217;<\/em>,\u03b1) of <em>C<\/em> (with <em>j&#8217;<\/em>&lt;<em>k<\/em><sub>0<\/sub>), we will find the whole of \u2193(<em>j&#8217;<\/em>,\u03b1) inside \u2193<em>C<\/em>, and that not only includes column number <em>j&#8217;<\/em> (right below (<em>j&#8217;<\/em>,\u03b1), vertically) but also the whole row number <em>j&#8217;<\/em>, and consequently all the rows below it as well.  Hence \u2193<em>C<\/em> really contains not only the red and dark pink areas above, but most of the light pink area as well.  The light pink area \u03b1 \u00d7 (<em>k<\/em><sub>0<\/sub>+1) is slightly larger, and is designed to make sure that <em>C&#8217;<\/em> is Scott-closed.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Let us show this. First, <em>C&#8217;<\/em> is downwards-closed.  This is obvious from the definition of <em>C&#8217;<\/em>, which is the union of two downwards-closed sets.  Next, we consider any non-trivial directed family <em>D<\/em> of elements of <em>C&#8217;<\/em>.  That is completely included in some column, say number <em>j<\/em>.  If <em>D<\/em> contains an element (<em>j<\/em>,<em>k<\/em>) where <em>k<\/em>\u2265<em>k<\/em><sub>0<\/sub>+1, then <em>D<\/em> must extend into the dark pink or red areas, and then sup <em>D<\/em> is again in \u2193<em>C<\/em>, hence in <em>C&#8217;<\/em>.  Otherwise, <em>D<\/em> is entirely included in \u03b1 \u00d7 (<em>k<\/em><sub>0<\/sub>+1), which is already a dcpo (under the ordering (= \u00d7 \u2264)), because <em>k<\/em><sub>0<\/sub>+1 is not a limit ordinal: recall that the ordinals that are dcpos are exactly those that are not limit ordinals!<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">To sum up, <em>C&#8217;<\/em> is Scott-closed, its intersection with Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is <em>C<\/em>, hence we are done.  \u2610<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">This is interesting, because of the following analogue of Proposition A.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Proposition A&#8217;.<\/strong>  For every regular ordinal \u03b1&gt;\u03c9, Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> (with the induced, namely with the cosmall topology) is well-filtered.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><em>Proof.<\/em> The proof is as for Proposition A: we simply show that all the compact subsets are finite.  Imagine that we had an infinite compact subset <em>K<\/em> of Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>.  We pick an infinite sequence (<em>j<\/em><sub>0<\/sub>,\u03b1), (<em>j<\/em><sub>1<\/sub>,\u03b1), &#8230;, (<em>j<\/em><sub><em>n<\/em><\/sub>,\u03b1), &#8230; of pairwise distinct points in it, we define the set <em>C<sub>n<\/sub><\/em> as {(<em><em>j<\/em><sub><em>n<\/em><\/sub><\/em>,\u03b1), (<em>j<sub>n<\/sub><\/em><sub>+1<\/sub>,\u03b1), &#8230;}. This is a countable set, hence a set of points indexed by indices in \u03c9, and \u03c9&lt;\u03b1 by assumption.  Hence <em>C<sub>n<\/sub><\/em> is <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>-small, and therefore closed.  We have obtained a decreasing sequence of closed sets that each intersect <em>K<\/em>, but whose intersection (being empty) does not intersect <em>K<\/em>: contradiction.  \u2610<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">The compact saturated subsets of <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub><\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">In order to examine whether <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is well-filtered or not, we need to examine its compact saturated subsets.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Hence, let <em>Q<\/em> be any compact saturated subset of <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>.  The most important thing to look at is the set of points (<em>j<\/em>,\u03b1) of <em>Q<\/em> that lie on the top row Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>.  In column <em>j<\/em> (i.e., below (<em>j<\/em>,\u03b1), vertically), it may be the case that there is just one point (necessarily (<em>j<\/em>,\u03b1)) in <em>Q<\/em>: in that case, we say that (<em>j<\/em>,\u03b1) is a <em>singular point<\/em> of <em>Q<\/em>.  Otherwise, we say that (<em>j<\/em>,\u03b1) is a <em>regular point<\/em> of <em>Q<\/em>.  The picture is as follows, where <em>Q<\/em> is depicted in green, there are three regular points (at the top of each of the three green columns), and the remaining green points on the top row are singular.<\/p>\n\n\n\n<figure class=\"wp-block-image size-large is-resized\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/wp-content\/uploads\/2020\/06\/zhaoxi-compact.png\" alt=\"\" class=\"wp-image-2538\" width=\"750\" height=\"400\"\/><figcaption class=\"wp-element-caption\">A compact saturated set <em>Q<\/em> (in green).<\/figcaption><\/figure>\n\n\n\n<p class=\"wp-block-paragraph\">We inquire what the set of regular points of <em>Q<\/em> may be.  The following argument only works if \u03b1&gt;\u03c9.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Proposition C.<\/strong> Let \u03b1 be a regular ordinal.  If \u03b1&gt;\u03c9, then <em>Q<\/em> can only have finitely many regular points.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><em>Proof.<\/em>   The proof by Zhao, Xi, and Chen ([1], Lemma 2, item (2)) seems to be faulty, as noticed by Jordan Brown [3].  The result is correct, fortunately: Brown proposed a repaired proof [3, proof of Theorem 7.5, first paragraph], which we follow, only extending it from \u03c9<sub>1<\/sub> to the case of an arbitrary regular ordinal \u03b1&gt;\u03c9.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">By contradiction, we assume that <em>Q<\/em> contains infinitely many regular points.  Let (<em>j<\/em><sub>0<\/sub>,\u03b1) be the first regular point of <em>Q<\/em>, namely the one where <em>j<\/em><sub>0<\/sub> is least.  Since it is regular, there is a point (<em>j<\/em><sub>0<\/sub>,<em>k<\/em><sub>0<\/sub>) in <em>Q<\/em>, and we can again choose <em>k<\/em><sub>0<\/sub> to be minimal (hence &lt;\u03b1, by definition of regular points).  Next, we look for the second regular point (<em>j<\/em><sub>1<\/sub>,\u03b1) of <em>Q<\/em>, namely such that <em>j<\/em><sub>1<\/sub> is minimal and strictly above <em>j<\/em><sub>0<\/sub>; then there is a point (<em>j<\/em><sub>1<\/sub>,<em>k<\/em><sub>1<\/sub>), with <em>k<\/em><sub>1<\/sub> minimal (hence &lt;\u03b1).  Proceeding this way, we obtain an countably infinite sequence of points (<em>j<sub>n<\/sub><\/em>,<em>k<sub>n<\/sub><\/em>) in <em>Q<\/em>, where <em>j<\/em><sub>0<\/sub>&lt;<em>j<\/em><sub>1<\/sub>&lt;&#8230;&lt;<em>j<\/em><sub><em>n<\/em><\/sub>&lt;&#8230;&lt;\u03b1, and <em>k<\/em><sub>0<\/sub>, <em>k<\/em><sub>1<\/sub>, &#8230;, <em>k<\/em><sub><em>n<\/em><\/sub>, &#8230;&lt;\u03b1.  See the following picture, where only three of those points are shown.<\/p>\n\n\n\n<figure class=\"wp-block-image size-large is-resized\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/wp-content\/uploads\/2020\/06\/zhaxi-compact-jk.png\" alt=\"\" class=\"wp-image-2543\" width=\"750\" height=\"400\"\/><\/figure>\n\n\n\n<p class=\"wp-block-paragraph\">Let <em>k<\/em>=(sup<em><sub>n<\/sub><\/em><sub>\u2208<strong>N<\/strong><\/sub> <em>k<sub>n<\/sub><\/em>)+1.  Since \u03b1&gt;\u03c9, and since \u03b1 is a regular ordinal, we have sup<em><sub>n<\/sub><\/em><sub>\u2208<strong>N<\/strong><\/sub> <em>k<sub>n<\/sub><\/em>&lt;\u03b1, and since \u03b1 is a limit ordinal, it then follows that <em>k<\/em>&lt;\u03b1.  For every <em>j<\/em>&lt;\u03b1, let <em>U<\/em><sub><em>j<\/em><\/sub> be the set consisting of the union of column number <em>j<\/em> with all the rows at and above row <em>k<\/em>, namely the set of points of the form (<em>j<\/em>, anything) or (anything, any ordinal \u2265<em>k<\/em>).  It is easy to see that <em>U<\/em><sub><em>j<\/em><\/sub> is Scott-open: see the following picture, where <em>U<\/em><sub><em>j<\/em><\/sub> is shown in orange.<\/p>\n\n\n\n<figure class=\"wp-block-image size-large is-resized\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/wp-content\/uploads\/2020\/06\/zhaoxi-Uj-1.png\" alt=\"\" class=\"wp-image-2550\" width=\"750\" height=\"400\"\/><\/figure>\n\n\n\n<p class=\"wp-block-paragraph\">The sets <em>U<\/em><sub><em>j<\/em><\/sub>, <em>j<\/em>&lt;\u03b1, form an open cover of <em>Q<\/em>, in fact of the whole of <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>.  Since <em>Q<\/em> is compact, we can extract a finite subcover.  But each <em>U<\/em><sub><em>j<\/em><\/sub> can contain at most one of the points (<em>j<sub>n<\/sub><\/em>,<em>k<sub>n<\/sub><\/em>): since <em>k<sub>n<\/sub><\/em>&lt;<em>k<\/em>, the only point (<em>j<sub>n<\/sub><\/em>,<em>k<sub>n<\/sub><\/em>) that can be in <em>U<\/em><sub><em>j<\/em><\/sub> must satisfy <em>j<sub>n<\/sub><\/em>=<em>j<\/em>.  It follows that the union of the sets <em>U<\/em><sub><em>j<\/em><\/sub> in the chosen finite subcover can contain only finitely many of the points (<em>j<sub>n<\/sub><\/em>,<em>k<sub>n<\/sub><\/em>), hence cannot contain <em>Q<\/em>: contradiction.  \u2610<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is well-filtered&#8230; when \u03b1&gt;\u03c9<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">Let \u03b1 be a regular ordinal strictly larger than \u03c9.  We consider a filtered family (<em>Q<sub>i<\/sub><\/em>)<sub><em>i <\/em>\u2208 <em>I<\/em><\/sub> of compact saturated subsets of <strong>J<\/strong><sub>\u03b1<\/sub>, we let <em>Q<\/em>=\u2229<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> <em>Q<sub>i<\/sub><\/em>, and we assume that <em>Q<\/em> is included in some open subset <em>U<\/em>.  In order to show that <strong>J<\/strong><sub>\u03b1<\/sub> is well-filtered, we need to show that some <em>Q<sub>i<\/sub><\/em> is included in <em>U<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We further define the preordering \u2aaf on <em>I<\/em> by <em>i<\/em>\u2aaf<em>i&#8217;<\/em> if and only if <em>Q<sub>i<\/sub><\/em>\u2287<em>Q<sub>i&#8217;<\/sub><\/em>.  This will allow us to use phrases such as &#8220;for <em>i<\/em> large enough, &#8230;&#8221;, meaning &#8220;there is an index <em>i<\/em><sub>0<\/sub> \u2208 <em>I<\/em> such that for every <em>i<\/em> \u2208 <em>I<\/em> such that <em>i<\/em><sub>0<\/sub>\u2aaf<em>i<\/em>, &#8230;&#8221;.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The proof will now be done in three steps.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Step 1.<\/h4>\n\n\n\n<p class=\"wp-block-paragraph\">Proposition C tells us that every <em>Q<sub>i<\/sub><\/em> contains only finitely many regular points.   Since the set of regular points of <em>Q<sub>i<\/sub><\/em> can only decrease or stay the same when <em>i<\/em> increases, and is finite, we obtain that it stays the same for <em>i<\/em> large enough.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Without loss of generality, we can restrict to the cofinal subfamily of those sets <em>Q<sub>i<\/sub><\/em>.  In other words, we assume that every <em>Q<sub>i<\/sub><\/em> has exactly the same (finite) set of regular points.  Let <em>A<\/em> be the finite set {<em>j<\/em>&lt;\u03b1 | (<em>j<\/em>,\u03b1) is a regular point of <em>Q<sub>i<\/sub><\/em>}.  That is now independent of <em>i<\/em>.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Step 2.<\/h4>\n\n\n\n<p class=\"wp-block-paragraph\">For each <em>j<\/em> in <em>A<\/em>, for every <em>i<\/em> in <em>I<\/em>, since (<em>j<\/em>,\u03b1) is a regular point of <em>Q<sub>i<\/sub><\/em>, there is a point (<em>j<\/em>,<em>k<\/em>) such that <em>k<\/em>&lt;\u03b1 in <em>Q<sub>i<\/sub><\/em>, and, as before, we can choose it lowest in column <em>j<\/em>: let <em>k<sub>ij<\/sub><\/em> be the ordinal <em>k<\/em> that we obtain this way.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">For all <em>i<\/em>, <em>i&#8217;<\/em> in <em>I<\/em> such that <em>i<\/em>\u2aaf<em>i&#8217;<\/em>, we have <em>k<sub>ij<\/sub><\/em>\u2264<em>k<sub>i&#8217;j<\/sub><\/em>.  This is because <em>k<sub>i&#8217;j<\/sub><\/em> is in <em>Q<sub>i&#8217;<\/sub><\/em>, which is included in <em>Q<sub>i<\/sub><\/em>; and then, (<em>j<\/em>,<em>k<sub>i&#8217;j<\/sub><\/em>) is a point in column <em>j<\/em> of <em>Q<sub>i<\/sub><\/em>, which is therefore above (<em>j<\/em>,<em>k<sub>ij<\/sub><\/em>).  As a consequence, the family (<em>k<sub>ij<\/sub><\/em>)<sub><em>i <\/em>\u2208 <em>I<\/em><\/sub> is a chain.  Its supremum is in every <em>Q<sub>i<\/sub><\/em>, hence in <em>Q<\/em>, hence in <em>U<\/em>, and since <em>U<\/em> is Scott-open, <em>k<sub>ij<\/sub><\/em> is in <em>U<\/em> for <em>i<\/em> large enough.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">There are only finitely many indices <em>j<\/em> in <em>A<\/em>, so, for <em>i<\/em> large enough, <em>all<\/em> the points <em>k<sub>ij<\/sub><\/em>, <em>j<\/em> \u2208 <em>A<\/em>, are in <em>U<\/em>.  Hence, further restricting <em>I<\/em> to that cofinal family of indices <em>i<\/em>, we may assume that for every <em>i<\/em> in <em>I<\/em>, the points <em>k<sub>ij<\/sub><\/em>, <em>j<\/em> \u2208 <em>A<\/em>, are all in <em>U<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">In other words, with that further restriction of <em>I<\/em>, the columns that pass through the regular points of <em>Q<sub>i<\/sub><\/em> are included in <em>U<\/em>, for every <em>i<\/em> in <em>I<\/em>.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\">Step 3.<\/h4>\n\n\n\n<p class=\"wp-block-paragraph\">Let <em>C<\/em> be the complement of <em>U<\/em>.  This is a closed set.  Hence <em>Q<sub>i<\/sub><\/em> \u2229 <em>C<\/em> is compact, for every <em>i<\/em> in <em>I<\/em>.  But, following Step 2, the columns that pass through the regular points of <em>Q<sub>i<\/sub><\/em> are included in <em>U<\/em>, so <em>Q<sub>i<\/sub><\/em> \u2229 <em>C<\/em> only contains the singular points of <em>Q<sub>i<\/sub><\/em>.  In particular, <em>Q<sub>i<\/sub><\/em> \u2229 <em>C<\/em> is completely inside the top row Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> of <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">As such, <em>Q<sub>i<\/sub><\/em> \u2229 <em>C<\/em> is a compact subset of the space Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>.  It is also saturated (upwards-closed) since Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is T<sub>1<\/sub> (it is a subset of maximal elements, hence all those elements are incomparable).  Hence we have obtained a filtered family (<em>Q<sub>i<\/sub><\/em> \u2229 <em>C<\/em>)<sub><em>i <\/em>\u2208 <em>I<\/em><\/sub> of compact saturated subsets of Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>.  Moreover, its intersection is <em>Q<\/em> \u2229 <em>C<\/em>, which is empty since <em>Q<\/em> is included in <em>U<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Now recall from Proposition A&#8217; that Max <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is well-filtered.  Hence, for some <em>i<\/em> in <em>I<\/em>, <em>Q<sub>i<\/sub><\/em> \u2229 <em>C<\/em> is empty.  Equivalently, <em>Q<sub>i<\/sub><\/em> is included in <em>U<\/em>.  Done!  <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is well-filtered.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Since <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is not sober (Fact 0), we have proved the following, which is [1, Theorem 1], [3, Theorem 7.5] in the special case where \u03b1=\u03c9<sub>1<\/sub>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Theorem.<\/strong> For every regular ordinal \u03b1&gt;\u03c9, <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub> is a well-filtered, non-sober dcpo.  \u2610<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">As a final word, let me remind you that when \u03b1=\u03c9, <strong><strong>J<\/strong><\/strong><sub>\u03b1<\/sub>=<strong>J<\/strong> is not sober, but is not well-filtered either (Exercise 8.3.9 in the <a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>).  Hence there is a curious gap between the case \u03b1=\u03c9 and the other cases!<\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li>Dongsheng Zhao, Xiaoyong Xi, and Yixiang Chen. <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S0166864118305194\">A new dcpo whose Scott topology is well-filtered but not sober<\/a>. <a href=\"https:\/\/www.sciencedirect.com\/journal\/topology-and-its-applications\">Topology and its Applications<\/a>. <a href=\"https:\/\/www.sciencedirect.com\/science\/journal\/01668641\/252\/supp\/C\">Volume 252<\/a>,&nbsp;1 February 2019, Pages 97-102.<\/li>\n\n\n\n<li>Peter T. Johnstone. <a href=\"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0089911.pdf\">Scott is not always sober<\/a>. Lecture Notes in Mathematics 871, Springer-Verlag, Berlin and New York, pages 282-283, 1981.<\/li>\n\n\n\n<li>Jordan Brown.  <a href=\"https:\/\/math.uchicago.edu\/~may\/REU2019\/REUPapers\/Brown.pdf\">Scott spaces and the dcpo category<\/a>.  <a href=\"https:\/\/math.uchicago.edu\/~may\/REU2019\/\">The University of Chicago Mathematics REU 2019<\/a> (REU seems to mean Research Experience for Undergraduates).<\/li>\n<\/ol>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"alignright is-resized\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/wp-content\/uploads\/2016\/08\/jgl-2011.png\" alt=\"jgl-2011\" class=\"wp-image-993\" width=\"60\" height=\"83\"\/><\/figure>\n<\/div>\n\n\n<p class=\"wp-block-paragraph\">\u2014 <a href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/~goubault\/?l=en\">Jean Goubault-Larrecq<\/a> (June 20th, 2020)<\/p>\n","protected":false},"excerpt":{"rendered":"<p>There are several known examples of dcpos that are well-filtered, but not sober, and I have mentioned a few ones here, where I have made a detailed description of one due to Xiaodong Jia. I would like to explain another &hellip; <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=2507\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_crdt_document":"","footnotes":""},"class_list":["post-2507","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/pages\/2507","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2507"}],"version-history":[{"count":103,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/pages\/2507\/revisions"}],"predecessor-version":[{"id":5900,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/pages\/2507\/revisions\/5900"}],"wp:attachment":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2507"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}