<?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="34.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="34.tex" /> 
<meta name="date" content="2006-05-06 15:30:00" /> 
<link rel="stylesheet" type="text/css" href="34.css" /> 
</head><body 
>
<!--l. 94--><p class="noindent"><span 
class="cmbx-12">Lobachevskii Journal of Mathematics</span>
<span 
class="cmtt-12">http://ljm.ksu.ru</span>
<span 
class="cmtt-12">ISSN 1818-9962</span>
<span 
class="cmbx-12">Vol.</span><span 
class="cmbx-12">&#x00A0;21, 2006, 33&#x2013;44</span>
</p><!--l. 94--><p class="noindent"><span 
class="cmsy-10x-x-120">&#x00A9;</span>&#x00A0;A. Benbrik, A. Mbarki, S. Lahrech, A. Ouahab
</p>
<div class="center" 
>
<!--l. 94--><p class="noindent">
</p><!--l. 94--><p class="noindent"><span 
class="cmsl-12">A. Benbrik, A. Mbarki, S. Lahrech, A. Ouahab</span><br />
<span 
class="cmbx-12">EKELAND&#x2019;S PRINCIPLE FOR VECTOR-VALUED MAPS</span>
<span 
class="cmbx-12">BASED ON THE CHARACTERIZATION OF UNIFORM</span>
<span 
class="cmbx-12">SPACES VIA FAMILIES OF GENERALIZED</span>
<span 
class="cmbx-12">QUASI-METRICS</span><br />
(submitted by A. Lapin)</p></div>
   <!--l. 99--><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">. Using a new characterization of uniform spaces via Families of</span>
   <span 
class="cmr-10x-x-109">generalized quasi-metrics, we present a variant of Ekeland&#x2019;s variational</span>
   <span 
class="cmr-10x-x-109">principle for vector-valued maps being a consequence of minimal point</span>
   <span 
class="cmr-10x-x-109">theorem.</span>

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

________________
<!--l. 105--><p class="noindent"><span 
class="cmti-10x-x-109">2000 Mathematical Subject Classi&#xFB01;cation</span>. <span 
class="cmr-10x-x-109">58E30.</span>
</p><!--l. 105--><p class="noindent"><span 
class="cmti-12">Key  words  and  phrases</span>.  <span 
class="cmr-10x-x-109">Ekeland&#x2019;s  principle  for  vector-valued  maps,</span>
<span 
class="cmr-10x-x-109">minimal point theorem, uniform spaces, family of generalized quasi-metrics.</span>

</p>
</td></tr></table></div><hr class="endfloat" />
<!--l. 109--><p class="indent">1 <span 
class="cmbx-12">Introduction</span>
</p><!--l. 112--><p class="indent">Ekeland&#x2019;s variational principle <span class="cite">[<a 
href="#Xr8">9</a>]</span> is an important tool in nonlinear
analysis. In the last decades various theorems had been presented which
turned out to be equivalent to Ekeland&#x2019;s principle. One of them, a lemma due
to R. R. Phelps (see <span class="cite">[<a 
href="#Xr29">30</a>]</span> and especially the version of (<span class="cite">[<a 
href="#Xr30">31</a>]</span> from 1989) can be
considered as the &#xFB01;rst minimal point theorem. Phelp&#x2019;s lemma yields the
existence of minimal point with respect to a partial ordering in a subset of
<!--l. 119--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi 
>R</mi></math>, where
<!--l. 119--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math> is a Banach
space and <!--l. 120--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>R</mi></math>
denotes the reals.
</p><!--l. 123--><p class="indent">Minimal point theorems in a product space
<!--l. 123--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi 
>Y</mi> </math> were
established by Gopfert and Tammer <span class="cite">[<a 
href="#Xr12">13</a>]</span>, 1995 and generalized by Gopfert,
Tammer and Zalinescu in <span class="cite">[<a 
href="#Xr14">15</a>]</span>, 2000 and in <span class="cite">[<a 
href="#Xr13">14</a>]</span>, 1999. In the latest version,
<!--l. 126--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math> is a complete
metric space and <!--l. 127--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
is a separated locally convex space. These theorems are useful tools in vector
optimization. In <span class="cite">[<a 
href="#Xr14">15</a>]</span>, <span class="cite">[<a 
href="#Xr13">14</a>]</span> a variational principle for vector-valued functions
<!--l. 130--><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> was
presented to be an easy consequence of the minimal point theorem.
</p><!--l. 133--><p class="indent">A generalization of Ekeland&#x2019;s variational principle with respect to the space
<!--l. 134--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math> was
given by Fang <span class="cite">[<a 
href="#Xr9">10</a>]</span>, 1996. He introduced the concept of &#x201C;F-type topological
spaces&#x201D; generating the topology by families of quasi-metrics. Andreas Hamel
and Andreas Lohne proved in <span class="cite">[<a 
href="#Xr0">1</a>]</span> that the class of Fang&#x2019;s F-type spaces
coincides with the class of separated uniform spaces introduced by Weil <span class="cite">[<a 
href="#Xr33">34</a>]</span>,
1937.
</p><!--l. 141--><p class="indent">In this paper we present a variant of Ekeland&#x2019;s variational principle for
vector-valued maps as a consequence of minimal point theorem. The proof of
the result is based on the Characterization of Uniform Spaces via Families of
generalized quasi-metrics.
</p><!--l. 148--><p class="indent"><span 
class="cmbx-12">2 Family of generalized quasi-metrics and Uniform Spaces</span>
</p><!--l. 151--><p class="indent">In this section we present a characterization of uniform spaces via families
of generalized quasi-metrics.
</p><!--l. 153--><p class="indent">Initially, we shall recall the concept of uniform space. For further details see

Kelly <span class="cite">[<a 
href="#Xr21">22</a>]</span> or Kothe <span class="cite">[<a 
href="#Xr22">23</a>]</span>.
</p><!--l. 155--><p class="indent">Let <!--l. 155--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math> be a nonempty set.
We consider a system <!--l. 155--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">&#x211B;</mi></math>
of subsets <!--l. 156--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>N</mi></math>
of <!--l. 156--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi 
>X</mi></math>. For
<!--l. 156--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>N</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>X</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi 
>X</mi></math> we denote
<!--l. 157--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>N</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mspace class="nbsp" /><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>N</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math> and
<!--l. 157--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>N</mi> <mo 
class="MathClass-bin">&#x2218;</mo> <mi 
>N</mi> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi 
>X</mi> <mo 
class="MathClass-punc">:</mo> <mspace class="nbsp" /><mo 
class="MathClass-op">&#x2203;</mo><mi 
>z</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi><mspace class="nbsp" /><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">,</mo> <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>N</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>. The set
<!--l. 159--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x0394;</mi> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mspace class="nbsp" /><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math> is called the
diagonal. The set <!--l. 159--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
is said to be an uniform space if and only if there exists a &#xFB01;lter
<!--l. 160--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">&#x211B;</mi></math> on
<!--l. 161--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi 
>X</mi></math>
satisfying
<!--tex4ht:inline--></p><!--l. 162--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
<mtable  align="axis"  
equalrows="false" equalcolumns="false" class="array"><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>N</mi><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mo 
class="MathClass-op">&#x2200;</mo><mi 
>N</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">&#x211B;</mi><mspace width="1em" class="quad"/><mi 
>&#x0394;</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>N</mi><mo 
class="MathClass-punc">;</mo>                  </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>N</mi><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mo 
class="MathClass-op">&#x2200;</mo><mi 
>N</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">&#x211B;</mi><mspace width="1em" class="quad"/><msup><mrow 
><mi 
>N</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">&#x211B;</mi><mo 
class="MathClass-punc">;</mo>               </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>N</mi><mn>3</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mo 
class="MathClass-op">&#x2200;</mo><mi 
>N</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">&#x211B;</mi><mspace width="1em" class="quad"/><mo 
class="MathClass-op">&#x2203;</mo><mi 
>M</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">&#x211B;</mi><mspace class="nbsp" /><mi 
>M</mi> <mo 
class="MathClass-bin">&#x2218;</mo> <mi 
>M</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>N</mi><mo 
class="MathClass-punc">.</mo></mtd></mtr><!--ll--></mtable>
</math>
<!--l. 170--><p class="nopar">The system <!--l. 171--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">&#x211B;</mi></math> is called
a uniformity on <!--l. 171--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>.
By the sets
<!--tex4ht:inline--></p><!--l. 173--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
                      <mi 
>&#x03B8;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>U</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> <mspace class="nbsp" /><mi 
>N</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">&#x211B;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-punc">,</mo>
</math>

<!--l. 175--><p class="nopar">where <!--l. 177--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>U</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">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi> <mo 
class="MathClass-punc">:</mo> <mspace class="nbsp" /><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>N</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>,
a topology is given, which is called the uniform topology on
<!--l. 179--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>. Of
course, an uniform space is already well-de&#xFB01;ned by a base of its uniformity
<!--l. 180--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">&#x211B;</mi></math>, i.e a &#xFB01;lter
base <!--l. 180--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">&#x212C;</mi></math> of the
uniformity <!--l. 181--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
mathvariant="script">&#x211B;</mi></math>.
The topology of an uniform space is separated if and only if
<!--tex4ht:inline--></p><!--l. 182--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
                         <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>N</mi><mn>4</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace class="nbsp" /><mspace class="nbsp" /><munder class="msub"><mrow 
><mo mathsize="big" 
> &#x22C2;</mo>
  </mrow><mrow 
><mi 
>N</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
mathvariant="script">&#x211B;</mi></mrow></munder 
><mi 
>N</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x0394;</mi><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 182--><p class="nopar">For a proof see (<span class="cite">[<a 
href="#Xr22">23</a>]</span>,p. 32).
</p><!--l. 184--><p class="indent">We recall a well-established result, the characterization of uniform spaces
using families of pseudo-metrics see <span class="cite">[<a 
href="#Xr21">22</a>]</span>.
</p><!--l. 188--><p class="indent"><span 
class="cmbx-12">De&#xFB01;nition 1. </span>Let <!--l. 188--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math> be a
nonempty set. A function <!--l. 188--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>p</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>X</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi 
>X</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mrow><mo 
class="MathClass-open">[</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo> <mo 
class="MathClass-bin">+</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is called pseudo-metric on <!--l. 189--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
if and only if for all <!--l. 190--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi><mo 
class="MathClass-punc">,</mo><mi 
>z</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>
the following conditions are satis&#xFB01;ed:
<!--tex4ht:inline--></p><!--l. 191--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
<mtable  align="axis"  
equalrows="false" equalcolumns="false" class="array"><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>P</mi><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mi 
>p</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mo 
class="MathClass-punc">;</mo>                   </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>P</mi><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mi 
>p</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mi 
>p</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">;</mo>            </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>P</mi><mn>3</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mi 
>p</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>p</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">+</mo> <mi 
>p</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi><mo 
class="MathClass-punc">,</mo><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">.</mo></mtd></mtr><!--ll--></mtable>
</math>
<!--l. 199--><p class="nopar">

</p><!--l. 202--><p class="indent">Let <!--l. 202--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x2113;</mi><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-rel">&#x227A;</mo></mrow><mo 
class="MathClass-close">)</mo></mrow></math> be a directed
set. A system <!--l. 203--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>p</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>&#x2113;</mi></mrow></msub 
></math> of
pseudo-metrics <!--l. 204--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>p</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>X</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi 
>X</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mrow><mo 
class="MathClass-open">[</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo> <mo 
class="MathClass-bin">+</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
satisfying
<!--tex4ht:inline--></p><!--l. 204--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
               <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>P</mi><mn>4</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace class="nbsp" /><mspace class="nbsp" /><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x227A;</mo> <mi 
>&#x03BC;</mi> <mo 
class="MathClass-rel">&#x21D2;</mo><mo 
class="MathClass-op">&#x2200;</mo><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi><mspace class="nbsp" /><mspace class="nbsp" /><msub><mrow 
><mi 
>p</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2264;</mo> <msub><mrow 
><mi 
>p</mi></mrow><mrow 
><mi 
>&#x03BC;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow>
</math>
<!--l. 206--><p class="nopar">is called a family of pseudo-metrics. If additionally the condition
<!--tex4ht:inline--></p><!--l. 207--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
                      <msub><mrow 
><mi 
>p</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mspace class="nbsp" /><mspace class="nbsp" /><mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi> <mo 
class="MathClass-rel">&#x21D2;</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>y</mi>
</math>
<!--l. 208--><p class="nopar">holds, the family of pseudo-metrics is said to be separating.
</p><!--l. 212--><p class="indent"><span 
class="cmbx-12">Proposition 1. </span>A topological space
<!--l. 213--><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 
>&#x03C4;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is a separated uniform space if and only if its topology
<!--l. 214--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C4;</mi></math> can
be generated by a separating family of pseudo-metrics.
</p><!--l. 218--><p class="indent"><span 
class="cmti-12">Proof. </span>See (<span class="cite">[<a 
href="#Xr21">22</a>]</span>,p. 188, Theorem 15).
</p><!--l. 221--><p class="indent">Fang <span class="cite">[<a 
href="#Xr9">10</a>]</span> introduced so-called <!--l. 221--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>F</mi><mo 
class="MathClass-bin">&#x2212;</mo></math>
type topological using families of quasi-metrics.
</p><!--l. 225--><p class="indent"><span 
class="cmbx-12">De&#xFB01;nition 2. </span>Let <!--l. 225--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math> be
a nonempty set and let <!--l. 225--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x2113;</mi><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-rel">&#x227A;</mo></mrow><mo 
class="MathClass-close">)</mo></mrow></math> be
a directed set. A system <!--l. 226--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>&#x2113;</mi></mrow></msub 
></math>

of functions <!--l. 227--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>X</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi 
>X</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mrow><mo 
class="MathClass-open">[</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo> <mo 
class="MathClass-bin">+</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
satisfying
<!--tex4ht:inline--></p><!--l. 229--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
<mtable  align="axis"  
equalrows="false" equalcolumns="false" class="array"><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>Q</mi><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi><mspace width="1em" class="quad"/><mo 
class="MathClass-op">&#x2200;</mo><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi><mspace width="1em" class="quad"/><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mo 
class="MathClass-punc">;</mo>                   </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>Q</mi><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi><mspace class="nbsp" /><mo 
class="MathClass-op">&#x2200;</mo><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi><mspace width="1em" class="quad"/><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">;</mo>        </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>Q</mi><mn>3</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi><mspace class="nbsp" /><mo 
class="MathClass-op">&#x2203;</mo><mi 
>&#x03BC;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi><!--mstyle 
class="mbox"--><mtext >&#x00A0;such&#x00A0;that&#x00A0;</mtext><!--/mstyle--><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x227A;</mo> <mi 
>&#x03BC;</mi><!--mstyle 
class="mbox"--><mtext >&#x00A0;and&#x00A0;</mtext><!--/mstyle-->        </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left">     </mtd><mtd 
class="array"  columnalign="left"><mo 
class="MathClass-op">&#x2200;</mo><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi><mo 
class="MathClass-punc">,</mo><mi 
>z</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2264;</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BC;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">+</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BC;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi><mo 
class="MathClass-punc">,</mo><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">;</mo></mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>Q</mi><mn>4</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x227A;</mo> <mi 
>&#x03BC;</mi> <mo 
class="MathClass-rel">&#x21D2;</mo><mo 
class="MathClass-op">&#x2200;</mo><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2264;</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BC;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow>     </mtd></mtr><!--ll--></mtable>
</math>
<!--l. 244--><p class="nopar">is called a family of quasi-metrics. If in addition the condition
<!--tex4ht:inline--></p><!--l. 246--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
                     <mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mspace class="nbsp" /><mspace class="nbsp" /><mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x21D2;</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>y</mi>
</math>
<!--l. 246--><p class="nopar">is satis&#xFB01;ed, the family of quasi-metrics is said to be separating.
</p><!--l. 251--><p class="indent"><span 
class="cmbx-12">Proposition 2. </span>A topological space
<!--l. 251--><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 
>&#x03C4;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is a separated uniform space if and only if its topology
<!--l. 252--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C4;</mi></math> can
be generated by a separating family of quasi-metrics.
</p><!--l. 256--><p class="indent"><span 
class="cmti-12">Proof. </span>See (<span class="cite">[<a 
href="#Xr0">1</a>]</span>,p. 3, Theorem 4).
</p><!--l. 259--><p class="indent"><span 
class="cmbx-12">De&#xFB01;nition 3. </span>Let <!--l. 259--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math> be
a nonempty set. A system <!--l. 260--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>&#x2113;</mi></mrow></msub 
></math>
of functions <!--l. 261--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>X</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi 
>X</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mrow><mo 
class="MathClass-open">[</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo> <mo 
class="MathClass-bin">+</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
satisfying

<!--tex4ht:inline--></p><!--l. 262--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
<mtable  align="axis"  
equalrows="false" equalcolumns="false" class="array"><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>Q</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msup 
><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi><mspace class="nbsp" /><mo 
class="MathClass-op">&#x2200;</mo><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi><mspace width="1em" class="quad"/><msub><mrow 
><mi 
>q</mi></mrow><mrow 
>
<mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mo 
class="MathClass-punc">;</mo>                                        </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>Q</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msup 
><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi><mspace class="nbsp" /><mo 
class="MathClass-op">&#x2200;</mo><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi><mspace width="1em" class="quad"/><msub><mrow 
><mi 
>q</mi></mrow><mrow 
>
<mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">;</mo>                             </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>Q</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msup 
><mn>3</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mo 
class="MathClass-op">&#x2203;</mo><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
>
<mn>1</mn></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x03BB;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>&#x2113;</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x03BB;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>&#x2113;</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>&#x2113;</mi><!--mstyle 
class="mbox"--><mtext >&#x00A0;such&#x00A0;that&#x00A0;</mtext><!--/mstyle--><mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi><mspace class="nbsp" /><mo 
class="MathClass-op">&#x2200;</mo><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi><mo 
class="MathClass-punc">,</mo><mi 
>z</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left">     </mtd><mtd 
class="array"  columnalign="left"><mi 
>z</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>y</mi><mo 
class="MathClass-punc">,</mo><mspace class="nbsp" /><mi 
>y</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>x</mi><mspace width="1em" class="quad"/><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2264;</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x03BB;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">+</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x03BB;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi><mo 
class="MathClass-punc">,</mo><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow>                  </mtd></mtr><!--ll--></mtable>
</math>
<!--l. 279--><p class="nopar">is called a family of generalized quasi-metrics. In this case,
<!--l. 282--><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><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>&#x2113;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math> is
called a generalized quasi-metric space. If in addition the condition
<!--tex4ht:inline--></p><!--l. 284--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
                     <mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mspace class="nbsp" /><mspace class="nbsp" /><mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x21D2;</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>y</mi>
</math>
<!--l. 284--><p class="nopar">is satis&#xFB01;ed, the family of generalized quasi-metrics is said to be separating.
</p><!--l. 290--><p class="indent">Our de&#xFB01;nition is slightly more general because on the one hand
<!--l. 291--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x2113;</mi></math> has
not to be directed set in our case and on the other hand, the assumption (Q3)
in De&#xFB01;nition 2 is an optional condition, not automatically satis&#xFB01;ed in our
De&#xFB01;nition.
</p><!--l. 295--><p class="indent">Our &#xFB01;rst result clari&#xFB01;es the relation between separated uniform spaces
and topological spaces generated by separating families of generalized
quasi-metrics.
</p><!--l. 300--><p class="indent"><span 
class="cmbx-12">Proposition 3. </span>A topological space
<!--l. 300--><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 
>&#x03C4;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is a separated uniform space if and only if its topology
<!--l. 301--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C4;</mi></math>
can be generated by a separating family of generalized quasi-metrics.

</p><!--l. 305--><p class="indent"><span 
class="cmti-12">Proof. </span>Let <!--l. 305--><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 
>&#x03C4;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math> be a topological
space where <!--l. 305--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C4;</mi></math> is generated
by a separating family <!--l. 306--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>&#x2113;</mi></mrow></msub 
></math> of
generalized quasi-metrics, i.e. <!--l. 307--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C4;</mi></math>
is given by
<!--tex4ht:inline--></p><!--l. 308--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
        <mi 
>&#x2118;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>U</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mspace class="nbsp" /><mi 
>t</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn><mo 
class="MathClass-punc">,</mo><mspace class="nbsp" /><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>N</mi><mo 
class="MathClass-punc">,</mo><mspace class="nbsp" /><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow>
</math>
<!--l. 310--><p class="nopar">where
<!--tex4ht:inline--></p><!--l. 311--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
        <mi 
>U</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi> <mo 
class="MathClass-punc">:</mo> <mspace class="nbsp" /><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>i</mi></mrow></msub 
></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mspace class="nbsp" /><mn>1</mn> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>i</mi> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>n</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 313--><p class="nopar">We claim that a base of a uniformity is given by the system

<!--tex4ht:inline--></p><!--l. 315--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
           <mi 
>&#x2135;</mi> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>S</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mspace class="nbsp" /><mi 
>t</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn><mo 
class="MathClass-punc">,</mo><mspace class="nbsp" /><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>N</mi><mo 
class="MathClass-punc">,</mo><mspace class="nbsp" /><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow>
</math>
<!--l. 316--><p class="nopar">where
<!--tex4ht:inline--></p><!--l. 317--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
     <mi 
>S</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi 
>X</mi> <mo 
class="MathClass-punc">:</mo> <mspace class="nbsp" /><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>i</mi></mrow></msub 
></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mspace class="nbsp" /><mn>1</mn> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>i</mi> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>n</mi></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 318--><p class="nopar">To show that <!--l. 318--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x2135;</mi></math> is a
&#xFB01;lter base let <!--l. 319--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>t</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn><mo 
class="MathClass-punc">,</mo><mspace class="nbsp" /><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>N</mi><mo 
class="MathClass-punc">,</mo><mspace class="nbsp" /><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi></math> and
<!--l. 320--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>t</mi></mrow><mrow 
><mn>2</mn> </mrow> </msub 
> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>p</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>N</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><mi 
>p</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi></math> be arbitrarily given. Set
<!--l. 321--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>t</mi></mrow><mrow 
><mn>3</mn> </mrow> </msub 
> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo><mo class="qopname"> min</mo><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>t</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>t</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,<!--l. 321--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>r</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>n</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>p</mi></math>.
Consider the sequence <!--l. 322--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><mi 
>p</mi></mrow></msub 
></math>.
Then <!--l. 323--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>r</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><mi 
>p</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>t</mi></mrow><mrow 
><mn>3</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>S</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>t</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-op"> &#x22C2;</mo>
 <!--nolimits--><mi 
>S</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>p</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><mi 
>p</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>t</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
</p><!--l. 326--><p class="indent">Furthermore, <!--l. 326--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x2205;</mi><mo 
class="MathClass-rel">&#x2209;</mo><mi 
>&#x2135;</mi></math>
since each <!--l. 327--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
contains the diagonal.
</p><!--l. 328--><p class="indent">Let <!--l. 328--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x211C;</mi></math> be the &#xFB01;lter
generated by <!--l. 328--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x2135;</mi></math>. We
shall show that <!--l. 329--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x2135;</mi></math> is a
base of uniformity on <!--l. 329--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>.
The axioms <!--l. 329--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>N</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
and <!--l. 330--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>N</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math> are
satis&#xFB01;ed for <!--l. 330--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x2135;</mi></math>.
To verify <!--l. 330--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>N</mi></mrow><mrow 
><mn>3</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math> let
<!--l. 331--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>t</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn><mo 
class="MathClass-punc">,</mo><mspace class="nbsp" /><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>N</mi><mo 
class="MathClass-punc">,</mo><mspace class="nbsp" /><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi></math> be arbitrarily
given. Taking <!--l. 333--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo> <mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>2</mn><mi 
>n</mi><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>2</mn><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
from (Q&#x2019;3) we set <!--l. 335--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>M</mi> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mi 
>S</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>3</mn><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>3</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>4</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>2</mn><mi 
>n</mi><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>2</mn><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo> <mfrac><mrow 
><mi 
>t</mi></mrow> 
<mrow 
><mn>2</mn></mrow></mfrac></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
</p><!--l. 336--><p class="indent">Then we have <!--l. 336--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>M</mi> <mo 
class="MathClass-bin">&#x2218;</mo> <mi 
>M</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>S</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.

Indeed, let <!--l. 337--><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 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>M</mi> <mo 
class="MathClass-bin">&#x2218;</mo> <mi 
>M</mi></math>,
i.e.
<!--tex4ht:inline--></p><!--l. 337--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
                      <mo 
class="MathClass-op">&#x2203;</mo><mi 
>z</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi> <mo 
class="MathClass-punc">:</mo> <mspace class="nbsp" /><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">,</mo> <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>M</mi><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 338--><p class="nopar">If <!--l. 338--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>z</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>y</mi></math> or
<!--l. 338--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>z</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>x</mi></math>, then
<!--l. 338--><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 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>M</mi></math>.
Therefore,
<!--tex4ht:inline--></p><!--l. 340--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
              <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>i</mi></mrow></msub 
></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x003C;</mo> <mfrac><mrow 
><mi 
>t</mi></mrow> 
<mrow 
><mn>2</mn></mrow></mfrac> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>t</mi><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >for&#x00A0;all</mtext><!--/mstyle--><mspace class="nbsp" /><mi 
>i</mi><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >such&#x00A0;that</mtext><!--/mstyle--><mspace class="nbsp" /><mn>1</mn> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>i</mi> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>n</mi><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 341--><p class="nopar">Hence, <!--l. 341--><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 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>S</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">.</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
</p><!--l. 343--><p class="indent">If now <!--l. 343--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>z</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>y</mi></math>
and <!--l. 343--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>z</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>x</mi></math>,
then <!--l. 343--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mi 
>i</mi></mrow></msub 
></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x003C;</mo> <mfrac><mrow 
><mi 
>t</mi></mrow> 
<mrow 
><mn>2</mn></mrow></mfrac></math>,
<!--l. 344--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mi 
>i</mi> </mrow> </msub 
> </mrow> </msub 
> <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x003C;</mo> <mfrac><mrow 
><mi 
>t</mi></mrow> 
<mrow 
><mn>2</mn></mrow></mfrac></math>,
<!--l. 344--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mn>1</mn> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>i</mi> <mo 
class="MathClass-rel">&#x2264;</mo> <mn>2</mn><mi 
>n</mi></math>.
Hence

<!--tex4ht:inline--></p><!--l. 344--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
            <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>i</mi></mrow></msub 
></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2264;</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>2</mn><mi 
>i</mi><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msub 
></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">+</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><msub><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mn>2</mn><mi 
>i</mi></mrow></msub 
></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mspace class="nbsp" /><mn>1</mn> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>i</mi> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>n</mi><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 346--><p class="nopar">Therefore, <!--l. 346--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x211C;</mi></math> is a uniformity
generating the topology <!--l. 347--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C4;</mi></math>.
If additionally the family <!--l. 348--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>&#x2113;</mi></mrow></msub 
></math>
of generalized quasi-metrics is separating, then the uniform space
<!--l. 349--><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 
>&#x03C4;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math> is
separated.
</p><!--l. 352--><p class="indent">The opposite assertion follows by Proposition 1 taking into account that
a family of pseudo-metrics is in particular a family of generalized
quasi-metrics.
</p><!--l. 355--><p class="indent">An important class of uniform spaces is the class of topological
vector spaces. Indeed, For topological vector space the topology can be
generated by a family of quasi-norms. This result is due to Hyers <span class="cite">[<a 
href="#Xr18">19</a>]</span>,
1939 who used the term &#x201D;pseudo-norms&#x201D; instead of &#x201D;quasi-norms&#x201D;.
</p><!--l. 362--><p class="indent"><span 
class="cmbx-12">3. Main Tools</span>
</p><!--l. 365--><p class="indent">For the convenience of the reader we present the main tools for the proof of
our minimal point theorem. The &#xFB01;rst one is the Br&#x00E9;zis-Browder principle.
</p><!--l. 371--><p class="indent"><span 
class="cmbx-12">Theorem 1. </span>Let <!--l. 371--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>W</mi><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mo 
class="MathClass-close">)</mo></mrow></math> be
a quasi-ordered set (i.e. <!--l. 371--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mo 
class="MathClass-rel">&#x227C;</mo></math>
is a re&#xFB02;exive and transitive relation) and let
<!--l. 373--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C6;</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>W</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mi 
>R</mi></math> be a
function satisfying

<!--tex4ht:inline--></p><!--l. 374--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
<mtable  align="axis"  
equalrows="false" equalcolumns="false" class="array"><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>A</mi><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mspace class="nbsp" /><mi 
>&#x03C6;</mi><!--mstyle 
class="mbox"--><mtext >&#x00A0;is&#x00A0;bounded&#x00A0;below&#x00A0;</mtext><!--/mstyle--><mo 
class="MathClass-punc">;</mo>                                                     </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>A</mi><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mspace class="nbsp" /><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x227C;</mo> <msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x21D2;</mo> <mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">;</mo>                                            </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>A</mi><mn>3</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >For&#x00A0;every&#x00A0;</mtext><!--/mstyle--><mo 
class="MathClass-rel">&#x227C;</mo><!--mstyle 
class="mbox"--><mtext >&#x2013;&#x00A0;decreasing&#x00A0;sequence&#x00A0;</mtext><!--/mstyle--><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>N</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>W</mi><!--mstyle 
class="mbox"--><mtext >&#x00A0;there&#x00A0;exists</mtext><!--/mstyle--></mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left">     </mtd><mtd 
class="array"  columnalign="left"><!--mstyle 
class="mbox"--><mtext >&#x00A0;some&#x00A0;</mtext><!--/mstyle--><mi 
>w</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>W</mi><!--mstyle 
class="mbox"--><mtext >&#x00A0;such&#x00A0;that&#x00A0;</mtext><!--/mstyle--><mi 
>w</mi> <mo 
class="MathClass-rel">&#x227C;</mo> <msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><!--mstyle 
class="mbox"--><mtext >&#x00A0;for&#x00A0;all&#x00A0;</mtext><!--/mstyle--><mspace class="nbsp" /><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>N</mi><mo 
class="MathClass-punc">.</mo>                </mtd></mtr><!--ll--></mtable>
</math>
<!--l. 388--><p class="nopar">Then, for every <!--l. 389--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>W</mi></math>
there exists some <!--l. 390--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>W</mi></math>
such that
<!--tex4ht:inline--></p><!--l. 392--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
             <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>i</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace class="nbsp" /><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover> <mo 
class="MathClass-rel">&#x227C;</mo> <msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><mo 
class="MathClass-punc">;</mo> <mspace width="2em" class="qquad"/><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>i</mi><mi 
>i</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace class="nbsp" /><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover> <mo 
class="MathClass-rel">&#x227C;</mo><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover> <mo 
class="MathClass-rel">&#x21D2;</mo> <mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 396--><p class="nopar">In particular, if we strengthen (A2) to
<!--l. 398--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>A</mi></mrow><mrow 
><mi 
>&#x2032;</mi> </mrow> </msup 
> <mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace class="nbsp" /><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
>
<mn>1</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x227C;</mo> <msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-rel">&#x2260;</mo><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x21D2;</mo> <mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math> it
holds
<!--tex4ht:inline--></p><!--l. 400--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
         <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>i</mi><msup><mrow 
><mi 
>i</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace class="nbsp" /><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover> <mo 
class="MathClass-rel">&#x227C;</mo><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover> <mo 
class="MathClass-rel">&#x21D2;</mo><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover> <mo 
class="MathClass-rel">=</mo> <mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover><mo 
class="MathClass-punc">,</mo><mspace class="nbsp" /><mi 
>i</mi><mo 
class="MathClass-punc">.</mo><mi 
>e</mi><mo 
class="MathClass-punc">.</mo><mspace class="nbsp" /><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >is</mtext><!--/mstyle--><mspace class="nbsp" /><mo 
class="MathClass-rel">&#x227C;</mo><!--mstyle 
class="mbox"--><mtext >&#x2013;&#x00A0;minimal&#x00A0;in</mtext><!--/mstyle--><mspace class="nbsp" /><mi 
>W</mi><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 404--><p class="nopar">
</p><!--l. 406--><p class="indent"><span 
class="cmti-12">Proof. </span>See [<span class="cite">[<a 
href="#Xr2">3</a>]</span>, Corollary 1].

</p><!--l. 408--><p class="indent">Note that A&#x2019;2 implies the antisymmetry of the relation
<!--l. 409--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x227C;</mo></math>.
</p><!--l. 410--><p class="indent">A second important tool is a scalarization method established by
Gerstewitz (Tammer), Iwanow <span class="cite">[<a 
href="#Xr11">12</a>]</span> and Gerth (Tammer), Weidner
<span class="cite">[<a 
href="#Xr10">11</a>]</span>.
</p><!--l. 415--><p class="indent"><span 
class="cmbx-12">Theorem 2. </span>Let <!--l. 415--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math> be a
topological vector space, <!--l. 415--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>Y</mi> </math>
a convex cone and <!--l. 416--><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 
>K</mi> <mo 
class="MathClass-bin">&#x2216;</mo><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>c</mi><mi 
>l</mi><mspace class="nbsp" /><mi 
>K</mi></math>.
The functional&#x00A0;<!--l. 417--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>z</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>Y</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mi 
>R</mi><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mo 
class="MathClass-bin">+</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>,
de&#xFB01;ned as <!--l. 417--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>z</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo><mo class="qopname"> inf</mo><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>t</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>R</mi> <mo 
class="MathClass-punc">:</mo> <mspace class="nbsp" /><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>t</mi><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>c</mi><mi 
>l</mi><mspace class="nbsp" /><mi 
>K</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
has the following properties
<!--tex4ht:inline--></p><!--l. 419--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
<mtable  align="axis"  
equalrows="false" equalcolumns="false" class="array"><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>H</mi><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace class="nbsp" /><mi 
>z</mi><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >is&#x00A0;sublinear</mtext><!--/mstyle--><mo 
class="MathClass-punc">;</mo>                                                               </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>H</mi><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace class="nbsp" /><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x21D2;</mo> <mi 
>z</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>z</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">;</mo>                                             </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>H</mi><mn>3</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace class="nbsp" /><mo 
class="MathClass-op">&#x2200;</mo><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>Y</mi> <mspace class="nbsp" /><mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>R</mi><mspace class="nbsp" /><mspace class="nbsp" /><mi 
>z</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x03B1;</mi><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mi 
>z</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">+</mo> <mi 
>&#x03B1;</mi><mo 
class="MathClass-punc">;</mo>                               </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>H</mi><mn>4</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >If</mtext><!--/mstyle--><mspace class="nbsp" /><msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>Y</mi> <mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >is</mtext><!--/mstyle--><mspace class="nbsp" /> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >bounded&#x00A0;below</mtext><!--/mstyle--><mo 
class="MathClass-punc">,</mo><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >then</mtext><!--/mstyle--><mspace class="nbsp" /><mi 
>z</mi><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >is&#x00A0;bounded&#x00A0;below&#x00A0;on</mtext><!--/mstyle--><mspace class="nbsp" /><msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
><mn>0</mn></mrow></msub 
><mo 
class="MathClass-punc">.</mo></mtd></mtr><!--l--></mtable>
</math>
<!--l. 431--><p class="nopar">
</p><!--l. 434--><p class="indent"><span 
class="cmti-12">Proof. </span>See [<span class="cite">[<a 
href="#Xr14">15</a>]</span>, Lemma 7] taking into account that
<!--l. 434--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math> has not
to be separated for the proof. Moreover, in the de&#xFB01;nition of the functional the
closed cone can be replaced by the closure of a not necessarily closed cone (since
<!--l. 437--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>1</mn> </mrow> </msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></math> implies
<!--l. 438--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>1</mn> </mrow> </msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>c</mi><mi 
>l</mi><mi 
>K</mi></mrow></msub 
><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></math>). Then, if
<!--l. 438--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math> is not separated,
we have to choose <!--l. 439--><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 
>K</mi> <mo 
class="MathClass-bin">&#x2216;</mo><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>c</mi><mi 
>l</mi><mspace class="nbsp" /><mi 
>K</mi></math>
to avoid <!--l. 439--><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 
>c</mi><mi 
>l</mi><mrow><mo 
class="MathClass-open">{</mo><mrow><mn>0</mn></mrow><mo 
class="MathClass-close">}</mo></mrow></math>. If
<!--l. 440--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math> is separated it
suffices to suppose <!--l. 440--><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 
>K</mi> <mo 
class="MathClass-bin">&#x2216;</mo><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>K</mi></math>.
</p><!--l. 441--><p class="indent">Let <!--l. 441--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math> be a topological
vector space and <!--l. 441--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>Y</mi> </math>
a convex cone. We use the following assumption to derive strong (in <span class="cite">[<a 
href="#Xr14">15</a>]</span>

called &#x201D;authentic&#x201D;) variants of the minimal point theorem.
</p><!--l. 445--><p class="indent">(C)&#x00A0;There exists a proper cone convex
<!--l. 445--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>C</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>Y</mi> </math> satisfying
<!--l. 446--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi> <mo 
class="MathClass-bin">&#x2216;</mo><mrow><mo 
class="MathClass-open">{</mo><mrow><mn>0</mn></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>i</mi><mi 
>n</mi><mi 
>t</mi><mspace class="nbsp" /><mi 
>C</mi></math>.
</p><!--l. 450--><p class="indent"><span 
class="cmbx-12">Theorem 3. </span>Let <!--l. 450--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math> be a
topological vector space, <!--l. 450--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>Y</mi> </math>
a convex cone satisfying assumption (C). Let
<!--l. 451--><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 
>K</mi> <mo 
class="MathClass-bin">&#x2216;</mo><mrow><mo 
class="MathClass-open">{</mo><mrow><mn>0</mn></mrow><mo 
class="MathClass-close">}</mo></mrow></math>. The
functional <!--l. 452--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>C</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <mi 
>Y</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mi 
>R</mi></math>,
de&#xFB01;ned as <!--l. 453--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>C</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo><mo class="qopname"> inf</mo><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>t</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>R</mi> <mo 
class="MathClass-punc">:</mo> <mspace class="nbsp" /><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>t</mi><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>c</mi><mi 
>l</mi><mspace class="nbsp" /><mi 
>C</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
has the following properties
<!--tex4ht:inline--></p><!--l. 455--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
<mtable  align="axis"  
equalrows="false" equalcolumns="false" class="array"><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msup 
><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><msub><mrow 
><mi 
>z</mi></mrow><mrow 
>
<mi 
>C</mi></mrow></msub 
><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >&#x00A0;is&#x00A0;sublinear</mtext><!--/mstyle--><mo 
class="MathClass-punc">;</mo>                                                              </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msup 
><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>y</mi></mrow><mrow 
>
<mn>1</mn></mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-rel">&#x2260;</mo><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x21D2;</mo><mspace class="nbsp" /><msub><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>C</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x003C;</mo> <msub><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>C</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">;</mo>                                 </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msup 
><mn>3</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><mo 
class="MathClass-op">&#x2200;</mo><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>Y</mi> <mspace class="nbsp" /><mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03B1;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>R</mi><mspace class="nbsp" /><mspace class="nbsp" /><msub><mrow 
><mi 
>z</mi></mrow><mrow 
>
<mi 
>C</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x03B1;</mi><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>C</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">+</mo> <mi 
>&#x03B1;</mi><mo 
class="MathClass-punc">;</mo>                              </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msup 
><mn>4</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><!--mstyle 
class="mbox"--><mtext >For</mtext><!--/mstyle--><mspace class="nbsp" /><msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
>
<mn>0</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>Y</mi><mo 
class="MathClass-punc">,</mo><mi 
>&#x1EF9;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>Y</mi> <mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >the&#x00A0;condition</mtext><!--/mstyle--><mspace class="nbsp" /><msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
><mn>0</mn></mrow></msub 
><mo mathsize="big" 
> &#x22C2;</mo>
 <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x1EF9;</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>i</mi><mi 
>n</mi><mi 
>t</mi><mspace class="nbsp" /><mi 
>C</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x2205;</mi></mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left">     </mtd><mtd 
class="array"  columnalign="left"><!--mstyle 
class="mbox"--><mtext >implies&#x00A0;that</mtext><!--/mstyle--><mspace class="nbsp" /><msub><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>C</mi></mrow></msub 
><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >is&#x00A0;bounded&#x00A0;below&#x00A0;on</mtext><!--/mstyle--><mspace class="nbsp" /><msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
><mn>0</mn></mrow></msub 
><mo 
class="MathClass-punc">.</mo>                           </mtd></mtr><!--ll--></mtable>
</math>
<!--l. 471--><p class="nopar">
</p><!--l. 474--><p class="indent"><span 
class="cmti-12">Proof. </span>See [<span class="cite">[<a 
href="#Xr14">15</a>]</span>, Lemma 7] taking into account that
<!--l. 475--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>C</mi> </mrow> </msub 
> <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x221E;</mi></math>
is not possible under our assumptions. Note that we have
<!--l. 476--><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 
>i</mi><mi 
>n</mi><mi 
>t</mi><mspace class="nbsp" /><mi 
>C</mi> <mo 
class="MathClass-bin">&#x2216;</mo><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>c</mi><mi 
>l</mi><mspace class="nbsp" /><mi 
>C</mi></math>. Therefore,
as above, <!--l. 476--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
has not to be separated.
</p><!--l. 480--><p class="indent"><span 
class="cmbx-12">4. Minimal Point Theorem</span>
</p><!--l. 483--><p class="indent">Minimal point theorems in product spaces
<!--l. 483--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi 
>Y</mi> </math>
presented by Gopfert and Tammer <span class="cite">[<a 
href="#Xr12">13</a>]</span>, by Gopfert, Tammer and
Zalinescu <span class="cite">[<a 
href="#Xr14">15</a>]</span>, <span class="cite">[<a 
href="#Xr13">14</a>]</span>, and by Andreas Hamel and Andreas Lohne <span class="cite">[<a 
href="#Xr0">1</a>]</span>
give useful generalizations of Ekeland&#x2019;s variational principle. We wish
to generalize some of theorems in <span class="cite">[<a 
href="#Xr0">1</a>]</span> with respect to the space

<!--l. 488--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>.
Instead of family of quasi-metrics we consider a family of generalized
quasi-metrics.
</p><!--l. 490--><p class="indent">In what follows let <!--l. 490--><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><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>&#x2113;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
be a separated uniform space generated by the separating family
<!--l. 492--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>&#x2113;</mi></mrow></msub 
></math> of generalized quasi-metrics
and let <!--l. 493--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math> be a topological
vector space. We write <!--l. 494--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>w</mi> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>W</mi></math>
to deal with the two components of an element
<!--l. 495--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>w</mi></math> of the product
space <!--l. 495--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>W</mi> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mi 
>X</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi 
>Y</mi> </math>.
</p><!--l. 496--><p class="indent">It is well-known that a convex cone
<!--l. 496--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>Y</mi> </math> generates a
quasi-ordering on <!--l. 497--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
by
<!--tex4ht:inline--></p><!--l. 497--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
                       <msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x21D4;</mo> <msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>K</mi><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 498--><p class="nopar">If <!--l. 498--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>K</mi></math> is pointed,
the relation is also antisymmetric, therefore a partial ordering. Using an element
<!--l. 500--><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 
>K</mi> <mo 
class="MathClass-bin">&#x2216;</mo><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>c</mi><mi 
>l</mi><mspace class="nbsp" /><mi 
>K</mi></math> we introduce
a relation <!--l. 500--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
></math>
on <!--l. 501--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>W</mi></math>:

<!--tex4ht:inline--></p><!--l. 502--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
         <mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x21D4;</mo><mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi><mspace class="nbsp" /><mspace class="nbsp" /><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 504--><p class="nopar"><span 
class="cmbx-12">Lemma 1. </span>If <!--l. 506--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>Y</mi> </math> is a convex
cone, the relation <!--l. 507--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
></math> is
re&#xFB02;exive and transitive on <!--l. 507--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>W</mi></math>.
If additionally <!--l. 508--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math> is
pointed, the relation <!--l. 508--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
></math>
is antisymmetric and thus partial ordering on
<!--l. 509--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>W</mi> </math>.
</p><!--l. 512--><p class="indent"><span 
class="cmti-12">Proof. </span>Exemplary, we prove the transitivity. Let
<!--l. 512--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mi 
>i</mi> </mrow> </msub 
> <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>i</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mi 
>i</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>W</mi><mspace class="nbsp" /><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>i</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo> <mn>2</mn><mo 
class="MathClass-punc">,</mo> <mn>3</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></math> satisfying
<!--l. 513--><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 
><mn>1</mn> </mrow> </msub 
> <mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math> and
<!--l. 514--><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 
><mn>2</mn> </mrow> </msub 
> <mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>3</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>3</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
Therefore,
<!--tex4ht:inline--></p><!--l. 515--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
       <mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi><mspace class="nbsp" /><mspace class="nbsp" /><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >and</mtext><!--/mstyle--><mspace class="nbsp" /><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>3</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>3</mn></mrow></msub 
><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 517--><p class="nopar">The transitivity of the relation <!--l. 518--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
></math>
yields

<!--tex4ht:inline--></p><!--l. 518--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
             <mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi><mspace class="nbsp" /><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">+</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>3</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>3</mn></mrow></msub 
><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 520--><p class="nopar">If <!--l. 521--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></math> or
<!--l. 521--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>2</mn> </mrow> </msub 
> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>3</mn></mrow></msub 
></math>, then the
assumption <!--l. 521--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>3</mn></mrow></msub 
></math>
holds. Otherwise, using Q&#x2019;3 we deduce that
<!--tex4ht:inline--></p><!--l. 522--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
                    <mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi><mspace class="nbsp" /><mspace class="nbsp" /><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>3</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mn>3</mn></mrow></msub 
><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 523--><p class="nopar">Hence, <!--l. 524--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>3</mn></mrow></msub 
></math>.
</p><!--l. 525--><p class="indent">We continue with our main result, the minimal point theorem in uniform
spaces. Just as the Br&#x00E9;zis-Browder principle (Theorem 5), the following
theorem (as well as its equivalent formulations, Theorems <span class="cite">[<a 
href="#Xr10">11</a>]</span>, <span class="cite">[<a 
href="#Xr12">13</a>]</span>, <span class="cite">[<a 
href="#Xr13">14</a>]</span>) consists
of two parts. The &#x201D;weak&#x201D; assertion (ii) yields the existence of an element
<!--l. 530--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op"> &#x0304;</mo></mover></math> of a certain
set <!--l. 530--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>A</mi></math> such that
some <!--l. 530--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover></math> which is
dominated by <!--l. 531--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover></math>
with respect to a quasi-ordering necessarily has the same
<!--l. 532--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi><mo 
class="MathClass-bin">&#x2212;</mo></math> component.
However, the <!--l. 532--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> <mo 
class="MathClass-bin">&#x2212;</mo></math>
component may be distinct. The &#x201D;strong&#x201D; (authentic) assertion (ii) yields the minimality
of some <!--l. 534--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>A</mi></math>
in <!--l. 534--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>A</mi></math>
with respect to a partial ordering. Note that assumption (C) of section 3
ensures that we deal in fact with a partial ordering. It plays the key role in
establishing the strong assertion and can be traced back to the early work of

Bishop and Phelps.
</p><!--l. 541--><p class="indent"><span 
class="cmbx-12">Theorem 4. </span>(Minimal point theorem)&#x00A0;Let
<!--l. 542--><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><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>&#x2113;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
be a separated uniform space generated by the separating family
<!--l. 544--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>&#x2113;</mi></mrow></msub 
></math> of generalized
quasi-metrics, <!--l. 545--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math> a
topological vector space, <!--l. 545--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>Y</mi> </math>
a convex cone and <!--l. 546--><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 
>K</mi> <mo 
class="MathClass-bin">&#x2216;</mo><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>c</mi><mi 
>l</mi><mspace class="nbsp" /><mi 
>K</mi></math>. Let
<!--l. 546--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>A</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>W</mi></math> be a nonempty subset
of the product space <!--l. 547--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>W</mi> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mi 
>X</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi 
>Y</mi> </math>
and let <!--l. 547--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>A</mi></math> be given
such that for the set <!--l. 548--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>W</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>w</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>A</mi> <mo 
class="MathClass-punc">:</mo> <mspace class="nbsp" /><mi 
>w</mi> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></math>
the following assumptions hold true
<!--tex4ht:inline--></p><!--l. 550--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
<mtable  align="axis"  
equalrows="false" equalcolumns="false" class="array"><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>M</mi><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><!--mstyle 
class="mbox"--><mtext >The&#x00A0;set</mtext><!--/mstyle--><mspace class="nbsp" /><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>W</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>Y</mi> <mo 
class="MathClass-punc">:</mo> <mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >there&#x00A0;exists</mtext><!--/mstyle--><mspace class="nbsp" /><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi><!--mstyle 
class="mbox"--><mtext >&#x00A0;such&#x00A0;that&#x00A0;</mtext><!--/mstyle--><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>W</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow><!--mstyle 
class="mbox"--><mtext >&#x00A0;is&#x00A0;</mtext><!--/mstyle--><mspace class="nbsp" /><msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><!--mstyle 
class="mbox"--><mtext >&#x00A0;&#x2013;&#x00A0;bounded&#x00A0;below</mtext><!--/mstyle--><mo 
class="MathClass-punc">;</mo></mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left"><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>M</mi><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mtd><mtd 
class="array"  columnalign="left"><!--mstyle 
class="mbox"--><mtext >For&#x00A0;any</mtext><!--/mstyle--><mspace class="nbsp" /><msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
><!--mstyle 
class="mbox"--><mtext >-&#x00A0;decreasing&#x00A0;sequence</mtext><!--/mstyle--><mspace class="nbsp" /><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>N</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <msub><mrow 
><mi 
>W</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >there&#x00A0;exists</mtext><!--/mstyle-->                                            </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="left">     </mtd><mtd 
class="array"  columnalign="left"><!--mstyle 
class="mbox"--><mtext >some&#x00A0;</mtext><!--/mstyle--><mi 
>w</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>W</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >&#x00A0;such&#x00A0;that</mtext><!--/mstyle--><mi 
>w</mi> <mo 
class="MathClass-rel">&#x227C;</mo> <msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >for&#x00A0;all</mtext><!--/mstyle--><mspace class="nbsp" /><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>N</mi><mo 
class="MathClass-punc">.</mo>                                                      </mtd></mtr><!--ll--></mtable>
</math>
<!--l. 564--><p class="nopar">Then there exists some <!--l. 565--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>A</mi></math>
such that
<!--tex4ht:inline--></p><!--l. 566--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
         <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>i</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace class="nbsp" /><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><mo 
class="MathClass-punc">;</mo> <mspace width="1em" class="quad"/><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>i</mi><mi 
>i</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace class="nbsp" /><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>A</mi><mo 
class="MathClass-punc">,</mo><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x21D2;</mo><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover> <mo 
class="MathClass-rel">=</mo> <mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 569--><p class="nopar">Under the additional assumption (C) we can relax assumption (M1)
to

<!--tex4ht:inline--></p><!--l. 572--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
<mtable  align="axis"  
equalrows="false" equalcolumns="false" class="array"><mtr><mtd 
class="array"  columnalign="center"><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>M</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msup 
><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >There&#x00A0;exists&#x00A0;some</mtext><!--/mstyle--><mspace class="nbsp" /><mi 
>&#x1EF9;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>Y</mi> <mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >such&#x00A0;that</mtext><!--/mstyle--><mspace class="nbsp" /><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>W</mi></mrow><mrow 
>
<mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
><mo mathsize="big" 
> &#x22C2;</mo>
 <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x1EF9;</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>i</mi><mi 
>n</mi><mi 
>t</mi><mspace class="nbsp" /><mi 
>C</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x2205;</mi><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >and</mtext><!--/mstyle--></mtd>
</mtr><mtr 
class="vspace" style="font-size:5.0pt"><mtd 
></mtd></mtr><mtr><mtd 
class="array"  columnalign="center">                       <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>i</mi><mi 
>i</mi><mi 
>i</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace class="nbsp" /><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >is</mtext><!--/mstyle--><mspace class="nbsp" /> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >minimal&#x00A0;point&#x00A0;in</mtext><!--/mstyle--><mspace class="nbsp" /><mi 
>A</mi>                          </mtd></mtr><!--c--></mtable>
</math>
<!--l. 579--><p class="nopar">
</p><!--l. 581--><p class="indent"><span 
class="cmti-12">Proof. </span>By Lemma 1, the relation
<!--l. 581--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo> </mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
></math> is re&#xFB02;exive and
transitive on <!--l. 582--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>W</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math>.
We apply the Br&#x00E9;zis-Browder principle (Theorem 1) on the quasi-ordered set
<!--l. 583--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>W</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math> using the
functional <!--l. 584--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C6;</mi> <mo 
class="MathClass-punc">:</mo> <msub><mrow 
><mi 
>W</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x2192;</mo> <mi 
>R</mi></math>,
<!--l. 584--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>w</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mi 
>z</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>, where
<!--l. 585--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>z</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>Y</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mi 
>R</mi><mo 
class="MathClass-op">&#x22C3;</mo>
<!--nolimits--><mrow><mo 
class="MathClass-open">{</mo><mrow><mo 
class="MathClass-bin">+</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math> is
the scalarization functional of Theorem 2. First, we must have
<!--l. 586--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>w</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-rel">&#x2260;</mo> <mo 
class="MathClass-bin">+</mo> <mi 
>&#x221E;</mi></math>. Indeed,
for <!--l. 587--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>w</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>W</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math> it holds
<!--l. 587--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mi 
>Y</mi> </mrow> </msub 
>   <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
></math>. Hence
<!--l. 588--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mi 
>Y</mi> </mrow> </msub 
>   <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>K</mi> <mo 
class="MathClass-rel">&#x2282;</mo><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>c</mi><mi 
>l</mi><mspace class="nbsp" /><mi 
>K</mi></math>. By the
de&#xFB01;nition of <!--l. 589--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>z</mi></math>
we have <!--l. 589--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>w</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2264;</mo> <mn>0</mn></math>.
</p><!--l. 590--><p class="indent">By (M1) and property (H4) of <!--l. 590--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>z</mi></math>
(Theorem 2), <!--l. 590--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C6;</mi></math> is
bounded below on <!--l. 591--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>W</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math>.
Let be <!--l. 591--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></math>,
<!--l. 591--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn> </mrow> </msub 
> <mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>W</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math>, hence
<!--l. 592--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
></math>. Property
(H2) of <!--l. 592--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>z</mi></math>
implies assumption (A2) of Theorem 1. Of course, (M2) implies assumption
(A3) of Theorem 1.
</p><!--l. 595--><p class="indent">Theorem 1 yields the existence of some
<!--l. 595--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op"> &#x0304;</mo></mover> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>W</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math> such
that

<!--tex4ht:inline--></p><!--l. 596--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
            <mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><!--mstyle 
class="mbox"--><mtext >&#x00A0;and&#x00A0;</mtext><!--/mstyle--><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover> <mo 
class="MathClass-rel">&#x21D2;</mo> <mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 598--><p class="nopar">
</p><!--l. 600--><p class="indent">Let us show (ii). Take <!--l. 600--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>A</mi></math>
such that <!--l. 601--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover></math>. The
transitivity of <!--l. 602--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
></math>
yields <!--l. 602--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>W</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math>.
This implies
<!--tex4ht:inline--></p><!--l. 603--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
   <mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi><mspace class="nbsp" /><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>X</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo> <msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>X</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 605--><p class="nopar">Applying properties (H2) and (H3) of
<!--l. 605--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>z</mi></math> we
get
<!--tex4ht:inline--></p><!--l. 607--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
           <mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi><mspace class="nbsp" /><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>X</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo> <msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>X</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo>
</math>

<!--l. 608--><p class="nopar">Consequently,
<!--tex4ht:inline--></p><!--l. 608--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
                     <mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi><mspace class="nbsp" /><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>X</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo> <msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>X</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 609--><p class="nopar">Since <!--l. 610--><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><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>&#x2113;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math> is
separated, then <!--l. 611--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>X</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>X</mi></mrow></msub 
></math>.
</p><!--l. 612--><p class="indent">Now, let assumption (C) be satis&#xFB01;ed. We can replace (M1)
by (M&#x2019;1) and proceed analogously, but using the functional
<!--l. 613--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>C</mi> </mrow> </msub 
> </math> of Theorem 3 instead
of <!--l. 614--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>z</mi></math>. In particular, the
corresponding functional <!--l. 615--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03C6;</mi></mrow><mrow 
><mi 
>C</mi></mrow></msub 
> <mo 
class="MathClass-punc">:</mo> <msub><mrow 
><mi 
>W</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x2192;</mo> <mi 
>R</mi></math>,
<!--l. 615--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03C6;</mi></mrow><mrow 
><mi 
>C</mi> </mrow> </msub 
> <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>w</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>C</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
(the functional can be chosen slightly simpler than before, because
<!--l. 616--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>C</mi> </mrow> </msub 
> <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>&#x221E;</mi><mspace class="nbsp" /><mo 
class="MathClass-op">&#x2200;</mo><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>Y</mi> </math>) is even strict
<!--l. 617--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo> </mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
></math>&#x2013; monotone,
i.e. <!--l. 618--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></math>,
<!--l. 618--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn> </mrow> </msub 
> <mo 
class="MathClass-rel">&#x2260;</mo><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></math> implies
<!--l. 619--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03C6;</mi></mrow><mrow 
><mi 
>C</mi> </mrow> </msub 
> <mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x003C;</mo> <msub><mrow 
><mi 
>&#x03C6;</mi></mrow><mrow 
><mi 
>C</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>. Indeed,
let <!--l. 619--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></math>, and
<!--l. 620--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn> </mrow> </msub 
> <mo 
class="MathClass-rel">&#x2260;</mo><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></math>. If
<!--l. 620--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>X</mi></mrow></msub 
><mo 
class="MathClass-rel">&#x2260;</mo><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>X</mi></mrow></msub 
></math> then, since
<!--l. 621--><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><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>&#x2113;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math> is separated,
there exists some <!--l. 622--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi></math>
satisfying <!--l. 623--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>X</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo> <msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>X</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn></math>,
thus,

<!--tex4ht:inline--></p><!--l. 623--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><msub><mrow 
>
<mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>X</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo> <msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>X</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow> <mo 
class="MathClass-bin">+</mo> <mi 
>K</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>K</mi> <mo 
class="MathClass-bin">&#x2216;</mo><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>c</mi><mi 
>l</mi><mspace class="nbsp" /><mi 
>K</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>K</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>K</mi> <mo 
class="MathClass-bin">&#x2216;</mo><mrow><mo 
class="MathClass-open">{</mo><mrow><mn>0</mn></mrow><mo 
class="MathClass-close">}</mo></mrow><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 625--><p class="nopar">Otherwise, if <!--l. 625--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>X</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>X</mi></mrow></msub 
></math>,
we have <!--l. 626--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
><mo 
class="MathClass-rel">&#x2260;</mo><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
></math> and
it also holds <!--l. 626--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>Y</mi> </mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>K</mi> <mo 
class="MathClass-bin">&#x2216;</mo><mrow><mo 
class="MathClass-open">{</mo><mrow><mn>0</mn></mrow><mo 
class="MathClass-close">}</mo></mrow></math>.
Property H&#x2019;2 of <!--l. 627--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>C</mi></mrow></msub 
></math>
yields <!--l. 628--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
Therefore, assumption A&#x2019;2 in Theorem 1 is satis&#xFB01;ed too. The
<!--l. 629--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo> </mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
></math>&#x2013; minimality
of <!--l. 629--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mover 
accent="true"><mrow 
><mi 
>w</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover></math> in
<!--l. 629--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>A</mi></math> follows
from (Theorem 1, (ii&#x2019;)) taking into account the transitivity of the relation
<!--l. 631--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo> </mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
></math>.
</p><!--l. 634--><p class="indent"><span 
class="cmbx-12">5 Ekeland&#x2019;s principle for vector-valued maps</span>
</p><!--l. 637--><p class="indent">In this section we present a variant of Ekeland&#x2019;s variational principle for
vector-valued functions. As proposed in <span class="cite">[<a 
href="#Xr14">15</a>]</span>, <span class="cite">[<a 
href="#Xr13">14</a>]</span>, we extend the space
<!--l. 639--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math> by an
element <!--l. 640--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x221E;</mi></math>
such that <!--l. 640--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>y</mi> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><mi 
>&#x221E;</mi></math>
for all <!--l. 640--><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. 643--><p class="indent"><span 
class="cmbx-12">Theorem 5. </span>(Variational Principle) Let
<!--l. 645--><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><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>&#x2113;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
be a separated uniform space generated by the separating family
<!--l. 647--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>&#x2113;</mi></mrow></msub 
></math> of generalized
quasi-metrics, <!--l. 647--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math> a
topological vector space, <!--l. 648--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>Y</mi> </math>
a convex cone and <!--l. 648--><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 
>K</mi> <mo 
class="MathClass-bin">&#x2216;</mo><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>c</mi><mi 
>l</mi><mspace class="nbsp" /><mi 
>K</mi></math>. Let
<!--l. 649--><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> <mo 
class="MathClass-bin">&#x222A;</mo><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math> be a proper function
which is <!--l. 650--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
></math>&#x2013;bounded
below and let for every <!--l. 651--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>d</mi><mi 
>o</mi><mi 
>m</mi><mspace class="nbsp" /><mi 
>f</mi></math>
the set

<!--tex4ht:inline--></p><!--l. 651--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
          <mi 
>S</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>u</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi> <mo 
class="MathClass-punc">:</mo> <mspace class="nbsp" /><mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi><mspace class="nbsp" /><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>u</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">+</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>u</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><mi 
>f</mi><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>
<!--l. 654--><p class="nopar">be sequentially closed.
</p><!--l. 657--><p class="indent">Then, for each <!--l. 657--><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 
>d</mi><mi 
>o</mi><mi 
>m</mi><mspace class="nbsp" /><mi 
>f</mi></math>
there exists <!--l. 658--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="true"><mrow 
><mi 
>x</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>d</mi><mi 
>o</mi><mi 
>m</mi><mspace class="nbsp" /><mi 
>f</mi></math>
such that
<!--tex4ht:inline--></p><!--l. 659--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
               <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>i</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace class="nbsp" /><mo 
class="MathClass-op">&#x2200;</mo><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi><mspace class="nbsp" /><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>x</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">+</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>x</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">;</mo>
</math>
<!--l. 660--><p class="nopar">
<!--tex4ht:inline--></p><!--l. 661--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
     <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>i</mi><mi 
>i</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace class="nbsp" /><mo 
class="MathClass-op">&#x2200;</mo><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi><mspace class="nbsp" /><!--mstyle 
class="mbox"--><mtext >such&#x00A0;that</mtext><!--/mstyle--><mspace class="nbsp" /><mi 
>x</mi><mo 
class="MathClass-rel">&#x2260;</mo><mover 
accent="true"><mrow 
><mi 
>x</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover><mspace class="nbsp" /><mo 
class="MathClass-op">&#x2203;</mo><mi 
>&#x03B2;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi><mspace class="nbsp" /><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">+</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03B2;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>x</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><msub><mrow 
><mo 
class="MathClass-rel">&#x227C;&#x0338;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mover 
accent="true"><mrow 
><mi 
>x</mi></mrow><mo 
class="MathClass-op">&#x0304;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 664--><p class="nopar"><span 
class="cmti-12">Proof. </span>We consider the set-valued mapping
<!--l. 665--><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> <msup><mrow 
><mn>2</mn></mrow><mrow 
><mi 
>Y</mi> </mrow></msup 
></math>,
<!--l. 666--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>F</mi> <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>f</mi><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> if
<!--l. 666--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>&#x221E;</mi></math> and
<!--l. 666--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>F</mi> <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mi 
>&#x2205;</mi></math> otherwise. Let
<!--l. 667--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>d</mi><mi 
>o</mi><mi 
>m</mi><mspace class="nbsp" /><mi 
>F</mi></math> denote the
domain of <!--l. 667--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>F</mi></math>,

i.e. <!--l. 668--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>d</mi><mi 
>o</mi><mi 
>m</mi><mspace class="nbsp" /><mi 
>F</mi> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi> <mo 
class="MathClass-punc">:</mo> <mspace class="nbsp" /><mi 
>F</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>&#x2205;</mi></mrow><mo 
class="MathClass-close">}</mo></mrow></math> and let
<!--l. 669--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>g</mi><mi 
>r</mi><mspace class="nbsp" /><mi 
>F</mi></math> denote the
graph of <!--l. 669--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>F</mi></math>,
i.e. <!--l. 670--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>g</mi><mi 
>r</mi><mspace class="nbsp" /><mi 
>F</mi> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi 
>Y</mi> <mo 
class="MathClass-punc">:</mo> <mspace class="nbsp" /><mi 
>y</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>F</mi><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>.
Setting <!--l. 671--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>A</mi> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mi 
>g</mi><mi 
>r</mi><mspace class="nbsp" /><mi 
>F</mi></math>,
<!--l. 671--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>w</mi></mrow><mrow 
><mn>0</mn> </mrow> </msub 
>   <mo 
class="MathClass-rel">=</mo> <mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
all assumptions coincide with those of Theorem 4. Indeed,
it remains to show that (M2) of Theorem 4 is satis&#xFB01;ed. Let
<!--l. 673--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>N</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <msub><mrow 
><mi 
>W</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math> be a
<!--l. 673--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo> </mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
></math>&#x2013; decreasing
sequence and let <!--l. 673--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x025B;</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn></math>,
<!--l. 673--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>&#x2113;</mi></math>. Then
for any <!--l. 674--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>m</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>N</mi></math>
with <!--l. 674--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>m</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>n</mi></math>
we have
<!--tex4ht:inline--></p><!--l. 674--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
               <msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mi 
>m</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">+</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>m</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><mi 
>K</mi></mrow></msub 
><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 675--><p class="nopar">The properties of <!--l. 676--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>z</mi></math>
(Theorem 2) yield
<!--tex4ht:inline--></p><!--l. 676--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
                     <mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mi 
>m</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">+</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>m</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>&#x03C6;</mi><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><mo 
class="MathClass-punc">,</mo>
</math>

<!--l. 677--><p class="nopar">where <!--l. 678--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mi 
>z</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>y</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
Thus <!--l. 678--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>&#x03C6;</mi><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></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>N</mi></mrow></msub 
></math>
is nonincreasing sequence. On the other hand,
<!--l. 679--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><mi 
>&#x03C6;</mi><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></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>N</mi></mrow></msub 
></math> is bounded below,
hence there exists some <!--l. 680--><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">&#x2208;</mo> <mi 
>N</mi></math>
such that for all <!--l. 680--><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">&#x2265;</mo> <msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math>
it holds
<!--tex4ht:inline--></p><!--l. 681--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
                   <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>m</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>&#x03C6;</mi><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> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>&#x03C6;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mi 
>m</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>&#x025B;</mi><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 681--><p class="nopar">Hence, <!--l. 682--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>m</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>&#x025B;</mi><mo 
class="MathClass-punc">.</mo></math> This means, that
<!--l. 683--><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 a Cauchy sequence in
<!--l. 684--><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><msub><mrow 
><mrow><mo 
class="MathClass-open">{</mo><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">}</mo></mrow></mrow><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>&#x2113;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math> and by the sequentially
completeness of <!--l. 685--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
convergent to some <!--l. 685--><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. 686--><p class="indent">On the other hand, we have <!--l. 686--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>m</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>S</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></math>
for all <!--l. 686--><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 
>N</mi></math> with
<!--l. 687--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>m</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>n</mi></math>. Since
<!--l. 687--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>S</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></math> is sequentially
closed, it follows that <!--l. 688--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>S</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></math>
for all <!--l. 688--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>N</mi></math>.
Hence, <!--l. 689--><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 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow> <msub><mrow 
><mo 
class="MathClass-rel">&#x227C;</mo></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>y</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
for all <!--l. 689--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>N</mi></math>.
Theorem 4 implies all assertions.
</p>
<h3 class="sectionHead"><a 
 id="x1-1000"></a>References</h3>
<!--l. 693--><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="Xr0"></a><span 
class="cmr-10">Hamel,  A.,  Lohne,  A.,  A  Minimal  Point  Theorem  in  Uniform  Spaces,</span>
<span 
class="cmr-10">manuscript, (2002).</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="Xr1"></a><span 
class="cmr-10">Altman, M., A Generalization of Br</span><span 
class="cmr-10">&#x00E9;</span><span 
class="cmr-10">zis-Browder Principle on Ordered Sets,</span>
<span 
class="cmr-10">Nonlinear  Analysis,  Theory,  Methods  and  Applications,  6(2),157-165,  (1982)</span>
<span 
class="cmr-10">157-165, (1982).</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="Xr2"></a><span 
class="cmr-10">Br</span><span 
class="cmr-10">&#x00E9;</span><span 
class="cmr-10">zis, H.,Browder, F.E., A General Principle on Ordered Sets in Nonlinear</span>
<span 
class="cmr-10">Functional Analysis , Advances in Mathematics 21,355-364, (1976).</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="Xr3"></a><span 
class="cmr-10">Bishop,  E.,  Phelps,  R.R.,  The  support  Functionals  on  Convex  Sets,  In</span>
<span 
class="cmr-10">KLEE,V.,editor,  Convexity,  volume  VII  of  Proceedings  in  Symposia  in  pure</span>
<span 
class="cmr-10">mathematics, pp.27-35, American Mathematical Society, (1963)</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="Xr4"></a><span 
class="cmr-10">A.  Bronstedt  &#x201D;On  a  lemma  of  Bishop  and  Phelps&#x201D;,  Paci&#xFB01;c  Journal  of</span>
<span 
class="cmr-10">Mathematics Vol. 55, No. 2, 335-341 (1974).</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="Xr5"></a><span 
class="cmr-10">Caristi,  J.,  Fixed  Point  Theorems  for  Mappings  satisfying  Inwardness</span>
<span 
class="cmr-10">Conditions,  Transactions  of  the  American  Mathematical  Society,  Vol.  215,</span>
<span 
class="cmr-10">241-251, (1976).</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="Xr6"></a><span 
class="cmr-10">Chen, G. Y., Huang, X.X., A Unifed Approach to the Three Existing Types</span>
<span 
class="cmr-10">of Variational Principles for Vector Valued Functions, Mathematical Methods of</span>
<span 
class="cmr-10">Operations Reasearch, Vol. 48 (3), 349-358, (1998).</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="Xr7"></a><span 
class="cmr-10">Chen,  G.  Y.,  Huang,  X.X.,  Hou,  S.  H.,  General  Ekeland&#x2019;s  Variationals</span>
<span 
class="cmr-10">Principle for Set-Valued Mappings, JOTA, Vol. 106, No. 1, pp. 151-164, (2000).</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="Xr8"></a><span 
class="cmr-10">Ekeland, I., On the Variational Principle, Journal of Mathematics Analysis</span>
<span 
class="cmr-10">and Applications 47, 324-353, (1974).</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="Xr9"></a><span 
class="cmr-10">Fang, X.-J., The Variational Principle and Fixed Point Theorems in Certain</span>
<span 
class="cmr-10">Topological  Spaces,  Journal  of  Mathematical  Analysis  and  Applications  202,</span>
<span 
class="cmr-10">398-412, (1996).</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="Xr10"></a><span 
class="cmr-10">Gerth,  Chr.,  Weidner,P.,  Nonconvex  Separation  Theorems  and  Some</span>
<span 
class="cmr-10">Applications in Vector Optimization, JOTA, Vol. 67, No. 2, 297-320, (1990).</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="Xr11"></a><span 
class="cmr-10">Gerth,</span>
<span 
class="cmr-10">Chr.,Iwanow, E., Dualitat fur nichtkonvexe Vektoroptimierungsprobleme, Wiss.</span>
<span 
class="cmr-10">Z. TH Ilmenau 31 (2), 61-81, (1985).</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="Xr12"></a><span 
class="cmr-10">Gopfert, A., Tammer, Chr., A New Maximal Point Theorem, ZAA 14 (2),</span>
<span 
class="cmr-10">379-390, (1995).</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="Xr13"></a><span 
class="cmr-10">Gopfert, A., Tammer, Chr., Zalinescu,C., A New Minimal Point Theorem in</span>
<span 
class="cmr-10">Product Spaces, ZAA 18 (3), 767-770, (1999).</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="Xr14"></a><span 
class="cmr-10">Gopfert,  A.,  Tammer,  Chr.,  Zalinescu,C.,  On  the  Vectorial  Ekeland&#x2019;s</span>
<span 
class="cmr-10">Variational Principle and Minimal Points in Product Spaces, Nonlinear Analysis</span>
<span 
class="cmr-10">39, 909-922, (2000).</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="Xr15"></a><span 
class="cmr-10">Hamel,    A.,    Equivalents    to    Ekeland&#x2019;s    Variational    Principle    in</span>
<!--l. 750--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>F</mi><mo 
class="MathClass-bin">&#x2212;</mo></math>
<span 
class="cmr-10">Type Topological Spaces, Report 09, University Halle-Wittenberg, Institut of</span>
<span 
class="cmr-10">Optimization and Stochastics (2001).</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="Xr16"></a><span 
class="cmr-10">Hamel, A.,Phelps&#x2019; Lemma, Danes Drop Theorem and Ekeland&#x2019;s Principle</span>
<span 
class="cmr-10">in   Locally   Convex   Topological   Vector   Spaces,   Report   10,   University</span>
<span 
class="cmr-10">Halle-Wittenberg, Institut of Optimization and Stochastics (2001).</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="Xr17"></a><span 
class="cmr-10">Hamel, A., Lohne, A., Minimal Set Theorems, manuscript, (2002).</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="Xr18"></a><span 
class="cmr-10">Hyers,  D.H.,  Pseudo-Normed  Linear  Spaces  and  Abelian  Groups,  Duke</span>
<span 
class="cmr-10">Math.J. vol. 5, 628-634, (1939).</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="Xr19"></a><span 
class="cmr-10">Hyers,  D.H.,  Isac,  G.,  Rassias,  T.M.,  Topics  in  Nonlinear  Analysis  and</span>
<span 
class="cmr-10">Applications, World Scienti&#xFB01;c, (1997).</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="Xr20"></a><span 
class="cmr-10">Isac,      G.,      The      Ekeland&#x2019;s      Principle      and      the      Pareto</span>
<!--l. 763--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x025B;</mi><mo 
class="MathClass-bin">&#x2212;</mo></math><span 
class="cmr-10">Efficiency,</span>
<span 
class="cmr-10">in:  M.  Tamiz  (Ed.),  Multi-Objective  Programming  and  Goal  Programming:</span>
<span 
class="cmr-10">Theories and Applications, Lecture Notes in Economics and Math. Systems, vol</span>
<span 
class="cmr-10">432, Springer, Berlin, 148-163, (1996).</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="Xr21"></a><span 
class="cmr-10">Kelly, J.L., General Topology, Springer, (1995).</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="Xr22"></a><span 
class="cmr-10">Kothe, G., Topologische lineare Raume I, Springer, (1996).</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="Xr23"></a><span 
class="cmr-10">Li, S. J., Yang, X.,Q., Chen, G. Vector Ekeland Variational Principle, in</span>
<span 
class="cmr-10">Gianessi, F.(ed.), Vector Variational inequalities and Vector Equilibria, Kluwer</span>
<span 
class="cmr-10">Academic Publishers, Dordrecht, (2000).</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="Xr24"></a><span 
class="cmr-10">Lohne,  A.,  Minimalpunkttheoreme  in  uniformen  Raumen  und  verwandte</span>
<span 
class="cmr-10">Aussagen, Diplomarbeit, MLU Halle-Wittenberg, (2001).</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="Xr25"></a><span 
class="cmr-10">Mizoguchi, N., A Generalization of Bronstedt&#x2019;s Results and its Applications,</span>
<span 
class="cmr-10">Proc. Amer. Math. Soc. 108, No.3, 707-714, (1990).</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="Xr26"></a><span 
class="cmr-10">Nemeth,  A.  B.,  A  Nonconvex  Vector  Minimization  Problem,  Nonlinear</span>
<span 
class="cmr-10">Analysis 10, 669-678, (1986).</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="Xr27"></a><span 
class="cmr-10">Park,  S.  On  Generalizations  of  Ekeland-Type  Variational  Principles,</span>
<span 
class="cmr-10">Nonlinear Analysis 39, 881-889, (2000).</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="Xr28"></a><span 
class="cmr-10">Phelps, R.R., Support Cones and Their Generalization, In KLEE,V.,editor,</span>
<span 
class="cmr-10">Convexity,  volume  VII  of  Proceedings  in  Symposia  in  pure  mathematics,</span>
<span 
class="cmr-10">pp.393-401, American Mathematical Society, (1963).</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="Xr29"></a><span 
class="cmr-10">Phelps,  R.R.,  Support  Cones  in  Banach  Spaces  and  Their  Applications,</span>
<span 
class="cmr-10">Advances in Mathematics, 13, 1-19, (1974).</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="Xr30"></a><span 
class="cmr-10">Phelps, R.R., Convex Functions, Monotone Operators and Differentiability,</span>
<span 
class="cmr-10">Lecture Notes in Mathematics, vol. 1364, Springer Verlag, (1989).</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="Xr31"></a><span 
class="cmr-10">Tammer,   Chr.,   A   Generalization   of   Ekeland&#x2019;s   Variational   Principle,</span>
<span 
class="cmr-10">Optimization, 25, 129-141, (1992).</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="Xr32"></a><span 
class="cmr-10">Tammer,  Chr.,  A  Variational  Principle  and  a  Fixed  Point  Theorem,  In:</span>
<span 
class="cmr-10">Henry,J., Yvon, J.-P., (Eds.): System Modeling and Optimization, Lecture Notes</span>
<span 
class="cmr-10">in Control and Information Sciences 197, Springer London, 248-257, (1994).</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">[34]</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="Xr33"></a><span 
class="cmr-10">Weil, A., Sur les espaces a structure uniforme et sur la topologie g</span><span 
class="cmr-10">&#x00E9;</span><span 
class="cmr-10">n</span><span 
class="cmr-10">&#x00E9;</span><span 
class="cmr-10">rale,</span>
<span 
class="cmr-10">Actualit</span><span 
class="cmr-10">&#x00E9;</span><span 
class="cmr-10">s Sci. Ind. 551. Paris, (1937).</span>
</p>
</div>
<!--l. 805--><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>, F<span 
class="small-caps">a</span><span 
class="small-caps">c</span><span 
class="small-caps">u</span><span 
class="small-caps">l</span><span 
class="small-caps">t</span><span 
class="small-caps">y</span> <span 
class="small-caps">o</span><span 
class="small-caps">f</span> <span 
class="small-caps">s</span><span 
class="small-caps">c</span><span 
class="small-caps">i</span><span 
class="small-caps">e</span><span 
class="small-caps">n</span><span 
class="small-caps">c</span><span 
class="small-caps">e</span>, M<span 
class="small-caps">o</span><span 
class="small-caps">h</span><span 
class="small-caps">a</span><span 
class="small-caps">m</span><span 
class="small-caps">e</span><span 
class="small-caps">d</span> <span 
class="small-caps">f</span><span 
class="small-caps">i</span><span 
class="small-caps">r</span><span 
class="small-caps">s</span><span 
class="small-caps">t</span></span>
<span 
class="cmcsc-10x-x-109"><span 
class="small-caps">u</span><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>, O<span 
class="small-caps">u</span><span 
class="small-caps">j</span><span 
class="small-caps">d</span><span 
class="small-caps">a</span>, M<span 
class="small-caps">o</span><span 
class="small-caps">r</span><span 
class="small-caps">o</span><span 
class="small-caps">c</span><span 
class="small-caps">c</span><span 
class="small-caps">o</span></span>
</p><!--l. 807--><p class="noindent"><span 
class="cmti-10x-x-109">E-mail address: </span><span 
class="cmr-10x-x-109">benbrik@sciences.univ-oujda.ac.ma</span>
</p><!--l. 808--><p class="noindent"><span 
class="cmti-10x-x-109">E-mail address: </span><span 
class="cmr-10x-x-109">lahrech@sciences.univ-oujda.ac.ma</span>
</p><!--l. 809--><p class="noindent"><span 
class="cmti-10x-x-109">E-mail address: </span><span 
class="cmr-10x-x-109">mbarki@sciences.univ-oujda.ac.ma</span>
</p><!--l. 810--><p class="noindent"><span 
class="cmti-10x-x-109">E-mail address: </span><span 
class="cmr-10x-x-109">ouahab@sciences.univ-oujda.ac.ma</span>
</p><!--l. 812--><p class="indent">Received April 16, 2006
</p>
 
</body> 
</html> 



