<?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="115.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="115.tex" /> 
<meta name="date" content="2007-04-21 19:35:00" /> 
<link rel="stylesheet" type="text/css" href="115.css" /> 
</head><body 
>
<!--l. 42--><p class="noindent"><span 
class="cmbx-12">Lobachevskii Journal of Mathematics</span>
<span 
class="cmtt-12">http://ljm.ksu.ru</span>
<span 
class="cmbx-12">Vol.</span><span 
class="cmbx-12">&#x00A0;25, 2007, 197&#x2013;216</span>
</p><!--l. 42--><p class="noindent"><span 
class="cmsy-10x-x-120">&#x00A9;</span>&#x00A0;M. S. Martirosyan and S.V. Samarchyan
</p>
<div class="center" 
>
<!--l. 42--><p class="noindent">
</p><!--l. 42--><p class="noindent"><span 
class="cmsl-12">M. S. Martirosyan and S.V. Samarchyan</span><br />
<!--l. 42--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Q</mi></math><span 
class="cmbx-12">-BOUNDED</span>
<span 
class="cmbx-12">SYSTEMS: COMMON APPROACH TO</span>
<span 
class="cmbx-12">FISHER-MICCHELLI&#x2019;S AND BERNSTEIN-WALSH&#x2019;S</span>
<span 
class="cmbx-12">TYPE PROBLEMS</span><br />
(submitted by F. G. Avkhadiev)</p></div>
   <!--l. 46--><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">. We have developed a new common method to investigate</span>
   <span 
class="cmr-10x-x-109">geometrically fast approximation problems. Fisher-Micchelli&#x2019;s,</span>
   <span 
class="cmr-10x-x-109">Bernstein-Walsh&#x2019;s and Batirov-Varga&#x2019;s well known results are obtained as</span>
   <span 
class="cmr-10x-x-109">applications.</span>

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

________________
<!--l. 50--><p class="noindent"><span 
class="cmti-10x-x-109">2000 Mathematical Subject Classi&#xFB01;cation</span>. <span 
class="cmr-10x-x-109">41A, 30E10, 30E15.</span>
</p><!--l. 50--><p class="noindent"><span 
class="cmti-12">Key words and phrases</span>. <span 
class="cmr-10x-x-109">fast approximation, </span><!--l. 50--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi></math><span 
class="cmr-10x-x-109">-widths,</span>
<span 
class="cmr-10x-x-109">biorthogonal systems.</span>

</p>
</td></tr></table></div><hr class="endfloat" />
<h3 class="sectionHead"><a 
 id="x1-1000"></a>Introduction: Fisher-Micchelli&#x2019;s &#x0026; Bernstein-Walsh&#x2019;s type problems</h3>
<!--l. 56--><p class="noindent">Let <!--l. 56--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math> be a compact subset
of the open unit disk <!--l. 56--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>D</mi></math>,
<!--l. 56--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math> be the set of bounded
analytic functions on <!--l. 57--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>D</mi></math>
and <!--l. 57--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>C</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math> be the set of
continuous functions on <!--l. 58--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math>.
</p><!--l. 60--><p class="indent">Then each function <!--l. 60--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is approximable by &#xFB01;nite linear combinations of the system of powers
<!--l. 61--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>k</mi> </mrow> </msup 
></mrow></mfenced></mrow><mrow 
>
<mn>0</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math> uniformly
on <!--l. 61--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>K</mi></math> at
a rate of geometrical progression and as approximants one can take Taylor
polynomials, i.e.
</p>
<div class="math-display"><!--l. 63--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                    <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msub><mrow 
><mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>f</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mi 
>f</mi></mrow></mfenced></mrow><mrow 
><mi 
>C</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>K</mi></mrow></mfenced></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x003C;</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 65--><p class="nopar">where <!--l. 66--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>f</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>0</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><mfrac><mrow 
><msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>k</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow>
   <mrow 
><mi 
>k</mi><mi 
>!</mi></mrow></mfrac>    <msup><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>k</mi></mrow></msup 
></math>.
</p><!--l. 68--><p class="indent">If <!--l. 68--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>H</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi mathvariant="double-struck">&#x2102;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
then one can obtain faster approximation
</p>

<div class="math-display"><!--l. 69--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                      <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msub><mrow 
><mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>f</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mi 
>f</mi></mrow></mfenced></mrow><mrow 
><mi 
>C</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>K</mi></mrow></mfenced></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 71--><p class="nopar">From now on approximation which is faster than geometrical progression will
be called fast approximation.
</p><!--l. 75--><p class="indent">In case when logarithmic capacity of
<!--l. 75--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math> is
positive, <!--l. 75--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B3;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn></math>,
Bernstein and Walsh [BW] obtained the following result.
</p><!--l. 77--><p class="indent"><span 
class="cmbx-12">BW type result (Bernstein-Walsh): </span><span 
class="cmti-12">The class of functions</span>
<!--l. 78--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>K</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mi mathvariant="double-struck">&#x2102;</mi></math>
<span 
class="cmti-12">permitting the fast approximation by &#xFB01;nite linear combinations of the system</span>
<!--l. 78--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>k</mi> </mrow> </msup 
></mrow></mfenced></mrow><mrow 
>
<mn>0</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math> <span 
class="cmti-12">in</span>
<!--l. 79--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>C</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>, <span 
class="cmti-12">coincides</span>
<span 
class="cmti-12">with </span><!--l. 79--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi mathvariant="double-struck">&#x2102;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
</p><!--l. 81--><p class="indent">We have seen that to make the fast approximation of the class
<!--l. 81--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
we have to miniaturize it up to the class of entire functions. The
natural question arises if we can fast approximate whole class
<!--l. 82--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math> using some other
system instead of <!--l. 82--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>k</mi></mrow></msup 
></mrow></mfenced> </mrow><mrow 
>
<mn>0</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math>.
Due to Fisher and Micchelli [FM] the answer is negative.
</p><!--l. 85--><p class="indent"><span 
class="cmbx-12">FM type result (Fisher-Micchelli) </span><span 
class="cmti-12">There is no system of functions</span>
</p>

<div class="math-display"><!--l. 86--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                <msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
> <mo 
class="MathClass-punc">:</mo> <mi 
>K</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mi mathvariant="double-struck">&#x2102;</mi><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>k</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo> <mn>2</mn><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo><mo 
class="MathClass-punc">,</mo><mi 
>n</mi><mo 
class="MathClass-punc">;</mo> <mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>n</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo> <mn>2</mn><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo>
</mrow></math></div>
<!--l. 88--><p class="nopar"><span 
class="cmti-12">such that every function </span><!--l. 89--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
<span 
class="cmti-12">admits the fast approximation by polynomials</span>
</p>
<div class="math-display"><!--l. 90--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                           <munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
>
</mrow></math></div>
<!--l. 92--><p class="nopar"><span 
class="cmti-12">in </span><!--l. 93--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>C</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
</p><!--l. 95--><p class="indent">Reasoning from these results, let us consider the following problems named
Fisher-Micchelli&#x2019;s and Bernstein-Walsh&#x2019;s type problem, respectively.
</p><!--l. 98--><p class="indent"><span 
class="cmbx-12">Problems:</span>
</p><!--l. 100--><p class="indent"><span 
class="cmbx-12">FM)</span><span 
class="cmti-12">For a given space </span><!--l. 100--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi></math>,
<span 
class="cmti-12">&#xFB01;nd a system </span><!--l. 100--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></math> <span 
class="cmti-12">such</span>
<span 
class="cmti-12">that each element of </span><!--l. 100--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi></math>
<span 
class="cmti-12">admits the fast approximation by linear combinations</span>
<!--l. 100--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op">&#x2211;</mo>
   </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></math>.
</p><!--l. 102--><p class="indent"><span 
class="cmbx-12">BW) </span><span 
class="cmti-12">For a given system </span><!--l. 102--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mo 
class="MathClass-punc">,</mo></math>
<span 
class="cmti-12">&#xFB01;nd the class of elements permitting the fast approximation by linear combinations</span>
<!--l. 102--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op">&#x2211;</mo>
   </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></math>.
</p><!--l. 105--><p class="indent">We have developed a common method to investigate both problems based on the notion
of <!--l. 106--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>q</mi></math>-bounded
systems.

</p>
<h3 class="sectionHead"><span class="titlemark">1. </span> <a 
 id="x1-20001"></a> <!--l. 108--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>q</mi></math>-bounded
systems</h3>
<!--l. 110--><p class="noindent"><span 
class="cmbx-12">De&#xFB01;nition 1.1  </span>Let <!--l. 111--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
be a Banach space, <!--l. 112--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>X</mi></math>,
<!--l. 113--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo> <mn>2</mn><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo></math> be a triangle matrix,
and <!--l. 113--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>L</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math> be the linear span
of the &#xFB01;nite system <!--l. 114--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></msubsup 
></math>.
For <!--l. 115--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>q</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn></math> the
matrix <!--l. 116--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math>
is called
</p><!--l. 118--><p class="indent"><span 
class="cmbx-12">i. </span><!--l. 118--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>q</mi></math>-<span 
class="cmti-12">lower</span>
<span 
class="cmti-12">bounded in </span><!--l. 118--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math><span 
class="cmti-12">, if for</span>
<span 
class="cmti-12">each sequence </span><!--l. 118--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>L</mi></mrow><mrow 
>
<mi 
>n</mi></mrow></msub 
></math>
<span 
class="cmti-12">one has</span>
</p>
<div class="math-display"><!--l. 119--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
         <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msub><mrow 
><mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></mfenced> </mrow><mrow 
><mi 
>X</mi></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>q</mi><munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">max</mo> </mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
> <mfenced separators="" 
open="|"  close="|" ><mrow><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
><mi 
>n</mi></mrow></mroot><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 121--><p class="nopar">
</p><!--l. 123--><p class="indent"><span 
class="cmbx-12">ii. </span><!--l. 123--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>q</mi></math>-<span 
class="cmti-12">upper</span>
<span 
class="cmti-12">bounded in </span><!--l. 123--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math><span 
class="cmti-12">,</span>
<span 
class="cmti-12">if</span>
</p>

<div class="math-display"><!--l. 124--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                  <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">max</mo> </mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>X</mi></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>q</mi><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 126--><p class="nopar">
</p><!--l. 129--><p class="indent"><span 
class="cmbx-12">De&#xFB01;nition 1.2 </span><span 
class="cmti-12">The matrix </span><!--l. 132--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math>
<span 
class="cmti-12">is called </span><!--l. 132--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mn>0</mn></math><span 
class="cmti-12">-lower bounded</span>
(<!--l. 132--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>&#x221E;</mi></math><span 
class="cmti-12">-upper bounded</span>)<span 
class="cmti-12">, if</span>
<span 
class="cmti-12">it is </span><!--l. 132--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>q</mi></math><span 
class="cmti-12">-lower </span>(<span 
class="cmti-12">upper</span>)
<span 
class="cmti-12">bounded for some </span><!--l. 132--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>q</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
</p><!--l. 135--><p class="indent"><span 
class="cmbx-12">De&#xFB01;nition 1.3 </span><span 
class="cmti-12">The system </span><!--l. 139--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced> </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>X</mi></math>
<span 
class="cmti-12">is called </span><!--l. 139--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>q</mi></math><span 
class="cmti-12">-lower </span>(<span 
class="cmti-12">upper</span>)
<span 
class="cmti-12">bounded, if the matrix </span><!--l. 139--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math>
<span 
class="cmti-12">is </span><!--l. 139--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>q</mi></math><span 
class="cmti-12">-lower </span>(<span 
class="cmti-12">upper</span>)
<span 
class="cmti-12">bounded for </span><!--l. 139--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
></math><span 
class="cmti-12">,</span>
<!--l. 139--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>n</mi></math><span 
class="cmti-12">.</span>
</p><!--l. 143--><p class="indent">Checking of <!--l. 143--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>q</mi></math>-upper
boundedness is usually easy. As regards checking of
<!--l. 143--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>q</mi></math>-lower
boundedness, it seems difficult. The following lemma shows that checking of
<!--l. 144--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>q</mi></math>-lower
boundedness can be reduced to checking of
<!--l. 144--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>q</mi></math>-upper
boundedness of biorthogonal system.
</p><!--l. 147--><p class="indent"><span 
class="cmbx-12">Lemma 1.1 (Checking lower boundedness, [F]) </span><span 
class="cmti-12">If the &#xFB01;nite systems</span>
<!--l. 147--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi> </mrow> <mrow 
>  <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced></mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></msubsup 
></math> <span 
class="cmti-12">and</span>
<!--l. 147--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi> </mrow> <mrow 
>  <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced></mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></msubsup 
></math> <span 
class="cmti-12">are biorthogonal</span>
<span 
class="cmti-12">for all </span><!--l. 147--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>N</mi></math> <span 
class="cmti-12">and</span>
<span 
class="cmti-12">the matrix </span><!--l. 147--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math>  <span 
class="cmti-12">is</span>
<!--l. 147--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>q</mi></math>-<span 
class="cmti-12">upper bounded in</span>

<span 
class="cmti-12">a normed space </span><!--l. 147--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>Y</mi> </math>
<span 
class="cmti-12">then the matrix </span><!--l. 147--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math>
<span 
class="cmti-12">is </span><!--l. 147--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mfrac><mrow 
><mn>1</mn></mrow>
<mrow 
><mi 
>q</mi></mrow></mfrac></math>-<span 
class="cmti-12">lower bounded</span>
<span 
class="cmti-12">in the dual space </span><!--l. 147--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>Y</mi> </mrow><mrow 
><mo 
class="MathClass-bin">&#x2217;</mo></mrow></msup 
></math>.
</p>
<h3 class="sectionHead"><span class="titlemark">2. </span> <a 
 id="x1-30002"></a>Basic lemma</h3>
<!--l. 153--><p class="noindent">There is a close relation between Kolmogorov
<!--l. 153--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi></math>-widths and
<!--l. 153--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>q</mi></math>-bounded
systems.
</p><!--l. 155--><p class="indent"><span 
class="cmbx-12">De&#xFB01;nition 2.1 </span><span 
class="cmti-12">Let </span><!--l. 155--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math> <span 
class="cmti-12">be a</span>
<span 
class="cmti-12">subset of a normed linear space </span><!--l. 155--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math><span 
class="cmti-12">.</span>
<span 
class="cmti-12">The quantity</span>
</p>
<div class="math-display"><!--l. 156--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
             <msub><mrow 
><mi 
>d</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi><mo 
class="MathClass-punc">,</mo><mi 
>X</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> inf</mo> </mrow><mrow 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-rel">&#x2282;</mo><mi 
>X</mi></mrow></munder 
><munder class="msub"><mrow 
><mo 
class="MathClass-op"> sup</mo> </mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>K</mi></mrow></munder 
><munder class="msub"><mrow 
><mo 
class="MathClass-op"> inf</mo> </mrow><mrow 
><mi 
>y</mi><mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></munder 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>y</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>x</mi></mrow></mfenced></mrow><mrow 
><mi 
>X</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 158--><p class="nopar"><span 
class="cmti-12">where the leftmost in&#xFB01;mum is taken over all subspaces</span>
<!--l. 159--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mi 
>n</mi>  </mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>X</mi></math> <span 
class="cmti-12">of dimension</span>
<!--l. 159--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi></math><span 
class="cmti-12">, is called the</span>
<span 
class="cmti-12">Kolmogorov </span><!--l. 159--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi></math>-<span 
class="cmti-12">width</span>
<span 
class="cmti-12">of </span><!--l. 159--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>K</mi></math> <span 
class="cmti-12">in</span>
<!--l. 159--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>.
</p><!--l. 162--><p class="indent"><span 
class="cmbx-12">Lemma 2.1</span>(<!--l. 162--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>q</mi></math>-bounded systems
and Kolmogorov <!--l. 162--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi></math>-widths)
</p><!--l. 164--><p class="indent"><span 
class="cmti-12">Let </span><!--l. 164--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi><mo 
class="MathClass-punc">,</mo><mi 
>X</mi></math> <span 
class="cmti-12">be Banach</span>
<span 
class="cmti-12">spaces and </span><!--l. 173--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>X</mi></math><span 
class="cmti-12">. If there</span>
<span 
class="cmti-12">exists a matrix </span><!--l. 173--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>H</mi></math>
<span 
class="cmti-12">which is </span><!--l. 173--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></math><span 
class="cmti-12">-lower</span>

<span 
class="cmti-12">bounded in </span><!--l. 173--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">and </span><!--l. 173--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></math><span 
class="cmti-12">-upper</span>
<span 
class="cmti-12">bounded in </span><!--l. 173--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi></math><span 
class="cmti-12">,</span>
<span 
class="cmti-12">then</span>
</p>
<div class="math-display"><!--l. 173--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                     <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msub><mrow 
><mi 
>d</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>H</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mi 
>X</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo><mfrac><mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow> 
<mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow></mfrac><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 173--><p class="nopar"><span 
class="cmti-12">for the unit ball </span><!--l. 173--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>H</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>H</mi> <mo 
class="MathClass-punc">:</mo><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>x</mi></mrow></mfenced></mrow><mrow 
><mi 
>H</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo> <mn>1</mn></mrow></mfenced></math>
<span 
class="cmti-12">of </span><!--l. 173--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>H</mi></math><span 
class="cmti-12">.</span>
</p><!--l. 176--><p class="indent">Lemma 2.1 could be established by Tikhomirov&#x2019;s well known result.
</p><!--l. 179--><p class="indent"><span 
class="cmbx-12">Lemma  (Tikhomirov,  [T]) </span><span 
class="cmti-12">If</span>
<!--l. 179--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></msub 
></math> <span 
class="cmti-12">is a unit ball of some</span>
<!--l. 179--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-bin">+</mo> <mn>1</mn></math>-<span 
class="cmti-12">dimensional subspace</span>
<span 
class="cmti-12">of a Banach space </span><!--l. 179--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math><span 
class="cmti-12">,</span>
<span 
class="cmti-12">then </span><!--l. 179--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>d</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mi 
>X</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mn>1</mn></math>.
</p><!--l. 181--><p class="indent">Instead, we shall give here an elementary proof in the sense that it does not
depend on Borsuk&#x2019;s theorem.
</p><!--l. 184--><p class="indent"><span 
class="cmbx-12">Proof. </span>Assuming the converse, there is a positive number
<!--l. 184--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B4;</mi></math> and the
<!--l. 184--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi></math>-dimensional
<!--l. 184--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math> subspaces
<!--l. 185--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
><mi 
>n</mi> </mrow> </msub 
>   <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>X</mi></math> such
that
</p>

<div class="math-display"><!--l. 186--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
             <munder class="msub"><mrow 
><mo 
class="MathClass-op">sup</mo> </mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>H</mi></mrow></msub 
></mrow></munder 
><munder class="msub"><mrow 
><mo 
class="MathClass-op"> inf</mo> </mrow><mrow 
><mi 
>y</mi><mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></munder 
><mroot><mrow 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>y</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>x</mi></mrow></mfenced></mrow><mrow 
><mi 
>X</mi></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x003C;</mo> <mfrac><mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow> 
<mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow></mfrac> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>&#x03B4;</mi><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 189--><p class="nopar">Let <!--l. 190--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mfenced separators="" 
open="{"  close="}" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mn>1</mn></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo><mo 
class="MathClass-punc">,</mo><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
>
<mi 
>n</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced></math> be a
basis of <!--l. 191--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math>.
Denoting
<!--tex4ht:inline--></p><!--l. 192--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
               <msub><mrow 
><mi 
>r</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><munder class="msub"><mrow 
><mo 
class="MathClass-op"> inf</mo> </mrow><mrow 
><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></munder 
><mroot><mrow 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>X</mi></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot><mo 
class="MathClass-punc">,</mo>
</math>
<!--l. 195--><p class="nopar">we have </p><table class="equation"><tr><td> <a 
 id="x1-3001r1"></a>
<!--l. 197--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" class="equation">
                   <munder class="msub"><mrow 
><mo 
class="MathClass-op">sup</mo> </mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>H</mi></mrow></msub 
></mrow></munder 
><msub><mrow 
><mi 
>r</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">&#x003C;</mo> <mfrac><mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow> 
<mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow></mfrac> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>&#x03B4;</mi><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">.</mo>
</math></td><td class="eq-no">(1)</td></tr></table>
<!--l. 202--><p class="indent">For each <!--l. 202--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>H</mi></mrow></msub 
></math> take
coefficients <!--l. 202--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
such that </p><table class="equation"><tr><td> <a 
 id="x1-3002r2"></a>

<!--l. 203--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" class="equation">
     <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msub><mrow 
><mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><munderover accentunder="false" accent="false"><mrow  
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>X</mi></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">=</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><msub><mrow 
><mi 
>r</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>
</math></td><td class="eq-no">(2)</td></tr></table>
<!--l. 207--><p class="indent">Since <!--l. 207--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math>
is <!--l. 207--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></math>-upper
bounded in <!--l. 207--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi></math>,
it follows that </p><table class="equation"><tr><td> <a 
 id="x1-3003r3"></a>
<!--l. 208--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" class="equation">
                 <msubsup><mrow 
><mi 
>&#x03C8;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo>   <mfrac><mrow 
><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow> 
<mrow 
><msup><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <mi 
>&#x025B;</mi></mrow></mfenced></mrow><mrow 
><mi 
>n</mi></mrow></msup 
></mrow></mfrac> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>H</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>k</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo> <mn>2</mn><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo><mo 
class="MathClass-punc">,</mo><mi 
>n</mi><mo 
class="MathClass-punc">,</mo>
</math></td><td class="eq-no">(3)</td></tr></table>
<!--l. 213--><p class="indent">for each positive <!--l. 213--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x025B;</mi></math>
beginning from some <!--l. 213--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>N</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x025B;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
</p><!--l. 215--><p class="indent">The linear dependence of the system
<!--tex4ht:inline--></p><!--l. 216--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><msubsup><mrow 
>
       <mfenced separators="" 
open="{"  close="}" ><mrow><mfenced separators="" 
open="&#x3008;"  close="&#x3009;" ><mrow><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
><mn>1</mn></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msubsup><mrow 
><mi 
>&#x03C8;</mi></mrow><mrow 
>
<mi 
>i</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">,</mo><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mn>2</mn></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msubsup><mrow 
><mi 
>&#x03C8;</mi></mrow><mrow 
>
<mi 
>i</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo><mo 
class="MathClass-punc">,</mo><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>n</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msubsup><mrow 
><mi 
>&#x03C8;</mi></mrow><mrow 
>
<mi 
>i</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfenced></mrow></mfenced></mrow><mrow 
>
<mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></msubsup 
><!--mstyle 
class="text"--><mtext >&#x00A0;in&#x00A0;</mtext><!--/mstyle--><msup><mrow 
><mi mathvariant="double-struck">&#x2102;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msup 
>
</math>
<!--l. 220--><p class="nopar">implies the existence of coefficients
<!--l. 222--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mi 
>c</mi></mrow><mrow 
><mi 
>i</mi> </mrow> <mrow 
>  <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></math>,
<!--l. 222--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>i</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo><mo 
class="MathClass-punc">,</mo><mi 
>n</mi> <mo 
class="MathClass-bin">+</mo> <mn>1</mn></math> such
that <!--l. 223--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x2211;</mo>
  </mrow><mrow 
><mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></munderover 
><msubsup><mrow 
><mi 
>c</mi></mrow><mrow 
>
<mi 
>i</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msubsup><mrow 
><mi 
>&#x03C8;</mi></mrow><mrow 
>
<mi 
>i</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mn>0</mn></math>,

<!--l. 224--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo> <mn>2</mn><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></math> and </p><table class="equation"><tr><td>
<a 
 id="x1-3004r4"></a>
<!--l. 226--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" class="equation">
                        <munder class="msub"><mrow 
><mo 
class="MathClass-op">max</mo> </mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>i</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></munder 
> <mfenced separators="" 
open="|"  close="|" ><mrow><msubsup><mrow 
><mi 
>c</mi></mrow><mrow 
><mi 
>i</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">.</mo>
</math></td><td class="eq-no">(4)</td></tr></table>
<!--l. 230--><p class="indent">Denote <!--l. 230--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x2211;</mo>
  </mrow><mrow 
><mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></munderover 
><msubsup><mrow 
><mi 
>c</mi></mrow><mrow 
>
<mi 
>i</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><msubsup><mrow 
><mi 
>&#x03C8;</mi></mrow><mrow 
>
<mi 
>i</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></math>.
Combining (<a 
href="#x1-3001r1">1<!--tex4ht:ref: eq1 --></a>) &#x2013; (<a 
href="#x1-3004r4">4<!--tex4ht:ref: eq4 --></a>), we obtain
</p><!--tex4ht:inline--><!--l. 257--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mtable 
columnalign="left" class="align-star">
    <mtr><mtd 
columnalign="right" class="align-odd"></mtd>    <mtd 
class="align-even">   <mfrac><mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow>
<mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <mi 
>&#x025B;</mi></mrow></mfrac> <mo 
class="MathClass-rel">&#x2264;</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msub><mrow 
><mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></msub 
></mrow></mfenced> </mrow><mrow 
><mi 
>X</mi></mrow></msub 
></mrow><mrow 
><mi 
>n</mi> <mo 
class="MathClass-bin">+</mo> <mn>1</mn></mrow></mroot><mspace width="2em"/></mtd>                                                  <mtd 
columnalign="right" class="align-label"></mtd>    <mtd 
class="align-label">
    <mspace width="2em"/></mtd></mtr><mtr><mtd 
columnalign="right" class="align-odd"></mtd>    <mtd 
class="align-even"> <mo 
class="MathClass-rel">=</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msub><mrow 
><mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>c</mi></mrow><mrow 
>
<mi 
>i</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
> <mfenced separators="" 
open="["  close="]" ><mrow><munderover accentunder="false" accent="false"><mrow  
><mi 
>&#x03C8;</mi></mrow><mrow 
>
<mi 
>i</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
> <mo 
class="MathClass-bin">&#x2212;</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
><mrow><mo 
class="MathClass-open">(</mo><mrow><munderover accentunder="false" accent="false"><mrow  
><mi 
>&#x03C8;</mi></mrow><mrow 
>
<mi 
>i</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
></mrow><mo 
class="MathClass-close">)</mo></mrow><munderover accentunder="false" accent="false"><mrow  
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
></mrow></mfenced></mrow></mfenced> </mrow><mrow 
>
<mi 
>X</mi></mrow></msub 
></mrow><mrow 
><mi 
>n</mi> <mo 
class="MathClass-bin">+</mo> <mn>1</mn></mrow></mroot><mspace width="2em"/></mtd>           <mtd 
columnalign="right" class="align-label"></mtd>    <mtd 
class="align-label">
    <mspace width="2em"/></mtd></mtr><mtr><mtd 
columnalign="right" class="align-odd"></mtd>    <mtd 
class="align-even"> <mo 
class="MathClass-rel">&#x2264;</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></munderover 
><mfenced separators="" 
open="|"  close="|" ><mrow><munderover accentunder="false" accent="false"><mrow  
><mi 
>c</mi></mrow><mrow 
>
<mi 
>i</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
></mrow></mfenced></mrow><mrow 
><mi 
>n</mi> <mo 
class="MathClass-bin">+</mo> <mn>1</mn></mrow></mroot><mspace width="2em"/></mtd>                                                <mtd 
columnalign="right" class="align-label"></mtd>    <mtd 
class="align-label">
    <mspace width="2em"/></mtd></mtr><mtr><mtd 
columnalign="right" class="align-odd"></mtd>    <mtd 
class="align-even"><mspace width="2em" class="qquad"/><mspace width="2em" class="qquad"/> <mo 
class="MathClass-bin">&#x00D7;</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">max</mo> </mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>i</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></munder 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msubsup><mrow 
><mi 
>&#x03C8;</mi></mrow><mrow 
><mi 
>i</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
> <mo 
class="MathClass-bin">&#x2212;</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
><mrow><mo 
class="MathClass-open">(</mo><mrow><munderover accentunder="false" accent="false"><mrow  
><mi 
>&#x03C8;</mi></mrow><mrow 
>
<mi 
>i</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
></mrow><mo 
class="MathClass-close">)</mo></mrow><munderover accentunder="false" accent="false"><mrow  
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>X</mi></mrow></msub 
></mrow><mrow 
><mi 
>n</mi> <mo 
class="MathClass-bin">+</mo> <mn>1</mn></mrow></mroot><mspace width="2em"/></mtd>               <mtd 
columnalign="right" class="align-label"></mtd>    <mtd 
class="align-label">
    <mspace width="2em"/></mtd></mtr><mtr><mtd 
columnalign="right" class="align-odd"></mtd>    <mtd 
class="align-even"> <mo 
class="MathClass-rel">=</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">max</mo> </mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>i</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></munder 
><msub><mrow 
><mi 
>r</mi></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msubsup><mrow 
><mi 
>&#x03C8;</mi></mrow><mrow 
><mi 
>i</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2264;</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
>
<mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">sup</mo> </mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>H</mi></mrow></msub 
></mrow></munder 
><msub><mrow 
><mi 
>r</mi></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2264;</mo><mfrac><mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow> 
<mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow></mfrac> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>&#x03B4;</mi><mo 
class="MathClass-punc">.</mo><mspace width="2em"/></mtd>    <mtd 
columnalign="right" class="align-label"></mtd>    <mtd 
class="align-label">
  <mspace width="2em"/></mtd></mtr></mtable></math>
<!--l. 258--><p class="noindent">This yields that <!--l. 258--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mfrac><mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow>
<mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow></mfrac>  <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>&#x03B4;</mi> <mo 
class="MathClass-rel">&#x2265;</mo><mfrac><mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow> 
<mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow></mfrac></math>
and the contradiction proves the lemma.
</p><!--l. 261--><p class="indent">The following <span 
class="cmti-12">basic </span>lemma shows that checking of
<!--l. 261--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>q</mi></math>-boundedness
of even one system leads to solution of both problems at once.
</p><!--l. 264--><p class="indent"><span 
class="cmbx-12">Lemma 2.2 (Basic lemma)</span>

</p><!--l. 266--><p class="indent"><span 
class="cmbxti-10x-x-120">FM) </span><span 
class="cmti-12">Suppose </span><!--l. 266--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>X</mi></math> <span 
class="cmti-12">are</span>
<span 
class="cmti-12">Banach spaces and </span><!--l. 266--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>x</mi></mrow></mfenced></mrow><mrow 
><mi 
>X</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>C</mi><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>x</mi></mrow></mfenced></mrow><mrow 
><mi 
>H</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>H</mi><mo 
class="MathClass-punc">.</mo></math>
<span 
class="cmti-12">If exists a matrix </span><!--l. 267--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>H</mi></math><span 
class="cmti-12">,</span>
<span 
class="cmti-12">which is </span><!--l. 267--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></math>-<span 
class="cmti-12">lower</span>
<span 
class="cmti-12">bounded in </span><!--l. 267--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math> <span 
class="cmti-12">and</span>
<!--l. 267--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>2</mn> </mrow> </msub 
> </math>-<span 
class="cmti-12">upper bounded in</span>
<!--l. 267--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi></math><span 
class="cmti-12">, then for every</span>
<span 
class="cmti-12">matrix </span><!--l. 267--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>X</mi></math> <span 
class="cmti-12">there</span>
<span 
class="cmti-12">is an element </span><!--l. 267--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>H</mi></math>
<span 
class="cmti-12">such that</span>
</p>
<div class="math-display"><!--l. 268--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
              <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msub><mrow 
><mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>X</mi></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo><mfrac><mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow> 
<mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow></mfrac><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 271--><p class="nopar"><span 
class="cmti-12">for all numerical matrices </span><!--l. 272--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math>.
</p><!--l. 274--><p class="indent"><span 
class="cmbxti-10x-x-120">BW) </span><span 
class="cmti-12">Let </span><!--l. 274--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced> </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math> <span 
class="cmti-12">be</span>
<span 
class="cmti-12">a </span><!--l. 274--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mn>0</mn></math>-<span 
class="cmti-12">lower and</span>
<!--l. 274--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x221E;</mi></math>-<span 
class="cmti-12">upper bounded system</span>
<span 
class="cmti-12">in a Banach space </span><!--l. 274--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math><span 
class="cmti-12">.</span>
<span 
class="cmti-12">For </span><!--l. 274--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math> <span 
class="cmti-12">there are</span>
<span 
class="cmti-12">polynomials </span><!--l. 274--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><msub><mrow 
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
></math>
<span 
class="cmti-12">satisfying </span><!--l. 274--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mroot><mrow 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></mfenced> </mrow><mrow 
><mi 
>X</mi></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot><munder class="msub"><mrow 
><mo 
class="MathClass-op">&#x2192;</mo></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mn>0</mn></math> <span 
class="cmti-12">if</span>
<span 
class="cmti-12">and only if  </span><!--l. 275--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></munderover 
><msub><mrow 
><mi 
>x</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
><msub><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mroot><mrow 
> <mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced> </mrow><mrow 
><mi 
>k</mi></mrow></mroot><munder class="msub"><mrow 
><mo 
class="MathClass-op">&#x2192;</mo></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mn>0</mn></math>.
</p><!--l. 277--><p class="indent"><span 
class="cmbx-12">Proof. </span>One can &#xFB01;nd <span 
class="cmti-12">BW) </span>proof in [F] under even more general
conditions.
</p><!--l. 280--><p class="indent"><span 
class="cmbxti-10x-x-120">FM) </span>Assuming the converse, it is possible to take
<!--l. 280--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi> </mrow> <mrow 
>  <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced></mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>X</mi></math> such
that <!--l. 280--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><munder class="msub"><mrow 
><mo 
class="MathClass-op"> lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><msub><mrow 
><mi 
>r</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">&#x003C;</mo> <mfrac><mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow> 
<mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow></mfrac><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mrow><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-op">&#x2200;</mo><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>H</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math> for
<!--l. 281--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>r</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><mo 
class="MathClass-rel">=</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> inf</mo> </mrow><mrow 
><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></munder 
><mroot><mrow 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op">&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>X</mi></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot></math>. Then let
<!--l. 281--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x22C3;</mo>
  </mrow><mrow 
><mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></munderover 
><msub><mrow 
><mi 
>H</mi></mrow><mrow 
>
<mi 
>i</mi></mrow></msub 
></math>, where
<!--l. 281--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>i</mi> </mrow> </msub 
>  <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>H</mi> <mo 
class="MathClass-punc">:</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><msub><mrow 
><mi 
>r</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">&#x003C;</mo> <mfrac><mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow> 
<mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow></mfrac>  <mo 
class="MathClass-bin">&#x2212;</mo><mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><mi 
>i</mi></mrow></mfrac> </mrow></mfenced></math>. Since
<!--l. 281--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi></math> is a Banach space,

one can take some <!--l. 281--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>H</mi></mrow><mrow 
><msub><mrow 
><mi 
>i</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
></math>
being a set of the second category there.
</p><!--l. 283--><p class="indent">Denote <!--l. 283--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mfrac><mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow> 
<mrow 
><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow></mfrac>  <mo 
class="MathClass-bin">&#x2212;</mo> <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><msub><mrow 
><mi 
>i</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></mfrac></math>
and
</p>
<div class="math-display"><!--l. 284--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                  <msub><mrow 
><mi 
>E</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>H</mi> <mo 
class="MathClass-punc">:</mo> <msub><mrow 
><mi 
>r</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">&#x2264;</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>f</mi><mi 
>o</mi><mi 
>r</mi><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>k</mi></mrow></mfenced><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 286--><p class="nopar">As <!--l. 287--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mo 
class="MathClass-bin">&#x2217;</mo></mrow></mfenced></mrow><mrow 
><mi 
>H</mi></mrow></msub 
></math> is stronger
than <!--l. 287--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mo 
class="MathClass-bin">&#x2217;</mo></mrow></mfenced></mrow><mrow 
><mi 
>X</mi></mrow></msub 
></math>, the sets
<!--l. 287--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>E</mi></mrow><mrow 
><mi 
>k</mi> </mrow> </msub 
> </math> are closed
in <!--l. 287--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>H</mi></math>. Since
<!--l. 287--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>H</mi></mrow><mrow 
><msub><mrow 
><mi 
>i</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op">&#x22C3;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></munderover 
><msub><mrow 
><mi 
>E</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
></math>, then some
<!--l. 287--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>E</mi></mrow><mrow 
><msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow></msub 
></math> contains
a ball in <!--l. 287--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi></math>,
that is the estimates
</p>
<div class="math-display"><!--l. 289--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                       <msub><mrow 
><mi 
>r</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <mi 
>&#x03BC;</mi><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2264;</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <msub><mrow 
><mi 
>k</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow>
</mrow></math></div>
<!--l. 291--><p class="nopar">hold for some positive number <!--l. 292--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03BC;</mi></math>,
for some <!--l. 292--><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 
>X</mi></math> and for
each <!--l. 292--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi></math> chosen from
the unit ball <!--l. 293--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>H</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>H</mi> <mo 
class="MathClass-punc">:</mo><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>x</mi></mrow></mfenced></mrow><mrow 
><mi 
>H</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo> <mn>1</mn></mrow></mfenced></math>.

As
<!--tex4ht:inline--></p><!--l. 294--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
<mtable 
class="multline-star">
<mtr><mtd 
class="multline-star"><mroot><mrow 
><mi 
>&#x03BC;</mi></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-punc">&#x22C5;</mo> <msub><mrow 
><mi 
>r</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> <msub><mrow 
><mi 
>r</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x03BC;</mi><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow>
</mtd></mtr><mtr><mtd 
class="multline-star"> <mo 
class="MathClass-rel">&#x2264;</mo><mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">inf</mo> </mrow><mrow 
><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></munder 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <mi 
>&#x03BC;</mi><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>X</mi></mrow></msub 
> <mo 
class="MathClass-bin">+</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> inf</mo> </mrow><mrow 
><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></munder 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>X</mi></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot>
</mtd></mtr><mtr><mtd 
class="multline-star"> <mo 
class="MathClass-rel">&#x2264;</mo><mroot><mrow 
><mn>2</mn></mrow><mrow 
><mi 
>n</mi></mrow></mroot><msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><mspace width="1em" class="quad"/><mrow><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-op">&#x2200;</mo><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>H</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">,</mo>                                                         </mtd></mtr></mtable>
</math>
<!--l. 303--><p class="nopar">
then
</p>
<div class="math-display"><!--l. 305--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                    <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">sup</mo> </mrow><mrow 
><mi 
>x</mi><mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>H</mi></mrow></msub 
></mrow></munder 
><msub><mrow 
><mi 
>r</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">&#x2264;</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 307--><p class="nopar">Therefore
</p>

<div class="math-display"><!--l. 309--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                     <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msub><mrow 
><mi 
>d</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>H</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mi 
>X</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2264;</mo> <msub><mrow 
><mi 
>q</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
>
</mrow></math></div>
<!--l. 311--><p class="nopar">that contradicts lemma 2.1.
</p><!--l. 314--><p class="indent">To each pair <!--l. 314--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>X</mi><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
></mrow></mfenced></math>,
where <!--l. 314--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math>
is some matrix of elements from a Banach space
<!--l. 315--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>, let&#x2019;s put in
correspondence the set <!--l. 315--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2111;</mi></mrow><mrow 
><mi 
>X</mi></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
></mrow></mfenced></math>,
consisting of elements <!--l. 315--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>
that
</p>
<div class="math-display"><!--l. 316--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
   <munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>j</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
</mrow><mrow 
><mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>j</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>i</mi><mi 
>j</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>&#x03D5;</mi></mrow><mrow 
>
<mi 
>i</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>j</mi></mrow></mfenced></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mo> &#x2192;</mo></mrow><mrow 
>
<mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow><mrow 
><mi 
>X</mi></mrow></munderover 
><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><munder class="msub"><mrow 
><mo>sup</mo> </mrow><mrow 
>
<mi 
>n</mi></mrow></munder 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
> &#x2211;</mo>
  </mrow><mrow 
><mi 
>j</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>j</mi></mrow></munderover 
><mfenced separators="" 
open="|"  close="|" ><mrow><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>i</mi><mi 
>j</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></munderover 
></mrow></mfenced> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>&#x221E;</mi><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 318--><p class="nopar">
</p><!--l. 320--><p class="indent"><span 
class="cmbx-12">Corollary. </span><span 
class="cmti-12">Let </span><!--l. 320--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math> <span 
class="cmti-12">be</span>
<!--l. 320--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>q</mi></math>-<span 
class="cmti-12">lower bounded matrix</span>
<span 
class="cmti-12">in the Banach space </span><!--l. 320--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>
<span 
class="cmti-12">and </span><!--l. 320--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>X</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>C</mi><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>k</mi> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>n</mi><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>n</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo> <mn>2</mn><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo></math><span 
class="cmti-12">. Then for</span>
<span 
class="cmti-12">each matrix </span><!--l. 320--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>X</mi></math> <span 
class="cmti-12">there</span>
<span 
class="cmti-12">is an element </span><!--l. 321--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
>&#x2111;</mi></mrow><mrow 
><mi 
>X</mi></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
></mrow></mfenced></math>
<span 
class="cmti-12">such that</span>
</p>

<div class="math-display"><!--l. 323--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
               <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msub><mrow 
><mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></munderover 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>X</mi></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>q</mi><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 325--><p class="nopar"><span 
class="cmti-12">for all numerical matrices </span><!--l. 326--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math>.
</p><!--l. 328--><p class="indent"><span 
class="cmbx-12">Proof. </span>Let <!--l. 328--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>M</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math> be the Banach
space of all <!--l. 328--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi 
>n</mi></math> triangular
numerical matrices <!--l. 328--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>a</mi> <mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="("  close=")" ><mrow><msub><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>i</mi><mi 
>j</mi></mrow></msub 
></mrow></mfenced></math>,
<!--l. 328--><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> <mi 
>j</mi> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>n</mi></math>, equipped with
the norm <!--l. 328--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="|"  close="|" ><mrow><mi 
>a</mi></mrow></mfenced></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x2211;</mo>
  </mrow><mrow 
><mi 
>j</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op">&#x2211;</mo></mrow><mrow 
>
<mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>j</mi></mrow></munderover 
><mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>i</mi><mi 
>j</mi></mrow></msub 
></mrow></mfenced></math>.
For <!--l. 328--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>a</mi> <mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="("  close=")" ><mrow><msub><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>i</mi><mi 
>j</mi></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>M</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math>
denote
</p>
<div class="math-display"><!--l. 329--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                   <mi 
>a</mi><mi 
>&#x03D5;</mi> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
> &#x2211;</mo>
  </mrow><mrow 
><mi 
>j</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>j</mi></mrow></munderover 
><msub><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>i</mi><mi 
>j</mi></mrow></msub 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>i</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>j</mi></mrow></mfenced></mrow></munderover 
> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 331--><p class="nopar">Consider the set <!--l. 332--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>M</mi></math>
of sequences <!--l. 332--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>A</mi> <mo 
class="MathClass-rel">=</mo><msubsup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>a</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>n</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><msup><mrow 
><mi 
>a</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msup 
> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>M</mi></mrow><mrow 
>
<mi 
>n</mi></mrow></msub 
></math> that
converges in <!--l. 332--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>,
</p>

<div class="math-display"><!--l. 333--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                          <mi 
>A</mi><mi 
>&#x03D5;</mi> <mo 
class="MathClass-rel">=</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> lim</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><msup><mrow 
><mi 
>a</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msup 
><mi 
>&#x03D5;</mi><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 335--><p class="nopar">and <!--l. 336--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><munder class="msub"><mrow 
><mo 
class="MathClass-op"> sup</mo> </mrow><mrow 
><mi 
>n</mi></mrow></munder 
><msub><mrow 
> <mfenced separators="" 
open="|"  close="|" ><mrow><msup><mrow 
><mi 
>a</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>&#x221E;</mi></math>.
Then <!--l. 336--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>M</mi></math>
is a Banach space, with the norm
</p>
<div class="math-display"><!--l. 338--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
><msub><mrow 
>
                           <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>A</mi></mrow></mfenced></mrow><mrow 
><mi 
>M</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> sup</mo> </mrow><mrow 
><mi 
>n</mi></mrow></munder 
><msub><mrow 
> <mfenced separators="" 
open="|"  close="|" ><mrow><msup><mrow 
><mi 
>a</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 340--><p class="nopar">Therefore the set <!--l. 341--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2111;</mi></mrow><mrow 
><mi 
>X</mi></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
></mrow></mfenced></math>
that coincide with <!--l. 341--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>A</mi><mi 
>&#x03D5;</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>A</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>M</mi></mrow></mfenced></math>
turns to a Banach space, equipped with the norm
</p>

<div class="math-display"><!--l. 343--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
><msub><mrow 
>
                        <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>x</mi></mrow></mfenced></mrow><mrow 
><msub><mrow 
><mi 
>&#x2111;</mi></mrow><mrow 
><mi 
>X</mi></mrow></msub 
></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> inf</mo> </mrow><mrow 
><mi 
>A</mi><mo 
class="MathClass-punc">:</mo><mi 
>A</mi><mi 
>&#x03D5;</mi><mo 
class="MathClass-rel">=</mo><mi 
>x</mi></mrow></munder 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>A</mi></mrow></mfenced></mrow><mrow 
><mi 
>M</mi></mrow></msub 
><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 345--><p class="nopar">Indeed, <!--l. 346--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2111;</mi></mrow><mrow 
><mi 
>X</mi></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
></mrow></mfenced></math>
is isometrically isomorphic to the factor space
<!--l. 346--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>M</mi><mi 
><mfenced separators="" 
open="/"  close="" ><mrow> </mrow></mfenced></mi><msub><mrow 
><mi 
>M</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
></math>, which is a Banach
space as <!--l. 346--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>M</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>A</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>A</mi><mi 
>&#x03D5;</mi> <mo 
class="MathClass-rel">=</mo> <mn>0</mn></mrow></mfenced></math> is a closed
subspace of <!--l. 346--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>M</mi></math>.
</p><!--l. 348--><p class="indent">To complete the proof it is enough to note that
</p>
<div class="math-display"><!--l. 349--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
><msub><mrow 
>
                <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
></mrow></mfenced></mrow><mrow 
><msub><mrow 
>
<mi 
>&#x2111;</mi></mrow><mrow 
><mi 
>X</mi></mrow></msub 
></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>x</mi></mrow></mfenced></mrow><mrow 
><mi 
>X</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>C</mi><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>x</mi></mrow></mfenced></mrow><mrow 
><msub><mrow 
><mi 
>&#x2111;</mi></mrow><mrow 
><mi 
>X</mi></mrow></msub 
></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
>&#x2111;</mi></mrow><mrow 
><mi 
>X</mi></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
></mrow></mfenced>
</mrow></math></div>
<!--l. 351--><p class="nopar">and use basic lemma FM).
</p>
<h3 class="sectionHead"><span class="titlemark">3. </span> <a 
 id="x1-40003"></a>Application 1</h3>
<!--l. 357--><p class="noindent">Let <!--l. 357--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math>
be a compact subset of the open unit disk
<!--l. 357--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>D</mi></math> with positive
logarithmic capacity <!--l. 357--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B3;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,
<!--l. 357--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>C</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math> be the set of
continuous functions on <!--l. 357--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math>

and <!--l. 358--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
be the set of bounded analytic functions on the unit disk
<!--l. 358--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>D</mi></math>.
</p><!--l. 360--><p class="indent">Take <!--l. 360--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi> <mo 
class="MathClass-rel">=</mo> <msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>X</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>C</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
then <!--l. 360--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>X</mi></math>
and <!--l. 360--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mspace width="0em" class="thinspace"/><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mo 
class="MathClass-bin">&#x2217;</mo></mrow></mfenced></mrow><mrow 
><mi 
>X</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo><msub><mrow 
><mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mo 
class="MathClass-bin">&#x2217;</mo></mrow></mfenced></mrow><mrow 
><mi 
>H</mi></mrow></msub 
></math>.
</p><!--l. 362--><p class="indent">It is obvious that the system <!--l. 362--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <msup><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>k</mi></mrow></msup 
></math>
is <!--l. 362--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mn>1</mn></math>-upper
bounded in <!--l. 362--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi></math>.
On the other hand, one can easily establish
<!--l. 362--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mfrac><mrow 
><mi 
>&#x03B3;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow>
   <mrow 
><mn>4</mn></mrow></mfrac>  </math>-lower
boundedness of <!--l. 362--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>k</mi></mrow></msup 
></mrow></mfenced> </mrow><mrow 
>
<mn>0</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math>
in <!--l. 362--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math>
using the following
</p><!--l. 365--><p class="indent"><span 
class="cmbx-12">Proposition ([F])</span><span 
class="cmbxti-10x-x-120">. </span><span 
class="cmti-12">For each polynomial</span>
<!--l. 365--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi> </mrow><mrow 
><mi 
>n</mi> </mrow> </msub 
> <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>0</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><msub><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
><msup><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>k</mi></mrow></msup 
><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><msub><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mn>0</mn></mrow></msub 
><mo 
class="MathClass-rel">&#x2260;</mo><mn>0</mn></math> <span 
class="cmti-12">there is a</span>
<span 
class="cmti-12">polynomial </span><!--l. 365--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>Q</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>0</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><msub><mrow 
><mi 
>b</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
><msup><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>k</mi></mrow></msup 
><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><msub><mrow 
><mi 
>b</mi></mrow><mrow 
>
<mn>0</mn></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mn>1</mn></math>
<span 
class="cmti-12">satisfying</span>
</p>
<div class="math-display"><!--l. 366--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                 <mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfenced> <mo 
class="MathClass-rel">&#x2265;</mo><mfrac><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">max</mo> </mrow><mrow 
><mn>0</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
> <mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced></mrow> 
        <mrow 
><msup><mrow 
><mn>4</mn></mrow><mrow 
><mi 
>n</mi></mrow></msup 
></mrow></mfrac>          <mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>Q</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfenced> <mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>z</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mover accent="false" 
class="mml-overline"><mrow><mi 
>D</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 368--><p class="nopar">
</p><!--l. 371--><p class="indent">Now applying basic lemma we obtain Fisher-Micchelli&#x2019;s and Bernstein-Walsh&#x2019;s
results.
</p><!--l. 374--><p class="indent"><span 
class="cmbx-12">(FM) </span><span 
class="cmti-12">Let </span><!--l. 374--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math> <span 
class="cmti-12">be a matrix of</span>
<span 
class="cmti-12">continuous functions on </span><!--l. 374--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math><span 
class="cmti-12">.</span>
<span 
class="cmti-12">Then there is a function </span><!--l. 374--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
<span 
class="cmti-12">such that</span>
</p>

<div class="math-display"><!--l. 375--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
            <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msub><mrow 
><mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>f</mi> <mo 
class="MathClass-bin">&#x2212;</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></munderover 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>C</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>K</mi></mrow></mfenced></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo><mfrac><mrow 
><mi 
>&#x03B3;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow> 
   <mrow 
><mn>4</mn></mrow></mfrac>   <mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 377--><p class="nopar"><span 
class="cmti-12">for all numerical matrices </span><!--l. 378--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math>.
</p><!--l. 380--><p class="indent"><span 
class="cmbx-12">(BW) </span><span 
class="cmti-12">The class of functions </span><!--l. 380--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>K</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mi mathvariant="double-struck">&#x2102;</mi></math>,
<span 
class="cmti-12">permitting the fast approximation by &#xFB01;nite linear combinations of the system</span>
<!--l. 380--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>k</mi> </mrow> </msup 
></mrow></mfenced></mrow><mrow 
>
<mn>0</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math> <span 
class="cmti-12">in</span>
<!--l. 380--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>C</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>, <span 
class="cmti-12">coincide</span>
<span 
class="cmti-12">with </span><!--l. 380--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi mathvariant="double-struck">&#x2102;</mi></mrow></mfenced></math>.
</p><!--l. 382--><p class="indent">As you could see we have obtained FM and BW results by checking q-boundedness of
just one system <!--l. 383--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>k</mi></mrow></msup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>0</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math>.
</p>
<h3 class="sectionHead"><span class="titlemark">4. </span> <a 
 id="x1-50004"></a>Application 2</h3>
<!--l. 388--><p class="noindent">It was mentioned above that to make the fast approximation of
<!--l. 388--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msup 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>D</mi></mrow></mfenced></math> we
have to miniaturize it up to the class of entire functions. Now let&#x2019;s consider
another miniaturization.
</p><!--l. 391--><p class="indent">Suppose <!--l. 391--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mn>0</mn> <mo 
class="MathClass-rel">&#x2264;</mo> <msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x003C;</mo> <msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x003C;</mo> <mo 
class="MathClass-op">&#x2026;</mo> <mo 
class="MathClass-rel">&#x003C;</mo> <msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x003C;</mo> <mo 
class="MathClass-op">&#x2026;</mo></math> are
integers with density <!--l. 391--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C4;</mi></math>,
i.e. <!--l. 392--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><munder class="msub"><mrow 
><mo 
class="MathClass-op"> lim</mo> </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
> <mfrac><mrow 
><mi 
>k</mi></mrow> 
<mrow 
><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfrac> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x03C4;</mi></math>.
</p><!--l. 394--><p class="indent">Denote

</p><!--tex4ht:inline--><!--l. 402--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mtable 
columnalign="left" class="align-star">
   <mtr><mtd 
columnalign="right" class="align-odd"><msubsup><mrow 
><mi 
>H</mi></mrow><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo> <mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
> &#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></munderover 
><msub><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
><msup><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>k</mi></mrow></msup 
><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><msub><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>k</mi><mo 
class="MathClass-rel">&#x2209;</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced></mrow></mfenced> <mo 
class="MathClass-punc">,</mo></mtd>   <mtd 
class="align-even"><mspace width="2em"/></mtd>   <mtd 
columnalign="right" class="align-label">
   </mtd></mtr><mtr><mtd 
columnalign="right" class="align-odd"><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>f</mi></mrow></mfenced></mrow><mrow 
><msubsup><mrow 
><mi 
>H</mi></mrow><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
><mi 
>n</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
></mrow></mfenced></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> sup</mo> </mrow><mrow 
><mi 
>z</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>D</mi></mrow></munder 
> <mfenced separators="" 
open="|"  close="|" ><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfenced> <mo 
class="MathClass-punc">.</mo></mtd>                                         <mtd 
class="align-even"><mspace width="2em"/></mtd>   <mtd 
columnalign="right" class="align-label">
  </mtd></mtr></mtable></math>
<!--l. 405--><p class="noindent">Let <!--l. 405--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math> be a compact subset of
the unit disk <!--l. 405--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>D</mi> <mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>z</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2102;</mi> <mo 
class="MathClass-punc">:</mo> <mfenced separators="" 
open="|"  close="|" ><mrow><mi 
>z</mi></mrow></mfenced> <mo 
class="MathClass-rel">&#x003C;</mo> <mn>1</mn></mrow></mfenced></math> with positive
logarithmic capacity <!--l. 405--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B3;</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>K</mi></mrow></mfenced></math>.
</p><!--l. 409--><p class="indent"><span 
class="cmbx-12">Theorem 4.1</span>
</p><!--l. 411--><p class="indent"><span 
class="cmbxti-10x-x-120">FM 1) </span><span 
class="cmti-12">If </span><!--l. 411--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C4;</mi> <mo 
class="MathClass-rel">=</mo> <mn>0</mn></math>
<span 
class="cmti-12">then </span><!--l. 411--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><munder class="msub"><mrow 
><mo 
class="MathClass-op">lim</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msub><mrow 
><mi 
>d</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>B</mi><mo 
class="MathClass-punc">,</mo><mi 
>C</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfenced> </mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">=</mo> <mn>0</mn></math><span 
class="cmti-12">, for</span>
<span 
class="cmti-12">the unit ball </span><!--l. 411--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>B</mi></math>
<span 
class="cmti-12">of </span><!--l. 411--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msubsup><mrow 
><mi 
>H</mi></mrow><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
</p><!--l. 413--><p class="indent"><span 
class="cmbxti-10x-x-120">FM 2) </span><span 
class="cmti-12">If </span><!--l. 413--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C4;</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn></math> <span 
class="cmti-12">then</span>
<span 
class="cmti-12">for each matrix </span><!--l. 413--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math>  <span 
class="cmti-12">of</span>
<span 
class="cmti-12">continuous functions on </span><!--l. 413--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math>
<span 
class="cmti-12">there is a function </span><!--l. 413--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msubsup><mrow 
><mi 
>H</mi></mrow><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
<span 
class="cmti-12">satisfying</span>
</p>
<div class="math-display"><!--l. 414--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
           <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msub><mrow 
><mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>f</mi> <mo 
class="MathClass-bin">&#x2212;</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></munderover 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>C</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>K</mi></mrow></mfenced></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo><msup><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mfrac><mrow 
><mi 
>&#x03B3;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow>
   <mrow 
><mn>4</mn></mrow></mfrac>   </mrow></mfenced> </mrow><mrow 
><mfrac><mrow 
><mn>1</mn></mrow>
<mrow 
><mi 
>&#x03C4;</mi></mrow></mfrac> </mrow></msup 
><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 418--><p class="nopar"><span 
class="cmti-12">for all numerical matrices </span><!--l. 419--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math>.
</p><!--l. 421--><p class="indent"><span 
class="cmbxti-10x-x-120">BW) </span><span 
class="cmti-12">If </span><!--l. 421--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C4;</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn></math> <span 
class="cmti-12">then the</span>
<span 
class="cmti-12">class of functions </span><!--l. 421--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>K</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mi mathvariant="double-struck">&#x2102;</mi></math>,
<span 
class="cmti-12">permitting the fast approximation by the &#xFB01;nite linear combinations of the system</span>
<!--l. 421--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>z</mi></mrow><mrow 
><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></msup 
></mrow></mfenced></mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math> <span 
class="cmti-12">in</span>

<!--l. 421--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>C</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>, <span 
class="cmti-12">coincide</span>
<span 
class="cmti-12">with </span><!--l. 421--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mi 
>H</mi></mrow><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x2229;</mo> <mi 
>H</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi mathvariant="double-struck">&#x2102;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
</p><!--l. 424--><p class="indent"><span 
class="cmbx-12">Proof.  </span>To prove <span 
class="cmti-12">FM1) </span>one can take the partial sums of corresponding
lacunary series as approximants. Proofs of <span 
class="cmti-12">FM2) </span>and <span 
class="cmti-12">BW) </span>can be established
by the basic lemma.
</p><!--l. 428--><p class="indent">Indeed, take <!--l. 428--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi> <mo 
class="MathClass-rel">=</mo> <msubsup><mrow 
><mi 
>H</mi></mrow><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>X</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>C</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
and <!--l. 428--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <msup><mrow 
><mi 
>z</mi></mrow><mrow 
><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></msup 
> <mo 
class="MathClass-rel">&#x2208;</mo> <msubsup><mrow 
><mi 
>H</mi></mrow><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
>
<mi 
>n</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>. It can be
easily checked that <!--l. 428--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>z</mi></mrow><mrow 
><msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></msup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math>
is <!--l. 428--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mn>1</mn></math>-upper
bounded in <!--l. 429--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>H</mi></math>
and <!--l. 429--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><mfrac><mrow 
><mi 
>&#x03B3;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow>
   <mrow 
><mn>4</mn></mrow></mfrac>   </mrow></mfenced> </mrow><mrow 
> <mfrac><mrow 
><mn>1</mn></mrow>
<mrow 
><mi 
>&#x03C4;</mi></mrow></mfrac> </mrow></msup 
></math>-lower
bounded in <!--l. 429--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi></math>.
</p>
<h3 class="sectionHead"><span class="titlemark">5. </span> <a 
 id="x1-60005"></a>Application 3</h3>
<!--l. 433--><p class="noindent">Consider the system of exponents </p><table class="equation"><tr><td> <a 
 id="x1-6001r5"></a>
<!--l. 434--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" class="equation"><msubsup><mrow 
>
                              <mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mi 
>x</mi></mrow></msup 
></mrow></mfenced></mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
><mo 
class="MathClass-punc">,</mo>
</math></td><td class="eq-no">(5)</td></tr></table>
<!--l. 438--><p class="indent">where <!--l. 438--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></math>
are disjoint numbers, which satisfy </p><table class="equation"><tr><td> <a 
 id="x1-6002r6"></a>
<!--l. 439--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" class="equation">
               <mi 
>R</mi><mi 
>e</mi><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>a</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/> <mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>M</mi> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>&#x221E;</mi><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>k</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo> <mn>2</mn><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo><mo 
class="MathClass-punc">.</mo>
</math></td><td class="eq-no">(6)</td></tr></table>

<!--l. 443--><p class="indent">To every function <!--l. 443--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
we put in correspondence its approximation error by &#xFB01;nite linear combinations of &#xFB01;rst
<!--l. 443--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi></math> elements of
(<a 
href="#x1-6001r5">5<!--tex4ht:ref: eq5 --></a>), i.e. <!--l. 443--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>E</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>f</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> inf</mo> </mrow><mrow 
><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></munder 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x2212;</mo><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op">&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mi 
>x</mi></mrow></msup 
></mrow></mfenced> </mrow><mrow 
><msup><mrow 
>
<mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
></math>.
There is an analogue of Bernstein theorem for exponents.
</p><!--l. 448--><p class="indent"><span 
class="cmbx-12">Theorem (Musoyan, [M1]) </span><span 
class="cmti-12">Let</span>
<!--l. 448--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math><span 
class="cmti-12">. Then the</span>
<span 
class="cmti-12">estimate </span><!--l. 449--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msub><mrow 
><mi 
>E</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>f</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x003C;</mo> <mn>1</mn></math>
<span 
class="cmti-12">holds if and only if there exists an entire function of exponential type with</span>
<span 
class="cmti-12">indicator diagram located in the open left half-plane coinciding with</span>
<!--l. 451--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math> <span 
class="cmti-12">on</span>
<!--l. 451--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo> <mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
<span 
class="cmti-12">almost everywhere.</span>
</p><!--l. 454--><p class="indent">In [Z] it has been shown that in a sense such rate of approximation can&#x2019;t be
improved.
</p><!--l. 458--><p class="indent"><span 
class="cmbx-12">Theorem ([Z]) </span><span 
class="cmti-12">Let </span><!--l. 458--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>D</mi></math> <span 
class="cmti-12">be</span>
<span 
class="cmti-12">a set of positive measure </span><!--l. 458--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03BC;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
<span 
class="cmti-12">and </span><!--l. 459--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>D</mi> <mo 
class="MathClass-rel">&#x2282;</mo><mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>z</mi> <mo 
class="MathClass-punc">:</mo> <mfenced separators="" 
open="|"  close="|" ><mrow><mi 
>z</mi></mrow></mfenced> <mo 
class="MathClass-rel">&#x2264;</mo> <msub><mrow 
><mi 
>M</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>R</mi><mi 
>e</mi><mi 
>z</mi> <mo 
class="MathClass-rel">&#x003C;</mo> <mn>0</mn></mrow></mfenced></math><span 
class="cmti-12">.</span>
<span 
class="cmti-12">If (</span><a 
href="#x1-6002r6"><span 
class="cmti-12">6</span><!--tex4ht:ref: eq6 --></a><span 
class="cmti-12">) takes place then</span>
</p>
<div class="math-display"><!--l. 460--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
              <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msub><mrow 
><mi 
>E</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>f</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo>  <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><mn>4</mn><mi 
>e</mi><msqrt><mrow><mi 
>&#x03C0;</mi></mrow></msqrt></mrow></mfrac>   <mfrac><mrow 
><msqrt><mrow><mi 
>&#x03BC;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msqrt></mrow> 
<mrow 
><mo class="qopname">max</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>M</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>M</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow></mfenced></mrow></mfrac><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 464--><p class="nopar"><span 
class="cmti-12">where </span><!--l. 465--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>f</mi></mrow><mrow 
><mi 
>&#x03BB;</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x03BB;</mi><mi 
>z</mi></mrow></msup 
></math>
<span 
class="cmti-12">for some </span><!--l. 465--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03BB;</mi></math>
<span 
class="cmti-12">chosen from </span><!--l. 465--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mo 
class="MathClass-bin">&#x2212;</mo><mover accent="false" 
class="mml-overline"><mrow><mi 
>D</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover> <mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>z</mi> <mo 
class="MathClass-punc">:</mo> <mo 
class="MathClass-bin">&#x2212;</mo><mover accent="false" 
class="mml-overline"><mrow><mi 
>z</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>D</mi></mrow></mfenced></math>.
</p><!--l. 469--><p class="indent">For entire function <!--l. 469--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
of exponential type introduce its Borel transform
<!--l. 470--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><mi 
>f</mi> </mrow> </msub 
> <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x2211;</mo>
  </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">=</mo><mn>0</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></munderover 
><msup><mrow 
><mi 
>f</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><msup><mrow 
><mi 
>z</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>n</mi><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
></math>. Let
<!--l. 470--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math> be a

compact subset of the open right half-plane with positive logarithmic capacity
<!--l. 471--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B3;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math> and
<!--l. 471--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>K</mi> <mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>z</mi> <mo 
class="MathClass-punc">:</mo> <mo 
class="MathClass-bin">&#x2212;</mo><mi 
>z</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>K</mi></mrow></mfenced></math>. For
<!--l. 471--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mn>1</mn> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>p</mi> <mo 
class="MathClass-rel">&#x2264;</mo><mi 
>&#x221E;</mi></math> we denote by
<!--l. 471--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mi 
>L</mi></mrow><mrow 
><mi 
>K</mi> </mrow> <mrow 
>  <mi 
>p</mi></mrow></msubsup 
></math> the class of
functions <!--l. 471--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
admitting the extension up to entire function of exponential type with
<!--l. 472--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><mi 
>f</mi> </mrow> </msub 
> </math> holomorphic on
the complement of <!--l. 472--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>K</mi></math>.
</p><!--l. 474--><p class="indent">For <!--l. 474--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math> and
any matrix <!--l. 474--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
consider
</p>
<div class="math-display"><!--l. 475--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
           <msubsup><mrow 
><mi 
>E</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>p</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>f</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> inf</mo> </mrow><mrow 
><msubsup><mrow 
>
<mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></munder 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>f</mi> <mo 
class="MathClass-bin">&#x2212;</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
></mrow></mfenced> </mrow><mrow 
><msup><mrow 
>
<mi 
>L</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 477--><p class="nopar"><span 
class="cmbx-12">Theorem 5.1 (FM) </span><span 
class="cmti-12">For each matrix</span>
<!--l. 478--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi> </mrow> <mrow 
>  <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced></mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mn>1</mn> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>p</mi> <mo 
class="MathClass-rel">&#x2264;</mo><mi 
>&#x221E;</mi></math><span 
class="cmti-12">, there is</span>
<span 
class="cmti-12">a function </span><!--l. 478--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msubsup><mrow 
><mi 
>L</mi></mrow><mrow 
><mi 
>K</mi></mrow><mrow 
><mi 
>p</mi></mrow></msubsup 
></math>
<span 
class="cmti-12">satisfying</span>
</p>
<div class="math-display"><!--l. 479--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                    <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msubsup><mrow 
><mi 
>E</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>p</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>f</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo><mfrac><mrow 
><mi 
>&#x03B3;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow> 
<mrow 
><mi 
>d</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfrac><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>

<!--l. 482--><p class="nopar"><span 
class="cmti-12">where </span><!--l. 483--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>d</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo><mo class="qopname"> inf</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><mn>2</mn><mi 
>M</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>K</mi> <mo 
class="MathClass-rel">&#x2282;</mo><mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>z</mi> <mo 
class="MathClass-punc">:</mo> <mfenced separators="" 
open="|"  close="|" ><mrow><mi 
>z</mi></mrow></mfenced> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>M</mi></mrow></mfenced></mrow></mfenced></math>.
</p><!--l. 485--><p class="indent"><span 
class="cmbx-12">Proof. </span>There exists a matrix of numbers
<!--l. 485--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
></mrow></mfenced></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>K</mi></math> such that the matrix
of exponents <!--l. 485--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
><mi 
>x</mi></mrow></msup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math> is
<!--l. 485--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mfrac><mrow 
><mi 
>&#x03B3;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow>
<mrow 
><mi 
>d</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfrac></math>-lower bounded in
<!--l. 485--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mi 
>p</mi> </mrow> </msup 
> <mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>. To prove this, we introduce
Fekete&#x2019;s <!--l. 486--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi></math>-th trans&#xFB01;nite
diameter and Chebyshev <!--l. 486--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi></math>-th
constant of <!--l. 486--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math> ([L],
p. 606) that are <!--l. 486--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03C4;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> max</mo> </mrow><mrow 
><msub><mrow 
><mi 
>z</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>K</mi></mrow></munder 
><munder class="msub"><mrow 
><mo 
class="MathClass-op"> &#x220F;</mo>
  </mrow><mrow 
><mi 
>j</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>k</mi></mrow></munder 
><msup><mrow 
><mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>j</mi></mrow></msub 
></mrow></mfenced></mrow><mrow 
><mn>1</mn><mi 
><mfenced separators="" 
open="/"  close="" ><mrow></mrow></mfenced></mi><mi 
>n</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msup 
></math>
and <!--l. 486--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>c</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> min</mo> </mrow><mrow 
><msub><mrow 
><mi 
>z</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-rel">&#x2208;</mo><mi mathvariant="double-struck">&#x2102;</mi></mrow></munder 
><munder class="msub"><mrow 
><mo 
class="MathClass-op"> max</mo> </mrow><mrow 
><mi 
>z</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>K</mi></mrow></munder 
><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x220F;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><msup><mrow 
><mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>z</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>z</mi></mrow></mfenced></mrow><mrow 
><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>n</mi></mrow></msup 
></math>
respectively. The theorem of Fekete &#x2013; Szego states that both
<!--l. 486--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03C4;</mi></mrow><mrow 
><mi 
>n</mi> </mrow> </msub 
> </math> and
<!--l. 486--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>c</mi></mrow><mrow 
><mi 
>n</mi> </mrow> </msub 
> </math> tend
to <!--l. 486--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>&#x03B3;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math> as
<!--l. 486--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></math>.
</p><!--l. 488--><p class="indent">We take <!--l. 488--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
></mrow></mfenced> </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math>
in such a way that </p><table class="equation"><tr><td> <a 
 id="x1-6003r7"></a>
<!--l. 489--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" class="equation">
                <munder class="msub"><mrow 
><mo mathsize="big" 
>&#x220F;</mo>
  </mrow><mrow 
><mi 
>j</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>k</mi></mrow></munder 
><msup><mrow 
><mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>j</mi><mi 
>n</mi></mrow></msub 
></mrow></mfenced></mrow><mrow 
><mn>1</mn><mi 
><mfenced separators="" 
open="/"  close="" ><mrow></mrow></mfenced></mi><mi 
>n</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msup 
> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>&#x03C4;</mi></mrow><mrow 
>
<mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>n</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo> <mn>2</mn><mo 
class="MathClass-punc">,</mo><mo>&#x2026;</mo><mo 
class="MathClass-punc">.</mo>
</math></td><td class="eq-no">(7)</td></tr></table>
<!--l. 495--><p class="indent">Consider the &#xFB01;nite system of exponents </p><table class="equation"><tr><td> <a 
 id="x1-6004r8"></a>
<!--l. 496--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" class="equation">
                            <mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mn>1</mn><mi 
>n</mi></mrow></msub 
><mi 
>x</mi></mrow></msup 
><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo><mo 
class="MathClass-punc">,</mo><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>n</mi><mi 
>n</mi></mrow></msub 
><mi 
>x</mi></mrow></msup 
></mrow></mfenced>
</math></td><td class="eq-no">(8)</td></tr></table>

<!--l. 500--><p class="indent">and Blashke product <!--l. 500--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x03BB;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x220F;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
> <mfrac><mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
></mrow>
<mrow 
><mi 
>&#x03BB;</mi><mo 
class="MathClass-bin">+</mo><mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac></math>
for <!--l. 500--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
></mrow></mfenced> </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></msubsup 
></math>.
The biorthogonal system generated by (<a 
href="#x1-6004r8">8<!--tex4ht:ref: eq8 --></a>) is the system of functions [M2] </p><table class="equation"><tr><td>
<a 
 id="x1-6005r9"></a>
<!--l. 502--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" class="equation">
 <msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo>      <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><mover accent="false" 
class="mml-overline"><mrow><msubsup><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
>
<mi 
>k</mi><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
> &#x2211;</mo>
  </mrow><mrow 
><mi 
>m</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
>           <mfrac><mrow 
><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>m</mi><mi 
>n</mi></mrow></msub 
><mi 
>x</mi></mrow></msup 
></mrow>
<mrow 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></munderover 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>m</mi><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>m</mi><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfrac><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>k</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo><mo>&#x2026;</mo><mo 
class="MathClass-punc">,</mo><mi 
>n</mi><mo 
class="MathClass-punc">;</mo> <mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>x</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn><mo 
class="MathClass-punc">,</mo>
</math></td><td class="eq-no">(9)</td></tr></table>
<!--l. 507--><p class="indent">that is, <!--l. 507--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x222B;
 <!--nolimits--></mo></mrow><mrow 
><mi 
>o</mi></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></munderover 
><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>p</mi><mi 
>n</mi></mrow></msub 
><mi 
>x</mi></mrow></msup 
><mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
>
<mi 
>q</mi><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
accent="true">&#x00AF;</mo></mover><mi 
>d</mi><mi 
>x</mi> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>&#x03B4;</mi></mrow><mrow 
><mi 
>p</mi><mi 
>q</mi></mrow></msub 
></math>
(<!--l. 507--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msub><mrow 
><mi 
>&#x03B4;</mi></mrow><mrow 
><mi 
>p</mi><mi 
>q</mi></mrow></msub 
></math> is Kronecker&#x2019;s
delta) and the linear spans of (<a 
href="#x1-6004r8">8<!--tex4ht:ref: eq8 --></a>) and (<a 
href="#x1-6005r9">9<!--tex4ht:ref: eq9 --></a>) coincide. According to lemma 1.1, we just
need <!--l. 509--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mfrac><mrow 
><mi 
>d</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow>
<mrow 
><mi 
>&#x03B3;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfrac></math>-upper
boundedness of <!--l. 509--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math>
in all spaces <!--l. 510--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mn>1</mn> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>p</mi> <mo 
class="MathClass-rel">&#x2264;</mo><mi 
>&#x221E;</mi></math>.
</p><!--l. 512--><p class="indent">The function <!--l. 512--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
can be written in the integral form </p><table class="equation"><tr><td> <a 
 id="x1-6006r10"></a>
<!--l. 513--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" class="equation">
            <msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo>      <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><mover accent="false" 
class="mml-overline"><mrow><msubsup><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
>
<mi 
>k</mi><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac>  <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><mn>2</mn><mi 
>&#x03C0;</mi><mi 
>i</mi></mrow></mfrac><munder class="msub"><mrow 
><mo 
class="MathClass-op">&#x222B;
 <!--nolimits--></mo></mrow><mrow 
><msub><mrow 
><mi 
>&#x0393;</mi></mrow><mrow 
><mi 
>r</mi><mo 
class="MathClass-punc">,</mo><mi 
>R</mi></mrow></msub 
></mrow></munder 
>       <mfrac><mrow 
><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x03B6;</mi><mi 
>x</mi></mrow></msup 
><mi 
>d</mi><mi 
>&#x03B6;</mi></mrow> 
<mrow 
><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x03B6;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x03B6;</mi> <mo 
class="MathClass-bin">+</mo> <mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfrac><mo 
class="MathClass-punc">,</mo>
</math></td><td class="eq-no">(10)</td></tr></table>
<!--l. 520--><p class="indent">where <!--l. 520--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x0393;</mi></mrow><mrow 
><mi 
>r</mi><mo 
class="MathClass-punc">,</mo><mi 
>R</mi></mrow></msub 
></math> is the contour
consisting of the segment <!--l. 520--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mfenced separators="" 
open="["  close="]" ><mrow><mi 
>r</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>i</mi><mi 
>R</mi><mo 
class="MathClass-punc">,</mo><mi 
>r</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>i</mi><mi 
>R</mi></mrow></mfenced></math>
and semicircle <!--l. 520--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B6;</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>r</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>R</mi><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>i</mi><mi 
>&#x03D5;</mi></mrow></msup 
><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/> <mo 
class="MathClass-bin">&#x2212;</mo><mfrac><mrow 
><mi 
>&#x03C0;</mi></mrow> 
<mrow 
><mn>2</mn></mrow></mfrac>  <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>&#x03D5;</mi> <mo 
class="MathClass-rel">&#x2264;</mo><mfrac><mrow 
><mi 
>&#x03C0;</mi></mrow> 
<mrow 
><mn>2</mn></mrow></mfrac> </math>
running in positive direction. Besides, interior of
<!--l. 520--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x0393;</mi></mrow><mrow 
><mi 
>r</mi><mo 
class="MathClass-punc">,</mo><mi 
>R</mi></mrow></msub 
></math> contains the
compact set <!--l. 521--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math>. For
any positive number <!--l. 521--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x025B;</mi></math>

one can &#xFB01;x <!--l. 521--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>r</mi></math>
such small and <!--l. 521--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>R</mi></math>
such large that <!--l. 521--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mfenced separators="" 
open="|"  close="|" ><mrow> <mfrac><mrow 
><mi 
>&#x03B6;</mi><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x03BB;</mi></mrow>
<mrow 
><mi 
>&#x03B6;</mi><mo 
class="MathClass-bin">+</mo><mover accent="false" 
class="mml-overline"><mrow><mi 
>&#x03BB;</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac></mrow></mfenced> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>1</mn> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>&#x025B;</mi></math>
when <!--l. 521--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x03B6;</mi><mo 
class="MathClass-punc">,</mo><mi 
>&#x03BB;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2208;</mo> <msub><mrow 
><mi 
>&#x0393;</mi></mrow><mrow 
><mi 
>r</mi><mo 
class="MathClass-punc">,</mo><mi 
>R</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x00D7;</mo> <mi 
>K</mi></math>.
Consequently, (<a 
href="#x1-6006r10">10<!--tex4ht:ref: eq10 --></a>) implies
</p>
<div class="math-display"><!--l. 522--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
><msub><mrow 
>
       <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced></mrow><mrow 
><msup><mrow 
>
<mi 
>L</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo>   <mfrac><mrow 
><mi 
>C</mi></mrow> 
<mrow 
><mfenced separators="" 
open="|"  close="|" ><mrow><msubsup><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfenced></mrow></mfrac>    <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><msup><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mn>1</mn> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>&#x025B;</mi></mrow></mfenced></mrow><mrow 
><mi 
>n</mi></mrow></msup 
></mrow></mfrac><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>k</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo> <mn>2</mn><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo><mo 
class="MathClass-punc">,</mo><mi 
>n</mi><mo 
class="MathClass-punc">;</mo> <mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>n</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo> <mn>2</mn><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 526--><p class="nopar">where the constant <!--l. 527--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>C</mi></math>
does not depend on <!--l. 527--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>k</mi></math>
and <!--l. 527--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi></math>.
As <!--l. 527--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x025B;</mi></math>
was arbitrary, the last estimate leads to
</p>
<div class="math-display"><!--l. 529--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
<munder class="msub"><mrow 
><mo 
class="MathClass-op">limsup</mo></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">max</mo></mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>m</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>m</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced></mrow><mrow 
><msup><mrow 
>
<mi 
>L</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2264;</mo>          <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">lim inf</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">min</mo> </mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>m</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
> <mfenced separators="" 
open="|"  close="|" ><mrow><msubsup><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>m</mi><mi 
>n</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfenced> </mrow><mrow 
><mi 
>n</mi></mrow></mroot></mrow></mfrac> <mo 
class="MathClass-rel">&#x2264;</mo>
</mrow></math></div>
<!--l. 531--><p class="nopar">
</p>

<div class="math-display"><!--l. 532--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
       <mo 
class="MathClass-rel">&#x2264;</mo>            <mfrac><mrow 
><mi 
>d</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow> 
<mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">lim inf</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">min</mo> </mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>m</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
> &#x220F;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn><mo 
class="MathClass-punc">,</mo><mi 
>k</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>m</mi></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>m</mi><mi 
>n</mi></mrow></msub 
></mrow></mfenced></mrow><mrow 
><mi 
>n</mi></mrow></mroot></mrow></mfrac> <mo 
class="MathClass-rel">&#x2264;</mo> <mfrac><mrow 
><mi 
>d</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow> 
<mrow 
><mi 
>&#x03B3;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfrac><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 534--><p class="nopar">Indeed, according to (<a 
href="#x1-6003r7">7<!--tex4ht:ref: eq7 --></a>) we get
<!--tex4ht:inline--></p><!--l. 536--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
  <mroot><mrow 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x220F;</mo>
   </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn><mo 
class="MathClass-punc">,</mo><mi 
>k</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>m</mi></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
>
<mi 
>k</mi><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>m</mi><mi 
>n</mi></mrow></msub 
></mrow></mfenced></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">=</mo> <mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op"> max</mo> </mrow><mrow 
><mi 
>z</mi><mo 
class="MathClass-rel">&#x2208;</mo><mi 
>K</mi></mrow></munder 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
> &#x220F;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn><mo 
class="MathClass-punc">,</mo><mi 
>k</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>m</mi></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
>
<mi 
>k</mi><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>z</mi></mrow></mfenced></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo> <msubsup><mrow 
><mi 
>c</mi></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow><mrow 
><mn>1</mn><mo 
class="MathClass-bin">&#x2212;</mo><mfrac><mrow 
><mn>1</mn></mrow>
<mrow 
><mi 
>n</mi></mrow></mfrac> </mrow></msubsup 
>
</math>
<!--l. 541--><p class="nopar">for all <!--l. 542--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>m</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo> <mn>2</mn><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></math>,
therefore
<!--tex4ht:inline--></p><!--l. 543--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
<munder class="msub"><mrow 
><mo 
class="MathClass-op">liminf</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">min</mo></mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>m</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x220F;</mo>
   </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn><mo 
class="MathClass-punc">,</mo><mi 
>k</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>m</mi></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
>
<mi 
>k</mi><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>m</mi><mi 
>n</mi></mrow></msub 
></mrow></mfenced></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op">lim</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><msubsup><mrow 
><mi 
>c</mi></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow><mrow 
><mn>1</mn><mo 
class="MathClass-bin">&#x2212;</mo><mfrac><mrow 
><mn>1</mn></mrow>
<mrow 
><mi 
>n</mi></mrow></mfrac> </mrow></msubsup 
> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x03B3;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 549--><p class="nopar">
</p><!--l. 552--><p class="indent">Now let&#x2019;s prove <!--l. 552--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2111;</mi></mrow><mrow 
><msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
><mi 
>x</mi></mrow></msup 
></mrow></mfenced> <mo 
class="MathClass-rel">&#x2282;</mo> <msubsup><mrow 
><mi 
>L</mi></mrow><mrow 
>
<mi 
>K</mi></mrow><mrow 
><mi 
>p</mi></mrow></msubsup 
></math>.

</p><!--l. 554--><p class="indent">For <!--l. 554--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo><msub><mrow 
><mi 
>&#x2111;</mi></mrow><mrow 
><msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
><mi 
>x</mi></mrow></msup 
></mrow></mfenced></math> consider the
exponential polynomials <!--l. 555--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>f</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x2211;</mo>
  </mrow><mrow 
><mi 
>j</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op">&#x2211;</mo></mrow><mrow 
>
<mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>j</mi></mrow></munderover 
><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>i</mi><mi 
>j</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>i</mi><mi 
>j</mi></mrow></msub 
><mi 
>z</mi></mrow></msup 
><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2102;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
such that
<!--tex4ht:inline--></p><!--l. 559--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
      <munder class="msub"><mrow 
><mo 
class="MathClass-op">sup</mo> </mrow><mrow 
><mi 
>n</mi></mrow></munder 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
> &#x2211;</mo>
  </mrow><mrow 
><mi 
>j</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>j</mi></mrow></munderover 
><mfenced separators="" 
open="|"  close="|" ><mrow><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>i</mi><mi 
>j</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></munderover 
></mrow></mfenced> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>&#x221E;</mi><mspace width="2em" class="qquad"/><!--mstyle 
class="text"--><mtext >&#x00A0;and&#x00A0;</mtext><!--/mstyle--><mspace width="2em" class="qquad"/><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msub><mrow 
><mi 
>f</mi></mrow><mrow 
>
<mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>f</mi></mrow></mfenced></mrow><mrow 
><msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
><munder class="msub"><mrow 
><mo> &#x2192;</mo></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mn>0</mn><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 565--><p class="nopar">The chosen sequence of polynomials is a normal family of
entire functions because of its uniformly boundedness inside of
<!--l. 567--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi mathvariant="double-struck">&#x2102;</mi></math>.
Similarly, the sequence of Borel transforms
</p>
<div class="math-display"><!--l. 569--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                    <msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><msub><mrow 
><mi 
>f</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>z</mi></mrow></mfenced> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
> &#x2211;</mo>
  </mrow><mrow 
><mi 
>j</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>j</mi></mrow></munderover 
>  <mfrac><mrow 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
><mi 
>i</mi><mi 
>j</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></munderover 
></mrow>
<mrow 
><mi 
>z</mi> <mo 
class="MathClass-bin">+</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>i</mi><mi 
>j</mi></mrow></msub 
></mrow></mfrac>
</mrow></math></div>
<!--l. 572--><p class="nopar">is a normal family on the complement of
<!--l. 573--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>K</mi></math>. So
<!--l. 573--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>f</mi></mrow><mrow 
><mi 
>n</mi> </mrow> </msub 
> <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><munder class="msub"><mrow 
><mo 
class="MathClass-op"> &#x2192;</mo></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mover 
accent="false"><mrow 
><mi 
>f</mi></mrow><mo 
class="MathClass-op">&#x02DC;</mo></mover><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
uniformly on each compact subset of the complex plane and
<!--l. 573--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><msub><mrow 
><mi 
>f</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>z</mi></mrow></mfenced><munder class="msub"><mrow 
><mo 
class="MathClass-op">&#x2192;</mo></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mi 
>&#x03B2;</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>z</mi></mrow></mfenced></math>
uniformly on each compact subset of the complement of
<!--l. 573--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>K</mi></math>.
</p><!--l. 575--><p class="indent">As entire function <!--l. 575--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="false"><mrow 
><mi 
>f</mi></mrow><mo 
class="MathClass-op">&#x02DC;</mo></mover></math> is
of exponential type and <!--l. 575--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="false"><mrow 
><mi 
>f</mi></mrow><mo 
class="MathClass-op">&#x02DC;</mo></mover> <mo 
class="MathClass-rel">=</mo> <mi 
>f</mi></math>
almost everywhere on <!--l. 575--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,

it remains to prove <!--l. 576--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><mover 
accent="false"><mrow 
><mi 
>f</mi></mrow><mo 
class="MathClass-op">&#x02DC;</mo></mover></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x03B2;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>z</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi mathvariant="double-struck">&#x2102;</mi><mo 
class="MathClass-bin">&#x2216;</mo><mfenced separators="" 
open="("  close=")" ><mrow><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>K</mi></mrow></mfenced></math>.
Indeed, if <!--l. 576--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>R</mi><mi 
>e</mi><mi 
>z</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>&#x03B4;</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn></math>
then
</p>
<div class="math-display"><!--l. 577--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
              <msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><msub><mrow 
><mi 
>f</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><mover 
accent="false"><mrow 
><mi 
>f</mi></mrow><mo 
class="MathClass-op">&#x02DC;</mo></mover></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x222B;
 <!--nolimits--></mo></mrow><mrow 
><mn>0</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></munderover 
><mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>f</mi></mrow><mrow 
>
<mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfenced> <msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>z</mi><mi 
>t</mi></mrow></msup 
><mi 
>d</mi><mi 
>t</mi><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 579--><p class="nopar">Therefore
</p>
<div class="math-display"><!--l. 581--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
            <mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><msub><mrow 
><mi 
>f</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><mover 
accent="false"><mrow 
><mi 
>f</mi></mrow><mo 
class="MathClass-op">&#x02DC;</mo></mover></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mi 
>O</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msub><mrow 
><mi 
>f</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>f</mi></mrow></mfenced></mrow><mrow 
><msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 583--><p class="nopar">Thus <!--l. 584--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><mover 
accent="false"><mrow 
><mi 
>f</mi></mrow><mo 
class="MathClass-op">&#x02DC;</mo></mover></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x03B2;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
(<!--l. 584--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>R</mi><mi 
>e</mi><mi 
>z</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn></math>). Consequently,
<!--l. 584--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03B2;</mi></mrow><mrow 
><mover 
accent="false"><mrow 
><mi 
>f</mi></mrow><mo 
class="MathClass-op">&#x02DC;</mo></mover></mrow></msub 
></math> and
<!--l. 584--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B2;</mi></math> coincide on the
complement of <!--l. 584--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>K</mi></math>.
Now theorem 5.1 follows from the corollary of basic lemma.
</p><!--l. 586--><p class="indent"><span 
class="cmbx-12">Remark. </span>It is known [J] that the sequence
<!--l. 586--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi> </mrow> </msub 
>   </mrow></mfenced> </mrow><mrow 
><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>R</mi><mi 
>e</mi><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn></math>
of disjoint numbers satis&#xFB01;es Carleson&#x2019;s separability condition [C] </p><table class="equation"><tr><td>
<a 
 id="x1-6007r11"></a>

<!--l. 588--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" class="equation">
            <munder class="msub"><mrow 
><mo 
class="MathClass-op">inf</mo> </mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>j</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
> &#x220F;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn><mo 
class="MathClass-punc">,</mo><mi 
>k</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>j</mi></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><mfenced separators="" 
open="|"  close="|" ><mrow><mfrac><mrow 
><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>j</mi></mrow></msub 
></mrow>
<mrow 
><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>j</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac></mrow></mfenced> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>&#x03B4;</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>n</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo> <mn>2</mn><mo 
class="MathClass-punc">,</mo><mo>&#x2026;</mo>
</math></td><td class="eq-no">(11)</td></tr></table>
<!--l. 593--><p class="indent">if and only if the system <!--l. 593--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mi 
>x</mi></mrow></msup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math>
is basis in its closed linear span in the space
<!--l. 594--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mn>2</mn> </mrow> </msup 
> <mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>. If (<a 
href="#x1-6002r6">6<!--tex4ht:ref: eq6 --></a>)
holds then <!--l. 594--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mi 
>x</mi></mrow></msup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math>
isn&#x2019;t minimal, so (<a 
href="#x1-6007r11">11<!--tex4ht:ref: eq11 --></a>) doesn&#x2019;t hold. However, a bounded sequence of powers
can be taken <span 
class="cmti-12">geometrically separable, </span>i.e. </p><table class="equation"><tr><td> <a 
 id="x1-6008r12"></a>
<!--l. 596--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" class="equation">
           <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim inf</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">inf</mo> </mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>j</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
> &#x220F;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn><mo 
class="MathClass-punc">,</mo><mi 
>k</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>j</mi></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><mfenced separators="" 
open="|"  close="|" ><mrow><mfrac><mrow 
><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>j</mi></mrow></msub 
></mrow>
<mrow 
><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>j</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac></mrow></mfenced></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>&#x03B4;</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo>
</math></td><td class="eq-no">(12)</td></tr></table>
<!--l. 601--><p class="indent">Moreover,
</p><!--l. 603--><p class="indent"><span 
class="cmbx-12">Lemma 5.1 </span><span 
class="cmti-12">Let the sequence </span><!--l. 608--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced> </mrow><mrow 
><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math>
<span 
class="cmti-12">satis&#xFB01;es the condition </span>(<a 
href="#x1-6002r6">6<!--tex4ht:ref: eq6 --></a>)<span 
class="cmti-12">. Then </span>(<a 
href="#x1-6008r12">12<!--tex4ht:ref: eq12 --></a>) <span 
class="cmti-12">takes place if and only if the system</span>
<!--l. 608--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mi 
>x</mi></mrow></msup 
></mrow></mfenced></mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math> <span 
class="cmti-12">is</span>
<!--l. 608--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B4;</mi></math><span 
class="cmti-12">-lower</span>
<span 
class="cmti-12">bounded in </span><!--l. 608--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>.
</p><!--l. 610--><p class="indent"><span 
class="cmbx-12">Proof. </span>Suppose

<!--tex4ht:inline--></p><!--l. 612--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
                        <msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x03BB;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
> &#x220F;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><mfrac><mrow 
><mi 
>&#x03BB;</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow>
<mrow 
><mi 
>&#x03BB;</mi> <mo 
class="MathClass-bin">+</mo> <mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac>
</math>
<!--l. 615--><p class="nopar">and
<!--tex4ht:inline--></p><!--l. 617--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
            <msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo>     <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><mover accent="false" 
class="mml-overline"><mrow><msubsup><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
> &#x2211;</mo>
  </mrow><mrow 
><mi 
>m</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
>          <mfrac><mrow 
><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>m</mi></mrow></msub 
><mi 
>x</mi></mrow></msup 
></mrow>
<mrow 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></munderover 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>m</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>m</mi></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfrac><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 621--><p class="nopar">The inequality
</p>
<div class="math-display"><!--l. 623--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
<munder class="msub"><mrow 
><mo 
class="MathClass-op">limsup</mo></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">max</mo></mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>j</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>j</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced></mrow><mrow 
><msup><mrow 
>
<mi 
>L</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2264;</mo>         <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">lim inf</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">min</mo> </mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>j</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
> <mfenced separators="" 
open="|"  close="|" ><mrow><msubsup><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>j</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfenced> </mrow><mrow 
><mi 
>n</mi></mrow></mroot></mrow></mfrac> <mo 
class="MathClass-rel">=</mo>
</mrow></math></div>
<!--l. 626--><p class="nopar"></p><table class="equation"><tr><td><a 
 id="x1-6009r13"></a>

<!--l. 627--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" class="equation">
             <mo 
class="MathClass-rel">=</mo><msup><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><munder class="msub"><mrow 
><mo 
class="MathClass-op">lim inf</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">inf</mo> </mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>j</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
> &#x220F;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn><mo 
class="MathClass-punc">,</mo><mi 
>k</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>j</mi></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><mfenced separators="" 
open="|"  close="|" ><mrow><mfrac><mrow 
><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>j</mi></mrow></msub 
></mrow>
<mrow 
><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>j</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac></mrow></mfenced></mrow><mrow 
><mi 
>n</mi></mrow></mroot></mrow></mfenced></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
>
</math></td><td class="eq-no">(13)</td></tr></table>
<!--l. 632--><p class="indent">holds for all <!--l. 632--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mn>1</mn> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>p</mi> <mo 
class="MathClass-rel">&#x2264;</mo><mi 
>&#x221E;</mi></math>.
Taking into account lemma 1.1, (<a 
href="#x1-6009r13">13<!--tex4ht:ref: eq13 --></a>) completes the proof of necessity.
</p><!--l. 635--><p class="indent">To prove sufficiency we use Fourier transforms of functions
<!--l. 635--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi> </mrow> <mrow 
>  <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
</p>
<div class="math-display"><!--l. 636--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
<mover 
accent="false"><mrow 
><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow><mo 
class="MathClass-op"> &#x0302;</mo></mover><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x03C4;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo>     <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><mover accent="false" 
class="mml-overline"><mrow><msubsup><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac>  <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><mn>2</mn><mi 
>&#x03C0;</mi><mi 
>i</mi></mrow></mfrac><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op">&#x222B;
 <!--nolimits--></mo></mrow><mrow 
><mn>0</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></munderover 
><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>i</mi><mi 
>&#x03C4;</mi><mi 
>x</mi></mrow></msup 
><munder class="msub"><mrow 
><mo 
class="MathClass-op"> &#x222B;
 <!--nolimits--></mo></mrow><mrow 
><mi 
>&#x0393;</mi></mrow></munder 
>       <mfrac><mrow 
><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x03B6;</mi><mi 
>x</mi></mrow></msup 
><mi 
>d</mi><mi 
>&#x03B6;</mi></mrow> 
<mrow 
><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x03B6;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x03B6;</mi> <mo 
class="MathClass-bin">+</mo> <mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfrac><mi 
>d</mi><mi 
>x</mi><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>&#x03C4;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mrow><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x221E;</mi><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 641--><p class="nopar">where <!--l. 642--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x0393;</mi></math>
is a contour that lies in the open right half &#x2013; plane and contains all points
<!--l. 643--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi> </mrow> </msub 
> <mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>k</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo> <mn>2</mn><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo></math>
inside. Applying Fubini&#x2019;s and residue theorems, one can obtain
</p>
<div class="math-display"><!--l. 645--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                <mover 
accent="false"><mrow 
><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow><mo 
class="MathClass-op"> &#x0302;</mo></mover><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x03C4;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo>     <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><mover accent="false" 
class="mml-overline"><mrow><msubsup><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac>           <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><msub><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>i</mi><mi 
>&#x03C4;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>i</mi><mi 
>&#x03C4;</mi> <mo 
class="MathClass-bin">&#x2212;</mo><mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfrac><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 649--><p class="nopar">Hence

<!--tex4ht:inline--></p><!--l. 651--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
<mtable 
class="multline-star">
<mtr><mtd 
class="multline-star"><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced></mrow><mrow 
><msup><mrow 
>
<mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <msqrt><mrow><mn>2</mn><mi 
>&#x03C0;</mi></mrow></msqrt><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mover 
accent="false"><mrow 
><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow><mo 
class="MathClass-op"> &#x0302;</mo></mover></mrow></mfenced></mrow><mrow 
><msup><mrow 
>
<mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x221E;</mi><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
>
</mtd></mtr><mtr><mtd 
class="multline-star"> <mo 
class="MathClass-rel">=</mo>    <mfrac><mrow 
><msqrt><mrow><mn>2</mn><mi 
>&#x03C0;</mi></mrow></msqrt></mrow> 
<mrow 
><mfenced separators="" 
open="|"  close="|" ><mrow><msubsup><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfenced></mrow></mfrac><msup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op">&#x222B;
 <!--nolimits--></mo></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x221E;</mi></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></munderover 
>   <mfrac><mrow 
><mi 
>d</mi><mi 
>&#x03C4;</mi></mrow>
<mrow 
><msup><mrow 
><mfenced separators="" 
open="|"  close="|" ><mrow><mi 
>i</mi><mi 
>&#x03C4;</mi> <mo 
class="MathClass-bin">+</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced> </mrow><mrow 
><mn>2</mn></mrow></msup 
></mrow></mfrac></mrow></mfenced> </mrow><mrow 
><mn>1</mn><mi 
><mfenced separators="" 
open="/"  close="" ><mrow></mrow></mfenced></mi><mn>2</mn></mrow></msup 
> <mo 
class="MathClass-rel">=</mo>        <mfrac><mrow 
><mi 
>&#x03C0;</mi><msqrt><mrow><mn>2</mn></mrow></msqrt></mrow> 
<mrow 
><mfenced separators="" 
open="|"  close="|" ><mrow><msubsup><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfenced> <msqrt><mrow><mi 
>R</mi><mi 
>e</mi> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></msqrt></mrow></mfrac><mo 
class="MathClass-punc">.</mo>                    </mtd></mtr></mtable>
</math>
<!--l. 663--><p class="nopar">
On the other hand, since <!--l. 664--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></math>
was generated by <!--l. 664--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mi 
>x</mi></mrow></msup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></msubsup 
></math>,
it is <!--l. 664--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mn>1</mn><mi 
><mfenced separators="" 
open="/"  close="" ><mrow></mrow></mfenced></mi><mi 
>&#x03B4;</mi></math>-upper bounded
in the space <!--l. 666--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
[F]. Therefore
<!--tex4ht:inline--></p><!--l. 668--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" >
                  <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim inf</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">min</mo> </mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>j</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
> <mfenced separators="" 
open="|"  close="|" ><mrow><msubsup><mrow 
><mi 
>B</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mi 
>&#x2032;</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
>
<mi 
>j</mi></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfenced> </mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>&#x03B4;</mi><mo 
class="MathClass-punc">.</mo>
</math>
<!--l. 672--><p class="nopar">The lemma is proved.
</p><!--l. 675--><p class="indent">Combining (<a 
href="#x1-6009r13">13<!--tex4ht:ref: eq13 --></a>), lemma 1.1 and basic lemma, we get the following BW type
theorem.
</p><!--l. 678--><p class="indent"><span 
class="cmbx-12">Theorem 5.2 (BW) </span><span 
class="cmti-12">Let the sequence of disjoint numbers</span>
<!--l. 678--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi> </mrow> </msub 
>   </mrow></mfenced> </mrow><mrow 
><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math>
<span 
class="cmti-12">satisfying (</span><a 
href="#x1-6002r6"><span 
class="cmti-12">6</span><!--tex4ht:ref: eq6 --></a><span 
class="cmti-12">) be geometrically separable. Then the class of functions</span>
<!--l. 678--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,

<!--l. 678--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mn>1</mn> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>p</mi> <mo 
class="MathClass-rel">&#x2264;</mo><mi 
>&#x221E;</mi></math><span 
class="cmti-12">,</span>
<span 
class="cmti-12">permitting the fast approximation by &#xFB01;nite linear combinations of the system</span>
<!--l. 678--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mi 
>x</mi></mrow></msup 
></mrow></mfenced></mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math><span 
class="cmti-12">,</span>
<span 
class="cmti-12">coincide with the set of series</span>
</p>
<div class="math-display"><!--l. 679--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                    <munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></munderover 
><msub><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mi 
>x</mi></mrow></msup 
><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mroot><mrow 
> <mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
></mrow></mfenced> </mrow><mrow 
><mi 
>k</mi></mrow></mroot><munder class="msub"><mrow 
><mo>&#x2192;</mo></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mn>0</mn><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 681--><p class="nopar"><span 
class="cmti-12">where the convergence is in the sense of</span>
<!--l. 682--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mi 
>p</mi> </mrow> </msup 
> <mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
<span 
class="cmti-12">topology.</span>
</p>
<h3 class="sectionHead"><span class="titlemark">6. </span> <a 
 id="x1-70006"></a>Application 4</h3>
<!--l. 687--><p class="noindent">Let <!--l. 687--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,
<!--l. 687--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mn>1</mn> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>p</mi> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>&#x221E;</mi></math>, be the Hardy space of
functions <!--l. 687--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math> analytic on
the upper half - plane <!--l. 687--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
> <mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>z</mi> <mo 
class="MathClass-punc">:</mo> <mo 
class="MathClass-op">Im</mo><!--nolimits--><mi 
>z</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn></mrow></mfenced></math>,
with the norm
</p>
<div class="math-display"><!--l. 688--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
><msub><mrow 
>
            <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>f</mi></mrow></mfenced></mrow><mrow 
><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> sup</mo> </mrow><mrow 
><mi 
>y</mi><mo 
class="MathClass-rel">&#x003E;</mo><mn>0</mn></mrow></munder 
><msup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op">&#x222B;
 <!--nolimits--></mo></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x221E;</mi></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></munderover 
><msup><mrow 
><mfenced separators="" 
open="|"  close="|" ><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>i</mi><mi 
>y</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfenced> </mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mi 
>d</mi><mi 
>x</mi></mrow></mfenced></mrow><mrow 
><mn>1</mn><mi 
><mfenced separators="" 
open="/"  close="" ><mrow></mrow></mfenced></mi><mi 
>p</mi></mrow></msup 
> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>&#x221E;</mi><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>

<!--l. 692--><p class="nopar">For <!--l. 693--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math> and
any matrix <!--l. 693--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
consider the approximation error
</p>
<div class="math-display"><!--l. 695--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
         <msubsup><mrow 
><mi 
>E</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>p</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>f</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> inf</mo> </mrow><mrow 
><msubsup><mrow 
>
<mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></munder 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>f</mi> <mo 
class="MathClass-bin">&#x2212;</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
></mrow></mfenced> </mrow><mrow 
><msup><mrow 
>
<mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 697--><p class="nopar">The theorem of Paley and Wiener states: the class
<!--l. 698--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mn>2</mn> </mrow> </msup 
> <mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
coincides with the set of functions representable in the form
</p>
<div class="math-display"><!--l. 699--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                 <mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo>   <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><msqrt><mrow><mn>2</mn><mi 
>&#x03C0;</mi></mrow></msqrt></mrow></mfrac><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op">&#x222B;
 <!--nolimits--></mo></mrow><mrow 
><mn>0</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></munderover 
><mover 
accent="false"><mrow 
><mi 
>f</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>i</mi><mi 
>z</mi><mi 
>t</mi></mrow></msup 
><mi 
>d</mi><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>z</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 701--><p class="nopar">where <!--l. 702--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="false"><mrow 
><mi 
>f</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>0</mn><mo 
class="MathClass-punc">,</mo><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>. If
<!--l. 702--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="false"><mrow 
><mi 
>f</mi></mrow><mo 
class="MathClass-op"> &#x0302;</mo> </mover><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x03BB;</mi><mi 
>t</mi></mrow></msup 
><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mo 
class="MathClass-op">Re</mo><!--nolimits--><mi 
>&#x03BB;</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn></math> then the corresponding
function <!--l. 703--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
is
</p>

<div class="math-display"><!--l. 704--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                    <mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo>  <mfrac><mrow 
><mi 
>i</mi></mrow> 
<mrow 
><mn>2</mn><mi 
>&#x03C0;</mi></mrow></mfrac>   <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><mi 
>z</mi> <mo 
class="MathClass-bin">&#x2212;</mo><mover accent="false" 
class="mml-overline"><mrow><mi 
>&#x03BC;</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>&#x03BC;</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>i</mi><mover accent="false" 
class="mml-overline"><mrow><mi 
>&#x03BB;</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 706--><p class="nopar">Reasoning from this, let&#x2019;s consider the system of rational functions
</p>
<div class="math-display"><!--l. 708--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                      <msub><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo>     <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><mi 
>z</mi> <mo 
class="MathClass-bin">&#x2212;</mo><mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>k</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo> <mn>2</mn><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 710--><p class="nopar">where <!--l. 711--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></math>
are disjoint complex numbers chosen from some compact set
<!--l. 711--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></math>. Denote
<!--l. 711--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover accent="false" 
class="mml-overline"><mrow><mi 
>K</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover><mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>z</mi> <mo 
class="MathClass-punc">:</mo> <mover accent="false" 
class="mml-overline"><mrow><mi 
>z</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>K</mi></mrow></mfenced></math>.
Using Musoyan&#x2019;s theorem, one can establish
<!--l. 711--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><munder class="msub"><mrow 
><mo 
class="MathClass-op">limsup</mo></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msubsup><mrow 
><mi 
>E</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>f</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x003C;</mo> <mn>1</mn></math> for
<!--l. 711--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x2229;</mo> <mi 
>H</mi><mi 
>o</mi><mi 
>l</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi mathvariant="double-struck">&#x2102;</mi><mo 
class="MathClass-bin">&#x2216;</mo><mover accent="false" 
class="mml-overline"><mrow><mi 
>K</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,
<!--l. 711--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mn>0</mn></math>.
</p><!--l. 713--><p class="indent">Then, let <!--l. 713--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B3;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn></math>
and
</p>

<div class="math-display"><!--l. 714--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
         <msubsup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>K</mi></mrow><mrow 
><mi 
>p</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>f</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x2229;</mo> <mi 
>H</mi><mi 
>o</mi><mi 
>l</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi mathvariant="double-struck">&#x2102;</mi><mo 
class="MathClass-bin">&#x2216;</mo><mover accent="false" 
class="mml-overline"><mrow><mi 
>K</mi></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace width="0em" class="thinspace"/><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x221E;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mn>0</mn></mrow></mfenced> <mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 716--><p class="nopar">
</p><!--l. 719--><p class="indent"><span 
class="cmbx-12">Theorem 6.1 (FM) </span><span 
class="cmti-12">For each matrix</span>
<!--l. 719--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi> </mrow> <mrow 
>  <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced></mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
> <mfenced separators="" 
open="("  close=")" ><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow></mfenced></math> <span 
class="cmti-12">there is a</span>
<span 
class="cmti-12">function </span><!--l. 719--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msubsup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>K</mi></mrow><mrow 
><mi 
>p</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
<span 
class="cmti-12">satisfying</span>
</p>
<div class="math-display"><!--l. 720--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                   <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msubsup><mrow 
><mi 
>E</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>p</mi></mrow></mfenced></mrow></msubsup 
> <mfenced separators="" 
open="("  close=")" ><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow></mfenced> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>f</mi></mrow></mfenced></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo><mfrac><mrow 
><mi 
>&#x03B3;</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>K</mi></mrow></mfenced></mrow> 
<mrow 
><mi 
>d</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>K</mi></mrow></mfenced></mrow></mfrac><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 722--><p class="nopar"><span 
class="cmti-12">where </span><!--l. 723--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>d</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo><mo class="qopname"> inf</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><mn>2</mn><mi 
>M</mi> <mo 
class="MathClass-punc">:</mo> <mi 
>K</mi> <mo 
class="MathClass-rel">&#x2282;</mo><mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>z</mi> <mo 
class="MathClass-punc">:</mo> <mfenced separators="" 
open="|"  close="|" ><mrow><mi 
>z</mi></mrow></mfenced> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>M</mi></mrow></mfenced></mrow></mfenced></math>.
</p><!--l. 725--><p class="indent"><span 
class="cmbx-12">Proof</span><span 
class="cmbxti-10x-x-120">. </span>As in theorem 5.1, there exists a matrix of numbers
<!--l. 726--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
></mrow></mfenced></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>K</mi></math> such
that <!--l. 726--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow>   <mfrac><mrow 
><mn>1</mn></mrow>
<mrow 
><mi 
>z</mi><mo 
class="MathClass-bin">&#x2212;</mo><mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac></mrow></mfenced> </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math> is
<!--l. 726--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mfrac><mrow 
><mi 
>&#x03B3;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow>
<mrow 
><mi 
>d</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfrac></math>-lower
bounded in <!--l. 726--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
(see [M3] for integral representation of generated biorthogonal system and [F]). The
embedding <!--l. 727--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2111;</mi></mrow><mrow 
><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow>     <mfrac><mrow 
><mn>1</mn></mrow>
<mrow 
><mi 
>z</mi><mo 
class="MathClass-bin">&#x2212;</mo><mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac></mrow></mfenced> <mo 
class="MathClass-rel">&#x2282;</mo> <msubsup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>K</mi></mrow><mrow 
><mi 
>p</mi></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
holds as well. To complete the proof it remains to apply the corollary of basic
lemma.
</p><!--l. 730--><p class="indent">Now consider the Hardy space <!--l. 730--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>,

<!--l. 730--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mn>1</mn> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>p</mi> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>&#x221E;</mi></math>, of analytic functions
on the unit disk <!--l. 730--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>D</mi> <mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>z</mi> <mo 
class="MathClass-punc">:</mo> <mfenced separators="" 
open="|"  close="|" ><mrow><mi 
>z</mi></mrow></mfenced> <mo 
class="MathClass-rel">&#x003C;</mo> <mn>1</mn></mrow></mfenced></math>,
with the norm
</p>
<div class="math-display"><!--l. 731--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
><msub><mrow 
>
           <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>f</mi></mrow></mfenced></mrow><mrow 
><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> sup</mo> </mrow><mrow 
><mn>0</mn><mo 
class="MathClass-rel">&#x003C;</mo><mi 
>r</mi><mo 
class="MathClass-rel">&#x003C;</mo><mn>1</mn></mrow></munder 
><msup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow>  <mfrac><mrow 
><mn>1</mn></mrow>
<mrow 
><mn>2</mn><mi 
>&#x03C0;</mi></mrow></mfrac><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op">&#x222B;
 <!--nolimits--></mo></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x03C0;</mi></mrow><mrow 
><mi 
>&#x03C0;</mi></mrow></munderover 
><msup><mrow 
><mfenced separators="" 
open="|"  close="|" ><mrow><mi 
>f</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>r</mi><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>i</mi><mi 
>&#x03B8;</mi></mrow></msup 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></mfenced> </mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mi 
>d</mi><mi 
>&#x03B8;</mi></mrow></mfenced></mrow><mrow 
><mn>1</mn><mi 
><mfenced separators="" 
open="/"  close="" ><mrow></mrow></mfenced></mi><mi 
>p</mi></mrow></msup 
> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>&#x221E;</mi><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 735--><p class="nopar">For <!--l. 736--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math> and
any matrix <!--l. 736--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>
denote
</p>
<div class="math-display"><!--l. 737--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
          <msubsup><mrow 
><mi 
>E</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>p</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>f</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-punc">:</mo><mo 
class="MathClass-rel">=</mo><munder class="msub"><mrow 
><mo 
class="MathClass-op"> inf</mo> </mrow><mrow 
><msubsup><mrow 
>
<mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></munder 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>f</mi> <mo 
class="MathClass-bin">&#x2212;</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></munderover 
></mrow></mfenced> </mrow><mrow 
><msup><mrow 
>
<mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 739--><p class="nopar">Let <!--l. 740--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math>
be a compact subset of the unit disk with positive logarithmic capacity
<!--l. 740--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03B3;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math> and
<!--l. 740--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mn>1</mn><mi 
><mfenced separators="" 
open="/"  close="" ><mrow> </mrow></mfenced></mi><mi 
>K</mi> <mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>z</mi> <mo 
class="MathClass-punc">:</mo> <mn>1</mn><mi 
><mfenced separators="" 
open="/"  close="" ><mrow></mrow></mfenced></mi><mi 
>z</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>K</mi></mrow></mfenced></math>. If
<!--l. 744--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi> </mrow> <mrow 
>  <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>z</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <msup><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>k</mi></mrow></msup 
></math>
then
</p>

<div class="math-display"><!--l. 745--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                     <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msubsup><mrow 
><mi 
>E</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>p</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>D</mi></mrow></mfenced> <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>f</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x003C;</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 747--><p class="nopar">for every function <!--l. 748--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>, holomorphic
on the complement of <!--l. 748--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mn>1</mn><mi 
><mfenced separators="" 
open="/"  close="" ><mrow></mrow></mfenced></mi><mi 
>K</mi></math>.
</p><!--l. 751--><p class="indent"><span 
class="cmbx-12">Theorem 6.2 (FM) </span><span 
class="cmti-12">For each matrix</span>
<!--l. 751--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi> </mrow> <mrow 
>  <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced></mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>D</mi></mrow></mfenced></math> <span 
class="cmti-12">there is a function</span>
<!--l. 751--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>D</mi></mrow></mfenced></math><span 
class="cmti-12">, holomorphic on</span>
<span 
class="cmti-12">the complement of </span><!--l. 751--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mn>1</mn><mi 
><mfenced separators="" 
open="/"  close="" ><mrow></mrow></mfenced></mi><mi 
>K</mi></math>
<span 
class="cmti-12">, satisfying</span>
</p>
<div class="math-display"><!--l. 754--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                    <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msubsup><mrow 
><mi 
>E</mi></mrow><mrow 
><mi 
>n</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>p</mi></mrow></mfenced></mrow></msubsup 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>D</mi></mrow></mfenced> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>f</mi></mrow></mfenced></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo><mfrac><mrow 
><mi 
>&#x03B3;</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>K</mi></mrow></mfenced></mrow> 
  <mrow 
><mn>2</mn></mrow></mfrac>  <mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 756--><p class="nopar">
</p><!--l. 758--><p class="indent"><span 
class="cmbx-12">Proof</span><span 
class="cmbxti-10x-x-120">. </span>First of all, using technique of the theorem 5.1 once more, we &#xFB01;nd a matrix
<!--l. 758--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
></mrow></mfenced></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>K</mi></math> such that the matrix
of rational functions <!--l. 758--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
> <mfenced separators="" 
open="("  close=")" ><mrow>    <mfrac><mrow 
><mn>1</mn></mrow>
<mrow 
><mn>1</mn><mo 
class="MathClass-bin">&#x2212;</mo><mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover><mi 
>z</mi></mrow></mfrac></mrow></mfenced> </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math>
is <!--l. 758--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mfrac><mrow 
><mi 
>&#x03B3;</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow>
   <mrow 
><mn>2</mn></mrow></mfrac>   </math>-lower
bounded in <!--l. 758--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math> (see
[M] for representation of generated biorthogonal system and [F]). Secondly, the checking
of embedding <!--l. 758--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>&#x2111;</mi></mrow><mrow 
><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow>     <mfrac><mrow 
><mn>1</mn></mrow>
<mrow 
><mn>1</mn><mo 
class="MathClass-bin">&#x2212;</mo><mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi><mi 
>n</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover><mi 
>z</mi></mrow></mfrac></mrow></mfenced> <mo 
class="MathClass-rel">&#x2282;</mo> <mi 
>H</mi><mrow><mo 
class="MathClass-open">(</mo><mrow><mi mathvariant="double-struck">&#x2102;</mi><mo 
class="MathClass-bin">&#x2216;</mo><mn>1</mn><mi 
><mfenced separators="" 
open="/"  close="" ><mrow></mrow></mfenced></mi><mi 
>K</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></math>

is trivial. Finally, we use the corollary of basic lemma.
</p><!--l. 762--><p class="indent">Corresponding BW results are presented below.
</p><!--l. 765--><p class="indent"><span 
class="cmbx-12">Theorem 6.3 (BW) </span><span 
class="cmti-12">Let the sequence of disjoint complex numbers</span>
<!--l. 765--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi> </mrow> </msub 
>   </mrow></mfenced> </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math> <span 
class="cmti-12">be chosen from a</span>
<span 
class="cmti-12">compact subset of </span><!--l. 765--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></math>
<span 
class="cmti-12">and be geometrically separable, i.e.</span>
</p>
<div class="math-display"><!--l. 766--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
           <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim inf</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">inf</mo> </mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>j</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
> &#x220F;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn><mo 
class="MathClass-punc">,</mo><mi 
>k</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>j</mi></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><mfenced separators="" 
open="|"  close="|" ><mrow><mfrac><mrow 
><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>j</mi></mrow></msub 
></mrow>
<mrow 
><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo><mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>j</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac></mrow></mfenced></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>&#x03B4;</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 768--><p class="nopar"><span 
class="cmti-12">Then the class of functions </span><!--l. 769--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
> <mfenced separators="" 
open="("  close=")" ><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow></mfenced></math><span 
class="cmti-12">,</span>
<span 
class="cmti-12">permitting the fast approximation by &#xFB01;nite linear combinations of the system</span>
<!--l. 769--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><mfrac><mrow 
><mn>1</mn></mrow>
<mrow 
><mi 
>z</mi><mo 
class="MathClass-bin">&#x2212;</mo><mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac></mrow></mfenced></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math><span 
class="cmti-12">,</span>
<span 
class="cmti-12">coincides with the set of series</span>
</p>
<div class="math-display"><!--l. 770--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                    <munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></munderover 
>  <mfrac><mrow 
><msub><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow>
<mrow 
><mi 
>z</mi> <mo 
class="MathClass-bin">&#x2212;</mo><mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover></mrow></mfrac><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mroot><mrow 
> <mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced> </mrow><mrow 
><mi 
>k</mi></mrow></mroot><munder class="msub"><mrow 
><mo>&#x2192;</mo></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mn>0</mn><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 772--><p class="nopar"><span 
class="cmti-12">where the convergence is in the sense of</span>
<!--l. 773--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi> </mrow> </msup 
>   <mfenced separators="" 
open="("  close=")" ><mrow><msup><mrow 
><mi 
>G</mi></mrow><mrow 
><mo 
class="MathClass-bin">+</mo></mrow></msup 
></mrow></mfenced></math>
<span 
class="cmti-12">topology.</span>
</p><!--l. 775--><p class="indent"><span 
class="cmbx-12">Theorem 6.4 (BW) </span><span 
class="cmti-12">Let the sequence of disjoint complex numbers</span>
<!--l. 775--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi> </mrow> </msub 
>   </mrow></mfenced> </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math>

<span 
class="cmti-12">be chosen from a compact subset of the unit disk</span>
<!--l. 775--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>D</mi></math> <span 
class="cmti-12">and</span>
<span 
class="cmti-12">be geometrically separable, i.e.</span>
</p>
<div class="math-display"><!--l. 776--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
          <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim inf</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">inf</mo> </mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>j</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
> &#x220F;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn><mo 
class="MathClass-punc">,</mo><mi 
>k</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>j</mi></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><mfenced separators="" 
open="|"  close="|" ><mrow> <mfrac><mrow 
><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>j</mi></mrow></msub 
></mrow>
<mrow 
><mn>1</mn> <mo 
class="MathClass-bin">&#x2212;</mo><mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>j</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfrac></mrow></mfenced></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>&#x03B4;</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 778--><p class="nopar"><span 
class="cmti-12">Then the class of functions </span><!--l. 779--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>D</mi></mrow></mfenced></math><span 
class="cmti-12">,</span>
<span 
class="cmti-12">permitting the fast approximation by &#xFB01;nite linear combinations of the system</span>
<!--l. 779--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><mfrac><mrow 
><mn>1</mn></mrow>
<mrow 
><mn>1</mn><mo 
class="MathClass-bin">&#x2212;</mo><mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover><mi 
>z</mi></mrow></mfrac></mrow></mfenced></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math><span 
class="cmti-12">,</span>
<span 
class="cmti-12">coincides with the set of series</span>
</p>
<div class="math-display"><!--l. 780--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                    <munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></munderover 
>  <mfrac><mrow 
><msub><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow>
<mrow 
><mn>1</mn> <mo 
class="MathClass-bin">&#x2212;</mo><mover accent="false" 
class="mml-overline"><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow><mo 
accent="true">&#x00AF;</mo></mover><mi 
>z</mi></mrow></mfrac><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mroot><mrow 
> <mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced> </mrow><mrow 
><mi 
>k</mi></mrow></mroot><munder class="msub"><mrow 
><mo>&#x2192;</mo></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mn>0</mn><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 782--><p class="nopar"><span 
class="cmti-12">where the convergence is in the sense of</span>
<!--l. 783--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi> </mrow> </msup 
>   <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>D</mi></mrow></mfenced></math>
<span 
class="cmti-12">topology.</span>
</p>
<h3 class="sectionHead"><span class="titlemark">7. </span> <a 
 id="x1-80007"></a>Application 5</h3>
<!--l. 788--><p class="noindent">Let <!--l. 788--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mover 
accent="true"><mrow 
><mi 
>&#x03D5;</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover></math> be the Fourier
transform of <!--l. 788--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03D5;</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi mathvariant="double-struck">&#x211D;</mi></mrow></mfenced></math>.

Further, assume that <!--l. 788--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mfenced separators="" 
open="|"  close="|" ><mrow><mover 
accent="true"><mrow 
><mi 
>&#x03D5;</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>&#x03BE;</mi></mrow></mfenced></mrow></mfenced> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>m</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn></math>,
<!--l. 788--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03BE;</mi> <mo 
class="MathClass-rel">&#x2208;</mo><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>a</mi><mo 
class="MathClass-punc">,</mo><mi 
>a</mi> <mo 
class="MathClass-bin">+</mo> <mn>2</mn><mi 
>&#x03C3;</mi></mrow></mfenced></math> and
<!--l. 788--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi> </mrow> </msub 
>   </mrow></mfenced> </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
> <mo 
class="MathClass-rel">&#x2282;</mo> <mi mathvariant="double-struck">&#x211D;</mi></math>
satis&#xFB01;es <span 
class="cmti-12">strong separability condition</span>  </p><table class="equation"><tr><td> <a 
 id="x1-8001r14"></a>
<!--l. 789--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" class="equation">
          <mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">inf</mo> </mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>j</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x220F;</mo>
   </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn><mo 
class="MathClass-punc">,</mo><mi 
>k</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>j</mi></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><mo class="qopname">sin</mo><!--nolimits--> <mfrac><mrow 
><mi 
>&#x03C3;</mi></mrow> 
<mrow 
><mi 
>n</mi></mrow></mfrac> <mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>j</mi></mrow></msub 
></mrow></mfenced></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>&#x03B4;</mi> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2265;</mo> <msub><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>0</mn></mrow></msub 
><mo 
class="MathClass-punc">.</mo>
</math></td><td class="eq-no">(14)</td></tr></table>
<!--l. 793--><p class="indent">Then the following statement takes place
</p><!--l. 796--><p class="indent"><span 
class="cmbx-12">Theorem 7.1 (BW) </span><!--l. 796--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi mathvariant="double-struck">&#x211D;</mi></mrow></mfenced></math>
<span 
class="cmti-12">is fast approximable by the system of translates</span>
<!--l. 796--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>&#x03D5;</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced></mrow></mfenced></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math>,
i.e.
</p>
<div class="math-display"><!--l. 797--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
           <mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">inf</mo> </mrow><mrow 
><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
></mrow></munder 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mi 
>f</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>x</mi></mrow></mfenced> <mo 
class="MathClass-bin">&#x2212;</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></munderover 
><mi 
>&#x03D5;</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
></mrow></mfenced></mrow></mfenced></mrow><mrow 
><msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mfenced separators="" 
open="("  close=")" ><mrow><mi mathvariant="double-struck">&#x211D;</mi></mrow></mfenced></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot><munder class="msub"><mrow 
><mo 
class="MathClass-op">&#x2192;</mo></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mn>0</mn>
</mrow></math></div>
<!--l. 799--><p class="nopar"><span 
class="cmti-12">if and only if</span>
</p>

<div class="math-display"><!--l. 801--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
               <mi 
>f</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>x</mi></mrow></mfenced><mover class="msup"><mrow 
><mo 
class="MathClass-op">=</mo> </mrow><mrow 
><msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mfenced separators="" 
open="("  close=")" ><mrow><mi mathvariant="double-struck">&#x211D;</mi></mrow></mfenced></mrow></mover 
><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
> &#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></munderover 
><msub><mrow 
><mi 
>c</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
><mi 
>&#x03D5;</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mroot><mrow 
> <mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>c</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced> </mrow><mrow 
><mi 
>k</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2192;</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 803--><p class="nopar">
</p><!--l. 805--><p class="indent"><span 
class="cmbx-12">Proof. </span>It is enough to show that under conditions of the theorem the system
<!--l. 806--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mfenced separators="" 
open="{"  close="}" ><mrow><mi 
>&#x03D5;</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced></mrow></mfenced></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math> is
<!--l. 806--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mn>0</mn></math>-lower bounded and
<!--l. 806--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x221E;</mi></math>-upper bounded
in <!--l. 806--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi mathvariant="double-struck">&#x211D;</mi></mrow></mfenced></math>. As regards
<!--l. 806--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x221E;</mi></math>-upper boundedness it is
obvious. To prove <!--l. 806--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mn>0</mn></math>-lower
boundedness, at &#xFB01;rst we denote <!--l. 806--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>x</mi></mrow></mfenced> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
><mi 
>&#x03D5;</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
></mrow></mfenced></math>.
Then note that
</p>
<div class="math-display"><!--l. 808--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
><msub><mrow 
>
         <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>x</mi></mrow></mfenced></mrow></mfenced></mrow><mrow 
><msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mfenced separators="" 
open="("  close=")" ><mrow><mi mathvariant="double-struck">&#x211D;</mi></mrow></mfenced></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msub><mrow 
><mover 
accent="true"><mrow 
><mi 
>P</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>&#x03BE;</mi></mrow></mfenced></mrow></mfenced></mrow><mrow 
><msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mfenced separators="" 
open="("  close=")" ><mrow><mi mathvariant="double-struck">&#x211D;</mi></mrow></mfenced></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><mover 
accent="true"><mrow 
><mi 
>&#x03D5;</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>&#x03BE;</mi></mrow></mfenced><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></munderover 
><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>i</mi><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mi 
>&#x03BE;</mi></mrow></msup 
></mrow></mfenced> </mrow><mrow 
><msup><mrow 
>
<mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mfenced separators="" 
open="("  close=")" ><mrow><mi mathvariant="double-struck">&#x211D;</mi></mrow></mfenced></mrow></msub 
><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 810--><p class="nopar">So it remains to prove that <!--l. 811--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>i</mi><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mi 
>&#x03BE;</mi></mrow></msup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math>
is <!--l. 811--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mn>0</mn></math>-lower
bounded in <!--l. 811--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>a</mi><mo 
class="MathClass-punc">,</mo><mi 
>a</mi> <mo 
class="MathClass-bin">+</mo> <mn>2</mn><mi 
>&#x03C3;</mi></mrow></mfenced></math>,
that is </p><table class="equation"><tr><td> <a 
 id="x1-8002r15"></a>

<!--l. 812--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" class="equation">
<munder class="msub"><mrow 
><mo 
class="MathClass-op">limsup</mo></mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msub><mrow 
> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></munderover 
><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>i</mi><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mi 
>&#x03BE;</mi></mrow></msup 
></mrow></mfenced></mrow><mrow 
><msup><mrow 
>
<mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>a</mi><mo 
class="MathClass-punc">,</mo><mi 
>a</mi><mo 
class="MathClass-bin">+</mo><mn>2</mn><mi 
>&#x03C3;</mi></mrow></mfenced></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>q</mi><munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">max</mo> </mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
> <mfenced separators="" 
open="|"  close="|" ><mrow><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
><mi 
>n</mi></mrow></mroot>
</math></td><td class="eq-no">(15)</td></tr></table>
<!--l. 816--><p class="indent">for some positive number <!--l. 816--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>q</mi></math>.
</p><!--l. 818--><p class="indent">As <!--l. 818--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mfenced separators="" 
open="|"  close="|" ><mrow><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>i</mi><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>a</mi><mo 
class="MathClass-bin">+</mo><mi 
>&#x03C3;</mi></mrow></mfenced></mrow></msup 
></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mi 
>k</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-punc">,</mo> <mn>2</mn><mo 
class="MathClass-punc">,</mo><mo 
class="MathClass-op">&#x2026;</mo></math>
one can replace (<a 
href="#x1-8002r15">15<!--tex4ht:ref: eq15 --></a>) by
</p>
<div class="math-display"><!--l. 819--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
 <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><msub><mrow 
><mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><munderover accentunder="false" accent="false"><mrow  
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></munderover 
><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>i</mi><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mi 
>&#x03BE;</mi></mrow></msup 
></mrow></mfenced> </mrow><mrow 
><msup><mrow 
>
<mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mfenced separators="" 
open="("  close=")" ><mrow><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x03C3;</mi><mo 
class="MathClass-punc">,</mo><mi 
>&#x03C3;</mi></mrow></mfenced></mrow></msub 
></mrow><mrow 
><mi 
>n</mi></mrow></mroot> <mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>q</mi><munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
><mroot><mrow 
><munder class="msub"><mrow 
><mo 
class="MathClass-op">max</mo> </mrow><mrow 
><mn>1</mn><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></munder 
> <mfenced separators="" 
open="|"  close="|" ><mrow><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
><mi 
>n</mi></mrow></mroot><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 821--><p class="nopar">To establish this inequality we construct biorthogonal matrix
<!--l. 822--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi> </mrow> <mrow 
>  <mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced></mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">&#x2264;</mo><mi 
>n</mi></mrow></msub 
></math> and use lemma
1.1. Let <!--l. 822--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mover 
accent="true"><mrow 
><mi 
>&#x03D5;</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>&#x03BB;</mi></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mfrac><mrow 
><mo class="qopname">sin</mo><!--nolimits--> <mfrac><mrow 
><mi 
>&#x03C3;</mi><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>&#x03BB;</mi><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced></mrow> 
    <mrow 
><mi 
>n</mi></mrow></mfrac>    </mrow> 
  <mrow 
><mfrac><mrow 
><mi 
>&#x03C3;</mi><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>&#x03BB;</mi><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced></mrow> 
    <mrow 
><mi 
>n</mi></mrow></mfrac>    </mrow></mfrac>  <munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op"> &#x220F;</mo>
  </mrow><mrow 
><mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn><mo 
class="MathClass-punc">,</mo><mi 
>i</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>k</mi></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
> <mfrac><mrow 
><mo class="qopname">sin</mo><!--nolimits--> <mfrac><mrow 
><mi 
>&#x03C3;</mi><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>&#x03BB;</mi><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>i</mi></mrow></msub 
></mrow></mfenced></mrow> 
   <mrow 
><mi 
>n</mi></mrow></mfrac>    </mrow>
<mrow 
><mo class="qopname">sin</mo><!--nolimits--> <mfrac><mrow 
><mi 
>&#x03C3;</mi><mfenced separators="" 
open="("  close=")" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mo 
class="MathClass-bin">&#x2212;</mo><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>i</mi></mrow></msub 
></mrow></mfenced></mrow> 
    <mrow 
><mi 
>n</mi></mrow></mfrac>    </mrow></mfrac></math>.
Then <!--l. 822--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mover 
accent="true"><mrow 
><mi 
>&#x03D5;</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>&#x03BB;</mi></mrow></mfenced> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>P</mi><msub><mrow 
><mi 
>W</mi></mrow><mrow 
>
<mi 
>&#x03C3;</mi></mrow></msub 
></math>,
where <!--l. 822--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>P</mi><msub><mrow 
><mi 
>W</mi></mrow><mrow 
><mi 
>&#x03C3;</mi></mrow></msub 
></math>
is Paley-Wiener class of entire functions of exponential type
<!--l. 823--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>&#x03C3;</mi></math> which
belong to <!--l. 823--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi mathvariant="double-struck">&#x211D;</mi></mrow></mfenced></math>.
By the theorem of Paley and Wiener one has
<!--l. 823--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi> </mrow> <mrow 
>  <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>&#x03BE;</mi></mrow></mfenced> <mo 
class="MathClass-rel">&#x2208;</mo> <msup><mrow 
><mi 
>L</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
> <mfenced separators="" 
open="("  close=")" ><mrow><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x03C3;</mi><mo 
class="MathClass-punc">,</mo><mi 
>&#x03C3;</mi></mrow></mfenced></math>. Now
taking into account
</p>

<div class="math-display"><!--l. 824--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
><msubsup><mrow 
>
<mover 
accent="true"><mrow 
><mi 
>&#x03D5;</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mfenced separators="" 
open="("  close=")" ><mrow><mi 
>n</mi></mrow></mfenced></mrow></msubsup 
> <mfenced separators="" 
open="("  close=")" ><mrow><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
>
<mi 
>i</mi></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="{"  close="" ><mrow><mtable  align="axis"  
equalrows="false" equalcolumns="false" class="array"><mtr><mtd 
class="array"  columnalign="center"><mn>1</mn><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mi 
>i</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>k</mi></mtd>
</mtr><mtr><mtd 
class="array"  columnalign="center"> <mn>0</mn><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mi 
>i</mi><mo 
class="MathClass-rel">&#x2260;</mo><mi 
>k</mi> </mtd>
</mtr><mtr><mtd 
class="array"  columnalign="center">        </mtd></mtr> <!--*{20}c--></mtable>                                                                        </mrow></mfenced>
</mrow></math></div>
<!--l. 829--><p class="nopar">we obtain that the systems <!--l. 830--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow>  <mfrac><mrow 
><mn>1</mn></mrow>
<mrow 
><msqrt><mrow><mn>2</mn><mi 
>&#x03C0;</mi></mrow></msqrt></mrow></mfrac><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></msubsup 
></math>
and <!--l. 830--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>i</mi><msub><mrow 
><mi 
>&#x03BB;</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mi 
>&#x03BE;</mi></mrow></msup 
></mrow></mfenced> </mrow><mrow 
>
<mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></msubsup 
></math> are biorthogonal
for all natural numbers <!--l. 830--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi></math>.
On the other hand, (<a 
href="#x1-8001r14">14<!--tex4ht:ref: eq14 --></a>) implies
</p>
<div class="math-display"><!--l. 832--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                        <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msubsup><mrow 
><mi 
>&#x03D5;</mi></mrow><mrow 
><mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mfenced separators="" 
open="&#x2225;"  close="&#x2225;" ><mrow><msubsup><mrow 
><mover 
accent="true"><mrow 
><mi 
>&#x03D5;</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
></mrow></mfenced> <mo 
class="MathClass-rel">&#x2264;</mo><mfrac><mrow 
><mi 
>C</mi><mi 
>n</mi></mrow> 
 <mrow 
><msup><mrow 
><mi 
>&#x03B4;</mi></mrow><mrow 
><mi 
>n</mi></mrow></msup 
></mrow></mfrac> <mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 834--><p class="nopar">for some positive constant <!--l. 835--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>C</mi></math>.
</p><!--l. 837--><p class="indent">Finally, we apply lemma 1.1 and establish the theorem.
</p>
<h3 class="sectionHead"><span class="titlemark">8. </span> <a 
 id="x1-90008"></a>Application 6</h3>
<!--l. 842--><p class="noindent">It is well known (see [B] and [V]) that there is a close relation between the
order of entire function and the rate of its approximation by polynomials.
</p><!--l. 846--><p class="indent"><span 
class="cmbx-12">Theorem (Batirov-Varga) </span><span 
class="cmti-12">Let</span>
<!--l. 846--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi> <mo 
class="MathClass-rel">&#x2282;</mo> <mi mathvariant="double-struck">&#x2102;</mi></math> <span 
class="cmti-12">be a</span>
<span 
class="cmti-12">compact set of positive logarithmic capacity. Then for each entire function</span>
<!--l. 846--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math> <span 
class="cmti-12">one</span>

<span 
class="cmti-12">has</span>
</p>
<div class="math-display"><!--l. 847--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                     <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
>   <mfrac><mrow 
><mi 
>n</mi><mo class="qopname"> ln</mo><!--nolimits--> <mi 
>n</mi></mrow> 
<mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mo class="qopname"> ln</mo><!--nolimits--> <msub><mrow 
><mi 
>E</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>f</mi><mo 
class="MathClass-punc">,</mo><mi 
>K</mi></mrow></mfenced></mrow></mfrac> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x03C1;</mi><mo 
class="MathClass-punc">,</mo>
</mrow></math></div>
<!--l. 849--><p class="nopar"><span 
class="cmti-12">where </span><!--l. 850--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C1;</mi></math> <span 
class="cmti-12">is the</span>
<span 
class="cmti-12">order of function </span><!--l. 850--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>,
<!--l. 850--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>E</mi></mrow><mrow 
><mi 
>n</mi> </mrow> </msub 
>   <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>f</mi><mo 
class="MathClass-punc">,</mo><mi 
>K</mi></mrow></mfenced></math> <span 
class="cmti-12">is the error of</span>
<span 
class="cmti-12">approximation of function </span><!--l. 850--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>f</mi></math>
<span 
class="cmti-12">by algebraic polynomials in the uniform norm on</span>
<!--l. 850--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>K</mi></math>.
</p><!--l. 852--><p class="indent">One can easily obtain an analogy of basic lemma&#x2019;s BW result in this
direction.
</p><!--l. 856--><p class="indent"><span 
class="cmbx-12">Theorem 8.1 (BW) </span><span 
class="cmti-12">Let </span><!--l. 856--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msubsup><mrow 
> <mfenced separators="" 
open="{"  close="}" ><mrow><msub><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced> </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></msubsup 
></math>
<span 
class="cmti-12">be a </span><!--l. 856--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mn>0</mn></math>-<span 
class="cmti-12">lower and</span>
<!--l. 856--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x221E;</mi></math>-<span 
class="cmti-12">upper bounded system in</span>
<span 
class="cmti-12">a Banach space </span><!--l. 856--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi><mo 
class="MathClass-punc">,</mo><msub><mrow 
><mi 
>E</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>x</mi></mrow></mfenced></math> <span 
class="cmti-12">be the</span>
<span 
class="cmti-12">error of approximation of </span><!--l. 856--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>x</mi> <mo 
class="MathClass-rel">&#x2208;</mo> <mi 
>X</mi></math>
<span 
class="cmti-12">by polynomials </span><!--l. 856--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><munderover accentunder="false" accent="false"><mrow  
><mo 
class="MathClass-op">&#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></munderover 
><msubsup><mrow 
><mi 
>a</mi></mrow><mrow 
>
<mi 
>k</mi></mrow><mrow 
><mrow><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><msub><mrow 
><mi 
>e</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
></math>
<span 
class="cmti-12">in </span><!--l. 856--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" > <mi 
>X</mi></math> <span 
class="cmti-12">and,</span>
<span 
class="cmti-12">&#xFB01;nally, </span><!--l. 856--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>&#x03C1;</mi></math>
<span 
class="cmti-12">be some non-negative number. Then</span>
</p>

<div class="math-display"><!--l. 857--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                      <munder class="msub"><mrow 
><mo 
class="MathClass-op">lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
>  <mfrac><mrow 
><mi 
>n</mi><mo class="qopname"> ln</mo><!--nolimits--> <mi 
>n</mi></mrow> 
<mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mo class="qopname"> ln</mo><!--nolimits--> <msub><mrow 
><mi 
>E</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>x</mi></mrow></mfenced></mrow></mfrac> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>&#x03C1;</mi>
</mrow></math></div>
<!--l. 859--><p class="nopar"><span 
class="cmti-12">if and only if</span>
</p>
<div class="math-display"><!--l. 861--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
              <mi 
>x</mi> <mo 
class="MathClass-rel">=</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
> &#x2211;</mo>
  </mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>&#x221E;</mi></mrow></munderover 
><msub><mrow 
><mi 
>x</mi></mrow><mrow 
>
<mi 
>k</mi></mrow></msub 
><msub><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
><mo 
class="MathClass-punc">,</mo><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><mspace width="0em" class="thinspace"/><munder class="msub"><mrow 
><mo>lim sup</mo> </mrow><mrow 
><mi 
>n</mi><mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></munder 
> <mfrac><mrow 
><mi 
>n</mi><mo class="qopname"> ln</mo><!--nolimits--> <mi 
>n</mi></mrow> 
<mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mo class="qopname"> ln</mo><!--nolimits--> <mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>x</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
></mrow></mfenced></mrow></mfrac> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>&#x03C1;</mi><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 863--><p class="nopar">Taking <!--l. 864--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>X</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>C</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mi 
>K</mi></mrow></mfenced></math>
and <!--l. 864--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>e</mi></mrow><mrow 
><mi 
>k</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <msup><mrow 
><mi 
>z</mi></mrow><mrow 
><mi 
>k</mi></mrow></msup 
></math>
we immediately establish Batirov-Varga&#x2019;s result.
</p>
<h3 class="sectionHead"><a 
 id="x1-100008"></a>References</h3>
<!--l. 869--><p class="noindent">
</p><div class="thebibliography">
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">[BW]</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><span 
class="cmr-10">Bernstein  S.  N.,  </span><span 
class="cmti-10">On  best  approximation  of  continuous  functions  by</span>
<span 
class="cmti-10">polynomials of a given degree</span><span 
class="cmr-10">. Soobshcheniya of Kharkov Society of Mathematics</span>
<span 
class="cmr-10">(2), 13, 1920.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">[W]</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><span 
class="cmr-10">Walsh I. L., </span><span 
class="cmti-10">Uber den grad der Approximation einer analytishen funktion</span><span 
class="cmr-10">,</span>
<span 
class="cmr-10">Minchner Bericte, 1926, 223-229.</span>

</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">[FM]</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><span 
class="cmr-10">S. D. Fisher and C. A. Micchelli, </span><span 
class="cmti-10">The n-width of sets of analytic functions,</span>
<span 
class="cmr-10">Duke Math. J. 47, 1980, 789-801.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">[F]</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><span 
class="cmr-10">Samarchyan S. V., </span><span 
class="cmti-10">Fast approximation in Hardy and Lebesgue spaces</span><span 
class="cmr-10">, Journal</span>
<span 
class="cmr-10">of Contemporary Mathematical Analysis, vol. 39, no. 6, 2004, 69-81.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">[T]</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><span 
class="cmr-10">Tikhomirov V. M., </span><span 
class="cmti-10">Diameters of sets in function spaces and the theory of best</span>
<span 
class="cmti-10">approximations</span><span 
class="cmr-10">, Uspekhi Mat. Nauk, 15, 1960, 81-120; English transl. in Russian</span>
<span 
class="cmr-10">Math. Surveys, 15, 1960, 75-111.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">[M1]</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><span 
class="cmr-10">Musoyan V. Kh., </span><span 
class="cmti-10">On rate of approximation of entire functions by complete</span>
<span 
class="cmti-10">system of Dirichlet</span><span 
class="cmr-10">, Mat. Zametki, vol. 36, no. 6, 1984, 857-863.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">[Z]</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><span 
class="cmr-10">Martirosyan M. S. and Samarchyan S. V., </span><span 
class="cmti-10">On speed of approximation of entire</span>
<span 
class="cmti-10">functions by a system of exponents with bounded sequence of powers</span><span 
class="cmr-10">, submitted</span>
<span 
class="cmr-10">for publication.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">[L]</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><span 
class="cmr-10">Lorentz G. G., Golitschek M. V., Makovoz Y., </span><span 
class="cmti-10">Constructive Approximation:</span>
<span 
class="cmti-10">Advanced Problems</span><span 
class="cmr-10">, Springer Verlag, Berlin, 1996.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">[M2]</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><span 
class="cmr-10">Musoyan V. Kh., </span><span 
class="cmti-10">Extremal properties of Dirichlet polynomials</span><span 
class="cmr-10">, Izv. AN Arm.</span>
<span 
class="cmr-10">SSR, Mat, vol. 18, no. 4, 1983, 253-270.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">[J]</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><span 
class="cmr-10">Jrbashyan      M.,      </span><span 
class="cmti-10">Basicity      of      some      biorthogonal      systems</span>
<span 
class="cmti-10">and     the     solution     of     a     multiple     interpolation     problem     in</span>
<!--l. 905--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
></math>
<span 
class="cmti-10">classes  in  the  half  plane</span><span 
class="cmr-10">,  Izv.  Akad.  Nauk,  SSSR  Ser.  Mat.  Vol.  42,  1978,</span>
<span 
class="cmr-10">1323-1384.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">[C]</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><span 
class="cmr-10">Carleson  L.,  </span><span 
class="cmti-10">Interpolation  by  bounded  analytic  functions  and  the  corona</span>
<span 
class="cmti-10">problem</span><span 
class="cmr-10">, Ann. Math., 76, 1962, 547-559.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">[M3]</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><span 
class="cmr-10">Musoyan  V.  Kh.,  </span><span 
class="cmti-10">Summation  of  biorthogonal  expansions  by  incomplete</span>
<span 
class="cmti-10">systems of exponents and rational functions</span><span 
class="cmr-10">, Izv. AN Arm. SSR, Mat., vol. 21,</span>
<span 
class="cmr-10">no. 2, 1986, 163-186.</span>

</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">[M]</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><span 
class="cmr-10">Martirosyan  M.  S.  and  Musoyan  V.  Kh.,  </span><span 
class="cmti-10">Summation  of  biorthogonal</span>
<span 
class="cmti-10">expansions    by    incomplete    system    of    rational    functions    in    spaces</span>
<!--l. 917--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>p</mi></mrow></msup 
></math><span 
class="cmti-10">(</span><!--l. 917--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mn>1</mn> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>p</mi> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>&#x221E;</mi></math><span 
class="cmti-10">)</span>
<span 
class="cmti-10">on the disk</span><span 
class="cmr-10">, Journal of Contemporary Math. Anal., vol. 32, no. 5, 1997, 27-38.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">[B]</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><span 
class="cmr-10">Batirov A. V., </span><span 
class="cmti-10">On the best approximation of analytic function by polynomials</span><span 
class="cmr-10">,</span>
<span 
class="cmr-10">DAN SSSR, vol. 76, 1951, 173-175.</span>
</p>
<p class="bibitem"><span class="biblabel">
<span 
class="cmr-10">[V]</span><span class="bibsp"><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span><span 
class="cmr-10">&#x00A0;</span></span></span><span 
class="cmr-10">Varga R. S., </span><span 
class="cmti-10">On an extension of a result of S. N. Bernstein</span><span 
class="cmr-10">, JAT 1, 1968,</span>
<span 
class="cmr-10">176-179.</span>
</p>
</div>
<!--l. 930--><p class="noindent"><span 
class="cmti-10x-x-109">E-mail address: </span><span 
class="cmr-10x-x-109">approximation@gmail.com</span>
</p><!--l. 932--><p class="indent">Received November 23, 2006
</p>
 
</body> 
</html> 



