{"id":4610,"date":"2022-01-20T19:41:00","date_gmt":"2022-01-20T18:41:00","guid":{"rendered":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=4610"},"modified":"2022-11-19T14:55:59","modified_gmt":"2022-11-19T13:55:59","slug":"irredundant-families-the-smyth-powerdomain-the-lyu-jia-theorem-and-the-baby-groemer-theorem","status":"publish","type":"page","link":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=4610","title":{"rendered":"Irredundant families, the Smyth powerdomain, the Lyu-Jia theorem, and the baby Groemer theorem"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\">Irreducible elements and irredundant families<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">If you are familiar with sober spaces, you know that an irreducible closed subset of a topological space <em>Z<\/em> is a non-empty closed subset <em>C<\/em> such that, for all closed subsets <em>C<\/em><sub>1<\/sub> and <em>C<\/em><sub>2<\/sub>,  if <em>C<\/em> is included in <em>C<\/em><sub>1<\/sub> \u222a <em>C<\/em><sub>2<\/sub>, then <em>C<\/em> is included in <em>C<\/em><sub>1<\/sub> or in <em>C<\/em><sub>2<\/sub>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">In general, given any family <strong><em>L<\/em><\/strong> of subsets of a set <em>Z<\/em>, let me say that <em>E<\/em> \u2208 <strong><em>L<\/em><\/strong> is <em>irreducible<\/em> if and only if <em>E<\/em> is non-empty and for all elements <em>E<\/em><sub>1<\/sub> and <em>E<\/em><sub>2<\/sub> of <strong><em>L<\/em><\/strong>, if <em>E<\/em> is included in <em>E<\/em><sub>1<\/sub> \u222a <em>E<\/em><sub>2<\/sub>, then <em>E<\/em> is included in <em>E<\/em><sub>1<\/sub> or in <em>E<\/em><sub>2<\/sub>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Let me call a family <strong><em>L<\/em><\/strong> of subsets of <em>Z<\/em> <em>irredundant<\/em> if and only if all its non-empty elements are irreducible.  More specifically, I will be interested in irredundant <em>\u2229-semilattices<\/em>, where a \u2229-semilattice is simply a collection of sets that is closed under binary intersections.  That may look like a stupidly overconstrained notion, to the point that one may legitimitely ask whether there is any non-trivial example.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">This is a very interesting notion, as I will attempt to demonstrate.  It was introduced in [1], and the credit is entirely due to the late Klaus Keimel.  Also, it is at the root of a clever argument due to Zhenchao Lyu and Xiadong Jia [2], which exactly characterizes when the Smyth powerdomain <strong>Q<\/strong>(<em>X<\/em>) of a topological space <em>X<\/em> is core-compact.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Two notes, before I start:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>The result of [2] was found by Zhenchao Lyu (and perhaps Xiaodong Jia) while he and Xiaodong Jia were postdocs in my lab in 2018-2019.  (Update, January 21, 2022: X. Jia tells me his role in this was only in asking the question, and that the solution is entirely due to Zh. Lyu.)  I was expecting them to be able to publish this quickly, but somehow I can only guess that something went wrong.  I usually have the policy of not talking about a paper before it is published (except for my own ideas), but this is so neat (and available from arXiv) that I have decided to talk about it without waiting any further.  (Update, January 21, 2022: also, it is cited as reference 38 in a recent <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S0166864120304843?via%3Dihub\">survey paper<\/a> by Xiaoquan Xu and Dongsheng Zhao.)<\/li>\n\n\n\n<li>There is some ambiguity in the definition of &#8220;irredundant&#8221; in [1], which may lead to some mistakes.  I have given a clarified definition above.  For more details on the ambiguity, see Appendix A at the end of this post.<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">The main example: the irredundant base of the upper Vietoris topology on <strong>Q<\/strong>(<em>X<\/em>)<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">There are at least two examples of an irredundant \u2229-semilattice in [1], and here is the one which will be the center of our attention in this  post.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Fact.<\/strong>  For every topological space <em>X<\/em>, the base of open sets \u2610<em>U<\/em> of the Smyth hyperspace <strong>Q<\/strong>(<em>X<\/em>), where <em>U<\/em> ranges over the open subsets of <em>X<\/em>, is an irredundant \u2229-semilattice.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Let me recall that <strong>Q<\/strong>(<em>X<\/em>) is the set of non-empty compact saturated subsets of <em>X<\/em>.  (Omitting &#8220;non-empty&#8221; would not change much in the sequel.)  The collection of sets \u2610<em>U<\/em>, <em>U<\/em> \u2208 <strong>O<\/strong><em>X<\/em>, is a base for a topology called the <em>upper Vietoris topology<\/em>, and <strong>Q<\/strong>(<em>X<\/em>) with that topology is the <em>Smyth hyperspace<\/em> of <em>X<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The proof of the above Fact is easy.  The sets \u2610<em>U<\/em> form a \u2229-semilattice because \u2610<em>U<\/em> \u2229 \u2610<em>V<\/em> = \u2610(<em>U<\/em> \u2229 <em>V<\/em>).  Let now \u2610<em>U<\/em> be non-empty and included in \u2610<em>V<\/em><sub>1<\/sub> \u222a \u2610<em>V<\/em><sub>2<\/sub>.  For the sake of contradiction, let us assume that \u2610<em>U<\/em> is not included in \u2610<em>V<\/em><sub>1<\/sub>, and not included in \u2610<em>V<\/em><sub>2<\/sub> either.  Then there is a non-empty compact saturated subset <em>Q<\/em><sub>1<\/sub> of <em>X<\/em> that is included in <em>U<\/em> but not in <em>V<\/em><sub>1<\/sub>, and there is a non-empty compact saturated subset <em>Q<\/em><sub>2<\/sub> of <em>X<\/em> that is included in <em>U<\/em> but not in <em>V<\/em><sub>2<\/sub>.  We form <em>Q<\/em><sub>1<\/sub> \u222a <em>Q<\/em><sub>2<\/sub>, which is a non-empty compact saturated subset of <em>X<\/em> that is included in <em>U<\/em>, but is included neither in <em>V<\/em><sub>1<\/sub> nor in <em>V<\/em><sub>2<\/sub>, contradicting \u2610<em>U<\/em> \u2286 \u2610<em>V<\/em><sub>1<\/sub> \u222a \u2610<em>V<\/em><sub>2<\/sub>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The other example is the collection of crescents of the form \u2610<em>U<\/em>\u2013\u2662<em>V<\/em> in the space of compact lenses (also known as the Plotkin powerdomain) with the Vietoris topology.  I will not expand on that.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">When is <strong>Q<\/strong>(<em>X<\/em>) core-compact?  The Lyu-Jia theorem<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">First, let me write \u2191<strong><sub>Q<\/sub><\/strong> <em>Q<\/em> for the the upward closure of a single point <em>Q<\/em> of <strong>Q<\/strong>(<em>X<\/em>).  That is taken with respect to the specialization ordering of <strong>Q<\/strong>(<em>X<\/em>), which is <em>reverse<\/em> inclusion \u2287.  Hence \u2191<strong><sub>Q<\/sub><\/strong> <em>Q<\/em> is the set of non-empty compact saturated sets <em>Q&#8217;<\/em> that are <em>included in<\/em> <em>Q<\/em>.  I know, this may sound confusing at first.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Extending the notation \u2610<em>U<\/em>, I could have just written \u2191<strong><sub>Q<\/sub><\/strong> <em>Q<\/em> as \u2610<em>Q<\/em>, the set of non-empty compact saturated sets included in <em>Q<\/em>.  The \u2610 operator, defined by \u2610<em>A<\/em> \u225d {<em>Q<\/em> \u2208 <strong>Q<\/strong>(<em>X<\/em>) | <em>Q<\/em> \u2286 <em>A<\/em>} for every subset <em>A<\/em> of <em>X<\/em>, is monotonic and commutes with finite intersections.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">It is well-known that, for every locally compact space <em>X<\/em>, <strong>Q<\/strong>(<em>X<\/em>) is locally compact.  Indeed, let <em>Q<\/em> \u2208 <strong>Q<\/strong>(<em>X<\/em>), and let <strong><em>U<\/em><\/strong> be an open neighborhood of <em>Q<\/em>.  <strong><em>U<\/em><\/strong> contains a basic open set \u2610<em>U<\/em>, where <em>U<\/em> is open in <em>X<\/em>, such that <em>Q<\/em> is in \u2610<em>U<\/em>, namely such that <em>Q<\/em> is included in <em>U<\/em>.  By the interpolation property in locally compact spaces (Proposition 4.8.14 in the <a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>), there is (necessarily non-empty) compact saturated subset <em>Q&#8217;<\/em> of <em>X<\/em> such that <em>Q<\/em> \u2286 <em>U&#8217;<\/em> \u2286 <em>Q&#8217;<\/em> \u2286 <em>U<\/em>, where <em>U&#8217;<\/em> is the interior of <em>Q&#8217;<\/em>.  Therefore <em>Q<\/em> \u2208 \u2610<em>U<\/em>&#8216; \u2286 \u2610<em>Q&#8217;<\/em> \u2286 \u2610<em>U<\/em>.  Since \u2191<strong><sub>Q<\/sub><\/strong> <em>Q<\/em>&#8216; = \u2610<em>Q&#8217;<\/em>, we can interpret the latter as saying that <em>Q<\/em> is in the interior of \u2191<strong><sub>Q<\/sub><\/strong> <em>Q<\/em>&#8216;, which is itself included in \u2610<em>U<\/em>, hence in <strong><em>U<\/em><\/strong>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We have in fact just shown more: for every locally compact space <em>X<\/em>, <strong>Q<\/strong>(<em>X<\/em>) is a <em>c-space<\/em>.  (See Section 5.1.2 in the <a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>.  A locally compact space is a space <em>Z<\/em> in which for every point <em>z<\/em>, and for every open neighborhood <em>W<\/em> of <em>z<\/em>, we can find a compact saturated neighborhood <em>K<\/em> of <em>z<\/em> included in <em>W<\/em>.  In a c-space, we require that <em>K<\/em> be the upward closure of a single point, just like \u2191<strong><sub>Q<\/sub><\/strong> <em>Q<\/em>&#8216; in the previous paragraph.)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">It is also known that <strong>Q<\/strong>(<em>X<\/em>) is locally compact if <em>and only if<\/em> <em>X<\/em> is locally compact.  (We will reprove this as a consequence of a more general result below.)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">What Zhenchao was interested in was whether one could prove a similar theorem with &#8220;core-compact&#8221; replacing &#8220;locally compact&#8221;.  The perhaps surprising outcome is that&#8230; no, you cannot.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">But let us not move too fast.  Here we are right now.  We know of the following implications:<\/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\"><em>X<\/em> loc. compact \u21d2 <strong>Q<\/strong>(<em>X<\/em>) c-space \u21d2 <strong>Q<\/strong>(<em>X<\/em>) loc. compact \u21d2 <strong>Q<\/strong>(<em>X<\/em>) core-compact,<\/p>\n<\/blockquote>\n\n\n\n<p class=\"wp-block-paragraph\">where the last two implications hold with any space in place of <strong>Q<\/strong>(<em>X<\/em>); the main result of [2] is to show that this is actually a string of <em>equivalences<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">In order to see this, we assume that <strong>Q<\/strong>(<em>X<\/em>) is core-compact, and we will show that <em>X<\/em> is locally compact.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Although not strictly needed, let us extend the notion of irreducibility and of irredundancy to a more abstract setting.  (I am saying that this is not strictly needed, because I will always apply that to the concrete cases of irredundant \u2229-semilattices as above.)  Given a sup-semilattice \u03a9, a subset <strong><em>L<\/em><\/strong> of \u03a9 is <em>irredundant<\/em> if and only if every element <em>u<\/em> of <strong><em>L<\/em><\/strong> different from \u22a5 is <em>irreducible<\/em> in the following sense: <em>u<\/em>\u2260\u22a5 and for all <em>v<\/em><sub>1<\/sub>, <em>v<\/em><sub>2<\/sub> in <strong><em>L<\/em><\/strong> such that <em>u<\/em> \u2264 <em>v<\/em><sub>1<\/sub> \u22c1 <em>v<\/em><sub>2<\/sub>, we have <em>u<\/em> \u2264 <em>v<\/em><sub>1<\/sub> or <em>u<\/em> \u2264 <em>v<\/em><sub>2<\/sub>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">A <em>prime-continuous<\/em> lattice is a complete lattice in which every element is the supremum of the elements that are way-way-below it.  The prime-continuous lattices are exactly the completely distributive, complete lattices by Raney&#8217;s Theorem (Exercise 8.3.16 in the <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\">The key point is the following, which we will apply to the case where \u03a9 is the lattice of open subsets of <strong>Q<\/strong>(<em>X<\/em>).  (Let me recall that a space is core-compact if and only if its open set lattice is continuous, see Definition 5.2.3 in the <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\"><strong>Lemma.<\/strong>  Let \u03a9 be a complete lattice, and <strong><em>L<\/em><\/strong> be a family of elements of \u03a9.  If \u03a9 is continuous, if <strong><em>L<\/em><\/strong> generates \u03a9 (in the sense that every element of \u03a9 is the supremum of a family of elements of <strong><em>L<\/em><\/strong>), and if <strong><em>L<\/em><\/strong> is irredundant, then \u03a9 is prime-continuous.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><em>Proof.<\/em>  Let us assume that every element of \u03a9 is the supremum of elements of <strong><em>L<\/em><\/strong>.  We will require the other assumptions later.  The main idea is to use irredundancy in order to prove the following:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>For every irreducible element <em>p<\/em> of <strong><em>L<\/em><\/strong>, for every <em>v<\/em> in \u03a9, <em>p<\/em> is way-way-below <em>v<\/em> (<em>p<\/em>\u22d8<em>v<\/em>) if and only if <em>p<\/em> is way-below <em>v<\/em> (<em>p<\/em>\u226a<em>v<\/em>).<br>Such a property is well-known if <em>p<\/em> is <em>coprime<\/em> in \u03a9 (namely, <em>p<\/em>\u2260\u22a5 and for all <em>v<\/em><sub>1<\/sub>, <em>v<\/em><sub>2<\/sub> in \u03a9 such that <em>u<\/em> \u2264 <em>v<\/em><sub>1<\/sub> \u22c1 <em>v<\/em><sub>2<\/sub>, we have <em>u<\/em> \u2264 <em>v<\/em><sub>1<\/sub> or <em>u<\/em> \u2264 <em>v<\/em><sub>2<\/sub>, see Exercise 8.3.47 of the <a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>), but we only require that <em>p<\/em> be irreducible in <strong><em>L<\/em><\/strong>, which is a much weaker property, and also an easier property to verify.  (Have you seen the difference, by the way?  This is subtle: in the definition of coprime, <em>v<\/em><sub>1<\/sub>, <em>v<\/em><sub>2<\/sub> vary in the whole of \u03a9, while they range over the smaller set <strong><em>L<\/em><\/strong> in the definition of irreducible.)<br>Anyway, here is how we prove that <em>p<\/em>\u22d8<em>v<\/em> if and only if <em>p<\/em>\u226a<em>v<\/em>, when <em>p<\/em> is irreducible in <strong><em>L<\/em><\/strong>.<br>Let me recall that <em>u<\/em>\u22d8<em>v<\/em> if and only if every family (not necessarily directed) whose supremum lies above <em>v<\/em> contains an element that is already above <em>u<\/em>.  Notably, <em>u<\/em>\u22d8<em>v<\/em> implies <em>u<\/em>\u226a<em>v<\/em>.<br>Conversely, if <em>p<\/em>\u226a<em>v<\/em> and if <em>p<\/em> is an irreducible element of <strong><em>L<\/em><\/strong>, let us consider any family <em>F<\/em> of elements of \u03a9 such that <em>v<\/em>\u2264sup <em>F<\/em>.  Every element <em>w<\/em> of <em>F<\/em> is a supremum of a family <em>F<sub>w<\/sub><\/em> of elements of <strong><em>L<\/em><\/strong>, so sup <em>F<\/em> = sup (\u222a<sub><em>w<\/em> \u2208 <em>F<\/em><\/sub> <em>F<sub>w<\/sub><\/em>).  Since sup (\u222a<sub><em>w<\/em> \u2208 <em>F<\/em><\/sub> <em>F<sub>w<\/sub><\/em>) can also be written as the directed supremum of all suprema of finite subfamilies of \u222a<em><sub><em>w<\/em><\/sub><\/em><sub> \u2208 <\/sub><em><sub><em>F<\/em><\/sub> <em>F<sub>w<\/sub><\/em><\/em>, and using the definition of the way-below relation \u226a, <em>p<\/em> \u2264 <em>u<\/em><sub>1<\/sub> \u22c1 &#8230; \u22c1 <em>u<\/em><sub><em>n<\/em><\/sub> for some finite subfamily {<em>u<\/em><sub>1<\/sub>, &#8230;, <em>u<\/em><sub><em>n<\/em><\/sub>} of \u222a<sub><em>w<\/em> \u2208 <em>F<\/em><\/sub> <em>F<sub>w<\/sub><\/em>.  Since <em>p<\/em> is irreducible (and since <em>u<\/em><sub>1<\/sub>, &#8230;, <em>u<\/em><sub><em>n<\/em><\/sub> are all in <strong><em>L<\/em><\/strong>), we must have <em>p<\/em> \u2264 <em>u<\/em><sub><em>i<\/em><\/sub> for some <em>i<\/em>; <em>u<\/em><sub><em>i<\/em><\/sub> is in <em>F<sub>w<\/sub><\/em> for some <em>w<\/em> \u2208 <em>F<\/em>, so <em>u<\/em><sub><em>i<\/em><\/sub> \u2264 <em>w<\/em>, and therefore <em>p<\/em> \u2264 <em>w<\/em>.  This shows that <em>p<\/em>\u22d8<em>v<\/em>.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">We now assume that <strong><em>L<\/em><\/strong> is irredundant.  What we have just shown simplifies to: for every <em>p<\/em> \u2208 <strong><em>L<\/em><\/strong>, for every <em>v<\/em> in \u03a9, <em>p<\/em>\u22d8<em>v<\/em> if and only if <em>p<\/em>\u226a<em>v<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Finally, we also assume that \u03a9 is continuous.  For every <em>v<\/em> \u2208 \u03a9, we can write <em>v<\/em> as the supremum of a directed family of elements <em>v<sub>i<\/sub><\/em>\u226a<em>v<\/em>, where <em>i<\/em> ranges over some indexing set <em>I<\/em>.  Each <em>v<sub>i<\/sub><\/em> is a supremum of a family <em>F<sub>i<\/sub><\/em> \u2286 <strong><em>L<\/em><\/strong>, so <em>v<\/em> is the supremum of the family \u222a<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> <em>F<sub>i<\/sub><\/em>.  That family is a family of elements <em>p<\/em> of <strong><em>L<\/em><\/strong>, and each of them is not just way-below, but way-way-below <em>v<\/em>, as we have just seen.  Hence \u03a9 is prime-continuous.  \u2610<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">As an application, and as promised, we specialize that to the case where \u03a9=<strong>O<\/strong>(<strong>Q<\/strong>(<em>X<\/em>)) and <strong><em>L<\/em><\/strong> is the base of the upper Vietoris topology consisting of sets of the form \u2610<em>U<\/em>, <em>U<\/em> \u2208 <strong>O<\/strong>(<em>X<\/em>), which is our primary example of an irredundant \u2229-semilattice:<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Corollary.<\/strong>  For every topological space <em>X<\/em>, if <strong>Q<\/strong>(<em>X<\/em>) is core-compact then it is a c-space.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><em>Proof.<\/em>  If <strong>Q<\/strong>(<em>X<\/em>) is core-compact, then <strong>O<\/strong>(<strong>Q<\/strong>(<em>X<\/em>)) is continuous, hence prime-continuous by the previous Lemma.  But every space whose lattice of open sets is prime-continuous is a c-space.  Lemma 8.3.42 in the <a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a> almost proves this&#8230; but assuming that the space is sober.  This is really silly: it is pretty easy to see that this assumption is not necessary, and the easiest way to see this is as follows.  (Update, January 22nd, 2022: or see the elementary proof in <a href=\"#primecont\">Appendix B<\/a>.)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Let <em>Y<\/em> be a space such that <strong>O<\/strong>(<em>Y<\/em>) is prime-continuous, and let <strong>S<\/strong>(<em>Y<\/em>) be the sobrification of <em>Y<\/em>.  Let me recall that the elements of <strong>S<\/strong>(<em>Y<\/em>) are the irreducible closed subsets of <em>Y<\/em>, and that the open subsets of <strong>S<\/strong>(<em>Y<\/em>) are the sets \u2662<em>U<\/em> \u225d {<em>C<\/em> \u2208 <strong>S<\/strong>(<em>Y<\/em>) | <em>C<\/em> intersects <em>U<\/em>}, for every open subset <em>U<\/em> of <em>Y<\/em>.  The latter defines an order-isomorphism <em>U<\/em> \u21a6 \u2662<em>U<\/em> of <strong>O<\/strong>(<em>Y<\/em>) onto <strong>O<\/strong>(<strong>S<\/strong>(<em>Y<\/em>)).  Then <strong>O<\/strong>(<strong>S<\/strong>(<em>Y<\/em>))\u2245<strong>O<\/strong>(<em>Y<\/em>) is prime-continuous, so <strong>S<\/strong>(<em>Y<\/em>) is a c-space, using Lemma 8.3.42.<br>It remains to see that every space <em>Y<\/em> such that <strong>S<\/strong>(<em>Y<\/em>) is a c-space is itself a c-space.  In order to see this, let <em>y<\/em> be any point in <em>Y<\/em> and let <em>V<\/em> be any open neighborhood of <em>y<\/em> in <em>Y<\/em>.   Then \u2193<em>y<\/em> is a point of <strong>S<\/strong>(<em>Y<\/em>), and \u2662<em>V<\/em> is an open neighborhood of \u2193<em>y<\/em>.  Since <strong>S<\/strong>(<em>Y<\/em>) is a c-space, there is an element <em>C<\/em> of \u2662<em>V<\/em> and an open set \u2662<em>U<\/em> such that \u2193<em>y<\/em> \u2208 \u2662<em>U<\/em> \u2286 \u2191<strong><sub>S<\/sub><\/strong> <em>C<\/em>, where \u2191<strong><sub>S<\/sub><\/strong> <em>C<\/em> denotes the upward closure {<em>C&#8217;<\/em> \u2208 <strong>S<\/strong>(<em>Y<\/em>) | <em>C<\/em>  \u2286 <em>C&#8217;<\/em>} of <em>C<\/em> in <strong>S<\/strong>(<em>Y<\/em>).  Since <em>C<\/em> is in \u2662<em>V<\/em>, it intersects <em>V<\/em>, say at <em>z<\/em>.  The inclusion \u2662<em>U<\/em> \u2286 \u2191<strong><sub>S<\/sub><\/strong> <em>C<\/em> means that every irreducible closed set that intersects <em>U<\/em> contains <em>C<\/em>, and therefore that for every point <em>x<\/em> in <em>U<\/em>, \u2193<em>x<\/em> contains <em>C<\/em>; in particular, <em>z<\/em>\u2264<em>x<\/em>.  Since <em>x<\/em> is arbitrary in <em>U<\/em>, this shows that <em>U<\/em> \u2286 \u2191<em>z<\/em>.  Finally, \u2193<em>y<\/em> \u2208 \u2662<em>U<\/em> means that <em>y<\/em> is in <em>U<\/em>.  In summary, we have obtained a point <em>z<\/em> in <em>V<\/em> such that <em>y<\/em> \u2208 <em>U<\/em> \u2286 \u2191<em>z<\/em>, and this concludes the proof that <em>Y<\/em> is a c-space.  \u2610<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">By the way, Lemma 8.3.41 in the <a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a> states that every c-space <em>Y<\/em> is such that <strong>O<\/strong>(<em>Y<\/em>) is prime-continuous, and therefore the c-spaces are exactly the spaces whose lattice of open sets is prime-continuous.  This had been known for a long time.  As far as I can tell, this appears as the equivalence between (a) and (e) in Proposition 2.2.C of Marcel Ern\u00e9&#8217;s 1991 paper on a-spaces, b-spaces, and c-spaces [3].<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We finally have:<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Fact.<\/strong>  If <strong>Q<\/strong>(<em>X<\/em>) is a c-space, then <em>X<\/em> is locally compact.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Indeed, let <em>x<\/em> be any point of <em>X<\/em> and <em>U<\/em> be any open neighborhood of <em>x<\/em> in <em>X<\/em>.  Then \u2191<em>x<\/em> is in \u2610<em>U<\/em>, and since <strong>Q<\/strong>(<em>X<\/em>) is a c-space, \u2191<em>x<\/em> is in the interior of \u2191<strong><sub>Q<\/sub><\/strong> <em>Q<\/em> = \u2610<em>Q<\/em> for some element <em>Q<\/em> of \u2610<em>U<\/em>.  Namely, there is a basic open set \u2610<em>V<\/em> such that \u2191<em>x<\/em> \u2208 \u2610<em>V<\/em> \u2286 \u2610<em>Q<\/em> \u2286 \u2610<em>U<\/em>.  Observing that for all sets <em>A<\/em>, <em>B<\/em>, the inclusion \u2610<em>A<\/em> \u2286 \u2610<em>B<\/em> implies <em>A<\/em> \u2286 <em>B<\/em> (for every <em>z<\/em> in <em>A<\/em>, \u2191<em>z<\/em> is in \u2610<em>A<\/em>, hence in \u2610<em>B<\/em>, and therefore <em>z<\/em> is in <em>B<\/em>), it follows that <em>x<\/em> \u2208 <em>V<\/em> \u2286 <em>Q<\/em> \u2286 <em>U<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Combining this with the previous corollary, if <strong>Q<\/strong>(<em>X<\/em>) is core-compact then <em>X<\/em> is locally compact.  We have obtained the promised chain of equivalences.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Theorem [2, Theorem 3.1].<\/strong>  For every topological space <em>X<\/em>, the following equivalences hold:<\/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\"><em>X loc. compact \u21d4 <\/em><strong>Q<\/strong><em>(X) c-space \u21d4 <\/em><strong>Q<\/strong><em>(X) loc. compact \u21d4 <\/em><strong>Q<\/strong><em>(X) core-compact<\/em>.<\/p>\n<\/blockquote>\n\n\n\n<p class=\"wp-block-paragraph\">It follows that the <strong>Q<\/strong> functor does <em>not<\/em> preserve core-compactness in general: given any space <em>X<\/em> that is core-compact but not locally compact, such as <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=1677\">this one<\/a>, <strong>Q<\/strong>(<em>X<\/em>) is not core-compact.  This is Corollary 3.4 of [2].<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">The baby Groemer theorem<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">The original application that Klaus found of irredundant \u2229-semilattices [1] was the following problem.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">A <em>lattice of sets<\/em> is a collection \u03a9 of subsets of a given set <em>X<\/em> that is closed under finite unions and finite intersections.  Among the finite intersections, one finds the intersection of the empty family, so <em>X<\/em> itself is in <em>X<\/em>.  Among the finite unions, one finds the union of the empty family, so the empty set \u2205 is in \u03a9.  A lattice of sets is of course a bounded lattice, consisting of subsets of a set <em>X<\/em>, but the definition also requires that finite infima are intersections and that finite suprema are unions.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Any topology, any \u03c3-algebra is a lattice of sets.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Let us called <em>signed valuation<\/em> on a lattice of sets \u03a9 any map \u03bc : \u03a9 \u2192 <strong>R<\/strong> that is:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><em>strict<\/em>: \u03bc(\u2205)=0<\/li>\n\n\n\n<li><em>modular<\/em>: for all <em>U<\/em>, <em>V<\/em> in \u03a9, \u03bc(<em>U<\/em> \u222a <em>V<\/em>)=\u03bc(<em>U<\/em>)+\u03bc(<em>V<\/em>)\u2013\u03bc(<em>U<\/em> \u2229 <em>V<\/em>).<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">For example, any signed measure on a measurable set is a signed valuation on its \u03c3-algebra.  The main differences between a signed measure and a measure is that: 1. a signed measure is not required to give non-negative values to sets 2. (less easy to see) a signed measure cannot give infinite measure to any measurable set.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">I have already talked briefly about <em>valuations<\/em> (not signed valuations) in various posts.  Valuations are a close cousin of measures, much as signed valuations are a closed cousin of signed measures.  You can have a look <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=1597\">here<\/a>, for a nifty idea of Alex Simpson&#8217;s about a formalization of the notion of random elements of a space; or the appendix of <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=3685\">this post<\/a>, where I build the so-called Lebesgue valuation on <strong>R<\/strong> and on the Sorgenfrey line by a purely domain-theoretic method.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">One of the main, basic problems in measure or valuation theory is showing that we can build a measure (or valuation) satisfying certain constraints.  For example, building the Lebesgue measure on <strong>R<\/strong> reduces to showing that there is a measure on <strong>R<\/strong> that maps every interval [<em>a<\/em>, <em>b<\/em>] to <em>b<\/em>\u2013<em>a<\/em>.  There are many theorems that allow you do such things.  In measure theory, one usually builds the Lebesgue measure by using the so-called Carath\u00e9odory extension theorem.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">In [1], one of our basic problems was the following.  Let <em>X<\/em> be a topological space, and let us consider the lattice of sets <strong>O<\/strong><sub>fin<\/sub>(<strong>Q<\/strong>(<em>X<\/em>)) obtained as finite unions of basic open subsets \u2610<em>U<\/em> of <strong>Q<\/strong>(<em>X<\/em>).  <strong><strong>O<\/strong><\/strong><sub>fin<\/sub>(<strong><strong>Q<\/strong><\/strong>(<em>X<\/em>)) is not the full topology <strong><strong>O<\/strong><\/strong>(<strong><strong>Q<\/strong><\/strong>(<em>X<\/em>)), and the reason I am considering this here is because this will make the argument simpler, and it will allow me to concentrate on the core of the more complex arguments of [1].<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Now imagine you are given values \u03bd(<em>U<\/em>) for each open subset <em>U<\/em> of <em>X<\/em>, and you wish to build a signed valuation \u03bc on <strong><strong>O<\/strong><\/strong><sub>fin<\/sub>(<strong><strong>Q<\/strong><\/strong>(<em>X<\/em>)) such that \u03bc(\u2610<em>U<\/em>)=\u03bd(<em>U<\/em>) for every <em>U<\/em>.  Is that possible?  Under which conditions?<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Naturally, when <em>U<\/em> is empty, we require \u03bd(\u2205) to be equal to 0, otherwise there would be no solution for \u03bc.  The nice thing is that \u03bd(\u2205)=0 is the <em>only<\/em> constraint that ever has to be satisfied for \u03bc to exist; and, in fact, \u03bc is then uniquely determined from the knowledge of \u03bd.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Klaus realized that this followed from a theorem due to Groemer [4], which he found by randomly browsing through a few books on his shelf, and in particular a book by Klain and Rota [5], where this theorem is stated and proved.  Klaus also realized that we only needed a very special case of that theorem, and that this very special case had an amazingly simple proof.  (I had proved all the main theorems of [1] before Klaus found all that.  My proofs were extremely laborious, and Klaus showed how to simplify them drastically using those wonderful theorems, sometimes reducing my original proofs by a factor between 20 and 40.)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">I will call that very special case the <em>baby Groemer theorem<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">So here is how we proceed.  We fix a set <em>X<\/em>.  For every subset <em>A<\/em> of <em>X<\/em>, we can build the <em>characteristic function<\/em> \u03c7<em><sub>A<\/sub><\/em>, which maps every element of <em>A<\/em> to 1, and all other elements to 0.  The following is an easy exercise, and should remind you of the modularity requirement of signed valuations.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Fact.<\/strong>  For all sets <em>U<\/em>, <em>V<\/em>, \u03c7<sub><em>U<\/em> \u222a <em>V<\/em><\/sub>=\u03c7<em><sub>U<\/sub><\/em>+\u03c7<em><sub>V<\/sub><\/em>\u2013\u03c7<sub><em>U<\/em> \u2229 <em>V<\/em><\/sub>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The collection of all maps from <em>X<\/em> to <strong>R<\/strong> is a real vector space under pointwise addition and scalar multiplication.  For example, every characteristic map \u03c7<em><sub>U<\/sub><\/em> is a vector in that vector space, as is any linear combination such as \u03c7<em><sub>U<\/sub><\/em>\u20132\u03c7<em><sub>V<\/sub><\/em>, for example.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The key ingredient that will lead us to the baby Groemer theorem is the following.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Lemma.<\/strong>  Let <strong><em>L<\/em><\/strong> be any irredundant \u2229-semilattice of subsets of <em>X<\/em>.  The vectors \u03c7<em><sub>U<\/sub><\/em>, where <em>U<\/em> ranges over the non-empty sets in <strong><em>L<\/em><\/strong>, are linearly independent.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><em>Proof.<\/em>  Let us assume that \u2211<em><sub>U<\/sub><\/em> <em>a<sub>U<\/sub><\/em> . \u03c7<em><sub>U<\/sub><\/em> = 0, where <em>U<\/em> ranges over a non-empty finite subset <em>E<\/em> of <strong><em>L<\/em><\/strong>\u2013{\u2205} and each <em>a<sub>U<\/sub><\/em> is non-zero.  Let <em>U<\/em><sub>0<\/sub> be a maximal element of <em>E<\/em> with respect to inclusion, and <em>U<\/em><sub>1<\/sub>, &#8230;, <em>U<\/em><sub><em>n<\/em><\/sub> be the other elements of <em>E<\/em> (namely, <em>U<\/em><sub><em>i<\/em><\/sub>\u2260<em>U<\/em><sub>0<\/sub> for every <em>i<\/em>, 1\u2264<em>i<\/em>\u2264<em>n<\/em>).  If <em>U<\/em><sub>0<\/sub> were included in <em>U<\/em><sub>1<\/sub> \u222a &#8230; \u222a <em>U<\/em><sub><em>n<\/em><\/sub>, then by irredundancy <em>U<\/em><sub>0<\/sub> would be included in some <em>U<\/em><sub><em>i<\/em><\/sub>, hence equal to it by maximality.  That is impossible since <em>U<\/em><sub><em>i<\/em><\/sub>\u2260<em>U<\/em><sub>0<\/sub>.  Hence <em>U<\/em><sub>0<\/sub> is not included in <em>U<\/em><sub>1<\/sub> \u222a &#8230; \u222a <em>U<\/em><sub><em>n<\/em><\/sub>.  Let <em>x<\/em> be a point in <em>U<\/em><sub>0<\/sub> that is not in <em>U<\/em><sub>1<\/sub> \u222a &#8230; \u222a <em>U<\/em><sub><em>n<\/em><\/sub>.  Evaluating \u2211<em><sub>U<\/sub><\/em> <em>a<sub>U<\/sub><\/em> . \u03c7<em><sub>U<\/sub><\/em> on <em>x<\/em>, all the terms except the term <em>U<\/em>=<em>U<\/em><sub>0<\/sub> vanish, and we obtain the non-zero value <em>a<sub>U<sub>0<\/sub><\/sub><\/em>: this contradicts the fact that \u2211<em><sub>U<\/sub><\/em> <em>a<sub>U<\/sub><\/em> . \u03c7<em><sub>U<\/sub><\/em> = 0.  \u2610<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">And here is the baby Groemer theorem.  The <em>lattice of subsets<\/em> <strong><em>L<\/em><\/strong><sup>\u222a<\/sup> generated by <strong><em>L<\/em><\/strong> is the smallest lattice of subsets containing <strong><em>L<\/em><\/strong>, namely the smallest collection of subsets containing <strong><em>L<\/em><\/strong> and closed under finite unions and finite intersections.  When <strong><em>L<\/em><\/strong> is a \u2229-semilattice, the elements of <strong><em>L<\/em><\/strong><sup>\u222a<\/sup> are juste the finite unions of elements of <strong><em>L<\/em><\/strong>.  The <em>Boolean algebra of subsets<\/em> <strong>A<\/strong>(<strong><em>L<\/em><\/strong>) generated by <strong><em>L<\/em><\/strong> is the smallest family of subsets of <em>X<\/em> that contains <em><strong>L<\/strong><\/em> and is closed under finite unions, finite intersections, and complements.  Its elements are the finite unions of finite intersections of <strong><em>L<\/em><\/strong>-literals, where an <strong><em>L<\/em><\/strong>-literal is an element of <strong><em>L<\/em><\/strong> or a complement of an element of <strong><em>L<\/em><\/strong>.  I will also call <strong><em>L<\/em><\/strong>-clause any finite intersection of <strong><em>L<\/em><\/strong>-literals.  It is relatively easy to check that the elements of <strong>A<\/strong>(<strong><em>L<\/em><\/strong>) are also the <em>disjoint<\/em> finite unions of <strong><em><strong><em>L<\/em><\/strong><\/em><sup>\u222a<\/sup><\/strong>-crescents, where an <strong><em><strong><em>L<\/em><\/strong><\/em><sup>\u222a<\/sup><\/strong><em>-crescent<\/em> is a set of the form <em>A<\/em>\u2013<em>B<\/em> where <em>A<\/em> and <em>B<\/em> are in <strong><em><strong><em>L<\/em><\/strong><\/em><sup>\u222a<\/sup><\/strong> and <em>B<\/em> is included in <em>A<\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Theorem.<\/strong>  Let <strong><em>L<\/em><\/strong> be any irredundant \u2229-semilattice of subsets of <em>X<\/em>.  Given any map \u03bd from <strong><em>L<\/em><\/strong>\u2013{\u2205} to <strong>R<\/strong>, there is a unique signed valuation \u03bc on <strong><em>L<\/em><\/strong><sup>\u222a<\/sup>, and in fact on <strong>A<\/strong>(<strong><em>L<\/em><\/strong>), that extends \u03bd.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><em>Proof.<\/em>  Let <strong>F<\/strong>(<strong><em>L<\/em><\/strong>) be the linear space of functions from <em>X<\/em> to <strong>R<\/strong> generated by the functions \u03c7<em><sub>U<\/sub><\/em>, where <em>U<\/em> ranges over <strong><em>L<\/em><\/strong>\u2013{\u2205}.  By the previous Lemma, those functions form a basis of <strong>F<\/strong>(<strong><em>L<\/em><\/strong>).  Hence there is a unique linear map <em>f<\/em>  from <strong>F<\/strong>(<strong><em>L<\/em><\/strong>) to <strong>R<\/strong> such that <em>f<\/em>(\u03c7<em><sub>U<\/sub><\/em>)=\u03bd(<em>U<\/em>) for every <em>U<\/em> in <strong><em>L<\/em><\/strong>\u2013{\u2205}.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We verify that for every <em>A<\/em> in <strong><em>L<\/em><\/strong><sup>\u222a<\/sup>, \u03c7<em><sub>A<\/sub><\/em> is in <strong>F<\/strong>(<strong><em>L<\/em><\/strong>).  This is easy.  <em>A<\/em> is a finite union <em>U<\/em><sub>1<\/sub> \u222a &#8230; \u222a <em>U<\/em><sub><em>n<\/em><\/sub> of elements of <strong><em>L<\/em><\/strong>, and we prove this by induction on <em>n<\/em>.  If <em>n<\/em>=0, then \u03c7<sub>\u2205<\/sub>=0 is in <strong>F<\/strong>(<strong><em>L<\/em><\/strong>).  If <em>n<\/em>=1, this is by definition of <strong>F<\/strong>(<strong><em>L<\/em><\/strong>).  Otherwise, let <em>B<\/em> \u225d <em>U<\/em><sub>2<\/sub> \u222a &#8230; \u222a <em>U<\/em><sub><em>n<\/em><\/sub>.  By the Fact seen above, \u03c7<em><sub>A<\/sub><\/em> = \u03c7<em><sub><em>U<\/em><\/sub><\/em><sub><sub>1<\/sub><\/sub>+\u03c7<em><sub>B<\/sub><\/em>\u2013\u03c7<em><sub><em>U<\/em><\/sub><\/em><sub><sub>1<\/sub>\u2229<\/sub><em><sub>B<\/sub><\/em>; \u03c7<em><sub><em>U<\/em><\/sub><\/em><sub>1<\/sub> is in <strong>F<\/strong>(<strong><em>L<\/em><\/strong>) by definition, \u03c7<em><sub>B<\/sub><\/em> is in <strong>F<\/strong>(<strong><em>L<\/em><\/strong>) by induction hypothesis, and \u03c7<em><sub><em>U<\/em><\/sub><\/em><sub><sub>1<\/sub>\u2229<\/sub><em><sub>B<\/sub><\/em> = \u03c7<sub>(<\/sub><em><sub><em><em>U<\/em><\/em><\/sub><\/em><sub><sub>1<\/sub> \u2229 <\/sub><em><sub><em><em>U<\/em><\/em><\/sub><\/em><sub><sub>2<\/sub>) \u222a &#8230; \u222a (<\/sub><em><sub><em><em>U<\/em><\/em><\/sub><\/em><sub><sub>1<\/sub> \u2229 <\/sub><em><sub><em><em>U<\/em><sub><em>n<\/em><\/sub><\/em><\/sub><\/em><sub>)<\/sub> is also in <strong>F<\/strong>(<strong><em>L<\/em><\/strong>) by induction hypothesis, since <em>U<\/em><sub>1<\/sub> \u2229 <em>U<\/em><sub>2<\/sub>,  &#8230;, <em>U<\/em><sub>1<\/sub> \u2229 <em>U<\/em><sub><em>n<\/em><\/sub> are all in <strong><em>L<\/em><\/strong>, since <strong><em>L<\/em><\/strong> is a \u2229-semilattice of subsets.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">It follows that for every <strong><em>L<\/em><\/strong><sup>\u222a<\/sup>-crescent <em>C<\/em> \u225d <em>A<\/em>\u2013<em>B<\/em>, \u03c7<em><sub>C<\/sub><\/em> is also in <strong>F<\/strong>(<strong><em>L<\/em><\/strong>), since \u03c7<em><sub>C<\/sub><\/em>=\u03c7<em><sub>A<\/sub><\/em>\u2013\u03c7<em><sub>B<\/sub><\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We then obtain that for every <em>E<\/em> in <strong>A<\/strong>(<strong><em>L<\/em><\/strong>), \u03c7<em><sub>E<\/sub><\/em> is in <strong>F<\/strong>(<strong><em>L<\/em><\/strong>).  Indeed, <em>E<\/em> is a finite disjoint union of <strong><em>L<\/em><\/strong><sup>\u222a<\/sup>-crescents <em>C<sub>i<\/sub><\/em>,  1\u2264<em>i<\/em>\u2264<em>n<\/em>, and then \u03c7<em><sub>E<\/sub><\/em> = \u03a3<em><sub>i<\/sub><\/em><sub>=1<\/sub><em><sup>n<\/sup><\/em> \u03c7<em><sub><em>C<sub>i<\/sub><\/em><\/sub><\/em>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We now define \u03bc by \u03bc(<em>E<\/em>) \u225d <em>f<\/em>(\u03c7<em><sub>E<\/sub><\/em>) for every <em>E<\/em> in <strong>A<\/strong>(<strong><em>L<\/em><\/strong>).  This is legitimate, since we have just proved that \u03c7<em><sub>E<\/sub><\/em> is in <strong>F<\/strong>(<strong><em>L<\/em><\/strong>).  This map \u03bc is:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>strict, because \u03bc(\u2205) = <em>f<\/em>(\u03c7<sub>\u2205<\/sub>) = <em>f<\/em>(0) = 0;<\/li>\n\n\n\n<li>modular, because for all <em>E<\/em>, <em>F<\/em> in <strong>A<\/strong>(<strong><em>L<\/em><\/strong>), \u03bc(<em>E<\/em> \u222a <em>F<\/em>) = <em>f<\/em>(\u03c7<em><sub><em>E<\/em><\/sub><\/em><sub> \u222a <\/sub><em><sub><em>F<\/em><\/sub><\/em>) = <em>f<\/em>(\u03c7<em><sub><em>E<\/em><\/sub><\/em>)+<em>f<\/em>(\u03c7<em><sub><em>F<\/em><\/sub><\/em>)\u2013<em>f<\/em>(\u03c7<em><sub><em>E<\/em><\/sub><\/em><sub> \u2229 <\/sub><em><sub><em>F<\/em><\/sub><\/em>)=\u03bc(<em>E<\/em>)+\u03bc(<em>F<\/em>)\u2013\u03bc(<em>E<\/em> \u2229 <em>F<\/em>), by the Fact once again, and the linearity of <em>f<\/em>.<\/li>\n\n\n\n<li>Finally, \u03bc extends \u03bd, since for every <em>U<\/em> in <strong><em>L<\/em><\/strong>, \u03bc(<em>U<\/em>)=<em>f<\/em>(\u03c7<em><sub>U<\/sub><\/em>)=\u03bd(<em>U<\/em>), by definition of <em>f<\/em>.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\">That was the essential construction of the proof: just a bit of elementary linear algebra, resting on the irredundancy of <strong><em>L<\/em><\/strong> in order to obtain a base of <strong>F<\/strong>(<strong><em>L<\/em><\/strong>).<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">In order to see that \u03bc is unique (as a valuation), we reason as follows.  The value of \u03bc on elements <em>A<\/em> \u225d <em>U<\/em><sub>1<\/sub> \u222a &#8230; \u222a <em>U<\/em><sub><em>n<\/em><\/sub> of <strong><em>L<\/em><\/strong><sup>\u222a<\/sup> is uniquely determined from the values it takes on individual elements <em>U<\/em><sub>1<\/sub>, &#8230;, <em>U<\/em><sub><em>n<\/em><\/sub>, by induction on <em>n<\/em>, using (strictness and) modularity.  (Let me leave the details to you.)  For each <strong><em>L<\/em><\/strong>-crescent <em>C<\/em> \u225d <em>A<\/em>\u2013<em>B<\/em>, we must have \u03bc(<em>A<\/em>)=\u03bc(<em>B<\/em> \u222a <em>C<\/em>)=\u03bc(<em>B<\/em>)+\u03bc(<em>C<\/em>)\u2013\u03bc(<em>B<\/em> \u2229 <em>C<\/em>)=\u03bc(<em>B<\/em>)+\u03bc(<em>C<\/em>)\u2013\u03bc(\u2205)=\u03bc(<em>B<\/em>)+\u03bc(<em>C<\/em>), so \u03bc(<em>C<\/em>) must be equal to \u03bc(<em>A<\/em>)\u2013\u03bc(<em>B<\/em>).  This argument shows more generally that if <em>E<\/em> and <em>F<\/em> (instead of <em>B<\/em> and <em>C<\/em>) are disjoint elements of <strong>A<\/strong>(<strong><em>L<\/em><\/strong>), then \u03bc(<em>E<\/em> \u222a <em>F<\/em>)=\u03bc(<em>E<\/em>)+\u03bc(<em>F<\/em>).  Using this and strictness, this shows that for every element <em>E<\/em> of <strong>A<\/strong>(<strong><em>L<\/em><\/strong>), written as a finite disjoint union of <strong><em>L<\/em><\/strong><sup>\u222a<\/sup>-crescents <em>C<sub>i<\/sub><\/em>, 1\u2264<em>i<\/em>\u2264<em>n<\/em>, \u03bc(<em>E<\/em>) is uniquely determined as \u03a3<em><sub>i<\/sub><\/em><sub>=1<\/sub><em><sup>n<\/sup><\/em> \u03bc(<em>C<sub>i<\/sub><\/em>).  \u2610<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We apply this to the case where <strong><em>L<\/em><\/strong> is the irredundant \u2229-semilattice of subsets of <strong>Q<\/strong>(<em>X<\/em>) of the form \u2610<em>U<\/em>, where <em>U<\/em> ranges over the open subsets of a space <em>X<\/em>, and we obtain that for any function \u03bd from <strong>O<\/strong><em>X<\/em>\u2013{\u2205} to <strong>R<\/strong>, there is a unique signed valuation \u03bc on the lattice of sets <strong><em>L<\/em><\/strong><sup>\u222a<\/sup>=<strong><strong>O<\/strong><\/strong><sub>fin<\/sub>(<strong><strong>Q<\/strong><\/strong>(<em>X<\/em>)), such that \u03bc(\u2610<em>U<\/em>)=\u03bd(<em>U<\/em>) for every non-empty open subset <em>U<\/em> of <em>X<\/em>, and we are done.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">A final word.  The problem we were really interested in was whether there exists a <em>continuous valuation<\/em> \u03bc such that \u03bc(\u2610<em>U<\/em>)=\u03bd(<em>U<\/em>) for every open subset <em>U<\/em> of <em>X<\/em>.  The obvious difference is that we now require continuity, and to handle this, we simply extend a valuation \u03bc on <strong><strong>O<\/strong><\/strong><sub>fin<\/sub>(<strong><strong>Q<\/strong><\/strong>(<em>X<\/em>)) such that \u03bc(\u2610<em>U<\/em>)=\u03bd(<em>U<\/em>) for every open set <em>U<\/em> to the whole of <strong>O<\/strong>(<strong>Q<\/strong>(<em>X<\/em>)), using Scott&#8217;s formula; this assumes that <em>X<\/em> is locally compact (and that \u03bd(\u2205)=0).  There is a less visible difference: a valuation (not a signed valuation) takes its values in the <em>non-negative<\/em> reals.  In order to ensure that \u03bc is indeed a valuation, a necessary and sufficient condition is that \u03bd satisfy the inequality:<\/p>\n\n\n\n<p class=\"has-text-align-center wp-block-paragraph\">\u03bd(<em>U<\/em>) \u2265 \u2211<em><sub>I<\/sub><\/em> (-1)<sub><sup>|I|+1<\/sup><\/sub> \u03bd(\u2229<sub><em>i<\/em>\u2208<em>I<\/em><\/sub> <em>U<\/em><sub><em>i<\/em><\/sub>)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">for all open sets <em>U<\/em>, <em>U<\/em><sub>1<\/sub>, &#8230;, <em>U<\/em><sub><em>n<\/em><\/sub> such that <em>U<\/em> contains <em>U<\/em><sub>1<\/sub> \u222a &#8230; \u222a <em>U<sub>n<\/sub><\/em>, and where the summation extends over all non-empty subsets <em>I<\/em> of {1, &#8230;, <em>n<\/em>}.  (This is an inequational form of the so-called inclusion-exclusion formula in probability theory.)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">You may read [1] if you are interested.  I will not explain, sorry&#8230; My point was only to show how the use of the (apparently) overconstrained notion of irredundant \u2229-semilattices can be put to good use in order to obtain simple proofs of not completely trivial results!<\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li>Jean Goubault-Larrecq and Klaus Keimel.  <a href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/Publis\/PAPERS\/PDF\/GLK-mscs10.pdf\">Choquet-Kendall-Matheron theorems for non-Hausdorff spaces<\/a>.  <a href=\"https:\/\/www.cambridge.org\/core\/journals\/mathematical-structures-in-computer-science\/issue\/2BBC687E1831B5DE9949BD0FFA37F00A\">Mathematical Structures in Computer Science 21(3)<\/a>, 2011, pages 511-561.<\/li>\n\n\n\n<li>Zhenchao Lyu and Xiaodong Jia.  Core-compactness of Smyth powerspaces.  <a href=\"https:\/\/arxiv.org\/abs\/1907.04715\">arXiv:1907.04715<\/a>, July 2019.<\/li>\n\n\n\n<li>Marcel Ern\u00e9.  <a href=\"https:\/\/www.heldermann.de\/R&amp;E\/RAE18\/ctw05.pdf\">The ABC of order and topology<\/a>.  Pages 57\u201383 of&nbsp;<em>Category Theory at Work, Proceedings of a Workshop<\/em>. Research and Exposition in Mathematics 18. Heldermann Verlag, 1991.  H. Herrlich and H.-E. Porst, editors.<\/li>\n\n\n\n<li>Helmut Groemer.  <a href=\"https:\/\/www.google.com\/url?sa=t&amp;rct=j&amp;q=&amp;esrc=s&amp;source=web&amp;cd=&amp;ved=2ahUKEwjc95rRpr71AhXjDWMBHXzbADMQFnoECAYQAQ&amp;url=https%3A%2F%2Fprojecteuclid.org%2Fjournals%2Fpacific-journal-of-mathematics%2Fvolume-75%2Fissue-2%2FOn-the-extension-of-additive-functionals-on-classes-of-convex%2Fpjm%2F1103121472.pdf&amp;usg=AOvVaw2CfEvyzWXL0IDJ4pGiyFZq\">On the extension of additive functionals on classes of convex sets<\/a>.  <a href=\"https:\/\/msp.org\/pjm\/1978\/75-2\/p09.xhtml\">Pacific Journal of Mathematics 75(2)<\/a>:397\u2013410, 1978.<\/li>\n\n\n\n<li>Daniel A. Klain and Gian-Carlo Rota.  Introduction to Geometric Probability.  Cambridge University Press, Lezioni Lincee series, 1997.<\/li>\n<\/ol>\n\n\n\n<h2 class=\"wp-block-heading\">Appendix A: the ambiguity in [1]<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">The definition of &#8220;irreducible&#8221; in [1] is: in an \u2229-semilattice <strong><em>L<\/em><\/strong>, <em>E<\/em> is irreducible if and only if one cannot write <em>E<\/em> as the union of finitely many proper closed subsets still in <strong><em>L<\/em><\/strong>.  But that is stated in such a way that the reader cannot decide whether we mean &#8220;finitely many, possibly 0&#8221;, or &#8220;finitely many, and at least 1&#8221;.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">I have decided that we meant &#8220;finitely many, possibly 0&#8221;.  That definition is then equivalent to the definition I gave at the beginning of this post.  In particular, that forces <em>E<\/em> to be non-empty, since the empty set <em>can<\/em> be written as the union of finitely many (namely, zero) proper closed subsets in <strong><em>L<\/em><\/strong>.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Then we defined <strong><em>L<\/em><\/strong> as irredundant if and only if all its elements are irreducible.  In particular, an irredundant <strong><em>L<\/em><\/strong> cannot contain the empty set.  This is unfortunate, since our primary example, the collection of sets of the form \u2610<em>U<\/em>, where <em>U<\/em> ranges over the open subsets of a topological space <em>X<\/em>, <em>does<\/em> contain the empty set (as \u2610\u2205).<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The easiest fix is what I did in this post: require all <em>non-empty<\/em> elements of <strong><em>L<\/em><\/strong> to be irreducible.  With that fix, all theorems of [1], and for that matter, of [2] as well, go through unchanged.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"primecont\">Appendix B: if <strong>O<\/strong><em>X<\/em> is prime-continuous, then <em>X<\/em> is a c-space<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">(Added January 22nd, 2022.)  Let <em>X<\/em> be a topological space, and let us assume that <strong>O<\/strong><em>X<\/em> is prime-continuous, or equivalently, completely distributive.  (See Exercise 8.3.16.)<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We claim that, given any family (<em>D<sub>i<\/sub><\/em>)<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> of downwards closed subsets of <em>X<\/em>, the closure cl(\u2229<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> <em>D<sub>i<\/sub><\/em>) is equal to \u2229<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> cl (<em>D<sub>i<\/sub><\/em>).  We write each <em>D<sub>i<\/sub><\/em> as the union of the sets \u2193<em>x<\/em>, where <em>x<\/em> ranges over <em>D<sub>i<\/sub><\/em>.  This is possible because each <em>D<sub>i<\/sub><\/em> is downwards closed.  Next, we recall that the powerset of <em>X<\/em> is completely distributive, so \u2229<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> <em>D<sub>i<\/sub><\/em> = \u2229<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> \u222a<sub><em>x<\/em> \u2208 <em><em>D<sub>i<\/sub><\/em><\/em><\/sub> \u2193<em>x<\/em> = \u222a<em><sub>f<\/sub><\/em> \u2229<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> \u2193<em>f<\/em>(<em>i<\/em>), where <em>f<\/em> ranges over \u03a0<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> <em>D<sub>i<\/sub><\/em>, the set of functions that map each element <em>i<\/em> of <em>I<\/em> to an element of <em>D<sub>i<\/sub><\/em>.  The sets \u2193<em>f<\/em>(<em>i<\/em>) are closed, \u2229<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> \u2193<em>f<\/em>(<em>i<\/em>) is their infimum in the lattice <strong>H<\/strong><em>X<\/em> of closed subsets of <em>X<\/em>, and the closure cl(\u2229<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> <em>D<sub>i<\/sub><\/em>)=cl(\u222a<em><sub>f<\/sub><\/em> \u2229<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> \u2193<em>f<\/em>(<em>i<\/em>)) of their union is then equal to sup<em><sub>f<\/sub><\/em> inf<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> \u2193<em>f<\/em>(<em>i<\/em>), where &#8220;sup&#8221; and &#8220;inf&#8221; are understood in <strong>H<\/strong><em>X<\/em>.  Since <strong>H<\/strong><em>X<\/em> is completely distributive, we also have inf<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> sup<sub><em>x<\/em> \u2208 <em>D<sub>i<\/sub><\/em><\/sub> \u2193<em>x<\/em>=sup<em><sub>f<\/sub><\/em> inf<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> \u2193<em>f<\/em>(<em>i<\/em>).  Therefore cl(\u2229<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> <em>D<sub>i<\/sub><\/em>)=inf<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> sup<sub><em>x<\/em> \u2208 <em>D<sub>i<\/sub><\/em><\/sub> \u2193<em>x<\/em>.  For each <em>i<\/em> in <em>I<\/em>, sup<sub><em>x<\/em> \u2208 <em>D<sub>i<\/sub><\/em><\/sub> \u2193<em>x<\/em> is the smallest closed set that contains every element of <em>D<sub>i<\/sub><\/em>, and is therefore equal to cl (<em>D<sub>i<\/sub><\/em>).  The outer &#8220;inf&#8221; is just an intersection, so cl(\u2229<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> <em>D<sub>i<\/sub><\/em>)=\u2229<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> cl(<em>D<sub>i<\/sub><\/em>).<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">By taking complements, we obtain that for every family (<em>A<sub>i<\/sub><\/em>)<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> of upwards closed subsets of <em>X<\/em>, the interior int(\u222a<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> <em>A<sub>i<\/sub><\/em>) is equal to \u222a<sub><em>i<\/em> \u2208 <em>I<\/em><\/sub> int (<em>A<sub>i<\/sub><\/em>).  By Exercise 5.1.38 of the <a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>, <em>X<\/em> is a c-space.  (Explicitly, let <em>x<\/em> be a point of <em>X<\/em> and <em>U<\/em> be an open neighborhood of <em>x<\/em>.  Then <em>U<\/em> is the union of all the upwards closed sets \u2191<em>y<\/em> where <em>y<\/em> ranges over <em>U<\/em>.  In particular, <em>U<\/em>=int(\u222a<sub><em>y<\/em> \u2208 <em>U<\/em><\/sub> \u2191<em>y<\/em>).  Since the sets \u2191<em>y<\/em> form a family of upwards closed sets, we have just seen that <em>U<\/em>=\u222a<sub><em>y<\/em> \u2208 <em>U<\/em><\/sub> int(\u2191<em>y<\/em>).  Therefore <em>x<\/em> is in int(\u2191<em>y<\/em>) for some <em>y<\/em> in <em>U<\/em>.)<\/p>\n\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> (January 20th, 2022)<\/p>\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\"><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Irreducible elements and irredundant families If you are familiar with sober spaces, you know that an irreducible closed subset of a topological space Z is a non-empty closed subset C such that, for all closed subsets C1 and C2, if &hellip; <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=4610\">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-4610","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/pages\/4610","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=4610"}],"version-history":[{"count":55,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/pages\/4610\/revisions"}],"predecessor-version":[{"id":5881,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/pages\/4610\/revisions\/5881"}],"wp:attachment":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=4610"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}