<?xml version="1.0"?> 
<?xml-stylesheet type="text/css" href="Hieruni.css"?>

<!DOCTYPE html SYSTEM "mathml.dtd" 
[ <!ENTITY mmlns "http://www.w3.org/1998/Math/MathML"> ]> 

<html  
xmlns:math="http://www.w3.org/1998/Math/MathML" 
xmlns="http://www.w3.org/TR/REC-html40"  
>

<head>
<title>The Hierarchy of Borel Universal Sets</title>
</head>

<body>

<div id="toc">

<div class="section">
<a href="#title">Title and Abstract</a>
</div>
<div class="section">
<a href="#intro">Introduction</a>
</div>
<div class="section">
<a href="#QQ1-1-1">Definitions etc</a>
<br/>
<a class="para" href="#QQ1-1-2">Borel sets and hierarchy</a>
<br/>
<a  class="para" href="#QQ1-1-3">Borel universals</a>
<br/>
<a class="para" href="#QQ1-1-4">Orders on <math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>&#x03C9;</mi><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math> </a>
<br/>
<a class="para" href="#QQ1-1-5">Subsets of <math 
xmlns="&mmlns;" mode="inline"><mi fontweight="bold">R</mi></math>  </a>
<br/>
<a class="para" href="#QQ1-1-6">Todorcevic's examples</a>
<br/>
<a class="para" href="#QQ1-1-7">Duplication</a>
<br/>
<a class="para" href="#QQ1-1-8">Preservation of universals</a>
<br/>
<a class="para" href="#QQ1-1-9">Universals exist</a>
</div>
<div class="section">
<a href="#QQ1-1-10">Open Universals</a>
<br/>
<a class="subsection" href="#QQ1-1-11">General Spaces</a>
<br/>
<a class="subsection" href="#QQ1-1-12">Compact Spaces</a>
</div>
<div class="section">
<a href="#QQ1-1-13">Finite Borel Class</a>
<br/>
<a class="subsection" href="#QQ1-1-14">General Spaces</a>
<br/>
<a class="subsection" href="#QQ1-1-15">Compact Spaces</a>
</div>
<div class="section">
<a href="#QQ1-1-16">High Borel Class</a>
<br/>
<a class="subsection" href="#QQ1-1-17">General Spaces</a>
<br/>
<a class="subsection" href="#QQ1-1-18">Compact Spaces</a>
</div>
<div class="section">
<a href="#QQ1-1-19">References</a>
</div>
</div>


<div id="main">

<a name="title" />
<div align="center" id="maketitle">

<h2 class="titleHead">The Hierarchy of Borel Universal Sets</h2>
<div class="author" align="center"><span 
class="cmr-12">Paul M Gartside &#x0026; Joseph T H Lo</span></div>
<br />
<div class="date" align="center"><span 
class="cmr-12">March 12, 2000</span></div>
   <span class="thanks"></span></div>
   <div><table width="100%" 
class="abstract"><tr><td 
>
<div class="center" 
>
<span 
class="cmbx-9">Abstract</span></div>
     <!--42--><p class="noindent"><span 
class="cmr-9">A </span><!--l. 42--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmr-9">-subset</span>
     <!--l. 42--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math>
     <span 
class="cmr-9">of the product </span><!--l. 42--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi> <mo>&#x00D7;</mo> <mi>Y</mi> </math>
     <span 
class="cmr-9">is a </span><!--l. 43--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmr-9">-universal</span>
     <span 
class="cmr-9">set of </span><!--l. 43--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
     <span 
class="cmr-9">parametrised by </span><!--l. 43--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>
     <span 
class="cmr-9">if every </span><!--l. 44--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmr-9">-set</span>
     <span 
class="cmr-9">of </span><!--l. 44--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
     <span 
class="cmr-9">is of the form </span><!--l. 45--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>U</mi><mrow 
><mi>y</mi></mrow></msup 
> <mo>=</mo> <mrow 
><mo>{</mo><mi>x</mi> <mo>:</mo> <mrow 
><mo>(</mo><mi>x</mi><mo>,</mo> <mi>y</mi><mo>)</mo></mrow> <mo>&#x2208;</mo> <mi>U</mi><mo>}</mo></mrow></math><span 
class="cmr-9">,</span>
     <span 
class="cmr-9">for some </span><!--l. 46--><math 
xmlns="&mmlns;" mode="inline"><mi>y</mi> <mo>&#x2208;</mo> <mi>Y</mi> </math><span 
class="cmr-9">.</span>
     &nbsp;<span 
class="cmr-9">Let </span><!--l. 46--><math 
xmlns="&mmlns;" mode="inline"><mi>n</mi> <mo>&#x2208;</mo> <mi>&#x03C9;</mi></math>
     <span 
class="cmr-9">and </span><!--l. 47--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B1;</mi> <mo>&#x2208;</mo> <msub 
><mi>&#x03C9;</mi><mrow 
><mn>1</mn></mrow></msub 
></math><span 
class="cmr-9">.</span>
     &nbsp;<span 
class="cmr-9">If </span><!--l. 47--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
     <span 
class="cmr-9">is a compact space with a </span><!--l. 47--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>n</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmr-9">-universal</span>
     <span 
class="cmr-9">set parametrised by </span><!--l. 48--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math><span 
class="cmr-9">,</span>
     <span 
class="cmr-9">then for all </span><!--l. 48--><math 
xmlns="&mmlns;" mode="inline"><mi>m</mi> <mo>&#x2208;</mo> <mi>&#x03C9;</mi></math><span 
class="cmr-9">,</span>
     <!--l. 49--><math 
xmlns="&mmlns;" mode="inline"><mi>w</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>n</mi><mi>w</mi><mrow 
><mo>(</mo><mi>Y</mi> <mo>)</mo></mrow></math><span 
class="cmr-9">,</span>
     <!--l. 50--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow></math><span 
class="cmr-9">,</span>
     <!--l. 51--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow></math>
     <span 
class="cmr-9">and </span><!--l. 52--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>c</mi><mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>c</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow></math><span 
class="cmr-9">.</span>
     &nbsp;<span 
class="cmr-9">If </span><!--l. 52--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
     <span 
class="cmr-9">is a perfect compact space with a </span><!--l. 53--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmr-9">-universal</span>
     <span 
class="cmr-9">set parametrised by </span><!--l. 53--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math><span 
class="cmr-9">,</span>
     <span 
class="cmr-9">then </span><!--l. 54--><math 
xmlns="&mmlns;" mode="inline"><mi>w</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>n</mi><mi>w</mi><mrow 
><mo>(</mo><mi>Y</mi> <mo>)</mo></mrow></math><span 
class="cmr-9">.</span>
     &nbsp;<span 
class="cmr-9">There is an example of a space that is not second countable, but with a</span>
     <!--l. 55--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>G</mi><mrow 
><mi>&#x03B4;</mi></mrow></msub 
></math><span 
class="cmr-9">-universal</span>
     <span 
class="cmr-9">set parametrised by the Cantor set, </span><!--l. 56--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mn>2</mn><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math><span 
class="cmr-9">.</span>

     &nbsp;<span 
class="cmr-9">Assuming </span><!--l. 56--><math 
xmlns="&mmlns;" mode="inline"><mi>b</mi> <mo>=</mo> <msub 
><mi>&#x03C9;</mi><mrow 
><mn>1</mn></mrow></msub 
></math><span 
class="cmr-9">,</span>
     <span 
class="cmr-9">there is a locally compact strong </span><!--l. 57--><math 
xmlns="&mmlns;" mode="inline"><mi>S</mi></math><span 
class="cmr-9">-space</span>
     <span 
class="cmr-9">with a </span><!--l. 57--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>G</mi><mrow 
><mi>&#x03B4;</mi></mrow></msub 
></math><span 
class="cmr-9">-universal</span>
     <span 
class="cmr-9">set parametrised by </span><!--l. 58--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mn>2</mn><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math><span 
class="cmr-9">.</span>
     &nbsp;<span 
class="cmr-9">Assuming </span><span 
class="cmbx-9">CH</span><span 
class="cmr-9">, there is an </span><!--l. 58--><math 
xmlns="&mmlns;" mode="inline"><mi>L</mi></math><span 
class="cmr-9">-space</span>
     <span 
class="cmr-9">with a </span><!--l. 59--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>G</mi><mrow 
><mi>&#x03B4;</mi></mrow></msub 
></math><span 
class="cmr-9">-universal</span>
     <span 
class="cmr-9">set parametrised by </span><!--l. 59--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mn>2</mn><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math><span 
class="cmr-9">.</span>
     &nbsp;<span 
class="cmr-9">Assuming </span><!--l. 60--><math 
xmlns="&mmlns;" mode="inline"><mi>b</mi> <mo>=</mo> <msub 
><mi>&#x03C9;</mi><mrow 
><mn>1</mn></mrow></msub 
></math><span 
class="cmr-9">,</span>
     <span 
class="cmr-9">there is a compact strong </span><!--l. 60--><math 
xmlns="&mmlns;" mode="inline"><mi>S</mi></math><span 
class="cmr-9">-space</span>
     <span 
class="cmr-9">with a </span><!--l. 60--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>G</mi><mrow 
><mi>&#x03B4;</mi></mrow></msub 
></math><span 
class="cmr-9">-universal</span>
     <span 
class="cmr-9">parametrised by a strong </span><!--l. 61--><math 
xmlns="&mmlns;" mode="inline"><mi>S</mi></math><span 
class="cmr-9">-space.</span>
     &nbsp;<span 
class="cmr-9">If there exist Q-sets or under </span><span 
class="cmbx-9">CH</span><span 
class="cmr-9">, there is a compact, first countable</span>
     <span 
class="cmr-9">non-metrisable space with a </span><!--l. 63--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03C9;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmr-9">-universal</span>
     <span 
class="cmr-9">set parametrised by </span><!--l. 63--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mn>2</mn><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math><span 
class="cmr-9">.</span>
     &nbsp;<span 
class="cmr-9">The statements &#x2018;every compact monotonically normal space with a </span><!--l. 64--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmr-9">-universal</span>
     <span 
class="cmr-9">set parametrised by a second countable space is metrisable&#x2019; and &#x2018;every</span>
     <span 
class="cmr-9">compact, first countable space with a </span><!--l. 66--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmr-9">-universal</span>
     <span 
class="cmr-9">set parametrised by a second countable space is metrisable&#x2019; are undecidable</span>
     <span 
class="cmr-9">in </span><span 
class="cmbx-9">ZFC</span><span 
class="cmr-9">.</span>
     <br class="newline" />
     <br class="newline" /><span 
class="cmr-9">Keywords: Borel hierarchy, Borel universals, cardinal invariants, S and L</span>
     <span 
class="cmr-9">spaces, compact spaces</span>
     <br class="newline" /><span 
class="cmr-9">MCS: 54H05, 54D30 Secondary 54D65, 54E35, 54D15</span>
</p>
</td></tr></table></div>


<a name="intro"/>
<h3>Introduction</h3>
<!--77--><p class="indent">   Let <!--l. 77--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x0393;</mi></math>
be a class function assigning to each topological space a family
<!--l. 78--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x0393;</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></math> of subsets
of <!--l. 78--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>. A set
<!--l. 78--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math> contained
in <!--l. 78--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi> <mo>&#x00D7;</mo> <mi>Y</mi> </math> is a
<!--l. 79--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x0393;</mi></math>-universal
set for <!--l. 79--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
parametrised by <!--l. 79--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>
if <!--l. 79--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi> <mo>&#x2208;</mo> <mi>&#x0393;</mi><mrow 
><mo>(</mo><mi>X</mi> <mo>&#x00D7;</mo> <mi>Y</mi> <mo>)</mo></mrow></math> and
<!--l. 80--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x0393;</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>=</mo> <mrow 
><mo>{</mo><msup 
><mi>U</mi><mrow 
><mi>y</mi></mrow></msup 
> <mo>:</mo> <mi>y</mi> <mo>&#x2208;</mo> <mi>Y</mi> <mo>}</mo></mrow></math>, where
<!--l. 80--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>U</mi><mrow 
><mi>y</mi></mrow></msup 
> <mo>=</mo> <mrow 
><mo>{</mo><mi>x</mi> <mo>&#x2208;</mo> <mi>X</mi> <mo>:</mo> <mrow 
><mo>(</mo><mi>x</mi><mo>,</mo> <mi>y</mi><mo>)</mo></mrow> <mo>&#x2208;</mo> <mi>U</mi><mo>}</mo></mrow></math>.
Universal sets have played an important role in the study of the Borel hierarchies and
analytic sets ([<a 
href="#XKechris">8</a>, Sections 14 and 22]).&nbsp;&nbsp;See also [<a 
href="#XKechrisMartin">9</a>], [<a 
href="#XLarman">10</a>] and [<a 
href="#XOstasz">13</a>]. Their work was
mainly restricted to Polish spaces and parametrising countable closed sets, countable
<!--l. 85--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>G</mi><mrow 
><mi>&#x03B4;</mi></mrow></msub 
></math>-sets
or compact sets. &nbsp;In the present paper, we investigate Borel universal
sets of general regular Hausdorff spaces, relating properties of the space
<!--l. 87--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> to that of the
parametrising space <!--l. 87--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>.
We pay particular attention to the case when
<!--l. 88--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> is

compact. &nbsp;Section <a 
href="#x1-10001">1</a> provides definitions, notations and basic results.
</p><!--91--><p class="indent">   The Borel sets of a space form a natural hierarchy of additive
<!--l. 91--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>- and multiplicative
<!--l. 92--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A0;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-classes
<!--l. 92--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mn>0</mn><mo>&#x2260;</mo><mi>&#x03B1;</mi> <mo>&#x2208;</mo> <msub 
><mi>&#x03C9;</mi><mrow 
><mn>1</mn></mrow></msub 
><mo>)</mo></mrow></math>. &nbsp;A space has a
<!--l. 93--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal set parametrised
by a space <!--l. 94--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math> if and only
if it has a <!--l. 94--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A0;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal
set parametrised by <!--l. 95--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>
(Lemma <a 
href="#x1-80011">1</a>). Thus we formulate results solely in terms of
<!--l. 96--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal sets. If a
space has a <!--l. 97--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal set
parametrised by a space <!--l. 97--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>,
then it has <!--l. 98--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B2;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal
sets parametrised by <!--l. 98--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math>
for all <!--l. 99--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B2;</mi> <mo>&#x2265;</mo> <mi>&#x03B1;</mi></math>
(Proposition <a 
href="#x1-90016">6</a>).&nbsp;&nbsp;Consequently, we have a hierarchy of results. We
will see, however, that this collapses into three groups: open
(<!--l. 101--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mn>1</mn></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-) universal
sets, <!--l. 101--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>n</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal
sets for <!--l. 102--><math 
xmlns="&mmlns;" mode="inline"><mn>1</mn> <mo>&#x003C;</mo> <mi>n</mi> <mo>&#x003C;</mo> <mi>&#x03C9;</mi></math> (in
other words, <!--l. 102--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>F</mi><mrow 
><mi>&#x03C3;</mi></mrow></msub 
></math>-,
<!--l. 102--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>G</mi><mrow 
><mi>&#x03B4;</mi><mi>&#x03C3;</mi></mrow></msub 
></math>- etc sets),
and <!--l. 103--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal
sets for <!--l. 103--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B1;</mi> <mo>&#x2265;</mo> <mi>&#x03C9;</mi></math>.
</p><!--105--><p class="indent">   Every space has a <!--l. 105--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal
set parametrised by a metrisable space, and one parametrised by a compact space (for
each <!--l. 106--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B1;</mi></math>)
(Lemma <a 
href="#x1-90038">8</a>). &nbsp;The question, then, is which spaces have Borel universal sets
parametrised by `small&#x2019; and `nice&#x2019; spaces? &nbsp;Suppose, for the moment that
<!--l. 109--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mn>2</mn><mrow 
><msub 
><mi>&#x2135;</mi><mrow 
><mn>0</mn></mrow></msub 
></mrow></msup 
> <mo>&#x003C;</mo> <msup 
><mn>2</mn><mrow 
><msub 
><mi>&#x2135;</mi><mrow 
><mn>1</mn></mrow></msub 
></mrow></msup 
></math> and
<!--l. 109--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> is a space with
a <!--l. 110--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal
set (any <!--l. 110--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B1;</mi></math>)
parametrised by a space of size no more than the continuum. As the discrete space of
size <!--l. 111--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>&#x2135;</mi><mrow 
><mn>1</mn></mrow></msub 
></math> has
<!--l. 112--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mn>2</mn><mrow 
><msub 
><mi>&#x2135;</mi><mrow 
><mn>1</mn></mrow></msub 
></mrow></msup 
></math> many
<!--l. 112--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-sets, cardinality considerations
alone ensure that <!--l. 113--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
must have the hereditary c.c.c. &nbsp;On the other hand, if
<!--l. 114--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mn>2</mn><mrow 
><msub 
><mi>&#x2135;</mi><mrow 
><mn>0</mn></mrow></msub 
></mrow></msup 
> <mo>=</mo> <msup 
><mn>2</mn><mrow 
><msub 
><mi>&#x2135;</mi><mrow 
><mn>1</mn></mrow></msub 
></mrow></msup 
></math>, then the discrete
space of size <!--l. 115--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>&#x2135;</mi><mrow 
><mn>1</mn></mrow></msub 
></math>
has an open universal set parametrised by a compact, first countable,
separable space. (See Theorem <a 
href="#x1-900510">10</a> for details.) &nbsp;Two points flow immediately
from this observation. &nbsp;First, since space with the hereditary c.c.c. are
either both hereditarily Lindel&ouml;f and hereditarily separable, or contain a

hereditarily Lindel&ouml;f non-separable subspace, or contain a hereditarily
separable non-Lindel&ouml;f subspace, we are inevitably led to the famous
<!--l. 121--><math 
xmlns="&mmlns;" mode="inline"><mi>S</mi></math>- and
<!--l. 121--><math 
xmlns="&mmlns;" mode="inline"><mi>L</mi></math>-space
problems. Second, when looking for absolute theorems, our parametrising
space will need to have a strong property hereditarily. Regarding the result
on hereditary cellularity above, we give characterisations of spaces with a
<!--l. 124--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>n</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-
<!--l. 124--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mn>0</mn> <mo>&#x003C;</mo> <mi>n</mi> <mo>&#x003C;</mo> <mi>&#x03C9;</mi><mo>)</mo></mrow></math> or
<!--l. 125--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-
<!--l. 125--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>&#x03B1;</mi> <mo>&#x2265;</mo> <mi>&#x03C9;</mi><mo>)</mo></mrow></math>
universal set parametrised by a separable metrisable space
(Theorems <a 
href="#x1-1400118">18</a> and <a 
href="#x1-1700130">30</a>). &nbsp;From this it follows that every space with a
<!--l. 128--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal set
parametrised by a separable metrisable space satisfies the c.c.c. hereditarily if and only if there
are no <!--l. 130--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>Q</mi><mrow 
><mo>&#x2264;</mo><mi>&#x03B1;</mi></mrow></msub 
></math>-sets
(Theorem <a 
href="#x1-1700332">32</a>).
</p><!--132--><p class="indent">   We summarise our other results according to the grouping mentioned above. This
corresponds to Sections <a 
href="#x1-100002">2</a>, <a 
href="#x1-130003">3</a> and <a 
href="#x1-160004">4</a> below. &nbsp;Each section is further divided in two, with
the first part dealing with general spaces, and the second the special case of compact
spaces. &nbsp;All results in Section <a 
href="#x1-100002">2</a> have been mentioned in [<a 
href="#XPaperI">5</a>], which is devoted to open
universal sets.
</p><!--139--><p class="noindent"><span 
class="cmbx-10">Space </span><!--l. 139--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmbx-10">with an open universal set parametrised by</span>
<!--l. 139--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math><span 
class="cmbx-10">:</span>
</p><!--141--><p class="noindent"><span 
class="cmbx-10">Theorem </span><a 
href="#x1-1100111"><span 
class="cmbx-10">11</span></a> <span 
class="cmbx-10">and Corollary </span><a 
href="#x1-1100212"><span 
class="cmbx-10">12</span></a> &nbsp;For any
<!--l. 142--><math 
xmlns="&mmlns;" mode="inline"><mi>m</mi> <mo>&#x2208;</mo> <mi>&#x03C9;</mi></math>,

</p><!--l. 143--><math 
xmlns="&mmlns;" mode="display">
<mrow>
<mrow><mtable 
class="align-star">
             <mtr><mtd 
class="align-odd"><mi>w</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></mtd>                <mtd 
class="align-even"> <mo>&#x2264;</mo> <mi>n</mi><mi>w</mi><mrow 
><mo>(</mo><mi>Y</mi> <mo>)</mo></mrow><mrow 
class="text"><mtext > , </mtext></mrow><mi>h</mi><mi>c</mi><mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>c</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow><mrow 
class="text"><mtext > ,</mtext></mrow> </mtd>
             </mtr><mtr><mtd 
class="align-odd"><mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow></mtd>             <mtd 
class="align-even"> <mo>&#x2264;</mo> <mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow><mrow 
class="text"><mtext > , and </mtext></mrow><mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow><mrow 
class="text"><mtext > .</mtext></mrow> </mtd></mtr></mtable></mrow></mrow>
</math>
<!--148--><p class="nopar">
</p><!--150--><p class="indent">   In particular, a space is separable metrisable if and only if parametrised by a
separable metrisable space. &nbsp;Note also the duality of hereditary density and the
hereditary Lindel&ouml;f property.
</p><!--154--><p class="noindent"><span 
class="cmbx-10">Example </span><a 
href="#x1-1100414"><span 
class="cmbx-10">14</span></a> &nbsp;It is independent of  <span 
class="cmbx-10">ZFC</span>, that
<!--l. 155--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math> hereditarily separable
implies <!--l. 155--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> hereditarily
separable, and <!--l. 155--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math> hereditarily
Lindel&ouml;f implies <!--l. 156--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
hereditarily Lindel&ouml;f.
</p><!--158--><p class="indent">   When <!--l. 158--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
is compact the direct implications do hold.
</p><!--160--><p class="noindent"><span 
class="cmbx-10">Compact </span><!--l. 160--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmbx-10">with an open universal set parametrised by</span>
<!--l. 160--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math><span 
class="cmbx-10">:</span>
</p><!--162--><p class="noindent"><span 
class="cmbx-10">Lemma </span><a 
href="#x1-1200116"><span 
class="cmbx-10">16</span></a><span 
class="cmbx-10">(2) and Corollary </span><a 
href="#x1-1200217"><span 
class="cmbx-10">17</span></a> <!--l. 162--><math 
xmlns="&mmlns;" mode="inline"><mspace class="nbsp" /></math>The
space <!--l. 163--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> is the continuous
image of a subspace of <!--l. 163--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>.
&nbsp;Hence any hereditary property, preserved by continuous maps, is transferred from
<!--l. 164--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mi>m</mi></mrow></msup 
></math> to
<!--l. 165--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>X</mi><mrow 
><mi>m</mi></mrow></msup 
></math>.
</p><!--167--><p class="indent">   In particular, <!--l. 167--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow></math>
and <!--l. 167--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow></math>.
</p><!--169--><p class="indent">   Turning  to  general  spaces  with
<!--l. 169--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>n</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal
sets <!--l. 169--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mn>1</mn> <mo>&#x003C;</mo> <mi>n</mi> <mo>&#x003C;</mo> <mi>&#x03C9;</mi><mo>)</mo></mrow></math>,
most of the open universal set results fail.
</p><!--172--><p class="noindent"><span 
class="cmbx-10">Space </span><!--l. 173--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> <span 
class="cmbx-10">with a</span>
<!--l. 173--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>n</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmbx-10">-universal set</span>
<span 
class="cmbx-10">parametrised by </span><!--l. 173--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>
<!--l. 173--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mn>1</mn> <mo>&#x003C;</mo> <mi>n</mi> <mo>&#x003C;</mo> <mi>&#x03C9;</mi><mo>)</mo></mrow></math><span 
class="cmbx-10">:</span>

</p><!--175--><p class="noindent"><span 
class="cmbx-10">Example </span><a 
href="#x1-1400319"><span 
class="cmbx-10">19</span></a> &nbsp;There is a hereditarily separable and hereditarily Lindel&ouml;f, but non-metrisable, space,
with an <!--l. 177--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>F</mi><mrow 
><mi>&#x03C3;</mi></mrow></msub 
></math>-universal
set parametrised by the Cantor set.
</p><!--179--><p class="noindent"><span 
class="cmbx-10">Examples </span><a 
href="#x1-1400420"><span 
class="cmbx-10">20</span></a> <span 
class="cmbx-10">and </span><a 
href="#x1-1400521"><span 
class="cmbx-10">21</span></a> &nbsp;(<span 
class="cmbx-10">CH</span>) There are
<!--l. 180--><math 
xmlns="&mmlns;" mode="inline"><mi>S</mi></math>- and
<!--l. 180--><math 
xmlns="&mmlns;" mode="inline"><mi>L</mi></math>-spaces with
<!--l. 180--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>F</mi><mrow 
><mi>&#x03C3;</mi></mrow></msub 
></math>-universal
sets parametrised by the Cantor set.
</p><!--183--><p class="indent">   For compact <!--l. 183--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>,
the situation is more positive.
</p><!--185--><p class="noindent"><span 
class="cmbx-10">Compact </span><!--l. 186--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> <span 
class="cmbx-10">with</span>
<span 
class="cmbx-10">a </span><!--l. 186--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>n</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmbx-10">-universal set</span>
<span 
class="cmbx-10">parametrised by </span><!--l. 186--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>
<!--l. 186--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mn>1</mn> <mo>&#x003C;</mo> <mi>n</mi> <mo>&#x003C;</mo> <mi>&#x03C9;</mi><mo>)</mo></mrow></math><span 
class="cmbx-10">:</span>
</p><!--188--><p class="noindent"><span 
class="cmbx-10">Corollaries </span><a 
href="#x1-1500324"><span 
class="cmbx-10">24</span></a> <span 
class="cmbx-10">and </span><a 
href="#x1-1500425"><span 
class="cmbx-10">25</span></a> &nbsp;For <!--l. 189--><math 
xmlns="&mmlns;" mode="inline"><mi>m</mi> <mo>&#x2208;</mo> <mi>&#x03C9;</mi></math>,
</p><!--l. 190--><math 
xmlns="&mmlns;" mode="display">
<mrow><mtable 
class="align-star">
              <mtr><mtd 
class="align-odd"><mi>w</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></mtd>                <mtd 
class="align-even"> <mo>&#x2264;</mo> <mi>n</mi><mi>w</mi><mrow 
><mo>(</mo><mi>Y</mi> <mo>)</mo></mrow><mrow 
class="text"><mtext > , </mtext></mrow><mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow><mrow 
class="text"><mtext > ,</mtext></mrow> </mtd>
              </mtr><mtr><mtd 
class="align-odd"><mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow></mtd>              <mtd 
class="align-even"> <mo>&#x2264;</mo> <mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow><mrow 
class="text"><mtext > , and </mtext></mrow><mi>h</mi><mi>c</mi><mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>c</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>m</mi></mrow></msup 
><mo>)</mo></mrow><mrow 
class="text"><mtext > .</mtext></mrow> </mtd></mtr></mtable></mrow>
</math>
<!--193--><p class="nopar">
</p><!--195--><p class="noindent"><span 
class="cmbx-10">Example </span><a 
href="#x1-1500627"><span 
class="cmbx-10">27</span></a> &nbsp;(<!--l. 195--><math 
xmlns="&mmlns;" mode="inline"><mi>b</mi> <mo>=</mo> <msub 
><mi>&#x03C9;</mi><mrow 
><mn>1</mn></mrow></msub 
></math>) There is
a compact <!--l. 196--><math 
xmlns="&mmlns;" mode="inline"><mi>S</mi></math>-space with an
<!--l. 196--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>F</mi><mrow 
><mi>&#x03C3;</mi></mrow></msub 
></math>-universal set parametrised
by a strong <!--l. 197--><math 
xmlns="&mmlns;" mode="inline"><mi>S</mi></math>-space.
</p><!--199--><p class="indent">   Finally, from <!--l. 199--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03C9;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>
onwards, there are `bad&#x2019; compact spaces with Cantor parametrising space.
</p><!--202--><p class="noindent"><span 
class="cmbx-10">Compact </span><!--l. 203--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> <span 
class="cmbx-10">with</span>
<!--l. 203--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmbx-10">-universal set</span>
<span 
class="cmbx-10">parametrised by </span><!--l. 203--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>

<!--l. 203--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>&#x03B1;</mi> <mo>&#x2265;</mo> <mi>&#x03C9;</mi><mo>)</mo></mrow></math><span 
class="cmbx-10">:</span>
</p><!--205--><p class="noindent"><span 
class="cmbx-10">Examples </span><a 
href="#x1-1800134"><span 
class="cmbx-10">34</span></a> <span 
class="cmbx-10">and </span><a 
href="#x1-1800235"><span 
class="cmbx-10">35</span></a> &nbsp;If there is a <!--l. 206--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>Q</mi><mrow 
><mo>&#x2264;</mo><mi>&#x03C9;</mi></mrow></msub 
></math>-set,
or if (<span 
class="cmbx-10">CH</span>), then there is a compact non-metrisable space with a
<!--l. 207--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03C9;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal
set parametrised by the Cantor set.
</p><!--210--><p class="indent">   Placing additional restrictions on <!--l. 210--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>,
we have the following:
</p><!--212--><p class="noindent"><span 
class="cmbx-10">Corollaries </span><a 
href="#x1-1800336"><span 
class="cmbx-10">36</span></a><span 
class="cmbx-10">, </span><a 
href="#x1-1800437"><span 
class="cmbx-10">37</span></a><span 
class="cmbx-10">, </span><a 
href="#x1-1800538"><span 
class="cmbx-10">38</span></a> Let <!--l. 213--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> be
a compact space with a <!--l. 214--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal
set parametrised by a separable metrisable space. Then
<!--l. 215--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> is
metrisable if:
</p><!--217--><p class="indent">   (1) &nbsp;<!--l. 217--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> is
perfect, or
</p><!--219--><p class="indent">   (2) &nbsp;(Consistently) <!--l. 219--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
is monotonically normal, or
</p><!--221--><p class="indent">   (3) &nbsp;(Consistently) <!--l. 221--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
is first countable.
</p>

   <h3 class="sectionHead"> 1 <a 
  name="x1-10001"></a><a 
  name="QQ1-1-1"></a>Definitions and useful results</h3>
<!--227--><p class="noindent">All spaces are regular Hausdorff topological spaces unless stated otherwise.
&nbsp;Our topological notation follows that of [<a 
href="#XEngelking">3</a>]. &nbsp;Definitions of the cardinal
invariants used here can be found in [<a 
href="#XHodel">6</a>] or [<a 
href="#XPaperI">5</a>]. &nbsp;An introduction to
<!--l. 230--><math 
xmlns="&mmlns;" mode="inline"><mi>S</mi></math>- and
<!--l. 230--><math 
xmlns="&mmlns;" mode="inline"><mi>L</mi></math>-spaces
can be found in [<a 
href="#XRoitman">14</a>].
</p><!--233--><p class="noindent"><span class="likeparagraphHead"><a 
  name="x1-20001"></a><a 
  name="QQ1-1-2"></a>Borel sets and the Borel hierarchy:</span>
   Let <!--l. 235--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> be a space. Then the
<span 
class="cmti-10">Borel subsets </span>of <!--l. 235--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> are those
in the smallest <!--l. 236--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03C3;</mi></math>-algebra
containing the open sets of <!--l. 236--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>.
&nbsp;They ramify into the following hierarchy. Define
<!--l. 237--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mn>1</mn></mrow><mrow 
><mn>0</mn></mrow></msubsup 
><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></math> to be all open
subsets of <!--l. 238--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>, and,
inductively on <!--l. 238--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B1;</mi> <mo>&#x2208;</mo> <msub 
><mi>&#x03C9;</mi><mrow 
><mn>1</mn></mrow></msub 
><mo>-</mo><mrow 
><mo>{</mo><mn>0</mn><mo>}</mo></mrow></math>,
<!--l. 239--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A0;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>=</mo> <mrow 
><mo>{</mo><mi>X</mi> <mo>-</mo> <mi>S</mi> <mo>:</mo> <mi>S</mi> <mo>&#x2208;</mo> <msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
><mo>}</mo></mrow></math>,
<!--l. 239--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi> <mo>+</mo> <mn>1</mn></mrow><mrow 
><mn>0</mn></mrow></msubsup 
><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></math> is all countable unions
of members of <!--l. 240--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A0;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></math>, and
<!--l. 241--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></math> is the family of countable
unions of members of <!--l. 242--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mo>&#x22C3;</mo>
   <mrow 
><mi>&#x03B2;</mi><mo>&#x003C;</mo><mi>&#x03B1;</mi></mrow></msub 
><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B2;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></math>
for limit <!--l. 242--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B1;</mi></math>. Then the
union of all the <!--l. 243--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-

and <!--l. 243--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A0;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-sets
is precisely the family of all Borel sets. &nbsp;We define a subset of
<!--l. 244--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> to be a
<!--l. 245--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-set if it is an
element of <!--l. 245--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></math>. &nbsp;Note
that <!--l. 246--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A0;</mi><mrow 
><mn>1</mn></mrow><mrow 
><mn>0</mn></mrow></msubsup 
><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></math> is the family
of closed subsets of <!--l. 247--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>,
and <!--l. 247--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mn>2</mn></mrow><mrow 
><mn>0</mn></mrow></msubsup 
><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></math> are the
<!--l. 247--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>F</mi><mrow 
><mi>&#x03C3;</mi></mrow></msub 
></math>-subsets.
</p><!--249--><p class="noindent"><span class="paragraphHead"><a 
  name="x1-30001"></a><a 
  name="QQ1-1-3"></a><span 
class="cmbx-10">Borel universal sets:</span></span>
   A <!--l. 251--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-set
<!--l. 251--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math> of the
space <!--l. 251--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi> <mo>&#x00D7;</mo> <mi>Y</mi> </math> is a
<!--l. 251--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmti-10">-universal</span>
set of <!--l. 252--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
parametrised by <!--l. 252--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>
if for each <!--l. 253--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi> <mo>&#x2208;</mo> <msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></math>
there is a <!--l. 253--><math 
xmlns="&mmlns;" mode="inline"><mi>y</mi> <mo>&#x2208;</mo> <mi>Y</mi> </math>
such that <!--l. 254--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi> <mo>=</mo> <msup 
><mi>U</mi><mrow 
><mi>y</mi></mrow></msup 
></math>,
where <!--l. 254--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>U</mi><mrow 
><mi>y</mi></mrow></msup 
> <mo>=</mo> <mrow 
><mo>{</mo><mi>x</mi> <mo>&#x2208;</mo> <mi>X</mi> <mo>:</mo> <mrow 
><mo>(</mo><mi>x</mi><mo>,</mo> <mi>y</mi><mo>)</mo></mrow> <mo>&#x2208;</mo> <mi>U</mi><mo>}</mo></mrow></math>.
</p><!--256--><p class="noindent"><span class="likeparagraphHead"><a 
  name="x1-40001"></a><a 
  name="QQ1-1-4"></a>Orders on <!--l. 256--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>&#x03C9;</mi><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math>:</span>
   Define orders on <!--l. 258--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>&#x03C9;</mi><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math>
as follows: <!--l. 258--><math 
xmlns="&mmlns;" mode="inline"><mi>f</mi> <msup 
><mo>&#x003C;</mo> <mrow 
><mo>&#x2217;</mo></mrow></msup 
><mi>g</mi></math> if for all
but finitely many <!--l. 259--><math 
xmlns="&mmlns;" mode="inline"><mi>n</mi></math>,
<!--l. 259--><math 
xmlns="&mmlns;" mode="inline"><mi>f</mi><mrow 
><mo>(</mo><mi>n</mi><mo>)</mo></mrow> <mo>&#x003C;</mo> <mi>g</mi><mrow 
><mo>(</mo><mi>n</mi><mo>)</mo></mrow></math>;
<!--l. 259--><math 
xmlns="&mmlns;" mode="inline"><mi>f</mi> <mo>&#x2264;</mo> <mi>g</mi></math> if for
all <!--l. 259--><math 
xmlns="&mmlns;" mode="inline"><mi>n</mi></math>,
<!--l. 259--><math 
xmlns="&mmlns;" mode="inline"><mi>f</mi><mrow 
><mo>(</mo><mi>n</mi><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>g</mi><mrow 
><mo>(</mo><mi>n</mi><mo>)</mo></mrow></math>; and
<!--l. 260--><math 
xmlns="&mmlns;" mode="inline"><mi>f</mi> <msub 
><mo>&#x2264;</mo> <mrow 
><mi>l</mi><mi>e</mi><mi>x</mi></mrow></msub 
><mi>g</mi></math> if
<!--l. 260--><math 
xmlns="&mmlns;" mode="inline"><mi>f</mi></math> precedes
<!--l. 260--><math 
xmlns="&mmlns;" mode="inline"><mi>g</mi></math> in the lexicographic
order. &nbsp;The cardinal <!--l. 261--><math 
xmlns="&mmlns;" mode="inline"><mi>b</mi></math> is the
supremum of all cardinals <!--l. 261--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03BA;</mi></math>
such that there is a subset of <!--l. 262--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>&#x03C9;</mi><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math>
of order type <!--l. 262--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03BA;</mi></math>
under <!--l. 262--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mo>&#x003C;</mo> <mrow 
><mo>&#x2217;</mo></mrow></msup 
></math>.
</p><!--264--><p class="noindent"><span class="likeparagraphHead"><a 
  name="x1-50001"></a><a 
  name="QQ1-1-5"></a>Subsets of <!--l. 264--><math 
xmlns="&mmlns;" mode="inline"><mi fontweight="bold">R</mi></math>:</span>
   An uncountable subset of the real line is a
<!--l. 266--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03BB;</mi></math><span 
class="cmti-10">-set </span>if every countable

subset is a (relative) <!--l. 267--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>G</mi><mrow 
><mi>&#x03B4;</mi></mrow></msub 
></math>.
&nbsp;Identifying <!--l. 267--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>&#x03C9;</mi><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math> with the
irrationals, any subset of <!--l. 268--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>&#x03C9;</mi><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math>
of order type <!--l. 269--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>&#x03C9;</mi><mrow 
><mn>1</mn></mrow></msub 
></math>
under <!--l. 269--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mo>&#x003C;</mo> <mrow 
><mo>&#x2217;</mo></mrow></msup 
></math> is
a <!--l. 269--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03BB;</mi></math>-set.
&nbsp;(Hence <!--l. 269--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03BB;</mi></math>-sets
exist.) &nbsp;An uncountable subset of the reals is a
<!--l. 270--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>Q</mi><mrow 
><mo>&#x2264;</mo><mi>&#x03B1;</mi></mrow></msub 
></math><span 
class="cmti-10">-set </span>if every subset
is a (relative) <!--l. 271--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-set.
The existence of <!--l. 272--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>Q</mi><mrow 
><mo>&#x2264;</mo><mi>&#x03B1;</mi></mrow></msub 
></math>-sets
is undetermined by the standard axioms of set theory. &nbsp;For all uncountable cardinal
<!--l. 273--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03BA;</mi></math>, the existence
of <!--l. 274--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>Q</mi><mrow 
><mo>&#x2264;</mo><mi>&#x03B1;</mi></mrow></msub 
></math>-sets of
size <!--l. 274--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03BA;</mi></math>
is undecidable in <span 
class="cmbx-10">ZFC</span>. &nbsp;(Existence is implied by
<span 
class="cmbx-10">MA</span>+<!--l. 275--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mn>2</mn><mrow 
><mi>&#x03C9;</mi></mrow></msup 
> <mo>&#x003E;</mo> <mi>&#x03BA;</mi></math>,
and non-existence by <span 
class="cmbx-10">CH</span>.) &nbsp;See [<a 
href="#XMiller">12</a>] and [<a 
href="#XMiller1">11</a>] for more on subsets of the
reals.
</p><!--279--><p class="noindent"><span class="likeparagraphHead"><a 
  name="x1-60001"></a><a 
  name="QQ1-1-6"></a>Todor<!--l. 279-->cevi<!--l. 279-->c&#x2019;s
examples:</span>
   There are many (consistent) examples of
<!--l. 281--><math 
xmlns="&mmlns;" mode="inline"><mi>S</mi></math>- and
<!--l. 281--><math 
xmlns="&mmlns;" mode="inline"><mi>L</mi></math>-spaces. We
will make use of what may now be called `classical&#x2019; (<span 
class="cmbx-10">CH</span>) examples due to Kunen (the `Kunen
line&#x2019;) [<a 
href="#XRoitman">14</a>] and van Douwen et al. [<a 
href="#XDouwen">1</a>]. But we will also need more recent constructions of
Todor<!--l. 284-->cevi<!--l. 284-->c.
</p><!--286--><p class="indent">   Let <!--l. 286--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> be any subset
of the real line, and let <!--l. 286--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03C4;</mi></math>
be a topology on <!--l. 286--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
finer than the Euclidean topology. &nbsp;We will call
<!--l. 287--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>X</mi><mo>,</mo> <mi>&#x03C4;</mi><mo>)</mo></mrow></math> a <span 
class="cmti-10">Kunen line type space</span>,
if every <!--l. 288--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03C4;</mi></math>-closure of a
subset of <!--l. 288--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> differs from
the Euclidean closure of <!--l. 289--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
only by countably many elements. It is easy to see that any Kunen line type space is
hereditarily separable. &nbsp;The Kunen line is of Kunen line type (!), as is the Sorgenfrey
topology on any subset of the reals.
</p><!--293--><p class="indent">   Assume <!--l. 293--><math 
xmlns="&mmlns;" mode="inline"><mi>b</mi> <mo>=</mo> <msub 
><mi>&#x03C9;</mi><mrow 
><mn>1</mn></mrow></msub 
></math>, and
fix a subset, <!--l. 293--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi></math>,
of <!--l. 293--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>&#x03C9;</mi><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math> of order
type <!--l. 294--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>&#x03C9;</mi><mrow 
><mn>1</mn></mrow></msub 
></math> under
<!--l. 294--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mo>&#x003C;</mo> <mrow 
><mo>&#x2217;</mo></mrow></msup 
></math>. To repeat,

<!--l. 294--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi></math> is a
<!--l. 294--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03BB;</mi></math>-subset of
<!--l. 295--><math 
xmlns="&mmlns;" mode="inline"><mi fontweight="bold">R</mi></math>. In chapter&nbsp;2 of his book [<a 
href="#XTodor">16</a>],
Todor<!--l. 295-->cevi<!--l. 295-->c
associates to a certain type of map, <!--l. 296--><math 
xmlns="&mmlns;" mode="inline"><mi>H</mi></math>,
of <!--l. 296--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi></math> into the
countable subsets of <!--l. 297--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi></math>
a space <!--l. 297--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi><mrow 
><mo>[</mo><mi>H</mi><mo>]</mo></mrow></math>
with the following properties: the topology on
<!--l. 297--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi><mrow 
><mo>[</mo><mi>H</mi><mo>]</mo></mrow></math> is of Kunen line
type, and <!--l. 298--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi><mrow 
><mo>[</mo><mi>H</mi><mo>]</mo></mrow></math> is a locally
compact strong <!--l. 298--><math 
xmlns="&mmlns;" mode="inline"><mi>S</mi></math>-space.
</p><!--300--><p class="indent">   In chapter&nbsp;0 of the same monograph, for any partial order
<!--l. 300--><math 
xmlns="&mmlns;" mode="inline"><mo>&#x2264;</mo></math> on
<!--l. 300--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi></math>,
Todor<!--l. 301-->cevi<!--l. 301-->c
defines the space <!--l. 301--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi><mrow 
><mo>[</mo><mo>&#x2264;</mo><mo>]</mo></mrow></math> with basic
open neighbourhoods of <!--l. 302--><math 
xmlns="&mmlns;" mode="inline"><mi>a</mi></math>
in <!--l. 302--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi></math> of the
form, for <!--l. 302--><math 
xmlns="&mmlns;" mode="inline"><mi>n</mi> <mo>&#x2208;</mo> <mi>&#x03C9;</mi></math>,
<!--l. 302--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>B</mi><mrow 
><mi>n</mi><mo>,</mo><mi>a</mi></mrow></msub 
><mrow 
><mo>[</mo><mo>&#x2264;</mo> <mi>a</mi><mo>]</mo></mrow> <mo>=</mo> <mrow 
><mo>{</mo><mi>b</mi> <mo>&#x2208;</mo> <mi>A</mi> <mo>:</mo> <mi>b</mi> <mo>&#x2264;</mo> <mi>a</mi><mo>}</mo></mrow> <mo>&#x2229;</mo> <mrow 
><mo>{</mo><mi>b</mi> <mo>&#x2208;</mo> <mi>A</mi> <mo>:</mo> <mi>a</mi> <mo>|</mo> <mi>n</mi> <mo>=</mo> <mi>b</mi> <mo>|</mo> <mi>n</mi><mo>}</mo></mrow></math>. &nbsp;Clearly the topology on
<!--l. 305--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi><mrow 
><mo>[</mo><mo>&#x2264;</mo><mo>]</mo></mrow></math> refines the Euclidean topology.
&nbsp;Todor<!--l. 305-->cevi<!--l. 305-->c
proves (Theorem 0.6) that <!--l. 306--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi><mrow 
><mo>[</mo><mo>&#x2264;</mo><mo>]</mo></mrow></math>
is a strong <!--l. 306--><math 
xmlns="&mmlns;" mode="inline"><mi>S</mi></math>-space
and <!--l. 306--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi><mrow 
><mo>[</mo><mo>&#x2265;</mo><mo>]</mo></mrow></math> is a strong
<!--l. 307--><math 
xmlns="&mmlns;" mode="inline"><mi>L</mi></math>-space. &nbsp;He also shows
(Theorem 3.0) that <!--l. 307--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi><mrow 
><mo>[</mo><msub 
><mo>&#x2264;</mo> <mrow 
><mi>l</mi><mi>e</mi><mi>x</mi></mrow></msub 
><mo>]</mo></mrow></math>
and <!--l. 308--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi><mrow 
><mo>[</mo><msub 
><mo>&#x2265;</mo> <mrow 
><mi>l</mi><mi>e</mi><mi>x</mi></mrow></msub 
><mo>]</mo></mrow></math>
(which are homeomorphic to subsets of the Sorgenfrey line) are hereditarily separable
and hereditarily Lindel&ouml;f in all finite powers. &nbsp;In [<a 
href="#XPaperI">5</a>, Section 1.4], it was noted that
<!--l. 310--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi><mrow 
><mo>[</mo><mo>&#x2264;</mo><mo>]</mo></mrow></math> is
also a Kunen line type space.
</p><!--314--><p class="noindent"><span class="likeparagraphHead"><a 
  name="x1-70001"></a><a 
  name="QQ1-1-7"></a>Duplication:</span>
   Let <!--l. 316--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> be a
compact subset of <!--l. 316--><math 
xmlns="&mmlns;" mode="inline"><mi fontweight="bold">R</mi></math>,
let <!--l. 316--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03C4;</mi></math> be a
topology on <!--l. 316--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>,
finer than the Euclidean topology, with a base of compact open sets, and let
<!--l. 318--><math 
xmlns="&mmlns;" mode="inline"><mi>C</mi></math> be a
<!--l. 318--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03C4;</mi></math>-closed subset
of <!--l. 318--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>. &nbsp;Define
<!--l. 318--><math 
xmlns="&mmlns;" mode="inline"><mi>D</mi><mrow 
><mo>(</mo><mi>X</mi><mo>,</mo> <mi>&#x03C4;</mi><mo>,</mo> <mi>C</mi><mo>)</mo></mrow></math> to be the

subspace <!--l. 319--><math 
xmlns="&mmlns;" mode="inline"><mi>D</mi><mrow 
><mo>(</mo><mi>X</mi><mo>,</mo> <mi>&#x03C4;</mi><mo>,</mo> <mi>X</mi><mo>)</mo></mrow> <mo>-</mo> <mrow 
><mo>(</mo><mi>X</mi> <mo>-</mo> <mi>C</mi><mo>)</mo></mrow> <mo>&#x00D7;</mo> <mrow 
><mo>{</mo><mn>0</mn><mo>}</mo></mrow></math>, of the
space <!--l. 320--><math 
xmlns="&mmlns;" mode="inline"><mi>D</mi><mrow 
><mo>(</mo><mi>X</mi><mo>,</mo> <mi>&#x03C4;</mi><mo>,</mo> <mi>X</mi><mo>)</mo></mrow></math> which has
underlying set <!--l. 320--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi> <mo>&#x00D7;</mo> <mrow 
><mo>{</mo><mn>0</mn><mo>,</mo> <mn>1</mn><mo>}</mo></mrow></math>,
and topology with base consisting of sets of the form
<!--l. 321--><math 
xmlns="&mmlns;" mode="inline"><mi>T</mi> <mo>&#x00D7;</mo> <mrow 
><mo>{</mo><mn>0</mn><mo>}</mo></mrow></math> for
<!--l. 321--><math 
xmlns="&mmlns;" mode="inline"><mi>T</mi></math> in
<!--l. 321--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03C4;</mi></math>, and
<!--l. 322--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi> <mo>&#x00D7;</mo> <mrow 
><mo>{</mo><mn>0</mn><mo>,</mo> <mn>1</mn><mo>}</mo></mrow> <mo>-</mo> <mi>K</mi> <mo>&#x00D7;</mo> <mrow 
><mo>{</mo><mn>0</mn><mo>}</mo></mrow></math> for Euclidean
open <!--l. 322--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math> and
<!--l. 322--><math 
xmlns="&mmlns;" mode="inline"><mi>K</mi></math> a compact-open
subspace of <!--l. 323--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>X</mi><mo>,</mo> <mi>&#x03C4;</mi><mo>)</mo></mrow></math>.
&nbsp;Note that <!--l. 323--><math 
xmlns="&mmlns;" mode="inline"><mi>D</mi><mrow 
><mo>(</mo><mi>I</mi><mo>,</mo> <mi>D</mi><mo>,</mo> <mi>I</mi><mo>)</mo></mrow></math>,
where <!--l. 324--><math 
xmlns="&mmlns;" mode="inline"><mi>D</mi></math>
is the discrete topology, is the usual Alexandroff duplicate.
</p><!--326--><p class="indent">   Clearly <!--l. 326--><math 
xmlns="&mmlns;" mode="inline"><mi>D</mi><mrow 
><mo>(</mo><mi>X</mi><mo>,</mo> <mi>&#x03C4;</mi><mo>,</mo> <mi>C</mi><mo>)</mo></mrow></math> is a closed
subspace of <!--l. 326--><math 
xmlns="&mmlns;" mode="inline"><mi>D</mi><mrow 
><mo>(</mo><mi>X</mi><mo>,</mo> <mi>&#x03C4;</mi><mo>,</mo> <mi>X</mi><mo>)</mo></mrow></math>. &nbsp;It is
straightforward to check that <!--l. 327--><math 
xmlns="&mmlns;" mode="inline"><mi>D</mi><mrow 
><mo>(</mo><mi>X</mi><mo>,</mo> <mi>&#x03C4;</mi><mo>,</mo> <mi>X</mi><mo>)</mo></mrow></math>
is a compact (Hausdorff) space which is: first countable,
separable, hereditarily separable or metrisable, if and only if
<!--l. 329--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>X</mi><mo>,</mo> <mi>&#x03C4;</mi><mo>)</mo></mrow></math> has
the corresponding property.
</p><!--331--><p class="noindent"><span class="likeparagraphHead"><a 
  name="x1-80001"></a><a 
  name="QQ1-1-8"></a>Preservation of universal sets:</span>
   From now on, <!--l. 333--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x0393;</mi></math> will
denote a Borel class. Write <!--l. 333--><math 
xmlns="&mmlns;" mode="inline"><mo>&#x223C;</mo> <mi>&#x0393;</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></math>
for <!--l. 334--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>{</mo><mi>X</mi> <mo>-</mo> <mi>S</mi> <mo>:</mo> <mi>S</mi> <mo>&#x2208;</mo> <mi>&#x0393;</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow><mo>}</mo></mrow></math>.
&nbsp;Most of the results of this section are modifications of those concerning the open
universal sets found in [<a 
href="#XPaperI">5</a>, Section 1.6].
</p>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Lemma</span>&nbsp;<span 
class="cmbx-10">1</span> </span><a 
  name="x1-80011"></a><span 
class="cmti-10">If </span><!--l. 339--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math>
<span 
class="cmti-10">is a </span><!--l. 339--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x0393;</mi></math><span 
class="cmti-10">-universal</span>
<span 
class="cmti-10">set for </span><!--l. 339--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">parametrised by </span><!--l. 339--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">then </span><!--l. 340--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>X</mi> <mo>&#x00D7;</mo> <mi>Y</mi> <mo>)</mo></mrow><mo>-</mo><mi>U</mi></math>
<span 
class="cmti-10">is a </span><!--l. 340--><math 
xmlns="&mmlns;" mode="inline"><mo>&#x223C;</mo> <mi>&#x0393;</mi></math><span 
class="cmti-10">-universal</span>
<span 
class="cmti-10">set for </span><!--l. 341--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">parametrised by </span><!--l. 341--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math><span 
class="cmti-10">.</span>
   </div>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Lemma</span>&nbsp;<span 
class="cmbx-10">2</span> </span><a 
  name="x1-80022"></a><span 
class="cmti-10">If </span><!--l. 345--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>X</mi><mrow 
><mi>&#x2032;</mi></mrow></msup 
></math>

<span 
class="cmti-10">is a subspace of </span><!--l. 345--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">then </span><!--l. 345--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi> <mo>&#x2229;</mo> <mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>&#x2032;</mi></mrow></msup 
> <mo>&#x00D7;</mo> <mi>Y</mi> <mo>)</mo></mrow></math>
<span 
class="cmti-10">is a </span><!--l. 346--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x0393;</mi></math><span 
class="cmti-10">-universal</span>
<span 
class="cmti-10">set for </span><!--l. 346--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>X</mi><mrow 
><mi>&#x2032;</mi></mrow></msup 
></math>
<span 
class="cmti-10">parametrised by </span><!--l. 347--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math><span 
class="cmti-10">.</span>
   </div>
<!--351--><p class="indent">   <span 
class="cmbx-10">Proof. </span>The result follows from the fact that the trace of a Borel set
on a subspace is a Borel set of that subspace of the same Borel class.
&nbsp;<!--l. 353--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x25CA;</mi></math>
<br class="newline" />
</p>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Lemma</span>&nbsp;<span 
class="cmbx-10">3</span> </span><a 
  name="x1-80033"></a><span 
class="cmti-10">(1) </span>&nbsp;<span 
class="cmti-10">If </span><!--l. 356--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
> <mo>&#x2287;</mo> <mi>Y</mi> </math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">and if </span><!--l. 356--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">has a </span><!--l. 356--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x0393;</mi></math><span 
class="cmti-10">-universal</span>
<span 
class="cmti-10">set </span><!--l. 357--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math>
<span 
class="cmti-10">parametrised by </span><!--l. 357--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">then </span><!--l. 357--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">has one parametrised by </span><!--l. 358--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
></math><span 
class="cmti-10">.</span>
<!--360--><p class="indent">   <span 
class="cmti-10">(2) </span>&nbsp;<span 
class="cmti-10">Let </span><!--l. 360--><math 
xmlns="&mmlns;" mode="inline"><mi>f</mi> <mo>:</mo> <msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
> <mi>&#x2192;</mi> <mi>Y</mi> </math>
<span 
class="cmti-10">be a continuous surjection. </span>&nbsp;<span 
class="cmti-10">If </span><!--l. 361--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">has a </span><!--l. 361--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x0393;</mi></math><span 
class="cmti-10">-universal</span>
<span 
class="cmti-10">set </span><!--l. 361--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math>
<span 
class="cmti-10">parametrised by </span><!--l. 361--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">then </span><!--l. 361--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">has a </span><!--l. 362--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x0393;</mi></math><span 
class="cmti-10">-universal</span>
<span 
class="cmti-10">set parametrised by </span><!--l. 362--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
></math><span 
class="cmti-10">.</span>
</p>
   </div>
<!--366--><p class="indent">   <span 
class="cmbx-10">Proof. </span><span 
class="cmti-10">Ad (1): </span>&nbsp;Let <!--l. 366--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>U</mi><mrow 
><mi>&#x2032;</mi></mrow></msup 
></math>
be a <!--l. 366--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x0393;</mi></math>-set
in <!--l. 366--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi> <mo>&#x00D7;</mo> <msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
></math> such
that <!--l. 367--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>U</mi><mrow 
><mi>&#x2032;</mi></mrow></msup 
> <mo>&#x2229;</mo> <mrow 
><mo>(</mo><mi>X</mi> <mo>&#x00D7;</mo> <mi>Y</mi> <mo>)</mo></mrow> <mo>=</mo> <mi>U</mi></math>. &nbsp;Then
<!--l. 367--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>U</mi><mrow 
><mi>&#x2032;</mi></mrow></msup 
></math> is a
<!--l. 368--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x0393;</mi></math>-universal set
parametrised by <!--l. 368--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
></math>.
</p><!--370--><p class="indent">   <span 
class="cmti-10">Ad (2): </span>&nbsp;Let <!--l. 370--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>U</mi><mrow 
><mi>&#x2032;</mi></mrow></msup 
> <mo>=</mo> <mrow 
><mo>{</mo><mrow 
><mo>(</mo><mi>x</mi><mo>,</mo> <msup 
><mi>y</mi><mrow 
><mi>&#x2032;</mi></mrow></msup 
><mo>)</mo></mrow> <mo>:</mo> <mrow 
><mo>(</mo><mi>x</mi><mo>,</mo> <mi>f</mi><mrow 
><mo>(</mo><mi>y</mi><mo>)</mo></mrow><mo>)</mo></mrow> <mo>&#x2208;</mo> <mi>U</mi><mo>}</mo></mrow> <mo>=</mo> <msup 
><mrow 
><mo>(</mo><msub 
><mi>i</mi><mrow 
><mi>X</mi></mrow></msub 
> <mo>&#x00D7;</mo> <mi>f</mi><mo>)</mo></mrow><mrow 
><mo>&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow 
><mo>(</mo><mi>U</mi><mo>)</mo></mrow></math>.
&nbsp;Since <!--l. 372--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>i</mi><mrow 
><mi>X</mi></mrow></msub 
> <mo>&#x00D7;</mo> <mi>f</mi></math> is
continuous, <!--l. 373--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>U</mi><mrow 
><mi>&#x2032;</mi></mrow></msup 
> <mo>&#x2208;</mo> <mi>&#x0393;</mi><mrow 
><mo>(</mo><mi>X</mi> <mo>&#x00D7;</mo> <msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
><mo>)</mo></mrow></math>.
&nbsp;If <!--l. 373--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi> <mo>&#x2208;</mo> <mi>&#x0393;</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></math>, then there
is an element <!--l. 374--><math 
xmlns="&mmlns;" mode="inline"><mi>y</mi> <mo>&#x2208;</mo> <mi>Y</mi> </math>
such that <!--l. 375--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi> <mo>=</mo> <msup 
><mi>U</mi><mrow 
><mi>y</mi></mrow></msup 
></math>.

&nbsp;Pick <!--l. 375--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B7;</mi> <mo>&#x2208;</mo> <msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
></math> such
that <!--l. 375--><math 
xmlns="&mmlns;" mode="inline"><mi>y</mi> <mo>=</mo> <mi>f</mi><mrow 
><mo>(</mo><mi>&#x03B7;</mi><mo>)</mo></mrow> <mo>&#x2208;</mo> <mi>Y</mi> </math>.
&nbsp;Then <!--l. 376--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi> <mo>=</mo> <msup 
><mi>U</mi><mrow 
><mi>y</mi></mrow></msup 
> <mo>=</mo> <msup 
><mi>U</mi><mrow 
><mi>f</mi><mrow 
><mo>(</mo><mi>&#x03B7;</mi><mo>)</mo></mrow></mrow></msup 
> <mo>=</mo> <msup 
><mrow 
><mo>(</mo><msup 
><mi>U</mi><mrow 
><mi>&#x2032;</mi></mrow></msup 
><mo>)</mo></mrow><mrow 
><mi>&#x03B7;</mi></mrow></msup 
></math>.
&nbsp;<!--l. 378--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x25CA;</mi></math>
<br class="newline" />
</p>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Lemma</span>&nbsp;<span 
class="cmbx-10">4</span> </span><span 
class="cmti-10">Suppose </span><!--l. 381--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">has a </span><!--l. 381--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mn>2</mn></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmti-10">-universal</span>
<span 
class="cmti-10">set, </span><!--l. 381--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">parametrised by </span><!--l. 381--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math><span 
class="cmti-10">.</span>
&nbsp;<span 
class="cmti-10">Let </span><!--l. 382--><math 
xmlns="&mmlns;" mode="inline"><mi>f</mi> <mo>:</mo> <mi>X</mi> <mi>&#x2192;</mi> <msup 
><mi>X</mi><mrow 
><mi>&#x2032;</mi></mrow></msup 
></math>
<span 
class="cmti-10">be a perfect map. </span>&nbsp;<span 
class="cmti-10">Then </span><!--l. 382--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>X</mi><mrow 
><mi>&#x2032;</mi></mrow></msup 
></math>
<span 
class="cmti-10">has a </span><!--l. 383--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mn>2</mn></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmti-10">-universal</span>
<span 
class="cmti-10">set, </span><!--l. 383--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>U</mi><mrow 
><mi>&#x2032;</mi></mrow></msup 
></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">parametrised by </span><!--l. 383--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math><span 
class="cmti-10">.</span>
   </div>
<!--387--><p class="indent">   <span 
class="cmbx-10">Proof. </span>The set <!--l. 387--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>U</mi><mrow 
><mi>&#x2032;</mi></mrow></msup 
> <mo>=</mo> <mrow 
><mo>(</mo><mi>f</mi> <mo>&#x00D7;</mo> <msub 
><mi>i</mi><mrow 
><mi>Y</mi> </mrow></msub 
><mo>)</mo></mrow><mrow 
><mo>(</mo><mi>U</mi><mo>)</mo></mrow></math>
is a <!--l. 388--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mn>2</mn></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal
set for <!--l. 388--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>X</mi><mrow 
><mi>&#x2032;</mi></mrow></msup 
></math>
parametrised by <!--l. 388--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>.
&nbsp;<!--l. 389--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x25CA;</mi></math>
<br class="newline" />
   The following result is easy to show.
</p>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Lemma</span>&nbsp;<span 
class="cmbx-10">5</span> </span><a 
  name="x1-80055"></a><span 
class="cmti-10">Let </span><!--l. 394--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>=</mo><msub 
> <mo>&cup;</mo>
    <mrow 
><mi>i</mi><mo>&#x2208;</mo><mi>I</mi></mrow></msub 
><msub 
><mi>A</mi><mrow 
><mi>i</mi></mrow></msub 
></math><span 
class="cmti-10">.</span>
&nbsp;<span 
class="cmti-10">Suppose that for each </span><!--l. 395--><math 
xmlns="&mmlns;" mode="inline"><mi>i</mi> <mo>&#x2208;</mo> <mi>I</mi></math>
<span 
class="cmti-10">there is a </span><!--l. 395--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmti-10">-set</span>
<!--l. 396--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>U</mi><mrow 
><mi>i</mi></mrow></msub 
></math>
<span 
class="cmti-10">in </span><!--l. 396--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi> <mo>&#x00D7;</mo> <msub 
><mi>Y</mi> <mrow 
><mi>i</mi></mrow></msub 
></math>
<span 
class="cmti-10">such that each </span><!--l. 396--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi> <mo>&#x2208;</mo> <msub 
><mi>A</mi><mrow 
><mi>i</mi></mrow></msub 
></math>
<span 
class="cmti-10">is equal to </span><!--l. 397--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>U</mi><mrow 
><mi>i</mi></mrow><mrow 
><mi>y</mi></mrow></msubsup 
></math>
<span 
class="cmti-10">for some </span><!--l. 397--><math 
xmlns="&mmlns;" mode="inline"><mi>y</mi> <mo>&#x2208;</mo> <msub 
><mi>Y</mi> <mrow 
><mi>i</mi></mrow></msub 
></math><span 
class="cmti-10">.</span>
&nbsp;<span 
class="cmti-10">If </span><!--l. 397--><math 
xmlns="&mmlns;" mode="inline"><mo>|</mo><mi>I</mi><mo>|</mo> <mo>&#x2264;</mo> <msub 
><mi>&#x2135;</mi><mrow 
><mn>0</mn></mrow></msub 
></math>
<span 
class="cmti-10">or </span><!--l. 398--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B1;</mi> <mo>&#x2208;</mo> <mi>&#x03C9;</mi></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">then the set </span><!--l. 398--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mo>&cup;</mo>
   <mrow 
><mi>i</mi><mo>&#x2208;</mo><mi>I</mi></mrow></msub 
><msub 
><mi>U</mi><mrow 
><mi>i</mi></mrow></msub 
></math>
<span 
class="cmti-10">is a </span><!--l. 399--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmti-10">-universal</span>
<span 
class="cmti-10">set for </span><!--l. 399--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">parametrised by </span><!--l. 400--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mo>&#x2295;</mo>
    <mrow 
><mi>i</mi><mo>&#x2208;</mo><mi>I</mi></mrow></msub 
><msub 
><mi>Y</mi> <mrow 
><mi>i</mi></mrow></msub 
></math><span 
class="cmti-10">.</span>

   </div>
<!--403--><p class="noindent"><span class="likeparagraphHead"><a 
  name="x1-90001"></a><a 
  name="QQ1-1-9"></a>Borel universal sets exist:</span>
   By [<a 
href="#XKechris">8</a>, Theorem 22.3], if <!--l. 405--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
has countable weight, and <!--l. 406--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi>  <mo>=</mo> <msup 
><mn>2</mn><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math>,
then <!--l. 406--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> has
<!--l. 406--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x0393;</mi></math>-universal sets
parametrised by <!--l. 406--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>
for any <!--l. 407--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x0393;</mi></math>.
&nbsp;The following result is in a similar spirit.
</p>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Proposition</span>&nbsp;<span 
class="cmbx-10">6</span> </span><a 
  name="x1-90016"></a><span 
class="cmti-10">Suppose </span><!--l. 410--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">has an open universal set, </span><!--l. 410--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">parametrised by </span><!--l. 411--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math><span 
class="cmti-10">.</span>
&nbsp;<span 
class="cmti-10">Then for each </span><!--l. 411--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B1;</mi> <mo>&#x2208;</mo> <msub 
><mi>&#x03C9;</mi><mrow 
><mn>1</mn></mrow></msub 
><mo>-</mo><mrow 
><mo>{</mo><mn>0</mn><mo>}</mo></mrow></math><span 
class="cmti-10">,</span>
<!--l. 411--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">has a </span><!--l. 412--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmti-10">-universal</span>
<span 
class="cmti-10">set, </span><!--l. 412--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>U</mi><mrow 
><mi>&#x03B1;</mi></mrow></msub 
></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">parametrised by </span><!--l. 413--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math><span 
class="cmti-10">.</span>
   </div>
<!--417--><p class="indent">   <span 
class="cmbx-10">Proof. </span>The first step is to show that
<!--l. 417--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> has a
<!--l. 417--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A0;</mi><mrow 
><mn>2</mn></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal set,
<!--l. 417--><math 
xmlns="&mmlns;" mode="inline"><mi>T</mi></math>, parametrised
by <!--l. 418--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math>.
&nbsp;Define <!--l. 418--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>T</mi><mrow 
><mi>n</mi></mrow></msub 
> <mo>&#x2286;</mo> <mi>X</mi> <mo>&#x00D7;</mo> <msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math>
by <!--l. 419--><math 
xmlns="&mmlns;" mode="inline"><mrow 
>
                                  <msub 
><mi>T</mi><mrow 
><mi>n</mi></mrow></msub 
> <mo>=</mo> <mrow 
><mo>{</mo><mrow 
><mo>(</mo><mi>x</mi><mo>,</mo> <mi>f</mi><mo>)</mo></mrow> <mo>:</mo> <mi>x</mi> <mo>&#x2208;</mo> <msup 
><mi>U</mi><mrow 
><mi>f</mi><mrow 
><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></msup 
><mo>}</mo></mrow><mrow 
class="text"><mtext > .</mtext></mrow>
</mrow></math> Let
<!--l. 423--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>&#x03C8;</mi><mrow 
><mi>n</mi></mrow></msub 
> <mo>:</mo> <mi>X</mi> <mo>&#x00D7;</mo> <msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
><mi>&#x2192;</mi><mi>X</mi> <mo>&#x00D7;</mo> <mi>Y</mi> </math> be the continuous
function that takes <!--l. 424--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>x</mi><mo>,</mo> <mi>f</mi><mo>)</mo></mrow></math>

to <!--l. 424--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>x</mi><mo>,</mo> <mi>f</mi><mrow 
><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>)</mo></mrow></math>. &nbsp;Then
<!--l. 425--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03C8;</mi><mrow 
><mi>n</mi></mrow><mrow 
> <mo>&#x2212;</mo> <mn>1</mn></mrow></msubsup 
><mrow 
><mo>(</mo><mi>U</mi><mo>)</mo></mrow> <mo>=</mo> <msub 
><mi>T</mi><mrow 
><mi>n</mi></mrow></msub 
></math>. &nbsp;Since
<!--l. 425--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03C8;</mi></math> is continuous and
<!--l. 426--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math> is open, it must
be the case that <!--l. 426--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>T</mi><mrow 
><mi>n</mi></mrow></msub 
></math> is
also open. &nbsp;The set <!--l. 427--><math 
xmlns="&mmlns;" mode="inline"><mi>T</mi> <mo>=</mo><msub 
> <mo>&cap;</mo>
    <mrow 
><mi>n</mi><mo>&#x2208;</mo><mi>&#x03C9;</mi></mrow></msub 
><msub 
><mi>T</mi><mrow 
><mi>n</mi></mrow></msub 
></math>
is then a <!--l. 427--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A0;</mi><mrow 
><mn>2</mn></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-set
of <!--l. 428--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi> <mo>&#x00D7;</mo> <msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math>, and is a
<!--l. 428--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A0;</mi><mrow 
><mn>2</mn></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal set for
<!--l. 428--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> parametrised
by <!--l. 429--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math>. &nbsp;The
set <!--l. 429--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>U</mi><mrow 
><mn>2</mn></mrow></msub 
> <mo>=</mo> <mrow 
><mo>(</mo><mi>X</mi> <mo>&#x00D7;</mo> <msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
><mo>)</mo></mrow><mo>-</mo><mi>T</mi></math> is then
a <!--l. 430--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mn>2</mn></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal
set for <!--l. 430--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>.
</p><!--432--><p class="indent">   Suppose <!--l. 432--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B1;</mi> <mo>&#x2208;</mo> <msub 
><mi>&#x03C9;</mi><mrow 
><mn>1</mn></mrow></msub 
><mo>-</mo><mrow 
><mo>{</mo><mn>0</mn><mo>}</mo></mrow></math> is a limit,
and that for all <!--l. 433--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B7;</mi> <mo>&#x2208;</mo> <mi>&#x03B1;</mi><mo>-</mo><mrow 
><mo>{</mo><mn>0</mn><mo>}</mo></mrow></math>, we
have defined <!--l. 434--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B7;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal
sets, <!--l. 434--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>U</mi><mrow 
><mi>&#x03B7;</mi></mrow></msub 
></math>, for
<!--l. 434--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> parametrised
by <!--l. 435--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math>. &nbsp;Now
<!--l. 435--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B1;</mi></math> is countable, and
has a sequence <!--l. 435--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mrow 
><mo>{</mo><msub 
><mi>&#x03B7;</mi><mrow 
><mi>n</mi></mrow></msub 
><mo>}</mo></mrow><mrow 
><mi>n</mi><mo>&#x2208;</mo><mi>&#x03C9;</mi></mrow></msub 
> <mo>&#x2286;</mo> <mi>&#x03B1;</mi><mrow 
class="text"><mtext >  such that for all </mtext></mrow><mi>n</mi> <mo>&#x2208;</mo> <mi>&#x03C9;</mi><mrow 
class="text"><mtext > , </mtext></mrow><msub 
><mi>&#x03B7;</mi><mrow 
><mi>n</mi></mrow></msub 
> <mo>&#x2264;</mo> <msub 
><mi>&#x03B7;</mi><mrow 
><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msub 
><mrow 
class="text"><mtext > , and </mtext></mrow><mo> sup</mo><mrow 
><mo>{</mo><msub 
><mi>&#x03B7;</mi><mrow 
><mi>n</mi></mrow></msub 
> <mo>+</mo> <mn>1</mn> <mo>:</mo> <mi>n</mi> <mo>&#x2208;</mo> <mi>&#x03C9;</mi><mo>}</mo></mrow> <mo>=</mo> <mi>&#x03B1;</mi> </math>.
&nbsp;Let <!--l. 438--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03C6;</mi> <mo>:</mo> <mi fontweight="bold">N</mi> <mo>&#x00D7;</mo> <mi fontweight="bold">N</mi><mi>&#x2192;</mi><mi fontweight="bold">N</mi></math> be a
bijection, and <!--l. 439--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>&#x03C6;</mi><mrow 
><mi>n</mi></mrow></msub 
> <mo>:</mo> <mi fontweight="bold">N</mi><mi>&#x2192;</mi><mi fontweight="bold">N</mi></math>
be the function <!--l. 440--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>&#x03C6;</mi><mrow 
><mi>n</mi></mrow></msub 
><mrow 
><mo>(</mo><mi>m</mi><mo>)</mo></mrow> <mo>=</mo> <mi>&#x03C6;</mi><mrow 
><mo>(</mo><mi>n</mi><mo>,</mo> <mi>m</mi><mo>)</mo></mrow></math>.
&nbsp;We now define <!--l. 441--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>T</mi><mrow 
><mi>n</mi></mrow></msub 
> <mo>&#x2286;</mo> <mi>X</mi> <mo>&#x00D7;</mo> <msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math>
by <!--l. 442--><math 
xmlns="&mmlns;" mode="inline"><mrow 
>
                               <msub 
><mi>T</mi><mrow 
><mi>n</mi></mrow></msub 
> <mo>=</mo> <mrow 
><mo>{</mo><mrow 
><mo>(</mo><mi>x</mi><mo>,</mo> <mi>f</mi><mo>)</mo></mrow> <mo>:</mo> <mi>x</mi> <mo>&#x2208;</mo> <msubsup 
><mi>U</mi><mrow 
><msub 
><mi>&#x03B7;</mi><mrow 
><mi>n</mi></mrow></msub 
></mrow><mrow 
><mi>f</mi> <mo>&centerdot;</mo> <msub 
><mi>&#x03C6;</mi><mrow 
><mi>n</mi></mrow></msub 
></mrow></msubsup 
><mo>}</mo></mrow><mrow 
class="text"><mtext > .</mtext></mrow>
</mrow></math> Let
<!--l. 446--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>&#x03C8;</mi><mrow 
><mi>n</mi></mrow></msub 
> <mo>:</mo> <mi>X</mi> <mo>&#x00D7;</mo> <msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
><mi>&#x2192;</mi><mi>X</mi> <mo>&#x00D7;</mo> <msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math> be the continuous
function that takes <!--l. 447--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>x</mi><mo>,</mo> <mi>f</mi><mo>)</mo></mrow></math>
to <!--l. 447--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>x</mi><mo>,</mo> <mi>f</mi> <mo>&centerdot;</mo> <msub 
><mi>&#x03C6;</mi><mrow 
><mi>n</mi></mrow></msub 
><mo>)</mo></mrow></math>. &nbsp;Then
<!--l. 448--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03C8;</mi><mrow 
><mi>n</mi></mrow><mrow 
> <mo>&#x2212;</mo> <mn>1</mn></mrow></msubsup 
><mrow 
><mo>(</mo><msub 
><mi>U</mi><mrow 
><msub 
><mi>&#x03B7;</mi><mrow 
><mi>n</mi></mrow></msub 
></mrow></msub 
><mo>)</mo></mrow> <mo>=</mo> <msub 
><mi>T</mi><mrow 
><mi>n</mi></mrow></msub 
></math>. &nbsp;As before,
each <!--l. 449--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>T</mi><mrow 
><mi>n</mi></mrow></msub 
></math> is a
<!--l. 449--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><msub 
><mi>&#x03B7;</mi><mrow 
><mi>n</mi></mrow></msub 
></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-set in

<!--l. 449--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi> <mo>&#x00D7;</mo> <msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math>. &nbsp;The set
<!--l. 450--><math 
xmlns="&mmlns;" mode="inline"><mi>T</mi> <mo>=</mo><msub 
> <mo>&cap;</mo>
    <mrow 
><mi>n</mi><mo>&#x2208;</mo><mi>&#x03C9;</mi></mrow></msub 
><msub 
><mi>T</mi><mrow 
><mi>n</mi></mrow></msub 
></math> is then a
<!--l. 450--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A0;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-set, and a
<!--l. 451--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A0;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal set for
<!--l. 451--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> parametrised
by <!--l. 452--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math>.
</p><!--454--><p class="indent">   If <!--l. 454--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B1;</mi></math>
is a successor, we simply follow the arguments in the construction of
<!--l. 455--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>U</mi><mrow 
><mn>2</mn></mrow></msub 
></math> given
<!--l. 455--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math>.
&nbsp;<!--l. 456--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x25CA;</mi></math>
<br class="newline" />
</p>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Corollary</span>&nbsp;<span 
class="cmbx-10">7</span> </span><a 
  name="x1-90027"></a><span 
class="cmti-10">Suppose </span><!--l. 459--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math>
<span 
class="cmti-10">is an open set in </span><!--l. 459--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi> <mo>&#x00D7;</mo> <mi>Y</mi> </math>
<span 
class="cmti-10">such that each open set of </span><!--l. 460--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">is a countable union of the </span><!--l. 460--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>U</mi><mrow 
><mi>y</mi></mrow></msup 
></math><span 
class="cmti-10">&#x2019;s.</span>
&nbsp;<span 
class="cmti-10">Then there is an open universal set for </span><!--l. 461--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">parametrised by </span><!--l. 461--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math><span 
class="cmti-10">.</span>
   </div>
<!--464--><p class="indent">   Such a <!--l. 464--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math> is called
a <!--l. 464--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03C3;</mi></math><span 
class="cmti-10">-generator </span>for
the open sets of <!--l. 464--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
parametrised by <!--l. 465--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>.
&nbsp;If the unions do not have to be countable, then we say that
<!--l. 466--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math> is a <span 
class="cmti-10">generator </span>for
the open sets of <!--l. 466--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>.
</p>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Lemma</span>&nbsp;<span 
class="cmbx-10">8</span> </span><a 
  name="x1-90038"></a><span 
class="cmti-10">Let </span><!--l. 469--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>X</mi><mo>,</mo> <mi>&#x03C4;</mi><mo>)</mo></mrow></math>
<span 
class="cmti-10">be a space with weight </span><!--l. 470--><math 
xmlns="&mmlns;" mode="inline"><mi>w</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></math><span 
class="cmti-10">.</span>
<span 
class="cmti-10">Then, for each </span><!--l. 470--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B1;</mi> <mo>&#x2208;</mo> <msub 
><mi>&#x03C9;</mi><mrow 
><mn>1</mn></mrow></msub 
><mo>-</mo><mrow 
><mo>{</mo><mn>0</mn><mo>}</mo></mrow></math><span 
class="cmti-10">,</span>
<!--473--><p class="indent">   <span 
class="cmti-10">(1) </span>&nbsp;<!--l. 473--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">has a </span><!--l. 473--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmti-10">-universal</span>
<span 
class="cmti-10">set parametrised by </span><!--l. 473--><math 
xmlns="&mmlns;" mode="inline"><mi>D</mi><msup 
><mrow 
><mo>(</mo><mo>|</mo><mi>&#x03C4;</mi><mo>|</mo><mo>)</mo></mrow><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math><span 
class="cmti-10">;</span>
<span 
class="cmti-10">and</span>
</p><!--476--><p class="indent">   <span 
class="cmti-10">(2) </span>&nbsp;<!--l. 476--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">has a </span><!--l. 476--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmti-10">-universal</span>
<span 
class="cmti-10">set parametrised by </span><!--l. 477--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mn>2</mn><mrow 
><mi>w</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></mrow></msup 
></math><span 
class="cmti-10">.</span>

</p>
   </div>
<!--481--><p class="indent">   <span 
class="cmbx-10">Proof. </span>For any space <!--l. 481--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>X</mi><mo>,</mo> <mi>&#x03C4;</mi><mo>)</mo></mrow></math>,
<!--l. 481--><math 
xmlns="&mmlns;" mode="inline"><mi>D</mi><mrow 
><mo>(</mo><mo>|</mo><mi>&#x03C4;</mi><mo>|</mo><mo>)</mo></mrow></math>
clearly parametrises an open universal, and so, by Proposition&nbsp;<a 
href="#x1-90016">6</a>, for any
<!--l. 483--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B1;</mi> <mo>&#x2208;</mo> <msub 
><mi>&#x03C9;</mi><mrow 
><mn>1</mn></mrow></msub 
></math>,
<!--l. 483--><math 
xmlns="&mmlns;" mode="inline"><mi>D</mi><msup 
><mrow 
><mo>(</mo><mo>|</mo><mi>&#x03C4;</mi><mo>|</mo><mo>)</mo></mrow><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math> parametrises
a <!--l. 484--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal
for <!--l. 484--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>X</mi><mo>,</mo> <mi>&#x03C4;</mi><mo>)</mo></mrow></math>.
</p><!--486--><p class="indent">   By Proposition&nbsp;<a 
href="#x1-90016">6</a> it suffices to show that
<!--l. 486--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> has an open universal
set parametrised by <!--l. 487--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mn>2</mn><mrow 
><mi>w</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></mrow></msup 
></math>.
Let <!--l. 487--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03BB;</mi> <mo>=</mo> <mi>w</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow></math>, and
<!--l. 488--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mrow 
><mo>{</mo><msub 
><mi>B</mi><mrow 
><mi>&#x03B1;</mi></mrow></msub 
><mo>}</mo></mrow><mrow 
><mi>&#x03B1;</mi><mo>&#x2208;</mo><mi>&#x03BB;</mi></mrow></msub 
></math> be a
base for <!--l. 488--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>.
&nbsp;Put <!--l. 489--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi>  <mo>=</mo> <msup 
><mn>2</mn><mrow 
><mi>&#x03BB;</mi></mrow></msup 
></math>. &nbsp;Let
<!--l. 490--><math 
xmlns="&mmlns;" mode="inline"><mrow 
>
                 <mi>U</mi> <mo>=</mo> <mrow 
><mo>{</mo><mrow 
><mo>(</mo><mi>x</mi><mo>,</mo> <mi>y</mi><mo>)</mo></mrow> <mo>:</mo> <mi>x</mi> <mo>&#x2208;</mo> <mo>&cup;</mo>
    <mrow 
><mo>{</mo><msub 
><mi>B</mi><mrow 
><mi>&#x03B1;</mi></mrow></msub 
> <mo>:</mo> <mi>y</mi><mrow 
><mo>(</mo><mi>&#x03B1;</mi><mo>)</mo></mrow> <mo>=</mo> <mn>0</mn><mo>}</mo></mrow><mo>}</mo></mrow><mrow 
class="text"><mtext > .</mtext></mrow>
</mrow></math> We only need to show that
this is open in <!--l. 494--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi> <mo>&#x00D7;</mo> <mi>Y</mi> </math> (as it is quite
clear that all open sets of <!--l. 495--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
can be represented by a <!--l. 495--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>U</mi><mrow 
><mi>y</mi></mrow></msup 
></math>).
&nbsp;Let <!--l. 495--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>x</mi><mo>,</mo> <mi>y</mi><mo>)</mo></mrow> <mo>&#x2208;</mo> <mi>U</mi></math>. &nbsp;Then
<!--l. 496--><math 
xmlns="&mmlns;" mode="inline"><mi>x</mi></math> is in the
open set <!--l. 496--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>U</mi><mrow 
><mi>y</mi></mrow></msup 
> <mo>=</mo> <mo>&cup;</mo>
   <mrow 
><mo>{</mo><msub 
><mi>B</mi><mrow 
><mi>&#x03B1;</mi></mrow></msub 
> <mo>:</mo> <mi>y</mi><mrow 
><mo>(</mo><mi>&#x03B1;</mi><mo>)</mo></mrow> <mo>=</mo> <mn>0</mn><mo>}</mo></mrow></math>.
&nbsp;Let <!--l. 497--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>&#x03B1;</mi><mrow 
><mn>0</mn></mrow></msub 
> <mo>&#x2208;</mo> <mi>&#x03BB;</mi></math> be
such that <!--l. 498--><math 
xmlns="&mmlns;" mode="inline"><mi>y</mi><mrow 
><mo>(</mo><msub 
><mi>&#x03B1;</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>)</mo></mrow> <mo>=</mo> <mn>0</mn></math>
and <!--l. 498--><math 
xmlns="&mmlns;" mode="inline"><mi>x</mi> <mo>&#x2208;</mo> <msub 
><mi>B</mi><mrow 
><msub 
><mi>&#x03B1;</mi><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
></math>. &nbsp;The
set <!--l. 499--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03C0;</mi><mrow 
><msub 
><mi>&#x03B1;</mi><mrow 
><mn>0</mn></mrow></msub 
></mrow><mrow 
> <mo>&#x2212;</mo> <mn>1</mn></mrow></msubsup 
><mrow 
><mo>(</mo><mrow 
><mo>{</mo><mn>0</mn><mo>}</mo></mrow><mo>)</mo></mrow></math> is
open in <!--l. 500--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>.
&nbsp;Let <!--l. 500--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>&#x03BE;</mi><mo>,</mo> <mi>&#x03B7;</mi><mo>)</mo></mrow> <mo>&#x2208;</mo> <msub 
><mi>B</mi><mrow 
><msub 
><mi>&#x03B1;</mi><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
> <mo>&#x00D7;</mo> <msubsup 
><mi>&#x03C0;</mi><mrow 
><msub 
><mi>&#x03B1;</mi><mrow 
><mn>0</mn></mrow></msub 
></mrow><mrow 
> <mo>&#x2212;</mo> <mn>1</mn></mrow></msubsup 
><mrow 
><mo>(</mo><mrow 
><mo>{</mo><mn>0</mn><mo>}</mo></mrow><mo>)</mo></mrow></math>.
&nbsp;Now, <!--l. 501--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B7;</mi><mrow 
><mo>(</mo><msub 
><mi>&#x03B1;</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>)</mo></mrow> <mo>=</mo> <mn>0</mn></math>.
&nbsp;So <!--l. 502--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>U</mi><mrow 
><mi>&#x03B7;</mi></mrow></msup 
> <mo>&#x2287;</mo> <msub 
><mi>B</mi><mrow 
><msub 
><mi>&#x03B1;</mi><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
></math>,
and <!--l. 502--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>&#x03BE;</mi><mo>,</mo> <mi>&#x03B7;</mi><mo>)</mo></mrow> <mo>&#x2208;</mo> <mi>U</mi></math>.
&nbsp;<!--l. 504--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x25CA;</mi></math>

<br class="newline" />
</p>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Lemma</span>&nbsp;<span 
class="cmbx-10">9</span> </span><a 
  name="x1-90049"></a><span 
class="cmti-10">Suppose </span><!--l. 507--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>X</mi><mrow 
><mi>i</mi></mrow></msub 
></math>
<span 
class="cmti-10">has an open universal set </span><!--l. 507--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>U</mi><mrow 
><mi>i</mi></mrow></msub 
></math>
<span 
class="cmti-10">parametrised by </span><!--l. 508--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>Y</mi> <mrow 
><mi>i</mi></mrow></msub 
></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">for each </span><!--l. 508--><math 
xmlns="&mmlns;" mode="inline"><mi>i</mi> <mo>&#x2208;</mo> <mi>n</mi></math><span 
class="cmti-10">.</span>
&nbsp;<span 
class="cmti-10">Then the set </span><!--l. 509--><math 
xmlns="&mmlns;" mode="inline"><mrow 
>
                      <mi>U</mi> <mo>=</mo> <mrow 
><mo>{</mo><mrow 
><mo>(</mo><msub 
><mrow 
><mo>(</mo><msub 
><mi>x</mi><mrow 
><mi>i</mi></mrow></msub 
><mo>)</mo></mrow><mrow 
><mi>i</mi><mo>&#x2208;</mo><mi>n</mi></mrow></msub 
><mo>,</mo> <msub 
><mrow 
><mo>(</mo><msub 
><mi>y</mi><mrow 
><mi>i</mi></mrow></msub 
><mo>)</mo></mrow><mrow 
><mi>i</mi><mo>&#x2208;</mo><mi>n</mi></mrow></msub 
><mo>)</mo></mrow> <mo>:</mo> <msub 
><mi>x</mi><mrow 
><mi>i</mi></mrow></msub 
> <mo>&#x2208;</mo> <msubsup 
><mi>U</mi><mrow 
><mi>i</mi></mrow><mrow 
><msub 
><mi>y</mi><mrow 
><mi>i</mi></mrow></msub 
></mrow></msubsup 
><mo>,</mo> <msub 
><mi>y</mi><mrow 
><mi>i</mi></mrow></msub 
> <mo>&#x2208;</mo> <msub 
><mi>Y</mi> <mrow 
><mi>i</mi></mrow></msub 
><mo>}</mo></mrow>
</mrow></math>
<span 
class="cmti-10">is a generator for the open sets of </span><!--l. 513--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mo>&#x220F;</mo>
   <mrow 
><mi>i</mi><mo>&#x2208;</mo><mi>n</mi></mrow></msub 
><msub 
><mi>X</mi><mrow 
><mi>i</mi></mrow></msub 
></math>
<span 
class="cmti-10">parametrised by </span><!--l. 514--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mo>&#x220F;</mo>
   <mrow 
><mi>i</mi><mo>&#x2208;</mo><mi>i</mi><mi>n</mi></mrow></msub 
><msub 
><mi>Y</mi> <mrow 
><mi>i</mi></mrow></msub 
></math><span 
class="cmti-10">.</span>
   </div>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Theorem</span>&nbsp;<span 
class="cmbx-10">10</span> </span><a 
  name="x1-900510"></a><span 
class="cmti-10">The following are equivalent for a cardinal </span><!--l. 518--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03BA;</mi></math><span 
class="cmti-10">:</span>
<!--520--><p class="indent">   <span 
class="cmti-10">(1) </span>&nbsp;<!--l. 520--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mn>2</mn><mrow 
><msub 
><mi>&#x2135;</mi><mrow 
><mn>0</mn></mrow></msub 
></mrow></msup 
> <mo>&#x003C;</mo> <msup 
><mn>2</mn><mrow 
><mi>&#x03BA;</mi></mrow></msup 
></math><span 
class="cmti-10">;</span>
</p><!--522--><p class="indent">   <span 
class="cmti-10">(2) </span>&nbsp;<span 
class="cmti-10">If </span><!--l. 522--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">has a </span><!--l. 522--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>&#x03B1;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmti-10">-universal</span>
<span 
class="cmti-10">set (for some </span><!--l. 522--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03B1;</mi> <mo>&#x2208;</mo> <msub 
><mi>&#x03C9;</mi><mrow 
><mn>1</mn></mrow></msub 
><mo>-</mo><mrow 
><mo>{</mo><mn>0</mn><mo>}</mo></mrow></math><span 
class="cmti-10">)</span>
<span 
class="cmti-10">parametrised by </span><!--l. 523--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">with </span><!--l. 524--><math 
xmlns="&mmlns;" mode="inline"><mo>|</mo><mi>Y</mi> <mo>|</mo> <mo>&#x2264;</mo> <mi>c</mi></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">then </span><!--l. 524--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>c</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>&#x003C;</mo> <mi>&#x03BA;</mi></math><span 
class="cmti-10">;</span>
</p><!--526--><p class="indent">   <span 
class="cmti-10">(3) </span>&nbsp;<span 
class="cmti-10">Every space </span><!--l. 526--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">with an open universal set parametrised by a compact first countable separable</span>
<span 
class="cmti-10">space </span><!--l. 527--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>
<span 
class="cmti-10">has hereditary cellularity less than </span><!--l. 528--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03BA;</mi></math><span 
class="cmti-10">.</span>
</p>
   </div>

<!--531--><p class="noindent">
</p>
   <h3 class="sectionHead"> 2 <a 
  name="x1-100002"></a><a 
  name="QQ1-1-10"></a>Open universal sets</h3>
<!--533--><p class="noindent">In this section we gather together some results mentioned in [<a 
href="#XPaperI">5</a>], relevant to the
present discussion.
</p>
   <h4 class="subsectionHead">2.1 <a 
  name="x1-110002.1"></a><a 
  name="QQ1-1-11"></a>General spaces</h4>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Theorem</span>&nbsp;<span 
class="cmbx-10">11</span> </span><a 
  name="x1-1100111"></a><span 
class="cmti-10">Suppose </span><!--l. 539--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">has an open universal set, </span><!--l. 539--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">parametrised by </span><!--l. 540--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math><span 
class="cmti-10">.</span>
&nbsp;<span 
class="cmti-10">Then</span>
<!--542--><p class="indent">   <span 
class="cmti-10">(1) </span>&nbsp;<!--l. 542--><math 
xmlns="&mmlns;" mode="inline"><mi>w</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>n</mi><mi>w</mi><mrow 
><mo>(</mo><mi>Y</mi> <mo>)</mo></mrow></math><span 
class="cmti-10">;</span>
</p><!--544--><p class="indent">   <span 
class="cmti-10">(2) </span>&nbsp;<!--l. 544--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><mi>Y</mi> <mo>)</mo></mrow></math><span 
class="cmti-10">;</span>
</p><!--546--><p class="indent">   <span 
class="cmti-10">(3) </span>&nbsp;<!--l. 546--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><mi>Y</mi> <mo>)</mo></mrow></math><span 
class="cmti-10">;</span>
</p><!--548--><p class="indent">   <span 
class="cmti-10">(4) </span>&nbsp;<!--l. 548--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>c</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>c</mi><mrow 
><mo>(</mo><mi>Y</mi> <mo>)</mo></mrow></math><span 
class="cmti-10">.</span>
</p>
   </div>
<!--551--><p class="indent">   Statements (2) and (3) hold because
<!--l. 551--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math>
is an open universal set. &nbsp;We shall see later that if
<!--l. 552--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math> is a
<!--l. 552--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A0;</mi><mrow 
><mn>2</mn></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal
set, then both of them are consistently false.
</p>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Corollary</span>&nbsp;<span 
class="cmbx-10">12</span> </span><a 
  name="x1-1100212"></a><span 
class="cmti-10">Suppose </span><!--l. 556--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">has an open universal set parametrised by </span><!--l. 557--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math><span 
class="cmti-10">.</span>
&nbsp;<span 
class="cmti-10">Then for each </span><!--l. 557--><math 
xmlns="&mmlns;" mode="inline"><mi>n</mi> <mo>&#x2208;</mo> <mi>&#x03C9;</mi></math><span 
class="cmti-10">,</span>
<!--559--><p class="indent">   <span 
class="cmti-10">(1) </span>&nbsp;<!--l. 559--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>n</mi></mrow></msup 
><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>n</mi></mrow></msup 
><mo>)</mo></mrow></math><span 
class="cmti-10">;</span>
</p><!--561--><p class="indent">   <span 
class="cmti-10">(2) </span>&nbsp;<!--l. 561--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>n</mi></mrow></msup 
><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>n</mi></mrow></msup 
><mo>)</mo></mrow></math><span 
class="cmti-10">;</span>
</p><!--563--><p class="indent">   <span 
class="cmti-10">(3) </span>&nbsp;<!--l. 563--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>c</mi><mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>n</mi></mrow></msup 
><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>c</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>n</mi></mrow></msup 
><mo>)</mo></mrow></math><span 
class="cmti-10">.</span>
</p>
   </div>
<!--566--><p class="indent">   Next we use Todor<!--l. 566-->cevi<!--l. 566-->c&#x2019;s
spaces <!--l. 566--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi><mrow 
><mo>[</mo><mo>&#x2264;</mo><mo>]</mo></mrow></math>,
<!--l. 566--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi><mrow 
><mo>[</mo><mo>&#x2265;</mo><mo>]</mo></mrow></math> and
<!--l. 566--><math 
xmlns="&mmlns;" mode="inline"><mi>A</mi><mrow 
><mo>[</mo><msub 
><mo>&#x2264;</mo> <mrow 
><mi>l</mi><mi>e</mi><mi>x</mi></mrow></msub 
><mo>]</mo></mrow></math>
to show that, in the countable case, the inequalities

<!--l. 567--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
><mo>)</mo></mrow></math>,
<!--l. 568--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
><mo>)</mo></mrow></math> and
<!--l. 568--><math 
xmlns="&mmlns;" mode="inline"><mi>n</mi><mi>w</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>&#x2264;</mo><mo> max</mo><mrow 
><mo>(</mo><mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
><mo>)</mo></mrow><mo>,</mo> <mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>&#x03C9;</mi></mrow></msup 
><mo>)</mo></mrow><mo>)</mo></mrow></math>, consistently need not hold,
for a space <!--l. 569--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> with an open
universal set parametrised by <!--l. 570--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>.
&nbsp;It is known that under the assumption that
<!--l. 571--><math 
xmlns="&mmlns;" mode="inline"><mi>S</mi></math>-spaces do not exist [<a 
href="#XTodor1">15</a>],
it is consistent that if <!--l. 571--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>
is either hereditarily separable or hereditarily Lindel&ouml;f, then
<!--l. 572--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math> must
be both hereditarily separable and hereditarily Lindel&ouml;f [<a 
href="#XPaperI">5</a>].
</p>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Example</span>&nbsp;<span 
class="cmbx-10">13</span> </span><a 
  name="x1-1100313"></a> <!--l. 576--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>b</mi> <mo>=</mo> <msub 
><mi>&#x2135;</mi><mrow 
><mn>1</mn></mrow></msub 
><mo>)</mo></mrow></math>
<span 
class="cmti-10">Let </span><!--l. 576--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi> <mo>=</mo> <mi>A</mi><mrow 
><mo>[</mo><msub 
><mo>&#x2265;</mo> <mrow 
><mi>l</mi><mi>e</mi><mi>x</mi></mrow></msub 
><mo>]</mo></mrow></math>
<span 
class="cmti-10">and </span><!--l. 577--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
> <mo>=</mo> <mi>A</mi><mrow 
><mo>[</mo><msub 
><mo>&#x2264;</mo> <mrow 
><mi>l</mi><mi>e</mi><mi>x</mi></mrow></msub 
><mo>]</mo></mrow> <mo>&#x00D7;</mo> <mi>&#x03C9;</mi></math><span 
class="cmti-10">.</span>
&nbsp;<span 
class="cmti-10">Then </span><!--l. 577--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">has an open universal set parametrised by </span><!--l. 578--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi>  <mo>=</mo> <msup 
><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
><mo>)</mo></mrow><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">with </span><!--l. 579--><math 
xmlns="&mmlns;" mode="inline"><mi>n</mi><mi>w</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>&#x003E;</mo> <msub 
><mi>&#x2135;</mi><mrow 
><mn>0</mn></mrow></msub 
></math>
<span 
class="cmti-10">and </span><!--l. 579--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>
<span 
class="cmti-10">being hereditarily separable and hereditarily Lindel</span>&ouml;<span 
class="cmti-10">f.</span>
   </div>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Example</span>&nbsp;<span 
class="cmbx-10">14</span> </span><a 
  name="x1-1100414"></a>
<!--l. 584--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>b</mi> <mo>=</mo> <msub 
><mi>&#x2135;</mi><mrow 
><mn>1</mn></mrow></msub 
><mo>)</mo></mrow></math>
<!--586--><p class="indent">   <span 
class="cmti-10">(1) </span>&nbsp;<span 
class="cmti-10">Let </span><!--l. 586--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi> <mo>=</mo> <mi>A</mi><mrow 
><mo>[</mo><mo>&#x2265;</mo><mo>]</mo></mrow></math>
<span 
class="cmti-10">and </span><!--l. 586--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
> <mo>=</mo> <mi>A</mi><mrow 
><mo>[</mo><mo>&#x2264;</mo><mo>]</mo></mrow> <mo>&#x00D7;</mo> <mi>&#x03C9;</mi></math><span 
class="cmti-10">.</span>
&nbsp;<span 
class="cmti-10">Then </span><!--l. 587--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">has an open universal set parametrised by </span><!--l. 587--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi>  <mo>=</mo> <msup 
><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
><mo>)</mo></mrow><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">with </span><!--l. 588--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">being an </span><!--l. 588--><math 
xmlns="&mmlns;" mode="inline"><mi>L</mi></math><span 
class="cmti-10">-space</span>
<span 
class="cmti-10">and </span><!--l. 588--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>
<span 
class="cmti-10">a strong </span><!--l. 589--><math 
xmlns="&mmlns;" mode="inline"><mi>S</mi></math><span 
class="cmti-10">-space.</span>
</p><!--591--><p class="indent">   <span 
class="cmti-10">(2) </span>&nbsp;<span 
class="cmti-10">Let </span><!--l. 591--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi> <mo>=</mo> <mi>A</mi><mrow 
><mo>[</mo><mo>&#x2264;</mo><mo>]</mo></mrow></math>
<span 
class="cmti-10">and </span><!--l. 591--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
> <mo>=</mo> <mi>A</mi><mrow 
><mo>[</mo><mo>&#x2265;</mo><mo>]</mo></mrow> <mo>&#x00D7;</mo> <mi>&#x03C9;</mi></math><span 
class="cmti-10">.</span>
&nbsp;<span 
class="cmti-10">Then </span><!--l. 592--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">has an open universal set parametrised by </span><!--l. 593--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi>  <mo>=</mo> <msup 
><mn>2</mn><mrow 
><mi>&#x03C9;</mi></mrow></msup 
> <mo>&#x00D7;</mo> <msup 
><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
><mo>)</mo></mrow><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">with </span><!--l. 593--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">being an </span><!--l. 594--><math 
xmlns="&mmlns;" mode="inline"><mi>S</mi></math><span 
class="cmti-10">-space</span>
<span 
class="cmti-10">and </span><!--l. 594--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>
<span 
class="cmti-10">a strong </span><!--l. 594--><math 
xmlns="&mmlns;" mode="inline"><mi>L</mi></math><span 
class="cmti-10">-space.</span>
</p>
   </div>

   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Example</span>&nbsp;<span 
class="cmbx-10">15</span> </span><span 
class="cmti-10">Let </span><!--l. 598--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi> <mo>=</mo> <msup 
><mi>D</mi><mrow 
><mi>I</mi></mrow></msup 
><mrow 
><mo>[</mo><mo>&#x2265;</mo><mo>]</mo></mrow></math>
<span 
class="cmti-10">and </span><!--l. 598--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
> <mo>=</mo> <msup 
><mi>D</mi><mrow 
><mi>I</mi></mrow></msup 
><mrow 
><mo>[</mo><mo>&#x2264;</mo><mo>]</mo></mrow> <mo>&#x00D7;</mo> <mi>&#x03C9;</mi></math><span 
class="cmti-10">.</span>
&nbsp;<span 
class="cmti-10">Then </span><!--l. 599--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">has an open universal set parametrised by </span><!--l. 599--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi>  <mo>=</mo> <msup 
><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
><mo>)</mo></mrow><mrow 
><mi>&#x03C9;</mi></mrow></msup 
></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">with </span><!--l. 601--><math 
xmlns="&mmlns;" mode="inline"><mrow 
>
                     <mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>&#x003E;</mo> <mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>=</mo> <mo>|</mo><mi>D</mi><mo>|</mo> <mo>=</mo> <mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
><mo>)</mo></mrow> <mo>&#x003C;</mo> <mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>&#x2032;</mi></mrow></msup 
><mo>)</mo></mrow><mrow 
class="text"><mtext > .</mtext></mrow>
</mrow></math>
   </div>
   <h4 class="subsectionHead">2.2 <a 
  name="x1-120002.2"></a><a 
  name="QQ1-1-12"></a>Compact spaces</h4>
<!--609--><p class="noindent">We note that given <!--l. 609--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
is compact, we obtain in addition to theorem <a 
href="#x1-1100111">11</a>, the inequalities
<!--l. 610--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><mi>Y</mi> <mo>)</mo></mrow></math> and
<!--l. 611--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><mi>Y</mi> <mo>)</mo></mrow></math>.
</p>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Lemma</span>&nbsp;<span 
class="cmbx-10">16</span> </span><a 
  name="x1-1200116"></a><span 
class="cmti-10">Let </span><!--l. 614--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">be a compact set that has a closed universal set, </span><!--l. 614--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">parametrised by </span><!--l. 615--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math><span 
class="cmti-10">.</span>
&nbsp;<span 
class="cmti-10">Then</span>
<!--617--><p class="indent">   <span 
class="cmti-10">(1)                       </span>&nbsp;<span 
class="cmti-10">the                       set-valued                       map</span>
<!--l. 617--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03A6;</mi> <mo>:</mo> <mi>y</mi><mo>&#x2192;</mo><msup 
><mi>U</mi><mrow 
><mi>y</mi></mrow></msup 
></math>
<span 
class="cmti-10">defined                                                                                     on</span>
<!--l. 617--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>
<span 
class="cmti-10">is upper semi-continuous; and</span>
</p><!--620--><p class="indent">   <span 
class="cmti-10">(2) </span>&nbsp;<span 
class="cmti-10">if </span><!--l. 620--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mrow 
><mo>(</mo><mn>1</mn><mo>)</mo></mrow></mrow></msup 
> <mo>=</mo> <mrow 
><mo>{</mo><mi>y</mi> <mo>&#x2208;</mo> <mi>Y</mi>  <mo>:</mo> <mo>|</mo><mi>&#x03A6;</mi><mrow 
><mo>(</mo><mi>y</mi><mo>)</mo></mrow><mo>|</mo> <mo>=</mo> <mn>1</mn><mo>}</mo></mrow></math>
<span 
class="cmti-10">and </span><!--l. 621--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03C6;</mi> <mo>:</mo> <msup 
><mi>Y</mi> <mrow 
><mrow 
><mo>(</mo><mn>1</mn><mo>)</mo></mrow></mrow></msup 
> <mi>&#x2192;</mi> <mi>X</mi></math>
<span 
class="cmti-10">be the map that picks out the unique element of </span><!--l. 622--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03A6;</mi><mrow 
><mo>(</mo><mi>y</mi><mo>)</mo></mrow></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">then </span><!--l. 623--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03C6;</mi></math>
<span 
class="cmti-10">is a continuous map.</span>

</p>
   </div>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Corollary</span>&nbsp;<span 
class="cmbx-10">17</span> </span><a 
  name="x1-1200217"></a><span 
class="cmti-10">Let </span><!--l. 627--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">be a compact space that has an open universal set, </span><!--l. 627--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">parametrised by </span><!--l. 628--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math><span 
class="cmti-10">.</span>
<span 
class="cmti-10">Let </span><!--l. 628--><math 
xmlns="&mmlns;" mode="inline"><mi>P</mi></math>
<span 
class="cmti-10">be  any  hereditary  property  preserved  by  taking  continuous  images.  Then,  if</span>
<!--l. 629--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>Y</mi> <mrow 
><mi>n</mi></mrow></msup 
></math>
<span 
class="cmti-10">has </span><!--l. 629--><math 
xmlns="&mmlns;" mode="inline"><mi>P</mi></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">so does </span><!--l. 629--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mi>X</mi><mrow 
><mi>n</mi></mrow></msup 
></math><span 
class="cmti-10">.</span>
   </div>
<!--632--><p class="indent">   Hence, in the situation above <!--l. 632--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>n</mi></mrow></msup 
><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>d</mi><mrow 
><mo>(</mo><msup 
><mi>Y</mi> <mrow 
><mi>n</mi></mrow></msup 
><mo>)</mo></mrow></math>
and <!--l. 632--><math 
xmlns="&mmlns;" mode="inline"><mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>n</mi></mrow></msup 
><mo>)</mo></mrow> <mo>&#x2264;</mo> <mi>h</mi><mi>L</mi><mrow 
><mo>(</mo><msup 
><mi>X</mi><mrow 
><mi>n</mi></mrow></msup 
><mo>)</mo></mrow></math>. This
result, but not the existence of a continuous map, will be extended from open universal sets
to <!--l. 634--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>n</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal
sets <!--l. 635--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mn>0</mn> <mo>&#x003C;</mo> <mi>n</mi> <mo>&#x003C;</mo> <mi>&#x03C9;</mi><mo>)</mo></mrow></math>
in Theorem <a 
href="#x1-1500324">24</a>.
</p>
   <h3 class="sectionHead"> 3 <a 
  name="x1-130003"></a><a 
  name="QQ1-1-13"></a>Universal sets of finite Borel classes</h3>
<!--639--><p class="noindent">Let <!--l. 639--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
be a space. &nbsp;We now consider when such a space has a
<!--l. 639--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>n</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal set parametrised
by a second countable <!--l. 640--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>,
for <!--l. 640--><math 
xmlns="&mmlns;" mode="inline"><mn>1</mn> <mo>&#x003C;</mo> <mi>n</mi> <mo>&#x003C;</mo> <mi>&#x03C9;</mi></math>.
</p>
   <h4 class="subsectionHead">3.1 <a 
  name="x1-140003.1"></a><a 
  name="QQ1-1-14"></a>General spaces</h4>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Theorem</span>&nbsp;<span 
class="cmbx-10">18</span> </span><a 
  name="x1-1400118"></a><span 
class="cmti-10">For a topological space </span><!--l. 645--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">and </span><!--l. 645--><math 
xmlns="&mmlns;" mode="inline"><mi>n</mi> <mo>&#x2208;</mo> <mi>&#x03C9;</mi><mo>-</mo><mrow 
><mo>{</mo><mn>0</mn><mo>}</mo></mrow></math><span 
class="cmti-10">,</span>
<!--l. 646--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
<span 
class="cmti-10">has a </span><!--l. 646--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>n</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmti-10">-universal</span>
<span 
class="cmti-10">set parametrised by a space </span><!--l. 647--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>
<span 
class="cmti-10">of weight </span><!--l. 647--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03BA;</mi></math>
<span 
class="cmti-10">if and only if it has a coarser </span><!--l. 647--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>T</mi><mrow 
><mn>1</mn></mrow></msub 
></math><span 
class="cmti-10">-topology</span>
<span 
class="cmti-10">of weight no greater than </span><!--l. 648--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03BA;</mi></math>
<span 
class="cmti-10">with the same </span><!--l. 648--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>n</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math><span 
class="cmti-10">-sets.</span>

&nbsp;<span 
class="cmti-10">In particular, if </span><!--l. 649--><math 
xmlns="&mmlns;" mode="inline"><mi>w</mi><mrow 
><mo>(</mo><mi>Y</mi> <mo>)</mo></mrow> <mo>=</mo> <msub 
><mi>&#x2135;</mi><mrow 
><mn>0</mn></mrow></msub 
></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">then </span><!--l. 650--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03C8;</mi><mrow 
><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>=</mo> <msub 
><mi>&#x2135;</mi><mrow 
><mn>0</mn></mrow></msub 
></math><span 
class="cmti-10">.</span>
   </div>
<!--654--><p class="indent">   <span 
class="cmbx-10">Proof. </span>Suppose <!--l. 654--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>X</mi><mo>,</mo> <mi>&#x03C4;</mi><mo>)</mo></mrow></math>
has a coarser <!--l. 654--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>T</mi><mrow 
><mn>1</mn></mrow></msub 
></math>-topology
<!--l. 654--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03C5;</mi></math> of weight
<!--l. 655--><math 
xmlns="&mmlns;" mode="inline"><mi>w</mi><mrow 
><mo>(</mo><mi>&#x03C5;</mi><mo>)</mo></mrow></math> such that every
<!--l. 655--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03C4;</mi></math>-<!--l. 655--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>n</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-set
is an <!--l. 656--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03C5;</mi></math>-<!--l. 656--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>n</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-set.
&nbsp;By Lemma <a 
href="#x1-90038">8</a> and Proposition <a 
href="#x1-90016">6</a>, <!--l. 657--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>X</mi><mo>,</mo> <mi>&#x03C5;</mi><mo>)</mo></mrow></math>
has a <!--l. 657--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>n</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal set
parametrised by <!--l. 658--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mn>2</mn><mrow 
><mi>w</mi><mrow 
><mo>(</mo><mi>&#x03C5;</mi><mo>)</mo></mrow></mrow></msup 
></math>.
&nbsp;As <!--l. 659--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03C5;</mi> <mo>&#x2286;</mo> <mi>&#x03C4;</mi></math> and
<!--l. 659--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>n</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
><mrow 
><mo>(</mo><mi>&#x03C4;</mi><mo>)</mo></mrow> <mo>=</mo> <msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>n</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
><mrow 
><mo>(</mo><mi>&#x03C5;</mi><mo>)</mo></mrow></math>, we conclude that the
same set is a <!--l. 661--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>n</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal
set for <!--l. 661--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>(</mo><mi>X</mi><mo>,</mo> <mi>&#x03C4;</mi><mo>)</mo></mrow></math>
parametrised by <!--l. 662--><math 
xmlns="&mmlns;" mode="inline"><msup 
><mn>2</mn><mrow 
><mi>w</mi><mrow 
><mo>(</mo><mi>&#x03C5;</mi><mo>)</mo></mrow></mrow></msup 
></math>,
which has weight <!--l. 662--><math 
xmlns="&mmlns;" mode="inline"><mi>w</mi><mrow 
><mo>(</mo><mi>&#x03C5;</mi><mo>)</mo></mrow></math>.
</p><!--665--><p class="indent">   If <!--l. 665--><math 
xmlns="&mmlns;" mode="inline"><mi>n</mi></math> is odd and greater
than 1, then we consider <!--l. 665--><math 
xmlns="&mmlns;" mode="inline"><mi>U</mi></math>
as a <!--l. 665--><math 
xmlns="&mmlns;" mode="inline"><msubsup 
><mi>&#x03A3;</mi><mrow 
><mi>n</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
></math>-universal
set for <!--l. 666--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi></math>
parametrised by <!--l. 666--><math 
xmlns="&mmlns;" mode="inline"><mi>Y</mi> </math>,
which has base <!--l. 666--><math 
xmlns="&mmlns;" mode="inline"><mi>B</mi></math>
of size <!--l. 667--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03BA;</mi></math>.
&nbsp;The case <!--l. 667--><math 
xmlns="&mmlns;" mode="inline"><mi>n</mi> <mo>=</mo> <mn>1</mn></math>
has already be proved in Theorem <a 
href="#x1-1100111">11</a>(1). &nbsp;There exists a countable collection of open sets,
<!--l. 669--><math 
xmlns="&mmlns;" mode="inline"><mrow 
><mo>{</mo><msub 
><mi>U</mi><mrow 
><mi>f</mi> </mrow></msub 
> <mo>:</mo> <mi>f</mi> <mo>&#x2208;</mo> <msup 
><mi>&#x03C9;</mi><mrow 
><mi>n</mi></mrow></msup 
><mo>}</mo></mrow></math>, of the
space <!--l. 669--><math 
xmlns="&mmlns;" mode="inline"><mi>X</mi> <mo>&#x00D7;</mo> <mi>Y</mi> </math>
such that

</p><!--l. 670--><math 
xmlns="&mmlns;" mode="display">
<mrow><mtable 
class="equation"><mtr><mtd>
<mrow><mtable equalrows='false' equalcolumns='false'><mtr><mtd 
class="array"><mi>U</mi> <mo>=</mo><msub 
> <mo>&cup;</mo>
    <mrow 
><msub 
><mi>m</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>&#x2208;</mo><mi>&#x03C9;</mi></mrow></msub 
><msub 
><mi>U</mi><mrow 
><mrow 
><mo>(</mo><msub 
><mi>m</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>)</mo></mrow></mrow></msub 
><mrow 
class="text"><mtext > ,</mtext></mrow>                                                          </mtd>
</mtr><mtr><mtd 
class="array"><msub 
><mi>U</mi><mrow 
><mrow 
><mo>(</mo><msub 
><mi>m</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>)</mo></mrow></mrow></msub 
> <mo>=</mo><msub 
> <mo>&cap;</mo>
    <mrow 
><msub 
><mi>m</mi><mrow 
><mn>1</mn></mrow></msub 
><mo>&#x2208;</mo><mi>&#x03C9;</mi></mrow></msub 
><msub 
><mi>U</mi><mrow 
><mrow 
><mo>(</mo><msub 
><mi>m</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>,</mo><msub 
><mi>m</mi><mrow 
><mn>1</mn></mrow></msub 
><mo>)</mo></mrow></mrow></msub 
><mrow 
class="text"><mtext > , for </mtext></mrow><msub 
><mi>m</mi><mrow 
><mn>0</mn></mrow></msub 
> <mo>&#x2208;</mo> <mi>&#x03C9;</mi><mrow 
class="text"><mtext > ,</mtext></mrow>                               </mtd>
</mtr><mtr><mtd 
class="array"><msub 
><mi>U</mi><mrow 
><mrow 
><mo>(</mo><msub 
><mi>m</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>,</mo><msub 
><mi>m</mi><mrow 
><mn>1</mn></mrow></msub 
><mo>)</mo></mrow></mrow></msub 
> <mo>=</mo><msub 
> <mo>&cup;</mo>
    <mrow 
><msub 
><mi>m</mi><mrow 
><mn>2</mn></mrow></msub 
><mo>&#x2208;</mo><mi>&#x03C9;</mi></mrow></msub 
><msub 
><mi>U</mi><mrow 
><mrow 
><mo>(</mo><msub 
><mi>m</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>,</mo><msub 
><mi>m</mi><mrow 
><mn>1</mn></mrow></msub 
><mo>,</mo><msub 
><mi>m</mi><mrow 
><mn>2</mn></mrow></msub 
><mo>)</mo></mrow></mrow></msub 
><mrow 
class="text"><mtext > , for </mtext></mrow><msub 
><mi>m</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>,</mo> <msub 
><mi>m</mi><mrow 
><mn>1</mn></mrow></msub 
> <mo>&#x2208;</mo> <mi>&#x03C9;</mi><mrow 
class="text"><mtext > ,</mtext></mrow>                  </mtd>
</mtr><mtr><mtd 
class="array"><mo>.</mo>                                                                                    </mtd>
</mtr><mtr><mtd 
class="array"><msub 
><mi>U</mi><mrow 
><mrow 
><mo>(</mo><msub 
><mi>m</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>,</mo><mo>&#x2026;</mo><mo>,</mo><msub 
><mi>m</mi><mrow 
><mi>n</mi><mo>&#x2212;</mo><mn>2</mn></mrow></msub 
><mo>)</mo></mrow></mrow></msub 
> <mo>=</mo><msub 
> <mo>&cap;</mo>
    <mrow 
><msub 
><mi>m</mi><mrow 
><mi>n</mi><mo>&#x2212;</mo><mn>1</mn></mrow></msub 
><mo>&#x2208;</mo><mi>&#x03C9;</mi></mrow></msub 
><msub 
><mi>U</mi><mrow 
><mrow 
><mo>(</mo><msub 
><mi>m</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>,</mo><mo>&#x2026;</mo><mo>,</mo><msub 
><mi>m</mi><mrow 
><mi>n</mi><mo>&#x2212;</mo><mn>2</mn></mrow></msub 
><mo>,</mo><msub 
><mi>m</mi><mrow 
><mi>n</mi><mo>&#x2212;</mo><mn>1</mn></mrow></msub 
><mo>)</mo></mrow></mrow></msub 
><mrow 
class="text"><mtext > , for </mtext></mrow><msub 
><mi>m</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>,</mo> <mo>&#x2026;</mo><mo>,</mo> <msub 
><mi>m</mi><mrow 
><mi>n</mi><mo>&#x2212;</mo><mn>2</mn></mrow></msub 
> <mo>&#x2208;</mo> <mi>&#x03C9;</mi><mrow 
class="text"><mtext > .</mtext></mrow></mtd></mtr></mtable></mrow></mtd><mtd><mspace 
   id="x1-14002r0"  class="label" width="0" /><mspace class="endlabel" />             </mtd></mtr></mtable></mrow>
</math>
<!--684--><p class="nopar">(0)
Define for each <!--l. 685--><math 
xmlns="&mmlns;" mode="inline"><mi>B</mi> <mo>&#x2208;</mo> <mi>B</mi></math>
and <!--l. 685--><math 
xmlns="&mmlns;" mode="inline"><mi>f</mi> <mo>&#x2208;</mo> <msup 
><mi>&#x03C9;</mi><mrow 
><mi>n</mi></mrow></msup 
></math> the open
sets, <!--l. 686--><math 
xmlns="&mmlns;" mode="inline"><mrow 
>
           <msub 
><mi>V</mi> <mrow 
><mi>f</mi> </mrow></msub 
><mrow 
><mo>(</mo><mi>B</mi><mo>)</mo></mrow> <mo>=</mo> <msub 
><mi>&#x03C0;</mi><mrow 
><mi>X</mi></mrow></msub 
><mrow 
><mo>(</mo><mo>&cup;</mo>
   <mrow 
><mo>{</mo><mi>V</mi> <mo>&#x00D7;</mo> <mi>B</mi> <mo>:</mo> <mi>V</mi> <mo>&#x00D7;</mo> <mi>B</mi> <mo>&#x2286;</mo> <msub 
><mi>U</mi><mrow 
><mi>f</mi> </mrow></msub 
><mrow 
class="text"><mtext >   and </mtext></mrow><mi>V</mi> <mrow 
class="text"><mtext >  is open in </mtext></mrow><mi>X</mi><mo>}</mo></mrow><mo>)</mo></mrow>
</mrow></math> and
<!--l. 690--><math 
xmlns="&mmlns;" mode="inline"><mi>C</mi></math> the collection (of
size <!--l. 690--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03BA;</mi></math>) of all the finite
intersections of them. &nbsp;Then <!--l. 691--><math 
xmlns="&mmlns;" mode="inline"><mi>C</mi></math>
is a <!--l. 691--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>T</mi><mrow 
><mn>1</mn></mrow></msub 
></math>-point separating
family of <!--l. 692--><math 
xmlns="&mmlns;" mode="inline"><mi>&#x03C4;</mi></math>-open sets.
&nbsp;Let <!--l. 692--><math 
xmlns="&mmlns;" mode="inline"><msub 
><mi>x</mi><mrow 
><mn>1</mn></mrow></msub 
> <mo>&ne;</mo> <msub 
><mi>x</mi><mrow 
><mn>2</mn></