{"id":12,"date":"2012-10-04T10:54:40","date_gmt":"2012-10-04T08:54:40","guid":{"rendered":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=12"},"modified":"2023-09-23T14:13:22","modified_gmt":"2023-09-23T12:13:22","slug":"errata","status":"publish","type":"page","link":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=12","title":{"rendered":"Errata"},"content":{"rendered":"<p>It is always embarrassing to realize that one&#8217;s mind has slipped&#8230;<\/p>\n<h2>The important bloopers first:<\/h2>\n<ol>\n<li>p.120, Definition 5.1.1 (the way-below relation): &#8220;for every directed family\u00a0<em>z<sub>i<\/sub><\/em> that has a a least upper bound <em>z<\/em> above <em>y<\/em>, there is an <em>i<\/em> in <em>I<\/em> such that <em>y<\/em> \u2264 <em>z<sub>i<\/sub><\/em> already.&#8221;&#8230; \u00a0oops! such that <strong><em>x<\/em><\/strong>\u00a0\u2264\u00a0<em>z<sub>i\u00a0<\/sub><\/em>already, not <em>y<\/em>\u00a0\u2264\u00a0<em>z<sub>i<\/sub><\/em>, as the subsequent explanation (p.121, top) states (found by\u00a0keith_dr_uk, May 14, 2013).<\/li>\n<li>p.41, Exercise 3.5.8 and p.158, Exercise 5.4.17.\u00a0 Exercise 5.4.17 is false: the notion of continuous convergence used in Section 5.4 does not specialize to what is called continuous convergence in Exercise 3.5.8.\u00a0 (Consequence of a remark made by Barth Shiki, July 16, 2013.)<br \/>\nCall <em>weak<\/em> continuous convergence the notion of convergence used in Exercise 3.5.8.\u00a0 Continuous convergence of sequences <em>implies<\/em> weak continuous convergence.\u00a0 The converse implication, which is asked for in Exercise 5.4.17, is unknown to me, but seems dubious.<br \/>\nMy preferred fix is to modify Exercise 3.5.8 so as to give the right definition of continuous convergence there: (<em>f<sub>n<\/sub><\/em>)<em><sub>n<\/sub><\/em><sub> \u2208 N<\/sub> converges continuously to <em>f<\/em> if and only if for every point <em>x<\/em> and every sequence (<em>x<sub>n<\/sub><\/em>)<em><sub>n<\/sub><\/em><sub> \u2208 N<\/sub> of points of <em>X<\/em> that converges to <em>x<\/em>, for every \u03b5 &gt; 0, there are two indices <em>m<\/em><em><sub>0<\/sub><\/em>, <em>n<em><sub>0<\/sub><\/em><\/em> \u2208 N such that for all m \u2265 <em>m<\/em><em><sub>0<\/sub><\/em> and n \u2265 <em>n<\/em><em><sub>0<\/sub><\/em>, <em>d<\/em> (<em>f<\/em>(<em>x<\/em>), <em>f<sub>m<\/sub><\/em>(<em>x<sub>n<\/sub><\/em>)) &lt; \u03b5.\u00a0 Now show that if (<em>f<sub>n<\/sub><\/em>)<em><sub>n<\/sub><\/em><sub> \u2208 N<\/sub> converges continuously to <em>f<\/em>, then <em>f<\/em> is continuous (as suggested by Barth Shiki), and show (a) through (d), as before.<br \/>\nOne should also modify Exercise 5.4.17, which should now read: Show that the notion of continuous convergence defined in Definition 5.4.15 coincides with the notion of Exercise 3.5.18 for sequences (<em>f<sub>n<\/sub><\/em>)<em><sub>n<\/sub><\/em><sub> \u2208 N<\/sub> of continuous maps from a metric space <em>X<\/em> to a metric space <em>Y<\/em>.<\/li>\n<li>p.48, Lemma 4.1.10: &#8220;A family <em>B<\/em> of subsets of a topological space <em>X<\/em> is a base &#8230;&#8221;: should read &#8220;A family <em>B<\/em> of <strong>open<\/strong> subsets of a topological space <em>X<\/em> is a base &#8230;&#8221;.\u00a0 Otherwise, e.g., the family of all subsets of <em>X<\/em> would be a base&#8230; (found, Dec 24, 2013).<\/li>\n<li>p.121, Exercise 5.1.3: &#8220;Show that, in <em>N<\/em><sub>2<\/sub>, <em>x<\/em> \u226a <em>y<\/em> iff <em>x<\/em> \u2264 <em>y<\/em> and <em>x<\/em>, <em>y<\/em> \u2260 \u03c9&#8221; is wrong. You should instead show that the relation \u226a is <em>empty<\/em>: <em>x<\/em> \u226a <em>y<\/em> for <em>no<\/em> pair of elements <em>x<\/em>, <em>y<\/em>. In any case the conclusion that no element is way-below \u03c9 remains. (Found by Weng Kin Ho, Sep 04, 2014.)<\/li>\n<li>p.156, Exercise 5.4.12. \u00a0You should ignore the last part of the exercise, which asks you to show that\u00a0<strong>Q<\/strong> and the Sorgenfrey line are not consonant. \u00a0That is true, but much more involved than the simplistic argument I am proposing. \u00a0As far as <strong>Q<\/strong> is concerned, see A. Bouziad, <a title=\"Borel measures in consonant spaces\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/0166864195000895#\"><em>Borel measures in consonant spaces<\/em><\/a>, Topology and its Applications 70 (1996):125\u2014138; C. Costantini and S. Watson, <a title=\"On the dissonance of some metrizable spaces\" href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166864197000965#\"><em>On the dissonance of some metrizable spaces<\/em><\/a>,\u00a0Topology and its Applications 84 (1998):259\u2014268. \u00a0As far as the Sorgenfrey line is concerned, see B. Alleche and J. Calbrix,\u00a0<em><a href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166864197002691\">On the coincidence of the upper Kuratowski topology with the cocompact topology<\/a>,<\/em>\u00a0Topology and its Applications 93(3):207\u2014218, 1999. \u00a0(found, Jul 10, 2015.) \u00a0See also <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=3685\">this page<\/a> for the Sorgenfrey line (added, April 22, 2022.)<\/li>\n<li>p.474, Exercise 9.7.53: the coefficient ring should be <strong>C<\/strong> throughout, not <strong>Z<\/strong>.\u00a0 Everything works with <strong>Z<\/strong> or <strong>C<\/strong> indifferently, except for Hilbert&#8217;s Nullstellensatz, which requires the coefficient ring to be an algebraically closed field.\u00a0 This is the case for <strong>C<\/strong>, but certainly not for <strong>Z<\/strong>.\u00a0 In particular, the final sentence should read &#8220;Using Kaplansky&#8217;s Theorem, show that, up to homeomorphism, the spectrum of <strong>Z<\/strong>[<em>X<\/em><sub>1<\/sub>, &#8230;, <em>X<sub>m<\/sub><\/em>] is the sobrification of <strong>C<\/strong><em><sup>m<\/sup><\/em> in its Zariski topology.&#8221; (found, Nov 17, 2014.)<\/li>\n<li>p.216, Exercise 6.3.10 and p.268, Exercise 7.2.4 and p.285, Exercise 7.3.12: the Sorgenfrey quasi-metric was defined with its arguments swapped.\u00a0 In other words, what I defined here is the opposite of the Sorgenfrey quasi-metric.\u00a0 The actual definition is: d<sub>l<\/sub>(<em>r<\/em>,<em>s<\/em>)=<em>s<\/em>\u2014<em>r<\/em> if <em>s<\/em>\u2265<em>r<\/em>, +\u221e otherwise.\u00a0 This is important if you want to retrieve the topology of the Sorgenfrey line in Exercise 6.3.10.<br \/>\nThis has no consequence in the remaining places where the Sorgenfrey quasi-metric is mentioned, except in Exercise 7.3.12: you should replace <em>x<\/em> by \u2014<em>x<\/em>, essentially.\u00a0 That is, the required isomorphism should send (<em>x<\/em>,<em>r<\/em>) to (<em>x<\/em>,\u2014<em>x<\/em>\u2014<em>r<\/em>), not to (\u2014<em>x<\/em>,<em>x<\/em>\u2014<em>r<\/em>), you should show that the least upper bound of (<em>x<sub>i<\/sub><\/em>, <em>r<sub>i<\/sub><\/em>) is (sup<em><sub>i<\/sub><\/em> <em>x<sub>i<\/sub><\/em>, inf<em><sub>i<\/sub><\/em> <em>r<sub>i<\/sub><\/em>), and that (<em>x<\/em>,<em>r<\/em>) \u226a (<em>y<\/em>,<em>s<\/em>) iff <em>x<\/em> &lt; <em>y<\/em> and <em>y<\/em>\u2014<em>x<\/em> &lt; <em>r<\/em>\u2014<em>s<\/em>. (found, Mar 30, 2016.)<\/li>\n<li>p.339, Exercise 7.7.20.\u00a0 The exercise is wrong.\u00a0 Indeed, the continuous open images of complete metric spaces are all first-countable (see Exercise 6.3.14), but there are spaces with a continuous model that are not first-countable.\u00a0 An example is given by {0,1}<em><sup>I<\/sup><\/em> for an uncountable set <em>I<\/em>, which is not-first countable (see Exercise 6.5.9) but is compact Hausdorff, hence has a model by Corollary 8.3.27.\u00a0 I don&#8217;t know of any reasonable condition on <em>Y<\/em> that would make the result true.\u00a0 (found by Ng Kok Min, Feb 26, 2017.)<\/li>\n<li>p.387, Lemma 8.4.12.\u00a0 This only works provided <em>Y<\/em> is T<sub>0<\/sub>.\u00a0 In other words, the equalizer of two continuous maps from a sober space <em>X <\/em>to a\u00a0T<sub>0<\/sub> space\u00a0<em>Y<\/em> is sober.\u00a0 If <em>Y<\/em> is not required to be T<sub>0<\/sub>, then one can get absolutely any subspace <em>A<\/em> of <em>X<\/em> as an equalizer (let <em>f<\/em> map the elements of <em>A<\/em> to 1 and all others to 2, let <em>g<\/em> map the elements of <em>A<\/em> to 1 and all others to 3, where {1,2,3} is given the indiscrete topology).\u00a0 The proof is unchanged, except that at line 5, \u2264 is of course the specialization ordering of <em>Y<\/em>, not <em>X<\/em>, and that is an ordering because <em>Y<\/em> is T<sub>0<\/sub>. (found by Zhenchao Lyu and Xiaodong Jia, Feb 08, 2019.)<\/li>\n<li>p.463, Theorem 9.7.12, &#8220;the set \u2191<em>x<\/em> \u2229 \u2191<em>y<\/em>\u00a0of common upper bounds of <em>x<\/em> and\u00a0<em>y<\/em>&#8221; should read &#8220;the set \u2193<em>x<\/em> \u2229 \u2193<em>y<\/em>\u00a0of common lower bounds of <em>x<\/em> and\u00a0<em>y<\/em>&#8220;. \u00a0The same error occurs at line 5 of the second paragraph of the proof (found by\u00a0\u6c88\u51b2 [Shen Chong], May 24, 2019).<\/li>\n<li>p.384, Lemma 8.4.5 and Theorem 8.4.6 are wrong. \u00a0The mistake is in line 3 of the proof of Lemma 8.4.5: yes,\u00a0<strong>S<\/strong> preserves coequalizers, but that means that\u00a0<strong>S<\/strong>(<em>q<\/em><sub>\u2261<\/sub>) is a coequalizer in the category\u00a0<strong>Sob<\/strong> of sober spaces, <em>not<\/em> the category\u00a0<strong>Top<\/strong> of topological spaces&#8230; and coequalizers in\u00a0<strong>Sob<\/strong> need not be surjective. \u00a0In fact <em>every<\/em> topological space at all can be obtained as a topological quotient of a sober space, and even of a Hausdorff space, by a <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=1884\">result of M. Shimrat<\/a> of 1956.\u00a0 In general, coequalizers and colimits in\u00a0<strong>Sob<\/strong> are just what I said at the beginning of Section 8.4.1: sobrifications of the corresponding limits taken in\u00a0<strong>Top<\/strong>. \u00a0(found by Marcus Tressl, June 19, 2019)<\/li>\n<li>p.85, Exercise 4.7.14. \u00a0It is asked to prove that &#8220;for every subset\u00a0<em>A<\/em> of\u00a0<em>X<\/em>,\u00a0<em>A<\/em> is the set of all limits of sequences (<em>x<sub>i<\/sub><\/em>)<em><sub>i<\/sub><\/em><sub> \u2208 <\/sub><strong><sub>N<\/sub><\/strong>&#8220;. \u00a0That should read\u00a0&#8220;for every subset\u00a0<em>A<\/em> of\u00a0<em>X<\/em>, cl(<em>A<\/em>) is the set of all limits of sequences (<em>x<sub>i<\/sub><\/em>)<em><sub>i<\/sub><\/em><sub> \u2208 <\/sub><strong><sub>N<\/sub><\/strong>\u00a0of points of <em>A<\/em>&#8220;. \u00a0(found, December 05, 2019)<\/li>\n<li>p.136, Proposition 5.1.60 (Scott&#8217;s formula), Corollary 5.1.61, Proposition 5.1.67, Proposition 5.1.69. \u00a0It is assumed that\u00a0<em>Y<\/em> is a bdcpo for those to apply, but that is not enough. \u00a0You either need\u00a0<em>Y<\/em> to be a dcpo, or\u00a0<em>Y<\/em> to be a bdcpo and\u00a0<em>B<\/em> to be cofinal in\u00a0<em>X<\/em> (namely, every element of\u00a0<em>X<\/em> is below some element of\u00a0<em>B<\/em>; that happens if\u00a0<em>B<\/em>=<em>X<\/em>, notably). \u00a0The mistake lies in the first lines of the proof of Proposition 5.1.60: &#8220;&#8230; since {<em>f<\/em>(<em>b<\/em>) |\u00a0<em>b<\/em> \u2208\u00a0<em>B<\/em>,\u00a0<em>b<\/em> \u226a\u00a0<em>x<\/em>}\u00a0is directed, using the fact that <em>f<\/em> is monotonic; and it has an upper bound, namely\u00a0<em>f<\/em>(<em>x<\/em>). \u00a0So it has a least upper bound, since <em>Y<\/em> is a bdcpo.&#8221; \u00a0If\u00a0<em>Y<\/em> is a dcpo, there is no problem: the family \u00a0{<em>f<\/em>(<em>b<\/em>) |\u00a0<em>b<\/em> \u2208\u00a0<em>B<\/em>,\u00a0<em>b<\/em> \u226a\u00a0<em>x<\/em>}\u00a0is directed, so it has a least upper bound. \u00a0If\u00a0<em>Y<\/em> is a mere bdcpo,\u00a0<em>f<\/em>(<em>x<\/em>) is meaningless, since\u00a0<em>f<\/em> only applies to elements of\u00a0<em>B<\/em>. \u00a0But, if\u00a0<em>B<\/em> is cofinal in\u00a0<em>X<\/em>, then\u00a0<em>x<\/em>\u2264<em>b&#8217;<\/em> for some\u00a0<em>b&#8217;<\/em> in\u00a0<em>B<\/em>, and then\u00a0<em>f<\/em>(<em>b&#8217;<\/em>) is an upper bound of the family, which then has a least upper bound. \u00a0(found, February 7th, 2022.)<\/li>\n<\/ol>\n<h2>The less important ones second:<\/h2>\n<ol>\n<li>p.25, Proposition 3.25, proof, second paragraph, second line: \u00a0&#8220;<em>F<\/em>=\u22c2<em><sub>i in I<\/sub><\/em> <em>F<sub>i<\/sub><\/em>&#8221; should read &#8220;<em>F<\/em>=\u22c3<em><sub>i in I<\/sub><\/em> <em>F<sub>i<\/sub><\/em>&#8221; (found by anon1, May 22, 2013).<\/li>\n<li>p.396, Shmuely&#8217;s Theorem 8.4.29: I have been told it should be credited to George N. Raney (mentioned by A. Jung, March 22, 2013).\u00a0 Raney&#8217;s celebrated paper (1952) is <a title=\"Completely distributive complete lattices\" href=\"https:\/\/www.jstor.org\/stable\/2032165\">https:\/\/www.jstor.org\/stable\/2032165<\/a>, but maybe this is not the right one: I&#8217;ve been unable to find it there yet.<\/li>\n<li>p.478, Reference to Nachbin 1965, was reprinted by Robert E. Krieger Publishing Co., not &#8220;Robert E. Kreiger Publishing Co.&#8221; (May 13, 2013).<\/li>\n<li>p.5, Union Axiom, definition of &#8220;\u222a <em>x<\/em> = \u222a<sub><em>y<\/em> \u2208 <em>x<\/em><\/sub> <em>y<\/em>&#8221; is missing a condition on <em>z<\/em>: this should be &#8220;\u222a <em>x<\/em> = \u222a<sub><em>y<\/em> \u2208 <em>x<\/em><\/sub> <em>y<\/em> = {<em>z<\/em> | \u2203 <em>y<\/em> \u22c5 <em>m<\/em> (<em>y<\/em>) and <em>z<\/em> \u2208 <em>y<\/em> and <em>y<\/em> \u2208 <em>x<\/em>} is a set; i.e., <em>m<\/em> ({<em>z<\/em> | \u2203 <em>y<\/em> \u22c5 <em>m<\/em> (<em>y<\/em>) and <em>z<\/em> \u2208 <em>y<\/em> and <em>y<\/em> \u2208 <em>x<\/em>})&#8221; (found by Barth Shiki, July 13, 2013).<\/li>\n<li>p.20, Exercise 3.1.5, the hint is missing a power <em>p<\/em> to the 1-\u03bb denominator: this should be |<em>b<sub>i<\/sub><\/em>|<em><sup>p<\/sup><\/em> \/ (1-\u03bb)<em><sup>p<\/sup><\/em>, not |<em>b<sub>i<\/sub><\/em>|<em><sup>p<\/sup><\/em> \/ (1-\u03bb) (found by Barth Shiki, July 16, 2013).<\/li>\n<li>p.30, line 14: &#8220;<em>d<\/em> (<em>z<\/em><sup>\u2192<\/sup>, <em>y<\/em><sup>\u2192<\/sup>) \u2264 2<em>na<\/em>\/2<em><sup>k<\/sup><\/em>&#8220;: should be <em>d<\/em> (<em>z<\/em><sup>\u2192<\/sup>, <em>y<\/em><sup>\u2192<\/sup>) \u2264 <em>n<\/em> (2<em>a<\/em>\/2<em><sup>k<\/sup><\/em>)<em><sup>p<\/sup><\/em>.\u00a0 Now also correct line 11 so that it say &#8220;let <em>k<\/em> be such that <em>n<\/em> (2<em>a<\/em>\/2<em><sup>k<\/sup><\/em>)<em><sup>p<\/sup><\/em> &lt; \u03b5<em><sup>p<\/sup><\/em>&#8220;, and the proof can proceed to the desired conclusion (found by Barth Shiki, July 16, 2013).<\/li>\n<li>p.42, proof of Proposition 3.5.10, line 6: this implicitly uses the inequality <em>d&#8217;<\/em> (<em>f<\/em>(<em>x&#8217;<\/em>), <em>f<\/em>(<em>x<\/em>)) \u2264 \u03b5\/3, and this was neither proved nor assumed (found by Barth Shiki, July 16, 2013).\u00a0 Add the following argument before the sentence starting with &#8220;Using the triangular inequality and the axiom of symmetry&#8221;: &#8220;From the inequality <em>d&#8217;<\/em> (<em>f<em><sub>n<\/sub><\/em><\/em>(<em>x<\/em>), <em>f<\/em><em><sub>n<\/sub><\/em>(<em>x&#8217;<\/em>)) \u2264 \u03b5\/3, we easily deduce <em>d&#8217;<\/em> (<em>f<\/em>(<em>x<\/em>), <em>f<\/em>(<em>x&#8217;<\/em>)) \u2264 \u03b5\/3, by taking limits over <em>n<\/em> \u2265 <em>n<em><em><sub>x<\/sub><\/em><\/em><\/em>, with <em>x<\/em> and <em>x<\/em>&#8216; fixed; explicitly, for every \u03b5&#8217; &gt; 0, we have <em>d&#8217;<\/em> (<em>f<\/em>(<em>x<\/em>), <em>f<em><sub>n<\/sub><\/em><\/em>(<em>x<\/em>)) &lt; \u03b5&#8217;\/2 and <em>d&#8217;<\/em> (<em>f<\/em>(<em>x&#8217;<\/em>), <em>f<em><sub>n<\/sub><\/em><\/em>(<em>x&#8217;<\/em>)) &lt; \u03b5&#8217;\/2 for <em>n<\/em> \u2265 <em>n<em><em><sub>x<\/sub><\/em><\/em><\/em> large enough, so that the triangular inequality and the axiom of symmetry yield<em> d&#8217;<\/em> (<em>f<\/em>(<em>x<\/em>), <em>f<\/em>(<em>x&#8217;<\/em>)) \u2264 <em>d&#8217;<\/em> (<em>f<\/em>(<em>x<\/em>), <em>f<em><sub>n<\/sub><\/em><\/em>(<em>x<\/em>)) + <em>d&#8217;<\/em> (<em>f<em><sub>n<\/sub><\/em><\/em>(<em>x<\/em>), <em>f<\/em><em><sub>n<\/sub><\/em>(<em>x&#8217;<\/em>)) + <em>d&#8217;<\/em> (<em>f<em><sub>n<\/sub><\/em><\/em>(<em>x&#8217;<\/em>), <em>f<\/em>(<em>x&#8217;<\/em>)) \u2264 \u03b5\/3 + \u03b5&#8217;; since \u03b5&#8217; is arbitrary, <em>d&#8217;<\/em> (<em>f<\/em>(<em>x<\/em>), <em>f<\/em>(<em>x&#8217;<\/em>)) \u2264 \u03b5\/3.&#8221;<\/li>\n<li>p.43, proof of Theorem 3.5.12, l.10, there is a finite subset <em><em>E<sub>i<\/sub><\/em><\/em> such that is <em><em>K<sub>x<sub>i<\/sub><\/sub><\/em><\/em>, not <em>K<\/em>, is included in the union of open balls centered at the points <em>y<\/em> of <em><em>E<sub>i<\/sub><\/em><\/em> (found by Barth Shiki, July 16, 2013).<\/li>\n<li>p.44, l.10, there is an argument missing at the end of this paragraph.\u00a0 We have shown that <em>f<em><sub>n<\/sub><\/em><\/em> converged to <em>f<\/em> uniformly, but we must also show that <em>f<\/em> is in (calligraphic)<em> K<\/em>.\u00a0 This follows from the unused (until now) assumption 3 (found by Barth Shiki, July 16, 2013).<\/li>\n<li>p.61, right before Exercise 4.2.24, remove sentence &#8220;If so, then a subset <em>U<\/em> of <em>X<\/em> would be Scott-open iff it is upward closed and every chain having a least upper bound in <em>U<\/em> meets <em>U<\/em>.&#8221;\u00a0 Not only is it hard to see why it contributes to the argument, but this claim is actually true&#8230; see Exercise 4.2.26 (found by Barth Shiki, July 19, 2013).<\/li>\n<li>p.65, remark after Proposition 4.3.9.\u00a0 More generally, every function from a <em><em>T<sub>1<\/sub><\/em><\/em> space to an arbitrary space is monotonic (mentioned by Barth Shiki, July 19, 2013).<\/li>\n<li>p.68, proof of Proposition 4.4.7, l.3, &#8220;such that <em>U<sub>i<sub>1<\/sub><\/sub><\/em>, &#8230;,\u00a0<em>U<sub>i<sub>n<\/sub><\/sub><\/em> \u2286 <em>U<\/em>&#8221; should be &#8220;such that <em>U<sub>i<sub>1<\/sub><\/sub><\/em>, &#8230;,\u00a0<em>U<sub>i<sub>n<\/sub><\/sub><\/em> \u2286 <em>U<sub>i<\/sub><\/em>&#8221; (found by Barth Shiki, July 19, 2013).<\/li>\n<li>p.71, proof of Proposition 4.4.17, lines 10-11, replace &#8220;<em>F&#8217;<\/em> is compact, so extract a finite subcover (<em>V<sub>x<\/sub><\/em>)<em><sub>x<\/sub><\/em><sub> \u2208 E<\/sub> of <em>F&#8217;<\/em>&#8221; by &#8220;<em>F<\/em> is compact, so extract a finite subcover (<em>U<sub>x<\/sub><\/em>)<em><sub>x<\/sub><\/em><sub> \u2208 E<\/sub> of <em>F<\/em>&#8221; (found by Barth Shiki, July 19, 2013).<\/li>\n<li>p.312, Fact 7.5.23, there are extraneous &#8216;<strong>Y<\/strong>&#8216; subscripts to the categories <strong>YCQMet<\/strong> and <strong>YCQMet<sub>u<\/sub><\/strong>; they should be ignored (found, April 9, 2016).<\/li>\n<li>p.34, before Theorem 3.4.5, and p.209, Definition 6.2.2: <em>c<\/em>-Lipschitz maps are defined in the expected way, as those maps <em>f<\/em> such that <em>d<\/em>(<em>f<\/em>(<em>x<\/em>),<em>f<\/em>(<em>y<\/em>)) \u2264 <em>c<\/em>.<em>d<\/em>(<em>x<\/em>,<em>y<\/em>).\u00a0 This is however meaningless when <em>c<\/em>=0 and <em>d<\/em>(<em>x<\/em>,<em>y<\/em>)=+\u221e.\u00a0 This is repaired by taking the convention that 0.+\u221e=+\u221e.\u00a0 That convention is important: with that convention, <em>f<\/em> is <em>c<\/em>-Lipschitz if and only if <strong>B<\/strong><em><sup>c<\/sup><\/em>(<em>f<\/em>) is monotonic, and <em>f<\/em> is <em>c<\/em>-Lipschitz Yoneda-continuous if and only if <strong>B<\/strong><em><sup>c<\/sup><\/em>(<em>f<\/em>) is Scott-continuous (Proposition 7.4.38), but the equivalence would fail with any other convention (found, Sept. 14, 2016).<\/li>\n<li>p.293, Lemma 7.4.17.\u00a0 The proof needs to be fixed (the Lemma holds).\u00a0 The problem stems from the fact that the family (<em>r<sub>i<\/sub><\/em>)<em><sub>i \u2208 I<\/sub><\/em> is implicitly assumed to be filtered, which it need not be.\u00a0 This is repaired by noticing that the family\u00a0(<em>r<sub>i<\/sub><\/em>+<em>s<sub>i<\/sub><\/em>)<em><sub>i \u2208 I<\/sub><\/em> is filtered.\u00a0 Here is the amended proof. Let ((<em>x<sub>i<\/sub><\/em>, <em>r<sub>i<\/sub><\/em>), <em>s<sub>i<\/sub><\/em>)<em><sub>i \u2208 I, \u2291<\/sub><\/em> be a Cauchy-weighted net in <strong>B<\/strong>(<em>X<\/em>, <em>d<\/em>).\u00a0 If <em>i<\/em> \u2291 <em>j<\/em> then <em>d<\/em><sup>+<\/sup> ((<em>x<sub>i<\/sub><\/em>, <em>r<sub>i<\/sub><\/em>), (<em>x<sub>j<\/sub><\/em>, <em>r<sub>j<\/sub><\/em>)) \u2264 <em>s<sub>i<\/sub><\/em>\u2013<em>s<sub>j<\/sub><\/em>, and this implies both <em>s<sub>i<\/sub><\/em>\u2265<em>s<sub>j<\/sub><\/em>, and <em>d<\/em> (<em>x<sub>i<\/sub><\/em>,<em>x<sub>j<\/sub><\/em>) \u2264 <em>r<sub>i<\/sub><\/em>+<em>s<sub>i<\/sub><\/em>\u2013(<em>r<sub>j<\/sub><\/em>+<em>s<sub>j<\/sub><\/em>); in particular, <em>r<sub>i<\/sub><\/em>+<em>s<sub>i<\/sub><\/em>\u2265<em>r<sub>j<\/sub><\/em>+<em>s<sub>j<\/sub><\/em>.\u00a0 It follows that\u00a0(<em>s<sub>i<\/sub><\/em>)<em><sub>i \u2208 I<\/sub><\/em> and\u00a0(<em>r<sub>i<\/sub><\/em>+<em>s<sub>i<\/sub><\/em>)<em><sub>i \u2208 I<\/sub><\/em> are filtered families. Let <em>r<\/em>=inf<em><sub>i \u2208 I<\/sub><\/em> (<em>r<sub>i<\/sub><\/em>+<em>s<sub>i<\/sub><\/em>). Then (<em>x<sub>i<\/sub><\/em>, <em>r<sub>i<\/sub><\/em>+<em>s<sub>i<\/sub><\/em>\u2013<em>r<\/em>)<em><sub>i \u2208 I, \u2291<\/sub><\/em> is Cauchy-weighted in <em>X, d<\/em>.\u00a0 Let <em>x<\/em> be the <em>d<\/em>-limit of (<em>x<sub>i<\/sub><\/em>)<em><sub>i \u2208 I, \u2291<\/sub><\/em>.\u00a0 By Lemma 7.4.9, <em>d<\/em>(<em>x<\/em>, <em>y<\/em>)=sup<em><sub>i \u2208 I<\/sub><\/em> (<em>d<\/em>(<em>x<sub>i<\/sub><\/em>, <em>y<\/em>)\u2013<em>r<sub>i<\/sub><\/em>\u2013<em>s<sub>i<\/sub><\/em>+<em>r<\/em>)), a directed supremum, for every <em>y<\/em> in <em>X<\/em>.\u00a0 By a similar argument as in the <a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>, it follows that for every formal ball (<em>y<\/em>, <em>s<\/em>), <em>d<\/em><sup>+<\/sup> ((<em>x<\/em>,\u00a0<em>r<\/em>), (<em>y<\/em>, <em>s<\/em>)) = sup<em><sub>i \u2208 I<\/sub><\/em> (<em>d<\/em><sup>+<\/sup> ((<em>x<sub>i<\/sub><\/em>,\u00a0<em>r<\/em>), (<em>y<\/em>, <em>s<\/em>)) \u2013 <em>s<sub>i<\/sub><\/em>), showing that (<em>x<\/em>,\u00a0<em>r<\/em>) is a <em>d<\/em><sup>+<\/sup>-limit of (<em>x<sub>i<\/sub><\/em>, <em>r<sub>i<\/sub><\/em>)<em><sub>i \u2208 I, \u2291<\/sub><\/em>.\u00a0 (found, Dec 1, 2016.)<\/li>\n<li>p.267, Proposition 7.1.20: &#8220;Every limit of any net (<em>x<sub>i<\/sub><\/em>)<em><sub>i \u2208 I, \u2291<\/sub><\/em> is a <em>d<sup>op<\/sup><\/em>-limit&#8221; should read &#8220;Every limit of any net (<em>x<sub>i<\/sub><\/em>)<em><sub>i \u2208 I, \u2291<\/sub><\/em> in <em>X<\/em>, <em>d<sup>sym<\/sup><\/em> is a <em>d<sup>op<\/sup><\/em>-limit&#8221;, as the proof makes clear.\u00a0 (found, Jan 17, 2017.)<\/li>\n<li>Section 7.5, p.311 and subsequent pages, the formal ball completion.\u00a0 One should give credit to Steve Vickers for that construction, see the reference below.\u00a0 I could say that I did not know of that when I wrote the <a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>, but that would not be true: Achim Jung had very kindly directed me to Steve&#8217;s work after I gave a talk on the subject at the Topology, Algebra, Categories and Logic conference in Marseilles in the summer of 2010&#8230; and I forgot about it.\u00a0 (found back, July 2016; inserted here, Jan 17, 2017.)\n<ul>\n<li>Vickers, Steven. <a href=\"https:\/\/www.tac.mta.ca\/tac\/volumes\/14\/15\/14-15.pdf\">Localic Completion of Generalized Metric Spaces I<\/a>. Theory and Application of Categories 14(15), pages 328-356, 2005.<\/li>\n<\/ul>\n<\/li>\n<li>p.198, Proposition 5.7.12.\u00a0 The assumption that <em>X<\/em> is core-coherent is not needed here.\u00a0 The result holds for every topological space <em>X<\/em> at all, provided that <em>Y<\/em> is a continuous poset.\u00a0 As a result, Proposition 5.7.13 and Proposition 5.7.14 also hold without any need for core-coherence.<br \/>\nThe use of core-coherence can be circumvented as follows.\u00a0 We first show that, if\u00a0<em>U<\/em> is open and <em>U<\/em> \u22d0 <em>f<\/em><sup>-1<\/sup>(\u219f<em>y<\/em>) then <em>U<\/em> &#x2198; <em>y<\/em> \u226a <em>f<\/em>.\u00a0 The proof is as in the <a href=\"https:\/\/www.cambridge.org\/gb\/knowledge\/isbn\/item7069109\/Non-Hausdorff%20Topology%20and%20Domain%20Theory\/?site_locale=en_GB\">book<\/a>, only simpler, since we do not need to handle several elementary step functions.\u00a0 Then we recall that a step function is a supremum of finitely many elementary step functions, and we note that, in any poset, if finitely many elements <em>f<sub>i<\/sub><\/em> are way-below a given element <em>f<\/em>, and they have a supremum, then that supremum is also way-below <em>f<\/em>; the proof of the latter is an easy exercise.\u00a0 (found, Jan 18, 2017.)<\/li>\n<li>p.432, comment between Proposition 9.5.28 and Proposition 9.5.29: general limits of spectral spaces in <strong>Top<\/strong> are not spectral in general.\u00a0 This is true, but the proposed argument is wrong. Since all spectral spaces are sober, and limits of sober spaces in <strong>Top<\/strong>, a limit of spectral spaces must be sober.\u00a0 In particular, we don&#8217;t obtain all T<sub>0<\/sub> spaces as such limits (found by Pawe\u0142 Bilski, May 23, 2017).\u00a0 To support the claim that limits of spectral spaces in <strong>Top<\/strong> need not be spectral, instead, consider some (non-Noetherian) spectral space <em>X<\/em>, and some open subset <em>U<\/em> of <em>X<\/em> that is not compact.\u00a0 Then the equalizer of \u03c7<em><sub>U<\/sub><\/em> and of the constant 1 map (both from <em>X<\/em> to <strong>S<\/strong>) is <em>U<\/em> itself, which cannot be spectral since it is not even compact.\u00a0 For an example of such a situation, take <em>X<\/em>=<strong>P<\/strong>(<strong>N<\/strong>) with the Scott topology of inclusion, and <em>U<\/em> be the set of non-empty subsets of <strong>N<\/strong>, i.e., the union of the open subsets \u2191{<em>n<\/em>}, <em>n<\/em> in <strong>N<\/strong>.<\/li>\n<li>p.440\u2014441, several places where one should assume the spaces to be T<sub>0<\/sub>.\u00a0 At the bottom of p.440, &#8220;In this case, each of <em>s<\/em>, <em>r<\/em> determines the other one&#8221; is true only if both <em>X<\/em> and <em>Y<\/em> are T<sub>0<\/sub>.\u00a0 On p.441, Lemma 9.6.5, the &#8220;unique associated section&#8221; is not unique unless <em>A<\/em><em><sub>j<\/sub><\/em> is T<sub>0<\/sub>, so one should assume given a projective system of T<sub>0<\/sub> spaces, not of general topological spaces (found, Feb 15, 2018).<\/li>\n<li>p.464, proof of Theorem 9.7.12, the paragraph starting with &#8220;We claim that each <em>E<sub>n<\/sub><\/em> contains exactly one element&#8221; contains a bug. \u00a0Precisely, the statement &#8220;So the sequence \u2193(\u2193<em>x<\/em> \u2229 <em>E<sub>n<\/sub><\/em>) \u2287 \u2193(\u2193<em>x<\/em> \u2229 <em>E<sub>n<\/sub><\/em><sub>+1<\/sub>) \u2287\u00a0\u00b7 \u00b7 \u00b7 can only contain finitely many distinct subsets&#8221; is faulty, since that sequence need not be descending in general. \u00a0 One must replace \u2193(\u2193<em>x<\/em> \u2229 <em>E<sub>n<\/sub><\/em>) by\u00a0\u2193<em>x<\/em> \u2229 \u2193<em>E<sub>n<\/sub><\/em>, and check that this is the downward closure of a finite set\u2014a direct consequence of property W (found by\u00a0\u6c88\u51b2 [Shen Chong], May 24, 2019).<br \/>\nExplicitly, one should replace\u00a0the faulty paragraph by the following one:<\/p>\n<ul>\n<li>We claim that each <em>E<sub>n<\/sub><\/em> contains exactly one element. Else, let <em style=\"font-size: inherit;\">n<\/em> be minimal\u00a0such that <em>E<sub>n<\/sub><\/em> contains at least two elements. For each <em>x<\/em> \u2208 <em>E<sub>n<\/sub><\/em>, {<em>x<\/em>} has strictly\u00a0less elements than <em>E<sub>n<\/sub><\/em>, hence is good. Noting that for every <em>m<\/em> \u2265 <em>n<\/em>, \u2193<em>x<\/em> \u2229 \u2193<em>E<sub>m<\/sub><\/em>\u00a0can be written as \u2193<em>F<sub>xm<\/sub><\/em>\u00a0for some finite set <em>F<sub>xm<\/sub><\/em>, using property W, and noting\u00a0that we can take <em>F<sub>xn<\/sub><\/em>\u00a0= {<em>x<\/em>}, the sequence \u2193<em>x<\/em>\u00a0=\u00a0 \u2193<em>F<sub>xn\u00a0<\/sub><\/em>\u2287 \u2193<em>x<\/em> \u2229 \u2193<em>E<sub>n<\/sub><\/em><sub>+1<\/sub>\u00a0= \u2193<em>F<sub>x<\/sub><\/em><sub>(<em>n<\/em>+1)\u00a0<\/sub>\u2287 &#8230; \u2287\u00a0\u2193<em>x<\/em> \u2229 \u2193<em>E<sub>m<\/sub><\/em>\u00a0= \u2193<em>F<sub>x<\/sub><\/em><sub><em>m<\/em>\u00a0<\/sub>\u2287 &#8230;\u00a0can only contain finitely many\u00a0distinct subsets. It follows that there is an <em>N<sub>x<\/sub><\/em> \u2265 <em>n<\/em> such that \u2193<em>x<\/em> \u2229 \u2193<em>E<sub>m<\/sub><\/em>\u00a0= \u2193<em>x<\/em> \u2229 \u2193<em>E<sub>Nx<\/sub><\/em> for every <em>m<\/em>\u2265<em>N<sub>x<\/sub><\/em>. \u00a0Since <em>E<sub>n<\/sub><\/em> is finite, there is a natural number <em>N<\/em>\u00a0above every <em>N<sub>x<\/sub><\/em>, <em>x<\/em> \u2208 <em>E<sub>n<\/sub><\/em>. \u00a0For every <em>m<\/em>\u2265<em>N<\/em>, then, \u2193<em>x<\/em> \u2229 \u2193<em>E<sub>m<\/sub><\/em>\u00a0= \u2193<em>x<\/em> \u2229 \u2193<em>E<sub>N<\/sub><\/em>,\u00a0both sides being equal to \u2193<em>x<\/em> \u2229 \u2193<em>E<sub>Nx<\/sub><\/em>. \u00a0We then have \u2193<em>E<sub>m<\/sub><\/em>\u00a0= \u2193<em>E<sub>n<\/sub><\/em>\u00a0\u2229 \u2193<em>E<sub>m<\/sub><\/em>\u00a0(since \u2193<em>E<sub>n<\/sub><\/em>\u00a0\u2287 \u2193<em>E<sub>m<\/sub><\/em>) =\u00a0\u222a<em><sub>x <\/sub><\/em><sub>\u2208\u00a0<\/sub><em><sub>En<\/sub><\/em>\u00a0(\u2193<em>x<\/em> \u2229 \u2193<em>E<sub>m<\/sub><\/em>) =\u00a0\u222a<em><sub>x <\/sub><\/em><sub>\u2208\u00a0<\/sub><em><sub>En<\/sub><\/em>\u00a0(\u2193<em>x<\/em> \u2229 \u2193<em>E<sub>N<\/sub><\/em>) = \u2193<em>E<sub>n<\/sub><\/em>\u00a0\u2229 \u2193<em>E<sub>N\u00a0<\/sub><\/em>= \u2193<em>E<sub>N<\/sub><\/em>. \u00a0Taking <em>m<\/em>=<em>N<\/em>+1, this contradicts \u2193<em>E<sub>N<\/sub><\/em>\u00a0\u2283 \u2193<em>E<sub>N<\/sub><\/em><sub>+1<\/sub>.<\/li>\n<\/ul>\n<\/li>\n<li>p.465, line 4 (inside Exercise 9.7.29), the closed subset (curly) <em>F<\/em> of <em>X*<\/em> should be assumed non-empty, otherwise the complement does not have the right form (found by \u6c88\u51b2 [Shen Chong], May 31, 2019).<\/li>\n<li>p.186, before Fact 5.6.14, &#8220;Since\u00a0<strong>C<\/strong> is a left adjoint, it preserves all colimits, whence&#8221;&#8230; but\u00a0<strong>C<\/strong> is a\u00a0<em>right<\/em> adjoint, not a left adjoint. \u00a0Fact 5.6.14 nonetheless holds (found by Xiaodong Jia, July 09, 2019), but the sentence we just cited must be replaced by the following more complex justification:\n<ul>\n<li>Since the inclusion functor from <strong>Top<sub>C<\/sub><\/strong> into <strong>Top<\/strong> is a left adjoint, it preserves\u00a0all colimits, so all colimits in the former must be computed as in <strong>Top<\/strong>. The latter\u00a0are quotients of coproducts taken in <strong>Top<\/strong> (Example 4.12.12). Let us check that the result is <strong>C<\/strong>-generated.\u00a0For every family (<em>X<sub>i<\/sub><\/em>)<em><sub>i<\/sub><\/em><sub> \u2208 <\/sub><em><sub>I<\/sub><\/em>\u00a0of <strong>C<\/strong>-generated spaces, we check that X = \u2210<em><sub>i<\/sub><\/em><sub> \u2208 <\/sub><em><sub>I<\/sub><\/em> <em>X<sub>i<\/sub><\/em> is <strong>C<\/strong>-generated: given any subset <em>U<\/em> of <em>X<\/em> such that <em>k<\/em><sup>-1<\/sup>(<em>U<\/em>) is open in <em>C<\/em> for every <strong>C<\/strong>-probe <em>k\u00a0<\/em>: <em>C<\/em> \u2192 <em>X<\/em>, in particular <em>k<\/em><sup>-1<\/sup>(\u03b9<em><sub>i<\/sub><\/em><sup>-1<\/sup>(<em>U<\/em>)) is open in <em>C<\/em> for every <strong>C<\/strong>-probe <em>k\u00a0<\/em>: <em>C<\/em> \u2192 <em>X<sub>i<\/sub><\/em> and every <em>i<\/em> \u2208 <em>I<\/em>, since then \u03b9<em><sub>i<\/sub><\/em>\u00a0o <em>k<\/em> is a <strong>C<\/strong>-probe, too; since <em>X<sub>i<\/sub><\/em> is <strong>C<\/strong>-generated, \u03b9<em><sub>i<\/sub><\/em><sup>-1<\/sup>(<em>U<\/em>) is open in <em>X<sub>i<\/sub><\/em> for every <em>i<\/em> \u2208 <em>I<\/em>, and that is enough to conclude that <em>U<\/em> is open in <em>X<\/em>. Similarly, if <em>X<\/em> is <strong>C<\/strong>-generated and <em>q\u00a0<\/em>: <em>X<\/em> \u2192 <em>Y<\/em> is quotient, then <em>Y<\/em> is <strong>C<\/strong>-generated: given any subset <em>V<\/em> of <em>Y<\/em> such that <em>k<\/em><sup>-1<\/sup>(<em>V<\/em>) is open in <em>C<\/em> for every <strong>C<\/strong>-probe <em>k<\/em> : <em>C<\/em> \u2192 <em>Y<\/em> , then this holds in particular for all the <strong>C<\/strong>-probes <em>q<\/em> o <em>k<\/em> with <em>k\u00a0<\/em>: <em>C<\/em> \u2192 <em>X<\/em>; so, using the fact that <em>X<\/em> is <strong>C<\/strong>-generated, <em>q<\/em><sup>-1<\/sup>(<em>V<\/em>) is open in <em>X<\/em>, and because <em>q<\/em> is quotient, <em>V<\/em> is open in <em>Y<\/em>. It follows that all colimits of <strong>C<\/strong>-generated spaces in <strong>Top<\/strong> are <strong>C<\/strong>-generated, and are the corresponding colimits in <strong>Top<sub>C<\/sub><\/strong>.<\/li>\n<\/ul>\n<\/li>\n<li>p.343, Exercise 8.1.4, &#8220;Show that \u00a0[&#8230;] the complete Heyting algebras are exactly the Cartesian-closed, small, thin categories.&#8221; \u00a0That is wrong. \u00a0A complete Heyting algebra is, in particular, a poset, not just a preordered set. \u00a0As a category, it must therefore be\u00a0<em>separated<\/em>, in the sense that any two isomorphic objects are equal. \u00a0The statement should therefore read &#8220;Show that \u00a0[&#8230;] the complete Heyting algebras are exactly the Cartesian-closed, small, separated thin categories.&#8221; (found, March 06, 2021.)<\/li>\n<li>p.471, proof of Lemma 9.7.45: &#8220;Take any element\u00a0<em>t\u00a0<\/em>of\u00a0<em>V<sub><em>n<sub>q<\/sub>i<sub>q<\/sub><\/em><\/sub>\u00a0<\/em>=\u00a0\u03c0<em><em><sub><em>n<sub>q<\/sub>i<sub>q<\/sub><\/em><\/sub><\/em>\u00a0<\/em>\\(\u03c0<sub>0\u00a0<\/sub>\u222a \u03c0<sub>1<\/sub>\u00a0\u222a \u00b7\u00b7\u00b7 \u222a \u03c0<sub><em><em>n<\/em><\/em><sub>0<\/sub>\u20131<\/sub>\u00a0\u222a \u03c0<sub><em><em>n<\/em><\/em><sub>0<\/sub><\/sub>\u00a0 \u222a \u00b7\u00b7\u00b7 \u222a \u03c0<sub><em><em>n<\/em><\/em><sub><em>q<\/em><\/sub>\u20131<\/sub>), in particular\u00a0<em>t\u00a0<\/em>is in \u03c0<em><em><sub><em>n<sub>q<\/sub>i<sub>q<\/sub><\/em><\/sub><\/em>\u00a0<\/em>hence in\u00a0\u03c0<sub>0<\/sub>\u00a0\u222a \u03c0<sub>1<\/sub>\u00a0\u222a \u00b7\u00b7\u00b7 \u222a \u03c0<sub><em><em>n<\/em><\/em><sub>0<\/sub>\u20131<\/sub>\u00a0\u222a \u03c0<em><em><sub><em>n<\/em><\/sub><\/em><\/em><sub><sub>0<\/sub><\/sub><em><em><sub><em>i<\/em><\/sub><\/em><\/em><sub><sub>0<\/sub><\/sub>\u00a0\u222a \u03c0<em><em><sub><em>n<\/em><\/sub><\/em><\/em><sub><sub>1<\/sub><\/sub><em><em><sub><em>i<\/em><\/sub><\/em><\/em><sub><sub>1\u00a0<\/sub><\/sub>\u222a \u00b7\u00b7\u00b7 \u222a \u03c0<em><em><sub><em>n<sub>q<\/sub><\/em><\/sub><\/em><\/em><sub><sub>\u20131<\/sub><\/sub><em><em><sub><em>i<sub>q<\/sub><\/em><\/sub><\/em><\/em><sub><sub>\u20131<\/sub><\/sub>. Since\u00a0<em>t\u00a0<\/em>is not in \u03c0<sub>0<\/sub>\u00a0\u222a \u03c0<sub>1<\/sub>\u00a0\u222a \u00b7\u00b7\u00b7 \u222a \u03c0<sub><em><em>n<\/em><\/em><sub>0<\/sub>\u20131<\/sub>,\u00a0<em>t\u00a0<\/em>must be in some \u03c0<em><em><sub><em>n<sub>r<\/sub>i<sub>r<\/sub><\/em><\/sub><\/em>\u00a0<\/em>\\(\u03c0<sub>0<\/sub>\u00a0\u222a \u03c0<sub>1<\/sub>\u00a0\u222a \u00b7\u00b7\u00b7 \u222a \u03c0<sub><em>n<\/em><sub>0<\/sub>\u20131<\/sub>\u00a0\u222a \u03c0<sub><em>n<\/em><sub>0<\/sub><\/sub>\u00a0\u222a \u00b7\u00b7\u00b7 \u222a \u03c0<sub><em>n<\/em><sub><em>q<\/em><\/sub>\u20131<\/sub>) with <em>r\u00a0<\/em>&lt;<em>q<\/em>, hence in<em> <em>V<sub><em>n<sub>r<\/sub>i<sub>r<\/sub><\/em><\/sub><\/em><\/em>.&#8221; \u00a0The very last claim is only true if <em>n<sub>r<\/sub><\/em>&lt;<em>n<sub>q<\/sub><\/em>, in which case\u00a0<em>t<\/em> is indeed in <em>V<sub><em>n<sub>r<\/sub>i<sub>r<\/sub><\/em><\/sub><\/em>=\u03c0<em><em><sub><em>n<sub>r<\/sub>i<sub>r<\/sub><\/em><\/sub><\/em>\u00a0<\/em>\\(\u03c0<sub>0<\/sub>\u00a0\u222a \u03c0<sub>1<\/sub>\u00a0\u222a \u00b7\u00b7\u00b7 \u222a \u03c0<sub><em>n<\/em><sub>0<\/sub>\u20131<\/sub>\u00a0\u222a \u03c0<sub><em>n<\/em><sub>0<\/sub><\/sub>\u00a0\u222a \u00b7\u00b7\u00b7 \u222a \u03c0<sub><em>n<\/em><sub><em>r<\/em><\/sub>\u20131<\/sub>), but we don&#8217;t know that. \u00a0(found by Aliaume Lopez, November 02, 2022.) \u00a0This can be repaired by requiring the indices <em>n<sub>r<\/sub><\/em>\u00a0to be strictly increasing in\u00a0<em>r<\/em>. \u00a0Just replace the first paragraph of the proof (bottom of p.470) by:\n<ul>\n<li>Assume <em>Y&#8217;<\/em> were not Noetherian. By Lemma 9.7.15, there would be a bad sequence <em>V<sub><em>n<\/em><\/sub><\/em><sub><sub>0<\/sub><\/sub><em><sub><em>i<\/em><\/sub><\/em><sub><sub>0<\/sub><\/sub>, <em>V<sub><em>n<\/em><\/sub><\/em><sub><sub>1<\/sub><\/sub><em><sub><em>i<\/em><\/sub><\/em><sub><sub>1<\/sub><\/sub>, &#8230;, <em>V<sub><em>n<sub>q<\/sub>i<sub>q<\/sub><\/em><\/sub><\/em>, &#8230; Note that all the pairs (<em>n<sub>q<\/sub>,i<sub>q<\/sub><\/em>) are pairwise distinct: if we had (<em>n<sub>r<\/sub>,i<sub>r<\/sub><\/em>)=(<em>n<sub>q<\/sub>,i<sub>q<\/sub><\/em>) with <em>r<\/em>&lt;<em>q<\/em>, then we would have <em>V<sub><em>n<sub>r<\/sub>i<sub>r<\/sub><\/em><\/sub><\/em>=<em>V<sub><em>n<sub>q<\/sub>i<sub>q<\/sub><\/em><\/sub><\/em>, contradicting the fact that the sequence is bad. We build a sequence of indices <em>k<sub>j<\/sub><\/em> by induction on <em>j<\/em> \u2208 <strong>N<\/strong> such that <em>k<sub>j<\/sub><\/em>&lt;<em>k<sub>j<\/sub><\/em><sub>+1<\/sub> and <em>n<sub><em>k<sub>j<\/sub><\/em><\/sub><\/em>&lt;<em>n<sub><em>k<sub>j<\/sub><\/em><\/sub><\/em><sub><sub>+1<\/sub><\/sub> as follows. First, we pick <em>k<\/em><sub>0<\/sub> arbitrarily. Assuming that <em>k<sub>j<\/sub><\/em> has been built, we note that there are only finitely many pairs (<em>n<sub>q<\/sub>,i<sub>q<\/sub><\/em>) such that <em>n<sub>q<\/sub><\/em>\u2264<em>n<sub><em>k<sub>j<\/sub><\/em><\/sub><\/em>, since they are all pairwise distinct; namely, at most \u2211<sub><em>n<\/em>=0<\/sub><sup><em>k<sub>j<\/sub><\/em><\/sup> <em>m<sub>n<\/sub><\/em>. Among the infinitely many pairs (<em>n<sub>q<\/sub>,i<sub>q<\/sub><\/em>) such that <em>q<\/em>&gt;<em>k<sub>j<\/sub><\/em>, there must therefore be at infinitely many such that <em>n<sub>q<\/sub><\/em>&gt;<em>n<sub><em>k<sub>j<\/sub><\/em><\/sub><\/em>. We pick one and call <em>k<sub>j<\/sub><\/em><sub>+1<\/sub> the index\u00a0<em>q<\/em> we have just found. This being done, we obtain a subsequence <em>V<sub><em>n<sub><em>k<sub>j<\/sub><\/em><\/sub>i<sub><em>k<sub>j<\/sub><\/em><\/sub><\/em><\/sub><\/em> (<em>j<\/em> \u2208 <strong>N<\/strong>) of our original sequence. Any subsequence of a bad sequence is bad, and this one additionally satisfies <em>n<sub><em>k<sub>j<\/sub><\/em><\/sub><\/em>&lt;<em>n<sub><em>k<sub>j<\/sub><\/em><\/sub><\/em><sub><sub>+1<\/sub><\/sub> for every <em>j<\/em> \u2208 <strong>N<\/strong>. Replacing the original sequence <em>V<sub><em>n<\/em><\/sub><\/em><sub><sub>0<\/sub><\/sub><em><sub><em>i<\/em><\/sub><\/em><sub><sub>0<\/sub><\/sub>, <em>V<sub><em>n<\/em><\/sub><\/em><sub><sub>1<\/sub><\/sub><em><sub><em>i<\/em><\/sub><\/em><sub><sub>1<\/sub><\/sub>, &#8230;, <em>V<sub><em>n<sub>q<\/sub>i<sub>q<\/sub><\/em><\/sub><\/em>, &#8230; by that subsequence if necessary, we may therefore safely assume that <em>n<sub>r<\/sub><\/em>&lt;<em>n<sub>q<\/sub><\/em> for all <em>r<\/em>&lt;<em>q<\/em>.<\/li>\n<\/ul>\n<\/li>\n<\/ol>\n<h2 style=\"text-align: left;\">Things that I once thought were mistakes but are not:<\/h2>\n<ol>\n<li style=\"text-align: left;\">p.311, Definition 7.4.72.\u00a0 I proposed to define a Yoneda-complete quasi-metric space as being continuous if and only if its dcpo <strong>B<\/strong>(<em>X, d<\/em>) of formal balls is continuous.\u00a0 For conformance with Kostanek and Waszkiewicz&#8217;s paper cited there, I realized that one should really define a Yoneda-complete quasi-metric space <em>X<\/em>, <em>d<\/em> as being continuous if and only if its dcpo <strong>B<\/strong>(<em>X, d<\/em>) of formal balls is continuous <em>and<\/em> its way-below relation \u226a is <em>standard<\/em>, in the sense that for every non-negative real number\u00a0<em>a<\/em>, (<em>x<\/em>, <em>r<\/em>) \u226a (<em>y<\/em>, <em>s<\/em>) if and only if (<em>x<\/em>, <em>r+a<\/em>) \u226a (<em>y<\/em>, <em>s+a<\/em>).\u00a0 The standardness condition I just stated is a simplification of their characterization, but is equivalent.\u00a0 Note that (<em>x<\/em>, <em>r<\/em>) \u226a (<em>y<\/em>, <em>s<\/em>) always implies (<em>x<\/em>, <em>r+a<\/em>) \u226a (<em>y<\/em>, <em>s+a<\/em>).\u00a0\u00a0 (found, April 23, 2016.)<br \/>\nIt turns out that the converse implication also holds, so that was no mistake after all (proved by Ng Kok Min, August 24, 2016.)<\/li>\n<\/ol>\n<h2 style=\"text-align: left;\">Typos:<\/h2>\n<ol>\n<li>p.10, Section 2.3.3, first line: &#8220;A map <em>f<\/em> from a poset <em>X<\/em> to a quasi-ordered set <em>Y<\/em> is <em>monotonic<\/em> iff, for every <em>x<\/em>, <em>x&#8217;<\/em> \u2208 X with <em>x<\/em> \u2264 <em>x&#8217;<\/em>, <em>f<\/em> (<em>x<\/em>) \u2264 <em>f<\/em> (<em>x&#8217;<\/em>)&#8221;; there is no need to assume <em>X<\/em> to be a poset here, and the definition should instead start with &#8220;A map <em>f<\/em> from a quasi-ordered set <em>X<\/em> to a quasi-ordered set <em>Y<\/em>&#8220;.\u00a0 All the more so as the next sentence starts with &#8220;When <em>X<\/em> is a poset&#8221;&#8230; (found by Barth Shiki, July 13, 2013).<\/li>\n<li>p.21, line -3: &#8220;and <em>d<\/em>(<em>y<\/em>,<em>y<sub>n<\/sub><\/em>) &lt; \u03b5 for <em>n<\/em> large enough&#8221; should read &#8220;and <em>d<\/em>(<em>y<\/em>,<em>x<sub>n<\/sub><\/em>) &lt; \u03b5 for <em>n<\/em> large enough&#8221; (found by Barth Shiki, July 16, 2013).<\/li>\n<li>p.22, last line, &#8220;metric point&#8221; should read &#8220;metric space&#8221; (found by anon1, May 22, 2013).<\/li>\n<li>p.26, l.7, sentence between parentheses: the formula defining <em>x<sub>n<\/sub><\/em> has four occurrences of <em>x<\/em>; these should be\u00a0<em>n<\/em>, not <em>x<\/em> (ln (<em>n<\/em>+2), cos (<em>n<\/em>+2), sin (1\/2 <em>n<\/em>+3\/2)) (found by Barth Shiki, July 16, 2013).<\/li>\n<li>p.33, line 5, &#8220;for every <em>n<\/em> \u2265 <em>n<sub>i<\/sub><\/em>, <em>d<sub>i<\/sub><\/em> (<em>x<sub>i<\/sub><\/em>, <em>x<sup>m<\/sup><sub>i<\/sub><\/em>) &lt; \u03b5&#8221; should read &#8220;for every <em>n<\/em> \u2265 <em>n<sub>i<\/sub><\/em>, <em>d<sub>i<\/sub><\/em> (<em>x<sub>i<\/sub><\/em>, <em>x<sup>m<\/sup><sub>ni<\/sub><\/em>) &lt; \u03b5&#8221;; and line 6, &#8220;<em>d<sub>i<\/sub><\/em> (<em>x<\/em><sup>\u2192<\/sup>, <em>x<sup>\u2192<\/sup><sup>m<\/sup><\/em>) &lt; \u03b5&#8221; should read &#8220;<em>d<sub>i<\/sub><\/em> (<em>x<\/em><sup>\u2192<\/sup>, <em>x<sup>\u2192<\/sup><sup>m<\/sup><sub>n<\/sub><\/em>) &lt; \u03b5&#8221; (found by Barth Shiki, July 16, 2013).<\/li>\n<li>p.33, line -6: &#8220;every <em>x<sub>n<\/sub><\/em> with <em>n<\/em> \u2260 <em>n<\/em><em><sub>1<\/sub><\/em>&#8221; should read &#8220;every <em>x<sub>n<\/sub><\/em> with <em>n<\/em> \u2265 <em>n<\/em><em><sub>1<\/sub><\/em>&#8221; (found by Barth Shiki, July 16, 2013).<\/li>\n<li>p.34, line 7: &#8220;Then <em>x<sub>n0<\/sub><sup>&#8211;<\/sup><\/em> \u2014 <em>x<sub>n0<\/sub><sup>+<\/sup><\/em> \u2264 \u03b5\/2&#8243; should be &#8220;Then <em>x<sub>n0<\/sub><sup>+<\/sup><\/em> \u2014\u00a0<em>x<sub>n0<\/sub><sup>&#8211;<\/sup><\/em> \u2264 \u03b5\/2&#8243; (found by Barth Shiki, July 16, 2013).<\/li>\n<li>p.36, last four lines, all the occurrences of\u00a0<em>x<sub>n<\/sub><\/em> should read <em>x<sub>nn<\/sub><\/em>, all occurrences of\u00a0<em>x<sub>m<\/sub><\/em> should read <em>x<sub>mm<\/sub><\/em> (4 occurrences of each; found by Barth Shiki, July 16, 2013).<\/li>\n<li>p.45, l.1, &#8220;So Corollary 3.5.13 applies&#8221; should read &#8220;So Theorem 3.5.12 applies&#8221; (found by Barth Shiki, July 16, 2013).<\/li>\n<li>p.64, proof of Proposition 4.3.6, l.4, &#8220;(<em>x<sub>n<\/sub><\/em>)<em><sub>n<\/sub><\/em><sub> \u2208 N<\/sub>&#8221; should read &#8220;(<em>f<sub>n<\/sub><\/em> (\u22a5))<em><sub>n<\/sub><\/em><sub> \u2208 N<\/sub>&#8221; (found by Barth Shiki, July 19, 2013).<\/li>\n<li>p.120, Definition 5.1.1 (the way-below relation): duplicate &#8220;a&#8221; (May 14, 2013).<\/li>\n<li>p.177, last paragraph, in the definition of an adjoint functor, the functor &#8220;<em>f<\/em>&#8221; should be &#8220;<em>F<\/em>&#8221; (found, Feb 21, 2015).<\/li>\n<li>p.306, l.2 (Exercise 7.4.54): remove &#8220;and \u03b7<sup>EH<\/sup><sub><strong>B<\/strong>(<em>X<\/em>,<em>d<\/em>)<\/sub>&#8220;, which is a spurious duplicate of the subsequent &#8220;and the section \u03b7<sup>EH<\/sup><sub><strong>B<\/strong>(<em>X<\/em>,<em>d<\/em>)<\/sub>&#8221; (August 21, 2013).<\/li>\n<li>p.479, reference to &#8220;Weihrauch, K. and Schneider, U. 1981&#8221; should read &#8220;Weihrauch, K. and Schreiber, U. 1981&#8221; (August 26, 2015).<\/li>\n<li>p.250, rightmost diagram at the top: the leftmost vertical arrow should be labeled <strong>c<\/strong><em><sub>C,A<\/sub><\/em> \u2297 id<em><sub>B<\/sub><\/em>, not <strong>c<\/strong><em><sub>C,A<\/sub><\/em> \u2297 id<em><sub>C<\/sub><\/em> (February 21, 2018).<\/li>\n<li>p.462, line 9: &#8220;every open rectangle is of the form (<em>X<\/em><sub>1<\/sub>\u00a0\u2013 \u2193<em>E<\/em><sub>1<\/sub>) \u00d7 (<em>X<\/em><sub>2<\/sub> \u00d7 \u2193<em>E<\/em><sub>2<\/sub>) with <em>E<\/em><sub>1<\/sub> and<em>\u00a0E<\/em><sub>2<\/sub> finite&#8221; should read\u00a0&#8220;every open rectangle is of the form (<em>X<\/em><sub>1<\/sub>\u00a0\u2013 \u2193<em>E<\/em><sub>1<\/sub>) \u00d7 (<em>X<\/em><sub>2<\/sub> \u2013 \u2193<em>E<\/em><sub>2<\/sub>) with <em>E<\/em><sub>1<\/sub> and<em>\u00a0E<\/em><sub>2<\/sub> finite&#8221; (found by \u6c88\u51b2 [Shen Chong], May 31, 2019).<\/li>\n<li>p.423, line 2: &#8220;for each\u00a0<em>x<\/em> \u2208\u00a0<em>X<\/em> such that\u00a0<em>g<\/em>(<em>x<\/em>)&gt;\u03b5&#8221;: this should be \u2265, not &gt; (found, April 06, 2020).<\/li>\n<li>p.364 (Exercise 8.2.48): &#8220;This result is due to Lawson (1997a), where the rounded topology was called the quasiScott topology&#8221;: replace &#8220;quasiScott&#8221; by &#8220;pseudoScott&#8221; (found, May 16, 2020).<\/li>\n<\/ol>\n<h2>Clarifications:<\/h2>\n<ol>\n<li>p.100, Example 4.8.2, Baire space.\u00a0 It is N that should be taken with the discrete topology.\u00a0 Baire space is the product of countably many copies of the latter.\u00a0 Its topology is far from discrete, although it was built up as a product of discrete spaces (July 16, 2013).<\/li>\n<li>Discussion, p.21.\u00a0 I am not stating which metric I&#8217;m using here.\u00a0 I meant the<em> L<\/em><sup>2<\/sup> metric of Exercise 3.1.3.\u00a0 However, we shall see that as far as convergence is concerned, the <em>L<\/em><sup>1<\/sup> metric, the <em>L<\/em><sup>2<\/sup> metric, the <em>L<sup>p<\/sup><\/em> metric (with <em>p<\/em> \u2265 1), the <em>L<sup>\u221e<\/sup><\/em> metric (a.k.a., the sup metric) will all yield similar results: they all define the same topology, and notions of convergence only depend on the topology (mentioned by Barth Shiki, July 16, 2013).<\/li>\n<li>p.45, Exercise 3.5.15.\u00a0 I am not stating which metric I&#8217;m using on R<em><sup>m<\/sup><\/em>.\u00a0 This can be any of the <em>L<sup>p<\/sup><\/em> metrics (with <em>p<\/em> \u2265 1), as required to apply the Borel-Lebesgue Theorem (Proposition 3.3.4).\u00a0 As in the previous point, we shall realize later that this does not matter (mentioned by Barth Shiki, July 16, 2013).<\/li>\n<li>p.65, Exercise 4.3.7.\u00a0 The ordering on R x R, or on R<sup>+<\/sup> x R<sup>+<\/sup>, is the product ordering.\u00a0 That can be inferred from the fact that this is the only one we have defined on products, but is ambiguous anyway (mentioned by Barth Shiki, July 19, 2013).<\/li>\n<li>p.177, bottom.\u00a0 I have written &#8220;The definition above makes it clear that an equivalence is just an adjunction <em>F<\/em> \u22a3 <em>G<\/em> whose unit and counit are iso.&#8221;\u00a0 This is wrong: an adjunction whose unit and counit are iso is called an <em><a title=\"adjoint equivalence\" href=\"https:\/\/ncatlab.org\/nlab\/show\/adjoint+equivalence\">adjoint equivalence<\/a><\/em> in the literature.\u00a0 The discussion that I referred to shows that every adjoint equivalence is an equivalence, but an equivalence need not be an adjoint equivalence.\u00a0 However,\u00a0 the two concepts are very close.\u00a0 Given an equivalence between <em>F<\/em> and <em>G<\/em>, we can turn it into an adjoint equivalence by changing the natural isomorphism between <em>FG<\/em> (and leaving the other one unchaged), or conversely; each can be done in a unique way, in fact. (found, Feb 21, 2015).<\/li>\n<li>p.368, proof of Theorem 8.3.10, that every core-compact sober space is locally compact.\u00a0 At line 3, I am saying &#8220;By interpolation in <strong>O<\/strong>(<em>X<\/em>), since this is a continuous dcpo, there is an open subset <em>U<\/em><sub>1<\/sub> such that <em>U<\/em><sub>\u03c9<\/sub> \u22d0 <em>U<\/em><sub>1<\/sub> \u22d0 <em>U<\/em><sub>0<\/sub>&#8220;. Interpolation refers to Proposition 5.1.15, and I should have said so explicitly.<\/li>\n<li>p.137, Corollary 5.1.61 (of Scott&#8217;s formula). \u00a0In the proof, one finds the equality &#8220;sup<sub><em>b<\/em> \u2208 <em>B<\/em>, <em>b<\/em> \u226a <em>b&#8217;<\/em><\/sub> <em>f<\/em>(<em>b<\/em>) =\u00a0<em>f<\/em>(sup<sub><em>b<\/em> \u2208 <em>B<\/em>, <em>b<\/em> \u226a <i>b&#8217;<\/i><\/sub>\u00a0<em>b<\/em>)&#8221;: the supremum on the right, sup<sub><em>b<\/em> \u2208 <em>B<\/em>, <em>b<\/em> \u226a <i>b&#8217;<\/i><\/sub>\u00a0<em>b,<\/em>\u00a0is computed in <em>X<\/em>, but we have assumed that <em>f<\/em> is Scott-continuous from <em>B<\/em> to <em>Y<\/em>, meaning that <em>f<\/em> preserves directed suprema <em>as computed in B<\/em>, not\u00a0<em>X<\/em>; fortunately, any directed supremum of elements of <em>B<\/em>, as computed in <em>X<\/em>, that happens to be in <em>B<\/em>, is also a supremum as computed in <em>B<\/em>, but beware that suprema computed in <em>B<\/em> may fail to be suprema of elements of <em>B<\/em> as computed in <em>X<\/em>. (found, September 19th, 2023.)<\/li>\n<\/ol>\n<h2>Simplifications and Improvements<\/h2>\n<ol>\n<li>The proof of Lemma 8.3.42 is overly complicated, and one can at the same time prove something more general: every space\u00a0<em>Y<\/em> (not necessarily sober) such that\u00a0<strong>O<\/strong>(<em>Y<\/em>) is prime-continuous is a c-space. \u00a0Therefore the c-spaces are exactly the spaces whose lattice of open sets if prime-continuous, or equivalently, completely distributive (see Exercise 8.3.16). \u00a0See <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=4610#primecont\">Appendix B of this post<\/a> for an elementary proof (found, January 22nd, 2022.)<\/li>\n<\/ol>\n<p style=\"text-align: right;\">\u2014 <a href=\"https:\/\/www.lsv.ens-paris-saclay.fr\/~goubault\/?l=en\" rel=\"attachment wp-att-993\">Jean Goubault-Larrecq<\/a><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-993 alignright\" src=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/wp-content\/uploads\/2016\/08\/jgl-2011.png\" alt=\"jgl-2011\" width=\"32\" height=\"44\" \/><\/p>\n","protected":false},"excerpt":{"rendered":"<p>It is always embarrassing to realize that one&#8217;s mind has slipped&#8230; The important bloopers first: p.120, Definition 5.1.1 (the way-below relation): &#8220;for every directed family\u00a0zi that has a a least upper bound z above y, there is an i in &hellip; <a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/?page_id=12\">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":"open","template":"","meta":{"_crdt_document":"","footnotes":""},"class_list":["post-12","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/pages\/12","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=12"}],"version-history":[{"count":108,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/pages\/12\/revisions"}],"predecessor-version":[{"id":7196,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=\/wp\/v2\/pages\/12\/revisions\/7196"}],"wp:attachment":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/topology\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=12"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}