{"id":4939,"date":"2022-04-19T19:25:51","date_gmt":"2022-04-19T17:25:51","guid":{"rendered":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=4939"},"modified":"2023-07-11T14:49:23","modified_gmt":"2023-07-11T12:49:23","slug":"topological-semilattices-with-small-semilattices","status":"publish","type":"page","link":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=4939","title":{"rendered":"Topological semilattices with small semilattices"},"content":{"rendered":"\n<p class=\"wp-block-paragraph\">My purpose today is to explain a counterexample due to Jimmie Lawson [3], or rather a slight variant of it, pertaining to the theory of topological semilattices (which I will not assume to be Hausdorff, contrarily to [3]) and to a property that crops up naturally, namely <em>having small semilattices<\/em>.  Before I can do this, I will have to spend some time explaining what topological semilattices are, and how small semilattices arise naturally.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Semilattices<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">A <em>semilattice<\/em> is a pair (<em>L<\/em>, +) where <em>L<\/em> is a set and + is an associative, commutative, and <em>idempotent<\/em> operator +.  By idempotence, I mean that <em>x<\/em>+<em>x<\/em>=<em>x<\/em> for every <em>x<\/em> in <em>L<\/em>.  Examples abound.   Notably, there are <em>sup-semilattices<\/em>, which are posets in which every pair of elements <em>x<\/em>, <em>y<\/em> has a supremum <em>x<\/em> \u22c1 <em>y<\/em>, in which case we can define + as \u22c1; dually, there are <em>inf-semilattices<\/em>, in which every pair of elements <em>x<\/em>, <em>y<\/em> has an infimum <em>x<\/em> \u22c0 <em>y<\/em>, in which case we define + as \u22c0.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Every semilattice (<em>L<\/em>, +) has an associated ordering \u2291, defined by <em>x<\/em>\u2291<em>y<\/em> if and only if <em>x<\/em>=<em>x<\/em>+<em>y<\/em>.  Notice that, if we start from an inf-semilattice, we recover the original ordering this way.  Conversely, this definition of \u2291 turns <em>L<\/em> into a poset, in which <em>x<\/em>+<em>y<\/em> is the infimum of <em>x<\/em> and <em>y<\/em>, for any two points <em>x<\/em> and <em>y<\/em>.  Therefore semilattices are merely another presentation of inf-semilattices.  (Or also of sup-semilattices, if you decide to take the opposite of \u2291 as your preferred ordering!)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Semilattices occur in a variety of other situations.  Instead of making a comprehensive list, let me concentrate on one particular case where they arise naturally: the question of characterizing the algebras of the finitary Smyth hyperspace monad, as studied by Andrea Schalk [1].  That as well is something I need to introduce.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">The finitary Smyth hyperspace <strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>)<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">For every topological space <em>X<\/em>, let the <em>finitary Smyth hyperspace<\/em> <strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>) be the set of non-empty finitary compact subsets of <em>X<\/em>, by which I mean the subsets of <em>X<\/em> of the form \u2191{<em>x<\/em><sub>1<\/sub>, &#8230;, <em>x<sub>n<\/sub><\/em>}, where <em>n<\/em>\u22651, and \u2191 denotes upward closure with respect to the specialization preordering of <em>X<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">It is easy to see that (<strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>), \u222a) is a semilattice.  Its associated ordering \u2291 is defined by: <em>Q<\/em> is below <em>Q&#8217;<\/em> if and only if <em>Q<\/em> = <em>Q<\/em> \u222a <em>Q&#8217;<\/em>, if and only if <em>Q&#8217;<\/em> is included in <em>Q<\/em>.  In other words, its associated ordering \u2291 is the familiar <em>reverse inclusing<\/em> ordering that we are accustomed to when handling <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=3258\">Smyth powerdomains<\/a> and their variants.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">What other properties does it have?<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We equip <strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>) with the <em>upper Vietoris topology<\/em>, whose basic open subsets are the sets \u2610<em>U<\/em> \u225d {<em>Q<\/em> \u2208 <strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>) | <em>Q<\/em> \u2286 <em>U<\/em>}, where <em>U<\/em> ranges over the open subsets of <em>X<\/em>.  This is the subspace topology induced by the topology with the same name on the <em>Smyth hyperspace<\/em> <strong>Q<\/strong>(<em>X<\/em>); <strong>Q<\/strong>(<em>X<\/em>) is the set of all non-empty compact saturated subsets of <em>X<\/em>, whose basic open subsets I usually also write as \u2610<em>U<\/em>, and are instead defined as {<em>Q<\/em> \u2208 <strong>Q<\/strong>(<em>X<\/em>) | <em>Q<\/em> \u2286 <em>U<\/em>}.  I am only considering <strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>) for now instead of <strong>Q<\/strong>(<em>X<\/em>) for simplicity.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">With that topology, (<strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>), \u222a) is even a <em>topological<\/em> semilattice.  A <em>topological semilattice<\/em> is a semilattice (<em>L<\/em>, +) where <em>L<\/em> is given a topology such that + is <em>jointly<\/em> continuous.  In the case of <strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>), we check that binary union is jointly continuous by verifying that \u222a<sup>\u20131<\/sup>(\u2610<em>U<\/em>) is simply \u2610<em>U<\/em> \u00d7 \u2610<em>U<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Rather easily, <strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>) is T<sub>0<\/sub>, too: its specialization preordering is reverse inclusion.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Finally, for all elements <em>Q<\/em> and <em>Q&#8217;<\/em> of <strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>), we always have <em>Q<\/em> \u2286 <em>Q<\/em> \u222a <em>Q&#8217;<\/em>, namely <em>Q<\/em> \u222a <em>Q&#8217;<\/em> is below <em>Q<\/em> in the specialization ordering.   The topological semilattices (<em>L<\/em>, +) in which <em>x<\/em>+<em>y<\/em> \u2264 <em>x<\/em> for all points <em>x<\/em> and <em>y<\/em>, where \u2264 is the specialization preordering of <em>L<\/em> (not the canonical ordering \u2291 defined from +) are called <em>deflationary<\/em>.  You may compare this with the notion of <em>inflationary<\/em> semilattices, which we have looked at <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=664\">here<\/a>.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Algebras of the <strong>Q<\/strong><sub>fin<\/sub> monad<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">This raises the question whether (<strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>), \u222a) would be the <em>free<\/em> T<sub>0<\/sub> deflationary topological semilattice over the space <em>X<\/em>.  For that question to make sense, we need to define a category of T<sub>0<\/sub> deflationary topological semilattices, with continuous, addition-preserving maps as morphisms, and we ask whether the forgetful functor from that category to the category <strong>Top<\/strong><sub>0<\/sub> of T<sub>0<\/sub> topological spaces has a left adjoint.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Let us approach the problem in a different way.  If (<strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>), \u222a) were the free T<sub>0<\/sub> deflationary topological semilattice over <em>X<\/em>, then the required adjunction would produce a <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=605\">monad<\/a> (<em>T<\/em>, \u03b7, \u03bc) on <strong>Top<\/strong><sub>0<\/sub> such that <em>TX<\/em>=<strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>) for every space <em>X<\/em>, at least up to natural isomorphism.  We already know of such a monad: the unit \u03b7<em><sub>X<\/sub><\/em> : <em>X<\/em> \u2192 <strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>) maps every point <em>x<\/em> of <em>X<\/em> to \u2191<em>x<\/em>, and the multiplication \u03bc<em><sub>X<\/sub><\/em> : <strong>Q<\/strong><sub>fin<\/sub>(<strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>)) \u2192 <strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>) maps every element <strong><em>Q<\/em><\/strong> of <strong>Q<\/strong><sub>fin<\/sub>(<strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>)) to \u222a<strong><em>Q<\/em><\/strong>, the union of all the elements of <strong><em>Q<\/em><\/strong>; explicitly, \u03bc<em><sub>X<\/sub><\/em>(\u2191{\u2191<em>E<\/em><sub>1<\/sub>, &#8230;, \u2191<em>E<sub>n<\/sub><\/em>}) = \u2191(<em>E<\/em><sub>1<\/sub> \u222a &#8230; \u222a <em>E<sub>n<\/sub><\/em>).  (I will let you check that this is indeed a monad by yourself.)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Then we characterize the <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=664\">algebras<\/a> of that monad.  The category <strong>Top<\/strong><sub>0<\/sub><strong><sup>Q<\/sup><\/strong><sub><sup>fin<\/sup><\/sub> of <strong>Q<\/strong><sub>fin<\/sub>-algebras, also known as the Eilenberg-Moore category of the monad, is automatically equipped with an adjunction, which turns <strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>) into the free <strong>Q<\/strong><sub>fin<\/sub>-algebra over the T<sub>0<\/sub> space <em>X<\/em>.  Our question then becomes: are the <strong>Q<\/strong><sub>fin<\/sub>-algebras on <strong>Top<\/strong><sub>0<\/sub> exactly the T<sub>0<\/sub> deflationary topological semilattices?<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">This was studied, among other things, by Andrea Schalk [1].  One can check that every <strong>Q<\/strong><sub>fin<\/sub>-algebra has a canonical structure of deflationary topological semilattice, but not all deflationary topological semilattices give rise to a <strong>Q<\/strong><sub>fin<\/sub>-algebra.  The reasons are the following, and I will explain them below.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Every <strong>Q<\/strong><sub>fin<\/sub>-algebra is a deflationary topological semilattice <em>with small semilattices<\/em>.  (Ah, at last!  We finally meet the small semilattices.  In fact, the <strong>Q<\/strong><sub>fin<\/sub>-algebras are exactly the deflationary topological semilattices with small semilattices.)<\/li>\n\n\n\n<li>There is a deflationary topological semilattice that does not have small semilattices, as shown by Jimmie Lawson [3] (see also [2, Section VI-4]).  This is actually the main thing I would like to explain here; the rest is mostly motivation for this, if you remember what I said in the introduction.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">Of course, I haven&#8217;t said yet what having small semilattices means.  Here we go.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">A <em>subsemilattice<\/em> of a semilattice (<em>L<\/em>, +) is just a subset <em>A<\/em> of <em>L<\/em> that is closed under addition: for all <em>x<\/em>, <em>y<\/em> in <em>A<\/em>, <em>x<\/em>+<em>y<\/em> is in <em>A<\/em>.  A topological semilattice (<em>L<\/em>, +) <em>has small semilattices<\/em> if and only if every point has a neighborhood base consisting of semilattices, namely if and only if:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>for every <em>x<\/em> \u2208 <em>L<\/em>, for every open neighborhood <em>U<\/em> of <em>x<\/em>, there is a subsemilattice <em>A<\/em> of <em>L<\/em> such that <em>x<\/em> \u2208 int(<em>A<\/em>) \u2286 <em>A<\/em> \u2286 <em>U<\/em>.<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Every <strong>Q<\/strong><sub>fin<\/sub>-algebra is canonically a T<sub>0<\/sub> deflationary topological semilattice with small semilattices<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">Let us check the first of our claims: every <strong>Q<\/strong><sub>fin<\/sub>-algebra (on <strong>Top<\/strong><sub>0<\/sub>) is a T<sub>0<\/sub> deflationary topological semilattice with small semilattices.  For that, we need to remember that a <strong>Q<\/strong><sub>fin<\/sub>-algebra (on <strong>Top<\/strong><sub>0<\/sub>) is a T<sub>0<\/sub> topological space <em>L<\/em> together with a so-called <em>structure map<\/em> \u03b1 : <strong>Q<\/strong><sub>fin<\/sub>(<em>L<\/em>) \u2192 <em>L<\/em> such that:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>\u03b1 o \u03b7<em><sub>L<\/sub><\/em> = id<em><sub>L<\/sub><\/em>, namely \u03b1(\u2191<em>x<\/em>)=<em>x<\/em> for every <em>x<\/em> in <em>L<\/em>;<\/li>\n\n\n\n<li>\u03b1 o \u03bc<em><sub>L<\/sub><\/em> = \u03b1 o <strong>Q<\/strong><sub>fin<\/sub>(\u03b1).  The action of the functor <strong>Q<\/strong><sub>fin<\/sub> on morphisms <em>f<\/em> is defined by <strong>Q<\/strong><sub>fin<\/sub>(<em>f<\/em>) : \u2191{<em>x<\/em><sub>1<\/sub>, &#8230;, <em>x<sub>n<\/sub><\/em>} \u21a6 \u2191{<em>f<\/em>(<em>x<\/em><sub>1<\/sub>), &#8230;, <em>f<\/em>(<em>x<sub>n<\/sub><\/em>)}, so we require that \u03b1(\u2191(<em>E<\/em><sub>1<\/sub> \u222a &#8230; \u222a <em>E<sub>n<\/sub><\/em>)) = \u03b1(\u2191{\u03b1(\u2191<em>E<\/em><sub>1<\/sub>), &#8230;, \u03b1(\u2191<em>E<sub>n<\/sub><\/em>)}) for every <em>n<\/em>\u22651 and all finite non-empty sets <em>E<\/em><sub>1<\/sub>, &#8230;, <em>E<sub>n<\/sub><\/em>.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">There is a canonical way of defining a semilattice structure on such a <strong>Q<\/strong><sub>fin<\/sub>-algebra <em>L<\/em>: we let <em>x<\/em>+<em>y<\/em> \u225d \u03b1(\u2191{<em>x<\/em>, <em>y<\/em>}).  Then <em>x<\/em>+<em>x<\/em> = \u03b1(\u2191<em>x<\/em>) = <em>x<\/em>, so + is idempotent.  It is commutative by definition.  In order to show that + is associative, we apply the law \u03b1(\u2191(<em>E<\/em><sub>1<\/sub> \u222a &#8230; \u222a <em>E<sub>n<\/sub><\/em>)) = \u03b1(\u2191{\u03b1(\u2191<em>E<\/em><sub>1<\/sub>), &#8230;, \u03b1(\u2191<em>E<sub>n<\/sub><\/em>)}) to the case <em>n<\/em>\u225d2, <em>E<\/em><sub>1<\/sub>\u225d{<em>x<\/em>, <em>y<\/em>}, <em>E<\/em><sub>2<\/sub>\u225d{<em>z<\/em>}, yielding \u03b1(\u2191{<em>x<\/em>,<em>y<\/em>,<em>z<\/em>}) = (<em>x<\/em>+<em>y<\/em>)+<em>z<\/em>, and to the case <em>n<\/em>\u225d2, <em>E<\/em><sub>1<\/sub>\u225d{<em>x<\/em>}, <em>E<\/em><sub>2<\/sub>\u225d{<em>y<\/em>, <em>z<\/em>}, yielding \u03b1(\u2191{<em>x<\/em>,<em>y<\/em>,<em>z<\/em>}) = <em>x<\/em>+(<em>y<\/em>+<em>z<\/em>).<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">This is a topological semilattice, because + is the composition of \u03b7<em><sub>L<\/sub><\/em> \u00d7 \u03b7<em><sub>L<\/sub><\/em>, of the binary union operation \u222a (which, as we have seen already, is jointly continuous on <strong>Q<\/strong><sub>fin<\/sub>(<em>L<\/em>)), and of \u03b1.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Note that the law \u03b1(\u2191(<em>E<\/em><sub>1<\/sub> \u222a &#8230; \u222a <em>E<sub>n<\/sub><\/em>)) = \u03b1(\u2191{\u03b1(\u2191<em>E<\/em><sub>1<\/sub>), &#8230;, \u03b1(\u2191<em>E<sub>n<\/sub><\/em>)})  can now be interpreted, when <em>n<\/em>=2, as saying that \u03b1 maps unions to sums, namely \u03b1(\u2191<em>E<\/em><sub>1<\/sub> \u222a \u2191<em>E<\/em><sub>2<\/sub>) = \u03b1(\u2191<em>E<\/em><sub>1<\/sub>) + \u03b1(\u2191<em>E<\/em><sub>2<\/sub>).<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Finally, <em>L<\/em> has small semilattices.  Let <em>x<\/em> be any point of <em>L<\/em>, and <em>U<\/em> be any open neighborhood of <em>x<\/em> in <em>L<\/em>.  We have \u03b1(\u2191<em>x<\/em>)=<em>x<\/em>, so \u2191<em>x<\/em> is in the open subset \u03b1<sup>\u20131<\/sup>(<em>U<\/em>) of <strong>Q<\/strong><sub>fin<\/sub>(<em>L<\/em>).  By definition of the upper Vietoris topology, there is an open subset <em>V<\/em> of <em>X<\/em> such that \u2191<em>x<\/em> is in \u2610<em>V<\/em>, and \u2610<em>V<\/em> is included in \u03b1<sup>\u20131<\/sup>(<em>U<\/em>).  Now we notice that:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><em>x<\/em> is in <em>V<\/em>, since \u2191<em>x<\/em> is in \u2610<em>V<\/em>;<\/li>\n\n\n\n<li>\u2610<em>V<\/em> is a sub-semilattice of <strong>Q<\/strong><sub>fin<\/sub>(<em>L<\/em>): the union of any two elements of \u2610<em>V<\/em> is again in \u2610<em>V<\/em>;<\/li>\n\n\n\n<li>the direct image <em>A<\/em> \u225d \u03b1[\u2610<em>V<\/em>] of \u2610<em>V<\/em>  is a sub-semilattice of <em>L<\/em>: indeed, \u2610<em>V<\/em> is closed under binary unions, and \u03b1 maps unions to sums;<\/li>\n\n\n\n<li><em>V<\/em> is included in <em>A<\/em>: for every point <em>y<\/em> of <em>V<\/em>, \u2191<em>y<\/em> is in \u2610<em>V<\/em>, so <em>y<\/em>=\u03b1(\u2191<em>y<\/em>) is in <em>A<\/em>, by definition of <em>A<\/em>;<\/li>\n\n\n\n<li><em>A<\/em> is included in <em>U<\/em>: in other words, \u03b1[\u2610<em>V<\/em>] \u2286 <em>U<\/em>, and that is equivalent to \u2610<em>V<\/em> \u2286 \u03b1<sup>\u20131<\/sup>(<em>U<\/em>), which is by construction.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">In short, <em>x<\/em> \u2208 <em>V<\/em> \u2286 <em>A<\/em> \u2286 <em>U<\/em>.  Therefore <em>L<\/em> has small semilattices, as promised.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Q<\/strong><sub>fin<\/sub>-algebras = T<sub>0<\/sub> deflationary topological semilattices with small semilattices<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">We have proved one half of the equivalence between <strong>Q<\/strong><sub>fin<\/sub>-algebras and T<sub>0<\/sub> deflationary topological semilattices with small semilattices.  In the other direction, let (<em>L<\/em>, +) be a T<sub>0<\/sub> deflationary topological semilattice with small semilattices.  We show that there is a unique <strong>Q<\/strong><sub>fin<\/sub>-algebra structure on <em>L<\/em>, namely a unique structure map \u03b1 : <strong>Q<\/strong><sub>fin<\/sub>(<em>L<\/em>) \u2192 <em>L<\/em> that is compatible with +, in the sense that \u03b1(\u2191{<em>x<\/em>, <em>y<\/em>}) = <em>x<\/em>+<em>y<\/em> for all points <em>x<\/em>, <em>y<\/em> of <em>L<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Well, we do not have much choice: we must define \u03b1(\u2191{<em>x<\/em><sub>1<\/sub>, &#8230;, <em>x<sub>n<\/sub><\/em>}) as the sum <em>x<\/em><sub>1<\/sub>+ &#8230;+<em>x<sub>n<\/sub><\/em>.  Showing that this makes sense makes heavy use of the fact that + is associative, commutative, idempotent, and deflationary.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">There only remains to show that this map \u03b1 is continuous, and this is where we require (<em>L<\/em>, +) to be topological, and to have small semilattices.  Let \u2191{<em>x<\/em><sub>1<\/sub>, &#8230;, <em>x<sub>n<\/sub><\/em>} be mapped by \u03b1 to a point (necessarily <em>x<\/em><sub>1<\/sub>+ &#8230;+<em>x<sub>n<\/sub><\/em>) in some open subset <em>U<\/em> of <em>L<\/em>.  We wish to show that there is an open neighborhood of \u2191{<em>x<\/em><sub>1<\/sub>, &#8230;, <em>x<sub>n<\/sub><\/em>} in <strong>Q<\/strong><sub>fin<\/sub>(<em>L<\/em>)\u2014which we shall take of the form \u2610<em>V<\/em>, with <em>x<\/em><sub>1<\/sub>, &#8230;, <em>x<sub>n<\/sub><\/em> all in the open set <em>V<\/em>\u2014that is mapped by \u03b1 into <em>U<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Here is how we might think of proceeding, hoping to use only joint continuity, not small semilattices.  Since + is jointly continuous, there is a product <em>U<\/em><sub>1<\/sub> \u00d7 &#8230; \u00d7 <em>U<sub>n<\/sub><\/em> of open neighborhoods of <em>x<\/em><sub>1<\/sub>, &#8230;, <em>x<sub>n<\/sub><\/em> respectively, such that every sum of <em>n<\/em> elements, one from <em>U<\/em><sub>1<\/sub>, &#8230;, one from <em>U<sub>n<\/sub><\/em>, lies in <em>U<\/em>.  We might think of defining <em>V<\/em> as some kind of intersection, or of union, or of sum of the open sets <em>U<\/em><sub>1<\/sub>, &#8230;, <em>U<sub>n<\/sub><\/em>, but none of that works, really.  Notably the sum <em>U<\/em><sub>1<\/sub> + &#8230; + <em>U<sub>n<\/sub><\/em>, which we define as the set of sums of <em>n<\/em> elements, one from <em>U<\/em><sub>1<\/sub>, &#8230;, one from <em>U<sub>n<\/sub><\/em>, is not open in general\u2014at least there is no reason why it should be.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Instead, we first use the fact that <em>L<\/em> has small semilattices: there is a sub-semilattice <em>A<\/em> of <em>U<\/em> such that <em>x<\/em><sub>1<\/sub>+ &#8230;+<em>x<sub>n<\/sub><\/em> is in the interior int(<em>A<\/em>) of <em>A<\/em>.  Now (and only now) we use the fact that + is jointly continuous, so there is a product <em>U<\/em><sub>1<\/sub> \u00d7 &#8230; \u00d7 <em>U<sub>n<\/sub><\/em> of open neighborhoods of <em>x<\/em><sub>1<\/sub>, &#8230;, <em>x<sub>n<\/sub><\/em> such that the sum <em>U<\/em><sub>1<\/sub> + &#8230; + <em>U<sub>n<\/sub><\/em> is included in int(<em>A<\/em>).  We define <em>V<\/em> as int(<em>A<\/em>).<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>It is easy to see that \u2191{<em>x<\/em><sub>1<\/sub>, &#8230;, <em>x<sub>n<\/sub><\/em>} is in \u2610<em>V<\/em>, namely that every <em>x<sub>i<\/sub><\/em> is in int(<em>A<\/em>): this is because + is deflationary, so that <em>x<sub>i<\/sub><\/em> \u2265 <em>x<\/em><sub>1<\/sub>+ &#8230;+<em>x<sub>n<\/sub><\/em>, and because <em>x<\/em><sub>1<\/sub>+ &#8230;+<em>x<sub>n<\/sub><\/em> is in the open, hence upwards-closed, set int(<em>A<\/em>).<\/li>\n\n\n\n<li>For every non-empty finitary compact set \u2191{<em>y<\/em><sub>1<\/sub>, &#8230;, <em>y<sub>m<\/sub><\/em>} in \u2610<em>V<\/em>, all the points <em>y<sub>j<\/sub><\/em> are in <em>V<\/em>, hence in <em>A<\/em>, and therefore their sum <em>y<\/em><sub>1<\/sub>+ &#8230;+<em>y<sub>m<\/sub><\/em> is also in <em>A<\/em>, because <em>A<\/em> is a sub-semilattice.  Since <em>A<\/em> is included in <em>U<\/em>, this means that \u03b1 maps \u2610<em>V<\/em> into <em>U<\/em>, and this finishes to show that \u03b1 is continuous.<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">A T<sub>0<\/sub> deflationary topological semilattice that does not have small semilattices<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">At this point, you should be convinced that the notion of having small semilattices arises naturally.  But is that a useful notion?  Namely, if all T<sub>0<\/sub> deflationary topological semilattices had small semilattices, that would be a useless notion.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Be reassured: there <em>is<\/em> a T<sub>0<\/sub> deflationary topological semilattice that does <em>not<\/em> have small semilattices.  Such a counterexample was found by Jimmie Lawson [3].  Well, let me be slightly more precise.  What J. Lawson found was really an example of a compact Hausdorff topological semilattice that does not have small semilattices (and I will come back to that further below), but this can easily be modified to an example of a T<sub>0<\/sub> deflationary topological semilattice that does not have small semilattices.  That is no accident either: this is due to the so-called fundamental theorem of compact semilattices, which I will briefly mention near the end of this post.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Let me describe that counterexample.  In passing, I will also simplify it somehow.  J. Lawson uses a funny divergent series, but I think the functions I will introduce below make the argument slightly less obscure.  Also, his spaces <em>S<sub>i<\/sub><\/em> are defined as certain finite products of {0, 1}, but I think it will be clearer to describe them as powersets.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We will build that counterexample in several steps: we build a very slowly growing function (Fact (i) below), which we use to show that a certain measure of finite sets has the property that the intersection of any two big sets, with respect to that measure, remains big enough (Fact (ii) below), and we will have what it takes to finally define our counterexample<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">A very slowly growing function<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">Let log<sub>2<\/sub> denote base 2 logarithm, so that log<sub>2<\/sub>(2<em><sup>x<\/sup><\/em>)=<em>x<\/em> for every non-negative real number <em>x<\/em>.  This is a slowly growing function, which tends to infinity as its argument tends to infinity.  The map <em>x<\/em> \u21a6 log<sub>2<\/sub> log<sub>2<\/sub> <em>x<\/em> is an even more slowly growing function.  It maps [2, \u221e[ to [0, \u221e[, and also grows to infinity as its argument tends to infinity, but painfully slowly.  Here is a plot of that function:<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full is-resized\"><a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/wp-content\/uploads\/2022\/04\/loglog.png\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/wp-content\/uploads\/2022\/04\/loglog.png\" alt=\"\" class=\"wp-image-4958\" width=\"413\" height=\"263\"\/><\/a><figcaption class=\"wp-element-caption\">The map log<sub>2<\/sub> log<sub>2<\/sub><\/figcaption><\/figure>\n<\/div>\n\n\n<p class=\"wp-block-paragraph\">The point of choosing the log<sub>2<\/sub> log<sub>2<\/sub> function is that it grows so slowly to infinity that the following holds.  That will be crucial to establishing Fact (ii) below, which in turn will be the key to the joint continuity of the semilattice operation.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Fact (i).<\/strong>  For every \u03b5&gt;0, there is a natural number <em>k<\/em><sub>\u03b5<\/sub>\u22652 such that for every <em>k<\/em>\u2265<em>k<\/em><sub>\u03b5<\/sub>, log<sub>2<\/sub> log<sub>2<\/sub> (1+<em>k<\/em>) + \u03b5 &gt; log<sub>2<\/sub> log<sub>2<\/sub> (1+2<em>k<\/em>).<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">Let us check this: the inequality log<sub>2<\/sub> log<sub>2<\/sub> (1+<em>k<\/em>) + \u03b5 &gt; log<sub>2<\/sub> log<sub>2<\/sub> (1+2<em>k<\/em>) is equivalent to log<sub>2<\/sub> (1+<em>k<\/em>).2<sup>\u03b5<\/sup> &gt; log<sub>2<\/sub> (1+2<em>k<\/em>), hence to 2<sup>\u03b5<\/sup> &gt; log<sub>2<\/sub> (1+2<em>k<\/em>)\/log<sub>2<\/sub> (1+<em>k<\/em>).  As <em>k<\/em> tends to infinity, log<sub>2<\/sub> (1+2<em>k<\/em>)\/log<sub>2<\/sub> (1+<em>k<\/em>) ~ 1+ 1\/log<sub>2<\/sub> <em>k<\/em>, which will be smaller than any fixed number &gt;1 (such as 2<sup>\u03b5<\/sup>) for <em>k<\/em> large enough.  If you prefer an explicit definition, I will let you check that defining <em>k<\/em><sub>\u03b5<\/sub> as 2<sup>1\/(2<sup>\u03b5<\/sup>-1)<\/sup> works, as in that case we even have 2<sup>\u03b5<\/sup> &gt; log<sub>2<\/sub> (2+2<em>k<\/em>)\/log<sub>2<\/sub> (1+<em>k<\/em>) (=1\/log<sub>2<\/sub> (1+<em>k<\/em>) + 1) for every <em>k<\/em>\u2265<em>k<\/em><sub>\u03b5<\/sub>.  \u2610<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We now define the finite set <em>N<sub>i<\/sub><\/em> as the set of all positive natural numbers strictly smaller than 2<sup>2<sup><em>i<\/em><\/sup><\/sup>, for every natural number <em>i<\/em>, namely:<br>                       <em>N<sub>i<\/sub><\/em> \u225d {1, &#8230;, 2<sup>2<sup><em>i<\/em><\/sup><\/sup>\u20131}.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Let <em>S<sub>i<\/sub><\/em> be the powerset of <em>N<sub>i<\/sub><\/em>, seen as a dcpo with the inclusion ordering.  Notice that <em>S<sub>i<\/sub><\/em> is an incredibly well-behaved dcpo.  In fact it is a <em>finite<\/em> dcpo, in particular an algebraic dcpo, in which all elements are themselves finite.  It is also a (complete) lattice.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Measuring elements of <em>S<sub>i<\/sub><\/em> in such a way that the intersection of any two big sets remains big enough<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">We define a kind of measure of size of the elements <em>E<\/em> of <em>S<sub>i<\/sub><\/em>, by defining the following extended non-negative real number \u03c3<em><sub>i<\/sub><\/em>(<em>E<\/em>): if <em>E<\/em> is the whole of <em>N<sub>i<\/sub><\/em>, then \u03c3<em><sub>i<\/sub><\/em>(<em>E<\/em>)=\u221e; otherwise, we let:<br>                      \u03c3<em><sub>i<\/sub><\/em>(<em>E<\/em>) \u225d <em>i<\/em>\u2013log<sub>2<\/sub> log<sub>2<\/sub> (2<sup>2<sup><em>i<\/em><\/sup><\/sup>\u2013|<em>E<\/em>|),<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">where |<em>E<\/em>| denotes the cardinality of <em>E<\/em>.  Alternatively, \u03c3<em><sub>i<\/sub><\/em>(<em>E<\/em>) = <em>i<\/em>\u2013log<sub>2<\/sub> log<sub>2<\/sub> (1+|<em>N<sub>i<\/sub>\u2013E<\/em>|).<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Notice that, when <em>E<\/em> is equal to <em>N<sub>i<\/sub><\/em> minus one element, then |<em>N<sub>i<\/sub>\u2013E<\/em>|=1, so \u03c3<em><sub>i<\/sub><\/em>(<em>E<\/em>) =  <em>i<\/em>\u2013log<sub>2<\/sub> log<sub>2<\/sub> 2 = <em>i<\/em>; while if <em>E<\/em> is empty, \u03c3<em><sub>i<\/sub><\/em>(<em>E<\/em>) = <em>i<\/em>\u2013log<sub>2<\/sub> log<sub>2<\/sub> (2<sup>2<sup><em>i<\/em><\/sup><\/sup>) = 0.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">It is clear that \u03c3<em><sub>i<\/sub><\/em> is a monotonic map from <em>S<sub>i<\/sub><\/em> to [0, \u221e], hence a Scott-continuous map (since <em>S<sub>i<\/sub><\/em> is finite!).  In fact, we have the stronger property that if <em>E<\/em> and <em>F<\/em> are any two elements of <em>S<sub>i<\/sub><\/em> such that |<em>E<\/em>| \u2264 |<em>F<\/em>|, then \u03c3<em><sub>i<\/sub><\/em>(<em>E<\/em>) \u2264 \u03c3<em><sub>i<\/sub><\/em>(<em>F<\/em>).<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Here is a plot of \u03c3<em><sub>i<\/sub><\/em>(<em>E<\/em>) as a function of |<em>E<\/em>| when <em>i<\/em>=3, growing from \u03c3<sub>3<\/sub>(\u2205)=0 to \u03c3<sub>3<\/sub>(<em>E<\/em>)=3 when |<em>E<\/em>|=254.  (The value \u03c3<sub>3<\/sub>(<em>E<\/em>)=\u221e when |<em>E<\/em>|=255, namely when <em>E<\/em>=<em>N<\/em><sub>3<\/sub>, is not shown.)<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full is-resized\"><a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/wp-content\/uploads\/2022\/04\/sigma3.png\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/wp-content\/uploads\/2022\/04\/sigma3.png\" alt=\"\" class=\"wp-image-4963\" width=\"413\" height=\"263\"\/><\/a><\/figure>\n<\/div>\n\n\n<p class=\"wp-block-paragraph\">They key property of the maps \u03c3<em><sub>i<\/sub><\/em> is the following.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Fact (ii).<\/strong>  For all real numbers \u03c4 &gt; \u03b5 &gt; 0, there is a natural number <em>i<\/em><sub>\u03c4,\u03b5<\/sub> such that for every <em>i<\/em>\u2265<em>i<\/em><sub>\u03c4,\u03b5<\/sub>, for all elements <em>E<\/em> and <em>F<\/em> of <em>S<sub>i<\/sub><\/em> such that \u03c3<em><sub>i<\/sub><\/em>(<em>E<\/em>) &gt; \u03c4 and \u03c3<em><sub>i<\/sub><\/em>(<em>F<\/em>) &gt; \u03c4, we have \u03c3<em><sub>i<\/sub><\/em>(<em>E<\/em> \u2229 <em>F<\/em>) &gt; \u03c4\u2013\u03b5.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">In other words, the intersection of any two &#8220;big&#8221; subsets of <em>S<sub>i<\/sub><\/em> (as measured through the function \u03c3<em><sub>i<\/sub><\/em>) will remain &#8220;big&#8221;, up to some small \u03b5, and this for every index <em>i<\/em> that is large enough.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Let us verify Fact (ii).  Not that I would want to spoil the surprise, but we will define <em>i<\/em><sub>\u03c4,\u03b5<\/sub> as \u03c4 + log<sub>2<\/sub> log<sub>2<\/sub> (1+2<em><em>k<\/em><sub>\u03b5<\/sub><\/em>), where <em>k<\/em><sub>\u03b5<\/sub> was introduced in Fact (i).  If <em>E<\/em> is equal to the whole of <em>N<sub>i<\/sub><\/em>, then <em>E<\/em> \u2229 <em>F<\/em> = <em>F<\/em>, and Fact (ii) is trivial; similarly if <em>F<\/em>=<em>N<sub>i<\/sub><\/em>.  Hence we will assume that |<em>N<sub>i<\/sub><\/em>\u2013<em>E<\/em>|\u22651 and |<em>N<sub>i<\/sub><\/em>\u2013<em>F<\/em>|\u22651.  We also reason by contradiction, and we assume that \u03c3<em><sub>i<\/sub><\/em>(<em>E<\/em> \u2229 <em>F<\/em>) \u2264 \u03c4\u2013\u03b5 for some <em>i<\/em>\u2265<em>i<\/em><sub>\u03c4,\u03b5<\/sub>.  This means that <em>i<\/em> \u2013 log<sub>2<\/sub> log<sub>2<\/sub> (1+|<em>N<sub>i<\/sub><\/em>\u2013(<em><em>E<\/em><\/em> \u2229 <em><em>F<\/em><\/em>)|) \u2264 \u03c4\u2013\u03b5.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We have |<em>N<sub>i<\/sub><\/em>\u2013(<em><em>E<\/em><\/em> \u2229 <em><em>F<\/em><\/em>)| = |(<em>N<sub>i<\/sub><\/em>\u2013<em><em>E<\/em><\/em>) \u222a (<em>N<sub>i<\/sub><\/em>\u2013<em><em>F<\/em><\/em>)| \u2264 |<em>N<sub>i<\/sub><\/em>\u2013<em><em>E<\/em><\/em>| + |<em>N<sub>i<\/sub><\/em>\u2013<em><em>F<\/em><\/em>| \u2264 2<em>k<\/em>, where <em>k<\/em> \u225d max (|<em>N<sub>i<\/sub><\/em>\u2013<em><em>E<\/em><\/em>|, |<em>N<sub>i<\/sub><\/em>\u2013<em><em>F<\/em><\/em>|).  Therefore  \u03c4\u2013\u03b5 \u2265 <em>i<\/em> \u2013 log<sub>2<\/sub> log<sub>2<\/sub> (1+|<em>N<sub>i<\/sub><\/em>\u2013(<em><em>E<\/em><\/em> \u2229 <em><em>F<\/em><\/em>)|) \u2265 <em>i<\/em> \u2013 log<sub>2<\/sub> log<sub>2<\/sub> (1+2<em>k<\/em>).  Since <em>i <\/em>\u2265 <em>i<\/em><sub>\u03c4,\u03b5<\/sub> = \u03c4 + log<sub>2<\/sub> log<sub>2<\/sub> (1+2<em><em>k<\/em><sub>\u03b5<\/sub><\/em>), it follows that \u03c4\u2013\u03b5 \u2265 \u03c4 + log<sub>2<\/sub> log<sub>2<\/sub> (1+2<em><em>k<\/em><sub>\u03b5<\/sub><\/em>) \u2013 log<sub>2<\/sub> log<sub>2<\/sub> (1+2<em>k<\/em>), namely that log<sub>2<\/sub> log<sub>2<\/sub> (1+2<em>k<\/em>) \u2265 log<sub>2<\/sub> log<sub>2<\/sub> (1+2<em><em>k<\/em><sub>\u03b5<\/sub><\/em>) + \u03b5.  In particular, <em>k<\/em>\u2265<em><em>k<\/em><sub>\u03b5<\/sub><\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">This enables us to use Fact (i): so log<sub>2<\/sub> log<sub>2<\/sub> (1+<em>k<\/em>) + \u03b5 &gt; log<sub>2<\/sub> log<sub>2<\/sub> (1+2<em>k<\/em>).  Recalling that |<em>N<sub>i<\/sub><\/em>\u2013(<em><em>E<\/em><\/em> \u2229 <em><em>F<\/em><\/em>)| \u2264 2<em>k<\/em>, it follows that \u03c3<em><sub>i<\/sub><\/em>(<em>E<\/em> \u2229 <em>F<\/em>) = <em>i<\/em> \u2013 log<sub>2<\/sub> log<sub>2<\/sub> (1+|<em>N<sub>i<\/sub><\/em>\u2013(<em><em>E<\/em><\/em> \u2229 <em><em>F<\/em><\/em>)|) \u2265 <em>i<\/em> \u2013 log<sub>2<\/sub> log<sub>2<\/sub> (1+2<em>k<\/em>), so \u03c3<em><sub>i<\/sub><\/em>(<em>E<\/em> \u2229 <em>F<\/em>) &gt; <em>i<\/em> \u2013 log<sub>2<\/sub> log<sub>2<\/sub> (1+<em>k<\/em>) \u2013 \u03b5.  Now <em>k<\/em> = max (|<em>N<sub>i<\/sub><\/em>\u2013<em><em>E<\/em><\/em>|, |<em>N<sub>i<\/sub><\/em>\u2013<em><em>F<\/em><\/em>|), so <em>k<\/em> is equal to |<em>N<sub>i<\/sub><\/em>\u2013<em><em>E<\/em><\/em>| or to |<em>N<sub>i<\/sub><\/em>\u2013<em><em>F<\/em><\/em>|.  Let us assume that <em>k<\/em>=|<em>N<sub>i<\/sub><\/em>\u2013<em><em>E<\/em><\/em>|.  We have just shown that \u03c3<em><sub>i<\/sub><\/em>(<em>E<\/em> \u2229 <em>F<\/em>) &gt; <em>i<\/em> \u2013 log<sub>2<\/sub> log<sub>2<\/sub> (1+<em>|<em>N<sub>i<\/sub><\/em>\u2013<em><em>E<\/em><\/em>|<\/em>) \u2013 \u03b5 = \u03c3<em><sub>i<\/sub><\/em>(<em>E<\/em>) \u2013 \u03b5 &gt; \u03c4 \u2013 \u03b5, which is impossible.  The case where <em>k<\/em>=|<em>N<sub>i<\/sub><\/em>\u2013<em><em>F<\/em><\/em>| is symmetric.  \u2610<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Building the counterexample <em>L<\/em><\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">We will build our counterexample <em>L<\/em> as a subspace of the following nice space <em>K<\/em>: <em>K<\/em> is the product of [0, \u221e] (with its Scott topology) with <em>S<\/em><sub>0<\/sub>, <em>S<\/em><sub>1<\/sub>, &#8230;, and so on.  Recall that <em>S<sub>i<\/sub><\/em> is the powerset of <em>N<sub>i<\/sub><\/em>, also in its Scott topology, and that <em>N<sub>i<\/sub><\/em>={1, &#8230;, 2<sup>2<sup><em>i<\/em><\/sup><\/sup>\u20131}.  <em>K<\/em> is a product of continuous dcpos, all of which have a least element, so <em>K<\/em> is itself a continuous dcpo, and the Scott topology on <em>K<\/em> is also the product topology of the Scott topologies on [0, \u221e], <em>S<\/em><sub>0<\/sub>, <em>S<\/em><sub>1<\/sub>, &#8230;  (see Proposition 5.1.56 in the <a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\"><a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a><\/a>.)  <em>K<\/em> is also a complete lattice, in which suprema and infima are computed componentwise.  This is a space with very nice properties.<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full is-resized\"><a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/wp-content\/uploads\/2022\/04\/lawson-K.png\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/wp-content\/uploads\/2022\/04\/lawson-K.png\" alt=\"\" class=\"wp-image-4972\" width=\"511\" height=\"257\"\/><\/a><figcaption class=\"wp-element-caption\">The continuous complete lattice <em>K<\/em><\/figcaption><\/figure>\n<\/div>\n\n\n<p class=\"wp-block-paragraph\">We define <em>L<\/em> as the subspace of <em>K<\/em> consisting of those tuples (<em>s<\/em>, <em>A<\/em><sub>0<\/sub>, <em>A<\/em><sub>1<\/sub>, &#8230;) such that <em>s<\/em>\u2264\u03c3<em><sub>i<\/sub><\/em>(<em><em>A<\/em><sub>i<\/sub><\/em>) for every <em>i<\/em>\u22650.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Please mind the fact that the topology of <em>L<\/em> is the subspace topology, not the Scott topology of the componentwise ordering.<br>In order to understand what the points of <em>L<\/em> are, let me suggest the following explanation.  (Please refer to the picture below.)  In order to choose a point in <em>L<\/em>, one way is to pick an arbitrary element <em>A<\/em><sub>0<\/sub> of <em>S<\/em><sub>0<\/sub>, an arbitrary element <em>A<\/em><sub>1<\/sub> of <em>S<\/em><sub>1<\/sub>, and so on; then we pick <em>s<\/em> \u2208 [0, \u221e] in such a way that <em>s<\/em>\u2264\u03c3<sub>0<\/sub>(<em><em>A<\/em><\/em><sub>0<\/sub>), <em>s<\/em>\u2264\u03c3<sub>1<\/sub>(<em><em>A<\/em><\/em><sub>1<\/sub>), etc.  In the example below, I have chosen <em>A<\/em><sub>0<\/sub> as the top element {1} of <em>S<\/em><sub>0<\/sub>, and the associated constraint <em>s<\/em>\u2264\u03c3<sub>0<\/sub>(<em><em>A<\/em><\/em><sub>0<\/sub>) is vacuous (equivalent to <em>s<\/em>\u2264\u221e).  I have then chosen <em>A<\/em><sub>1<\/sub> as {1, 3} in <em>S<\/em><sub>1<\/sub>; then \u03c3<sub>1<\/sub>(<em><em>A<\/em><\/em><sub>1<\/sub>)=1, so that forces <em>s<\/em>\u22641.  Next, I have chosen <em><em>A<\/em><\/em><sub>2<\/sub> as {1,3,4,6,7} in <em><em>S<\/em><\/em><sub>2<\/sub>; then \u03c3<sub>2<\/sub>(<em><em>A<\/em><\/em><sub>2<\/sub>) is roughly 0.21, and <em>s<\/em> has to be at most that.  And so on, and so forth.<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full is-resized\"><a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/wp-content\/uploads\/2022\/04\/lawson-L.png\"><img loading=\"lazy\" decoding=\"async\" src=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/wp-content\/uploads\/2022\/04\/lawson-L.png\" alt=\"\" class=\"wp-image-4975\" width=\"495\" height=\"256\"\/><\/a><\/figure>\n<\/div>\n\n\n<p class=\"wp-block-paragraph\">The specialization ordering of <em>K<\/em> is componentwise: (<em>s<\/em>, <em>A<\/em><sub>0<\/sub>, <em>A<\/em><sub>1<\/sub>, &#8230;) \u2264 (<em>t<\/em>, <em>B<\/em><sub>0<\/sub>, <em>B<\/em><sub>1<\/sub>, &#8230;) if and only if <em>s<\/em>\u2264<em>t<\/em>, <em>A<\/em><sub>0<\/sub>\u2286<em>B<\/em><sub>0<\/sub>, <em>A<\/em><sub>1<\/sub>\u2286<em>B<\/em><sub>1<\/sub>, etc.  Therefore the specialization ordering of <em>L<\/em> is also componentwise, and I will write \u2264 for it.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Let me observe that, with that ordering, <em>L<\/em> is an inf-semilattice.  The infimum (<em>s<\/em>, <em>A<\/em><sub>0<\/sub>, <em>A<\/em><sub>1<\/sub>, &#8230;) \u22c0 (<em>t<\/em>, <em>B<\/em><sub>0<\/sub>, <em>B<\/em><sub>1<\/sub>, &#8230;) is (<em>u<\/em>, <em>C<\/em><sub>0<\/sub>, <em>C<\/em><sub>1<\/sub>, &#8230;) where:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><em>C<\/em><sub><em>i<\/em><\/sub> \u225d <em>A<\/em><sub><em>i<\/em><\/sub> \u2229 <em>B<\/em><sub><em>i<\/em><\/sub> for every <em>i<\/em>\u22650;<\/li>\n\n\n\n<li><em>u<\/em> \u225d min(<em>s<\/em>, <em>t<\/em>, inf<sub><em>i<\/em>\u22650<\/sub> \u03c3<em><sub>i<\/sub><\/em>(<em><em>C<\/em><sub>i<\/sub><\/em>)).<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">The term inf<sub><em>i<\/em>\u22650<\/sub> \u03c3<em><sub>i<\/sub><\/em>(<em><em>C<\/em><sub>i<\/sub><\/em>) in the definition of <em>u<\/em> is, of course, due to the fact that we require <em>u<\/em> to be smaller than or equal to every \u03c3<em><sub>i<\/sub><\/em>(<em><em>C<\/em><sub>i<\/sub><\/em>), if (<em>u<\/em>, <em>C<\/em><sub>0<\/sub>, <em>C<\/em><sub>1<\/sub>, &#8230;) is to be an element of <em>L<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">With that operation, it is clear that (<em>L<\/em>, \u22c0) is a deflationary semilattice, and we must show that it is a <em>topological<\/em> semilattice, namely that \u22c0 is jointly continuous from <em>L<\/em> \u00d7 <em>L<\/em> to <em>L<\/em>.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">The \u22c0 operation is jointly continuous on <em>L<\/em><\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">In order to show this, we realize that a base of the topology of <em>K<\/em> is given by sets of the form <em>U<\/em> \u00d7 \u2191<em>E<\/em><sub>0<\/sub>  \u00d7 \u2191<em>E<\/em><sub>1<\/sub>  \u00d7 &#8230;  \u00d7 \u2191<em>E<\/em><sub><em>n<\/em><\/sub>  \u00d7 \u03a0<sub><em>i<\/em>&gt;<em>n<\/em><\/sub> <em>S<\/em><sub><em>i<\/em><\/sub> where <em>U<\/em> is Scott-open in [0, \u221e] (hence equal to the whole of [0, \u221e] or of the form ]<em>r<\/em>, \u221e] for some <em>r<\/em>&gt;0), <em>n<\/em>\u22650, and each <em>E<\/em><sub><em>i<\/em><\/sub> is a (necessarily finite) subset of <em>S<\/em><sub><em>i<\/em><\/sub> for each <em>i<\/em>, 0\u2264<em>i<\/em>\u2264<em>n<\/em>.  Hence a base of the topology of <em>L<\/em> is given by the corresponding sets <em>L<\/em> \u2229 (<em>U<\/em> \u00d7 \u2191<em>E<\/em><sub>0<\/sub>  \u00d7 \u2191<em>E<\/em><sub>1<\/sub>  \u00d7 &#8230;  \u00d7 \u2191<em>E<\/em><sub><em>n<\/em><\/sub>  \u00d7 \u03a0<sub><em>i<\/em>&gt;<em>n<\/em><\/sub> <em>S<\/em><sub><em>i<\/em><\/sub>).<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Let therefore (<em>s<\/em>, <em>A<\/em><sub>0<\/sub>, <em>A<\/em><sub>1<\/sub>, &#8230;) and (<em>t<\/em>, <em>B<\/em><sub>0<\/sub>, <em>B<\/em><sub>1<\/sub>, &#8230;) be two points of <em>L<\/em>, whose infimum (<em>u<\/em>, <em>C<\/em><sub>0<\/sub>, <em>C<\/em><sub>1<\/sub>, &#8230;), given as above, lies in some basic open set <em>W<\/em> \u225d <em>L<\/em> \u2229 (<em>U<\/em> \u00d7 \u2191<em>E<\/em><sub>0<\/sub>  \u00d7 \u2191<em>E<\/em><sub>1<\/sub>  \u00d7 &#8230;  \u00d7 \u2191<em>E<\/em><sub><em>n<\/em><\/sub>  \u00d7 \u03a0<sub><em>i<\/em>&gt;<em>n<\/em><\/sub> <em>S<\/em><sub><em>i<\/em><\/sub>).  We wish to find an open rectangle around the pair of points (<em>s<\/em>, <em>A<\/em><sub>0<\/sub>, <em>A<\/em><sub>1<\/sub>, &#8230;) and (<em>t<\/em>, <em>B<\/em><sub>0<\/sub>, <em>B<\/em><sub>1<\/sub>, &#8230;), and which would be mapped into <em>W<\/em> by \u22c0.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>If <em>U<\/em> = [0, \u221e], this is easy: we simply take <em>W<\/em> \u00d7 <em>W<\/em> for that open rectangle.  We do not need to care about the first components, which will always fall inside <em>U<\/em>; for every <em>i<\/em>\u22650 with <em>i<\/em>\u2264<em>n<\/em>, <em>C<\/em><sub><em>i<\/em><\/sub> contains <em>E<\/em><sub><em>i<\/em><\/sub>, so both <em>A<\/em><sub><em>i<\/em><\/sub> and <em>B<\/em><sub><em>i<\/em><\/sub> contain <em>E<\/em><sub><em>i<\/em><\/sub> (since <em>C<\/em><sub><em>i<\/em><\/sub> = <em>A<\/em><sub><em>i<\/em><\/sub> \u2229 <em>B<\/em><sub><em>i<\/em><\/sub>), and conversely, the intersection of any two sets that both contain <em>E<\/em><sub><em>i<\/em><\/sub> still contains <em>E<\/em><sub><em>i<\/em><\/sub>.<\/li>\n\n\n\n<li>We now examine the case where <em>U<\/em> is equal to ]<em>r<\/em>, \u221e] for some <em>r<\/em>>0.  Our assumption that (<em>u<\/em>, <em>C<\/em><sub>0<\/sub>, <em>C<\/em><sub>1<\/sub>, &#8230;) is in <em>W<\/em> can be rephrased as, first:<br>              (a) for every <em>i<\/em> with 0\u2264<em>i<\/em>\u2264<em>n<\/em>, <em>A<\/em><sub><em>i<\/em><\/sub> and <em>B<\/em><sub><em>i<\/em><\/sub> contain <em>E<\/em><sub><em>i<\/em><\/sub>.<br>Second, <em>u<\/em> = min(<em>s<\/em>, <em>t<\/em>, inf<sub><em>i<\/em>\u22650<\/sub> \u03c3<em><sub>i<\/sub><\/em>(<em><em>C<\/em><sub>i<\/sub><\/em>)) > <em>r<\/em>, which means that there is a positive number \u03c4 such that <em>r<\/em> < \u03c4 < min(<em>s<\/em>, <em>t<\/em>, inf<sub><em>i<\/em>\u22650<\/sub> \u03c3<em><sub>i<\/sub><\/em>(<em><em>C<\/em><sub>i<\/sub><\/em>)), or explicitly:<br>              (b) <em>r<\/em><\u03c4    (c) \u03c4<<em>s<\/em>,<em>t<\/em>     (d) for every <em>i<\/em>\u22650, \u03c4<\u03c3<em><sub>i<\/sub><\/em>(<em>A<\/em><sub><em>i<\/em><\/sub> \u2229 <em>B<\/em><sub><em>i<\/em><\/sub>).<br>Let \u03b5>0 be such that <em>r<\/em> < \u03c4\u2013\u03b5 (thanks to (b)).  Considering the number <em>i<\/em><sub>\u03c4,\u03b5<\/sub> obtained in Fact (ii), we let <em>m<\/em> \u225d max(<em>n<\/em>, <em>i<\/em><sub>\u03c4,\u03b5<\/sub>).  The desired open rectangle is the product of <em>V<\/em><sub>1<\/sub> \u225d <em>L<\/em> \u2229 (]\u03c4, \u221e] \u00d7 \u2191<em>A<\/em><sub>0<\/sub> \u00d7 \u2191<em>A<\/em><sub>1<\/sub> \u00d7 &#8230; \u00d7 \u2191<em>A<\/em><sub><em>m<\/em><\/sub> \u00d7 \u03a0<sub><em>i<\/em>&gt;<em>m<\/em><\/sub><em>S<\/em><sub><em>i<\/em><\/sub>) and of <em><em>V<\/em><\/em><sub>2<\/sub> \u225d <em>L<\/em> \u2229 (]\u03c4, \u221e] \u00d7 \u2191<em>B<\/em><sub>0<\/sub> \u00d7 \u2191<em>B<\/em><sub>1<\/sub> \u00d7 &#8230; \u00d7 \u2191<em>B<\/em><sub><em>m<\/em><\/sub> \u00d7 \u03a0<sub><em>i<\/em>&gt;<em>m<\/em><\/sub><em>S<\/em><sub><em>i<\/em><\/sub>).  It is clear that (<em>s<\/em>, <em>A<\/em><sub>0<\/sub>, <em>A<\/em><sub>1<\/sub>, &#8230;) is in <em><em>V<\/em><\/em><sub>1<\/sub> and that (<em>t<\/em>, <em>B<\/em><sub>0<\/sub>, <em>B<\/em><sub>1<\/sub>, &#8230;) is in <em><em>V<\/em><\/em><sub>2<\/sub>, using (b).  It remains to verify that for every pair of points (<em>s<\/em>&#8216;, <em>A<\/em>&#8216;<sub>0<\/sub>, <em>A<\/em>&#8216;<sub>1<\/sub>, &#8230;) in <em><em>V<\/em><\/em><sub>1<\/sub> and (<em>t<\/em>&#8216;, <em>B<\/em>&#8216;<sub>0<\/sub>, <em>B<\/em>&#8216;<sub>1<\/sub>, &#8230;) in <em><em>V<\/em><\/em><sub>2<\/sub>, their infimum (<em>u<\/em>&#8216;, <em>C<\/em>&#8216;<sub>0<\/sub>, <em>C<\/em>&#8216;<sub>1<\/sub>, &#8230;) is in <em>W<\/em>.<br>By definition, <em>C<\/em>&#8216;<sub><em>i<\/em><\/sub> = <em>A<\/em>&#8216;<sub><em>i<\/em><\/sub> \u2229 <em>B<\/em>&#8216;<sub><em>i<\/em><\/sub> for every <em>i<\/em>\u22650, and <em>u<\/em>&#8216; \u225d min(<em>s<\/em>&#8216;, <em>t<\/em>&#8216;, inf<sub><em>i<\/em>\u22650<\/sub> \u03c3<em><sub>i<\/sub><\/em>(<em><em>C<\/em><\/em>&#8216;<em><sub>i<\/sub><\/em>)).  We have:\n\n<ul class=\"wp-block-list\">\n\n<li>for every <em>i<\/em>\u22650, <em>A<\/em>&#8216;<sub><em>i<\/em><\/sub> contains <em>A<\/em><sub><em>i<\/em><\/sub>, <em>B<\/em>&#8216;<sub><em>i<\/em><\/sub> contains <em>B<\/em><sub><em>i<\/em><\/sub>, so <em>C<\/em>&#8216;<sub><em>i<\/em><\/sub> = <em>A<\/em>&#8216;<sub><em>i<\/em><\/sub> \u2229 <em>B<\/em>&#8216;<sub><em>i<\/em><\/sub> contains <em><em><em>A<\/em><sub><em>i<\/em><\/sub><\/em><\/em> \u2229 <em><em><em>B<\/em><sub><em>i<\/em><\/sub><\/em><\/em>, which contains <em>E<\/em><sub><em>i<\/em><\/sub> by (a);<\/li>\n\n\n<li><em>s&#8217;<\/em>&gt;\u03c4 and <em>t&#8217;<\/em>&gt;\u03c4; for every <em>i<\/em>\u22650, either <em>i<\/em>\u2264<em>m<\/em>, and then \u03c3<em><sub>i<\/sub><\/em>(<em><em>C<\/em><\/em>&#8216;<em><sub>i<\/sub><\/em>) \u2265 \u03c3<em><sub>i<\/sub><\/em>(<em><em><em>A<\/em><sub><em>i<\/em><\/sub><\/em><\/em> \u2229 <em><em><em>B<\/em><sub><em>i<\/em><\/sub><\/em><\/em>) (since \u03c3<em><sub>i<\/sub><\/em> is monotonic) &gt; \u03c4 by (d); or <em>i<\/em>&gt;<em>m<\/em>, in particular <em>i<\/em>\u2265<em>i<\/em><sub>\u03c4,\u03b5<\/sub>, so by Fact (ii) (this is the whole point of the construction!), and using the fact that \u03c4&lt;\u03c3<em><sub>i<\/sub><\/em>(<em>A<\/em><sub><em>i<\/em><\/sub> \u2229 <em>B<\/em><sub><em>i<\/em><\/sub>)\u2264\u03c3<em><sub>i<\/sub><\/em>(<em><em><em>A<\/em><sub><em>i<\/em><\/sub><\/em><\/em>),\u03c3<em><sub>i<\/sub><\/em>(<em><em><em>B<\/em><sub><em>i<\/em><\/sub><\/em><\/em>), we obtain that \u03c3<em><sub>i<\/sub><\/em>(<em><em><em>A<\/em><sub><em>i<\/em><\/sub><\/em><\/em> \u2229 <em><em><em>B<\/em><sub><em>i<\/em><\/sub><\/em><\/em>)&gt;\u03c4\u2013\u03b5.  Putting all those inequalities together, <em>u<\/em>&#8216; = min(<em>s<\/em>&#8216;, <em>t<\/em>&#8216;, inf<sub><em>i<\/em>\u22650<\/sub> \u03c3<em><sub>i<\/sub><\/em>(<em><em>C<\/em><\/em>&#8216;<em><sub>i<\/sub><\/em>)) &gt; min(\u03c4, \u03c4\u2013\u03b5) = \u03c4\u2013\u03b5 &gt; <em>r<\/em>.  And we are done!<\/li>\n\n<\/ul>\n\n<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">This finishes the proof of:<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Lemma.<\/strong>  (<em>L<\/em>, \u22c0) is a deflationary topological semilattice.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><em>L<\/em> is also T<sub>0<\/sub>.  In fact, with some extra effort, one can show that <em>L<\/em> is stably compact.  (Hint: <em>K<\/em> is a product of stably compact spaces, hence is itself stably compact.  Then <em>L<\/em> is a patch-closed subset of <em>K<\/em>, owing to the fact that each of the maps \u03c3<em><sub>i<\/sub><\/em> is patch-continuous&#8230; for the trivial reason that the patch topology on each <em>S<\/em><sub><em>i<\/em><\/sub> is the discrete topology.)  Also, one can show that <em>L<\/em> is not just an inf-semilattice, but in fact a complete lattice.  (Beware, though, that its topology is most likely not the Scott topology.  I have thought about it, and while I have no proof of it, I doubt that the topology would be the Scott topology.)<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">No small semilattices for <em>L<\/em><\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">Despite this niceness, we have:<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Lemma.<\/strong>  (<em>L<\/em>, \u22c0) does not have small semilattices.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><em>Proof.<\/em>  Let us consider any sub-semilattice <em>A<\/em> of (<em>L<\/em>, \u22c0) whose interior contains the top element \u22a4 \u225d (\u221e, <em>N<\/em><sub>0<\/sub>,  <em>N<\/em><sub>1<\/sub>, &#8230;).  That interior contains a basic open subset <em>W<\/em> \u225d <em>L<\/em> \u2229 (<em>U<\/em> \u00d7 \u2191<em>E<\/em><sub>0<\/sub>  \u00d7 \u2191<em>E<\/em><sub>1<\/sub>  \u00d7 &#8230;  \u00d7 \u2191<em>E<\/em><sub><em>n<\/em><\/sub>  \u00d7 \u03a0<sub><em>i<\/em>&gt;<em>n<\/em><\/sub> <em>S<\/em><sub><em>i<\/em><\/sub>), for some Scott-open subset of [0, \u221e], etc.  For every <em>k<\/em> \u2208 <em>N<\/em><sub><em>n<\/em>+1<\/sub>, let <em>z<sub>k<\/sub><\/em> be the point (\u221e, <em>N<\/em><sub>0<\/sub>,  <em>N<\/em><sub>1<\/sub>, &#8230;, <em>N<\/em><sub><em>n<\/em><\/sub>, <em>N<\/em><sub><em>n<\/em>+1<\/sub>\u2013{<em>k<\/em>}, <em>N<\/em><sub><em>n<\/em>+2<\/sub>, &#8230;); namely it differs from the top element only at coordinate <em>n<\/em>+1, where we remove the single number <em>k<\/em>.  The point <em>z<sub>k<\/sub><\/em> is in <em>W<\/em>.  Moreover, since <em>N<\/em><sub><em>n<\/em>+1<\/sub> is finite (that is crucial!), the sum (=infimum) of all the points <em>z<sub>k<\/sub><\/em>, <em>k<\/em> \u2208 <em>N<\/em><sub><em>n<\/em>+1<\/sub>, is a finite sum.  Since all the points <em>z<sub>k<\/sub><\/em> are in <em>W<\/em>, hence in <em>A<\/em>, that sum is also in <em>A<\/em>.  Let us write (<em>s<\/em>, <em>A<\/em><sub>0<\/sub>, <em>A<\/em><sub>1<\/sub>, &#8230;) for that sum.  We see that <em>A<sub>i<\/sub><\/em>=<em>N<sub>i<\/sub><\/em> for every <em>i<\/em>\u2260<em>n<\/em>+1, but that does not matter.  What does matter is that <em>A<\/em><sub><em>n<\/em>+1<\/sub> is the intersection of the sets <em>N<\/em><sub><em>n<\/em>+1<\/sub>\u2013{<em>k<\/em>} when <em>k<\/em> ranges over <em>N<\/em><sub><em>n<\/em>+1<\/sub>, hence is empty.  It follows that <em>s<\/em>\u2264<em>\u03c3<em><sub>n<\/sub><\/em><\/em><sub>+1<\/sub>(\u2205), namely that <em>s<\/em>=0.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Hence we have just proved that any sub-semilattice <em>A<\/em> whose interior contains \u22a4 must contain an element (<em>s<\/em>, <em>A<\/em><sub>0<\/sub>, <em>A<\/em><sub>1<\/sub>, &#8230;) such that <em>s<\/em>=0.  It follows that no basic open subset of the form <em>L<\/em> \u2229 (]<em>r<\/em>, \u221e] \u00d7 \u2191<em>E<\/em><sub>0<\/sub>  \u00d7 \u2191<em>E<\/em><sub>1<\/sub>  \u00d7 &#8230;  \u00d7 \u2191<em>E<\/em><sub><em>n<\/em><\/sub>  \u00d7 \u03a0<sub><em>i<\/em>&gt;<em>n<\/em><\/sub> <em>S<\/em><sub><em>i<\/em><\/sub>) with <em>r<\/em>&gt;0 can contain any sub-semilattice <em>A<\/em> that would be a neighborhood of \u22a4.  Hence (<em>L<\/em>, \u22c0) does not have small semilattices.  \u2610<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">As a consequence, (<em>L<\/em>, \u22c0) cannot be equipped with the structure of a <strong>Q<\/strong><sub>fin<\/sub>-algebra.  Let us (re)explain why.  If there were a structure map \u03b1 : <strong>Q<\/strong><sub>fin<\/sub>(<em>L<\/em>) \u2192 <em>L<\/em> of a <strong>Q<\/strong><sub>fin<\/sub>-algebra, \u03b1 would have to map every non-empty finitary compact subset \u2191{<em>z<\/em><sub>1<\/sub>, &#8230;, <em>z<sub>n<\/sub><\/em>} of <em>L<\/em> to the sum, namely to the infimum <em>z<\/em><sub>1<\/sub> \u22c0 &#8230; \u22c0 <em>z<sub>n<\/sub><\/em>.  But that map is <em>not<\/em> continuous (despite the fact that binary infimum \u22c0 <em>is<\/em> continuous).  Explicitly, if \u03b1 were continuous, then the inverse image of the open set <em>L<\/em> \u2229 (]<em>r<\/em>, \u221e] \u00d7 \u03a0<sub><em>i<\/em>\u22650<\/sub> <em>S<\/em><sub><em>i<\/em><\/sub>) would be an open neighborhood of \u2191{\u22a4}.  Hence it would contain an open subset of the form \u2610<em>W<\/em>, for some open neighborhood <em>W<\/em> of \u22a4 in <em>L<\/em>.  Taking <em>z<sub>k<\/sub><\/em> as in the proof of the Lemma above, which are all in <em>W<\/em>, \u2191{<em>z<\/em><sub>1<\/sub>, &#8230;, <em>z<sub>n<\/sub><\/em>} would be in \u2610<em>W<\/em> hence in \u03b1<sup>\u20131<\/sup>(<em>L<\/em> \u2229 (]<em>r<\/em>, \u221e] \u00d7 \u03a0<sub><em>i<\/em>\u22650<\/sub> <em>S<\/em><sub><em>i<\/em><\/sub>)); but \u03b1(\u2191{<em>z<\/em><sub>1<\/sub>, &#8230;, <em>z<sub>n<\/sub><\/em>}) = <em>z<\/em><sub>1<\/sub> \u22c0 &#8230; \u22c0 <em>z<sub>n<\/sub><\/em> is of the form (<em>s<\/em>, <em>A<\/em><sub>0<\/sub>, <em>A<\/em><sub>1<\/sub>, &#8230;) where <em>s<\/em>=0, which is impossible.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Lawson&#8217;s counterexample<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">The stably compact, deflationary topological semilattice (<em>L<\/em>, \u22c0) is, in fact, not Lawson&#8217;s counterexample [3], but it is not far away!<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Jimmie Lawson had proposed his counterexample in order to answer a conjecture of Dyer and Shields in the negative.  I will refer you to [3] for that aspect of things.  It is obtained as a Rees quotient of another topological semilattice (<em>L&#8217;<\/em>, \u2264), which is a variant of (<em>L<\/em>, \u2264), and which I will describe below.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">In order to motivate (<em>L&#8217;<\/em>, \u2264), I should say that perhaps the most interesting aspect of the theory of semilattices with small semilattices is the so-called <em>fundamental theorem of compact semilattices<\/em> [2, Theorem VI-3.4], which states an equivalence of categories between the category of compact Hausdorff semilattices with small semilattices on the one hand, and the category of bc-domains on the other hand. I will perhaps explain that one another time. That was found way earlier than everything else I have mentioned here, even before the term &#8220;bc-domain&#8221; was even coined.  It is a pretty amazing result, too, in the sense that it says that a special form of continuous dcpo (bc-domains) arises from a situation with a priori no domain theory in it: a class of (compact) Hausdorff spaces, with a certain algebraic operation + on it.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Nowadays, Lawson&#8217;s counterexample serves mostly to show that there are compact Hausdorff semilattices that do not have small semilattices.  Here it is.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Let <em>L&#8217;<\/em> consist of the same set of points as <em>L<\/em>, but with the subspace topology induced by the inclusion in <em>K<\/em><sup>patch<\/sup>.  I have already hinted that <em>K<\/em> is stably compact.  Hence its patch space (<em>K<\/em><sup>patch<\/sup>, \u2264) is a compact pospace (see Section 9.1 in the <a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\"><a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a><\/a>).  I have also hinted that <em>L&#8217;<\/em> is closed in <em>K<\/em><sup>patch<\/sup>.  Therefore (<em>L&#8217;<\/em>, \u2264) is also a compact pospace.  In particular, <em>L&#8217;<\/em> is a compact Hausdorff space.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">One can show that (<em>L&#8217;<\/em>, \u22c0) is also a topological semilattice, but beware that \u22c0 is no longer the infimum operation corresponding to the specialization ordering of <em>L&#8217;<\/em>!  In fact, since <em>L&#8217;<\/em> is Hausdorff, the specialization ordering of <em>L&#8217;<\/em> is simply equality, and therefore no two distinct elements have an infimum.  For the same reason, (<em>L&#8217;<\/em>, \u22c0) is certainly not a <em>deflationary<\/em> topological semilattice.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">In order to see that (<em>L&#8217;<\/em>, \u22c0) is a topological semilattice, one needs to show that \u22c0 is jointly continuous on <em>L&#8217;<\/em>.  The easiest way to show this is to realize that the topology of <em>L&#8217;<\/em> is generated by the open subsets of <em>L<\/em>, plus sets of the form <em>L<\/em> \u2229 (<em>U<\/em> \u00d7 \u2193<em>E<\/em><sub>0<\/sub>  \u00d7 \u2193<em>E<\/em><sub>1<\/sub>  \u00d7 &#8230;  \u00d7 \u2193<em>E<\/em><sub><em>n<\/em><\/sub>  \u00d7 \u03a0<sub><em>i<\/em>&gt;<em>n<\/em><\/sub> <em>S<\/em><sub><em>i<\/em><\/sub>) where <em>U<\/em> is of the form [0, <em>r<\/em>[ or equal to the whole of [0, \u221e].  Those sets <em>L<\/em> \u2229 (<em>U<\/em> \u00d7 \u2193<em>E<\/em><sub>0<\/sub>  \u00d7 \u2193<em>E<\/em><sub>1<\/sub>  \u00d7 &#8230;  \u00d7 \u2193<em>E<\/em><sub><em>n<\/em><\/sub>  \u00d7 \u03a0<sub><em>i<\/em>&gt;<em>n<\/em><\/sub> <em>S<\/em><sub><em>i<\/em><\/sub>) generate a dual topology on <em>L<\/em>, and I will call <em>L<\/em><sup>op<\/sup> the space <em>L<\/em> with that dual topology: that is simply the Scott topology of the opposite ordering.  (As a side note, the patch topology on <em>K<\/em> is the product of the patch topologies on each component, and it has basic open subsets of the form <em>I<\/em> \u00d7 {<em>E<\/em><sub>0<\/sub>}  \u00d7 {<em>E<\/em><sub>1<\/sub>}  \u00d7 &#8230;  \u00d7 {<em>E<\/em><sub><em>n<\/em><\/sub>}  \u00d7 \u03a0<sub><em>i<\/em>&gt;<em>n<\/em><\/sub> <em>S<\/em><sub><em>i<\/em><\/sub>, where <em>I<\/em> is an interval of the form [0, <em>b<\/em>[, ]<em>a<\/em>, <em>b<\/em>[, ]<em>b<\/em>, \u221e], or [0, \u221e], but using that kind of base will force you to replay most of the arguments we have already done.  Instead, it is easy to see that the topology generated by the sets <em>I<\/em> \u00d7 {<em>E<\/em><sub>0<\/sub>}  \u00d7 {<em>E<\/em><sub>1<\/sub>}  \u00d7 &#8230;  \u00d7 {<em>E<\/em><sub><em>n<\/em><\/sub>}  \u00d7 \u03a0<sub><em>i<\/em>&gt;<em>n<\/em><\/sub> <em>S<\/em><sub><em>i<\/em><\/sub> coincides with that generated by the sets <em>U<\/em> \u00d7 \u2191<em>E<\/em><sub>0<\/sub>  \u00d7 \u2191<em>E<\/em><sub>1<\/sub>  \u00d7 &#8230;  \u00d7 \u2191<em>E<\/em><sub><em>n<\/em><\/sub>  \u00d7 \u03a0<sub><em>i<\/em>&gt;<em>n<\/em><\/sub> <em>S<\/em><sub><em>i<\/em><\/sub> where <em>U<\/em>  is open and upwards-closed in [0, \u221e], and by the sets <em>U<\/em> \u00d7 \u2193<em>E<\/em><sub>0<\/sub>  \u00d7 \u2193<em>E<\/em><sub>1<\/sub>  \u00d7 &#8230;  \u00d7 \u2193<em>E<\/em><sub><em>n<\/em><\/sub>  \u00d7 \u03a0<sub><em>i<\/em>&gt;<em>n<\/em><\/sub> <em>S<\/em><sub><em>i<\/em><\/sub> where <em>U<\/em> is open and downwards-closed in [0, \u221e].)  Then, since we already know that \u22c0 is jointly continuous on <em>L<\/em>, it suffices to show that it is also jointly continuous on <em>L<\/em><sup>op<\/sup>.  I will let you verify this.  This is much easier than the continuity of \u22c0 on <em>L<\/em>, and in particular does not require fancy arguments such as Fact (ii).<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Hence (<em>L&#8217;<\/em>, \u22c0) is a compact Hausdorff, topological semilattice.  By similar arguments as with (<em>L<\/em>, \u22c0), it does not have small semilattices; to be precise, the argument is the same, simply replace \u2191<em>E<\/em><sub><em>i<\/em><\/sub> by {<em>E<\/em><sub><em>i<\/em><\/sub>}.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Conclusion<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">The notion of semilattices with small semilattices occurs naturally in several places.  The last place I have mentioned here is the fundamental theorem of compact semilattices, which I may talk about at more length another time.  My first motivating example was Schalk&#8217;s characterization of the algebras of the finitary Smyth hyperspace monad <strong>Q<\/strong><sub>fin<\/sub> on <strong>Top<\/strong><sub>0<\/sub>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Here is another case where small semilattices come into play.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">For a sober space <em>X<\/em>, the sobrification of <strong>Q<\/strong><sub>fin<\/sub>(<em>X<\/em>) is the space <strong>Q<\/strong><sub>s<\/sub>(<em>X<\/em>) of so-called <em>strong<\/em> non-empty compact saturated subsets of <em>X<\/em>, not <strong>Q<\/strong>(<em>X<\/em>) as one might expect [1, Proposition 7.33].  Strong compact sets were initially introduced by Reinhold Heckmann [4], and I should definitely say a word about them some time!  Then <strong>Q<\/strong><sub>s<\/sub> also defines a monad on the category of sober spaces, and its algebras are exactly the deflationary sober semilattices <em>with small semilattices<\/em> [1, Theorem 7.37].  The proof is a pretty simple extension of what we have done with <strong>Q<\/strong><sub>fin<\/sub>.<\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li>Andrea Schalk.&nbsp;<a href=\"https:\/\/www.cs.man.ac.uk\/~schalk\/publ\/diss.ps.gz\"><em>Algebras for Generalized Power Constructions<\/em><\/a>. PhD Thesis, TU Darmstadt, 1993.<\/li>\n\n\n\n<li>Gerhard Gierz, Karl Heinrich Hofmann, Klaus Keimel, Jimmie D. Lawson, Michael W. Mislove, and Dana S. Scott. Continuous Lattices and Domains. Number 93 in Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 2003.<\/li>\n\n\n\n<li>Jimmie D. Lawson.  <a href=\"https:\/\/digitalcommons.lsu.edu\/cgi\/viewcontent.cgi?article=1686&amp;context=mathematics_pubs\">Lattices with no Interval Homomorphisms<\/a>.  Pacific Journal of Mathematics 32(2):459\u2013465, 1970<\/li>\n\n\n\n<li>Reinhold Heckmann.  An upper power domain construction in terms of strongly compact sets.  In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1991. Lecture Notes in Computer Science, vol 598. Springer, Berlin, Heidelberg. <a href=\"https:\/\/doi.org\/10.1007\/3-540-55511-0_14\">https:\/\/doi.org\/10.1007\/3-540-55511-0_14<\/a><\/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> (April 19th, 2022)<\/p>\n","protected":false},"excerpt":{"rendered":"<p>My purpose today is to explain a counterexample due to Jimmie Lawson [3], or rather a slight variant of it, pertaining to the theory of topological semilattices (which I will not assume to be Hausdorff, contrarily to [3]) and to &hellip; <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=4939\">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-4939","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/pages\/4939","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=4939"}],"version-history":[{"count":90,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/pages\/4939\/revisions"}],"predecessor-version":[{"id":7066,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/pages\/4939\/revisions\/7066"}],"wp:attachment":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=4939"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}