<?xml version="1.0"?> 
<?xml-stylesheet href="mathml.css" type="text/css"?> 
<?xml-stylesheet type="text/css" href="lattices.css"?> 
<!DOCTYPE html SYSTEM "mathml.dtd"
[ <!ENTITY lang "&lt;">
  <!ENTITY rang "&gt;">
  <!ENTITY isin "&Element;">
  <!ENTITY ldquo "`">
  <!ENTITY rdquo "'">
]> 
 <html  
xmlns:math="http://www.w3.org/1998/Math/MathML" 
xmlns="http://www.w3.org/TR/REC-html40"  
><head><!--lattices.xml from lattices.tex (TeX4ht, 2000-03-03 19:34:00)--> 

   <title>All finite distributive lattices occur as intervals between Hausdorff topologies</title><meta  
http-equiv="Content-Type" content="text/html; charset=iso-8859-1"  /><link 
rel="stylesheet" type="text/css" 
href="lattices.css" /></head> <body 
>
<div align="center" class="maketitle">

<h2 class="titleHead">All finite distributive lattices occur as intervals
between Hausdorff topologies</h2>
<div class="author" align="center"><span 
class="cmr-12">R. W. Knight, P. Gartside and D. W. McIntyre</span></div>
<br />
<div class="date" align="center"><span 
class="cmr-12">October 1997</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>
     <!--74--><p class="noindent"><span 
class="cmr-9">It is shown that a finite lattice </span><!--l. 74--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>L</mi></math>
     <span 
class="cmr-9">is isomorphic to the interval between two Hausdorff topologies on some set</span>
     <span 
class="cmr-9">if and only if </span><!--l. 75--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>L</mi></math>
     <span 
class="cmr-9">is distributive. The corresponding results had previously been shown in</span>
     <span 
class="cmr-9">ZFC for intervals between </span><!--l. 77--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
><mn>1</mn></mrow></msub 
></math>
     <span 
class="cmr-9">topologies and, assuming the existence of infinitely many measurable cardinals,</span>
     <span 
class="cmr-9">for intervals between </span><!--l. 78--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
><mn>3</mn></mrow></msub 
></math>
     <span 
class="cmr-9">topologies.</span>
</p>
</td></tr></table></div>
   <h3 class="sectionHead"> 1 <a 
  name="x1-10001"></a><a 
  name="QQ1-1-1"></a>Introduction</h3>
<!--87--><p class="noindent">The collection <!--l. 87--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&Sigma;</mi><mrow><mo>(</mo><mi>X</mi><mo>)</mo></mrow></math> of all
topologies on a given set <!--l. 87--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math>
forms a lattice under inclusion, in which the meet of two topologies is their
intersection, while the join is the topology with their union as a sub-basis. This
lattice has been an object of study since it was first defined by Birkhoff [<a 
href="#XB">1</a>]: see the
survey article by Larsen and Andima, [<a 
href="#XLA">4</a>], for more details.
</p><!--94--><p class="indent">   In this paper we are concerned with the local structure of this lattice.
Specifically, we are looking at the problem of determining the finite lattices

<!--l. 96--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>L</mi></math> such that there
exist some set <!--l. 97--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math>
and some <!--l. 97--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&sigma;</mi><mo>,</mo> <mi>&tau;</mi> <mo>&isin;</mo> <mi>&Sigma;</mi><mrow><mo>(</mo><mi>X</mi><mo>)</mo></mrow></math>
(perhaps with some specific separation properties) such that the interval
<!--l. 99--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow>
                   <mrow><mo>[</mo><mi>&sigma;</mi><mo>,</mo> <mi>&tau;</mi><mo>]</mo></mrow> <mo>=</mo> <mrow><mo>{</mo> <mi>&mu;</mi> <mo>&isin;</mo> <mi>&Sigma;</mi><mrow><mo>(</mo><mi>X</mi><mo>)</mo></mrow> <mo>|</mo> <mi>&sigma;</mi> <mi>&#x2254;</mi> <mi>&mu;</mi> <mi>&#x2254;</mi> <mi>&tau;</mi> <mo>}</mo></mrow>
</mrow></math> is isomorphic
to <!--l. 102--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>L</mi></math>.
</p><!--104--><p class="indent">   This problem was solved for <!--l. 104--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
><mn>1</mn></mrow></msub 
></math>
topologies <!--l. 104--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&sigma;</mi></math>
and <!--l. 104--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&tau;</mi></math>
by Valent and Larson and Rosick&#x00FD;: Valent and Larson [<a 
href="#XVL">7</a>] proved that
any finite distributive lattice can be realized as an interval between
<!--l. 106--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
>
<mn>1</mn></mrow></msub 
></math>
topologies, and Rosick&#x00FD; [<a 
href="#XRos">5</a>] proved that any finite interval between
<!--l. 108--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
>
<mn>1</mn></mrow></msub 
></math>
topologies must be distributive. Hence a finite lattice can be realized as such an
interval if and only if it is distributive.
</p><!--111--><p class="indent">   Of course, Rosick&#x00FD;'s result implies that every finite interval between Hausdorff topologies
must be distributive. In this paper we will show that the converse is true. This result has
already been shown by Good, McIntyre and Watson in [<a 
href="#XGMW">3</a>]&mdash;indeed, the topologies
<!--l. 115--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&sigma;</mi></math> and
<!--l. 115--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&tau;</mi></math> can be assumed
to be <!--l. 115--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
><mn>3</mn></mrow></msub 
></math>&mdash;under
the assumption of the existence of infinitely many measurable cardinals. In this paper
we will make no set-theoretic assumptions beyond ZFC.
</p>
   <h3 class="sectionHead"> 2 <a 
  name="x1-20002"></a><a 
  name="QQ1-1-2"></a>Notation, terminology and basic results</h3>
<!--120--><p class="noindent">For <!--l. 120--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>P</mi></math> a partially ordered set, let
<!--l. 120--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>O</mi><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math> denote the set of down-closed
subsets of <!--l. 121--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>P</mi></math>, partially
ordered by inclusion. For <!--l. 121--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>L</mi></math>
a finite lattice let <!--l. 122--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>J</mi><mrow><mo>(</mo><mi>L</mi><mo>)</mo></mrow></math>

denote the set of join-irreducible elements (i.e.&nbsp;elements
<!--l. 123--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>a</mi></math> such that
<!--l. 123--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>a</mi></math> is not the least element
of the lattice and, if <!--l. 124--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>a</mi> <mo>=</mo> <mi>b</mi> <mo>&or;</mo> <mi>c</mi></math>
then <!--l. 124--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>a</mi> <mo>=</mo> <mi>b</mi></math> or
<!--l. 124--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>a</mi> <mo>=</mo> <mi>c</mi></math>). Recall that a finite
lattice <!--l. 125--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>L</mi></math> is distributive
if and only if <!--l. 125--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>L</mi><mo>&cong;</mo><mi>O</mi><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math> for
some <!--l. 126--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>P</mi></math>, which happens
if and only if <!--l. 126--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>L</mi><mo>&cong;</mo><mi>O</mi><mrow><mo>(</mo><mi>J</mi><mrow><mo>(</mo><mi>L</mi><mo>)</mo></mrow><mo>)</mo></mrow></math>.
</p><!--128--><p class="indent">   If <!--l. 128--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>F</mi></math> is a family of subsets
of a set <!--l. 128--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math> with the finite
intersection property, let <!--l. 129--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><mrow><mo>&lang;</mo><mi>F</mi><mo>&rang;</mo></mrow><mo>&rang;</mo></mrow></math>
denote the filter on <!--l. 129--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math>
which has <!--l. 130--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>F</mi></math> as a filter
subbasis. We will say that <!--l. 130--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>A</mi></math>
is <span 
class="cmti-10">compatible </span>with <!--l. 131--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>F</mi></math>
if <!--l. 131--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>F</mi> <mo>&cup;</mo> <mrow><mo>{</mo><mi>A</mi><mo>}</mo></mrow></math> has
the finite intersection property.
</p><!--134--><p class="indent">   Let <!--l. 134--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>u</mi></math>
denote the least cardinal of a filter subbasis for a free ultrafilter on
<!--l. 135--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&omega;</mi></math>. It is easy to show that
<!--l. 135--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&omega;</mi> <mo>&lt;</mo> <mi>u</mi> <mi>&#x2254;</mi> <mi>c</mi></math>. For more details, and
relationships between <!--l. 136--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>u</mi></math>
and other small cardinals, see [<a 
href="#XV">6</a>]
</p><!--139--><p class="indent">   If <!--l. 139--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>p</mi></math> and
<!--l. 139--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>q</mi></math> are ultrafilters
on sets <!--l. 139--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>A</mi></math> and
<!--l. 139--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>B</mi></math> respectively,
let <!--l. 140--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>p</mi> <mo>&middot;</mo> <mi>q</mi></math> denote the
ultrafilter <!--l. 141--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow>
                           <mrow><mo>{</mo> <mi>S</mi> <mo>&sube;</mo> <mi>A</mi> <mo>&times;</mo> <mi>B</mi> <mo>|</mo> <mrow><mo>{</mo> <mi>a</mi> <mo>&isin;</mo> <mi>A</mi> <mo>|</mo> <msub 
><mi>S</mi><mrow 
><mi>a</mi></mrow></msub 
> <mo>&isin;</mo> <mi>q</mi> <mo>}</mo></mrow> <mo>&isin;</mo> <mi>p</mi> <mo>}</mo></mrow><mo>,</mo>
</mrow></math> where
<!--l. 144--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>S</mi><mrow 
><mi>a</mi></mrow></msub 
> <mo>=</mo> <mrow><mo>{</mo> <mi>b</mi> <mo>&isin;</mo> <mi>B</mi> <mo>|</mo> <mrow><mo>&lang;</mo><mi>a</mi><mo>,</mo> <mi>b</mi><mo>&rang;</mo></mrow> <mo>&isin;</mo> <mi>S</mi> <mo>}</mo></mrow></math>. We define
ultrafilters <!--l. 145--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msup 
><mi>p</mi><mrow><mi>n</mi></mrow></msup 
></math>

on <!--l. 145--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msup 
><mi>A</mi><mrow><mi>n</mi></mrow></msup 
></math> for
<!--l. 145--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>n</mi> <mi>&#x2265;</mi> <mn>1</mn></math> by
<!--l. 145--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msup 
><mi>p</mi><mrow><mn>1</mn></mrow></msup 
> <mo>=</mo> <mi>p</mi></math>,
<!--l. 145--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msup 
><mi>p</mi><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msup 
> <mo>=</mo> <msup 
><mi>p</mi><mrow><mi>n</mi></mrow></msup 
> <mo>&middot;</mo> <mi>p</mi></math>. Note that this product
is associative: if <!--l. 146--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>p</mi></math>,
<!--l. 146--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>q</mi></math> and
<!--l. 146--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>r</mi></math> are ultrafilters,
then <!--l. 147--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>p</mi> <mo>&middot;</mo> <mrow><mo>(</mo><mi>q</mi> <mo>&middot;</mo> <mi>r</mi><mo>)</mo></mrow> <mo>=</mo> <mrow><mo>(</mo><mi>p</mi> <mo>&middot;</mo> <mi>q</mi><mo>)</mo></mrow> <mo>&middot;</mo> <mi>r</mi></math>.
</p><!--149--><p class="indent">   If <!--l. 149--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math> is a topological
space, then an <span 
class="cmti-10">o-filter </span>on <!--l. 149--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math>
is a filter in the partial order of non-empty open sets of
<!--l. 150--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math>, and
an <span 
class="cmti-10">o-ultrafilter </span>is a maximal o-filter.
</p><!--153--><p class="indent">   For <!--l. 153--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&mu;</mi></math> a
topology on <!--l. 153--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math>
and <!--l. 153--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>p</mi> <mo>&isin;</mo> <mi>X</mi></math>, let
<!--l. 153--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>N</mi><mrow 
><mi>&mu;</mi></mrow></msub 
><mrow><mo>(</mo><mi>p</mi><mo>)</mo></mrow></math> denote the
neighbourhood filter at <!--l. 154--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>p</mi></math>
in the topology <!--l. 154--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&mu;</mi></math>, and let
<!--l. 155--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msubsup 
><mi>N</mi><mrow><mi>&mu;</mi></mrow><mrow 
><mi>o</mi></mrow></msubsup 
><mrow><mo>(</mo><mi>p</mi><mo>)</mo></mrow></math> denote the o-filter of
open neighbourhoods of <!--l. 155--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>p</mi></math>
in the topology <!--l. 156--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&mu;</mi></math>
(in other words, <!--l. 156--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msubsup 
><mi>N</mi><mrow><mi>&mu;</mi></mrow><mrow 
><mi>o</mi></mrow></msubsup 
><mrow><mo>(</mo><mi>p</mi><mo>)</mo></mrow> <mo>=</mo> <msub 
><mi>N</mi><mrow 
><mi>&mu;</mi></mrow></msub 
><mrow><mo>(</mo><mi>p</mi><mo>)</mo></mrow> <mo>&cap;</mo> <mi>&mu;</mi></math>).
For
</p><!--160--><p class="indent">   <!--l. 160--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>F</mi></math> a
filter on <!--l. 160--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math>
and <!--l. 160--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>A</mi> <mo>&sube;</mo> <mi>X</mi></math>, let
<!--l. 160--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>F</mi> <mi>&#x21BE;</mi> <mi>A</mi></math> be the
trace of <!--l. 161--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>F</mi></math> on
<!--l. 161--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>A</mi></math>, in other words the
family <!--l. 161--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo> <mi>F</mi> <mo>&cap;</mo> <mi>A</mi> <mo>|</mo> <mi>F</mi> <mo>&isin;</mo> <mi>F</mi> <mo>}</mo></mrow></math>. Notice that
<!--l. 162--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>N</mi><mrow 
><mi>&mu;</mi></mrow></msub 
><mrow><mo>(</mo><mi>p</mi><mo>)</mo></mrow> <mi>&#x21BE;</mi> <mi>A</mi></math> is a proper filter
(i.e.&nbsp;does not contain <!--l. 163--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&#x2205;</mi></math>)
if and only if <!--l. 163--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>p</mi> <mo>&isin;</mo> <mrow class="overline"><mi>A</mi></mrow><mi>&mu;</mi></math>,
and similarly for <!--l. 164--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msubsup 
><mi>N</mi><mrow><mi>&mu;</mi></mrow><mrow 
><mi>o</mi></mrow></msubsup 
><mrow><mo>(</mo><mi>p</mi><mo>)</mo></mrow> <mi>&#x21BE;</mi> <mi>A</mi></math>.
</p><!--166--><p class="indent">   If <!--l. 166--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&sigma;</mi></math> is a
topology on <!--l. 166--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math>
and <!--l. 166--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>A</mi> <mo>&sube;</mo> <mi>X</mi></math>, let
<!--l. 166--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><mi>&sigma;</mi><mo>,</mo> <mi>A</mi><mo>&rang;</mo></mrow></math> denote the
topology which has <!--l. 167--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&sigma;</mi> <mo>&cup;</mo> <mrow><mo>{</mo><mi>A</mi><mo>}</mo></mrow></math>
as a subbasis.
</p><!--169--><p class="indent">   Good, McIntyre and Watson proved the following result in [<a 
href="#XGMW">3</a>]:
</p>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Lemma</span>&nbsp;<span 
class="cmbx-10">1</span> </span><a 
  name="x1-20011"></a> <span 
class="cmti-10">Let </span><!--l. 174--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>P</mi></math>

<span 
class="cmti-10">be a finite partially ordered set. Suppose we can find a set</span>
<!--l. 175--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math> <span 
class="cmti-10">of the form</span>
<!--l. 175--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi> <mo>=</mo> <mrow><mo>{</mo><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>}</mo></mrow> <mo>&cup;</mo><msub 
> <mo>&cup;</mo>
    <mrow 
><mi>a</mi><mo>&isin;</mo><mi>P</mi> </mrow></msub 
><msub 
><mi>X</mi><mrow 
><mi>a</mi></mrow></msub 
></math><span 
class="cmti-10">, where the sets</span>
<!--l. 176--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>X</mi><mrow 
><mi>a</mi></mrow></msub 
></math> <span 
class="cmti-10">are disjoint, non-empty</span>
<span 
class="cmti-10">and do not contain </span><!--l. 176--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">and a topology </span><!--l. 177--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&sigma;</mi></math>
<span 
class="cmti-10">on </span><!--l. 177--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math>
<span 
class="cmti-10">such that</span>
     <ol type="1" class="enumerate1" 
>
     <li class="enumerate"><a 
  name="x1-2003x1"></a><span 
class="cmti-10">For each </span><!--l. 179--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>a</mi> <mo>&isin;</mo> <mi>P</mi></math><span 
class="cmti-10">,</span>
     <!--l. 179--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow class="overline"><msub 
><mi>X</mi><mrow 
><mi>a</mi></mrow></msub 
></mrow><mi>&sigma;</mi>  <mo>=</mo> <mrow><mo>{</mo><msub 
><mi>x</mi><mrow 
>
<mn>0</mn></mrow></msub 
><mo>}</mo></mrow> <mo>&cup;</mo><msub 
> <mo>&cup;</mo>
    <mrow 
><mi>b</mi><mi>&#x2254;</mi><mi>a</mi></mrow></msub 
><msub 
><mi>X</mi><mrow 
><mi>b</mi></mrow></msub 
></math><span 
class="cmti-10">.</span>
     </li>
     <li class="enumerate"><a 
  name="x1-2005x2"></a><span 
class="cmti-10">For each </span><!--l. 181--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>a</mi> <mo>&isin;</mo> <mi>P</mi></math><span 
class="cmti-10">,</span>
     <!--l. 181--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msubsup 
><mi>N</mi><mrow><mi>&sigma;</mi></mrow><mrow 
><mi>o</mi></mrow></msubsup 
><mrow><mo>(</mo><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>)</mo></mrow> <mi>&#x21BE;</mi> <msub 
><mi>X</mi><mrow 
><mi>a</mi></mrow></msub 
></math>
     <span 
class="cmti-10">is an o-ultrafilter on </span><!--l. 182--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>X</mi><mrow 
><mi>a</mi></mrow></msub 
></math><span 
class="cmti-10">.</span></li></ol>
<!--183--><p class="noindent"><span 
class="cmti-10">Let </span><!--l. 183--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&tau;</mi> <mo>=</mo> <mrow><mo>&lang;</mo><mi>&sigma;</mi><mo>,</mo> <mrow><mo>{</mo><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>}</mo></mrow><mo>&rang;</mo></mrow></math><span 
class="cmti-10">.</span>
<span 
class="cmti-10">Then </span><!--l. 183--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>[</mo><mi>&sigma;</mi><mo>,</mo> <mi>&tau;</mi><mo>]</mo></mrow><mo>&cong;</mo><mi>O</mi><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math><span 
class="cmti-10">.</span>
</p><!--185--><p class="indent">   <span 
class="cmti-10">Conversely, if </span><!--l. 185--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>O</mi><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math> <span 
class="cmti-10">can be</span>
<span 
class="cmti-10">realized as an interval between </span><!--l. 185--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
><mn>1</mn></mrow></msub 
></math>
<span 
class="cmti-10">(resp. </span><!--l. 186--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
><mn>2</mn></mrow></msub 
></math><span 
class="cmti-10">,</span>
<!--l. 186--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
>
<mn>3</mn></mrow></msub 
></math><span 
class="cmti-10">) topologies, then it</span>
<span 
class="cmti-10">can be realized by a set </span><!--l. 186--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math>
<span 
class="cmti-10">and </span><!--l. 187--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
><mn>1</mn></mrow></msub 
></math>
<span 
class="cmti-10">(resp. </span><!--l. 187--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
><mn>2</mn></mrow></msub 
></math><span 
class="cmti-10">,</span>
<!--l. 187--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
>
<mn>3</mn></mrow></msub 
></math><span 
class="cmti-10">) topologies</span>
<!--l. 187--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&sigma;</mi></math> <span 
class="cmti-10">and</span>
<!--l. 187--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&tau;</mi></math> <span 
class="cmti-10">of</span>
<span 
class="cmti-10">this form.</span>
</p>
   </div>
<!--190--><p class="indent">   Suppose that <!--l. 190--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>P</mi></math> is a finite
partially ordered set, and <!--l. 190--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>Q</mi> <mo>&sube;</mo> <mi>P</mi></math>.
Let <!--l. 191--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi> <mo>=</mo> <mrow><mo>{</mo><mi>p</mi><mo>}</mo></mrow> <mo>&cup;</mo><msub 
> <mo>&cup;</mo>
    <mrow 
><mi>a</mi><mo>&isin;</mo><mi>P</mi> </mrow></msub 
><msub 
><mi>S</mi><mrow 
><mi>a</mi></mrow></msub 
></math> and
<!--l. 191--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&sigma;</mi><mo>,</mo> <mi>&tau;</mi></math> be as above.
Put <!--l. 192--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>Y</mi>  <mo>=</mo> <mrow><mo>{</mo><mi>p</mi><mo>}</mo></mrow> <mo>&cup;</mo><msub 
> <mo>&cup;</mo>
    <mrow 
><mi>a</mi><mo>&isin;</mo><mi>Q</mi></mrow></msub 
><msub 
><mi>S</mi><mrow 
><mi>a</mi></mrow></msub 
></math>.
Then <!--l. 192--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow class="overline"><msub 
><mi>S</mi><mrow 
><mi>a</mi></mrow></msub 
></mrow><mi>&sigma;</mi><mi>&#x21BE;</mi><mi>Y</mi>  <mo>=</mo> <mrow class="overline"><msub 
><mi>S</mi><mrow 
>
<mi>a</mi></mrow></msub 
></mrow><mi>&sigma;</mi> <mo>&cap;</mo> <mi>Y</mi> </math>
and <!--l. 193--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msubsup 
><mi>N</mi><mrow><mi>&sigma;</mi> <mi>&#x21BE;</mi> <mi>Y</mi> </mrow><mrow 
><mi>o</mi></mrow></msubsup 
><mrow><mo>(</mo><mi>p</mi><mo>)</mo></mrow> <mi>&#x21BE;</mi> <msub 
><mi>S</mi><mrow 
><mi>a</mi></mrow></msub 
> <mo>=</mo> <msubsup 
><mi>N</mi><mrow><mi>&sigma;</mi></mrow><mrow 
><mi>o</mi></mrow></msubsup 
><mrow><mo>(</mo><mi>p</mi><mo>)</mo></mrow></math> for
<!--l. 194--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>a</mi> <mo>&isin;</mo> <mi>Q</mi></math>. Thus
<!--l. 194--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>(</mo><mi>Y</mi><mo>,</mo> <mi>&sigma;</mi> <mi>&#x21BE;</mi> <mi>Y</mi> <mo>)</mo></mrow></math> has the form required by
Lemma&nbsp;<a 
href="#x1-20011">1</a> to ensure that <!--l. 195--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>[</mo><mi>&sigma;</mi> <mi>&#x21BE;</mi> <mi>Y</mi><mo>,</mo> <mi>&tau;</mi> <mi>&#x21BE;</mi> <mi>Y</mi> <mo>]</mo></mrow><mo>&cong;</mo><mi>O</mi><mrow><mo>(</mo><mi>Q</mi><mo>)</mo></mrow></math>.
</p><!--198--><p class="indent">   Thus, to show that <!--l. 198--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>O</mi><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math>
can be realized, it is enough to show that
<!--l. 199--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>O</mi><mrow><mo>(</mo><mi>P</mi><mi>&prime;</mi><mo>)</mo></mrow></math> can be realized for
some <!--l. 199--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>P</mi><mi>&prime;</mi></math> containing

<!--l. 199--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>P</mi></math>. We will show in the next
section that, for every <!--l. 200--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>n</mi> <mo>&isin;</mo> <mi>&omega;</mi></math>,
<!--l. 200--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>O</mi><mrow><mo>(</mo><msup 
><mn>2</mn><mrow><mi>n</mi></mrow></msup 
><mo>)</mo></mrow></math> can be realized as
an interval between <!--l. 201--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
><mn>2</mn></mrow></msub 
></math>
topologies.
</p>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Definition</span>&nbsp;<span 
class="cmbx-10">1</span> </span><span 
class="cmti-10">A </span>nice basis <span 
class="cmti-10">for an ultrafilter </span><!--l. 203--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>p</mi></math>
<span 
class="cmti-10">is a sequence </span><!--l. 204--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
> <mo>|</mo> <mi>&alpha;</mi> <mo>&isin;</mo> <mi>&kappa;</mi><mo>&rang;</mo></mrow></math>
<span 
class="cmti-10">such that </span><!--l. 204--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo> <msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
> <mo>|</mo> <mi>&alpha;</mi> <mo>&isin;</mo> <mi>&kappa;</mi> <mo>}</mo></mrow></math>
<span 
class="cmti-10">is a filter basis for </span><!--l. 205--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>p</mi></math>
<span 
class="cmti-10">and, for every </span><!--l. 205--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&alpha;</mi> <mo>&isin;</mo> <mi>&kappa;</mi></math><span 
class="cmti-10">,</span>
<!--l. 206--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
><mo>&notin;</mo><mrow><mo>&lang;</mo><mrow><mo>&lang;</mo><mrow><mo>{</mo> <msub 
><mi>B</mi><mrow 
><mi>&beta;</mi></mrow></msub 
> <mo>|</mo> <mi>&beta;</mi> <mo>&lt;</mo> <mi>&alpha;</mi> <mo>}</mo></mrow><mo>&rang;</mo></mrow><mo>&rang;</mo></mrow></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-20072"></a> <span 
class="cmti-10">There exists an ultrafilter </span><!--l. 211--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>p</mi></math>
<span 
class="cmti-10">on </span><!--l. 211--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&omega;</mi></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">a nice basis </span><!--l. 212--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
> <mo>|</mo> <mi>&alpha;</mi> <mo>&isin;</mo> <mi>u</mi><mo>&rang;</mo></mrow></math>
<span 
class="cmti-10">for </span><!--l. 212--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>p</mi></math><span 
class="cmti-10">,</span>
<span 
class="cmti-10">and sets </span><!--l. 212--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>S</mi><mrow 
><mi>&alpha;</mi><mo>,</mo><mi>n</mi></mrow></msub 
></math>
<span 
class="cmti-10">for </span><!--l. 212--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&alpha;</mi> <mo>&isin;</mo> <mi>u</mi></math><span 
class="cmti-10">,</span>
<!--l. 213--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>n</mi> <mo>&isin;</mo> <mi>&omega;</mi></math>
<span 
class="cmti-10">such that for each </span><!--l. 213--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&alpha;</mi> <mo>&isin;</mo> <mi>u</mi></math><span 
class="cmti-10">,</span>
<!--l. 213--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo> <msub 
><mi>S</mi><mrow 
><mi>&alpha;</mi><mo>,</mo><mi>n</mi></mrow></msub 
> <mo>|</mo> <mi>n</mi> <mo>&isin;</mo> <mi>&omega;</mi> <mo>}</mo></mrow></math>
<span 
class="cmti-10">is a disjoint family of subsets of </span><!--l. 214--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&omega;</mi> <mo>\</mo> <msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
></math>
<span 
class="cmti-10">and </span><!--l. 215--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo> <msub 
><mi>B</mi><mrow 
><mi>&beta;</mi></mrow></msub 
> <mo>|</mo> <mi>&beta;</mi> <mo>&lt;</mo> <mi>&alpha;</mi> <mo>}</mo></mrow> <mo>&cup;</mo> <mrow><mo>{</mo><msub 
><mi>S</mi><mrow 
><mi>&alpha;</mi><mo>,</mo><mi>n</mi></mrow></msub 
><mo>}</mo></mrow></math>
<span 
class="cmti-10">has the finite intersection property for every </span><!--l. 216--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>n</mi> <mo>&isin;</mo> <mi>&omega;</mi></math><span 
class="cmti-10">.</span>
   </div>
<span 
class="cmbx-10">Proof. </span>Let <!--l. 219--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><msub 
><mi>C</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
> <mo>|</mo> <mi>&alpha;</mi> <mo>&isin;</mo> <mi>u</mi><mo>&rang;</mo></mrow></math> be a basis
for a free ultrafilter <!--l. 219--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>p</mi></math> on
<!--l. 220--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&omega;</mi></math> of minimal cardinality.

Let <!--l. 221--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow>
                             <mi>I</mi> <mo>=</mo> <mrow><mo>{</mo> <mi>&alpha;</mi> <mo>&isin;</mo> <mi>u</mi> <mo>|</mo> <msub 
><mi>C</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
><mo>&notin;</mo><mrow><mo>&lang;</mo><mrow><mo>&lang;</mo><mrow><mo>{</mo> <msub 
><mi>C</mi><mrow 
><mi>&beta;</mi></mrow></msub 
> <mo>|</mo> <mi>&beta;</mi> <mo>&lt;</mo> <mi>&alpha;</mi> <mo>}</mo></mrow><mo>&rang;</mo></mrow><mo>&rang;</mo></mrow> <mo>}</mo></mrow><mo>.</mo>
</mrow></math> One can easily
show that <!--l. 224--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><msub 
><mi>C</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
> <mo>|</mo> <mi>&alpha;</mi> <mo>&isin;</mo> <mi>I</mi><mo>&rang;</mo></mrow></math> forms
a nice basis for <!--l. 225--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>p</mi></math>, so
<!--l. 225--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>I</mi></math> has cardinality (and
hence order-type) <!--l. 225--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>u</mi></math>.
Relabel the elements without changing their order as
<!--l. 226--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
> <mo>|</mo> <mi>&alpha;</mi> <mo>&isin;</mo> <mi>u</mi><mo>&rang;</mo></mrow></math>.
<!--228--><p class="indent">   Now, for each <!--l. 228--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&alpha;</mi> <mo>&isin;</mo> <mi>u</mi></math>,
<!--l. 228--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
><mo>&notin;</mo><mrow><mo>&lang;</mo><mrow><mo>&lang;</mo><mrow><mo>{</mo> <msub 
><mi>B</mi><mrow 
><mi>&beta;</mi></mrow></msub 
> <mo>|</mo> <mi>&beta;</mi> <mo>&lt;</mo> <mi>&alpha;</mi> <mo>}</mo></mrow><mo>&rang;</mo></mrow><mo>&rang;</mo></mrow></math>, so
<!--l. 229--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&omega;</mi> <mo>\</mo> <msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
></math> is compatible
with <!--l. 229--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo> <msub 
><mi>B</mi><mrow 
><mi>&beta;</mi></mrow></msub 
> <mo>|</mo> <mi>&beta;</mi> <mo>&lt;</mo> <mi>&alpha;</mi> <mo>}</mo></mrow></math>.
However, <!--l. 230--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo> <msub 
><mi>B</mi><mrow 
><mi>&beta;</mi></mrow></msub 
> <mo>|</mo> <mi>&beta;</mi> <mo>&lt;</mo> <mi>&alpha;</mi> <mo>}</mo></mrow> <mo>&cup;</mo> <mrow><mo>{</mo><mi>&omega;</mi> <mo>\</mo> <msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
><mo>}</mo></mrow></math>
is too small to be an ultrafilter subbasis, so there exist disjoint sets
<!--l. 231--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>A</mi><mrow 
><mn>0</mn></mrow></msub 
></math> and
<!--l. 232--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>B</mi><mrow 
><mn>0</mn></mrow></msub 
></math> which are
compatible with <!--l. 232--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo> <msub 
><mi>B</mi><mrow 
><mi>&beta;</mi></mrow></msub 
> <mo>|</mo> <mi>&beta;</mi> <mo>&lt;</mo> <mi>&alpha;</mi> <mo>}</mo></mrow> <mo>&cup;</mo> <mrow><mo>{</mo><mi>&omega;</mi> <mo>\</mo> <msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
><mo>}</mo></mrow></math>.
Put <!--l. 233--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>S</mi><mrow 
><mi>&alpha;</mi><mo>,</mo><mn>0</mn></mrow></msub 
> <mo>=</mo> <mrow><mo>(</mo><mi>&omega;</mi> <mo>\</mo> <msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
><mo>)</mo></mrow> <mo>&cap;</mo> <msub 
><mi>A</mi><mrow 
><mn>0</mn></mrow></msub 
></math>.
Since <!--l. 234--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo> <msub 
><mi>B</mi><mrow 
><mi>&beta;</mi></mrow></msub 
> <mo>|</mo> <mi>&beta;</mi> <mo>&lt;</mo> <mi>&alpha;</mi> <mo>}</mo></mrow> <mo>&cup;</mo> <mrow><mo>{</mo><mi>&omega;</mi> <mo>\</mo> <msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
><mo>,</mo> <msub 
><mi>B</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>}</mo></mrow></math>
is too small to be an ultrafilter subbasis, there exist disjoint sets
<!--l. 235--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>A</mi><mrow 
><mn>1</mn></mrow></msub 
></math> and
<!--l. 235--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>B</mi><mrow 
><mn>1</mn></mrow></msub 
></math> which are
compatible with <!--l. 236--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo> <msub 
><mi>B</mi><mrow 
><mi>&beta;</mi></mrow></msub 
> <mo>|</mo> <mi>&beta;</mi> <mo>&lt;</mo> <mi>&alpha;</mi> <mo>}</mo></mrow> <mo>&cup;</mo> <mrow><mo>{</mo><mi>&omega;</mi> <mo>\</mo> <msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
><mo>,</mo> <msub 
><mi>B</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>}</mo></mrow></math>.
Put <!--l. 237--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>S</mi><mrow 
><mi>&alpha;</mi><mo>,</mo><mn>1</mn></mrow></msub 
> <mo>=</mo> <mrow><mo>(</mo><mi>&omega;</mi> <mo>\</mo> <msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
><mo>)</mo></mrow> <mo>&cap;</mo> <msub 
><mi>B</mi><mrow 
><mn>0</mn></mrow></msub 
> <mo>&cap;</mo> <msub 
><mi>A</mi><mrow 
><mn>1</mn></mrow></msub 
></math>.
Continuing in this way we construct a sequence
<!--l. 238--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><msub 
><mi>S</mi><mrow 
><mi>&alpha;</mi><mo>,</mo><mi>n</mi></mrow></msub 
> <mo>|</mo> <mi>n</mi> <mo>&isin;</mo> <mi>&omega;</mi><mo>&rang;</mo></mrow></math> of disjoint subsets
of <!--l. 239--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&omega;</mi> <mo>\</mo> <msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
></math>, each of which is
compatible with <!--l. 240--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo> <msub 
><mi>B</mi><mrow 
><mi>&beta;</mi></mrow></msub 
> <mo>|</mo> <mi>&beta;</mi> <mo>&lt;</mo> <mi>&alpha;</mi> <mo>}</mo></mrow></math>,
as required. &nbsp;_
</p>
   <h3 class="sectionHead"> 3 <a 
  name="x1-30003"></a><a 
  name="QQ1-1-3"></a>The main result</h3>

<!--244--><p class="noindent">Throughout this section, <!--l. 244--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>A</mi></math> will
denote some fixed finite set, and <!--l. 245--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>P</mi> <mo>=</mo> <mi>&#x2119;</mi><mi>A</mi></math>,
ordered by reverse inclusion. We will construct sets and ultrafilters as in Lemma&nbsp;<a 
href="#x1-20011">1</a> to show that
<!--l. 246--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>O</mi><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math> can be realized as
an interval between <!--l. 247--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
><mn>2</mn></mrow></msub 
></math>
topologies.
</p><!--249--><p class="indent">   For each <!--l. 249--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>a</mi> <mo>&isin;</mo> <mi>P</mi></math>,
let <!--l. 249--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>X</mi><mrow 
><mi>a</mi></mrow></msub 
> <mo>=</mo> <msup 
><mi>u</mi><mrow><mo>|</mo><mi>a</mi><mo>|</mo></mrow></msup 
> <mo>&times;</mo> <mi>&omega;</mi> <mo>&times;</mo> <mrow><mo>{</mo><mi>a</mi><mo>}</mo></mrow></math>.
Let <!--l. 249--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>p</mi></math>,
<!--l. 250--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
> <mo>|</mo> <mi>&alpha;</mi> <mo>&lt;</mo> <mi>u</mi><mo>&rang;</mo></mrow></math> and
<!--l. 250--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo> <msub 
><mi>S</mi><mrow 
><mi>&alpha;</mi><mo>,</mo><mi>n</mi></mrow></msub 
> <mo>|</mo> <mi>&alpha;</mi> <mo>&isin;</mo> <mi>u</mi><mo>,</mo> <mi>n</mi> <mo>&isin;</mo> <mi>&omega;</mi> <mo>}</mo></mrow></math> be as in Lemma&nbsp;<a 
href="#x1-20072">2</a>.
Let <!--l. 251--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>f</mi> <mo>:</mo> <mi>&omega;</mi> <mo>&times;</mo> <mi>P</mi> <mo>&rarr;</mo> <mi>&omega;</mi></math> be a bijection.
For each <!--l. 252--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&alpha;</mi> <mo>&isin;</mo> <mi>u</mi></math>,
<!--l. 252--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>n</mi> <mo>&isin;</mo> <mi>&omega;</mi></math> and
<!--l. 252--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>a</mi> <mo>&isin;</mo> <mi>P</mi></math> let
<!--l. 252--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>S</mi><mrow 
><mi>&alpha;</mi><mo>,</mo><mi>n</mi><mo>,</mo><mi>a</mi></mrow></msub 
><mi>&prime;</mi> <mo>=</mo> <msub 
><mi>S</mi><mrow 
><mi>&alpha;</mi><mo>,</mo><mi>f</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>a</mi><mo>)</mo></mrow></mrow></msub 
></math> and let
<!--l. 253--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>q</mi><mrow 
><mi>&alpha;</mi><mo>,</mo><mi>n</mi><mo>,</mo><mi>a</mi></mrow></msub 
></math> be a free ultrafilter
extending <!--l. 254--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><mrow><mo>&lang;</mo><mrow><mo>{</mo><msub 
><mi>B</mi><mrow 
><mi>&beta;</mi></mrow></msub 
> <mo>|</mo> <mi>&beta;</mi> <mo>&lt;</mo> <mi>&alpha;</mi> <mo>}</mo></mrow> <mo>&cup;</mo> <mrow><mo>{</mo><msub 
><mi>S</mi><mrow 
><mi>&alpha;</mi><mo>,</mo><mi>n</mi><mo>,</mo><mi>a</mi></mrow></msub 
><mi>&prime;</mi><mo>}</mo></mrow><mo>&rang;</mo></mrow><mo>&rang;</mo></mrow></math>. Let
<!--l. 254--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>r</mi></math> be a uniform ultrafilter
on <!--l. 255--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>u</mi></math> (in other words, an
ultrafilter extending the co-<!--l. 256--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mo>&lt;</mo> <mi>u</mi></math>
filter on <!--l. 256--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>u</mi></math>). Let
<!--l. 256--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
></math> be some point which
is not an element of <!--l. 257--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mo>&cup;</mo>
   <mrow 
><mi>a</mi><mo>&isin;</mo><mi>P</mi> </mrow></msub 
><msub 
><mi>X</mi><mrow 
><mi>a</mi></mrow></msub 
></math>.
For <!--l. 257--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>n</mi> <mo>&isin;</mo> <mi>&omega;</mi></math> and
<!--l. 257--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>s</mi> <mo>&isin;</mo> <msup 
><mi>u</mi><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msup 
></math>, let
<!--l. 258--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>l</mi><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow> <mo>=</mo> <mi>s</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></math> (the &ldquo;last&rdquo; element
of the sequence <!--l. 258--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>s</mi></math>),
and let <!--l. 259--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><munderover 
accent='true'><mrow><mi>s</mi></mrow><mrow 
> </mrow><mrow><mo>&#x0304;</mo></mrow></munderover> <mo>=</mo> <mi>s</mi> <mo>\</mo> <mrow><mo>{</mo><mrow><mo>&lang;</mo><mi>n</mi><mo>,</mo> <mi>l</mi><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>&rang;</mo></mrow><mo>}</mo></mrow></math>.
For <!--l. 259--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>a</mi> <mo>&isin;</mo> <mi>P</mi> <mo>\</mo> <mrow><mo>{</mo><mi>&#x2205;</mi><mo>}</mo></mrow></math> let
<!--l. 260--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>c</mi><mrow><mo>(</mo><mi>a</mi><mo>)</mo></mrow> <mo>=</mo> <mrow><mo>{</mo> <mi>a</mi> <mo>\</mo> <mrow><mo>{</mo><mi>x</mi><mo>}</mo></mrow> <mo>|</mo> <mi>x</mi> <mo>&isin;</mo> <mi>a</mi> <mo>}</mo></mrow></math> be the set of
covers of <!--l. 260--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>a</mi></math>
in <!--l. 261--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>P</mi></math>.
</p><!--263--><p class="indent">   We will specify a topology <!--l. 263--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&sigma;</mi></math>
on <!--l. 263--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi> <mo>=</mo> <mrow><mo>{</mo><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>}</mo></mrow> <mo>&cup;</mo><msub 
> <mo>&cup;</mo>
    <mrow 
><mi>a</mi><mo>&isin;</mo><mi>P</mi> </mrow></msub 
><msub 
><mi>X</mi><mrow 
><mi>a</mi></mrow></msub 
></math>
by specifying a weak neighbourhood system for
<!--l. 264--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&sigma;</mi></math>, in other words
a collection <!--l. 265--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>B</mi><mrow><mo>(</mo><mi>x</mi><mo>)</mo></mrow></math>
of subsets of <!--l. 265--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math>
containing <!--l. 265--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>x</mi></math> for
each <!--l. 265--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>x</mi> <mo>&isin;</mo> <mi>X</mi></math>, such that
a subset <!--l. 266--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>U</mi></math> of
<!--l. 266--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math> is open if and
only if for every <!--l. 266--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>x</mi> <mo>&isin;</mo> <mi>U</mi></math>
there is some <!--l. 267--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>B</mi> <mo>&isin;</mo> <mi>B</mi><mrow><mo>(</mo><mi>x</mi><mo>)</mo></mrow></math>
with <!--l. 267--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>B</mi> <mo>&sube;</mo> <mi>U</mi></math>.

</p><!--269--><p class="indent">   For <!--l. 269--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>x</mi> <mo>=</mo> <mrow><mo>&lang;</mo><mi>&#x2205;</mi><mo>,</mo> <mi>n</mi><mo>,</mo> <mi>&#x2205;</mi><mo>&rang;</mo></mrow> <mo>&isin;</mo> <msub 
><mi>X</mi><mrow 
><mi>&#x2205;</mi></mrow></msub 
></math>,
let <!--l. 269--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>B</mi><mrow><mo>(</mo><mi>x</mi><mo>)</mo></mrow> <mo>=</mo> <mrow><mo>{</mo><mrow><mo>{</mo><mi>x</mi><mo>}</mo></mrow><mo>}</mo></mrow></math>.
</p><!--271--><p class="indent">   For <!--l. 271--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>x</mi> <mo>=</mo> <mrow><mo>&lang;</mo><mi>s</mi><mo>,</mo> <mi>n</mi><mo>,</mo> <mi>a</mi><mo>&rang;</mo></mrow> <mo>&isin;</mo> <msub 
><mi>X</mi><mrow 
><mi>a</mi></mrow></msub 
></math>
(where <!--l. 271--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>a</mi> <mo>&isin;</mo> <mi>P</mi> <mo>\</mo> <mrow><mo>{</mo><mi>&#x2205;</mi><mo>}</mo></mrow></math>),
let <!--l. 272--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>B</mi><mrow><mo>(</mo><mi>x</mi><mo>)</mo></mrow> <mo>=</mo> <mrow><mo>{</mo> <mi>N</mi><mrow><mo>(</mo><mi>x</mi><mo>,</mo> <mi>S</mi><mo>)</mo></mrow> <mo>|</mo> <mi>S</mi> <mo>&isin;</mo> <msub 
><mi>q</mi><mrow 
><mi>l</mi><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>,</mo><mi>n</mi><mo>,</mo><mi>a</mi></mrow></msub 
> <mo>}</mo></mrow></math>,
where <!--l. 273--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow>
                      <mi>N</mi><mrow><mo>(</mo><mi>x</mi><mo>,</mo> <mi>S</mi><mo>)</mo></mrow> <mo>=</mo> <mrow><mo>{</mo><mi>x</mi><mo>}</mo></mrow> <mo>&cup;</mo> <mrow><mo>{</mo> <mrow><mo>&lang;</mo><munderover 
accent='true'><mrow><mi>s</mi></mrow><mrow 
> </mrow><mrow><mo>&#x0304;</mo></mrow></munderover><mo>,</mo> <mi>m</mi><mo>,</mo> <mi>b</mi><mo>&rang;</mo></mrow> <mo>|</mo> <mi>m</mi> <mo>&isin;</mo> <mi>S</mi><mo>,</mo> <mi>b</mi> <mo>&isin;</mo> <mi>c</mi><mrow><mo>(</mo><mi>a</mi><mo>)</mo></mrow> <mo>}</mo></mrow><mo>.</mo>
</mrow></math>
</p><!--277--><p class="indent">   Finally, let <!--l. 277--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>B</mi><mrow><mo>(</mo><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>)</mo></mrow> <mo>=</mo> <mrow><mo>{</mo> <mi>N</mi><mrow><mo>(</mo><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>,</mo> <mi>S</mi><mo>)</mo></mrow> <mo>|</mo> <mi>S</mi> <mo>&isin;</mo> <msup 
><mi>r</mi><mrow><mo>|</mo><mi>A</mi><mo>|</mo></mrow></msup 
> <mo>&middot;</mo> <mi>p</mi> <mo>}</mo></mrow></math>,
where <!--l. 278--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow>
                        <mi>N</mi><mrow><mo>(</mo><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>,</mo> <mi>S</mi><mo>)</mo></mrow> <mo>=</mo> <mrow><mo>{</mo><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>}</mo></mrow> <mo>&cup;</mo> <mrow><mo>{</mo> <mrow><mo>&lang;</mo><mi>s</mi><mo>,</mo> <mi>n</mi><mo>,</mo> <mi>A</mi><mo>&rang;</mo></mrow> <mo>|</mo> <mrow><mo>&lang;</mo><mi>s</mi><mo>,</mo> <mi>n</mi><mo>&rang;</mo></mrow> <mo>&isin;</mo> <mi>S</mi> <mo>}</mo></mrow><mo>.</mo>
</mrow></math>
</p><!--282--><p class="indent">   It is easy to see that all the families
<!--l. 282--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>B</mi><mrow><mo>(</mo><mi>x</mi><mo>)</mo></mrow></math> are closed under
finite intersections, so <!--l. 283--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo> <mi>B</mi><mrow><mo>(</mo><mi>x</mi><mo>)</mo></mrow> <mo>|</mo> <mi>x</mi> <mo>&isin;</mo> <mi>X</mi> <mo>}</mo></mrow></math>
forms a weak neighbourhood system for a topology
<!--l. 284--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&sigma;</mi></math> on
<!--l. 284--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math>. It is also clear
that for each <!--l. 285--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>a</mi> <mo>&isin;</mo> <mi>P</mi></math>,
<!--l. 285--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow class="overline"><msub 
><mi>X</mi><mrow 
><mi>a</mi></mrow></msub 
></mrow><mi>&sigma;</mi> <mo>=</mo> <mrow><mo>{</mo><msub 
><mi>x</mi><mrow 
>
<mn>0</mn></mrow></msub 
><mo>}</mo></mrow> <mo>&cup;</mo><msub 
> <mo>&cup;</mo>
    <mrow 
><mi>b</mi><mi>&#x2254;</mi><mi>a</mi></mrow></msub 
><msub 
><mi>X</mi><mrow 
><mi>b</mi></mrow></msub 
></math>.
</p>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Lemma</span>&nbsp;<span 
class="cmbx-10">3</span> </span><!--l. 288--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&sigma;</mi></math>
<span 
class="cmti-10">is a </span><!--l. 288--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
><mn>2</mn></mrow></msub 
></math>

<span 
class="cmti-10">topology on </span><!--l. 288--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math><span 
class="cmti-10">.</span>
   </div>
<span 
class="cmbx-10">Proof. </span>For <!--l. 291--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>x</mi> <mo>=</mo> <mrow><mo>&lang;</mo><mi>s</mi><mo>,</mo> <mi>n</mi><mo>,</mo> <mi>a</mi><mo>&rang;</mo></mrow> <mo>&isin;</mo> <msub 
><mi>X</mi><mrow 
><mi>a</mi></mrow></msub 
></math>,
let <!--l. 291--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>U</mi><mrow 
><mi>x</mi></mrow></msub 
> <mo>=</mo> <mrow><mo>{</mo><mi>x</mi><mo>}</mo></mrow> <mo>&cup;</mo> <mrow><mo>{</mo> <mrow><mo>&lang;</mo><mi>s</mi> <mi>&#x21BE;</mi> <mo>|</mo><mi>b</mi><mo>|</mo><mo>,</mo> <mi>m</mi><mo>,</mo> <mi>b</mi><mo>&rang;</mo></mrow> <mo>|</mo> <mi>m</mi> <mo>&isin;</mo> <mi>&omega;</mi><mo>,</mo> <mi>a</mi> <mo>&lt;</mo> <mi>b</mi> <mo>}</mo></mrow></math>. Then
<!--l. 292--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>U</mi><mrow 
><mi>x</mi></mrow></msub 
></math> is an open set
containing <!--l. 292--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>x</mi></math>,
and if <!--l. 293--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>y</mi> <mo>&isin;</mo> <msub 
><mi>U</mi><mrow 
><mi>x</mi></mrow></msub 
></math>
then <!--l. 293--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>U</mi><mrow 
><mi>y</mi></mrow></msub 
> <mo>&sube;</mo> <msub 
><mi>U</mi><mrow 
><mi>x</mi></mrow></msub 
></math>.
<!--295--><p class="indent">   For each <!--l. 295--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>s</mi> <mo>&isin;</mo> <msup 
><mi>u</mi><mrow><mi>n</mi></mrow></msup 
></math>
(where <!--l. 295--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>n</mi> <mi>&#x2254;</mi> <mo>|</mo><mi>A</mi><mo>|</mo></math>),
let <!--l. 295--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>Y</mi> <mrow 
><mi>s</mi></mrow></msub 
> <mo>=</mo> <mrow><mo>{</mo><mi>s</mi><mo>}</mo></mrow> <mo>&times;</mo> <mi>&omega;</mi> <mo>&times;</mo> <msub 
><mi>P</mi><mrow 
><mi>n</mi></mrow></msub 
></math>, where
<!--l. 296--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>P</mi><mrow 
><mi>n</mi></mrow></msub 
> <mo>=</mo> <mrow><mo>{</mo> <mi>a</mi> <mo>&isin;</mo> <mi>P</mi> <mo>|</mo> <mo>|</mo><mi>a</mi><mo>|</mo> <mo>=</mo> <mi>n</mi> <mo>}</mo></mrow></math>. We will prove by
induction on <!--l. 297--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>n</mi></math> that
<!--l. 297--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>Y</mi> <mrow 
><mi>s</mi></mrow></msub 
></math> can be covered by a
disjoint family <!--l. 297--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo> <msub 
><mi>V</mi> <mrow 
><mi>x</mi></mrow></msub 
> <mo>|</mo> <mi>x</mi> <mo>&isin;</mo> <msub 
><mi>Y</mi> <mrow 
><mi>s</mi></mrow></msub 
> <mo>}</mo></mrow></math> of open
sets such that <!--l. 298--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>x</mi> <mo>&isin;</mo> <msub 
><mi>V</mi> <mrow 
><mi>x</mi></mrow></msub 
> <mo>&sube;</mo> <msub 
><mi>U</mi><mrow 
><mi>x</mi></mrow></msub 
></math>. The base
step is trivial, since <!--l. 299--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>Y</mi> <mrow 
><mi>&#x2205;</mi></mrow></msub 
> <mo>=</mo> <msub 
><mi>X</mi><mrow 
><mi>&#x2205;</mi></mrow></msub 
></math>
contains only isolated points. So suppose the result holds for all
<!--l. 300--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>s</mi><mi>&prime;</mi> <mo>&isin;</mo> <msup 
><mi>u</mi><mrow><mi>n</mi></mrow></msup 
></math>, and
that <!--l. 301--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>s</mi> <mo>&isin;</mo> <msup 
><mi>u</mi><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msup 
></math>. For
each <!--l. 301--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>x</mi> <mo>=</mo> <mrow><mo>&lang;</mo><mi>s</mi><mo>,</mo> <mi>n</mi><mo>,</mo> <mi>a</mi><mo>&rang;</mo></mrow> <mo>&isin;</mo> <msub 
><mi>Y</mi> <mrow 
><mi>s</mi></mrow></msub 
></math>
let <!--l. 302--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow>
                   <msub 
><mi>V</mi> <mrow 
><mi>x</mi></mrow></msub 
> <mo>=</mo> <mrow><mo>{</mo><mi>x</mi><mo>}</mo></mrow> <mo>&cup;</mo> <mo>&cup;</mo>
    <mrow><mo>{</mo> <msub 
><mi>V</mi> <mrow 
><mrow><mo>&lang;</mo><munderover 
accent='true'><mrow><mi>s</mi></mrow><mrow 
> </mrow><mrow><mo>&#x0304;</mo></mrow></munderover><mo>,</mo><mi>m</mi><mo>,</mo><mi>b</mi><mo>&rang;</mo></mrow></mrow></msub 
> <mo>|</mo> <mi>m</mi> <mo>&isin;</mo> <msub 
><mi>S</mi><mrow 
><mi>l</mi><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>,</mo><mi>n</mi><mo>,</mo><mi>a</mi></mrow></msub 
><mi>&prime;</mi><mo>,</mo> <mi>b</mi> <mo>&isin;</mo> <mi>c</mi><mrow><mo>(</mo><mi>a</mi><mo>)</mo></mrow> <mo>}</mo></mrow><mo>.</mo>
</mrow></math>
Then <!--l. 306--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>x</mi> <mo>&isin;</mo> <msub 
><mi>V</mi> <mrow 
><mi>x</mi></mrow></msub 
> <mo>&sube;</mo> <msub 
><mi>U</mi><mrow 
><mi>x</mi></mrow></msub 
></math>,
and <!--l. 306--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>V</mi> <mrow 
><mi>x</mi></mrow></msub 
></math>
is open. It remains only to show that these sets are disjoint. So let
<!--l. 307--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>x</mi> <mo>=</mo> <mrow><mo>&lang;</mo><mi>s</mi><mo>,</mo> <mi>l</mi><mo>,</mo> <mi>a</mi><mo>&rang;</mo></mrow></math> and
<!--l. 308--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>y</mi> <mo>=</mo> <mrow><mo>&lang;</mo><mi>s</mi><mo>,</mo> <mi>m</mi><mo>,</mo> <mi>b</mi><mo>&rang;</mo></mrow></math> be distinct
elements of <!--l. 308--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>Y</mi> <mrow 
><mi>s</mi></mrow></msub 
></math>, and
suppose that <!--l. 309--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>z</mi> <mo>=</mo> <mrow><mo>&lang;</mo><mi>t</mi><mo>,</mo> <mi>k</mi><mo>,</mo> <mi>c</mi><mo>&rang;</mo></mrow> <mo>&isin;</mo> <msub 
><mi>V</mi> <mrow 
><mi>x</mi></mrow></msub 
> <mo>&cap;</mo> <msub 
><mi>V</mi> <mrow 
><mi>y</mi></mrow></msub 
></math>. Then
we must have <!--l. 309--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>z</mi><mo>&ne;</mo><mi>x</mi></math>
and <!--l. 309--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>z</mi><mo>&ne;</mo><mi>y</mi></math>, so
for some <!--l. 310--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>i</mi> <mo>&isin;</mo> <msub 
><mi>S</mi><mrow 
><mi>l</mi><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>,</mo><mi>l</mi><mo>,</mo><mi>a</mi></mrow></msub 
><mi>&prime;</mi></math>
and some <!--l. 310--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>d</mi> <mo>&isin;</mo> <mi>c</mi><mrow><mo>(</mo><mi>a</mi><mo>)</mo></mrow></math>,

<!--l. 310--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>z</mi> <mo>&isin;</mo> <msub 
><mi>V</mi> <mrow 
><mrow><mo>&lang;</mo><munderover 
accent='true'><mrow><mi>s</mi></mrow><mrow 
> </mrow><mrow><mo>&#x0304;</mo></mrow></munderover><mo>,</mo><mi>i</mi><mo>,</mo><mi>d</mi><mo>&rang;</mo></mrow></mrow></msub 
></math> and similarly
for some <!--l. 311--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>j</mi> <mo>&isin;</mo> <msub 
><mi>S</mi><mrow 
><mi>l</mi><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>,</mo><mi>m</mi><mo>,</mo><mi>b</mi></mrow></msub 
></math>
and some <!--l. 312--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>e</mi> <mo>&isin;</mo> <mi>c</mi><mrow><mo>(</mo><mi>b</mi><mo>)</mo></mrow></math>,
<!--l. 312--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>z</mi> <mo>&isin;</mo> <msub 
><mi>V</mi> <mrow 
><mrow><mo>&lang;</mo><munderover 
accent='true'><mrow><mi>s</mi></mrow><mrow 
> </mrow><mrow><mo>&#x0304;</mo></mrow></munderover><mo>,</mo><mi>j</mi><mo>,</mo><mi>e</mi><mo>&rang;</mo></mrow></mrow></msub 
></math>. By inductive hypothesis,
then, we must have <!--l. 313--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><munderover 
accent='true'><mrow><mi>s</mi></mrow><mrow 
> </mrow><mrow><mo>&#x0304;</mo></mrow></munderover><mo>,</mo> <mi>i</mi><mo>,</mo> <mi>d</mi><mo>&rang;</mo></mrow> <mo>=</mo> <mrow><mo>&lang;</mo><munderover 
accent='true'><mrow><mi>s</mi></mrow><mrow 
> </mrow><mrow><mo>&#x0304;</mo></mrow></munderover><mo>,</mo> <mi>j</mi><mo>,</mo> <mi>e</mi><mo>&rang;</mo></mrow></math>,
so <!--l. 313--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>i</mi> <mo>&isin;</mo> <msub 
><mi>S</mi><mrow 
><mi>l</mi><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>,</mo><mi>l</mi><mo>,</mo><mi>a</mi></mrow></msub 
><mi>&prime;</mi> <mo>&cap;</mo> <msub 
><mi>S</mi><mrow 
><mi>l</mi><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>,</mo><mi>m</mi><mo>,</mo><mi>b</mi></mrow></msub 
><mi>&prime;</mi></math>. But these sets
are disjoint, unless <!--l. 315--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><mi>l</mi><mo>,</mo> <mi>a</mi><mo>&rang;</mo></mrow> <mo>=</mo> <mrow><mo>&lang;</mo><mi>m</mi><mo>,</mo> <mi>b</mi><mo>&rang;</mo></mrow></math>,
in which case <!--l. 315--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>x</mi> <mo>=</mo> <mi>y</mi></math>,
a contradiction.
</p><!--317--><p class="indent">   Now let <!--l. 317--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>x</mi> <mo>=</mo> <mrow><mo>&lang;</mo><mi>s</mi><mo>,</mo> <mi>m</mi><mo>,</mo> <mi>a</mi><mo>&rang;</mo></mrow></math> and
<!--l. 317--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>y</mi> <mo>=</mo> <mrow><mo>&lang;</mo><mi>t</mi><mo>,</mo> <mi>n</mi><mo>,</mo> <mi>b</mi><mo>&rang;</mo></mrow></math> be distinct elements
of <!--l. 318--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi> <mo>\</mo> <mrow><mo>{</mo><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>}</mo></mrow></math>. Without loss of
generality we assume that <!--l. 319--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mo>|</mo><mi>a</mi><mo>|</mo> <mi>&#x2254;</mi> <mo>|</mo><mi>b</mi><mo>|</mo></math>.
We will consider separately two cases, depending on whether or not
<!--l. 320--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>s</mi> <mo>=</mo> <mi>t</mi> <mi>&#x21BE;</mi> <mo>|</mo><mi>a</mi><mo>|</mo></math>.
     </p><dl class="description"><dt class="description">
<span 
class="cmbx-10">Case 1</span> </dt><dd 
class="description"><!--l. 322--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>s</mi> <mo>=</mo> <mi>t</mi> <mi>&#x21BE;</mi> <mo>|</mo><mi>a</mi><mo>|</mo></math>.
     Let <!--l. 322--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>W</mi><mrow 
><mn>1</mn></mrow></msub 
> <mo>=</mo><msub 
> <mo>&cup;</mo>
    <mrow 
><mi>z</mi><mo>&isin;</mo><msub 
><mi>Y</mi> <mrow 
><mi>s</mi></mrow></msub 
><mo>\</mo><mrow><mo>{</mo><mi>x</mi><mo>}</mo></mrow></mrow></msub 
><msub 
><mi>V</mi> <mrow 
><mi>x</mi></mrow></msub 
></math>,
     <!--l. 323--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>W</mi><mrow 
><mn>2</mn></mrow></msub 
> <mo>=</mo> <mrow><mo>{</mo> <mrow><mo>&lang;</mo><mi>t</mi> <mi>&#x21BE;</mi> <mo>|</mo><mi>c</mi><mo>|</mo><mo>,</mo> <mi>l</mi><mo>,</mo> <mi>c</mi><mo>&rang;</mo></mrow> <mo>|</mo> <mi>l</mi> <mo>&isin;</mo> <mi>&omega;</mi><mo>,</mo> <mo>|</mo><mi>a</mi><mo>|</mo> <mo>&lt;</mo> <mo>|</mo><mi>c</mi><mo>|</mo> <mi>&#x2254;</mi> <mo>|</mo><mi>b</mi><mo>|</mo> <mo>}</mo></mrow></math>,
     and <!--l. 324--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>W</mi> <mo>=</mo> <msub 
><mi>W</mi><mrow 
><mn>1</mn></mrow></msub 
> <mo>&cup;</mo> <msub 
><mi>W</mi><mrow 
><mn>2</mn></mrow></msub 
></math>.
     Notice that if <!--l. 324--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><mi>u</mi><mo>,</mo> <mi>l</mi><mo>,</mo> <mi>c</mi><mo>&rang;</mo></mrow> <mo>&isin;</mo> <msub 
><mi>W</mi><mrow 
><mn>2</mn></mrow></msub 
></math>
     with <!--l. 325--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mo>|</mo><mi>c</mi><mo>|</mo> <mo>&gt;</mo> <mo>|</mo><mi>a</mi><mo>|</mo> <mo>+</mo> <mn>1</mn></math>
     then <!--l. 325--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo><munderover 
accent='true'><mrow><mi>u</mi></mrow><mrow 
> </mrow><mrow><mo>&#x0304;</mo></mrow></munderover><mo>}</mo></mrow> <mo>&times;</mo> <mi>&omega;</mi> <mo>&times;</mo> <mi>c</mi><mrow><mo>(</mo><mi>c</mi><mo>)</mo></mrow> <mo>&sube;</mo> <msub 
><mi>W</mi><mrow 
><mn>2</mn></mrow></msub 
></math>,
     and if <!--l. 326--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><mi>u</mi><mo>,</mo> <mi>l</mi><mo>,</mo> <mi>c</mi><mo>&rang;</mo></mrow> <mo>&isin;</mo> <msub 
><mi>W</mi><mrow 
><mn>2</mn></mrow></msub 
></math>
     with <!--l. 326--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mo>|</mo><mi>c</mi><mo>|</mo> <mo>=</mo> <mo>|</mo><mi>a</mi><mo>|</mo> <mo>+</mo> <mn>1</mn></math>
     then <!--l. 326--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo><munderover 
accent='true'><mrow><mi>u</mi></mrow><mrow 
> </mrow><mrow><mo>&#x0304;</mo></mrow></munderover><mo>}</mo></mrow> <mo>&times;</mo> <mrow><mo>(</mo><mi>&omega;</mi> <mo>\</mo> <mrow><mo>{</mo><mi>m</mi><mo>}</mo></mrow><mo>)</mo></mrow> <mo>&times;</mo> <mi>c</mi><mrow><mo>(</mo><mi>c</mi><mo>)</mo></mrow> <mo>&sube;</mo> <msub 
><mi>W</mi><mrow 
><mn>1</mn></mrow></msub 
></math>.
     Thus <!--l. 327--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>W</mi></math>
     is open, so <!--l. 328--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>x</mi></math>
     and <!--l. 328--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>y</mi></math>
     are separated by the disjoint open sets <!--l. 328--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>V</mi> <mrow 
><mi>x</mi></mrow></msub 
></math>
     and <!--l. 328--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>W</mi></math>.
     </dd><dt class="description">
<span 
class="cmbx-10">Case 2</span> </dt><dd 
class="description"><!--l. 329--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>s</mi><mo>&ne;</mo><mi>t</mi> <mi>&#x21BE;</mi> <mo>|</mo><mi>a</mi><mo>|</mo></math>.
     Let <!--l. 329--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>l</mi></math>
     be the least element of <!--l. 329--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mo>|</mo><mi>a</mi><mo>|</mo></math>
     such that <!--l. 330--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>s</mi><mrow><mo>(</mo><mi>l</mi><mo>)</mo></mrow><mo>&ne;</mo><mi>t</mi><mrow><mo>(</mo><mi>l</mi><mo>)</mo></mrow></math>.
     Let <!--l. 330--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&alpha;</mi> <mo>=</mo> <mi>s</mi><mrow><mo>(</mo><mi>l</mi><mo>)</mo></mrow></math>,
     <!--l. 330--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&beta;</mi> <mo>=</mo> <mi>t</mi><mrow><mo>(</mo><mi>l</mi><mo>)</mo></mrow></math>.
     If <!--l. 330--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&alpha;</mi> <mo>&lt;</mo> <mi>&beta;</mi></math>,
     let <!--l. 331--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>Z</mi><mrow 
><mn>0</mn></mrow></msub 
> <mo>=</mo> <mi>&omega;</mi> <mo>\</mo> <msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
></math>
     and let <!--l. 331--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>W</mi><mrow 
><mn>0</mn></mrow></msub 
> <mo>=</mo> <msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
></math>.
     If <!--l. 331--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&beta;</mi> <mo>&lt;</mo> <mi>&alpha;</mi></math>
     let <!--l. 331--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>Z</mi><mrow 
><mn>0</mn></mrow></msub 
> <mo>=</mo> <msub 
><mi>B</mi><mrow 
><mi>&beta;</mi></mrow></msub 
></math>
     and let <!--l. 332--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>W</mi><mrow 
><mn>0</mn></mrow></msub 
> <mo>=</mo> <mi>&omega;</mi> <mo>\</mo> <msub 
><mi>B</mi><mrow 
><mi>&beta;</mi></mrow></msub 
></math>.
     Either way, <!--l. 332--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>Z</mi><mrow 
><mn>0</mn></mrow></msub 
></math>

     and <!--l. 332--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>W</mi><mrow 
><mn>0</mn></mrow></msub 
></math>
     are disjoint subsets of <!--l. 333--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&omega;</mi></math>,
     and for every <!--l. 333--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><mi>s</mi> <mi>&#x21BE;</mi> <mi>l</mi> <mo>+</mo> <mn>1</mn><mo>,</mo> <mi>k</mi><mo>,</mo> <mi>c</mi><mo>&rang;</mo></mrow> <mo>&isin;</mo> <msub 
><mi>U</mi><mrow 
><mi>x</mi></mrow></msub 
> <mo>&cap;</mo> <msub 
><mi>Y</mi> <mrow 
><mi>s</mi><mi>&#x21BE;</mi><mi>l</mi><mo>+</mo><mn>1</mn></mrow></msub 
></math>,
     <!--l. 334--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>Z</mi><mrow 
><mn>0</mn></mrow></msub 
> <mo>&isin;</mo> <msub 
><mi>q</mi><mrow 
><mi>&alpha;</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>c</mi></mrow></msub 
></math>,
     while for every <!--l. 334--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><mi>t</mi> <mi>&#x21BE;</mi> <mi>l</mi> <mo>+</mo> <mn>1</mn><mo>,</mo> <mi>k</mi><mo>,</mo> <mi>c</mi><mo>&rang;</mo></mrow> <mo>&isin;</mo> <msub 
><mi>U</mi><mrow 
><mi>y</mi></mrow></msub 
> <mo>&cap;</mo> <msub 
><mi>Y</mi> <mrow 
><mi>t</mi><mi>&#x21BE;</mi><mi>l</mi><mo>+</mo><mn>1</mn></mrow></msub 
></math>,
     <!--l. 335--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>W</mi><mrow 
><mn>0</mn></mrow></msub 
> <mo>&isin;</mo> <msub 
><mi>q</mi><mrow 
><mi>&beta;</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>c</mi></mrow></msub 
></math>.
     Put <!--l. 336--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>Z</mi><mrow 
><mn>1</mn></mrow></msub 
> <mo>=</mo> <mo>&cup;</mo>
   <mrow><mo>{</mo> <msub 
><mi>V</mi> <mrow 
><mrow><mo>&lang;</mo><mi>s</mi><mi>&#x21BE;</mi><mi>l</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>c</mi><mo>&rang;</mo></mrow></mrow></msub 
> <mo>|</mo> <mi>k</mi> <mo>&isin;</mo> <msub 
><mi>Z</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>,</mo> <mi>c</mi> <mo>&isin;</mo> <msub 
><mi>P</mi><mrow 
><mi>l</mi></mrow></msub 
> <mo>}</mo></mrow></math>,
     and put <!--l. 337--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>W</mi><mrow 
><mn>1</mn></mrow></msub 
> <mo>=</mo> <mo>&cup;</mo>
   <mrow><mo>{</mo> <msub 
><mi>V</mi> <mrow 
><mrow><mo>&lang;</mo><mi>t</mi><mi>&#x21BE;</mi><mi>l</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>c</mi><mo>&rang;</mo></mrow></mrow></msub 
> <mo>|</mo> <mi>k</mi> <mo>&isin;</mo> <msub 
><mi>W</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>,</mo> <mi>c</mi> <mo>&isin;</mo> <msub 
><mi>P</mi><mrow 
><mi>l</mi></mrow></msub 
> <mo>}</mo></mrow></math>.
     Put <!--l. 338--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>Z</mi><mrow 
><mn>2</mn></mrow></msub 
> <mo>=</mo> <mrow><mo>{</mo> <mrow><mo>&lang;</mo><mi>s</mi> <mi>&#x21BE;</mi> <mo>|</mo><mi>c</mi><mo>|</mo><mo>,</mo> <mi>k</mi><mo>,</mo> <mi>c</mi><mo>&rang;</mo></mrow> <mo>|</mo> <mi>l</mi> <mo>&lt;</mo> <mo>|</mo><mi>c</mi><mo>|</mo> <mi>&#x2254;</mi> <mo>|</mo><mi>a</mi><mo>|</mo> <mo>}</mo></mrow></math>
     and <!--l. 339--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>W</mi><mrow 
><mn>2</mn></mrow></msub 
> <mo>=</mo> <mrow><mo>{</mo> <mrow><mo>&lang;</mo><mi>t</mi> <mi>&#x21BE;</mi> <mo>|</mo><mi>c</mi><mo>|</mo><mo>,</mo> <mi>k</mi><mo>,</mo> <mi>c</mi><mo>&rang;</mo></mrow> <mo>|</mo> <mi>l</mi> <mo>&lt;</mo> <mo>|</mo><mi>c</mi><mo>|</mo> <mi>&#x2254;</mi> <mo>|</mo><mi>b</mi><mo>|</mo> <mo>}</mo></mrow></math>.
     Then, as in the previous case, <!--l. 340--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>Z</mi> <mo>=</mo> <msub 
><mi>Z</mi><mrow 
><mn>1</mn></mrow></msub 
> <mo>&cup;</mo> <msub 
><mi>Z</mi><mrow 
><mn>2</mn></mrow></msub 
></math>
     and <!--l. 340--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>W</mi> <mo>=</mo> <msub 
><mi>W</mi><mrow 
><mn>1</mn></mrow></msub 
> <mo>&cup;</mo> <msub 
><mi>W</mi><mrow 
><mn>2</mn></mrow></msub 
></math>
     are open sets. Moreover, since <!--l. 341--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>Z</mi><mrow 
><mn>0</mn></mrow></msub 
></math>
     and <!--l. 341--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>W</mi><mrow 
><mn>0</mn></mrow></msub 
></math>
     are disjoint, <!--l. 341--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>Z</mi><mrow 
><mn>1</mn></mrow></msub 
></math>
     and <!--l. 341--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>W</mi><mrow 
><mn>1</mn></mrow></msub 
></math>
     are disjoint, while since <!--l. 342--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>s</mi><mrow><mo>(</mo><mi>l</mi><mo>)</mo></mrow><mo>&ne;</mo><mi>t</mi><mrow><mo>(</mo><mi>l</mi><mo>)</mo></mrow></math>,
     <!--l. 342--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>Z</mi><mrow 
><mn>2</mn></mrow></msub 
></math>
     and <!--l. 342--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>W</mi><mrow 
><mn>2</mn></mrow></msub 
></math>
     are disjoint. Thus <!--l. 343--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>Z</mi></math>
     and <!--l. 343--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>W</mi></math>
     are disjoint open sets separating <!--l. 343--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>x</mi></math>
     and <!--l. 343--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>y</mi></math>.</dd></dl>
<!--346--><p class="noindent">To complete the proof that <!--l. 346--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&sigma;</mi></math>
is a <!--l. 346--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
><mn>2</mn></mrow></msub 
></math> topology, we must
show that we can separate <!--l. 347--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
></math>
from any other element of <!--l. 347--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi></math>.
So let <!--l. 348--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>y</mi> <mo>=</mo> <mrow><mo>&lang;</mo><mi>s</mi><mo>,</mo> <mi>n</mi><mo>,</mo> <mi>a</mi><mo>&rang;</mo></mrow> <mo>&isin;</mo> <msub 
><mi>X</mi><mrow 
><mi>a</mi></mrow></msub 
></math>. If
<!--l. 348--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>a</mi> <mo>=</mo> <mi>&#x2205;</mi></math> then
(since <!--l. 348--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&omega;</mi> <mo>\</mo> <mrow><mo>{</mo><mi>n</mi><mo>}</mo></mrow></math>
in <!--l. 349--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>q</mi><mrow 
><mi>&alpha;</mi><mo>,</mo><mi>m</mi><mo>,</mo><mi>b</mi></mrow></msub 
></math> for
all <!--l. 349--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&alpha;</mi></math>,
<!--l. 349--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>m</mi></math> and
<!--l. 349--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>b</mi></math>,
<!--l. 349--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi> <mo>\</mo> <mrow><mo>{</mo><mi>y</mi><mo>}</mo></mrow></math> is open,
so <!--l. 350--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
></math> and
<!--l. 350--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>y</mi></math> are separated by the
disjoint open sets <!--l. 350--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>X</mi> <mo>\</mo> <mrow><mo>{</mo><mi>y</mi><mo>}</mo></mrow></math>
and <!--l. 351--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo><mi>y</mi><mo>}</mo></mrow></math>. So
suppose that <!--l. 351--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mo>|</mo><mi>a</mi><mo>|</mo> <mo>&gt;</mo> <mn>0</mn></math>.
Let <!--l. 351--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&alpha;</mi> <mo>=</mo> <mi>s</mi><mrow><mo>(</mo><mn>0</mn><mo>)</mo></mrow></math>. Let

<!--l. 352--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow>
<mi>Z</mi> <mo>=</mo> <mrow><mo>{</mo><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>}</mo></mrow> <mo>&cup;</mo> <mrow><mo>{</mo> <mrow><mo>&lang;</mo><mi>t</mi><mo>,</mo> <mi>m</mi><mo>,</mo> <mi>b</mi><mo>&rang;</mo></mrow> <mo>|</mo> <mi>b</mi> <mo>&isin;</mo> <mi>P</mi> <mo>\</mo> <mrow><mo>{</mo><mi>&#x2205;</mi><mo>}</mo></mrow><mo>,</mo> <mi>t</mi> <mo>&isin;</mo> <msup 
><mi>u</mi><mrow><mo>|</mo><mi>b</mi><mo>|</mo></mrow></msup 
><mo>,</mo> <mi>t</mi><mrow><mo>(</mo><mn>0</mn><mo>)</mo></mrow> <mo>&gt;</mo> <mi>&alpha;</mi> <mo>}</mo></mrow> <mo>&cup;</mo> <mrow><mo>{</mo> <mrow><mo>&lang;</mo><mi>&#x2205;</mi><mo>,</mo> <mi>m</mi><mo>,</mo> <mi>&#x2205;</mi><mo>&rang;</mo></mrow> <mo>|</mo> <mi>m</mi> <mo>&isin;</mo> <msub 
><mi>B</mi><mrow 
>
<mi>&alpha;</mi></mrow></msub 
> <mo>}</mo></mrow>
</mrow></math> and let
<!--l. 357--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow>
              <mi>W</mi> <mo>=</mo> <mrow><mo>(</mo><msub 
><mi>U</mi><mrow 
><mi>y</mi></mrow></msub 
> <mo>\</mo> <msub 
><mi>Y</mi> <mrow 
><mi>&#x2205;</mi></mrow></msub 
><mo>)</mo></mrow> <mo>&cup;</mo> <mrow><mo>{</mo> <mrow><mo>&lang;</mo><mi>&#x2205;</mi><mo>,</mo> <mi>m</mi><mo>,</mo> <mi>&#x2205;</mi><mo>&rang;</mo></mrow> <mo>|</mo> <mi>m</mi> <mo>&isin;</mo> <mi>&omega;</mi> <mo>\</mo> <msub 
><mi>B</mi><mrow 
><mi>&alpha;</mi></mrow></msub 
> <mo>}</mo></mrow><mo>.</mo>
</mrow></math> Then
<!--l. 361--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>Z</mi></math> and
<!--l. 361--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>W</mi></math> are disjoint open
sets separating <!--l. 361--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
></math>
and <!--l. 361--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>y</mi></math>.
&nbsp;_
</p>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Lemma</span>&nbsp;<span 
class="cmbx-10">4</span> </span><!--l. 365--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msubsup 
><mi>N</mi><mrow><mi>&sigma;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
><mrow><mo>(</mo><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>)</mo></mrow> <mi>&#x21BE;</mi> <msub 
><mi>X</mi><mrow 
><mi>a</mi></mrow></msub 
></math>
<span 
class="cmti-10">is an ultrafilter for each </span><!--l. 365--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>a</mi> <mo>&isin;</mo> <mi>P</mi></math><span 
class="cmti-10">.</span>
   </div>
<span 
class="cmbx-10">Proof. </span>We will show that <!--l. 368--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msubsup 
><mi>N</mi><mrow><mi>&sigma;</mi></mrow><mrow 
><mi>o</mi></mrow></msubsup 
><mrow><mo>(</mo><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>)</mo></mrow> <mi>&#x21BE;</mi> <msub 
><mi>X</mi><mrow 
><mi>a</mi></mrow></msub 
> <mo>=</mo> <mrow><mo>{</mo> <mi>T</mi> <mo>&times;</mo> <mrow><mo>{</mo><mi>a</mi><mo>}</mo></mrow> <mo>|</mo> <mi>T</mi> <mo>&isin;</mo> <msup 
><mi>r</mi><mrow><mo>|</mo><mi>a</mi><mo>|</mo></mrow></msup 
> <mo>&middot;</mo> <mi>p</mi> <mo>}</mo></mrow></math>.
Since <!--l. 369--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
> <mo>&isin;</mo> <mrow class="overline"><msub 
><mi>X</mi><mrow 
><mi>a</mi></mrow></msub 
></mrow><mi>&sigma;</mi></math>
and <!--l. 369--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msup 
><mi>r</mi><mrow><mo>|</mo><mi>a</mi><mo>|</mo></mrow></msup 
> <mo>&middot;</mo> <mi>p</mi></math>
is an ultrafilter, it is enough to show that, for each
<!--l. 370--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>T</mi> <mo>&isin;</mo> <msup 
><mi>r</mi><mrow><mo>|</mo><mi>a</mi><mo>|</mo></mrow></msup 
> <mo>&middot;</mo> <mi>p</mi></math>, there is an
open set <!--l. 371--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>U</mi></math>
containing <!--l. 371--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
></math>

with <!--l. 371--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>U</mi> <mo>&cap;</mo> <msub 
><mi>X</mi><mrow 
><mi>a</mi></mrow></msub 
> <mo>=</mo> <mi>T</mi> <mo>&times;</mo> <mrow><mo>{</mo><mi>a</mi><mo>}</mo></mrow></math>. Let
<!--l. 372--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>l</mi> <mo>=</mo> <mo>|</mo><mi>a</mi><mo>|</mo></math>. We will construct
a sequence <!--l. 372--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>T</mi><mrow 
><mi>l</mi></mrow></msub 
><mo>,</mo> <msub 
><mi>T</mi><mrow 
><mi>l</mi><mo>+</mo><mn>1</mn></mrow></msub 
><mo>,</mo> <mo>&hellip;</mo><mo>,</mo> <msub 
><mi>T</mi><mrow 
><mo>|</mo><mi>A</mi><mo>|</mo></mrow></msub 
></math>
of sets such that
     <ol type="1" class="enumerate1" 
>
     <li class="enumerate"><a 
  name="x1-3004x1"></a><!--l. 375--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>T</mi><mrow 
><mi>l</mi></mrow></msub 
> <mo>=</mo> <mi>T</mi></math>;
     </li>
     <li class="enumerate"><a 
  name="x1-3006x2"></a>if <!--l. 376--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>l</mi> <mi>&#x2254;</mi> <mi>i</mi> <mo>&lt;</mo> <mo>|</mo><mi>A</mi><mo>|</mo></math>
     then for every <!--l. 376--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><mi>s</mi><mo>,</mo> <mi>n</mi><mo>&rang;</mo></mrow> <mo>&isin;</mo> <msub 
><mi>T</mi><mrow 
><mi>i</mi><mo>+</mo><mn>1</mn></mrow></msub 
></math>
     and every <!--l. 377--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>b</mi> <mo>&isin;</mo> <msub 
><mi>P</mi><mrow 
><mi>i</mi><mo>+</mo><mn>1</mn></mrow></msub 
></math>,
     <!--l. 377--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo> <mi>m</mi> <mo>&isin;</mo> <mi>&omega;</mi> <mo>|</mo> <mrow><mo>&lang;</mo><munderover 
accent='true'><mrow><mi>s</mi></mrow><mrow 
> </mrow><mrow><mo>&#x0304;</mo></mrow></munderover><mo>,</mo> <mi>m</mi><mo>&rang;</mo></mrow> <mo>&isin;</mo> <msub 
><mi>T</mi><mrow 
><mi>i</mi></mrow></msub 
> <mo>}</mo></mrow> <mo>&isin;</mo> <msub 
><mi>q</mi><mrow 
><mi>l</mi><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>,</mo><mi>n</mi><mo>,</mo><mi>b</mi></mrow></msub 
></math>;
     and
     </li>
     <li class="enumerate"><a 
  name="x1-3008x3"></a><!--l. 379--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>T</mi><mrow 
><mi>i</mi></mrow></msub 
> <mo>&isin;</mo> <msup 
><mi>r</mi><mrow><mi>i</mi></mrow></msup 
> <mo>&middot;</mo> <mi>p</mi></math>
     for each <!--l. 379--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>i</mi></math>.</li></ol>
<!--381--><p class="noindent">If we then take <!--l. 382--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow>
                      <mi>U</mi> <mo>=</mo><msub 
> <mo>&cup;</mo>
     <mrow 
><mo>|</mo><mi>b</mi><mo>|</mo><mo>&lt;</mo><mi>a</mi></mrow></msub 
><msub 
><mi>X</mi><mrow 
><mi>b</mi></mrow></msub 
> <mo>&cup;</mo> <mfenced 
open='(' close=')'><msubsup 
><mo>&cup;</mo>
    <mrow><mi>i</mi> <mo>=</mo> <mi>l</mi></mrow><mrow 
><mo>|</mo><mi>A</mi><mo>|</mo></mrow></msubsup 
><msub 
><mi>T</mi><mrow 
><mi>i</mi></mrow></msub 
> <mo>&times;</mo> <msub 
><mi>P</mi><mrow 
><mi>i</mi></mrow></msub 
> <mo>&cup;</mo> <mrow><mo>{</mo><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>}</mo></mrow></mfenced> <mo>,</mo>
</mrow></math>
then <!--l. 386--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>U</mi></math>
will be the open set we require.
</p><!--388--><p class="indent">   So, suppose we have chosen <!--l. 388--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>T</mi><mrow 
><mi>l</mi></mrow></msub 
><mo>,</mo> <mo>&hellip;</mo><mo>,</mo> <msub 
><mi>T</mi><mrow 
><mi>k</mi></mrow></msub 
></math>
satisfying (1)-(3), and we wish to choose
<!--l. 389--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>T</mi><mrow 
><mi>k</mi><mo>+</mo><mn>1</mn></mrow></msub 
></math>. For
<!--l. 389--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>s</mi> <mo>&isin;</mo> <msup 
><mi>u</mi><mrow><mi>k</mi></mrow></msup 
></math> let
<!--l. 390--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mrow><mo>(</mo><msub 
><mi>T</mi><mrow 
><mi>k</mi></mrow></msub 
><mo>)</mo></mrow><mrow 
><mi>s</mi></mrow></msub 
> <mo>=</mo> <mrow><mo>{</mo> <mi>n</mi> <mo>&isin;</mo> <mi>&omega;</mi> <mo>|</mo> <mrow><mo>&lang;</mo><mi>s</mi><mo>,</mo> <mi>n</mi><mo>&rang;</mo></mrow> <mo>&isin;</mo> <msub 
><mi>T</mi><mrow 
><mi>k</mi></mrow></msub 
> <mo>}</mo></mrow></math>. Let
<!--l. 391--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>S</mi> <mo>=</mo> <mrow><mo>{</mo> <mi>s</mi> <mo>&isin;</mo> <msup 
><mi>u</mi><mrow><mi>k</mi></mrow></msup 
> <mo>|</mo> <msub 
><mrow><mo>(</mo><msub 
><mi>T</mi><mrow 
><mi>k</mi></mrow></msub 
><mo>)</mo></mrow><mrow 
><mi>s</mi></mrow></msub 
> <mo>}</mo></mrow> <mo>&isin;</mo> <mi>p</mi></math>. Then,
since <!--l. 391--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>T</mi><mrow 
><mi>k</mi></mrow></msub 
> <mo>&isin;</mo> <msup 
><mi>r</mi><mrow><mi>k</mi></mrow></msup 
> <mo>&middot;</mo> <mi>p</mi></math>,
<!--l. 392--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>S</mi> <mo>&isin;</mo> <msup 
><mi>r</mi><mrow><mi>k</mi></mrow></msup 
></math>. For each
<!--l. 392--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>s</mi> <mo>&isin;</mo> <mi>S</mi></math> choose
<!--l. 392--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>&alpha;</mi><mrow 
><mi>s</mi></mrow></msub 
> <mo>&isin;</mo> <mi>u</mi></math> with
<!--l. 393--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>B</mi><mrow 
><msub 
><mi>&alpha;</mi><mrow 
><mi>s</mi></mrow></msub 
></mrow></msub 
>  <mo>&sube;</mo> <msub 
><mrow><mo>(</mo><msub 
><mi>T</mi><mrow 
><mi>k</mi></mrow></msub 
><mo>)</mo></mrow><mrow 
><mi>s</mi></mrow></msub 
></math>. Let

<!--l. 394--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow>
                <mi>S</mi><mi>&prime;</mi> <mo>=</mo> <mrow><mo>{</mo> <mi>s</mi> <mo>&cup;</mo> <mrow><mo>{</mo><mrow><mo>&lang;</mo><mi>k</mi><mo>,</mo> <mi>&beta;</mi><mo>&rang;</mo></mrow><mo>}</mo></mrow> <mo>|</mo> <mi>s</mi> <mo>&isin;</mo> <mi>S</mi><mo>,</mo> <msub 
><mi>&alpha;</mi><mrow 
>
<mi>s</mi></mrow></msub 
> <mo>&lt;</mo> <mi>&beta;</mi> <mo>&lt;</mo> <mi>u</mi> <mo>}</mo></mrow><mo>.</mo>
</mrow></math> Then,
since <!--l. 397--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo> <mi>&beta;</mi> <mo>|</mo> <msub 
><mi>&alpha;</mi><mrow 
><mi>s</mi></mrow></msub 
> <mo>&lt;</mo> <mi>&beta;</mi> <mo>&lt;</mo> <mi>u</mi> <mo>}</mo></mrow></math> is
in <!--l. 397--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>r</mi></math> for
each <!--l. 397--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>s</mi> <mo>&isin;</mo> <mi>S</mi></math>,
<!--l. 398--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>s</mi><mi>&prime;</mi> <mo>&isin;</mo> <msup 
><mi>r</mi><mrow><mi>k</mi></mrow></msup 
> <mo>&middot;</mo> <mi>r</mi> <mo>=</mo> <msup 
><mi>r</mi><mrow><mi>k</mi><mo>+</mo><mn>1</mn></mrow></msup 
></math>. Put
<!--l. 398--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>t</mi><mrow 
><mi>k</mi><mo>+</mo><mn>1</mn></mrow></msub 
> <mo>=</mo> <mi>S</mi><mi>&prime;</mi> <mo>&times;</mo> <mi>&omega;</mi></math>. Then
<!--l. 399--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo> <mi>s</mi> <mo>&isin;</mo> <msup 
><mi>u</mi><mrow><mi>k</mi><mo>+</mo><mn>1</mn></mrow></msup 
> <mo>|</mo> <msub 
><mrow><mo>(</mo><msub 
><mi>T</mi><mrow 
><mi>k</mi><mo>+</mo><mn>1</mn></mrow></msub 
><mo>)</mo></mrow><mrow 
><mi>s</mi></mrow></msub 
> <mo>&isin;</mo> <mi>p</mi> <mo>}</mo></mrow> <mo>=</mo> <mi>S</mi><mi>&prime;</mi> <mo>&isin;</mo> <msup 
><mi>r</mi><mrow><mi>k</mi><mo>+</mo><mn>1</mn></mrow></msup 
></math>, so
<!--l. 400--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>T</mi><mrow 
><mi>k</mi><mo>+</mo><mn>1</mn></mrow></msub 
> <mo>&isin;</mo> <msup 
><mi>r</mi><mrow><mi>k</mi><mo>+</mo><mn>1</mn></mrow></msup 
> <mo>&middot;</mo> <mi>p</mi></math>. Finally,
suppose that <!--l. 400--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>&lang;</mo><mi>s</mi><mo>,</mo> <mi>n</mi><mo>&rang;</mo></mrow> <mo>&isin;</mo> <msub 
><mi>T</mi><mrow 
><mi>k</mi><mo>+</mo><mn>1</mn></mrow></msub 
></math>
and <!--l. 401--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>b</mi> <mo>&isin;</mo> <msub 
><mi>P</mi><mrow 
><mi>k</mi><mo>+</mo><mn>1</mn></mrow></msub 
></math>.
Then <!--l. 401--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>s</mi> <mo>&isin;</mo> <mi>S</mi><mi>&prime;</mi></math>,
so <!--l. 401--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><munderover 
accent='true'><mrow><mi>s</mi></mrow><mrow 
> </mrow><mrow><mo>&#x0304;</mo></mrow></munderover> <mo>&isin;</mo> <mi>S</mi></math>
and <!--l. 402--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>&alpha;</mi><mrow 
><munderover 
accent='true'><mrow><mi>s</mi></mrow><mrow 
> </mrow><mrow><mo>&#x0304;</mo></mrow></munderover></mrow></msub 
> <mo>&lt;</mo> <mi>l</mi><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></math>.
Thus <!--l. 402--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>B</mi><mrow 
><msub 
><mi>&alpha;</mi><mrow 
><munderover 
accent='true'><mrow><mi>s</mi></mrow><mrow 
> </mrow><mrow><mo>&#x0304;</mo></mrow></munderover></mrow></msub 
></mrow></msub 
>  <mo>&isin;</mo> <msub 
><mi>q</mi><mrow 
><mi>l</mi><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>,</mo><mi>n</mi><mo>,</mo><mi>b</mi></mrow></msub 
></math>
and <!--l. 403--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>B</mi><mrow 
><msub 
><mi>&alpha;</mi><mrow 
><munderover 
accent='true'><mrow><mi>s</mi></mrow><mrow 
> </mrow><mrow><mo>&#x0304;</mo></mrow></munderover></mrow></msub 
></mrow></msub 
>  <mo>&sube;</mo> <msub 
><mrow><mo>(</mo><msub 
><mi>T</mi><mrow 
><mi>k</mi></mrow></msub 
><mo>)</mo></mrow><mrow 
><munderover 
accent='true'><mrow><mi>s</mi></mrow><mrow 
> </mrow><mrow><mo>&#x0304;</mo></mrow></munderover></mrow></msub 
></math>,
so <!--l. 403--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>{</mo> <mi>m</mi> <mo>&isin;</mo> <mi>&omega;</mi> <mo>|</mo> <mrow><mo>&lang;</mo><munderover 
accent='true'><mrow><mi>s</mi></mrow><mrow 
> </mrow><mrow><mo>&#x0304;</mo></mrow></munderover><mo>,</mo> <mi>m</mi><mo>&rang;</mo></mrow> <mo>&isin;</mo> <msub 
><mi>T</mi><mrow 
><mi>k</mi></mrow></msub 
> <mo>}</mo></mrow> <mo>&isin;</mo> <msub 
><mi>q</mi><mrow 
><mi>l</mi><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow><mo>,</mo><mi>n</mi><mo>,</mo><mi>b</mi></mrow></msub 
></math>, as
required. &nbsp;_
   Thus, putting <!--l. 407--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&tau;</mi> <mo>=</mo> <mrow><mo>&lang;</mo><mi>&sigma;</mi><mo>,</mo> <mrow><mo>{</mo><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
><mo>}</mo></mrow><mo>&rang;</mo></mrow></math>,
we have that <!--l. 407--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mrow><mo>[</mo><mi>&sigma;</mi><mo>,</mo> <mi>&tau;</mi><mo>]</mo></mrow></math> is
isomorphic to <!--l. 408--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>O</mi><mrow><mo>(</mo><mi>P</mi><mo>)</mo></mrow></math>,
as claimed. Now, since any finite partial order can be embedded in an order of the
form <!--l. 409--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>&#x2119;</mi><mi>A</mi></math>
(ordered by reverse inclusion) for some finite set
<!--l. 410--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>A</mi></math>, we
have proved the following:
</p>
   <div class="newtheorem"><span class="head">
<span 
class="cmbx-10">Theorem</span>&nbsp;<span 
class="cmbx-10">1</span> </span><span 
class="cmti-10">Let</span>
<!--l. 414--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>L</mi></math>
<span 
class="cmti-10">be                  a                  finite                  lattice.                  Then</span>
<!--l. 414--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>L</mi></math>

<span 
class="cmti-10">is           isomorphic           to           an           interval           between</span>
<!--l. 415--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
>
<mn>2</mn></mrow></msub 
></math>
<span 
class="cmti-10">topologies                  if                  and                  only                  if</span>
<!--l. 415--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>L</mi></math>
<span 
class="cmti-10">is distributive.</span>
   </div>
<span 
class="cmbx-10">Proof. </span>Necessity follows from Rosick&#x00FD;'s result that any finite interval between
<!--l. 419--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
>
<mn>1</mn></mrow></msub 
></math>
topologies is distributive. Sufficency follows from the previous remarks and the
remark following Lemma&nbsp;<a 
href="#x1-20011">1</a> &nbsp;_
   <h3 class="sectionHead"> 4 <a 
  name="x1-40004"></a><a 
  name="QQ1-1-4"></a>Conclusions and questions</h3>
<!--424--><p class="noindent">The construction given in this paper shows that any finite
distributive lattice can be realized as an interval between
<!--l. 425--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
>
<mn>2</mn></mrow></msub 
></math> topologies on
a set of size <!--l. 426--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mi>u</mi></math>.
It clearly does not yield a regular topology: the closure of any neighbourhood of
<!--l. 427--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>x</mi><mrow 
><mn>0</mn></mrow></msub 
></math> will contain
co-<!--l. 428--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><mo>&lt;</mo> <mi>u</mi></math> many
elements of each <!--l. 428--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi>X</mi><mrow 
><mi>a</mi></mrow></msub 
></math>,
not just <!--l. 428--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msup 
><mi>r</mi><mrow><mo>|</mo><mi>a</mi><mo>|</mo></mrow></msup 
> <mo>&middot;</mo> <mi>p</mi></math>
many. Two obvious directions for possible improvements on this result are to ask for
more separation on the topologies or to ask for smaller sets.
</p><!--432--><p class="indent">   In [<a 
href="#XGMW">3</a>] it is shown that the distributive lattice </p>
<div class="center" 
>
 <img 
src="lattices0x.gif" alt="PICT"   />
</div>
   cannot be realized as an interval between
<!--l. 442--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
>
<mn>3</mn></mrow></msub 
></math> topologies
on a countable set. The question remains whether this lattice can be realized as an interval
between <!--l. 444--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
><mn>2</mn></mrow></msub 
></math>
topologies on a countable set, and whether it can be realized as an interval between
<!--l. 445--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
class="inline"><msub 
><mi class="mathrm">T</mi><mrow 
>
<mn>3</mn></mrow></msub 
></math>
topologies on some set without assuming the existence of a measurable cardinal.
   <h3 class="likesectionHead"><a 
  name="x1-50004"></a><a 
  name="QQ1-1-5"></a>Acknowldegements</h3>
<!--450--><p class="noindent">The work presented in this paper is one outcome of a mini workshop organised by the
Mathematics Department of the University of Auckland in April 1996. The first

author would like to acknowledge the financial assistance of the Mathematics
Department of Auckland University, without which his attendance would not have
been possible. The second author was present on a Royal Society Postdoctoral
Fellowship. These authors wish to sincerely thank the Mathematics Department for
their warm hospitality.
</p>
   <h3 class="likesectionHead"><a 
  name="x1-60004"></a><a 
  name="QQ1-1-6"></a>References</h3>
    <div class="thebibliography"><p class="bibitem">
  [1]&nbsp;&nbsp;&nbsp;<a 
  name="XB"></a>Birkhoff, G., <span 
class="cmti-10">On the combination of topologies</span>, Fund. Math. <span 
class="cmbx-10">26 </span>(1936),
    156-166.
    </p><p class="bibitem">
  [2]&nbsp;&nbsp;&nbsp;<a 
  name="XCN"></a>Comfort,   W.W.   &amp;   Negrepontis,   S.,   <span 
class="cmti-10">The   theory   of   ultrafilters</span>,
    Springer-Verlag, Berlin, 1974.
    </p><p class="bibitem">
  [3]&nbsp;&nbsp;&nbsp;<a 
  name="XGMW"></a>Good, C., McIntyre, D.W. &amp; Watson, W.S., <span 
class="cmti-10">Measurable cardinals and finite</span>
    <span 
class="cmti-10">intervals between Hausdorff topologies</span>, University of Auckland Mathematics
    Department Report Series <span 
class="cmbx-10">334</span>, March 1996.
    </p><p class="bibitem">
  [4]&nbsp;&nbsp;&nbsp;<a 
  name="XLA"></a>Larson R.E. &amp; Andima S.J., <span 
class="cmti-10">The lattice of topologies: a survey</span>, Rocky
    Mountain J. Math., <span 
class="cmbx-10">5 </span>(1975), 177-198.
    </p><p class="bibitem">
  [5]&nbsp;&nbsp;&nbsp;<a 
  name="XRos"></a>Rosick&#x00FD;,  J.,  <span 
class="cmti-10">Modular,  distributive  and  simple  intervals  of  the  lattice  of</span>
    <span 
class="cmti-10">topologies</span>, Arch. Math. Brno <span 
class="cmbx-10">11 </span>(1975), 105-114.
    </p><p class="bibitem">
  [6]&nbsp;&nbsp;&nbsp;<a 
  name="XV"></a>Vaughan, J., <span 
class="cmti-10">Small uncountable cardinals and topology</span>, in: G.M. Reed and
    J. van Mill, eds., Open Problems in Topology (North-Holland, Amsterdam,
    1990) 195-218.
    </p><p class="bibitem">
  [7]&nbsp;&nbsp;&nbsp;<a 
  name="XVL"></a>Valent, R &amp; Larson, R.E., <span 
class="cmti-10">Basic intervals in the lattice of topologies</span>, Duke
    Math. J. <span 
class="cmbx-10">39 </span>(1972), 401-411.</p></div>
    
</body> 
</html> 



