<?xml version="1.0" encoding="iso-8859-1" ?> 
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0//EN" 
"http://www.w3.org/Math/DTD/mathml2/xhtml-math11-f.dtd" > 
<?xml-stylesheet type="text/css" href="149.css"?> 
<html  
xmlns="http://www.w3.org/1999/xhtml"  
><head><title></title> 
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" /> 
<meta name="generator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/mn.html)" /> 
<meta name="originator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/mn.html)" /> 
<!-- xhtml,mozilla --> 
<meta name="src" content="149.tex" /> 
<meta name="date" content="2007-07-07 14:53:00" /> 
<link rel="stylesheet" type="text/css" href="149.css" /> 
</head><body 
>
<!--l. 85--><p class="noindent"><span 
class="cmbx-12">Lobachevskii Journal of Mathematics</span>
<span 
class="cmtt-12">http://ljm.ksu.ru</span>
<span 
class="cmbx-12">Vol.</span><span 
class="cmbx-12">&#x00A0;26, 2007, 33&#x2013;49</span>
</p><!--l. 85--><p class="noindent"><span 
class="cmsy-10x-x-120">&#x00A9;</span>&#x00A0;Xun ge
</p>
<div class="center" 
>
<!--l. 85--><p class="noindent">
</p><!--l. 85--><p class="noindent"><span 
class="cmsl-12">Xun ge</span><br />
<span 
class="cmbx-12">SPACES WITH A LOCALLY COUNTABLE</span>
<!--l. 85--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi><mi 
>N</mi></math><span 
class="cmbx-12">-NETWORK</span><br />
(submitted by M. A. Malakhaltsev)</p></div>

<!--l. 91--><p class="indent"></p><hr class="float" /><div class="float" 
><table class="float"><tr class="float"><td class="float" 
>

________________
<!--l. 91--><p class="noindent"><span 
class="cmti-12">Key words and phrases</span>. <!--l. 91--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmr-10x-x-109">-network,</span>
 <!--l. 91--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>s</mi></math><span 
class="cmr-10x-x-109">-network,</span>
<span 
class="cmr-10x-x-109">weak-base, perfect-mapping, (strongly) </span><!--l. 91--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>
<span 
class="cmr-10x-x-109">mapping, &#xFB01;nite subsequence-covering mapping.</span>

</p>
</td></tr></table></div><hr class="endfloat" />
<!--l. 97--><p class="indent"><span 
class="cmcsc-10x-x-109">A<span 
class="small-caps">b</span><span 
class="small-caps">s</span><span 
class="small-caps">t</span><span 
class="small-caps">r</span><span 
class="small-caps">a</span><span 
class="small-caps">c</span><span 
class="small-caps">t</span></span><span 
class="cmr-10x-x-109">. In this paper, we discuss a class of spaces with a locally countable</span>
<!--l. 97--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmr-10x-x-109">-network.</span>
<span 
class="cmr-10x-x-109">We give some characterizations of this class and investigate variance and</span>
<span 
class="cmr-10x-x-109">inverse invariance of this class under certain mappings.</span>
</p>
<h3 class="sectionHead"><span class="titlemark">1. </span> <a 
 id="x1-10001"></a>Introduction</h3>
<!--l. 104--><p class="noindent"><!--l. 104--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-networks
is a class of important networks between weak-bases and
<!--l. 104--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>s</mi></math>-networks. In
past years, spaces with a locally countable weak-base and spaces with a locally countable
<!--l. 106--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>s</mi></math>-network
had been investigated and many interesting results had
been obtained (<span class="cite">[<a 
href="#XL3">17</a>,&#x00A0;<a 
href="#XL6">21</a>,&#x00A0;<a 
href="#XL1">22</a>,&#x00A0;<a 
href="#XLY">23</a>,&#x00A0;<a 
href="#XLiu">24</a>,&#x00A0;<a 
href="#XT">30</a>,&#x00A0;<a 
href="#XT1">31</a>,&#x00A0;<a 
href="#XTG">32</a>,&#x00A0;<a 
href="#XTL">33</a>]</span>). In
this paper, we will discuss spaces with a locally countable
<!--l. 108--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network.
We give some characterizations of this class and investigate variance and
inverse invariance of this class under certain mappings.
</p><!--l. 112--><p class="indent">Throughout this paper, all spaces are assumed to be regular
<!--l. 112--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>T</mi> </mrow><mrow 
><mn>1</mn> </mrow> </msub 
> </math> and all mappings are
continuous and onto. <!--l. 113--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi mathvariant="double-struck">&#x2115;</mi></math>,
<!--l. 113--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C9;</mi></math> and
<!--l. 113--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03C9;</mi></mrow><mrow 
><mn>1</mn> </mrow> </msub 
> </math>
denote the set of all natural numbers, the &#xFB01;rst in&#xFB01;nite ordinal
and the &#xFB01;rst uncountable ordinal respectively. For a set
<!--l. 116--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>D</mi></math>,
<!--l. 116--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x2223;</mo><mi 
>D</mi><mo 
class="MathClass-rel">&#x2223;</mo></math> denotes the
cardinal of <!--l. 116--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>D</mi></math>.
<!--l. 117--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math> denotes a sequence,
where the <!--l. 117--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi></math>-th
term is <!--l. 117--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math>.
Let <!--l. 118--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math> be a
space and <!--l. 118--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>X</mi></math>.
A sequence <!--l. 118--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
converging to <!--l. 118--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>
in <!--l. 119--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math> is

eventually in <!--l. 119--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi></math>
if <!--l. 119--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mi 
>k</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>P</mi></math> for some
<!--l. 119--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>; is frequently
in <!--l. 120--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>P</mi></math> if
<!--l. 120--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math> is eventually
in <!--l. 120--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>P</mi></math> for some
subsequence <!--l. 121--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
of <!--l. 121--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>. Let
<!--l. 122--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math> be a family of
subsets of <!--l. 122--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math> and
<!--l. 122--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math> be a mapping
de&#xFB01;ned on <!--l. 122--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>.
Then <!--l. 123--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>,
<!--l. 124--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mi 
mathvariant="script">P</mi></math> and
<!--l. 124--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-op">&#x22C2;</mo>
<!--nolimits--><mi 
mathvariant="script">P</mi></math> denote the union
<!--l. 124--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>P</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math> and the intersection
<!--l. 125--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-op">&#x22C2;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>P</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math> respectively.
Let <!--l. 126--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math> be a family
of subsets of <!--l. 126--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>.
<!--l. 126--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi> </mrow> </msub 
> </math> is a
network at <!--l. 126--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>
in <!--l. 126--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>, if
<!--l. 127--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mo 
class="MathClass-op">&#x22C2;</mo>
  <!--nolimits--><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math> and for each
neighborhood <!--l. 127--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>
of <!--l. 127--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>x</mi></math> in
<!--l. 127--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math> there is
<!--l. 127--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math> such
that <!--l. 128--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>U</mi></math>.
We refer the reader to <span class="cite">[<a 
href="#XE">7</a>]</span> for notations and terminology not explicitly given
here.
</p>
<h3 class="sectionHead"><span class="titlemark">2. </span> <a 
 id="x1-20002"></a>Spaces with a Locally Countable
<!--l. 131--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-Network</h3>
<div class="newtheorem">
<!--l. 133--><p class="noindent"><span class="head">
<a 
 id="x1-2001r1"></a>
<span 
class="cmbx-12">De&#xFB01;nition 2.1.</span>  </span><span class="cite">[<a 
href="#XF">8</a>,&#x00A0;<a 
href="#XGa">9</a>]</span>. Let <!--l. 133--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>

be a space and let <!--l. 133--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>.
</p><!--l. 135--><p class="indent">(1) <!--l. 135--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>X</mi></math>
is called a sequential neighborhood of <!--l. 135--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>
if each sequence <!--l. 136--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
converging to <!--l. 136--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>
is eventually in <!--l. 136--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi></math>.
</p><!--l. 138--><p class="indent">(2)                                       A                                       subset
<!--l. 138--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>
of
<!--l. 138--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is               called               sequentially               open               if
<!--l. 139--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>
is a   sequential   neighborhood   of   each   of   its   points;   a   subset
<!--l. 140--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>F</mi> </math>
of
<!--l. 140--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is               called               sequentially               closed               if
<!--l. 140--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>F</mi></math>
is sequentially open.
</p><!--l. 142--><p class="indent">(3) <!--l. 142--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is called a sequential space if each sequentially open subset of <!--l. 142--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is open in <!--l. 142--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>,
equivalently, if each sequentially closed subset of <!--l. 143--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is closed in <!--l. 143--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>.
</p><!--l. 145--><p class="indent">(4) <!--l. 145--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is called a <!--l. 145--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>-space
if for each <!--l. 145--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>A</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>X</mi></math>,
<!--l. 146--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>A</mi></math>
is closed in <!--l. 146--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
if and only if <!--l. 146--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>A</mi><mo 
class="MathClass-op">&#x22C2;</mo>
<!--nolimits--><mi 
>K</mi></math>
is closed in <!--l. 146--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math>
for each compact subset <!--l. 146--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math>
of <!--l. 146--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
</p>
</div>
<div class="newtheorem">
<!--l. 149--><p class="noindent"><span class="head">
<a 
 id="x1-2002r2"></a>

<span 
class="cmti-12">Remark </span>2.2<span 
class="cmti-12">.</span>  </span>(1) <!--l. 149--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi></math>
is a sequential neighborhood of <!--l. 149--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>
if and only if each sequence <!--l. 150--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
converging to <!--l. 150--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>
is frequently in <!--l. 150--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi></math>.
</p><!--l. 152--><p class="indent">(2) The intersection of &#xFB01;nite sequential neighborhoods of <!--l. 152--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>
is a sequential neighborhood of <!--l. 153--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>.
</p><!--l. 155--><p class="indent">(3) the sequential spaces are the <!--l. 155--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>-spaces.
</p>
</div>
<div class="newtheorem">
<!--l. 158--><p class="noindent"><span class="head">
<a 
 id="x1-2003r3"></a>
<span 
class="cmbx-12">De&#xFB01;nition 2.3.</span>  </span>Let <!--l. 158--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
be a cover of a space <!--l. 158--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>.
</p><!--l. 160--><p class="indent">(1) <!--l. 160--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
is called a <!--l. 160--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>-network
of <!--l. 160--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
<span class="cite">[<a 
href="#XO">27</a>]</span>, if whenever <!--l. 161--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>U</mi></math>
with <!--l. 161--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math>
compact in <!--l. 161--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
and <!--l. 161--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>
open in <!--l. 161--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>,
there is a &#xFB01;nite <!--l. 162--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">&#x2131;</mi><mo 
class="MathClass-rel">&#x2282;</mo><mi 
mathvariant="script">P</mi></math>
such that <!--l. 162--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi> <mo 
class="MathClass-rel">&#x2282;</mo><mo 
class="MathClass-op">&#x22C3;</mo>
  <!--nolimits--><mi 
mathvariant="script">&#x2131;</mi><mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>U</mi></math>.
</p><!--l. 164--><p class="indent">(2) <!--l. 164--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
is called a <!--l. 164--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><msup><mrow 
><mi 
>s</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2217;</mo></mrow></msup 
></math>-network
of <!--l. 164--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
<span class="cite">[<a 
href="#XGao">10</a>]</span>, if each convergent sequence <!--l. 165--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>
converging to a point <!--l. 165--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>U</mi></math>
with <!--l. 165--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>
open in <!--l. 165--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>,
then <!--l. 166--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>
is frequently in <!--l. 166--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>U</mi></math>
for some <!--l. 166--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">P</mi></math>.
</p><!--l. 168--><p class="indent">(3) <!--l. 168--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
is called a <!--l. 168--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>s</mi></math>-network
of <!--l. 168--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>

<span class="cite">[<a 
href="#XGu">15</a>]</span>, if each convergent sequence <!--l. 169--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>
converging to a point <!--l. 169--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>U</mi></math>
with <!--l. 169--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>
open in <!--l. 169--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>,
then <!--l. 170--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>
is eventually in <!--l. 170--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>U</mi></math>
for some <!--l. 170--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">P</mi></math>.
</p>
</div>
<div class="newtheorem">
<!--l. 173--><p class="noindent"><span class="head">
<a 
 id="x1-2004r4"></a>
<span 
class="cmbx-12">De&#xFB01;nition 2.4.</span>  </span>Let <!--l. 173--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi> <mo 
class="MathClass-rel">=</mo><mo 
class="MathClass-op"> &#x22C3;</mo>
  <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
be a cover of a space <!--l. 173--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>,
such that for each <!--l. 174--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>,
the following conditions (a) and (b) are satis&#xFB01;ed.
</p><!--l. 176--><p class="indent">(a) <!--l. 176--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>
is a network at <!--l. 176--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>
in <!--l. 176--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
</p><!--l. 178--><p class="indent">(b) If <!--l. 178--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi><mo 
class="MathClass-punc">,</mo><mi 
>V</mi> <mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>,
then <!--l. 178--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>W</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>U</mi><mo 
class="MathClass-op">&#x22C2;</mo>
<!--nolimits--><mi 
>V</mi> </math>
for some <!--l. 178--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>W</mi> <mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>.
</p><!--l. 180--><p class="indent">(1) <!--l. 180--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
is called a weak-base of <!--l. 180--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span class="cite">[<a 
href="#XA">1</a>]</span>, if for <!--l. 180--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>G</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>X</mi></math>,
<!--l. 181--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>G</mi></math>
is open in <!--l. 181--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
if and only if for each <!--l. 181--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>G</mi></math>
there is <!--l. 181--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>
such that <!--l. 182--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>G</mi></math>,
where <!--l. 182--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>
is called a weak neighborhood base at <!--l. 182--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>
in <!--l. 182--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
</p><!--l. 184--><p class="indent">(2) <!--l. 184--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
is called an <!--l. 184--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
of <!--l. 184--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
<span class="cite">[<a 
href="#XG">11</a>]</span>, if each element of <!--l. 184--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>
is a sequential neighborhood of <!--l. 185--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>

for each <!--l. 185--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>,
where <!--l. 186--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>
is called an <!--l. 186--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
at <!--l. 186--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>x</mi></math>
in <!--l. 186--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
</p>
</div>
<div class="newtheorem">
<!--l. 189--><p class="noindent"><span class="head">
<a 
 id="x1-2005r5"></a>
<span 
class="cmti-12">Remark </span>2.5<span 
class="cmti-12">.</span>  </span><span class="cite">[<a 
href="#XLY">23</a>]</span>. (1) weak-bases <!--l. 189--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
<!--l. 189--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-networks
<!--l. 189--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
<!--l. 190--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>s</mi></math>-networks
<!--l. 190--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
<!--l. 190--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><msup><mrow 
><mi 
>s</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2217;</mo> </mrow> </msup 
> </math>-networks.
</p><!--l. 192--><p class="indent">(2) In a sequential space, weak-bases <!--l. 192--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D4;</mo></math>
<!--l. 192--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-networks.
</p><!--l. 194--><p class="indent">(3) <!--l. 194--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-networks
are called universal <!--l. 194--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>s</mi></math>-networks
in <span class="cite">[<a 
href="#XL">20</a>]</span>.
</p>
</div>
<div class="newtheorem">
<!--l. 197--><p class="noindent"><span class="head">
<a 
 id="x1-2006r6"></a>
<span 
class="cmti-12">Example </span>2.6<span 
class="cmti-12">.</span>  </span>In a <!--l. 197--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>-space,
<!--l. 197--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-networks<!--l. 197--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x0338;x&#x21D2;</mo></math>
weak-bases.
</p>
</div>
<div class="proof">
<!--l. 199--><p class="indent"><span class="head">

<span 
class="cmti-12">Proof.</span> </span>Let <!--l. 199--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
be the <!--l. 199--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi><mi 
>t</mi><mi 
>o</mi><mi 
>n</mi><mi 
>e</mi></math>-<!--l. 199--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="true"><mrow 
><mi 
>C</mi></mrow><mo 
class="MathClass-op">&#x0306;</mo></mover><mi 
>e</mi><mi 
>c</mi><mi 
>h</mi></math>
compacti&#xFB01;cation <!--l. 199--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B2;</mi><mi mathvariant="double-struck">&#x2115;</mi></math>
of <!--l. 199--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi mathvariant="double-struck">&#x2115;</mi></math>.
Then <!--l. 200--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is compact, and so it is a <!--l. 200--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>-space.
Since each convergent sequence in <!--l. 201--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B2;</mi><mi mathvariant="double-struck">&#x2115;</mi></math>
is trivial, <!--l. 202--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">}</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is an <!--l. 202--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
of <!--l. 202--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
It is clear that <!--l. 203--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
is not a weak-base of <!--l. 203--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>.
<span class="qed"><span 
class="msam-10x-x-120">&#x25A1;</span></span>
</p>
</div>
<div class="newtheorem">
<!--l. 206--><p class="noindent"><span class="head">
<a 
 id="x1-2007r7"></a>
<span 
class="cmbx-12">De&#xFB01;nition 2.7.</span>  </span>(1) A space <!--l. 206--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is called <!--l. 206--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>g</mi></math>-metrizable
<span class="cite">[<a 
href="#XF">8</a>]</span> (respectively <!--l. 207--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-metrizable
<span class="cite">[<a 
href="#XG1">12</a>]</span>, <!--l. 207--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x2135;</mi></math>
<span class="cite">[<a 
href="#XO">27</a>]</span>) if <!--l. 208--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
has a <!--l. 208--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math>-locally
&#xFB01;nite weak-base (respectively <!--l. 208--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network,
<!--l. 208--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>-network).
</p><!--l. 210--><p class="indent">(2) A space <!--l. 210--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is called <!--l. 210--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>g</mi></math>-second
countable <span class="cite">[<a 
href="#XS">29</a>]</span> (respectively <!--l. 211--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-second
countable <span class="cite">[<a 
href="#XG2">13</a>]</span>, <!--l. 212--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2135;</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math>
<span class="cite">[<a 
href="#XM">26</a>]</span>) if <!--l. 212--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
has a countable weak-base (respectively <!--l. 212--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network,
<!--l. 212--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>-network).
</p><!--l. 214--><p class="indent">(3) A space <!--l. 214--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is called <!--l. 214--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>g</mi></math>-&#xFB01;rst
countable <span class="cite">[<a 
href="#XA">1</a>]</span> (respectively <!--l. 215--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-&#xFB01;rst
countable <span class="cite">[<a 
href="#XG1">12</a>]</span>), if there is a countable weak neighborhood base (respectively
<!--l. 216--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network)

at <!--l. 216--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>x</mi></math>
in <!--l. 216--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
for each <!--l. 217--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>.
</p>
</div>
<div class="newtheorem">
<!--l. 220--><p class="noindent"><span class="head">
<a 
 id="x1-2008r8"></a>
<span 
class="cmti-12">Remark </span>2.8<span 
class="cmti-12">.</span>  </span>(1) <!--l. 220--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>g</mi></math>-&#xFB01;rst
countable <!--l. 220--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D4;</mo></math>
sequential and <!--l. 220--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-&#xFB01;rst
countable.
</p><!--l. 222--><p class="indent">(2) If <!--l. 222--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
has a point countable weak-base (respectively <!--l. 222--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network),
then <!--l. 223--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is <!--l. 223--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>g</mi></math>-&#xFB01;rst
countable (respectively <!--l. 223--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-&#xFB01;rst
countable). So each <!--l. 224--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>g</mi></math>-metrizable
(respectively <!--l. 224--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-metrizable)
space is <!--l. 225--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>g</mi></math>-&#xFB01;rst
countable (respectively <!--l. 225--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-&#xFB01;rst
countable).
</p><!--l. 227--><p class="indent">(3) <!--l. 227--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>g</mi></math>-metrizable
(respectively <!--l. 227--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>g</mi></math>-second
countable) <!--l. 227--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D4;</mo></math>
<!--l. 228--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>-
and <!--l. 228--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-metrizable
(respectively <!--l. 228--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>-
and <!--l. 228--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-second
countable).
</p><!--l. 230--><p class="indent">(4) <!--l. 230--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is an <!--l. 230--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2135;</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math>-space
<!--l. 230--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D4;</mo></math>
<!--l. 230--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
has a countable <!--l. 230--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>s</mi></math>-network
<!--l. 231--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D4;</mo></math>
<!--l. 231--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
has a countable <!--l. 231--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><msup><mrow 
><mi 
>s</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2217;</mo></mrow></msup 
></math>-network.

</p><!--l. 233--><p class="indent">(5) <!--l. 233--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-&#xFB01;rst
countable is called universally <!--l. 233--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>s</mi><mi 
>f</mi></math>-countable
in <span class="cite">[<a 
href="#XL">20</a>]</span>.
</p>
</div>
<!--l. 236--><p class="noindent">The following lemma is obtained by combining <span class="cite">[<a 
href="#XL2">19</a>, Theorem 2.8.6]</span> and <span class="cite">[<a 
href="#XL1">22</a>,
Corollary 5.1.13]</span>.
</p>
<div class="newtheorem">
<!--l. 239--><p class="noindent"><span class="head">
<a 
 id="x1-2009r9"></a>
<span 
class="cmbx-12">Lemma 2.9.</span>  </span><span 
class="cmti-12">The following are equivalent for a space </span><!--l. 239--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math><span 
class="cmti-12">.</span>
</p><!--l. 241--><p class="indent">(1) <!--l. 241--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">has a locally countable </span><!--l. 241--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>s</mi></math><span 
class="cmti-12">-network.</span>
</p><!--l. 243--><p class="indent">(2) <!--l. 243--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">has a locally countable </span><!--l. 243--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><msup><mrow 
><mi 
>s</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2217;</mo></mrow></msup 
></math><span 
class="cmti-12">-network.</span>
</p><!--l. 245--><p class="indent">(3) <!--l. 245--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">has a locally countable </span><!--l. 245--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math><span 
class="cmti-12">-network.</span>
</p>
</div>
<!--l. 248--><p class="indent">Now we give some set-theoretical axioms.
</p>
<div class="newtheorem">
<!--l. 250--><p class="noindent"><span class="head">
<a 
 id="x1-2010r10"></a>
<span 
class="cmti-12">Set-Theoretical Axioms </span>2.10<span 
class="cmti-12">.</span>  </span>&#x00A0;
</p><!--l. 252--><p class="indent">(1) <!--l. 252--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>C</mi><mi 
>H</mi></math>
(Continuum Hypothesis): <!--l. 252--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mn>2</mn></mrow><mrow 
><mi 
>&#x03C9;</mi></mrow></msup 
> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>&#x03C9;</mi></mrow><mrow 
>
<mn>1</mn></mrow></msub 
></math>.
</p><!--l. 254--><p class="indent">(2)
<!--l. 254--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>M</mi><mi 
>A</mi></math>
(Martin&#x2019;s                                  Axiom):                                  Let
<!--l. 254--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>
be a cardinal.
</p><!--l. 256--><p class="indent">(i) A space <!--l. 256--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is called <!--l. 256--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>k</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></math>-Baire
if for each family <!--l. 257--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>G</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>A</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>

consisting of open dense subsets of <!--l. 257--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>,
<!--l. 258--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-op">&#x22C2;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>G</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>A</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>&#x2205;</mi></math>,
where <!--l. 258--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x2223;</mo><mi 
>A</mi><mo 
class="MathClass-rel">&#x2223;</mo> <mo 
class="MathClass-rel">&#x003C;</mo> <msup><mrow 
><mi 
>k</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></math>.
</p><!--l. 260--><p class="indent">(ii)                                       A                                       space
<!--l. 260--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is                                                                                     called
<!--l. 260--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>c</mi><mi 
>c</mi></math>
if each    disjoint    family    consisting    of    open    subsets    of
<!--l. 261--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is countable.
</p><!--l. 263--><p class="indent">(iii) <!--l. 263--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>M</mi><mi 
>A</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>k</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>:
Each compact, <!--l. 263--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>c</mi><mi 
>c</mi></math>
space is <!--l. 263--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>k</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></math>-Baire.
</p><!--l. 265--><p class="indent">(iv) <!--l. 265--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>M</mi><mi 
>A</mi></math>:
For each <!--l. 265--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>,
<!--l. 265--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>M</mi><mi 
>A</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>k</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
holds, where <!--l. 265--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C9;</mi> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>k</mi> <mo 
class="MathClass-rel">&#x003C;</mo> <msup><mrow 
><mn>2</mn></mrow><mrow 
><mi 
>&#x03C9;</mi></mrow></msup 
></math>.
</p><!--l. 267--><p class="indent">(3)
<!--l. 267--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>T</mi> <mi 
>O</mi><mi 
>P</mi></math>
(Thinning-out                             Principle):                             Let
<!--l. 267--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>P</mi><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-rel">&#x2264;</mo></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
be a partial ordered set.
</p><!--l. 269--><p class="indent">(i) <!--l. 269--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Q</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>P</mi></math>
is called centered if whenever &#xFB01;nite <!--l. 269--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>Q</mi></math>,
there is <!--l. 270--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>p</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>P</mi></math>
such that <!--l. 270--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>p</mi> <mo 
class="MathClass-rel">&#x2264;</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>i</mi></mrow></msub 
></math>
for all <!--l. 270--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>i</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo> <mn>2</mn><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></math>.
</p><!--l. 272--><p class="indent">(ii) A family <!--l. 272--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x003C;</mo> <msub><mrow 
><mi 
>&#x03C9;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is called co&#xFB01;nally centered on a set <!--l. 272--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>A</mi></math>
if for each uncountable <!--l. 273--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>C</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>A</mi></math>
there is an <!--l. 273--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x003C;</mo> <msub><mrow 
><mi 
>&#x03C9;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></math>,
such that <!--l. 274--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>&#x03B2;</mi></mrow></msub 
><mo 
class="MathClass-op"> &#x22C2;</mo>
<!--nolimits--><mi 
>C</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>&#x03B2;</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>&#x03B1;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is centered.
</p><!--l. 276--><p class="indent">(iii) <!--l. 276--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>T</mi><mi 
>O</mi><mi 
>P</mi></math>:
If <!--l. 276--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>Z</mi><mo 
class="MathClass-punc">,</mo><mi 
>B</mi></math>
are uncountable subsets of <!--l. 276--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03C9;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></math>
and <!--l. 276--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>S</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>B</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is a family co&#xFB01;nally centered on <!--l. 277--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Z</mi></math>
with each <!--l. 277--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>S</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>&#x03B1;</mi></math>,
then there is an uncountable <!--l. 278--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>Z</mi></math>

such that <!--l. 278--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>Y</mi> <mo 
class="MathClass-op">&#x22C2;</mo>
<!--nolimits--><mi 
>&#x03B1;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>S</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
></math>
is &#xFB01;nite for all <!--l. 279--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>B</mi></math>.
</p>
</div>
<!--l. 282--><p class="indent">Recall a space is an <!--l. 282--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>-space
if it is hereditarily separable and not hereditarily
<!--l. 283--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>.
</p>
<div class="newtheorem">
<!--l. 285--><p class="noindent"><span class="head">
<a 
 id="x1-2011r11"></a>
<span 
class="cmbx-12">Lemma 2.11.</span>  </span><span class="cite">[<a 
href="#XR">28</a>, Theorem 7.2.3]</span><span 
class="cmti-12">. Under </span><!--l. 285--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>M</mi><mi 
>A</mi> <mo 
class="MathClass-bin">+</mo> <mo 
class="MathClass-op">&#x00AC;</mo><mi 
>C</mi><mi 
>H</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>T</mi><mi 
>O</mi><mi 
>P</mi></math><span 
class="cmti-12">,</span>
<span 
class="cmti-12">there are no </span><!--l. 285--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math><span 
class="cmti-12">-spaces.</span>
</p>
</div>
<div class="newtheorem">
<!--l. 288--><p class="noindent"><span class="head">
<a 
 id="x1-2012r12"></a>
<span 
class="cmbx-12">Theorem 2.12.</span>  </span><span 
class="cmti-12">Under </span><!--l. 288--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>M</mi><mi 
>A</mi> <mo 
class="MathClass-bin">+</mo> <mo 
class="MathClass-op">&#x00AC;</mo><mi 
>C</mi><mi 
>H</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>T</mi><mi 
>O</mi><mi 
>P</mi></math><span 
class="cmti-12">,</span>
<span 
class="cmti-12">the following are equivalent for a space </span><!--l. 288--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math><span 
class="cmti-12">.</span>
</p><!--l. 290--><p class="indent">(1) <!--l. 290--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">has a locally countable </span><!--l. 290--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network.</span>
</p><!--l. 292--><p class="indent">(2) <!--l. 292--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">is an </span><!--l. 292--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-&#xFB01;rst</span>
<span 
class="cmti-12">countable space with a locally countable </span><!--l. 292--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>s</mi></math><span 
class="cmti-12">-network</span>
(<span 
class="cmti-12">respectively </span><!--l. 293--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math><span 
class="cmti-12">-network,</span>
<!--l. 293--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><msup><mrow 
><mi 
>s</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2217;</mo> </mrow> </msup 
> </math><span 
class="cmti-12">-network</span>)<span 
class="cmti-12">.</span>
</p><!--l. 295--><p class="indent">(3) <!--l. 295--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">is a locally </span><!--l. 295--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-second</span>
<span 
class="cmti-12">countable space with a </span><!--l. 296--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math><span 
class="cmti-12">-locally</span>
<span 
class="cmti-12">countable </span><!--l. 296--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network</span>
</p><!--l. 298--><p class="indent">(4) <!--l. 298--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">is a locally </span><!--l. 298--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2135;</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math><span 
class="cmti-12">-space</span>
<span 
class="cmti-12">with a </span><!--l. 298--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math><span 
class="cmti-12">-locally</span>
<span 
class="cmti-12">countable </span><!--l. 298--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network.</span>
</p><!--l. 300--><p class="indent">(5) <!--l. 300--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>

<span 
class="cmti-12">is a locally hereditarily separable space with a </span><!--l. 301--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math><span 
class="cmti-12">-locally</span>
<span 
class="cmti-12">countable </span><!--l. 301--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network.</span>
</p><!--l. 303--><p class="indent">(6) <!--l. 303--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">is a locally (hereditarily) </span><!--l. 303--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>
<span 
class="cmti-12">space with a </span><!--l. 304--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math><span 
class="cmti-12">-locally</span>
<span 
class="cmti-12">countable </span><!--l. 304--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network.</span>
</p>
</div>
<div class="proof">
<!--l. 306--><p class="indent"><span class="head">
<span 
class="cmti-12">Proof.</span> </span>(1) <!--l. 306--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
(2). Note that a space with a locally countable <!--l. 307--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
is <!--l. 307--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>s</mi><mi 
>n</mi></math>-&#xFB01;rst
countable. So (1) <!--l. 308--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
(2) by Remark 2.5(1) and Lemma 2.9.
</p><!--l. 310--><p class="indent">(2) <!--l. 310--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
(1). By Lemma 2.9, let <!--l. 311--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
be a locally countable <!--l. 311--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>s</mi></math>-network
of <!--l. 311--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
We can assume that <!--l. 312--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
is closed under &#xFB01;nite intersections. For each <!--l. 313--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>,
let <!--l. 313--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
be a countable <!--l. 313--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
at <!--l. 313--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>x</mi></math>
in <!--l. 313--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>,
and let <!--l. 314--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">P</mi> <mo 
class="MathClass-punc">:</mo> <msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>P</mi><mspace class="nbsp" /><mi 
>f</mi><mi 
>o</mi><mi 
>r</mi><mspace class="nbsp" /><mi 
>s</mi><mi 
>o</mi><mi 
>m</mi><mi 
>e</mi><mspace class="nbsp" /><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
Then each element of <!--l. 314--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>
is a sequential neighborhood of <!--l. 315--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>.
Put <!--l. 315--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msup 
> <mo 
class="MathClass-rel">=</mo><mo 
class="MathClass-op"> &#x22C3;</mo><!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
>
<mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>,
then <!--l. 316--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msup 
> <mo 
class="MathClass-rel">&#x2282;</mo><mi 
mathvariant="script">P</mi></math>
is locally countable. It suffices to prove that <!--l. 317--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>
is a network at <!--l. 317--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>
in <!--l. 317--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
for each <!--l. 317--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>.
If not, there is an open neighborhood <!--l. 318--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>
of <!--l. 318--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>x</mi></math>
such that <!--l. 319--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi><mo 
class="MathClass-rel">&#x2284;</mo><mi 
>U</mi></math>

for each <!--l. 319--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>.
Let <!--l. 320--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">P</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>P</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>U</mi></mrow><mo 
class="MathClass-close">}</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>m</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>m</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
Then <!--l. 321--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-rel">&#x2284;</mo><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>m</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
for each <!--l. 321--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><mi 
>m</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>.
Choose <!--l. 322--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><mi 
>m</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>m</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
For <!--l. 322--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>m</mi></math>,
let <!--l. 322--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><mi 
>m</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></math>,
where <!--l. 322--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>m</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>n</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></math>.
Then the sequence <!--l. 323--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>k</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
converges to <!--l. 323--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>.
Thus , there is <!--l. 324--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>m</mi><mo 
class="MathClass-punc">,</mo><mi 
>i</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>
such that <!--l. 324--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>k</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>i</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-rel">&#x2282;</mo> <msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>m</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>U</mi></math>.
Take <!--l. 325--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>j</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>i</mi></math>
with <!--l. 325--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mi 
>j</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><mi 
>m</mi></mrow></msub 
></math>
for some <!--l. 325--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>m</mi></math>.
Then <!--l. 325--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><mi 
>m</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>m</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
This is a contradiction.
</p><!--l. 328--><p class="indent">(1) <!--l. 328--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
(3). Let <!--l. 328--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
be a locally countable <!--l. 328--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
of <!--l. 328--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
For each <!--l. 329--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>,
there is an open neighborhood <!--l. 329--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>
of <!--l. 329--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>x</mi></math>
such that <!--l. 330--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>U</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>P</mi><mo 
class="MathClass-op">&#x22C2;</mo>
<!--nolimits--><mi 
>U</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is countable. It is easy to prove that <!--l. 330--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>U</mi></mrow></msub 
></math>
is a countable <!--l. 331--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
of subspace <!--l. 331--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>.
So <!--l. 331--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>U</mi></math>
is an <!--l. 331--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-second
countable space. Thus <!--l. 332--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is a locally <!--l. 332--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-second
countable space.
</p><!--l. 334--><p class="indent">(3) <!--l. 334--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
(4) <!--l. 334--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
(5). It is known that <!--l. 334--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-second
countable <!--l. 335--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
<!--l. 335--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2135;</mi></mrow><mrow 
><mn>0</mn> </mrow> </msub 
> </math>
<!--l. 335--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
hereditarily separable. So (3) <!--l. 336--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>

(4) <!--l. 336--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
(5).
</p><!--l. 338--><p class="indent">(5) <!--l. 338--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
(6). It suffices to prove that <!--l. 339--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is locally hereditarily <!--l. 339--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>.
Let <!--l. 340--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>
and <!--l. 340--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>
be a hereditarily separable neighborhood of <!--l. 340--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>.
By Lemma 2.11, <!--l. 341--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>
is hereditarily <!--l. 341--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>.
So <!--l. 342--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
is locally hereditarily <!--l. 342--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>.
</p><!--l. 344--><p class="indent">(6) <!--l. 344--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
(1). Let <!--l. 345--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi> <mo 
class="MathClass-rel">=</mo><mo 
class="MathClass-op"> &#x22C3;</mo>
  <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
be a <!--l. 345--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math>-locally
countable <!--l. 345--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
of a Locally <!--l. 346--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>
space <!--l. 346--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>,
where each <!--l. 346--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math>
is locally countable in <!--l. 346--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>.
Let <!--l. 347--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>
and let <!--l. 347--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>
be a <!--l. 347--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>
neighborhood of <!--l. 347--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>.
Let <!--l. 348--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>.
For each <!--l. 348--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>U</mi></math>,
there is an open neighborhood <!--l. 348--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
></math>
of <!--l. 349--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>y</mi></math>
such that <!--l. 349--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
></math>
intersects at most countable many elements of <!--l. 349--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math>.
The open cover <!--l. 350--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>U</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
of <!--l. 350--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>U</mi></math>
has countable subcover <!--l. 350--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">V</mi></math>.
Put <!--l. 350--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>V</mi> <mo 
class="MathClass-rel">=</mo><mo 
class="MathClass-op"> &#x22C3;</mo>
  <!--nolimits--><mi 
mathvariant="script">V</mi></math>,
then <!--l. 351--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>V</mi> </math>
and <!--l. 351--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>V</mi> </math>
intersects at most countable many elements of <!--l. 351--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math>.
So <!--l. 352--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>U</mi></math>
intersects at most countable many elements of <!--l. 352--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math>.
Moreover, <!--l. 353--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>

intersects at most countable many elements of <!--l. 353--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>.
Thus <!--l. 354--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
is a locally countable <!--l. 354--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
of <!--l. 354--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
<span class="qed"><span 
class="msam-10x-x-120">&#x25A1;</span></span>
</p>
</div>
<div class="newtheorem">
<!--l. 357--><p class="noindent"><span class="head">
<a 
 id="x1-2013r13"></a>
<span 
class="cmti-12">Remark </span>2.13<span 
class="cmti-12">.</span>  </span>In                 Theorem                 2.12,                 (1)
<!--l. 357--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D4;</mo></math>
(2)
<!--l. 357--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D4;</mo></math>
(3)
<!--l. 358--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D4;</mo></math>
(4)
<!--l. 358--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D4;</mo></math>
(6)                                  without                                  requiring
<!--l. 359--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>M</mi><mi 
>A</mi> <mo 
class="MathClass-bin">+</mo> <mo 
class="MathClass-op">&#x00AC;</mo><mi 
>C</mi><mi 
>H</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>T</mi><mi 
>O</mi><mi 
>P</mi></math>
involved. The reasons are as follows.
</p><!--l. 361--><p class="indent">(a)
<!--l. 361--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>M</mi><mi 
>A</mi> <mo 
class="MathClass-bin">+</mo> <mo 
class="MathClass-op">&#x00AC;</mo><mi 
>C</mi><mi 
>H</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>T</mi><mi 
>O</mi><mi 
>P</mi></math>
are        used        only        in        the        proof        of        (5)
<!--l. 361--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
(6).
</p><!--l. 363--><p class="indent">(b) Because each <!--l. 363--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2135;</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math>-space
is hereditarily <!--l. 363--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>,
(4) <!--l. 364--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
(6) without requiring <!--l. 364--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>M</mi><mi 
>A</mi> <mo 
class="MathClass-bin">+</mo> <mo 
class="MathClass-op">&#x00AC;</mo><mi 
>C</mi><mi 
>H</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>T</mi><mi 
>O</mi><mi 
>P</mi></math>
involved.
</p>
</div>
<!--l. 367--><p class="indent">It is natural to ask whether &#x201C;<!--l. 367--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>M</mi><mi 
>A</mi> <mo 
class="MathClass-bin">+</mo> <mo 
class="MathClass-op">&#x00AC;</mo><mi 
>C</mi><mi 
>H</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>T</mi><mi 
>O</mi><mi 
>P</mi></math>&#x201D;
in Theorem 2.12 can be omitted. The following Theorem 2.16 shows that the answer
is &#x201C;yes&#x201D; if <!--l. 368--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is a <!--l. 368--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>-space.
</p>

<div class="newtheorem">
<!--l. 370--><p class="noindent"><span class="head">
<a 
 id="x1-2014r14"></a>
<span 
class="cmbx-12">Lemma 2.14.</span>  </span><span class="cite">[<a 
href="#XGMT">14</a>,&#x00A0;<a 
href="#XL1">22</a>]</span><span 
class="cmti-12">. The following hold for a space </span><!--l. 370--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math><span 
class="cmti-12">.</span>
</p><!--l. 372--><p class="indent">(1) <span 
class="cmti-12">If </span><!--l. 372--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">is a compact space with a point countable </span><!--l. 372--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math><span 
class="cmti-12">-network,</span>
<span 
class="cmti-12">then </span><!--l. 372--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">is metrizable.</span>
</p><!--l. 374--><p class="indent">(2) <span 
class="cmti-12">If </span><!--l. 374--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">is a </span><!--l. 374--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math><span 
class="cmti-12">-space</span>
<span 
class="cmti-12">with a point countable </span><!--l. 374--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math><span 
class="cmti-12">-network,</span>
<span 
class="cmti-12">then </span><!--l. 374--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">is sequential.</span>
</p><!--l. 376--><p class="indent">(3) <span 
class="cmti-12">If </span><!--l. 376--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">has a point countable </span><!--l. 376--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><msup><mrow 
><mi 
>s</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2217;</mo></mrow></msup 
></math><span 
class="cmti-12">-network</span>
<span 
class="cmti-12">and each compact subset of </span><!--l. 377--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">is metrizable, then </span><!--l. 378--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">has a point countable </span><!--l. 378--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math><span 
class="cmti-12">-network.</span>
</p>
</div>
<div class="newtheorem">
<!--l. 381--><p class="noindent"><span class="head">
<a 
 id="x1-2015r15"></a>
<span 
class="cmbx-12">Lemma 2.15.</span>  </span><span 
class="cmti-12">If </span><!--l. 381--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">is a </span><!--l. 381--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math><span 
class="cmti-12">-space</span>
<span 
class="cmti-12">with a </span><!--l. 381--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math><span 
class="cmti-12">-locally</span>
<span 
class="cmti-12">countable </span><!--l. 381--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><msup><mrow 
><mi 
>s</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2217;</mo></mrow></msup 
></math><span 
class="cmti-12">-network,</span>
<span 
class="cmti-12">then </span><!--l. 382--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">is sequential.</span>
</p>
</div>
<div class="proof">
<!--l. 384--><p class="indent"><span class="head">
<span 
class="cmti-12">Proof.</span> </span>Let <!--l. 384--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>

be a <!--l. 384--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math>-locally
countable <!--l. 384--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><msup><mrow 
><mi 
>s</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2217;</mo></mrow></msup 
></math>-network
of <!--l. 384--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
Whenever <!--l. 385--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math>
is a compact subset of <!--l. 385--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>,
put <!--l. 385--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>K</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>P</mi><mo 
class="MathClass-op">&#x22C2;</mo>
<!--nolimits--><mi 
>K</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>,
then <!--l. 386--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>K</mi></mrow></msub 
></math>
is a <!--l. 386--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math>-locally
countable <!--l. 386--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><msup><mrow 
><mi 
>s</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2217;</mo></mrow></msup 
></math>-network
of <!--l. 386--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>K</mi></math>.
It is easy to see that <!--l. 387--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>K</mi></mrow></msub 
></math>
is a countable <!--l. 387--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><msup><mrow 
><mi 
>s</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2217;</mo></mrow></msup 
></math>-network
of <!--l. 387--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>K</mi></math>,
and so <!--l. 388--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math>
has a countable <!--l. 388--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>-network
by Remark 2.8(4). By Lemma 2.14(1), <!--l. 389--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math>
is metrizable. So <!--l. 390--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
has a point-countable <!--l. 390--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>-network
by Remark 2.14(3), thus <!--l. 391--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is sequential by Remark 2.14(2). <span class="qed"><span 
class="msam-10x-x-120">&#x25A1;</span></span>
</p>
</div>
<div class="newtheorem">
<!--l. 394--><p class="noindent"><span class="head">
<a 
 id="x1-2016r16"></a>
<span 
class="cmbx-12">Theorem 2.16.</span>  </span><span 
class="cmti-12">The following are equivalent for a </span><!--l. 394--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math><span 
class="cmti-12">-space</span>
<!--l. 394--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math><span 
class="cmti-12">.</span>
</p><!--l. 396--><p class="indent">(1) <!--l. 396--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">has a locally countable </span><!--l. 396--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network.</span>
</p><!--l. 398--><p class="indent">(2) <!--l. 398--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">is a topological sum of </span><!--l. 398--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-second</span>
<span 
class="cmti-12">countable spaces.</span>
</p><!--l. 400--><p class="indent">(3) <!--l. 400--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">is an </span><!--l. 400--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-metrizable,</span>
<span 
class="cmti-12">locally (hereditarily) separable space.</span>
</p><!--l. 402--><p class="indent">(4) <!--l. 402--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">is a locally (hereditarily) separable space with a </span><!--l. 403--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math><span 
class="cmti-12">-locally</span>
<span 
class="cmti-12">countable </span><!--l. 403--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network.</span>

</p>
</div>
<div class="proof">
<!--l. 405--><p class="indent"><span class="head">
<span 
class="cmti-12">Proof.</span> </span>(1) <!--l. 405--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
(2). <!--l. 406--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is a <!--l. 406--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>-space
with a locally countable <!--l. 406--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>s</mi></math>-network,
so <!--l. 407--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
is a topological sum of <!--l. 407--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2135;</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math>-spaces(<span class="cite">[<a 
href="#XL3">17</a>,
Theorem 1]</span>). It is easy to see that <!--l. 408--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-&#xFB01;rst
countability is hereditary to subspace. Note that each <!--l. 409--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-&#xFB01;rst
countable, <!--l. 410--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2135;</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math>-space
is <!--l. 410--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>s</mi><mi 
>n</mi></math>-second
countable(<span class="cite">[<a 
href="#XG2">13</a>, Theorem 2.1]</span>). So <!--l. 411--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is a topological sum of <!--l. 411--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-second
countable spaces.
</p><!--l. 413--><p class="indent">(2) <!--l. 413--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
(3). Let <!--l. 413--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi> <mo 
class="MathClass-rel">=</mo> <mo 
class="MathClass-bin">&#x2295;</mo><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x039B;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>,
where each <!--l. 414--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
></math>
is <!--l. 414--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>s</mi><mi 
>n</mi></math>-second
countable. Note that each <!--l. 415--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
></math>
is a (hereditarily) separable, open subspace of <!--l. 415--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>,
So <!--l. 416--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
is locally (hereditarily) separable. For each <!--l. 416--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x039B;</mi></math>,
let <!--l. 417--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
be a countable <!--l. 417--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
of <!--l. 417--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
></math>.
Put <!--l. 418--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x039B;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
for each <!--l. 418--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>,
and put <!--l. 419--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi> <mo 
class="MathClass-rel">=</mo><mo 
class="MathClass-op"> &#x22C3;</mo>
  <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>,
then <!--l. 420--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
is a <!--l. 420--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math>-locally
&#xFB01;nite <!--l. 420--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
of <!--l. 420--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
So <!--l. 421--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
is an <!--l. 421--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-metrizable

space.
</p><!--l. 423--><p class="indent">(3)
<!--l. 423--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
(4). It is clear.
</p><!--l. 425--><p class="indent">(4) <!--l. 425--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
(1). By Remark 2.13, it suffices to prove that <!--l. 425--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is locally <!--l. 426--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>.
Let <!--l. 427--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
be a <!--l. 427--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math>-locally
countable <!--l. 427--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
of <!--l. 427--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
<!--l. 428--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is a sequential space by Lemma 2.15, so <!--l. 429--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
is a <!--l. 429--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math>-locally
countable <!--l. 429--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>-network
of <!--l. 429--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>(<span class="cite">[<a 
href="#XT">30</a>,
Corollary 1.5]</span>). Recalled a space is meta-<!--l. 430--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>
if each open cover of it has a point countable open re&#xFB01;nement. Thus
<!--l. 432--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is hereditarily meta-<!--l. 432--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>(<span class="cite">[<a 
href="#XL3">17</a>,
Proposition 1]</span>). Each hereditarily meta-<!--l. 433--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>,
locally separable space is locally <!--l. 434--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>(<span class="cite">[<a 
href="#XGMT">14</a>,
Proposition 8.7]</span>), so <!--l. 435--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is locally <!--l. 435--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>.
<span class="qed"><span 
class="msam-10x-x-120">&#x25A1;</span></span>
</p>
</div>
<!--l. 438--><p class="indent">C. Liu and M. Dai proved that a space
<!--l. 438--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math> has a
locally countable weak-base if and only if it is a topological sum of
<!--l. 439--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>g</mi></math>-second
countable spaces <span class="cite">[<a 
href="#XLiu">24</a>, Theorem 2.1]</span>. Combining Remark 2.8(3), we have the
following corollary.
</p>
<div class="newtheorem">
<!--l. 442--><p class="noindent"><span class="head">
<a 
 id="x1-2017r17"></a>
<span 
class="cmbx-12">Corollary 2.17.</span>  </span><span 
class="cmti-12">A space </span><!--l. 442--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>

<span 
class="cmti-12">is a </span><!--l. 442--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math><span 
class="cmti-12">-space</span>
<span 
class="cmti-12">with a locally countable </span><!--l. 442--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network</span>
<span 
class="cmti-12">if and only if </span><!--l. 443--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">has a locally countable weak-base.</span>
</p>
</div>
<!--l. 446--><p class="indent">The following examples to shows that
&#x201C;<!--l. 446--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>k</mi></math>&#x201D; in
Theorem 2.16 can not be omitted.
</p>
<div class="newtheorem">
<!--l. 448--><p class="noindent"><span class="head">
<a 
 id="x1-2018r18"></a>
<span 
class="cmti-12">Example </span>2.18<span 
class="cmti-12">.</span>  </span>There is a space with a locally countable <!--l. 448--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network,
which is not a topological sum of <!--l. 449--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2135;</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math>-spaces.
</p>
</div>
<div class="proof">
<!--l. 451--><p class="indent"><span class="head">
<span 
class="cmti-12">Proof.</span> </span>Let <!--l. 451--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>D</mi></math>
is a discrete space, where <!--l. 451--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x2223;</mo><mi 
>D</mi><mo 
class="MathClass-rel">&#x2223;</mo> <mo 
class="MathClass-rel">=</mo> <msup><mrow 
><mn>2</mn></mrow><mrow 
><mi 
>&#x03C9;</mi></mrow></msup 
></math>.
By <span class="cite">[<a 
href="#XBS">3</a>, Example 4.2]</span>, there is an almost disjoint family <!--l. 452--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x003C;</mo> <msup><mrow 
><mn>2</mn></mrow><mrow 
><mi 
>&#x03C9;</mi></mrow></msup 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
consisting of countable in&#xFB01;nite subsets of <!--l. 453--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>D</mi></math>
such that for each uncountable subset <!--l. 453--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi></math>
of <!--l. 453--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>D</mi></math>,
there is <!--l. 454--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x003C;</mo> <msup><mrow 
><mn>2</mn></mrow><mrow 
><mi 
>&#x03C9;</mi></mrow></msup 
></math>
such that <!--l. 454--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>P</mi></math>.
Let <!--l. 455--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
be a mutually disjoint family consisting of in&#xFB01;nite subsets of <!--l. 456--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
></math>.
For each <!--l. 457--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x003C;</mo> <msup><mrow 
><mn>2</mn></mrow><mrow 
><mi 
>&#x03C9;</mi></mrow></msup 
></math>
and each <!--l. 457--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>,
choose <!--l. 458--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>p</mi></mrow><mrow 
><mi 
>&#x03B1;</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo><mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></math>,
where <!--l. 459--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover></math>
is the closure of <!--l. 459--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></math>
in the <!--l. 460--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi><mi 
>t</mi><mi 
>o</mi><mi 
>n</mi><mi 
>e</mi></math>-<!--l. 460--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="true"><mrow 
><mi 
>C</mi></mrow><mo 
class="MathClass-op">&#x0306;</mo></mover><mi 
>e</mi><mi 
>c</mi><mi 
>h</mi></math>

compacti&#xFB01;cation <!--l. 460--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B2;</mi><mi 
>D</mi></math>
of <!--l. 460--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>D</mi></math>.
Put <!--l. 461--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>D</mi><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>p</mi></mrow><mrow 
><mi 
>&#x03B1;</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x003C;</mo> <msup><mrow 
><mn>2</mn></mrow><mrow 
><mi 
>&#x03C9;</mi></mrow></msup 
><mo 
class="MathClass-punc">,</mo><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>,
and <!--l. 462--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is endowed the subspace topology of <!--l. 462--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B2;</mi><mi 
>D</mi></math>.
</p><!--l. 464--><p class="indent">Claim 1. <!--l. 464--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
has a <!--l. 464--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math>-locally
countable <!--l. 464--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network.
</p><!--l. 466--><p class="indent">By <span class="cite">[<a 
href="#XL1">22</a>, Example 5.1.18(1)]</span>, <!--l. 466--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
has a <!--l. 466--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math>-locally
countable <!--l. 466--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>s</mi></math>-network
<!--l. 466--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>.
Note that each compact subset of <!--l. 467--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is &#xFB01;nite <span class="cite">[<a 
href="#XL1">22</a>, Example 1.5.5]</span>, so each convergent sequence of <!--l. 468--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is &#xFB01;nite. Thus we can assume that <!--l. 469--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
is closed under &#xFB01;nite intersections. It is easy to see that <!--l. 470--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
is an <!--l. 470--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
of <!--l. 470--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
So <!--l. 471--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
has a <!--l. 471--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math>-locally
countable <!--l. 471--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network.
</p><!--l. 473--><p class="indent">Claim 2. <!--l. 473--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is not a topological sum of <!--l. 473--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2135;</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math>-spaces
<span class="cite">[<a 
href="#XL1">22</a>, Example 5.1.18(1)]</span>. <span class="qed"><span 
class="msam-10x-x-120">&#x25A1;</span></span>
</p>
</div>
<div class="newtheorem">
<!--l. 476--><p class="noindent"><span class="head">
<a 
 id="x1-2019r19"></a>
<span 
class="cmti-12">Example </span>2.19<span 
class="cmti-12">.</span>  </span>There is a space with a locally countable <!--l. 476--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network,
which is not an <!--l. 477--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x2135;</mi></math>-spaces.
</p>
</div>
<div class="proof">
<!--l. 479--><p class="indent"><span class="head">

<span 
class="cmti-12">Proof.</span> </span>Let <!--l. 479--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>&#x03C9;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-op"> &#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03C9;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-bin">&#x00D7;</mo><mrow><mo 
class="MathClass-open">{</mo><mrow><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>n</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
De&#xFB01;ne a neighborhood base <!--l. 480--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x212C;</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>
for each <!--l. 480--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>
for the desired topology on <!--l. 481--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
as follows.
</p><!--l. 483--><p class="indent">(1) If <!--l. 483--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03C9;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></math>,
then <!--l. 483--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x212C;</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
</p><!--l. 485--><p class="indent">(2) If <!--l. 485--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>&#x03C9;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></math>,
then <!--l. 485--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x212C;</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
>    <mo 
class="MathClass-rel">=</mo>    <mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-op">&#x22C3;</mo>
 <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>V</mi> <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow>  <mo 
class="MathClass-bin">&#x00D7;</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>n</mi></mrow><mo 
class="MathClass-close">}</mo></mrow>  <mo 
class="MathClass-punc">:</mo>    <mi 
>n</mi>   <mo 
class="MathClass-rel">&#x2265;</mo>  <mi 
>m</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow>    <mo 
class="MathClass-punc">:</mo>    <mi 
>m</mi>   <mo 
class="MathClass-rel">&#x2208;</mo>
<mi mathvariant="double-struck">&#x2115;</mi><mspace class="nbsp" /><mi 
>a</mi><mi 
>n</mi><mi 
>d</mi><mspace class="nbsp" /><mi 
>V</mi> <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace class="nbsp" /><mi 
>i</mi><mi 
>s</mi><mspace class="nbsp" /><mi 
>a</mi><mspace class="nbsp" /><mi 
>n</mi><mi 
>e</mi><mi 
>i</mi><mi 
>g</mi><mi 
>h</mi><mi 
>b</mi><mi 
>o</mi><mi 
>r</mi><mi 
>h</mi><mi 
>o</mi><mi 
>o</mi><mi 
>d</mi><mspace class="nbsp" /><mi 
>o</mi><mi 
>f</mi><mspace class="nbsp" /><mi 
>x</mi><mspace class="nbsp" /><mi 
>i</mi><mi 
>n</mi><mspace class="nbsp" /><msub><mrow 
><mi 
>&#x03C9;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mspace class="nbsp" /><mi 
>w</mi><mi 
>i</mi><mi 
>t</mi><mi 
>h</mi><mspace class="nbsp" /><mi 
>t</mi><mi 
>h</mi><mi 
>e</mi><mspace class="nbsp" /><mi 
>o</mi><mi 
>r</mi><mi 
>d</mi><mi 
>e</mi><mi 
>r</mi><mspace class="nbsp" /><mi 
>t</mi><mi 
>o</mi><mi 
>p</mi><mi 
>o</mi><mi 
>l</mi><mi 
>o</mi><mi 
>g</mi><mi 
>y</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
</p><!--l. 489--><p class="indent">By <span class="cite">[<a 
href="#XL3">17</a>, Example 1]</span>, <!--l. 489--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
has a locally countable <!--l. 489--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>-network,
which is not an <!--l. 490--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x2135;</mi></math>-space.
It suffices to prove that <!--l. 491--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is <!--l. 491--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>s</mi><mi 
>n</mi></math>-&#xFB01;rst
countable by Remark 2.13.
</p><!--l. 493--><p class="indent">Let <!--l. 493--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>.
If <!--l. 493--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03C9;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></math>,
then <!--l. 494--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is a countable <!--l. 494--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
at <!--l. 494--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>x</mi></math>
in <!--l. 494--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
If <!--l. 495--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>&#x03C9;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></math>,
put <!--l. 495--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>m</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>m</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>,
where <!--l. 496--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>m</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>m</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
Then <!--l. 497--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>
is a countable network at <!--l. 497--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>
in <!--l. 497--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
We only need to prove that each <!--l. 498--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>m</mi></mrow></msub 
></math>
is a sequential neighborhood of <!--l. 498--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>.
</p><!--l. 500--><p class="indent">Let <!--l. 500--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
be a sequence converging to <!--l. 500--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>.
Put <!--l. 500--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>,
then <!--l. 501--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math>
is a compact subset of <!--l. 501--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>.
By <span class="cite">[<a 
href="#XL3">17</a>, Example 1]</span>, we have the following facts.
</p><!--l. 503--><p class="indent">Fact                                                                                   1.
<!--l. 503--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi><mo 
class="MathClass-op"> &#x22C2;</mo>
<!--nolimits--><msub><mrow 
><mi 
>&#x03C9;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></math>
is &#xFB01;nite.
</p><!--l. 505--><p class="indent">Fact                                                                                   2.

<!--l. 505--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi> <mo 
class="MathClass-bin">&#x2212;</mo><mo 
class="MathClass-op">&#x22C3;</mo>
  <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi><mo 
class="MathClass-punc">,</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>K</mi><mo 
class="MathClass-op">&#x22C2;</mo>
 <!--nolimits--><msub><mrow 
><mi 
>&#x03C9;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is &#xFB01;nite.
</p><!--l. 507--><p class="indent">Case 1. If there is <!--l. 507--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>K</mi><mo 
class="MathClass-op">&#x22C2;</mo>
<!--nolimits--><msub><mrow 
><mi 
>&#x03C9;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></math>
such that <!--l. 508--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math>
for in&#xFB01;nite many <!--l. 508--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>,
i.e., there is a subsequence <!--l. 509--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
of <!--l. 509--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
such that <!--l. 509--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>x</mi></mrow><mrow 
><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></msub 
></math>
for each <!--l. 509--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>,
then <!--l. 510--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>x</mi></math>,
So <!--l. 510--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is frequently in <!--l. 510--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>m</mi></mrow></msub 
></math>.
</p><!--l. 512--><p class="indent">Case 2. If Case 1 does not hold, without loss of the generalization, we
may assume <!--l. 513--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi><mo 
class="MathClass-op">&#x22C2;</mo>
<!--nolimits--><msub><mrow 
><mi 
>&#x03C9;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
by Fact 1. By Fact 2, <!--l. 514--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi> <mo 
class="MathClass-bin">&#x2212;</mo><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is &#xFB01;nite. If there is <!--l. 515--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>K</mi> <mo 
class="MathClass-bin">&#x2212;</mo><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
such that <!--l. 516--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math>
for in&#xFB01;nite many <!--l. 516--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>,
then <!--l. 517--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is frequently in <!--l. 517--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>m</mi></mrow></msub 
></math>
by a similar way in the proof of Case 1. Conversely, there is <!--l. 518--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>
such that <!--l. 519--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-rel">&#x2282;</mo><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-op">&#x22C3;</mo>
 <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
So <!--l. 520--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is eventually in <!--l. 520--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>m</mi></mrow></msub 
></math>.
</p><!--l. 522--><p class="indent">By        the        above        Case        1        and        Case        2,
<!--l. 523--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi> </mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>m</mi></mrow></msub 
></math>
is              a              sequential              neighborhood              of
<!--l. 523--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>
by Remark 2.2(1). <span class="qed"><span 
class="msam-10x-x-120">&#x25A1;</span></span>
</p>
</div>
<!--l. 526--><p class="indent">Recalled a space <!--l. 526--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math> is
sequentially separable <span class="cite">[<a 
href="#XD">6</a>]</span> if <!--l. 526--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
has a countable subset <!--l. 526--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>D</mi></math>
such that for each <!--l. 527--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>,
there is a sequence <!--l. 527--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
in <!--l. 527--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>D</mi></math> converging
to <!--l. 527--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>x</mi></math>, where
<!--l. 528--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>D</mi></math> is a sequentially

dense subset of <!--l. 528--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>.
It is know that each sequentially separable space is separable.
</p>
<div class="newtheorem">
<!--l. 531--><p class="noindent"><span class="head">
<a 
 id="x1-2020r20"></a>
<span 
class="cmbx-12">Proposition 2.20.</span>  </span><span 
class="cmti-12">Let </span><!--l. 531--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">have a point countable </span><!--l. 531--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network</span>
<!--l. 531--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math><span 
class="cmti-12">.</span>
<span 
class="cmti-12">If </span><!--l. 532--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
<span 
class="cmti-12">is sequentially separable, then </span><!--l. 532--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
<span 
class="cmti-12">is countable. So </span><!--l. 533--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">is </span><!--l. 533--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-second</span>
<span 
class="cmti-12">countable.</span>
</p>
</div>
<div class="proof">
<!--l. 535--><p class="indent"><span class="head">
<span 
class="cmti-12">Proof.</span> </span>Let <!--l. 535--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>D</mi></math>
be a sequentially dense subset of <!--l. 535--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>,
and let <!--l. 536--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>,
where <!--l. 537--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>
is an <!--l. 537--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
at <!--l. 537--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>x</mi></math>
in <!--l. 537--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
for each <!--l. 537--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>.
For each <!--l. 538--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>D</mi></math>,
<!--l. 538--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>
is countable because <!--l. 538--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
is point countable, where <!--l. 539--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">P</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>P</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
Furthermore, <!--l. 540--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-op"> &#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>D</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is countable. For each <!--l. 541--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>
and <!--l. 541--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>,
there is a sequence <!--l. 541--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>
in <!--l. 541--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>D</mi></math>
converging to <!--l. 541--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>.

Note that <!--l. 542--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi></math>
is a sequential neighborhood of <!--l. 542--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>.
<!--l. 543--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>
is eventually in <!--l. 543--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi></math>,
and so <!--l. 543--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi><mo 
class="MathClass-op">&#x22C2;</mo>
<!--nolimits--><mi 
>D</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>&#x2205;</mi></math>.
This proves that each element of <!--l. 544--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
intersects with <!--l. 544--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>D</mi></math>,
thus <!--l. 545--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi> <mo 
class="MathClass-rel">=</mo><mo 
class="MathClass-op"> &#x22C3;</mo>
  <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>D</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
So <!--l. 545--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
mathvariant="script">P</mi></math>
is countable. <span class="qed"><span 
class="msam-10x-x-120">&#x25A1;</span></span>
</p>
</div>
<div class="newtheorem">
<!--l. 548--><p class="noindent"><span class="head">
<a 
 id="x1-2021r21"></a>
<span 
class="cmbx-12">Corollary 2.21.</span>  </span><span 
class="cmti-12">Let </span><!--l. 548--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">have a </span><!--l. 548--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math><span 
class="cmti-12">-locally</span>
<span 
class="cmti-12">countable </span>(<span 
class="cmti-12">or point countable</span>) <!--l. 549--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network</span>
<!--l. 549--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math><span 
class="cmti-12">.</span>
<span 
class="cmti-12">If </span><!--l. 550--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
<span 
class="cmti-12">is locally sequentially separable, then </span><!--l. 550--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
<span 
class="cmti-12">is locally countable in </span><!--l. 550--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math><span 
class="cmti-12">.</span>
<span 
class="cmti-12">So </span><!--l. 551--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
<span 
class="cmti-12">has a locally countable </span><!--l. 551--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network.</span>
</p>
</div>
<div class="proof">
<!--l. 553--><p class="indent"><span class="head">
<span 
class="cmti-12">Proof.</span> </span>Since <!--l. 553--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math>-locally
countable <!--l. 553--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
point countable, we only need to prove parenthetic part.
</p><!--l. 556--><p class="indent">Let <!--l. 556--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
be locally sequentially separable. For each <!--l. 556--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>,
there is an open neighborhood <!--l. 557--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>
of <!--l. 557--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>x</mi></math>

such that <!--l. 557--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>
is sequentially separable. It is clear that <!--l. 558--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>P</mi><mo 
class="MathClass-op">&#x22C2;</mo>
<!--nolimits--><mi 
>U</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is a point countable <!--l. 558--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
of <!--l. 558--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>U</mi></math>.
<!--l. 559--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>P</mi> <mo 
class="MathClass-op">&#x22C2;</mo>
<!--nolimits--><mi 
>U</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is countable by Proposition 2.20, So <!--l. 560--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
is locally countable in <!--l. 560--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>.
<span class="qed"><span 
class="msam-10x-x-120">&#x25A1;</span></span>
</p>
</div>
<!--l. 563--><p class="indent">The following example shows that &#x201C;sequentially separable&#x201D; in Proposition
2.20 can not be relaxed to &#x201C;separable&#x201D;, which is due to <span class="cite">[<a 
href="#XL4">16</a>, Example&#x00A0;1]</span>.
</p>
<div class="newtheorem">
<!--l. 566--><p class="noindent"><span class="head">
<a 
 id="x1-2022r22"></a>
<span 
class="cmti-12">Example </span>2.22<span 
class="cmti-12">.</span>  </span>There is a separable, <!--l. 566--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-metrizable
space, which is not an <!--l. 567--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2135;</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math>-spaces.
</p>
</div>
<div class="proof">
<!--l. 569--><p class="indent"><span class="head">
<span 
class="cmti-12">Proof.</span> </span>Let <!--l. 569--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi mathvariant="double-struck">&#x211A;</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>X</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi mathvariant="double-struck">&#x211D;</mi></math>
and <!--l. 569--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x2223;</mo><mi 
>X</mi><mo 
class="MathClass-rel">&#x2223;</mo> <mo 
class="MathClass-rel">&#x003E;</mo> <mi 
>&#x03C9;</mi></math>,
where <!--l. 569--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi mathvariant="double-struck">&#x211A;</mi></math>
and <!--l. 569--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi mathvariant="double-struck">&#x211D;</mi></math>
are the set of all rational numbers and the set of all real numbers respectively.
Let <!--l. 571--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>X</mi><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-op">&#x22C3;</mo>
 <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi mathvariant="double-struck">&#x211A;</mi> <mo 
class="MathClass-bin">&#x00D7;</mo><mrow><mo 
class="MathClass-open">{</mo><mrow><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>n</mi></mrow><mo 
class="MathClass-close">}</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
De&#xFB01;ne a neighborhood base <!--l. 572--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x212C;</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
></math>
for each <!--l. 572--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>Y</mi> </math>
for the desired topology on <!--l. 573--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
as follows.
</p><!--l. 575--><p class="indent">(1) If <!--l. 575--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>Y</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>X</mi></math>,
then <!--l. 575--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x212C;</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
</p><!--l. 577--><p class="indent">(2) If <!--l. 577--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>,

then <!--l. 578--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x212C;</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-op">&#x22C3;</mo>
 <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mrow><mo 
class="MathClass-open">[</mo><mrow><msub><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>y</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-op"> &#x22C2;</mo>
 <!--nolimits--> <mi mathvariant="double-struck">&#x211A;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x00D7;</mo><mrow><mo 
class="MathClass-open">{</mo><mrow><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>m</mi></mrow><mo 
class="MathClass-close">}</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>m</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>m</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi><mspace class="nbsp" /><mi 
>a</mi><mi 
>n</mi><mi 
>d</mi><mspace class="nbsp" /><mi 
>y</mi> <mo 
class="MathClass-rel">&#x003E;</mo><msub><mrow 
>
<mi 
>a</mi></mrow><mrow 
><mi 
>y</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x211D;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
</p><!--l. 581--><p class="indent">Then <!--l. 581--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
is a separable, <!--l. 581--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x2135;</mi></math>-space
and not an <!--l. 581--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2135;</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math>-space
<span class="cite">[<a 
href="#XL4">16</a>, Example&#x00A0;1]</span>. On the other hand, each compact subset of <!--l. 582--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
is &#xFB01;nite <span class="cite">[<a 
href="#XL4">16</a>, Example&#x00A0;1]</span>. By a similar way as in the proof of Example
2.18(claim 1), we can prove <!--l. 584--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
has a <!--l. 584--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math>-locally
&#xFB01;nite <!--l. 584--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network.
That is, <!--l. 585--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
is an <!--l. 585--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-metrizable
space. <span class="qed"><span 
class="msam-10x-x-120">&#x25A1;</span></span>
</p>
</div>
<h3 class="sectionHead"><span class="titlemark">3. </span> <a 
 id="x1-30003"></a>Mappings on Spaces with a Locally Countable
<!--l. 588--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-Network</h3>
<!--l. 590--><p class="noindent">In this section, we discuss invariance and inverse invariance of spaces with a locally
countable <!--l. 591--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
under certain mappings
</p>
<div class="newtheorem">
<!--l. 593--><p class="noindent"><span class="head">
<a 
 id="x1-3001r1"></a>
<span 
class="cmbx-12">De&#xFB01;nition 3.1.</span>  </span>Let
<!--l. 593--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>X</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>Y</mi> </math>
be a mapping.
</p><!--l. 595--><p class="indent">(1) <!--l. 595--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
is called a perfect mapping <span class="cite">[<a 
href="#XE">7</a>]</span> if <!--l. 596--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
is closed and <!--l. 596--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is a compact subset of <!--l. 596--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
for each <!--l. 596--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>Y</mi> </math>.
</p><!--l. 598--><p class="indent">(2) <!--l. 598--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
is called a <!--l. 598--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>
mapping <span class="cite">[<a 
href="#XT1">31</a>]</span> (respectively strongly <!--l. 599--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>
mapping <span class="cite">[<a 
href="#XT1">31</a>]</span>) if for each <!--l. 599--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>Y</mi> </math>,

<!--l. 600--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is a <!--l. 600--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>
subset of <!--l. 600--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
(respectively <!--l. 601--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover accent="false" 
class="mml-overline"><mrow><mi 
>U</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is a <!--l. 601--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>
subset of <!--l. 601--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
for some neighborhood <!--l. 602--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>
of <!--l. 602--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>y</mi></math>
in <!--l. 602--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>Y</mi> </math>).
</p><!--l. 604--><p class="indent">(3) <!--l. 604--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
is called a 1-sequence-covering mapping <span class="cite">[<a 
href="#XLY">23</a>]</span> if for each <!--l. 605--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>Y</mi> </math>
there is <!--l. 605--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,
such that whenever <!--l. 606--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is a sequence converging to <!--l. 606--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi></math>
in <!--l. 606--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>Y</mi> </math>,
there is a sequence <!--l. 607--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
converging to <!--l. 607--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>
in <!--l. 607--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
with each <!--l. 607--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>y</mi></mrow><mrow 
>
<mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
</p><!--l. 609--><p class="indent">(4) <!--l. 609--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
is called a &#xFB01;nite subsequence-covering mapping <span class="cite">[<a 
href="#XLu">25</a>]</span> if for each <!--l. 610--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>Y</mi> </math>
there is a &#xFB01;nite subset <!--l. 610--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>F</mi></math>
of <!--l. 610--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,
such that for any sequence <!--l. 611--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>
in <!--l. 611--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>Y</mi> </math>
converging to <!--l. 611--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi></math>,
there is a sequence <!--l. 612--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi></math>
in <!--l. 612--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
converging to some <!--l. 612--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></math>
and <!--l. 613--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>L</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is a subsequence of <!--l. 613--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>.
</p><!--l. 615--><p class="indent">(5) <!--l. 615--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
is a sequentially-quotient mapping <span class="cite">[<a 
href="#XBoS">4</a>]</span> if whenever <!--l. 616--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>
is a convergent sequence in <!--l. 616--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
there is a convergent sequence <!--l. 616--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi></math>
in <!--l. 616--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
such that <!--l. 617--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>L</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is a subsequence of <!--l. 617--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>.
</p><!--l. 619--><p class="indent">(6) <!--l. 619--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
is a quotient mapping <span class="cite">[<a 
href="#XE">7</a>]</span> if whenever <!--l. 619--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>Y</mi> </math>,

<!--l. 620--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>U</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is open in <!--l. 620--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
if and only if <!--l. 620--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>
is open <!--l. 620--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>.
</p>
</div>
<!--l. 623--><p class="indent">We call a space <!--l. 623--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
to be point-<!--l. 623--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>G</mi></mrow><mrow 
><mi 
>&#x03B4;</mi></mrow></msub 
></math> if
for each <!--l. 624--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>, there
is a sequence <!--l. 624--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math> of
neighborhoods of <!--l. 624--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>
in <!--l. 624--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math> such that
<!--l. 625--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">}</mo></mrow> <mo 
class="MathClass-rel">=</mo><mo 
class="MathClass-op"> &#x22C2;</mo>
  <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>. It is known that if
a space <!--l. 626--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math> has a locally
countable <!--l. 626--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>s</mi></math>-network,
then <!--l. 627--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math> is
point-<!--l. 627--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>G</mi></mrow><mrow 
><mi 
>&#x03B4;</mi></mrow></msub 
></math>
<span class="cite">[<a 
href="#XM">26</a>, (D)]</span>.
</p>
<div class="newtheorem">
<!--l. 629--><p class="noindent"><span class="head">
<a 
 id="x1-3002r2"></a>
<span 
class="cmti-12">Remark </span>3.2<span 
class="cmti-12">.</span>  </span><span class="cite">[<a 
href="#XL2">19</a>]</span>.          (1)          1-sequence-covering          mappings
(sequentially-quotient    and    &#xFB01;nite-to-one    mappings,    respectively)
<!--l. 630--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
&#xFB01;nite                        subsequence-covering                        mappings
<!--l. 631--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
sequentially-quotient mappings.
</p><!--l. 633--><p class="indent">(2)                                 Closed                                 mappings
<!--l. 633--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
quotient mappings.
</p><!--l. 635--><p class="indent">(3) If the domain is point-<!--l. 635--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>G</mi></mrow><mrow 
><mi 
>&#x03B4;</mi></mrow></msub 
></math>,
then closed mappings <!--l. 636--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
sequentially-quotient mappings
</p><!--l. 638--><p class="indent">(4)   If   the   domain   is   sequential,   then   quotient   mappings
<!--l. 639--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x21D2;</mo></math>
sequentially-quotient mappings.
</p><!--l. 641--><p class="indent">(5) Quotient mappings preserve <!--l. 641--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>-spaces

and perfect mappings inversely preserve <!--l. 642--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>-spaces.
</p>
</div>
<div class="newtheorem">
<!--l. 645--><p class="noindent"><span class="head">
<a 
 id="x1-3003r3"></a>
<span 
class="cmbx-12">De&#xFB01;nition 3.3.</span>  </span><span class="cite">[<a 
href="#XL">20</a>]</span>.                                                              Let
<!--l. 645--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
be a space. Put
<!--tex4ht:inline--></p><!--l. 647--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
              <mi 
>&#x03C3;</mi> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>P</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>X</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>P</mi><!--mstyle 
class="text"--><mtext >&#x00A0;is&#x00A0;sequentially&#x00A0;open&#x00A0;in&#x00A0;</mtext><!--/mstyle--><mi 
>X</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 649--><p class="nopar">The <!--l. 650--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>X</mi><mo 
class="MathClass-punc">,</mo><mi 
>&#x03C3;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,
the set <!--l. 650--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
with the topology <!--l. 650--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi></math>,
is called the sequential core&#xFB02;ection of <!--l. 651--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>,
which is denoted by <!--l. 651--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi><mi 
>X</mi></math>.
</p>
</div>
<div class="newtheorem">
<!--l. 654--><p class="noindent"><span class="head">
<a 
 id="x1-3004r4"></a>
<span 
class="cmbx-12">De&#xFB01;nition 3.4.</span>  </span><span class="cite">[<a 
href="#XAS">2</a>]</span>. Let <!--l. 655--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
be a sequence converging to <!--l. 655--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><mo 
class="MathClass-rel">&#x2209;</mo><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math>,
and let <!--l. 656--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math>
be a sequence converging to <!--l. 656--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-rel">&#x2209;</mo><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math>
for each <!--l. 656--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>.
Let <!--l. 657--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>T</mi></math>

be the topological sum of <!--l. 657--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-op"> &#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
<!--l. 658--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>S</mi></mrow><mrow 
><mi 
>&#x03C9;</mi> </mrow> </msub 
> </math>
is de&#xFB01;ned as a quotient space obtained from <!--l. 658--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>T</mi></math>
by identifying all point <!--l. 659--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>T</mi></math>
to the point <!--l. 659--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math>.
</p>
</div>
<!--l. 662--><p class="indent">The following lemma is obtained by combining <span class="cite">[<a 
href="#XL">20</a>, Theorem 3.6]</span> and <span class="cite">[<a 
href="#XL">20</a>,
Theorem 3.13]</span>.
</p>
<div class="newtheorem">
<!--l. 665--><p class="noindent"><span class="head">
<a 
 id="x1-3005r5"></a>
<span 
class="cmbx-12">Lemma 3.5.</span>  </span><span class="cite">[<a 
href="#XL">20</a>]</span><span 
class="cmti-12">. Let </span><!--l. 665--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">be a point-</span><!--l. 665--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>G</mi></mrow><mrow 
><mi 
>&#x03B4;</mi></mrow></msub 
></math>
<span 
class="cmti-12">space and contain no closed subspace having </span><!--l. 666--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>S</mi></mrow><mrow 
><mi 
>&#x03C9;</mi></mrow></msub 
></math>
<span 
class="cmti-12">as its sequential core&#xFB02;ection. If </span><!--l. 667--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">has a point-countable </span><!--l. 667--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>s</mi></math><span 
class="cmti-12">-network,</span>
<span 
class="cmti-12">then </span><!--l. 667--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">is </span><!--l. 667--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-&#xFB01;rst</span>
<span 
class="cmti-12">countable.</span>
</p>
</div>
<div class="newtheorem">
<!--l. 670--><p class="noindent"><span class="head">
<a 
 id="x1-3006r6"></a>
<span 
class="cmbx-12">Lemma 3.6.</span>  </span><span class="cite">[<a 
href="#XL6">21</a>]</span><span 
class="cmti-12">. Let </span><!--l. 670--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>X</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>Y</mi> </math>
<span 
class="cmti-12">be a perfect mapping and </span><!--l. 671--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">have a </span><!--l. 671--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>G</mi></mrow><mrow 
><mi 
>&#x03B4;</mi></mrow></msub 
></math><span 
class="cmti-12">-diagonal.</span>
<span 
class="cmti-12">If </span><!--l. 671--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>Y</mi> </math>
<span 
class="cmti-12">has a locally countable </span><!--l. 671--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math><span 
class="cmti-12">-network,</span>
<span 
class="cmti-12">then </span><!--l. 672--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">has a locally countable </span><!--l. 672--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math><span 
class="cmti-12">-network.</span>
</p>
</div>
<div class="newtheorem">

<!--l. 675--><p class="noindent"><span class="head">
<a 
 id="x1-3007r7"></a>
<span 
class="cmbx-12">Lemma 3.7.</span>  </span><span class="cite">[<a 
href="#XG">11</a>]</span><span 
class="cmti-12">. Let </span><!--l. 675--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>X</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>Y</mi> </math>
<span 
class="cmti-12">be a closed mapping and </span><!--l. 676--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">be point-</span><!--l. 676--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>G</mi></mrow><mrow 
><mi 
>&#x03B4;</mi></mrow></msub 
></math><span 
class="cmti-12">.</span>
<span 
class="cmti-12">If </span><!--l. 677--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>F</mi></math>
<span 
class="cmti-12">is sequentially closed in </span><!--l. 677--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math><span 
class="cmti-12">,</span>
<span 
class="cmti-12">then </span><!--l. 677--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>F</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
<span 
class="cmti-12">is sequentially closed in </span><!--l. 677--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math><span 
class="cmti-12">.</span>
</p>
</div>
<div class="newtheorem">
<!--l. 680--><p class="noindent"><span class="head">
<a 
 id="x1-3008r8"></a>
<span 
class="cmbx-12">Theorem 3.8.</span>  </span><span 
class="cmti-12">Let </span><!--l. 680--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>X</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>Y</mi> </math>
<span 
class="cmti-12">be a perfect mapping and </span><!--l. 681--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">have a </span><!--l. 681--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>G</mi></mrow><mrow 
><mi 
>&#x03B4;</mi></mrow></msub 
></math><span 
class="cmti-12">-diagonal.</span>
<span 
class="cmti-12">If </span><!--l. 681--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>Y</mi> </math>
<span 
class="cmti-12">has a locally countable </span><!--l. 681--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network,</span>
<span 
class="cmti-12">then </span><!--l. 682--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">has a locally countable </span><!--l. 682--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network.</span>
</p>
</div>
<div class="proof">
<!--l. 684--><p class="indent"><span class="head">
<span 
class="cmti-12">Proof.</span> </span>If <!--l. 684--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
has a locally countable <!--l. 684--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network,
then <!--l. 685--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
has a locally countable <!--l. 685--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>s</mi></math>-network
by Remark 2.5(1), Lemma 2.9 and Lemma 3.6. We only need to prove that
<!--l. 686--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is <!--l. 686--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>s</mi><mi 
>n</mi></math>-&#xFB01;rst
countable by Remark 2.13. Since <!--l. 687--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
has a <!--l. 687--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>G</mi></mrow><mrow 
><mi 
>&#x03B4;</mi></mrow></msub 
></math>-diagonal,

<!--l. 687--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is point-<!--l. 687--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>G</mi></mrow><mrow 
><mi 
>&#x03B4;</mi></mrow></msub 
></math>.
By Lemma 3.5, It suffices to prove that <!--l. 688--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
contains no closed subspace having <!--l. 688--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>S</mi></mrow><mrow 
><mi 
>&#x03C9;</mi></mrow></msub 
></math>
as its sequential core&#xFB02;ection.
</p><!--l. 691--><p class="indent">Assume <!--l. 691--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
contains closed subspace <!--l. 691--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>
having <!--l. 691--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>S</mi></mrow><mrow 
><mi 
>&#x03C9;</mi></mrow></msub 
></math>
as its sequential core&#xFB02;ection. Put <!--l. 692--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>g</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>f</mi><msub><mrow 
><mo 
class="MathClass-rel">&#x2223;</mo></mrow><mrow 
><mi 
>&#x03C3;</mi><mi 
>s</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>&#x03C3;</mi><mi 
>S</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x03C3;</mi><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>S</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
</p><!--l. 694--><p class="indent">Claim                                                                                 1.
<!--l. 694--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>g</mi></math>
is closed.
</p><!--l. 696--><p class="indent">Proof. Let <!--l. 696--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>A</mi></math>
be a closed subset of <!--l. 696--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi><mi 
>S</mi></math>,
then <!--l. 696--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>A</mi></math>
is sequentially closed in <!--l. 696--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>.
It is clear that <!--l. 697--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>S</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>S</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is closed and <!--l. 697--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>
is point-<!--l. 697--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>G</mi></mrow><mrow 
><mi 
>&#x03B4;</mi></mrow></msub 
></math>.
So <!--l. 698--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>A</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is sequentially closed in <!--l. 698--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>S</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
by Lemma 3.7, thus <!--l. 699--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>A</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is closed in <!--l. 699--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>S</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
</p><!--l. 701--><p class="indent">Claim 2. <!--l. 701--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>g</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is compact in <!--l. 701--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi><mi 
>S</mi></math>
for each <!--l. 701--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x03C3;</mi><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>S</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
</p><!--l. 703--><p class="indent">Proof. Let <!--l. 703--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x03C3;</mi><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>S</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
Note that <!--l. 703--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
has a <!--l. 703--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>G</mi></mrow><mrow 
><mi 
>&#x03B4;</mi></mrow></msub 
></math>-diagonal
and <!--l. 704--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is compact in <!--l. 704--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>,
so <!--l. 704--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is metrizable <span class="cite">[<a 
href="#XC">5</a>]</span>. Therefore, the topology on the sequential core&#xFB02;ection of
<!--l. 705--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-op"> &#x22C2;</mo><!--nolimits--><mi 
>S</mi></math>
is equivalent to the induced topology of subspace <!--l. 706--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>
of <!--l. 706--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
Thus <!--l. 707--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>g</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-op"> &#x22C2;</mo><!--nolimits--><mi 
>S</mi></math>
is compact in <!--l. 707--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi><mi 
>S</mi></math>.
</p><!--l. 709--><p class="indent">By the above two claims, <!--l. 709--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>g</mi></math>
is perfect. Since <!--l. 709--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>S</mi></mrow><mrow 
><mi 
>&#x03C9;</mi></mrow></msub 
></math>,

which is homeomorphic to <!--l. 710--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi><mi 
>S</mi></math>,
is a <!--l. 710--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>F</mi><mi 
>r</mi><mi 
>&#x00E9;</mi><mi 
>c</mi><mi 
>h</mi><mi 
>e</mi><mi 
>t</mi></math>,
<!--l. 710--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x2135;</mi></math>-space
and perfect mappings preserve <!--l. 711--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>F</mi><mi 
>r</mi><mi 
>&#x00E9;</mi><mi 
>c</mi><mi 
>h</mi><mi 
>e</mi><mi 
>t</mi></math>,
<!--l. 711--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x2135;</mi></math>-spaces,
<!--l. 712--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>S</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is a <!--l. 712--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>F</mi><mi 
>r</mi><mi 
>&#x00E9;</mi><mi 
>c</mi><mi 
>h</mi><mi 
>e</mi><mi 
>t</mi></math>,
<!--l. 712--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x2135;</mi></math>-space.
On the other hand, <!--l. 713--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
is <!--l. 713--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>s</mi><mi 
>n</mi></math>-&#xFB01;rst
countable, so <!--l. 713--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>S</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,
as a subspace of <!--l. 713--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>,
is <!--l. 714--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>s</mi><mi 
>n</mi></math>-&#xFB01;rst
countable. By <span class="cite">[<a 
href="#XL">20</a>, Theorem 3.13]</span>, <!--l. 714--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>S</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is <!--l. 714--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>g</mi></math>-&#xFB01;rst
countable, so <!--l. 715--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>S</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is metrizable <span class="cite">[<a 
href="#XG">11</a>, Theorem 2.4]</span>, and so <!--l. 716--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C3;</mi><mi 
>S</mi></math>
is metrizable <span class="cite">[<a 
href="#XC">5</a>]</span>. This contradicts that <!--l. 717--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>S</mi></mrow><mrow 
><mi 
>&#x03C9;</mi></mrow></msub 
></math>
is not metrizable. <span class="qed"><span 
class="msam-10x-x-120">&#x25A1;</span></span>
</p>
</div>
<!--l. 720--><p class="indent">We have the following corollary by Corollary 2.17, Remark 3.2(5) and
Theorem 3.8.
</p>
<div class="newtheorem">
<!--l. 722--><p class="noindent"><span class="head">
<a 
 id="x1-3009r9"></a>
<span 
class="cmbx-12">Corollary 3.9.</span>  </span><span 
class="cmti-12">Let </span><!--l. 722--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>X</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>Y</mi> </math>
<span 
class="cmti-12">be a perfect mapping and </span><!--l. 723--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">have a </span><!--l. 723--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>G</mi></mrow><mrow 
><mi 
>&#x03B4;</mi></mrow></msub 
></math><span 
class="cmti-12">-diagonal.</span>
<span 
class="cmti-12">If </span><!--l. 723--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>Y</mi> </math>
<span 
class="cmti-12">has a locally countable weak-base, then </span><!--l. 724--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">has a locally countable weak-base.</span>
</p>
</div>
<div class="newtheorem">
<!--l. 727--><p class="noindent"><span class="head">
<a 
 id="x1-3010r10"></a>

<span 
class="cmti-12">Example </span>3.10<span 
class="cmti-12">.</span>  </span>A perfect image of a <!--l. 727--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>g</mi></math>-second
countable space has not any locally countable <!--l. 728--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network.
</p>
</div>
<div class="proof">
<!--l. 730--><p class="indent"><span class="head">
<span 
class="cmti-12">Proof.</span> </span>Let <!--l. 730--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mn>0</mn></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--> <mi mathvariant="double-struck">&#x2115;</mi><mo 
class="MathClass-op"> &#x22C3;</mo>
 <!--nolimits--><mrow><mo 
class="MathClass-open">(</mo><mrow><mi mathvariant="double-struck">&#x2115;</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,
<!--l. 730--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">&#x2131;</mi> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>F</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi mathvariant="double-struck">&#x2115;</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>F</mi><mspace class="nbsp" /><mi 
>i</mi><mi 
>s</mi><mspace class="nbsp" /><mi 
>f</mi><mi 
>i</mi><mi 
>n</mi><mi 
>i</mi><mi 
>t</mi><mi 
>e</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>,
<!--l. 731--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi mathvariant="double-struck">&#x2115;</mi></mrow><mrow 
><mi mathvariant="double-struck">&#x2115;</mi> </mrow> </msup 
>    <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>f</mi><!--mstyle 
class="text"--><mtext >is&#x00A0;a&#x00A0;correspondence&#x00A0;from&#x00A0;</mtext><!--/mstyle--><mi mathvariant="double-struck">&#x2115;</mi><mspace class="nbsp" /><mi 
>t</mi><mi 
>o</mi><mspace class="nbsp" /><mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
For <!--l. 732--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><mi 
>m</mi><mo 
class="MathClass-punc">,</mo><mi 
>k</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>,
<!--l. 732--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>F</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">&#x2131;</mi></math>,
and <!--l. 732--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi mathvariant="double-struck">&#x2115;</mi></mrow><mrow 
><mi mathvariant="double-struck">&#x2115;</mi></mrow></msup 
></math>,
put <!--l. 733--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>V</mi> <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><mi 
>m</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-op">&#x22C3;</mo>
 <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><mi 
>k</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>k</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>m</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>,
<!--l. 734--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>F</mi><mo 
class="MathClass-punc">,</mo><mi 
>f</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo><mo 
class="MathClass-op"> &#x22C3;</mo>
  <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>V</mi> <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>F</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
De&#xFB01;ne a neighborhood base <!--l. 735--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x212C;</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>
for each <!--l. 735--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>
for the desired topology on <!--l. 735--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
as follows.
</p><!--l. 738--><p class="indent">(1) If <!--l. 738--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>,
then <!--l. 738--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x212C;</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
</p><!--l. 740--><p class="indent">(2) If <!--l. 740--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>,
then <!--l. 740--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x212C;</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>V</mi> <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>m</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>m</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
</p><!--l. 742--><p class="indent">(3) If <!--l. 742--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">=</mo> <mn>0</mn></math>,
then <!--l. 742--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x212C;</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mi 
>H</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>F</mi><mo 
class="MathClass-punc">,</mo><mi 
>f</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>F</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">&#x2131;</mi><mo 
class="MathClass-punc">,</mo><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi mathvariant="double-struck">&#x2115;</mi></mrow><mrow 
><mi mathvariant="double-struck">&#x2115;</mi></mrow></msup 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
</p><!--l. 744--><p class="indent">Let
<!--l. 744--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
be          the          quotient          space          obtained          from
<!--l. 744--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
by                        shrinking                        the                        set
<!--l. 745--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><mn>0</mn></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--> <mi mathvariant="double-struck">&#x2115;</mi></math>
to                                         a                                         point,
<!--l. 746--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>X</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>Y</mi> </math>
be a natural mapping. Then
</p><!--l. 748--><p class="indent">Claim 1. <!--l. 748--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
is perfect and <!--l. 748--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is <!--l. 748--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>g</mi></math>-second

countable <span class="cite">[<a 
href="#XL5">18</a>, Example 3.1]</span>.
</p><!--l. 750--><p class="indent">Claim 2. <!--l. 750--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
is not <!--l. 750--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-&#xFB01;rst
countable <span class="cite">[<a 
href="#XG">11</a>, Example 3.2]</span>, so <!--l. 751--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
has not any locally countable <!--l. 751--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network.
<span class="qed"><span 
class="msam-10x-x-120">&#x25A1;</span></span>
</p>
</div>
<!--l. 754--><p class="indent">Which mappings preserve spaces with a locally countable
<!--l. 754--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network?
We give some answers for this question.
</p>
<div class="newtheorem">
<!--l. 757--><p class="noindent"><span class="head">
<a 
 id="x1-3011r11"></a>
<span 
class="cmbx-12">Lemma 3.11.</span>  </span><span 
class="cmti-12">Let </span><!--l. 757--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>X</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>Y</mi> </math>
<span 
class="cmti-12">be a &#xFB01;nite subsequence-covering mapping. If </span><!--l. 758--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">is </span><!--l. 758--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-&#xFB01;rst</span>
<span 
class="cmti-12">countable, then </span><!--l. 758--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
<span 
class="cmti-12">is </span><!--l. 758--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-&#xFB01;rst</span>
<span 
class="cmti-12">countable.</span>
</p>
</div>
<div class="proof">
<!--l. 760--><p class="indent"><span class="head">
<span 
class="cmti-12">Proof.</span> </span>Let <!--l. 760--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>Y</mi> </math>.
Then there is a &#xFB01;nite subset <!--l. 760--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>F</mi></math>
of <!--l. 760--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,
such that for any sequence <!--l. 761--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>
in <!--l. 761--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>Y</mi> </math>
converging to <!--l. 761--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi></math>,
there is a sequence <!--l. 762--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi></math>
in <!--l. 762--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
converging to some <!--l. 762--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></math>
and <!--l. 763--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>L</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>

is a subsequence of <!--l. 763--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>.
<!--l. 764--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is <!--l. 764--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>s</mi><mi 
>n</mi></math>-&#xFB01;rst
countable, for each <!--l. 764--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></math>,
let <!--l. 765--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
be a decreasing <!--l. 765--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
at <!--l. 765--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>x</mi></math>
in <!--l. 765--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
Put <!--l. 766--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x2131;</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mo 
class="MathClass-op">&#x22C3;</mo>
 <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></mrow><mo 
class="MathClass-close">}</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
Then <!--l. 766--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x2131;</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
></math>
is countable decreasing.
</p><!--l. 768--><p class="indent">(1) <!--l. 768--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x2131;</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
></math>
is a network at <!--l. 768--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi></math>
in <!--l. 768--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>Y</mi> </math>.
In fact, let <!--l. 768--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi></math>
be an open neighborhood of <!--l. 768--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi></math>,
then <!--l. 769--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>F</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2282;</mo> <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>U</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
For each <!--l. 770--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></math>,
there is <!--l. 770--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>
such that <!--l. 770--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>U</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,
so <!--l. 771--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>U</mi></math>.
Put <!--l. 772--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mi 
>m</mi><mi 
>a</mi><mi 
>x</mi><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>,
then <!--l. 772--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></mrow></msub 
></math>
for each <!--l. 772--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></math>.
So <!--l. 773--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mo 
class="MathClass-op">&#x22C3;</mo>
  <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-rel">&#x2282;</mo><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>U</mi></math>.
</p><!--l. 775--><p class="indent">(2) Let <!--l. 775--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-op"> &#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-punc">,</mo><mspace class="nbsp" /><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
mathvariant="script">&#x2131;</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
></math>.
Put <!--l. 776--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mi 
>m</mi><mi 
>a</mi><mi 
>x</mi><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>,
then <!--l. 776--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-op"> &#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
mathvariant="script">&#x2131;</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
></math>
and <!--l. 777--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-op"> &#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></mrow><mo 
class="MathClass-close">}</mo></mrow> <mo 
class="MathClass-rel">&#x2282;</mo> <mrow><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-op">&#x22C3;</mo>
 <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-op"> &#x22C2;</mo>
 <!--nolimits--><mrow><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-op">&#x22C3;</mo>
 <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo>
<mi 
>F</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
</p><!--l. 780--><p class="indent">(3) <!--l. 780--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-op"> &#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is a sequential neighborhood of <!--l. 780--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi></math>
for each <!--l. 780--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>.
In fact, let <!--l. 781--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>
be a sequence in <!--l. 781--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
converging to <!--l. 781--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi></math>.
Then there is a sequence <!--l. 782--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi></math>
in <!--l. 782--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
converging to some <!--l. 782--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></math>
and <!--l. 783--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>L</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>

is a subsequence of <!--l. 783--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>.
For each <!--l. 783--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>.
Since <!--l. 784--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></math>
is a sequential neighborhood of <!--l. 784--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>,
<!--l. 784--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi></math>
is eventually in <!--l. 784--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></math>.
So <!--l. 785--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>L</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is eventually in <!--l. 785--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,
hence <!--l. 785--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>
is frequently in <!--l. 785--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
Moreover, <!--l. 786--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>
is frequently in <!--l. 786--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-op"> &#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
By Remark 2.2(1), <!--l. 787--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-op"> &#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is a sequential neighborhood of <!--l. 787--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi></math>.
<span class="qed"><span 
class="msam-10x-x-120">&#x25A1;</span></span>
</p>
</div>
<div class="newtheorem">
<!--l. 790--><p class="noindent"><span class="head">
<a 
 id="x1-3012r12"></a>
<span 
class="cmbx-12">Lemma 3.12.</span>  </span><span 
class="cmti-12">Let </span><!--l. 790--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>X</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>Y</mi> </math>
<span 
class="cmti-12">be a closed, </span><!--l. 790--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>
<span 
class="cmti-12">mapping. If </span><!--l. 791--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
<span 
class="cmti-12">is a locally countable family of subsets of </span><!--l. 791--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math><span 
class="cmti-12">,</span>
<span 
class="cmti-12">then </span><!--l. 792--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
<span 
class="cmti-12">is a locally countable family of subsets of </span><!--l. 792--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math><span 
class="cmti-12">.</span>
</p>
</div>
<div class="proof">
<!--l. 794--><p class="indent"><span class="head">
<span 
class="cmti-12">Proof.</span> </span>Let <!--l. 794--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x039B;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
be a locally countable family of subsets of <!--l. 796--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
and let <!--l. 796--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>Y</mi> </math>.
For each <!--l. 797--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,
there is an open neighborhood <!--l. 797--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>

of <!--l. 797--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>x</mi></math>
such that <!--l. 798--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x039B;</mi> <mo 
class="MathClass-punc">:</mo> <msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
><mo 
class="MathClass-op"> &#x22C2;</mo>
<!--nolimits--><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>&#x2205;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is countable. <!--l. 799--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2282;</mo><mo 
class="MathClass-op">&#x22C3;</mo><!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>U</mi></mrow><mrow 
>
<mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
and <!--l. 799--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is <!--l. 799--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>,
so there is a countable subset <!--l. 800--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>B</mi></math>
of <!--l. 800--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
such that <!--l. 801--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2282;</mo><mo 
class="MathClass-op">&#x22C3;</mo><!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>U</mi></mrow><mrow 
>
<mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>B</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
Put <!--l. 801--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>U</mi> <mo 
class="MathClass-rel">=</mo><mo 
class="MathClass-op"> &#x22C3;</mo>
  <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>B</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
It is clear that <!--l. 802--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x039B;</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>U</mi><mo 
class="MathClass-op">&#x22C2;</mo>
<!--nolimits--><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>&#x2205;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is countable. Note that <!--l. 803--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
is closed. By <span class="cite">[<a 
href="#XE">7</a>, Theorem 1.4.13]</span>, there is an open neighborhood <!--l. 804--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>V</mi> </math>
of <!--l. 804--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>y</mi></math>
such that <!--l. 804--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>V</mi> </mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>U</mi></math>.
Thus <!--l. 805--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>&#x039B;</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msup 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x039B;</mi> <mo 
class="MathClass-punc">:</mo> <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>V</mi> </mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-op"> &#x22C2;</mo><!--nolimits--><msub><mrow 
><mi 
>P</mi></mrow><mrow 
>
<mi 
>&#x03B1;</mi></mrow></msub 
><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>&#x2205;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is countable. It is easy to check that <!--l. 806--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x039B;</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>V</mi> <mo 
class="MathClass-op">&#x22C2;</mo>
<!--nolimits--><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>&#x2205;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow> <mo 
class="MathClass-rel">=</mo> <msup><mrow 
><mi 
>&#x039B;</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msup 
></math>.
So <!--l. 807--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x039B;</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>V</mi> <mo 
class="MathClass-op">&#x22C2;</mo>
 <!--nolimits--><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>&#x2205;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is countable. This proves that <!--l. 808--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is a locally countable family of subsets of <!--l. 808--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>.
<span class="qed"><span 
class="msam-10x-x-120">&#x25A1;</span></span>
</p>
</div>
<div class="newtheorem">
<!--l. 811--><p class="noindent"><span class="head">
<a 
 id="x1-3013r13"></a>
<span 
class="cmbx-12">Theorem 3.13.</span>  </span><span 
class="cmti-12">Let </span><!--l. 811--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>X</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>Y</mi> </math>
<span 
class="cmti-12">be a closed, &#xFB01;nite-to-one mapping. If </span><!--l. 812--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">has a locally countable </span><!--l. 812--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network,</span>
<span 
class="cmti-12">then </span><!--l. 812--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
<span 
class="cmti-12">has a locally countable </span><!--l. 812--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network.</span>
</p>
</div>
<div class="proof">
<!--l. 814--><p class="indent"><span class="head">
<span 
class="cmti-12">Proof.</span> </span>Let <!--l. 814--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>

be a locally countable <!--l. 814--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
of <!--l. 814--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
Then <!--l. 815--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
is sequentially quotient by Remark 3.2(3), and so <!--l. 815--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
is <!--l. 815--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>s</mi><mi 
>n</mi></math>-&#xFB01;rst
countable by Remark 3.2(1) and Lemma 3.11. Since sequentially quotient
mappings preserve <!--l. 818--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><msup><mrow 
><mi 
>s</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2217;</mo></mrow></msup 
></math>-networks
<span class="cite">[<a 
href="#XL2">19</a>, Proposition 2.7.3]</span>, <!--l. 819--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is a <!--l. 819--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><msup><mrow 
><mi 
>s</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2217;</mo></mrow></msup 
></math>-network
of <!--l. 819--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>Y</mi> </math>.
<!--l. 819--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is locally countable by Lemma 3.12, so <!--l. 820--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is a locally countable <!--l. 820--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><msup><mrow 
><mi 
>s</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2217;</mo></mrow></msup 
></math>-network
of <!--l. 820--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>Y</mi> </math>.
Thus <!--l. 821--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
has a locally countable <!--l. 821--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
by Remark 2.13. <span class="qed"><span 
class="msam-10x-x-120">&#x25A1;</span></span>
</p>
</div>
<div class="newtheorem">
<!--l. 824--><p class="noindent"><span class="head">
<a 
 id="x1-3014r14"></a>
<span 
class="cmbx-12">Question 3.14.</span>  </span>Do closed, countable-to-one mappings preserve spaces
with a locally countable <!--l. 825--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network?
</p>
</div>
<!--l. 828--><p class="indent">A clopen mapping means an open and closed mapping.
</p>
<div class="newtheorem">
<!--l. 830--><p class="noindent"><span class="head">
<a 
 id="x1-3015r15"></a>
<span 
class="cmbx-12">Theorem 3.15.</span>  </span><span 
class="cmti-12">Let </span><!--l. 830--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>X</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>Y</mi> </math>
<span 
class="cmti-12">be a clopen, </span><!--l. 830--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>
<span 
class="cmti-12">mapping. If </span><!--l. 831--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">has a locally countable </span><!--l. 831--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network,</span>
<span 
class="cmti-12">then </span><!--l. 831--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>

<span 
class="cmti-12">has a locally countable </span><!--l. 831--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network.</span>
</p>
</div>
<div class="proof">
<!--l. 833--><p class="indent"><span class="head">
<span 
class="cmti-12">Proof.</span> </span>Let <!--l. 833--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi> <mo 
class="MathClass-rel">=</mo><mo 
class="MathClass-op"> &#x22C3;</mo>
  <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
be a locally countable <!--l. 833--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
of <!--l. 833--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
Since <!--l. 834--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
is closed, <!--l. 834--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>,
by a similar way as in the proof of Theorem 3.13, <!--l. 835--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is a locally countable <!--l. 835--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><msup><mrow 
><mi 
>s</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2217;</mo></mrow></msup 
></math>-network
of <!--l. 835--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>Y</mi> </math>.
It suffices to prove that <!--l. 836--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
is <!--l. 836--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>s</mi><mi 
>n</mi></math>-&#xFB01;rst
countable by Remark 2.13. Let <!--l. 837--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>Y</mi> </math>.
Put <!--l. 837--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x2131;</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
><mspace class="nbsp" /><mi 
>a</mi><mi 
>n</mi><mi 
>d</mi><mspace class="nbsp" /><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">}</mo></mrow></math>,
then <!--l. 838--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x2131;</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,
so <!--l. 839--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msub><mrow 
><mi 
mathvariant="script">&#x2131;</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
></math>
is locally countable. Note that <!--l. 839--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mo 
class="MathClass-op">&#x22C2;</mo>
  <!--nolimits--><msub><mrow 
><mi 
mathvariant="script">&#x2131;</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
></math>,
<!--l. 839--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x2131;</mi></mrow><mrow 
><mi 
>y</mi> </mrow> </msub 
> </math>
is countable. It is clear that <!--l. 840--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x2131;</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
></math>
is a network at <!--l. 840--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi></math>
in <!--l. 840--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>Y</mi> </math>.
We only need to prove that each element of <!--l. 841--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
mathvariant="script">&#x2131;</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
></math>
is a sequential neighborhood of <!--l. 841--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi></math>.
Let <!--l. 842--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
mathvariant="script">&#x2131;</mi></mrow><mrow 
><mi 
>y</mi></mrow></msub 
></math>
and <!--l. 842--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
be a sequence in <!--l. 842--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
converging to <!--l. 842--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi></math>.
Then there is <!--l. 843--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
such that <!--l. 843--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi> <mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
mathvariant="script">P</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>.
Since <!--l. 844--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is point-<!--l. 844--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>G</mi></mrow><mrow 
><mi 
>&#x03B4;</mi></mrow></msub 
></math>,
<!--l. 844--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">}</mo></mrow> <mo 
class="MathClass-rel">=</mo><mo 
class="MathClass-op"> &#x22C2;</mo>
  <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>,
where each <!--l. 845--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math>
is open in <!--l. 845--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>

and <!--l. 845--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover> <mo 
class="MathClass-rel">&#x2282;</mo> <msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math>.
For each <!--l. 846--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>,
<!--l. 846--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
and <!--l. 846--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is open as <!--l. 846--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
is open, so there is <!--l. 847--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>m</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2115;</mi></math>
such that <!--l. 847--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
for each <!--l. 847--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <msub><mrow 
><mi 
>m</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math>.
Pick <!--l. 848--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math>
such that <!--l. 848--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>y</mi></mrow><mrow 
><msub><mrow 
><mi 
>m</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></msub 
></math>.
Since <!--l. 848--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
is closed, it is not difficult to prove that the sequence <!--l. 849--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
converges to <!--l. 849--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>P</mi></math>.
<!--l. 850--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi> </math>
is a sequential neighborhood of <!--l. 850--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math>,
so <!--l. 850--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is eventually in <!--l. 850--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi></math>.
Consequently, <!--l. 851--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is eventually in <!--l. 851--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,
so <!--l. 851--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is frequently in <!--l. 851--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
By Remark 2.2(1), <!--l. 852--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is a sequential neighborhood of <!--l. 852--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi></math>.
<span class="qed"><span 
class="msam-10x-x-120">&#x25A1;</span></span>
</p>
</div>
<div class="newtheorem">
<!--l. 855--><p class="noindent"><span class="head">
<a 
 id="x1-3016r16"></a>
<span 
class="cmbx-12">Corollary 3.16.</span>  </span><span 
class="cmti-12">Let </span><!--l. 855--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>X</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>Y</mi> </math>
<span 
class="cmti-12">be an open, perfect mapping. If </span><!--l. 856--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">has a locally countable </span><!--l. 856--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network,</span>
<span 
class="cmti-12">then </span><!--l. 856--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
<span 
class="cmti-12">has a locally countable </span><!--l. 856--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network.</span>
</p>
</div>
<!--l. 859--><p class="indent">Clopen mappings preserve spaces with a locally countable weak-base <span class="cite">[<a 
href="#XLiu">24</a>,
Theorem 4.7]</span>. But the following question is still open.

</p>
<div class="newtheorem">
<!--l. 862--><p class="noindent"><span class="head">
<a 
 id="x1-3017r17"></a>
<span 
class="cmbx-12">Question 3.17.</span>  </span>Do clopen mappings preserve spaces with a locally countable
<!--l. 862--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
(respectively <!--l. 863--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><mi 
>s</mi></math>-network)?
</p>
</div>
<div class="newtheorem">
<!--l. 866--><p class="noindent"><span class="head">
<a 
 id="x1-3018r18"></a>
<span 
class="cmbx-12">Lemma 3.18.</span>  </span><span 
class="cmti-12">Let </span><!--l. 866--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>X</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>Y</mi> </math>
<span 
class="cmti-12">be a strongly </span><!--l. 866--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>
<span 
class="cmti-12">mapping. If </span><!--l. 867--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
<span 
class="cmti-12">is a locally countable family of subsets of </span><!--l. 867--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math><span 
class="cmti-12">,</span>
<span 
class="cmti-12">then </span><!--l. 868--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
<span 
class="cmti-12">is a locally countable family of subsets of </span><!--l. 868--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math><span 
class="cmti-12">.</span>
</p>
</div>
<div class="proof">
<!--l. 870--><p class="indent"><span class="head">
<span 
class="cmti-12">Proof.</span> </span>Let <!--l. 870--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x039B;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
be a locally countable family of subsets of <!--l. 872--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
and let <!--l. 872--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>Y</mi> </math>.
Then there is a neighborhood <!--l. 872--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>W</mi></math>
of <!--l. 872--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>y</mi></math>
in <!--l. 872--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>Y</mi> </math>
such that <!--l. 873--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover accent="false" 
class="mml-overline"><mrow><mi 
>W</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is a <!--l. 873--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>
subset of <!--l. 873--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>.
It suffices to prove that <!--l. 875--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x039B;</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>W</mi><mo 
class="MathClass-op">&#x22C2;</mo>
<!--nolimits--><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>&#x2205;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is countable. For each <!--l. 876--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover accent="false" 
class="mml-overline"><mrow><mi 
>W</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,
there is an open neighborhood <!--l. 876--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
></math>

of <!--l. 876--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>x</mi></math>
such that <!--l. 877--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x039B;</mi> <mo 
class="MathClass-punc">:</mo> <msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
><mo 
class="MathClass-op"> &#x22C2;</mo>
<!--nolimits--><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>&#x2205;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is countable. <!--l. 878--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover accent="false" 
class="mml-overline"><mrow><mi 
>W</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2282;</mo><mo 
class="MathClass-op">&#x22C3;</mo><!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>U</mi></mrow><mrow 
>
<mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover accent="false" 
class="mml-overline"><mrow><mi 
>W</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
and <!--l. 879--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover accent="false" 
class="mml-overline"><mrow><mi 
>W</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is <!--l. 879--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>,
so there is a countable subset <!--l. 880--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>B</mi></math>
of <!--l. 880--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover accent="false" 
class="mml-overline"><mrow><mi 
>W</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
such that <!--l. 881--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover accent="false" 
class="mml-overline"><mrow><mi 
>W</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2282;</mo><mo 
class="MathClass-op">&#x22C3;</mo><!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>U</mi></mrow><mrow 
>
<mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>B</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
It is easy to see that <!--l. 882--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x039B;</mi> <mo 
class="MathClass-punc">:</mo> <mrow><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-op">&#x22C3;</mo>
 <!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>U</mi></mrow><mrow 
><mi 
>x</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>B</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-op"> &#x22C2;</mo>
<!--nolimits--><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>&#x2205;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is countable, so <!--l. 883--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>&#x039B;</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msup 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x039B;</mi> <mo 
class="MathClass-punc">:</mo> <msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>W</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-op"> &#x22C2;</mo><!--nolimits--><msub><mrow 
><mi 
>P</mi></mrow><mrow 
>
<mi 
>&#x03B1;</mi></mrow></msub 
><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>&#x2205;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
is countable. It is easy to check that <!--l. 884--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x039B;</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>W</mi><mo 
class="MathClass-op">&#x22C2;</mo>
<!--nolimits--><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>&#x03B1;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>&#x2205;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow> <mo 
class="MathClass-rel">=</mo> <msup><mrow 
><mi 
>&#x039B;</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msup 
></math>.
This completes the proof. <span class="qed"><span 
class="msam-10x-x-120">&#x25A1;</span></span>
</p>
</div>
<div class="newtheorem">
<!--l. 888--><p class="noindent"><span class="head">
<a 
 id="x1-3019r19"></a>
<span 
class="cmbx-12">Theorem 3.19.</span>  </span><span 
class="cmti-12">Let </span><!--l. 888--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">have a locally countable </span><!--l. 888--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network.</span>
<span 
class="cmti-12">If one of the following holds, then </span><!--l. 889--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
<span 
class="cmti-12">has a locally countable </span><!--l. 889--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmti-12">-network.</span>
</p><!--l. 891--><p class="indent"><span 
class="cmti-12">(1) </span><!--l. 891--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
<span 
class="cmti-12">is &#xFB01;nite subsequence-covering, strongly </span><!--l. 891--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math><span 
class="cmti-12">.</span>
</p><!--l. 893--><p class="indent"><span 
class="cmti-12">(2) </span><!--l. 893--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
<span 
class="cmti-12">is 1-sequence-covering, strongly </span><!--l. 893--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math><span 
class="cmti-12">.</span>
</p><!--l. 895--><p class="indent"><span 
class="cmti-12">(3) </span><!--l. 895--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
<span 
class="cmti-12">is sequentially-quotient, &#xFB01;nite-to-one, strongly </span><!--l. 895--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math><span 
class="cmti-12">.</span>
</p>
</div>
<div class="proof">
<!--l. 897--><p class="indent"><span class="head">
<span 
class="cmti-12">Proof.</span> </span>We only need to prove part (1) by Remark 3.2(1). Let <!--l. 898--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>X</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>Y</mi> </math>
be a &#xFB01;nite subsequence-covering, strongly <!--l. 899--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math>
mapping and <!--l. 900--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">P</mi></math>
be a locally countable <!--l. 900--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network

of <!--l. 900--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>.
Then <!--l. 901--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
is <!--l. 901--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>s</mi><mi 
>n</mi></math>-&#xFB01;rst
countable by lemma 3.11 and <!--l. 902--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is a locally countable family of subsets of <!--l. 902--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
by Lemma 3.18. By a similar way as in the proof of Theorem 3.13, we can
prove <!--l. 904--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
mathvariant="script">P</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is a <!--l. 904--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>c</mi><msup><mrow 
><mi 
>s</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2217;</mo></mrow></msup 
></math>-network
of <!--l. 904--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>Y</mi> </math>.
So <!--l. 905--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>Y</mi> </math>
has a locally countable <!--l. 905--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math>-network
by Remark 2.13. <span class="qed"><span 
class="msam-10x-x-120">&#x25A1;</span></span>
</p>
</div>
<!--l. 908--><p class="indent">The following corollary is obtained by Remark 3.2, Corollary 2.17, Theorem
3.13 and Theorem 3.19.
</p>
<div class="newtheorem">
<!--l. 911--><p class="noindent"><span class="head">
<a 
 id="x1-3020r20"></a>
<span 
class="cmbx-12">Corollary 3.20.</span>  </span><span 
class="cmti-12">Let</span>
<!--l. 911--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">have a locally countable weak-base. If one of the following holds, then</span>
<!--l. 912--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
<span 
class="cmti-12">has a locally countable weak-base.</span>
</p><!--l. 914--><p class="indent"><span 
class="cmti-12">(1)</span>
<!--l. 914--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
<span 
class="cmti-12">is closed, &#xFB01;nite-to-one.</span>
</p><!--l. 916--><p class="indent"><span 
class="cmti-12">(2) </span><!--l. 916--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
<span 
class="cmti-12">is &#xFB01;nite subsequence-covering, quotient, strongly </span><!--l. 916--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math><span 
class="cmti-12">.</span>
</p><!--l. 918--><p class="indent"><span 
class="cmti-12">(3) </span><!--l. 918--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
<span 
class="cmti-12">is 1-sequence-covering, quotient, strongly </span><!--l. 918--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math><span 
class="cmti-12">.</span>
</p><!--l. 920--><p class="indent"><span 
class="cmti-12">(4) </span><!--l. 920--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
<span 
class="cmti-12">is quotient, &#xFB01;nite-to-one, strongly </span><!--l. 920--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi><mi 
>i</mi><mi 
>n</mi><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mover 
accent="true"><mrow 
><mi 
>o</mi></mrow><mo 
class="MathClass-op">&#x0308;</mo></mover><mi 
>f</mi></math><span 
class="cmti-12">.</span>
</p>
</div>

<h3 class="sectionHead"><a 
 id="x1-40003"></a>References</h3>
<!--l. 927--><p class="noindent">
</p><div class="thebibliography">
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">1.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XA"></a><span 
class="cmr-10">A.V.Arhangel&#x2019;skii, Mappings and spaces, Russian Math. Surveys, 21(1966),</span>
<span 
class="cmr-10">115-162.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">2.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XAS"></a><span 
class="cmr-10">A.Arhangel&#x2019;skii  and  S.Franklin,  Ordinal  invariants  for  topological  spaces,</span>
<span 
class="cmr-10">Michigan Math. J., 15(1968), 313-320.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">3.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XBS"></a><span 
class="cmr-10">B.Blacar  and  P.  Simon,  Disjoint  re&#xFB01;nement,  In:  Handbook  of  Boolean</span>
<span 
class="cmr-10">Algebras, V2. Amsterdam: North-Holland, 332-386.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">4.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XBoS"></a><span 
class="cmr-10">J.R.Boone and F.Siwiec, Sequentially quotient mappings, Czech. Math. J.,</span>
<span 
class="cmr-10">26(1976), 174-182.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">5.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XC"></a><span 
class="cmr-10">J.Chaber, Conditions which imply compactness in countably compact spaces,</span>
<span 
class="cmr-10">Bull. Pol. Acad. Math., 24(1976), 993-998.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">6.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XD"></a><span 
class="cmr-10">S.W.Davis, More on Cauchy condition, Topology Proc., 9(1984), 31-36.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">7.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XE"></a><span 
class="cmr-10">R.Engelking,  General  Topology(revised  and  completed  edition),  Berlin:</span>
<span 
class="cmr-10">Heldermann, 1989.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">8.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XF"></a><span 
class="cmr-10">S.P.Franklin,  Spaces  in  which  sequence  suffice,  Fund.  Math.,  57(1965),</span>
<span 
class="cmr-10">107-115.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">9.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XGa"></a><span 
class="cmr-10">D.Gale, Compact sets of functions and function rings, Proc. Amer. Math.</span>
<span 
class="cmr-10">Soc., 1(1950), 303-308.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">10.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XGao"></a><span 
class="cmr-10">Z.Gao, </span><!--l. 952--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x2135;</mi></math><span 
class="cmr-10">-space</span>
<span 
class="cmr-10">is  invariant  under  perfect  mappings,  Q  and  A  in  General  Topology,  5(1987),</span>
<span 
class="cmr-10">271-279.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">11.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XG"></a><span 
class="cmr-10">Y.Ge, On </span><!--l. 955--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmr-10">-metrizable</span>
<span 
class="cmr-10">spaces, Acta Math. Sinica, 45(2002), 355-360.</span>

</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">12.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XG1"></a><span 
class="cmr-10">Y.Ge, Characterizations of </span><!--l. 957--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmr-10">-metrizable</span>
<span 
class="cmr-10">spaces, Publ. Inst. Math., Nouv. Ser., 74(88)(2003), 121-128.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">13.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XG2"></a><span 
class="cmr-10">Y.Ge, Spaces with countable </span><!--l. 960--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi><mi 
>n</mi></math><span 
class="cmr-10">-networks,</span>
<span 
class="cmr-10">Comment Math. Univ. Carolinae, 45(2004), 169-176.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">14.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XGMT"></a><span 
class="cmr-10">G.Gruenhage,    E.Michael    and    Y.Tanaka,    Spaces    determined    by</span>
<span 
class="cmr-10">point-countable covers, Paci&#xFB01;c J. Math., 113(1984), 303-332.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">15.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XGu"></a><span 
class="cmr-10">J.A.Guthrie, A characterization of </span><!--l. 966--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2135;</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math><span 
class="cmr-10">-spaces,</span>
<span 
class="cmr-10">General Topology Appl., 1(1971), 105-110.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">16.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XL4"></a><span 
class="cmr-10">S.Lin, On normal separable </span><!--l. 969--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x2135;</mi></math><span 
class="cmr-10">-space,</span>
<span 
class="cmr-10">Q and A in General Topology, 5(1987), 249-254.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">17.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XL3"></a><span 
class="cmr-10">S.Lin,  Spaces  with  a  locally  countable  k-network,  Northeastern  Math.  J.,</span>
<span 
class="cmr-10">6(1990), 39-44.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">18.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XL5"></a><span 
class="cmr-10">S.Lin, On </span><!--l. 975--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>g</mi></math><span 
class="cmr-10">-metrizable</span>
<span 
class="cmr-10">spaces, Chinese Ann. Math., Ser A, 13(1992), 403-409.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">19.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XL2"></a><span 
class="cmr-10">S.Lin,  Generalized  Metric  Spaces  and  Mappings,  Beijing:  Chinese  Science</span>
<span 
class="cmr-10">Press, 1995.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">20.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XL"></a><span 
class="cmr-10">S.Lin,  A  note  on  the  Arens&#x2019;  spaces  and  sequential  fan,  Topology  Appl.,</span>
<span 
class="cmr-10">81(1997), 185-196.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">21.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XL6"></a><span 
class="cmr-10">S.Lin, A note on spaces with a locally countable k-network, J. of Jishou Univ.,</span>
<span 
class="cmr-10">18(3)(1997), 10-12.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">22.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XL1"></a><span 
class="cmr-10">S.Lin,  Point-Countable  Covers  and  Sequence-Covering  Mappings,  Beijing:</span>
<span 
class="cmr-10">Chinese Science Press, 2002.</span>
</p>

<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">23.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XLY"></a><span 
class="cmr-10">S.Lin and P.Yan, Sequence-covering maps of metric spaces, Topology. Appl,</span>
<span 
class="cmr-10">109(2001), 301-314.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">24.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XLiu"></a><span 
class="cmr-10">C.Liu and M.Dai, Spaces with a locally countable weak base, Math. Japonica,</span>
<span 
class="cmr-10">41(1995), 261-267.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">25.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XLu"></a><span 
class="cmr-10">C.Liu, Notes on weak bases, Q and A in General Topology, 22(2004), 39-42.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">26.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XM"></a><span 
class="cmr-10">E.A.Michael, </span><!--l. 997--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2135;</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math><span 
class="cmr-10">-spaces,</span>
<span 
class="cmr-10">J. Math. Mech., 15(1966), 983-1002.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">27.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XO"></a><span 
class="cmr-10">P.O&#x2019;Meara, On paracompactness in function spaces with the compact-open</span>
<span 
class="cmr-10">topology, Proc. Amer. Math. Soc., 29(1971), 183-189.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">28.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XR"></a><span 
class="cmr-10">J.Roitman, Basic </span><!--l. 1002--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi></math>
<span 
class="cmr-10">and </span><!--l. 1002--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>L</mi></math><span 
class="cmr-10">,</span>
<span 
class="cmr-10">In:  Kumen  K  and  Vaughan  J  E.  eds,  Handbook  of  Set-Theoretic  Topology,</span>
<span 
class="cmr-10">Amsterdan: North-Holland, 295-326, 1984.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">29.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XS"></a><span 
class="cmr-10">F.Siwiec, On de&#xFB01;ning a space by a werk base, Paci&#xFB01;c J. Math., 52(1974),</span>
<span 
class="cmr-10">233-245.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">30.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XT"></a><span 
class="cmr-10">Y.Tanaka, Point-countable covers and </span><!--l. 1008--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math><span 
class="cmr-10">-networks,</span>
<span 
class="cmr-10">Topology Proc., 12(1987), 327-349.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">31.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XT1"></a><span 
class="cmr-10">Y.Tanaka, Theory of </span><!--l. 1011--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math><span 
class="cmr-10">-networks</span>
<span 
class="cmr-10">II, Q and A in General Topology, 19(2001), 27-46.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">32.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XTG"></a><span 
class="cmr-10">Y.Tanaka and Y.Ge, Around quotient compact images of metric spaces, and</span>
<span 
class="cmr-10">symmetric spaces, Houston J. Math., 32(2006), 99-117.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">33.</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><a 
 id="XTL"></a><span 
class="cmr-10">Y.Tanaka         and         Z.Li,         Certain         covering-maps         and</span>
<!--l. 1017--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math><span 
class="cmr-10">-networks,</span>
<span 
class="cmr-10">and related matters, Topology Proc., 27(2003), 317-334.</span></p></div>

<!--l. 1021--><p class="noindent"><span 
class="cmcsc-10x-x-109">D<span 
class="small-caps">e</span><span 
class="small-caps">p</span><span 
class="small-caps">a</span><span 
class="small-caps">r</span><span 
class="small-caps">t</span><span 
class="small-caps">m</span><span 
class="small-caps">e</span><span 
class="small-caps">n</span><span 
class="small-caps">t</span> <span 
class="small-caps">o</span><span 
class="small-caps">f</span> M<span 
class="small-caps">a</span><span 
class="small-caps">t</span><span 
class="small-caps">h</span><span 
class="small-caps">e</span><span 
class="small-caps">m</span><span 
class="small-caps">a</span><span 
class="small-caps">t</span><span 
class="small-caps">i</span><span 
class="small-caps">c</span><span 
class="small-caps">s</span>, S<span 
class="small-caps">u</span><span 
class="small-caps">z</span><span 
class="small-caps">h</span><span 
class="small-caps">o</span><span 
class="small-caps">u</span> U<span 
class="small-caps">n</span><span 
class="small-caps">i</span><span 
class="small-caps">v</span><span 
class="small-caps">e</span><span 
class="small-caps">r</span><span 
class="small-caps">s</span><span 
class="small-caps">i</span><span 
class="small-caps">t</span><span 
class="small-caps">y</span>, S<span 
class="small-caps">u</span><span 
class="small-caps">z</span><span 
class="small-caps">h</span><span 
class="small-caps">o</span><span 
class="small-caps">u</span>, 215006,</span>
<span 
class="cmcsc-10x-x-109">P.R.C<span 
class="small-caps">h</span><span 
class="small-caps">i</span><span 
class="small-caps">n</span><span 
class="small-caps">a</span></span>
</p><!--l. 1023--><p class="noindent"><span 
class="cmti-10x-x-109">E-mail address: </span><span 
class="cmr-10x-x-109">zhugexun@163.com</span>
</p><!--l. 1025--><p class="indent">Received May 12, 2007
</p>
 
</body> 
</html> 



