{"id":6400,"date":"2023-03-20T11:00:58","date_gmt":"2023-03-20T10:00:58","guid":{"rendered":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=6400"},"modified":"2023-03-23T11:11:16","modified_gmt":"2023-03-23T10:11:16","slug":"localic-products-and-till-plewes-game","status":"publish","type":"page","link":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=6400","title":{"rendered":"Localic products and Till Plewe&#8217;s game"},"content":{"rendered":"\n<p class=\"wp-block-paragraph\">I have talked about Till Plewe&#8217;s topological game [2] <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=6249\" data-type=\"page\" data-id=\"6249\">last time<\/a>, showing how Matthew de Brecht used it to show that the space <em>S<\/em><sub>0<\/sub> is not consonant [1].  However, the original purpose of that game was to show that certain products are computed differently in the category of topological spaces and in the category of locales.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Localic products, topological products<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">Let me recall how products are built in the category <strong>Top<\/strong> of topological spaces and continuous maps.  The product <em>X<\/em> \u00d7 <em>Y<\/em> of two topological spaces has open subsets <em>W<\/em> built as arbitrary unions of open rectangles <em>U<\/em> \u00d7 <em>V<\/em>, where <em>U<\/em> ranges over <strong>O<\/strong><em>X<\/em> and <em>V<\/em> ranges over <strong>O<\/strong><em>Y<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Any such open set <em>W<\/em> gives rise to a Galois connection (\u03b1<em><sub>W<\/sub><\/em>, \u03b3<em><sub>W<\/sub><\/em>) between the frames <strong>O<\/strong><em>X<\/em> and <strong>O<\/strong><em>Y<\/em>: \u03b1<em><sub>W<\/sub><\/em>(<em>U<\/em>) is defined as the largest open subset <em>V<\/em> of <em>Y<\/em> such that <em>U<\/em> \u00d7 <em>V<\/em> \u2286 <em>W<\/em>, for every <em>U<\/em> \u2208 <strong>O<\/strong><em>X<\/em>, and \u03b3<em><sub>W<\/sub><\/em>(<em>V<\/em>) is the largest open subset <em>U<\/em> of <em>X<\/em> such that <em>U<\/em> \u00d7 <em>V<\/em> \u2286 <em>W<\/em>, for every <em>V<\/em> \u2208 <strong>O<\/strong><em>Y<\/em>.  It is easy to see that \u03b1<em><sub>W<\/sub><\/em> and \u03b3<em><sub>W<\/sub><\/em> are antitonic, and that <em>V<\/em> \u2286 \u03b1<em><sub>W<\/sub><\/em>(<em>U<\/em>) if and only if <em>U<\/em> \u2286 \u03b3<em><sub>W<\/sub><\/em>(<em>V<\/em>) (if and only if <em>U<\/em> \u00d7 <em>V<\/em> \u2286 <em>W<\/em>); those are the properties defining a Galois connection.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">In general, given two frames \u03a9<sub>1<\/sub>&nbsp;and \u03a9<sub>2<\/sub> (taking the place of <strong>O<\/strong><em>X<\/em> and of <strong>O<\/strong><em>Y<\/em> respectively), a Galois connection between them is a pair of antitonic maps (\u03b1, \u03b3), from \u03a9<sub>1<\/sub> to \u03a9<sub>2<\/sub> and from \u03a9<sub>2<\/sub> to \u03a9<sub>1<\/sub> respectively, satisfying the equivalence <em>v<\/em> \u2264 \u03b1(<em>u<\/em>) if and only if <em>u<\/em> \u2264 \u03b3(<em>v<\/em>).  Those Galois connections form a frame Gal(\u03a9<sub>1<\/sub>, \u03a9<sub>2<\/sub>); the ordering consists in comparing the \u03b1 parts using the pointwise ordering, or equivalently the \u03b3 parts using the pointwise ordering.  It does not matter whether we use \u03b1 or \u03b3, because any one of them determines the other one uniquely, and if one grows, the other grows as well.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Gal(\u03a9<sub>1<\/sub>, \u03a9<sub>2<\/sub>) is the coproduct of \u03a9<sub>1<\/sub>&nbsp;and \u03a9<sub>2<\/sub> in the category <strong>Frm<\/strong> of frames and frame homomorphisms.  Therefore it is their <em>product<\/em> in the opposite category <strong>Loc<\/strong>=<strong>Frm<\/strong><sup>op<\/sup> of locales.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">This is how I introduce localic products in Section 8.4.4 of the&nbsp;<a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">A funny thing is that the elements of Gal(\u03a9<sub>1<\/sub>, \u03a9<sub>2<\/sub>) are suprema of rectangles, just like in the case of topological spaces.  Those rectangles have a strange definition, although it is exactly what you would expect if you look at the Galois connections defined from regular open rectangles <em>U<\/em> \u00d7 <em>V<\/em> in the product of two topological spaces, and abstract away from spaces in order to obtain a formula that makes sense on all frames.  Explicitly, given <em>u<\/em> \u2208 \u03a9<sub>1<\/sub> and <em>v<\/em> \u2208 \u03a9<sub>2<\/sub>, the (<em>u<\/em> \u00d7 <em>v<\/em>)-<em>rectangle<\/em> <em>u<\/em> \u2297 <em>v<\/em> is the Galois connection (\u03b1<em><sub>uv<\/sub><\/em>, \u03b3<em><sub>uv<\/sub><\/em>) where \u03b1<em><sub>uv<\/sub><\/em> maps \u22a5 to \u22a4, every element below <em>u<\/em> and different from \u22a5 to <em>v<\/em>, and all other elements to \u22a5.  (The \u03b3<em><sub>uv<\/sub><\/em> part is obtained in a unique way from \u03b1, and\u2014as you might guess\u2014by a symmetric formula.  In the book, \u03b1<em><sub>uv<\/sub><\/em> is written as \u03b1<em><sub>u<em><sub>\u00d7<\/sub><\/em>v<\/sub><\/em> and \u03b3<em><sub>uv<\/sub><\/em> is written as \u03b3<em><sub>u\u00d7v<\/sub><\/em>, but I now find this small \u00d7 sign visually disturbing.  Note that I am also using the notation <em>u<\/em> \u2297 <em>v<\/em>, just like Plewe [2]; so <em>u<\/em> \u2297 <em>v<\/em> is the same thing as the Galois connection (\u03b1<em><sub>uv<\/sub><\/em>, \u03b3<em><sub>uv<\/sub><\/em>).)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The point is that every element (\u03b1, \u03b3) of Gal(\u03a9<sub>1<\/sub>, \u03a9<sub>2<\/sub>) is the supremum of all the rectangles below it.  Additionally, this supremum is <em>pointwise<\/em>: for every <em>u&#8217;<\/em>, \u03b1(<em>u&#8217;<\/em>) is the supremum of the family \u03b1<em><sub>uv<\/sub><\/em>(<em>u&#8217;<\/em>) where (\u03b1<em><sub>uv<\/sub><\/em>, \u03b3<em><sub>uv<\/sub><\/em>) ranges over the rectangles below (\u03b1, \u03b3) (and similarly for \u03b3(<em>v&#8217;<\/em>)).  This is remarkable, since general suprema of Galois connections are not computed pointwise; only infima are computed pointwise.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We have seen that every open set <em>W<\/em> in the topological product <em>X<\/em> \u00d7 <em>Y<\/em> defines a Galois connection between <strong>O<\/strong><em>X<\/em> and <strong>O<\/strong><em>Y<\/em>.  In other words, <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) sits inside Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>), through the mapping that sends <em>W<\/em> to (\u03b1<em><sub>W<\/sub><\/em>, \u03b3<em><sub>W<\/sub><\/em>).  Let me call \u03b8 this mapping.  Explicitly:<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Definition.<\/strong>  \u03b8 : <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) \u2192 Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) maps every open subset <em>W<\/em> of <em>X<\/em> \u00d7 <em>Y<\/em> to (\u03b1<em><sub>W<\/sub><\/em>, \u03b3<em><sub>W<\/sub><\/em>), where:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>\u03b1<em><sub>W<\/sub><\/em>(<em>U<\/em>) is defined as the largest open subset <em>V<\/em> of <em>Y<\/em> such that <em>U<\/em> \u00d7 <em>V<\/em> \u2286 <em>W<\/em>, for every <em>U<\/em> \u2208 <strong>O<\/strong><em>X<\/em>;<\/li>\n\n\n\n<li>\u03b3<em><sub>W<\/sub><\/em>(<em>V<\/em>) is the largest open subset <em>U<\/em> of <em>X<\/em> such that <em>U<\/em> \u00d7 <em>V<\/em> \u2286 <em>W<\/em>, for every <em>V<\/em> \u2208 <strong>O<\/strong><em>Y<\/em>.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">One may wonder whether the two frames are isomorphic, and, if you do not know the answer to that riddle yet, you might surmise that they are indeed isomorphic.  But you would be wrong.  We have <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) \u2245 Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) through \u03b8 if <em>X<\/em> or <em>Y<\/em> is core-compact, but the equality fails in general.  I have already given John Isbell&#8217;s proof that this isomorphism fails when <em>X<\/em> and <em>Y<\/em> are two disjoint dense subsets of a non-empty T<sub>2<\/sub> space [3], in a <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=1224\" data-type=\"page\" data-id=\"1224\">2017 post<\/a>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">My objective is to give another way of understanding how the isomorphism <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) \u2245 Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) may succeed or fail, following Till Plewe [2].<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Till Plewe&#8217;s game<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">I have already introduced Till Plewe&#8217;s game <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=6249\" data-type=\"page\" data-id=\"6249\">last time<\/a>, but let me repeat it here.  Let <em>X<\/em> and <em>Y<\/em> be two topological spaces, <em>U<\/em><sub>0<\/sub> be an open subset of <em>X<\/em>, <em>V<\/em><sub>0<\/sub> be an open subset of <em>Y<\/em>, and <strong><em>U<\/em><\/strong> be an open cover of <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> by open rectangles.  Till Plewe&#8217;s game <em>G<\/em><sub><em>X<\/em>,<em>Y<\/em><\/sub>(<em>U<\/em><sub>0<\/sub>, <em>V<\/em><sub>0<\/sub>, <strong><em>U<\/em><\/strong>) is played as follows.  At each round <em>i<\/em>\u22651:<\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li>player I picks a point <em>x<sub>i<\/sub><\/em> \u2208 <em>U<\/em><sub><em>i<\/em>\u20131<\/sub>;<\/li>\n\n\n\n<li>then player II picks an open neighborhood <em>U<\/em><sub><em>i<\/em><\/sub> of <em>x<sub>i<\/sub><\/em> included in <em>U<\/em><sub><em>i<\/em>\u20131<\/sub>;<\/li>\n\n\n\n<li>player I picks a point <em>y<sub>i<\/sub><\/em> \u2208 <em>V<\/em><sub><em>i<\/em>\u20131<\/sub>;<\/li>\n\n\n\n<li>then player II picks an open neighborhood <em>V<\/em><sub><em>i<\/em><\/sub> of <em>y<sub>i<\/sub><\/em> included in <em>V<\/em><sub><em>i<\/em>\u20131<\/sub>.<\/li>\n<\/ol>\n\n\n\n<p class=\"wp-block-paragraph\">(Each player plays twice at each round; this is deliberate.)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Player II wins (at round <em>i<\/em>) if <em>U<\/em><sub><em>i<\/em><\/sub> \u00d7 <em>V<\/em><sub><em>i<\/em><\/sub> is included in one of the open rectangles of the cover <strong><em>U<\/em><\/strong>.  Otherwise, namely if the play goes along without player II ever winning, player I wins.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Plewe&#8217;s Theorem 1.1 [2] roughly states that Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) is spatial if and only if player II has a winning strategy in this game, and otherwise player I has a winning strategy.  He requires <em>X<\/em> and <em>Y<\/em> to be sober, but we will see that we can dispense with that assumption.  The core of this post will consist in proving the following very similar result.  That is an (apparently) weaker result, since we are asking when \u03b8 is an order-isomorphism, not whether there is a (possibly different) order-isomorphism between <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) and Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>).  We will see later that the two results are, in fact, equivalent.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Theorem.<\/strong>  For any two topological spaces <em>X<\/em> and <em>Y<\/em>, exactly one of the following mutually exclusive alternatives much occur:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>\u03b8 is an order-isomorphism of <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) onto Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>), and for every open subset <em>U<\/em><sub>0<\/sub> of <em>X<\/em>, for every open subset <em>V<\/em><sub>0<\/sub> of <em>Y<\/em>, for every open cover <strong><em>U<\/em><\/strong> of <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> by open rectangles, player II has a winning strategy in the game <em>G<\/em><sub><em>X<\/em>,<em>Y<\/em><\/sub>(<em>U<\/em><sub>0<\/sub>, <em>V<\/em><sub>0<\/sub>, <strong><em>U<\/em><\/strong>);<\/li>\n\n\n\n<li>or \u03b8 is not an order-isomorphism\u2014in fact, \u03b8 is not surjective from <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) to Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>)\u2014and there are an open subset <em>U<\/em><sub>0<\/sub> of <em>X<\/em>, an open subset <em>V<\/em><sub>0<\/sub> of <em>Y<\/em>, and an open cover <strong><em>U<\/em><\/strong> of <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> by open rectangles such that player I has a winning strategy in the game <em>G<\/em><sub><em>X<\/em>,<em>Y<\/em><\/sub>(<em>U<\/em><sub>0<\/sub>, <em>V<\/em><sub>0<\/sub>, <strong><em>U<\/em><\/strong>).<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">Plewe really considers arbitrary products, but binary products will be enough for one post.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">C-ideals<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">The key to Plewe&#8217;s Theorem is the following alternate characterization of suprema (not <em>pointwise<\/em> suprema) in the localic product (=frame coproduct) of two frames.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">A <em>C-ideal<\/em> on a pair of frames \u03a9<sub>1<\/sub>, \u03a9<sub>2<\/sub> is a downwards closed set <em>D<\/em> of (localic) rectangles that is <em>closed under C-suprema<\/em> (for &#8220;suprema taken <strong>c<\/strong>omponentwise&#8221;), namely such that:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>for every <em>u<\/em> \u2208 \u03a9<sub>1<\/sub>, for every family of elements (<em>v<sub>i<\/sub><\/em>)<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> with some supremum <em>v<\/em> in \u03a9<sub>2<\/sub>, such that each rectangle <em>u<\/em> \u2297 <em>v<sub>i<\/sub><\/em> is in <em>D<\/em>, then <em>u<\/em> \u2297 <em>v<\/em> is also in <em>D<\/em>, and<\/li>\n\n\n\n<li>for every <em>v<\/em> \u2208 \u03a9<sub>2<\/sub>, for every family of elements (<em>u<sub>i<\/sub><\/em>)<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> with some supremum <em>u<\/em> in \u03a9<sub>1<\/sub>, such that each rectangle <em>u<sub>i<\/sub><\/em> \u2297 <em>v<\/em> is in <em>D<\/em>, then <em>u<\/em> \u2297 <em>v<\/em> is also in <em>D<\/em>.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">Let me recall that <em>u<\/em> \u2297 <em>v<\/em> stands for the Galois connection (\u03b1<em><sub>uv<\/sub><\/em>, \u03b3<em><sub>uv<\/sub><\/em>).  The family (<em>v<sub>i<\/sub><\/em>)<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> can be taken to be empty in the first of the two conditions given above; therefore <em>u<\/em> \u2297 \u22a5 is in <em>D<\/em> for every <em>u<\/em> \u2208 \u03a9<sub>1<\/sub>; similarly, \u22a5 \u2297 <em>v<\/em> is in <em>D<\/em> for every <em>v<\/em> \u2208 \u03a9<sub>2<\/sub>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">There is an isomorphism of frames between Gal(\u03a9<sub>1<\/sub>, \u03a9<sub>2<\/sub>) and the poset of C-ideals on \u03a9<sub>1<\/sub>, \u03a9<sub>2<\/sub> ordered by inclusion.  The characterization of localic products as the space of ideals is from Dowker and Strauss [4]; the isomorphism with Gal(\u03a9<sub>1<\/sub>, \u03a9<sub>2<\/sub>) is due to Wigner [5], and is treated in Exercise 8.4.27 of the&nbsp;<a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Given any element (\u03b1, \u03b3) in Gal(\u03a9<sub>1<\/sub>, \u03a9<sub>2<\/sub>), the collection of open rectangles <em>u<\/em> \u2297 <em>v<\/em> smaller than or equal to (\u03b1, \u03b3) is a C-ideal; let me call that C-ideal Down(\u03b1, \u03b3).  The reason why this is a C-ideal is that <em>u<\/em> \u2297 <em>v<\/em> \u2264 (\u03b1, \u03b3) if and only if <em>v<\/em> \u2264 \u03b1(<em>u<\/em>) if and only if <em>u<\/em> \u2264 \u03b3(<em>v<\/em>) (Lemma 8.4.22 of the&nbsp;<a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>); then the set of elements <em>v<\/em> that are below \u03b1(<em>u<\/em>) (for <em>u<\/em> fixed) is downwards closed and closed under all suprema, while the set of elements <em>u<\/em> that are below \u03b3(<em>v<\/em>) (for <em>v<\/em> fixed) is also downwards closed and closed under all suprema.<\/li>\n\n\n\n<li>Conversely, given any C-ideal <em>D<\/em>, we can form a Galois connection Sup(<em>D<\/em>) \u225d (\u03b1, \u03b3) as the pointwise supremum of all the rectangles in <em>D<\/em>.  In other words, we define \u03b1(<em>u&#8217;<\/em>), for every <em>u&#8217;<\/em> \u2208 \u03a9<sub>1<\/sub>, as the supremum of {\u03b1<em><sub>uv<\/sub><\/em>(<em>u&#8217;<\/em>) | <em>u<\/em> \u2297 <em>v<\/em> \u2208 <em>D<\/em>}, and \u03b3(<em>v&#8217;<\/em>), for every <em>v&#8217;<\/em> \u2208 \u03a9<sub>2<\/sub>, as the supremum of {\u03b3<em><sub>uv<\/sub><\/em>(<em>v&#8217;<\/em>) | <em>u<\/em> \u2297 <em>v<\/em> \u2208 <em>D<\/em>}.  In order to see that this is a Galois connection, and therefore that it is the supremum of all the rectangles in <em>D<\/em>, we first simplify these expressions.<br>We recall that, for all <em>u<\/em> and <em>v<\/em>, \u03b1<em><sub>uv<\/sub><\/em>(<em>u&#8217;<\/em>) equals \u22a4 if <em>u&#8217;<\/em>=\u22a5, <em>v<\/em> if <em>u&#8217;<\/em>\u2260\u22a5 and <em>u&#8217;<\/em>\u2264<em>u<\/em>, and \u22a5 otherwise; therefore \u03b1(<em>u&#8217;<\/em>) is equal to \u22a4 if <em>u&#8217;<\/em>=\u22a5, and otherwise to the supremum of all the elements <em>v<\/em> such that <em>u&#8217;<\/em>\u2264<em>u<\/em> for some rectangle <em>u<\/em> \u2297 <em>v<\/em> \u2208 <em>D<\/em>.  Since <em>D<\/em> is downwards-closed, it is equivalent to require that <em>u&#8217;<\/em>\u2264<em>u<\/em> for some rectangle <em>u<\/em> \u2297 <em>v<\/em> \u2208 <em>D<\/em>, or to require that <em>u&#8217;<\/em> \u2297 <em>v<\/em> itself be in <em>D<\/em>.  Hence, if <em>u&#8217;<\/em>\u2260\u22a5, then \u03b1(<em>u&#8217;<\/em>) is equal to the supremum of all the elements <em>v<\/em> such that <em>u&#8217;<\/em> \u2297 <em>v<\/em> \u2208 <em>D<\/em>.  Since <em>D<\/em> is closed under C-suprema, <em>u&#8217;<\/em> \u2297 \u03b1(<em>u&#8217;<\/em>) is in <em>D<\/em>; in other words, \u03b1(<em>u&#8217;<\/em>) is the largest element <em>v<\/em> \u2208 \u03a9<sub>2<\/sub> such that <em>u&#8217;<\/em> \u2297 <em>v<\/em> \u2208 <em>D<\/em>.  (This continues to hold if <em>u&#8217;<\/em>=\u22a5, since every element <em>v<\/em> is such that \u22a5 \u2297 <em>v<\/em> \u2208 <em>D<\/em>, so that their supremum is \u22a4.)<br>Symmetrically, for every <em>v&#8217;<\/em> \u2208 \u03a9<sub>2<\/sub>, \u03b3(<em>v&#8217;<\/em>) is the largest element <em>u<\/em> \u2208 \u03a9<sub>1<\/sub> such that <em>u<\/em> \u2297 <em>v&#8217;<\/em> \u2208 <em>D<\/em>.<br>The statements <em>u&#8217;<\/em> \u2264 \u03b3(<em>v&#8217;<\/em>), <em>v&#8217;<\/em> \u2264 \u03b1(<em>u&#8217;<\/em>), and <em>u&#8217;<\/em> \u2297 <em>v&#8217;<\/em> \u2208 <em>D<\/em> are then equivalent; in particular, (\u03b1, \u03b3) is a Galois connection, as desired.<\/li>\n\n\n\n<li>Given Sup(<em>D<\/em>) = (\u03b1, \u03b3), as we have just defined it, Down(Sup(<em>D<\/em>)) is the collection of rectangles <em>u&#8217;<\/em> \u2297 <em>v&#8217;<\/em> below (\u03b1, \u03b3), equivalently such that <em>v&#8217;<\/em> \u2264 \u03b1(<em>u&#8217;<\/em>), equivalently such that <em>u&#8217;<\/em> \u2297 <em>v&#8217;<\/em> \u2208 <em>D<\/em>.  Therefore Down(Sup(<em>D<\/em>)) = <em>D<\/em>.<\/li>\n\n\n\n<li>For every Galois connection (\u03b1, \u03b3), letting (\u03b1&#8217;, \u03b3&#8217;) \u225d Sup(Down(\u03b1, \u03b3)), we have that for every <em>u&#8217;<\/em> \u2208 \u03a9<sub>1<\/sub>, \u03b1'(<em>u&#8217;<\/em>) is the largest element <em>v<\/em> \u2208 \u03a9<sub>2<\/sub> such that <em>u&#8217;<\/em> \u2297 <em>v<\/em> \u2208 Down(\u03b1, \u03b3), namely such that <em>u&#8217;<\/em> \u2297 <em>v<\/em> \u2264 (\u03b1, \u03b3).  But every Galois connection is the supremum of the rectangles below it, so Sup(Down(\u03b1, \u03b3)) = (\u03b1, \u03b3).<\/li>\n\n\n\n<li>Finally, it is clear that the map Down is monotonic.  Since Sup is an inverse to Down, it is also monotonic.  Therefore Down and Sup form a pair of mutually inverse order-isomorphisms.<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Localic suprema of rectangles<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">Plewe&#8217;s theorem is really about how one would compute suprema of rectangles in Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>).  It is equivalent to consider suprema of rectangles in the space of C-ideals on <strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>, by the correspondence between C-ideals and Galois connections that we have just seen (or recalled).<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Hence let us fix a a family <strong><em>U<\/em><\/strong> of (topological) open rectangles <em>U<sub>i<\/sub><\/em> \u00d7 <em>V<sub>i<\/sub><\/em>, <em>i<\/em> \u2208 <em>I<\/em>.  Each one defines a localic rectangle <em>U<sub>i<\/sub><\/em> \u2297 <em>V<sub>i<\/sub><\/em>, and we wish to compute their localic supremum, namely their supremum in Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>).<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We work in the isomorphic frame of C-ideals, and our problem is, equivalently, to find the supremum of the C-ideals Down(<em>U<sub>i<\/sub><\/em> \u2297 <em>V<sub>i<\/sub><\/em>).  That is, by definition, the smallest C-ideal <em>D<\/em> containing Down(<em>U<sub>i<\/sub><\/em> \u2297 <em>V<sub>i<\/sub><\/em>) for every <em>i<\/em> \u2208 <em>I<\/em>.  We start off the construction by defining <strong>D<\/strong><sub>0<\/sub>(<strong><em>U<\/em><\/strong>) as the union of the sets Down(<em>U<sub>i<\/sub><\/em> \u2297 <em>V<sub>i<\/sub><\/em>), <em>i<\/em> \u2208 <em>I<\/em>.  This is downwards-closed, but is quite probably not closed under C-suprema.  We repair this by defining <strong>D<\/strong><sub>1<\/sub>(<strong><em>U<\/em><\/strong>) as all C-suprema of elements of <strong>D<\/strong><sub>0<\/sub>(<strong><em>U<\/em><\/strong>).  One can see that <strong>D<\/strong><sub>1<\/sub>(<strong><em>U<\/em><\/strong>) will still be downwards-closed (we will see that below), but it may still not be closed under C-suprema, so we iterate the process for transfinitely long.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Explicitly, we define collections <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>) of rectangles by induction on the ordinal \u03b2 as follows.  We have already defined <strong>D<\/strong><sub>0<\/sub>(<strong><em>U<\/em><\/strong>).  Assuming that we have built <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>), and that it is downwards-closed, we let <strong>D<\/strong><sub>\u03b2+1<\/sub>(<strong><em>U<\/em><\/strong>) be the collection of rectangles <em>U<\/em> \u2297 <em>V<\/em> where either <em>V<\/em>=\u222a<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> <em>V<sub>i<\/sub><\/em> for open sets <em>V<sub>i<\/sub><\/em> such that every rectangle <em>U<\/em> \u2297 <em>V<sub>i<\/sub><\/em> is in <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>), or <em>U<\/em>=\u222a<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> <em>U<sub>i<\/sub><\/em> where every <em>U<sub>i<\/sub><\/em> is open in <em>X<\/em> and every rectangle <em>U<em><sub>i<\/sub><\/em><\/em> \u2297 <em>V<\/em> is in <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>).  (<strong>D<\/strong><sub>\u03b2+1<\/sub>(<strong><em>U<\/em><\/strong>) will still be downwards-closed.  For example, if <em>U<\/em> \u2297 <em>V<\/em> is obtained by taking <em>V<\/em>=\u222a<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> <em>V<sub>i<\/sub><\/em> where <em>U<\/em> \u2297 <em>V<sub>i<\/sub><\/em> is in <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>) for every <em>i<\/em>, and if <em>U&#8217;<\/em> \u2297 <em>V&#8217;<\/em> \u2264 <em>U<\/em> \u2297 <em>V<\/em>, then <em>U&#8217;<\/em> is included in <em>U<\/em> and <em>V&#8217;<\/em> is included in <em>V<\/em> [or <em>U&#8217;<\/em> or <em>V&#8217;<\/em> is empty]; since <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>) is downwards-closed, <em>U&#8217;<\/em> \u2297 (<em>V<sub>i<\/sub><\/em> \u2229 <em>V&#8217;<\/em>) is in <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>) for every <em>i<\/em>, hence therefore also <em>U&#8217;<\/em> \u2297 \u222a<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> (<em>V<sub>i<\/sub><\/em> \u2229 <em>V&#8217;<\/em>) = <em>U&#8217;<\/em> \u2297 (<em>V<\/em> \u2229 <em>V&#8217;<\/em>) = <em>U&#8217;<\/em> \u2297 <em>V&#8217;<\/em>.)  When \u03b2 is a limit ordinal, we define <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>) as the union of <strong>D<\/strong><sub>\u03b2&#8217;<\/sub>(<strong><em>U<\/em><\/strong>), where \u03b2'&lt;\u03b2.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The process must stabilize at some ordinal \u03b2, namely all the sets <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>) should be equal for \u03b2 large enough.  Otherwise the elements added at each stage would form a proper class of rectangles in the end; but the rectangles on <strong>O<\/strong><em>X<\/em> and <strong>O<\/strong><em>Y<\/em> only form a set, not a proper class.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">I will write <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>) for the union of all the sets <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>).  We have just argued that <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>) = <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>) for \u03b2 large enough.  The fact that <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>) = <strong>D<\/strong><sub>\u03b2+1<\/sub>(<strong><em>U<\/em><\/strong>) means that <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>) is closed under C-suprema.  We have argued earlier that <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>) was downwards-closed.  Hence <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>) is a C-ideal.  It contains every rectangle <em>U<sub>i<\/sub><\/em> \u2297 <em>V<sub>i<\/sub><\/em>, since <strong>D<\/strong><sub>0<\/sub>(<strong><em>U<\/em><\/strong>) is included in <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>).  Also, every C-ideal <em>D<\/em> containing every rectangle <em>U<sub>i<\/sub><\/em> \u2297 <em>V<sub>i<\/sub><\/em> must contain <strong>D<\/strong><sub>0<\/sub>(<strong><em>U<\/em><\/strong>) and, by the fact that <em>D<\/em> is closed under C-suprema and by ordinal induction, <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>) is included in <em>D<\/em> for every ordinal \u03b2.  Therefore:<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Fact A.<\/strong>  For every family <strong><em>U<\/em><\/strong> of (topological) open rectangles <em>U<sub>i<\/sub><\/em> \u00d7 <em>V<sub>i<\/sub><\/em>, <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>) is the supremum of the C-ideals Down(<em>U<sub>i<\/sub><\/em> \u2297 <em>V<sub>i<\/sub><\/em>) in the space of C-ideals on the frames <strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>.  Therefore Sup(<strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>)) is the supremum of the rectangles <em>U<sub>i<\/sub><\/em> \u2297 <em>V<sub>i<\/sub><\/em> in Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>).<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">When is \u03b8 an isomorphism?<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">We recall that \u03b8 maps every open subset <em>W<\/em> of <em>X<\/em> \u00d7 <em>Y<\/em> to the Galois connection (\u03b1<em><sub>W<\/sub><\/em>, \u03b3<em><sub>W<\/sub><\/em>), where for every <em><em>U<\/em> \u2208 <strong>O<\/strong><em>X<\/em>,<\/em> \u03b1<em><sub>W<\/sub><\/em>(<em>U<\/em>) is the largest open subset <em>V<\/em> of <em>Y<\/em> such that <em>U<\/em> \u00d7 <em>V<\/em> \u2286 <em>W<\/em>, and for every <em><em>V<\/em> \u2208 <strong>O<\/strong><em>Y<\/em><\/em>, \u03b3<em><sub>W<\/sub><\/em>(<em>V<\/em>) is the largest open subset <em>U<\/em> of <em>X<\/em> such that <em>U<\/em> \u00d7 <em>V<\/em> \u2286 <em>W<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The map \u03b8 is an order-embedding, meaning that <em>W<\/em> \u2286 <em>W&#8217;<\/em> if and only if \u03b1<em><sub>W<\/sub><\/em>\u2264\u03b1<em><sub>W&#8217;<\/sub><\/em> (or equivalently,  \u03b3<em><sub>W<\/sub><\/em>\u2264\u03b3<em><sub>W&#8217;<\/sub><\/em>), for all open subsets <em>W<\/em> and <em>W&#8217;<\/em> of <em>X<\/em> \u00d7 <em>Y<\/em>.  The left-to-right direction follows from the fact that if <em>U<\/em> \u00d7 <em>V<\/em> \u2286 <em>W<\/em> then <em>U<\/em> \u00d7 <em>V<\/em> \u2286 <em>W&#8217;<\/em>, while the right-to-left direction is because, if \u03b1<em><sub>W<\/sub><\/em>\u2264\u03b1<em><sub>W&#8217;<\/sub><\/em>, then for every open rectangle <em>U<\/em> \u00d7 <em>V<\/em> \u2286 <em>W<\/em>, we have <em>V<\/em> \u2286 \u03b1<em><sub>W<\/sub><\/em>(<em>U<\/em>), hence <em>V<\/em> \u2286 \u03b1<em><sub>W&#8217;<\/sub><\/em>(<em>U<\/em>), hence <em>U<\/em> \u00d7 <em>V<\/em> \u2286 <em>W<\/em>&#8216;; we use the fact that, by definition of \u03b1<em><sub>W<\/sub><\/em>, <em>U<\/em> \u00d7 <em>V<\/em> \u2286 <em>W<\/em> if and only if <em>V<\/em> \u2286 \u03b1<em><sub>W<\/sub><\/em>(<em>U<\/em>), and similarly with <em>W&#8217;<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Hence \u03b8 is an isomorphism if and only if it is surjective.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Lemma B.<\/strong>  The map \u03b8 is surjective (equivalently, an order-isomorphism) if and only if for every open subset <em>U<\/em><sub>0<\/sub> of <em>X<\/em>, for every open subset <em>V<\/em><sub>0<\/sub> of <em>Y<\/em>, for every open cover <strong><em>U<\/em><\/strong> of <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> by open rectangles, <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>) contains <em>U<\/em><sub>0<\/sub> \u2297 <em><em>V<\/em><\/em><sub>0<\/sub>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><em>Proof.<\/em>  Given any collection <strong><em>U<\/em><\/strong> of open rectangles in <em>X<\/em> \u00d7 <em><em>Y<\/em><\/em> and any open subset <em>W<\/em> of <em>X<\/em> \u00d7 <em><em>Y<\/em><\/em>, we claim that Sup(<strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>)) = \u03b8(<em>W<\/em>) if and only if: (*) for every open subset <em>U<\/em><sub>0<\/sub> of <em>X<\/em>, for every open subset <em>V<\/em><sub>0<\/sub> of <em>Y<\/em>, <em>U<\/em><sub>0<\/sub> \u2297 <em><em>V<\/em><\/em><sub>0<\/sub> \u2208 <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>) if and only if <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> \u2286 <em>W<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Indeed, Sup(<strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>)) = \u03b8(<em>W<\/em>) if and only if <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>) = Down(\u03b8(<em>W<\/em>)), using the fact that G and Down are mutual inverses.  Now <em>U<\/em><sub>0<\/sub> \u2297 <em><em>V<\/em><\/em><sub>0<\/sub> \u2208 Down(\u03b8(<em>W<\/em>)) if and only if <em>U<\/em><sub>0<\/sub> \u2297 <em><em>V<\/em><\/em><sub>0<\/sub> is below \u03b8(<em>W<\/em>) = (\u03b1<em><sub>W<\/sub><\/em>, \u03b3<em><sub>W<\/sub><\/em>).  Using Lemma 8.4.22 in the&nbsp;<a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a> (a result we have already used several times in this post), <em>U<\/em><sub>0<\/sub> \u2297 <em><em>V<\/em><\/em><sub>0<\/sub> is below (\u03b1<em><sub>W<\/sub><\/em>, \u03b3<em><sub>W<\/sub><\/em>) if and only if <em><em>V<\/em><\/em><sub>0<\/sub> \u2286 \u03b1<em><sub>W<\/sub><\/em>(<em>U<\/em><sub>0<\/sub>), if and only if <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> \u2286 <em>W<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">If \u03b8 is surjective, then for every family <strong><em>U<\/em><\/strong> of open rectangles, Sup(<strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>)) = \u03b8(<em>W<\/em>) for some open subset <em>W<\/em> of <em>X<\/em> \u00d7 <em><em>Y<\/em><\/em>.   Hence by (*), the open rectangles <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> included in <em>W<\/em> are exactly those such that <em>U<\/em><sub>0<\/sub> \u2297 <em><em>V<\/em><\/em><sub>0<\/sub> is in <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>).  Every open rectangle <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> in <strong><em>U<\/em><\/strong> is such that <em>U<\/em><sub>0<\/sub> \u2297 <em><em>V<\/em><\/em><sub>0<\/sub> is in <strong>D<\/strong><sub>0<\/sub>(<strong><em>U<\/em><\/strong>), hence in <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>), so <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> must be included in <em>W<\/em>.  Therefore the union of the open rectangles in <strong><em>U<\/em><\/strong> is included in <em>W<\/em>; or equivalently, <strong><em>U<\/em><\/strong> is a cover of <em>W<\/em> by open rectangles.  It follows that for every open subset <em>U<\/em><sub>0<\/sub> of <em>X<\/em>, for every open subset <em>V<\/em><sub>0<\/sub> of <em>Y<\/em>, if <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> is in <strong><em>U<\/em><\/strong>, in particular <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> is included in <em>W<\/em>, so by (*), used a second time, <em>U<\/em><sub>0<\/sub> \u2297 <em><em>V<\/em><\/em><sub>0<\/sub> \u2208 <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>).  This shows the &#8220;only if&#8221; (left to right) direction of the Lemma.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Conversely, let us assume that the part of the Lemma that follows &#8220;if and only if&#8221; holds, namely that for every collection <strong><em>U<\/em><\/strong> of open rectangles in <em>X<\/em> \u00d7 <em><em>Y<\/em><\/em>, for every open subset <em>U<\/em><sub>0<\/sub> of <em>X<\/em> and for every open subset <em>V<\/em><sub>0<\/sub> of <em>Y<\/em> such that <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> is included in the union <em>W<\/em> of the open rectangles in <strong><em>U<\/em><\/strong>,  <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>) contains <em>U<\/em><sub>0<\/sub> \u2297 <em><em>V<\/em><\/em><sub>0<\/sub>.  By (*), this means that for every collection <strong><em>U<\/em><\/strong> of open rectangles in <em>X<\/em> \u00d7 <em><em>Y<\/em><\/em>, Sup(<strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>)) = \u03b8(<em>W<\/em>), where <em>W<\/em> is the union of the open rectangles in <strong><em>U<\/em><\/strong>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Let (\u03b1, \u03b3) be any element of Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>).  We recall that (\u03b1, \u03b3) = Sup(Down(\u03b1, \u03b3)), since Sup and Down are mutually inverse.  Let us write Down(\u03b1, \u03b3) as a collection of rectangles <em>U<sub>i<\/sub><\/em> \u2297 <em>V<sub>i<\/sub><\/em>, <em>i<\/em> \u2208 <em>I<\/em>.  Let <strong><em>U<\/em><\/strong> be the corresponding collection of open rectangles <em>U<sub>i<\/sub><\/em> \u00d7 <em>V<sub>i<\/sub><\/em>, <em>i<\/em> \u2208 <em>I<\/em>.  By Fact A, Sup(<strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>)) is the supremum of the rectangles <em>U<sub>i<\/sub><\/em> \u2297 <em>V<sub>i<\/sub><\/em> in Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>).  But that supremum is also the supremum of Down(\u03b1, \u03b3), namely Sup(Down(\u03b1, \u03b3)), equivalently, (\u03b1, \u03b3).  Therefore (\u03b1, \u03b3) = Sup(<strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>)) = \u03b8(<em>W<\/em>), showing that \u03b8 is surjective.  \u2610<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Plewe&#8217;s theorem is now merely a game-theoretic rephrasing of Lemma B, as we now demonstrate.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Player II wins when \u03b8 : <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) \u2245 Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>)<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">Let us show the first half of the promised theorem: that if \u03b8 is an order-isomorphism from <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>)  onto Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>), then player II has a winning strategy in the game <em>G<\/em><sub><em>X<\/em>,<em>Y<\/em><\/sub>(<em>U<\/em><sub>0<\/sub>, <em>V<\/em><sub>0<\/sub>, <strong><em>U<\/em><\/strong>), for every open subset <em>U<\/em><sub>0<\/sub> of <em>X<\/em>, for every open subset <em>V<\/em><sub>0<\/sub> of <em>Y<\/em>, and for every open cover <strong><em>U<\/em><\/strong> of <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> by open rectangles.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We fix <em>U<\/em><sub>0<\/sub>, <em>V<\/em><sub>0<\/sub>, and an open cover <strong><em>U<\/em><\/strong> of <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> by open rectangles as above.  Let me recall how this game is played.  At each round <em>i<\/em>\u22651:<\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li>player I picks a point <em>x<sub>i<\/sub><\/em> \u2208 <em>U<\/em><sub><em>i<\/em>\u20131<\/sub>;<\/li>\n\n\n\n<li>then player II picks an open neighborhood <em>U<\/em><sub><em>i<\/em><\/sub> of <em>x<sub>i<\/sub><\/em> included in <em>U<\/em><sub><em>i<\/em>\u20131<\/sub>;<\/li>\n\n\n\n<li>player I picks a point <em>y<sub>i<\/sub><\/em> \u2208 <em>V<\/em><sub><em>i<\/em>\u20131<\/sub>;<\/li>\n\n\n\n<li>then player II picks an open neighborhood <em>V<\/em><sub><em>i<\/em><\/sub> of <em>y<sub>i<\/sub><\/em> included in <em>V<\/em><sub><em>i<\/em>\u20131<\/sub>.<\/li>\n<\/ol>\n\n\n\n<p class=\"wp-block-paragraph\">Player II wins at round <em>i<\/em> if <em>U<\/em><sub><em>i<\/em><\/sub> \u00d7 <em>V<\/em><sub><em>i<\/em><\/sub> is included in one of the open rectangles of the cover <strong><em>U<\/em><\/strong>.  Otherwise, player I wins.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">If \u03b8 is an order-isomorphism, then by Lemma B, <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>) contains <em>U<\/em><sub>0<\/sub> \u2297 <em><em>V<\/em><\/em><sub>0<\/sub>.  Since <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>) is equal to the union of the sets <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>), where \u03b2 ranges over the ordinals, every rectangle in <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>) has a <em>rank<\/em>, which is by definition the least ordinal \u03b2 such that the rectangle belongs to <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>).  We let \u03b2<sub>0<\/sub> be the rank of <em>U<\/em><sub>0<\/sub> \u2297 <em><em>V<\/em><\/em><sub>0<\/sub>.  We will let player II play in such a way that after round <em>i<\/em>, <em>U<\/em><sub><em>i<\/em><\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em><\/sub> has rank \u03b2<sub><em>i<\/em><\/sub>, where \u03b2<sub>0<\/sub> &gt; \u03b2<sub>1<\/sub> &gt; &#8230; &gt; \u03b2<sub><em>i<\/em><\/sub>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">If \u03b2<sub><em>i<\/em><\/sub>=0, then <em>U<\/em><sub><em>i<\/em><\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em><\/sub> is in <strong>D<\/strong><sub>0<\/sub>(<strong><em>U<\/em><\/strong>), which is by definition the union of the sets Down(<em>U<\/em> \u2297 <em>V<\/em>) where <em>U<\/em> \u00d7 <em><em>V<\/em><\/em> ranges over the open rectangles of <strong><em>U<\/em><\/strong>, and therefore player II wins.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Let us assume that <em>i<\/em>\u22651 and that player II has not won yet, that is, \u03b2<sub><em>i<\/em>\u20131<\/sub>&gt;0.  <em>U<\/em><sub><em>i<\/em>\u20131<\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em>\u20131<\/sub> is in <strong>D<\/strong><sub>\u03b2<sub><em>i<\/em>\u20131<\/sub><\/sub>(<strong><em>U<\/em><\/strong>), and we argue that \u03b2<sub><em>i<\/em>\u20131<\/sub> cannot be a limit ordinal; otherwise, since <strong>D<\/strong><sub>\u03b2<sub><em>i<\/em>\u20131<\/sub><\/sub>(<strong><em>U<\/em><\/strong>) is the union of the sets <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>) with \u03b2&lt;\u03b2<sub><em>i<\/em>\u20131<\/sub>, <em>U<\/em><sub><em>i<\/em>\u20131<\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em>\u20131<\/sub> would be in <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>) for some \u03b2&lt;\u03b2<sub><em>i<\/em>\u20131<\/sub>, contradicting the fact that \u03b2<sub><em>i<\/em>\u20131<\/sub> is the least ordinal \u03b2 such that <em>U<\/em><sub><em>i<\/em>\u20131<\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em>\u20131<\/sub> is in <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>).  Therefore \u03b2<sub><em>i<\/em>\u20131<\/sub> is a successor ordinal, say \u03b2+1, and <em>U<\/em><sub><em>i<\/em>\u20131<\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em>\u20131<\/sub> is obtained as a C-supremum of rectangles in <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>).  There are two cases: either <em>U<\/em><sub><em>i<\/em>\u20131<\/sub> is a union of open sets <em>U&#8217;<\/em><sub><em>j<\/em><\/sub> (<em>j<\/em> \u2208 <em>J<\/em>) such that each rectangle <em>U&#8217;<\/em><sub><em>j<\/em><\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em>\u20131<\/sub> is in <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>), or <em>V<\/em><sub><em>i<\/em>\u20131<\/sub> is a union of open sets <em>V&#8217;<sub>j<\/sub><\/em> (<em>j<\/em> \u2208 <em>J<\/em>) such that each rectangle <em>U<\/em><sub><em>i<\/em>\u20131<\/sub> \u2297 <em>V&#8217;<sub>j<\/sub><\/em> is in <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>).<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>In the first case, once player I has picked a point <em>x<sub>i<\/sub><\/em> \u2208 <em>U<\/em><sub><em>i<\/em>\u20131<\/sub>, player II will play some <em>U&#8217;<\/em><sub><em>j<\/em><\/sub> that contains <em>x<sub>i<\/sub><\/em> for <em>U<\/em><sub><em>i<\/em><\/sub>; player I picks a point <em>y<sub>i<\/sub><\/em> \u2208 <em>V<\/em><sub><em>i<\/em>\u20131<\/sub>, and player II simply plays <em>V<\/em><sub><em>i<\/em>\u20131<\/sub> for <em>V<\/em><sub><em>i<\/em><\/sub>.  Since <em>U<\/em><sub><em>i<\/em><\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em><\/sub> = <em>U&#8217;<\/em><sub><em>j<\/em><\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em>\u20131<\/sub> is in <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>), it has rank \u03b2<sub><em>i<\/em><\/sub>\u2264\u03b2&lt;\u03b2<sub><em>i<\/em>\u20131<\/sub>.<\/li>\n\n\n\n<li>In the second case, player I picks a point <em>x<sub>i<\/sub><\/em> \u2208 <em>U<\/em><sub><em>i<\/em>\u20131<\/sub>, player II plays <em>U<\/em><sub><em>i<\/em>\u20131<\/sub> for <em>U<\/em><sub><em>i<\/em><\/sub>, then player I picks a point <em>y<sub>i<\/sub><\/em> \u2208 <em>V<\/em><sub><em>i<\/em>\u20131<\/sub>, and player II plays some <em>V&#8217;<sub>j<\/sub><\/em> that contains <em>y<sub>i<\/sub><\/em> for <em>V<\/em><sub><em>i<\/em><\/sub>.  Since <em>U<\/em><sub><em>i<\/em><\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em><\/sub> = <em><em>U<\/em><sub><em>i<\/em><\/sub><\/em><sub>\u20131<\/sub> \u2297 <em>V&#8217;<sub>j<\/sub><\/em> is in <strong>D<\/strong><sub>\u03b2<\/sub>(<strong><em>U<\/em><\/strong>), it has rank \u03b2<sub><em>i<\/em><\/sub>\u2264\u03b2&lt;\u03b2<sub><em>i<\/em>\u20131<\/sub>.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">Since there is no infinite strictly decreasing sequence of ordinals, player II will eventually win.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Player I wins if \u03b8 : <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) \u2247 Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>)<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">If \u03b8 is not an order-isomorphism, namely if it is not surjective, then by Lemma B, there is a way of choosing <em>U<\/em><sub>0<\/sub>, <em>V<\/em><sub>0<\/sub>, and an open cover <strong><em>U<\/em><\/strong> of <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> in such a way that <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>) does not contain <em>U<\/em><sub>0<\/sub> \u2297 <em><em>V<\/em><\/em><sub>0<\/sub>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We verify that player I wins, whatever strategy player II uses.  To this end, we will maintain the invariant that, at round <em>i<\/em>, <em>U<\/em><sub><em>i<\/em><\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em><\/sub> is not in <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>).  This is certainly true when <em>i<\/em>=0.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">When <em>i<\/em>\u22651, the invariant at round <em>i<\/em>\u20131 tells us that <em>U<\/em><sub><em>i<\/em>\u20131<\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em>\u20131<\/sub> is not in <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>).<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>If we could find an open neighborhood <em>U&#8217;<\/em><sub><em>x<\/em><\/sub> of every point <em>x<\/em> in <em>U<\/em><sub><em>i<\/em>\u20131<\/sub> such that <em>U&#8217;<\/em><sub><em>x<\/em><\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em>\u20131<\/sub> were in <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>), then <em>U<\/em><sub><em>i<\/em>\u20131<\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em>\u20131<\/sub> would be a C-supremum of the rectangles <em>U&#8217;<\/em><sub><em>x<\/em><\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em>\u20131<\/sub> where <em>x<\/em> ranges over <em>U<\/em><sub><em>i<\/em>\u20131<\/sub>, hence would be in <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>).  Therefore there is a point <em>x<\/em> in <em>U<\/em><sub><em>i<\/em>\u20131<\/sub>\u2014we pick one, call it <em>x<sub>i<\/sub><\/em>, and this is the point that player I plays\u2014such that whatever open neighborhood <em>U<\/em><sub><em>i<\/em><\/sub> of <em>x<sub>i<\/sub><\/em> included in <em>U<\/em><sub><em>i<\/em>\u20131<\/sub> is played next by player II, <em>U<\/em><sub><em>i<\/em><\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em>\u20131<\/sub> is still not in <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>).<\/li>\n\n\n\n<li>By a similar argument, if we could find an open neighborhood <em>V&#8217;<\/em><sub><em>y<\/em><\/sub> of every point <em>y<\/em> in <em>V<\/em><sub><em>i<\/em>\u20131<\/sub> such that <em>U<\/em><sub><em>i<\/em><\/sub> \u2297 <em>V&#8217;<\/em><sub><em>y<\/em><\/sub> were in <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>), then <em>U<\/em><sub><em>i<\/em><\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em>\u20131<\/sub> would be a C-supremum of the rectangles <em>U<\/em><sub><em>i<\/em><\/sub> \u2297 <em>V&#8217;<\/em><sub><em>y<\/em><\/sub> where <em>y<\/em> ranges over <em>V<\/em><sub><em>i<\/em>\u20131<\/sub>, hence would be in <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>). Therefore there is a point <em>y<\/em> in <em>V<\/em><sub><em>i<\/em>\u20131<\/sub>\u2014we pick one, call it <em>y<sub>i<\/sub><\/em>, and this is the point that player I plays\u2014such that whatever open neighborhood <em>V<\/em><sub><em>i<\/em><\/sub> of <em>y<sub>i<\/sub><\/em> included in <em>V<\/em><sub><em>i<\/em>\u20131<\/sub> is played next by player II, <em>U<\/em><sub><em>i<\/em>\u20131<\/sub> \u2297 <em><em>V<\/em><\/em><sub><em>i<\/em>\u20131<\/sub> is still not in <strong>D<\/strong><sub>\u221e<\/sub>(<strong><em>U<\/em><\/strong>).<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">Since the game goes on forever, player I wins the game.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">This concludes the proof of the theorem, which we now recall.  As we have seen, the proof is really a rephrasing in game-theoretic terms of a construction of the suprema of rectangles in Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) by ordinal induction.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Theorem.<\/strong> (Repeated from earlier in this post.)  For any two topological spaces <em>X<\/em> and <em>Y<\/em>, exactly one of the following mutually exclusive alternatives much occur:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>\u03b8 is an order-isomorphism of <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) onto Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>), and for every open subset <em>U<\/em><sub>0<\/sub> of <em>X<\/em>, for every open subset <em>V<\/em><sub>0<\/sub> of <em>Y<\/em>, for every open cover <strong><em>U<\/em><\/strong> of <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> by open rectangles, player II has a winning strategy in the game <em>G<\/em><sub><em>X<\/em>,<em>Y<\/em><\/sub>(<em>U<\/em><sub>0<\/sub>, <em>V<\/em><sub>0<\/sub>, <strong><em>U<\/em><\/strong>);<\/li>\n\n\n\n<li>or \u03b8 is not an order-isomorphism\u2014in fact, \u03b8 is not surjective from <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) to Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>)\u2014and there are an open subset <em>U<\/em><sub>0<\/sub> of <em>X<\/em>, an open subset <em>V<\/em><sub>0<\/sub> of <em>Y<\/em>, and an open cover <strong><em>U<\/em><\/strong> of <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> by open rectangles such that player I has a winning strategy in the game <em>G<\/em><sub><em>X<\/em>,<em>Y<\/em><\/sub>(<em>U<\/em><sub>0<\/sub>, <em>V<\/em><sub>0<\/sub>, <strong><em>U<\/em><\/strong>).<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Spatiality of products<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">Before I give a few applications of this result, let me notice that Plewe&#8217;s theorem is not about \u03b8 being an order-isomorphism or not, and rather is about whether Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) is a spatial frame or not; in other words whether there <em>exists<\/em> an order-isomorphism between <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) and Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) at all.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">But that is equivalent.  One can find the argument (for arbitrary products of sober spaces) in [6, Proposition IV-5.4.2].  I will give a proof below; it is somewhat tricky, and I will stress the tricky parts.  The point is not so much in showing that if Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) is spatial then it must be order-isomorphic to <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>), but to show that the order-isomorphism in question must be \u03b8.  By the way, the assumption that <em>X<\/em> and <em>Y<\/em> are sober is useless (as we will show during the course of the proof), so we will drop it.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Lemma C.<\/strong>  For all topological spaces <em>X<\/em> and <em>Y<\/em>, Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) is spatial if and only if \u03b8 is an order-isomorphism, if and only if \u03b8 is surjective.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><em>Proof.<\/em>  If \u03b8 is surjective, or equivalently an order-isomorphism, then <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) \u2245 Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>), so Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) is spatial.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Conversely, let us assume that <em>L<\/em> \u225d Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) is spatial.  We can assume that <em>X<\/em> and <em>Y<\/em> are sober, otherwise we replace <em>X<\/em> with its sobrification <strong>S<\/strong>(<em>X<\/em>), and similarly with <em>Y<\/em>.  Indeed, <em>X<\/em> and <strong>S<\/strong>(<em>X<\/em>) have isomorphic lattices of open sets (Lemma 8.2.26  in the&nbsp;<a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>) and <strong>S<\/strong>(<em>X<\/em>) is sober (Corollary 8.2.23), and similarly with <em>Y<\/em>; also, <strong>S<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) is isomorphic to <strong>S<\/strong>(<em>X<\/em>) \u00d7 <strong>S<\/strong>(<em>Y<\/em>) (Theorem 8.4.8).  Hence, if we prove that \u03b8 is surjective from <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) to Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) for all sober spaces <em>X<\/em> and <em>Y<\/em>, then the corresponding map from <strong>O<\/strong>(<strong>S<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>)) to Gal(<strong>O<\/strong>(<strong>S<\/strong>(<em>X<\/em>)), <strong>O<\/strong>(<strong>S<\/strong>(<em>Y<\/em>))) will be surjective for all spaces <em>X<\/em> and<em> Y<\/em> (not necessarily sober), and therefore also \u03b8 itself, from <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) to Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>).  In any case, we will therefore assume, without loss of generality, that <em>X<\/em> and <em>Y<\/em> are sober.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">There is an adjunction <strong>O<\/strong> \u22a3 <strong>pt<\/strong> (Theorem 8.1.26 in the&nbsp;<a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>) between <strong>Top<\/strong> and <strong>Frm<\/strong><sup>op<\/sup>, and with unit \u03b7<sup>Stone<\/sup> and counit \u03b5<sup>Stone<\/sup>; we will not need to know how they are defined.  By Proposition 8.1.17 of the&nbsp;<a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>, the fact that <em>L<\/em> is spatial is equivalent to the fact that \u03b5<sub><em>L<\/em><\/sub><sup>Stone<\/sup> : <em>L<\/em> \u2192 <strong>O<\/strong>(<strong>pt<\/strong>(<em>L<\/em>)) is an order-isomorphism.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We use the fact that <em>L<\/em>=Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) is the coproduct of <strong>O<\/strong><em>X<\/em> and <strong>O<\/strong><em>Y<\/em> in <strong>Frm<\/strong>, with canonical injections \u03b9<em><sub>X<\/sub><\/em> : <strong>O<\/strong><em>X<\/em> \u2192 <em>L<\/em> mapping every open subset <em>U<\/em> of <em>X<\/em> to <em>U<\/em> \u2297 <em>Y<\/em> and \u03b9<em><sub>Y<\/sub><\/em> : <strong>O<\/strong><em>Y<\/em> \u2192 <em>L<\/em> mapping every open subset <em>V<\/em> of <em>Y<\/em> to <em>X<\/em> \u2297 <em>V<\/em> (Exercise 8.4.28), and we will use this to show that <strong>pt<\/strong>(<em>L<\/em>) is (homeomorphic to) the product of <em>X<\/em> and <em>Y<\/em> in <strong>Top<\/strong>.  We need to make the homeomorphism explicit, too: we will use it to show that <strong>O<\/strong> applied to that homeomorphism (and composed with the inverse of \u03b5<sup>Stone<\/sup>) is exactly \u03b8, and that is how we will obtain that \u03b8 is an order-isomorphism.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Passing to opposite categories, <em>L<\/em>=Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) is the product of <strong>O<\/strong><em>X<\/em> and <strong>O<\/strong><em>Y<\/em> in <strong>Frm<\/strong><sup>op<\/sup>.  Since right adjoints preserve all limits, hence all products, <strong>pt<\/strong>(<em>L<\/em>) is a product of <strong>pt<\/strong>(<strong>O<\/strong>(<em>X<\/em>)) and <strong>pt<\/strong>(<strong>O<\/strong>(<em>Y<\/em>)) in <strong>Top<\/strong>, with canonical projections <strong>pt<\/strong>(\u03b9<em><sub>X<\/sub><\/em>) : <strong>pt<\/strong>(<em>L<\/em>) \u2192 <strong>pt<\/strong>(<strong>O<\/strong>(<em>X<\/em>)) and <strong>pt<\/strong>(\u03b9<em><sub>Y<\/sub><\/em>) : <strong>pt<\/strong>(<em>L<\/em>) \u2192 <strong>pt<\/strong>(<strong>O<\/strong>(<em>Y<\/em>)).<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Since <em>X<\/em> is sober, the map \u03b7<sub><em>X<\/em><\/sub><sup>Stone<\/sup> : <em>X<\/em> \u2192 <strong>pt<\/strong>(<strong>O<\/strong>(<em>X<\/em>)) is a homeomorphism (Proposition 8.2.22), and similarly with <em>Y<\/em>.  Therefore <strong>pt<\/strong>(<em>L<\/em>) is also a product of <em>X<\/em> and <em>Y<\/em> in <strong>Top<\/strong>, with canonical projections (\u03b7<sub><em>X<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> o <strong>pt<\/strong>(\u03b9<em><sub>X<\/sub><\/em>) : <strong>pt<\/strong>(<em>L<\/em>) \u2192 <em>X<\/em> and (\u03b7<sub><em>Y<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> o <strong>pt<\/strong>(\u03b9<em><sub>Y<\/sub><\/em>) : <strong>pt<\/strong>(<em>L<\/em>) \u2192 <em>Y<\/em>.  But we have another product, namely <em>X<\/em> \u00d7 <em>Y<\/em>, so the pairing \u3008(\u03b7<sub><em>X<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> o <strong>pt<\/strong>(\u03b9<em><sub>X<\/sub><\/em>), (\u03b7<sub><em>Y<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> o <strong>pt<\/strong>(\u03b9<em><sub>Y<\/sub><\/em>)\u3009 : <strong>pt<\/strong>(<em>L<\/em>) \u2192 <em>X<\/em> \u00d7 <em>Y<\/em> is a homeomorphism.  <\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We apply the <strong>O<\/strong> functor, and we obtain that <strong>O<\/strong> \u3008(\u03b7<sub><em>X<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> o <strong>pt<\/strong>(\u03b9<em><sub>X<\/sub><\/em>), (\u03b7<sub><em>Y<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> o <strong>pt<\/strong>(\u03b9<em><sub>Y<\/sub><\/em>)\u3009 : <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) \u2192 <strong>O<\/strong>(<strong>pt<\/strong>(<em>L<\/em>)) is an order-isomorphism.  Therefore (\u03b5<sub><em>L<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> o <strong>O<\/strong> \u3008(\u03b7<sub><em>X<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> o <strong>pt<\/strong>(\u03b9<em><sub>X<\/sub><\/em>), (\u03b7<sub><em>Y<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> o <strong>pt<\/strong>(\u03b9<em><sub>Y<\/sub><\/em>)\u3009 : <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) \u2192 <em>L<\/em> is also an order-isomorphism.  We claim that this order-isomorphism\u2014call it \u03f4 for short\u2014is nothing else than \u03b8.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">In order to see this, one would like to apply both \u03f4 and \u03b8 to open rectangles <em>U<\/em> \u00d7 <em>V<\/em>, and to check whether we get the same values.  One would be tempted to say that this is enough because every element of <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) is a union of open rectangles, and because both \u03f4 and \u03b8 are frame homomorphisms, but the latter claim is incorrect.  \u03f4 is a frame homomorphism, but we do not know that much about \u03b8 (that is largely what we are trying to prove, in fact), and in particular we do not know whether \u03b8 preserves suprema.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Still, it is a good idea to apply \u03f4 to open rectangles <em>U<\/em> \u00d7 <em>V<\/em>, and to see what we get.  Let us write <em>p<sub>X<\/sub><\/em> : <em><em>X<\/em> \u00d7 <em>Y<\/em><\/em> \u2192 <em>X<\/em> and <em>p<sub>Y<\/sub><\/em> : <em><em>X<\/em> \u00d7 <em>Y<\/em><\/em> \u2192 <em>Y<\/em> for the canonical projections.  Then <em>U<\/em> \u00d7 <em>V<\/em> = <em>p<sub>X<\/sub><\/em><sup>\u20131<\/sup>(<em>U<\/em>) \u2229 <em>p<sub>Y<\/sub><\/em><sup>\u20131<\/sup>(<em>V<\/em>), and \u03f4(<em>U<\/em> \u00d7 <em>V<\/em>) = \u03f4(<em>p<sub>X<\/sub><\/em><sup>\u20131<\/sup>(<em>U<\/em>)) \u2229 \u03f4(<em>p<sub>Y<\/sub><\/em><sup>\u20131<\/sup>(<em>V<\/em>)).  We concentrate on the computation of \u03f4(<em>p<sub>X<\/sub><\/em><sup>\u20131<\/sup>(<em>U<\/em>)), since \u03f4(<em>p<sub>Y<\/sub><\/em><sup>\u20131<\/sup>(<em>V<\/em>)) will be obtained in a symmetric way.  We have:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>\u03f4(<em>p<sub>X<\/sub><\/em><sup>\u20131<\/sup>(<em>U<\/em>)) = \u03f4(<strong>O<\/strong>(<em>p<sub>X<\/sub><\/em>)(<em>U<\/em>))<\/li>\n\n\n\n<li>= (\u03b5<sub><em>L<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> [ <strong>O<\/strong> \u3008(\u03b7<sub><em>X<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> o <strong>pt<\/strong>(\u03b9<em><sub>X<\/sub><\/em>), (\u03b7<sub><em>Y<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> o <strong>pt<\/strong>(\u03b9<em><sub>Y<\/sub><\/em>)\u3009 [<strong>O<\/strong>(<em>p<sub>X<\/sub><\/em>)(<em>U<\/em>)] ] by definition of \u03f4<\/li>\n\n\n\n<li>= (\u03b5<sub><em>L<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> [ <strong>O<\/strong> (<em>p<sub>X<\/sub><\/em> o \u3008(\u03b7<sub><em>X<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> o <strong>pt<\/strong>(\u03b9<em><sub>X<\/sub><\/em>), (\u03b7<sub><em>Y<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> o <strong>pt<\/strong>(\u03b9<em><sub>Y<\/sub><\/em>)\u3009) [<em>U<\/em>] ] since <strong>O<\/strong> is a (contravariant) functor<\/li>\n\n\n\n<li>= (\u03b5<sub><em>L<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> [ <strong>O<\/strong> ((\u03b7<sub><em>X<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> o <strong>pt<\/strong>(\u03b9<em><sub>X<\/sub><\/em>)) (<em>U<\/em>) ] using the law <em>p<sub>X<\/sub><\/em> o \u3008<em>a<\/em>, <em>b<\/em>\u3009 = <em>a<\/em>.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">One of the coherence diagrams for adjunctions (see Section 5.5.2 in the&nbsp;<a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>, and taking into account the fact that <strong>O<\/strong> is contravariant) is that <strong>O<\/strong>(\u03b7<sub><em>X<\/em><\/sub><sup>Stone<\/sup>) o \u03b5<sub><strong>O<\/strong><em>X<\/em><\/sub><sup>Stone<\/sup> = id<sub><strong>O<\/strong><em>X<\/em><\/sub>, so <strong>O<\/strong> ((\u03b7<sub><em>X<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup>) = \u03b5<sub><strong>O<\/strong><em>X<\/em><\/sub><sup>Stone<\/sup>.  Therefore <strong>O<\/strong> ((\u03b7<sub><em>X<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> o <strong>pt<\/strong>(\u03b9<em><sub>X<\/sub><\/em>)) = <strong>O<\/strong>(<strong>pt<\/strong>(\u03b9<em><sub>X<\/sub><\/em>)) o <strong>O<\/strong> ((\u03b7<sub><em>X<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup>) = <strong>O<\/strong>(<strong>pt<\/strong>(\u03b9<em><sub>X<\/sub><\/em>)) o \u03b5<sub><strong>O<\/strong><em>X<\/em><\/sub><sup>Stone<\/sup>, and that is equal to \u03b5<sub><em>L<\/em><\/sub><sup>Stone<\/sup> o \u03b9<em><sub>X<\/sub><\/em>, by the naturality of \u03b5<sup>Stone<\/sup>. Hence <strong>O<\/strong> ((\u03b7<sub><em>X<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup> o <strong>pt<\/strong>(\u03b9<em><sub>X<\/sub><\/em>)) (<em>U<\/em>) = (\u03b5<sub><em>L<\/em><\/sub><sup>Stone<\/sup> o \u03b9<em><sub>X<\/sub><\/em>) (<em>U<\/em>) = \u03b5<sub><em>L<\/em><\/sub><sup>Stone<\/sup> (<em>U<\/em> \u2297 <em>Y<\/em>) (by definition of \u03b9<em><sub>X<\/sub><\/em>).<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We apply (\u03b5<sub><em>L<\/em><\/sub><sup>Stone<\/sup>)<sup>\u20131<\/sup>, and therefore \u03f4(<em>p<sub>X<\/sub><\/em><sup>\u20131<\/sup>(<em>U<\/em>)) = <em>U<\/em> \u2297 <em>Y<\/em>.  Symmetrically, \u03f4(<em>p<sub>Y<\/sub><\/em><sup>\u20131<\/sup>(<em>V<\/em>)) = <em>X<\/em> \u2297 <em>V<\/em>, so \u03f4(<em>U<\/em> \u00d7 <em>V<\/em>) = \u03f4(<em>p<sub>X<\/sub><\/em><sup>\u20131<\/sup>(<em>U<\/em>)) \u2229 \u03f4(<em>p<sub>Y<\/sub><\/em><sup>\u20131<\/sup>(<em>V<\/em>)) = (<em>U<\/em> \u2297 <em>Y<\/em>) \u2229 (<em>X<\/em> \u2297 <em>V<\/em>), and that is equal to (<em>U<\/em> \u2229 <em>X<\/em>) \u2297 (<em>Y<\/em> \u2229 <em>V<\/em>) by Lemma 8.4.24 in the&nbsp;<a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>, hence to <em>U<\/em> \u2297 <em>V<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">For every open subset <em>W<\/em> of <em>X<\/em> \u00d7 <em>Y<\/em>, we remember that \u03b8(<em>W<\/em>) = (\u03b1<em><sub>W<\/sub><\/em>, \u03b3<em><sub>W<\/sub><\/em>), just like any element of <em>L<\/em>=Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>), is the (pointwise) supremum of all the rectangles <em>U<\/em> \u2297 <em>V<\/em> below it.  Now <em>U<\/em> \u2297 <em>V<\/em> is below (\u03b1<em><sub>W<\/sub><\/em>, \u03b3<em><sub>W<\/sub><\/em>) if and only if <em>V<\/em> \u2286 \u03b1<em><sub>W<\/sub><\/em>(<em>U<\/em>), if and only if <em>U<\/em> \u00d7 <em>V<\/em> \u2286 <em>W<\/em>.  Therefore \u03b8(<em>W<\/em>) is the supremum of all the rectangles <em>U<\/em> \u2297 <em>V<\/em> = \u03f4(<em>U<\/em> \u00d7 <em>V<\/em>), where <em>U<\/em> \u00d7 <em>V<\/em> ranges over the open rectangles included in <em>W<\/em>.  Since \u03f4 preserves suprema, it follows that \u03b8(<em>W<\/em>)=\u03f4(<em>W<\/em>).  (Notice how we never assumed that \u03b8 preserves suprema.  We have just recalled that every Galois connection is a supremum of rectangles, and we have looked at what it means for a rectangle to be below a Galois connection of the form (\u03b1<em><sub>W<\/sub><\/em>, \u03b3<em><sub>W<\/sub><\/em>).)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">At any rate, we have just proved that \u03b8=\u03f4.  Since \u03f4 is an order-isomorphism, so is \u03b8.  (And, yes, now at last we know that \u03b8 preserves suprema!)    \u2610<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Hence we obtain the final form of Plewe&#8217;s theorem.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Theorem (Plewe).<\/strong>  For any two topological spaces <em>X<\/em> and <em>Y<\/em>, exactly one of the following mutually exclusive alternatives much occur:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) is spatial, \u03b8 is an order-isomorphism of <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) onto Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>), and for every open subset <em>U<\/em><sub>0<\/sub> of <em>X<\/em>, for every open subset <em>V<\/em><sub>0<\/sub> of <em>Y<\/em>, for every open cover <strong><em>U<\/em><\/strong> of <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> by open rectangles, player II has a winning strategy in the game <em>G<\/em><sub><em>X<\/em>,<em>Y<\/em><\/sub>(<em>U<\/em><sub>0<\/sub>, <em>V<\/em><sub>0<\/sub>, <strong><em>U<\/em><\/strong>);<\/li>\n\n\n\n<li>or Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) is not spatial, \u03b8 is not an order-isomorphism\u2014in fact, \u03b8 is not surjective from <strong>O<\/strong>(<em>X<\/em> \u00d7 <em>Y<\/em>) to Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>)\u2014and there are an open subset <em>U<\/em><sub>0<\/sub> of <em>X<\/em>, an open subset <em>V<\/em><sub>0<\/sub> of <em>Y<\/em>, and an open cover <strong><em>U<\/em><\/strong> of <em>U<\/em><sub>0<\/sub> \u00d7 <em><em>V<\/em><\/em><sub>0<\/sub> by open rectangles such that player I has a winning strategy in the game <em>G<\/em><sub><em>X<\/em>,<em>Y<\/em><\/sub>(<em>U<\/em><sub>0<\/sub>, <em>V<\/em><sub>0<\/sub>, <strong><em>U<\/em><\/strong>).<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Applications<\/h2>\n\n\n\n<h3 class=\"wp-block-heading\">1. The localic product of <em>S<\/em><sub>0<\/sub> with itself is not spatial <\/h3>\n\n\n\n<p class=\"wp-block-paragraph\">A first, direct application is Matthew de Brecht&#8217;s proof that the localic product of <em>S<\/em><sub>0<\/sub> with itself is not spatial [7].  In other words, using Lemma C, that \u03b8 is not an order-isomorphism <strong>O<\/strong>(<em>S<\/em><sub>0<\/sub> \u00d7 <em>S<\/em><sub>0<\/sub>) onto Gal(<strong>O<\/strong><em>S<\/em><sub>0<\/sub>, <strong>O<\/strong><em>S<\/em><sub>0<\/sub>).  Indeed, <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=6249\" data-type=\"page\" data-id=\"6249\">last time<\/a>, we have seen that <em>S<\/em><sub>0<\/sub> is not consonant, and more specifically that player I has a winning strategy in the game <em>G<\/em><sub><em>X<\/em>,<em>X<\/em><\/sub>(<em>X<\/em>, <em>X<\/em>, <strong><em>U<\/em><\/strong>), for some open cover <strong><em>U<\/em><\/strong> of <em>X<\/em> \u00d7 <em>X<\/em> (with <em>X<\/em> \u225d <em>S<\/em><sub>0<\/sub>).  Plewe&#8217;s theorem tells us immediately that \u03b8 is not an order-isomorphism, and therefore the localic product of <em>S<\/em><sub>0<\/sub> by itself is not spatial.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\">2. The localic product of <strong>Q<\/strong> with <strong>R<\/strong>\u2013<strong>Q<\/strong> is not spatial <\/h3>\n\n\n\n<p class=\"wp-block-paragraph\">In a <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=1224\">2017 post<\/a>, I had argued that, given any non-empty T<sub>2<\/sub> topological space <em>Z<\/em> with two disjoint, dense subsets <em>X<\/em> and <em>Y<\/em>, Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) is not spatial (and \u03b8 does not preserve suprema).  This is due to J. Isbell [3].  Plewe says that this can be seen using his game (Section of [2], final paragraph); and it ought to, since the game entirely characterizes the cases where Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) is spatial.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">One trick that makes this work is the following equivalence.  I feel that it ought to be written explicitly, otherwise Plewe&#8217;s description of the game in this setting remains somewhat mysterious.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Fact D.<\/strong>  For any two subsets <em>U<\/em> and <em>V<\/em> of a topological space <em>Z<\/em>, <em>U<\/em> intersects int(cl(<em>V<\/em>)) if and only if <em>V<\/em> intersects int(cl(<em>U<\/em>)).<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Here int and cl are interior and closure in <em>Z<\/em>, respectively.  (<em>U<\/em> and <em>V<\/em> will be open subsets in <em>X<\/em> and in <em>Y<\/em> respectively below, but are not open in <em>Z<\/em>.)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><em>Proof.<\/em>  Let us write \u00ac for the &#8220;interior of complement&#8221; operator.  The point is that <strong>O<\/strong><em>Z<\/em> is a frame, hence a complete Heyting algebra, and \u00ac<em>A<\/em> stands for <em>A<\/em> \u21d2 \u22a5, where \u21d2 is the residuation operator (intuitionistic implication) and \u22a5 is the bottom element (the empty set); see Exercise 8.1.6 in the&nbsp;<a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>.  This allows us to reason in intuitionistic logic, with \u22c1 (&#8220;or&#8221;) being union and \u22c0 (&#8220;and&#8221;) being intersection, while \u2264 (&#8220;consequence&#8221;) is inclusion.  The double negation operator \u00ac\u00ac coincides with int(cl(_)), and therefore the claim amounts to the fact that <em>U<\/em> \u22c0 \u00ac\u00ac<em>V<\/em> \u2260 \u22a5 if and only if <em>V<\/em> \u22c0 \u00ac\u00ac<em>U<\/em> \u2260 \u22a5.  By taking negations, and realizing that being equal to \u22a5 is equivalent to being \u2264 \u22a5, we must show that <em>U<\/em> \u22c0 \u00ac\u00ac<em>V<\/em> \u2264 \u22a5 if and only if <em>V<\/em> \u22c0 \u00ac\u00ac<em>U<\/em> \u2264 \u22a5.  By symmetry, it suffices to show that <em>U<\/em> \u22c0 \u00ac\u00ac<em>V<\/em> \u2264 \u22a5 implies <em>V<\/em> \u22c0 \u00ac\u00ac<em>U<\/em> \u2264 \u22a5.  If <em>U<\/em> \u22c0 \u00ac\u00ac<em>V<\/em> \u2264 \u22a5, then \u00ac\u00ac<em>V<\/em> \u2264 \u00ac<em>U<\/em>, by definition of residuation.  Since negation is antitonic, it follows that \u00ac\u00ac<em>U<\/em> \u2264 \u00ac\u00ac\u00ac<em>V<\/em>.  But \u00ac\u00ac\u00ac<em>V<\/em> = \u00ac<em>V<\/em> (Exercise 8.1.6, item (iv)), so \u00ac\u00ac<em>U<\/em> \u2264 \u00ac<em>V<\/em>.  By definition of residuation, <em>V<\/em> \u22c0 \u00ac\u00ac<em>U<\/em> \u2264 \u22a5.  \u2610<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We come back to the case where <em>X<\/em> and <em>Y<\/em> are two disjoint dense subsets of a non-empty T<sub>2<\/sub> topological space <em>Z<\/em>.  We recall that a regular open subset of <em>Z<\/em> is an open subset <em>U&#8217;<\/em> such that <em>U&#8217;<\/em> = int(cl(<em>U&#8217;<\/em>)), namely such that <em>U&#8217;<\/em> = \u00ac\u00ac<em>U&#8217;<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We play <em>G<\/em><sub><em>X<\/em>,<em>Y<\/em><\/sub>(<em>U<\/em><sub>0<\/sub>, <em>V<\/em><sub>0<\/sub>, <strong><em>U<\/em><\/strong>) where <em>U<\/em><sub>0<\/sub>\u225d<em>X<\/em>, <em>V<\/em><sub>0<\/sub>\u225d<em>Y<\/em>, and <strong><em>U<\/em><\/strong> is the open cover of <em>X<\/em> \u00d7 <em>Y<\/em> consisting of all the open rectangles (<em>U&#8217;<\/em> \u2229 <em>X<\/em>) \u00d7 (<em>V&#8217;<\/em> \u2229 <em>Y<\/em>), where <em>U&#8217;<\/em> and <em>V&#8217;<\/em> range over pairs of disjoint regular open subsets of <em>Z<\/em>.  (Plewe seems to have forgotten to say &#8220;regular&#8221; here.)  This is a cover, because any two distinct points of a T<sub>2<\/sub> space, in particular a point in <em>X<\/em> and a point in <em>Y<\/em>, can be separated by two disjoint regular open neighborhoods.  (We have seen this in the <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=1224\">2017 post<\/a> mentioned above.)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We will maintain the invariant that <em>U<\/em><sub><em>i<\/em><\/sub> intersects int(cl(<em>V<\/em><sub><em>i<\/em><\/sub>)), or equivalently (by Fact D) that <em>V<\/em><sub><em>i<\/em><\/sub> intersects int(cl(<em>U<\/em><sub><em>i<\/em><\/sub>)).  That is true for <em>i<\/em>=0, since by density int(cl(<em>V<\/em><sub>0<\/sub>)) = int(<em>Z<\/em>)=<em>Z<\/em> and <em>U<\/em><sub>0<\/sub>=<em>X<\/em>, so <em>U<\/em><sub>0<\/sub> \u2229 int(cl(<em>V<\/em><sub>0<\/sub>)) = <em>X<\/em> is non-empty, since it is a dense subset of a non-empty space.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">This invariant has the consequence that player II cannot win at round <em>i<\/em>.  Indeed, if <em>U<\/em><sub><em>i<\/em><\/sub> \u00d7 <em>V<\/em><sub><em>i<\/em><\/sub> were included in (<em>U&#8217;<\/em> \u2229 <em>X<\/em>) \u00d7 (<em>V&#8217;<\/em> \u2229 <em>Y<\/em>) where <em>U&#8217;<\/em> and <em>V&#8217;<\/em> are regular open and disjoint, then we would have <em>U<\/em><sub><em>i<\/em><\/sub> \u2286 <em>U&#8217;<\/em> \u2229 <em>X<\/em> and <em>V<\/em><sub><em>i<\/em><\/sub> \u2286 <em>V&#8217;<\/em> \u2229 <em>Y<\/em> (because neither <em>U<\/em><sub><em>i<\/em><\/sub> nor <em>V<\/em><sub><em>i<\/em><\/sub> is empty, since <em>U<\/em><sub><em>i<\/em><\/sub> intersects int(cl(<em>V<\/em><sub><em>i<\/em><\/sub>))); hence int(cl(<em>V<\/em><sub><em>i<\/em><\/sub>)) \u2286 int(cl(<em>V&#8217;<\/em>)) = <em>V&#8217;<\/em> (this is where we need <em>V&#8217;<\/em> to be regular), and that implies that the non-empty set <em>U<\/em><sub><em>i<\/em><\/sub> \u2229 int(cl(<em>V<\/em><sub><em>i<\/em><\/sub>)) would be included in <em>U&#8217;<\/em> \u2229 <em>V&#8217;<\/em>, which is empty by definition.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">In any case, at round <em>i<\/em>\u22651, we assume that <em>U<\/em><sub><em>i<\/em>\u20131<\/sub> and <em>V<\/em><sub><em>i<\/em>\u20131<\/sub> satisfy the invariant.  We let player I pick <em>x<sub>i<\/sub><\/em> \u2208 <em>U<\/em><sub><em>i<\/em>\u20131<\/sub> \u2229 int(cl(<em>V<\/em><sub><em>i<\/em>\u20131<\/sub>)).  This is possible since the invariant is precisely that <em>U<\/em><sub><em>i<\/em>\u20131<\/sub> \u2229 int(cl(<em>V<\/em><sub><em>i<\/em>\u20131<\/sub>)) is non-empty.  Now let player II play <em>U<\/em><sub><em>i<\/em><\/sub>, where <em>U<\/em><sub><em>i<\/em><\/sub> is an arbitrary open neighborhood of <em>x<\/em><sub><em>i<\/em><\/sub> in <em>X<\/em> included in <em>U<\/em><sub><em>i<\/em>\u20131<\/sub>.  Then <em>U<\/em><sub><em>i<\/em><\/sub> \u2229 int(cl(<em>V<\/em><sub><em>i<\/em>\u20131<\/sub>)) is non-empty, since it contains <em>x<sub>i<\/sub><\/em>.  By Fact D, <em>V<\/em><sub><em>i<\/em>\u20131<\/sub> \u2229 int(cl(<em>U<\/em><sub><em>i<\/em><\/sub>)) is non-empty, so we let player I pick a point <em>y<sub>i<\/sub><\/em> \u2208 <em>V<\/em><sub><em>i<\/em>\u20131<\/sub> \u2229 int(cl(<em>U<\/em><sub><em>i<\/em><\/sub>)).  Player II plays an arbitrary open neighborhood <em>V<\/em><sub><em>i<\/em><\/sub> of <em>y<sub>i<\/sub><\/em> in <em>Y<\/em> included in <em>V<\/em><sub><em>i<\/em>\u20131<\/sub>.  Then <em>V<\/em><sub><em>i<\/em><\/sub> \u2229 int(cl(<em>U<\/em><sub><em>i<\/em><\/sub>)) is non-empty, since it contains <em>y<sub>i<\/sub><\/em>.  By Fact D, this is equivalent to the fact that <em>U<\/em><sub><em>i<\/em><\/sub> \u2229 int(cl(<em>V<\/em><sub><em>i<\/em><\/sub>)) is non-empty, therefore the invariant is satisfied of <em>U<\/em><sub><em>i<\/em><\/sub> and <em>V<\/em><sub><em>i<\/em><\/sub>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We have obtained the following.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Proposition E.<\/strong>  Let <em>X<\/em> and <em>Y<\/em> are two disjoint dense subsets of a non-empty T<sub>2<\/sub> topological space <em>Z<\/em>.  Player I has a winning strategy in Plewe&#8217;s game <em>G<\/em><sub><em>X<\/em>,<em>Y<\/em><\/sub>(<em>X<\/em>, <em>Y<\/em>, <strong><em>U<\/em><\/strong>), where <strong><em>U<\/em><\/strong> is the open cover of <em>X<\/em> \u00d7 <em>Y<\/em> consisting of all the open rectangles (<em>U&#8217;<\/em> \u2229 <em>X<\/em>) \u00d7 (<em>V&#8217;<\/em> \u2229 <em>Y<\/em>), where <em>U&#8217;<\/em> and <em>V&#8217;<\/em> range over pairs of disjoint regular open subsets of <em>Z<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We note that this strategy is stationary (or positional), meaning that player I only has to look at the current values of the open sets <em>U<\/em><sub><em>i<\/em>\u20131<\/sub> and <em>V<\/em><sub><em>i<\/em>\u20131<\/sub> (or <em>U<\/em><sub><em>i<\/em><\/sub> and <em>V<\/em><sub><em>i<\/em>\u20131<\/sub>, the second time she or he plays during the same round), and not at the open sets or at the points played earlier in the game.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">By Plewe&#8217;s Theorem, we have obtained a new proof of the following result, already described in the <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=1224\">2017 post<\/a> mentioned above, and due to J. Isbell [3].<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Theorem.<\/strong>  Let <em>X<\/em> and <em>Y<\/em> are two disjoint dense subsets of a non-empty T<sub>2<\/sub> topological space <em>Z<\/em>.  Then Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>Y<\/em>) is not spatial.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">This applies notably to the case where <em>X<\/em> is the set of rational numbers, <em>Y<\/em> is the set of irrational numbers, and <em>Z<\/em> is <strong>R<\/strong>.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\">3. The localic product of <strong>Q<\/strong> with itself is not spatial&#8230; and <strong>Q<\/strong> is not consonant<\/h3>\n\n\n\n<p class=\"wp-block-paragraph\">But let&#8217;s look at another case.  That will be the last topic I will deal with this time.  Let us imagine that <em>X<\/em> and <em>Y<\/em> are, once again, two disjoint dense subsets of a non-empty T<sub>2<\/sub> topological space <em>Z<\/em>, but that, additionally, they are isomorphic.  Let <em>f<\/em> : <em>X<\/em> \u2192 <em>Y<\/em> be the isomorphism.  This is the case, for example, if <em>X<\/em> is the set <strong>Q<\/strong> of rational numbers, and <em>Y<\/em> is an isomorphic but disjoint copy of it sitting inside <strong>R<\/strong>, for example <strong>Q<\/strong>+\u221a2.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">By Proposition E, player I has a winning strategy in Plewe&#8217;s game <em>G<\/em><sub><em>X<\/em>,<em>Y<\/em><\/sub>(<em>X<\/em>, <em>Y<\/em>, <strong><em>U<\/em><\/strong>) for some open cover <strong><em>U<\/em><\/strong> of <em>X<\/em> \u00d7 <em>Y<\/em> by open rectangles.  This implies that player I also has a winning strategy in <em>G<\/em><sub><em>X<\/em>,<em>X<\/em><\/sub>(<em>X<\/em>, <em>X<\/em>, <strong><em>U&#8217;<\/em><\/strong>), where <strong><em>U&#8217;<\/em><\/strong> \u225d {<em>U&#8217;<\/em> \u00d7 <em>f<\/em><sup>\u20131<\/sup>(<em>V&#8217;<\/em>) | <em>U&#8217;<\/em> \u00d7 <em>V&#8217;<\/em> \u2208 <strong><em>U&#8217;<\/em><\/strong>}.  Explicitly, player I on <em>X<\/em> \u00d7 <em>X<\/em> simulates player I on <em>X<\/em> \u00d7 <em>Y<\/em> as follows.  In order to make things clearer, let me put primes on the names of players (I&#8217;, I&#8221;) and on the points (<em>x&#8217;<sub>i<\/sub><\/em>, <em>y&#8217;<sub>i<\/sub><\/em>) and the open sets (<em>U&#8217;<sub>i<\/sub><\/em>, <em>V&#8217;<sub>i<\/sub><\/em>) played on <em>X<\/em> \u00d7 <em>X<\/em>, while keeping the unprimed notations for the original game on <em>X<\/em> \u00d7 <em>Y<\/em>.  Initially, <em>U&#8217;<\/em><sub>0<\/sub> = <em>U<\/em><sub>0<\/sub> = <em>X<\/em> and <em>V&#8217;<\/em><sub>0<\/sub> = <em>f<\/em>[<em>V<\/em><sub>0<\/sub>] = <em>Y<\/em>.  At every round <em>i<\/em>\u22651, we are given <em>U&#8217;<sub>i<\/sub><\/em><sub>\u20131<\/sub> and <em>V&#8217;<sub>i<\/sub><\/em><sub>\u20131<\/sub>, and then player I plays as follows.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>We form <em><em>U<sub>i<\/sub><\/em><\/em><sub>\u20131<\/sub> \u225d <em>U&#8217;<sub>i<\/sub><\/em><sub>\u20131<\/sub> and <em>V<sub>i<\/sub><\/em><sub>\u20131<\/sub> \u225d <em>f<\/em><sup>\u20131<\/sup>(<em>V&#8217;<sub>i<\/sub><\/em><sub>\u20131<\/sub>), and we let player I (in the game on <em>X<\/em> \u00d7 <em>Y<\/em>) play a point <em>x<sub>i<\/sub><\/em> in <em><em>U<sub>i<\/sub><\/em><\/em><sub>\u20131<\/sub>.  (Player I only needs <em><em>U<sub>i<\/sub><\/em><\/em><sub>\u20131<\/sub> and <em>V<sub>i<\/sub><\/em><sub>\u20131<\/sub> to do so, because her or his strategy is stationary; but that is not crucial, and only serves to simplify the exposition.)  Player I&#8217; simulates that move by playing <em>x&#8217;<sub>i<\/sub><\/em> \u225d <em>x<sub>i<\/sub><\/em>.<\/li>\n\n\n\n<li>Now player II&#8217; plays an open neighborhood <em><em>U&#8217;<sub>i<\/sub><\/em><\/em> of <em>x&#8217;<sub>i<\/sub><\/em> in <em>X<\/em> included in <em>U&#8217;<sub>i<\/sub><\/em><sub>\u20131<\/sub>.  (We are not assuming that player II&#8217; plays with a stationary strategy, and she or he may look at all the previous points and open sets played during the game.)<\/li>\n\n\n\n<li>We let <em>U<sub>i<\/sub><\/em> \u225d <em>U&#8217;<sub>i<\/sub><\/em>, and we let player I play a point <em>y<sub>i<\/sub><\/em> in <em>V<sub>i<\/sub><\/em><sub>\u20131<\/sub>, given its knowledge of <em>U<sub>i<\/sub><\/em> and <em>V<sub>i<\/sub><\/em><sub>\u20131<\/sub>.  Player I&#8217; simulates that move that playing <em>y&#8217;<sub>i<\/sub><\/em> \u225d <em>f<\/em>(<em>y<sub>i<\/sub><\/em>).<\/li>\n\n\n\n<li>Player II&#8217; then plays an open neighborhood <em><em>V&#8217;<sub>i<\/sub><\/em><\/em> of <em>y&#8217;<sub>i<\/sub><\/em> in <em>Y<\/em> included in <em>V&#8217;<sub>i<\/sub><\/em><sub>\u20131<\/sub>.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">Finally, player II&#8217; wins if for some <em>i<\/em> the open rectangle <em><em>U&#8217;<sub>i<\/sub><\/em><\/em> \u00d7 <em><em>V&#8217;<sub>i<\/sub><\/em><\/em> is included in one of the open rectangles in <strong><em>U&#8217;<\/em><\/strong>, or equivalently if some open rectangle <em><em>U<sub>i<\/sub><\/em><\/em> \u00d7 <em><em>V<sub>i<\/sub><\/em><\/em> is included in one of the open rectangles in <strong><em>U<\/em><\/strong>; otherwise, player I&#8217; wins.  In particular, since player I has a winning strategy in <em>G<\/em><sub><em>X<\/em>,<em>Y<\/em><\/sub>(<em>X<\/em>, <em>Y<\/em>, <strong><em>U<\/em><\/strong>), player I&#8217; has a winning strategy in <em>G<\/em><sub><em>X<\/em>,<em>X<\/em><\/sub>(<em>X<\/em>, <em>X<\/em>, <strong><em>U&#8217;<\/em><\/strong>).<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Now, the fact that player I&#8217; has a winning strategy in <em>G<\/em><sub><em>X<\/em>,<em>X<\/em><\/sub>(<em>X<\/em>, <em>X<\/em>, <strong><em>U&#8217;<\/em><\/strong>) means <em>two<\/em> things.  By Plewe&#8217;s theorem, Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>X<\/em>) is not spatial; and by Matthew de Brecht&#8217;s theorem [1, Theorem 4], seen <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=6249\" data-type=\"page\" data-id=\"6249\">last time<\/a>, <em>X<\/em> is not consonant.  We sum this up as follows.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Theorem.<\/strong>  Let <em>X<\/em> be a space that has two isomorphic, disjoint copies as dense subsets of a non-empty T<sub>2<\/sub> topological space <em>Z<\/em>.  Then Gal(<strong>O<\/strong><em>X<\/em>, <strong>O<\/strong><em>X<\/em>) is not spatial and <em>X<\/em> is not consonant.  In particular, the localic product Gal(<strong>OQ<\/strong>, <strong>OQ<\/strong>) is not spatial, and <strong>Q<\/strong> is not consonant.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">That proof of the non-consonance of <strong>Q<\/strong> is hopefully quite a lot simpler than the one I described <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=5109\" data-type=\"page\" data-id=\"5109\">a few months ago<\/a>!  It was hinted in the following terms at the end of the introduction of [1], and must therefore be credited to Matthew de Brecht:<\/p>\n\n\n\n<blockquote class=\"wp-block-quote is-layout-flow wp-block-quote-is-layout-flow\">\n<p class=\"wp-block-paragraph\">The connection with C-ideals should make it an easy exercise for the reader to convert P. Johnstone&#8217;s proof in [11] of the non-spatiality of the localic product <strong>Q<\/strong> \u00d7<sub>loc<\/sub> <strong>Q<\/strong> into a winning strategy for the first player in G(<strong>Q<\/strong>), thereby obtaining a new proof that <strong>Q<\/strong> is dissonant.<\/p>\n<\/blockquote>\n\n\n\n<ol class=\"wp-block-list\">\n<li>Matthew de Brecht. &nbsp;<a href=\"https:\/\/www.kurims.kyoto-u.ac.jp\/~kyodo\/kokyuroku\/contents\/pdf\/2151-01.pdf\">Some results on countably based consonant spaces.<\/a>&nbsp;Recent Developments in General Topology and its Related Fields, RIMS&nbsp;K\u00f4ky\u00fbroku&nbsp;No. 2151, 2019.<\/li>\n\n\n\n<li>Till Plewe.  Localic products of spaces.  <em>Proceedings of the London Mathematical Society<\/em>, Volume s3-73, Issue 3, November 1996, pages 642\u2013678. <a href=\"https:\/\/doi.org\/10.1112\/plms\/s3-73.3.642\">https:\/\/doi.org\/10.1112\/plms\/s3-73.3.642<\/a><\/li>\n\n\n\n<li>John Isbell.&nbsp;<a href=\"https:\/\/www.jstor.org\/stable\/2044000\">Product spaces in locales<\/a>. <em>Proceedings of the American Mathematical Society<\/em>, 81(1), January 1981.<\/li>\n\n\n\n<li>Clifford Hugh Dowker and Dona Strauss.  (1976). Products and sums in the category of frames. In: Binz, E., Herrlich, H. (eds) <em>Categorical Topology<\/em>. Lecture Notes in Mathematics, vol 540. Springer, Berlin, Heidelberg, 1976, pages 208\u2013219. <a href=\"https:\/\/link.springer.com\/chapter\/10.1007\/BFb0080860\">https:\/\/doi.org\/10.1007\/BFb0080860<\/a><\/li>\n\n\n\n<li>David Wigner.  <a href=\"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/A3657BDE423A729E956494385B010F97\/S1446788700012209a.pdf\/two-notes-on-frames.pdf\">Two notes on frames<\/a>.  <em>Journal of the&nbsp;Australian&nbsp;Mathematical Society<\/em> (Series A), Volume 28, 1979, page 257\u2013268.<\/li>\n\n\n\n<li>Jorge Picado and Ale\u0161 Pultr. Frames and locales \u2014 topology without points. Birkh\u00e4user, 2010.<\/li>\n\n\n\n<li>Matthew de Brecht.  &nbsp;<a href=\"https:\/\/www.i.h.kyoto-u.ac.jp\/users\/matthew\/abstracts\/CCC2019_deBrecht.pdf\">A note on the spatiality of localic products of countably based spaces.<\/a>&nbsp;<em>Workshop on Computability, Continuity,&nbsp;Constructivity&nbsp;\u2013 from Logic to Algorithms<\/em> (CCC 2019), Ljubljana, Slovenia, 2019.<\/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> (March 20th, 2023)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n","protected":false},"excerpt":{"rendered":"<p>I have talked about Till Plewe&#8217;s topological game [2] last time, showing how Matthew de Brecht used it to show that the space S0 is not consonant [1]. However, the original purpose of that game was to show that certain &hellip; <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=6400\">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-6400","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/pages\/6400","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=6400"}],"version-history":[{"count":196,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/pages\/6400\/revisions"}],"predecessor-version":[{"id":6610,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/pages\/6400\/revisions\/6610"}],"wp:attachment":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=6400"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}