<?xml version="1.0" encoding="utf-8" standalone="no"?>
<!DOCTYPE document PUBLIC "-//CNX//DTD CNXML 0.5 plus MathML//EN" "http://cnx.rice.edu/cnxml/0.5/DTD/cnxml_mathml.dtd">
<document xmlns="http://cnx.rice.edu/cnxml" xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="m10895">

  <name>Uniform Convergence of Function Sequences</name>
  
  <metadata>
  <md:version>2.4</md:version>
  <md:created>2002/10/11</md:created>
  <md:revised>2005/06/24 20:33:26.002 GMT-5</md:revised>
  <md:authorlist>
      <md:author id="mjhaag">
      <md:firstname>Michael</md:firstname>
      
      <md:surname>Haag</md:surname>
      <md:email>mjhaag@rice.edu</md:email>
    </md:author>
      <md:author id="richb">
      <md:firstname>Richard</md:firstname>
      <md:othername>G.</md:othername>
      <md:surname>Baraniuk</md:surname>
      <md:email>richb@rice.edu</md:email>
    </md:author>
  </md:authorlist>

  <md:maintainerlist>
    <md:maintainer id="mjhaag">
      <md:firstname>Michael</md:firstname>
      
      <md:surname>Haag</md:surname>
      <md:email>mjhaag@rice.edu</md:email>
    </md:maintainer>
    <md:maintainer id="richb">
      <md:firstname>Richard</md:firstname>
      <md:othername>G.</md:othername>
      <md:surname>Baraniuk</md:surname>
      <md:email>richb@rice.edu</md:email>
    </md:maintainer>
  </md:maintainerlist>
  
  <md:keywordlist>
    <md:keyword>converge</md:keyword>
    <md:keyword>convergence</md:keyword>
    <md:keyword>converges</md:keyword>
    <md:keyword>function sequences</md:keyword>
    <md:keyword>sequences</md:keyword>
    <md:keyword>uniform</md:keyword>
    <md:keyword>uniform convergence</md:keyword>
  </md:keywordlist>

  <md:abstract>Another form of convergence, uniform convergence, is defined and described in this module.  Also, its relationship to pointwise convergence is also shown.</md:abstract>
</metadata>


  <content>
    <section id="sec6">
      <name>Uniform Convergence of Function Sequences</name>
      <para id="p1_s6">
	For this discussion, we will only consider functions with
	<m:math>
	  <m:ci><m:msub>
	      <m:mi>g</m:mi>
	      <m:mi>n</m:mi>
	    </m:msub></m:ci>
	</m:math> where
	
	<m:math display="block">
	  <m:apply>
	    <m:tendsto/>
	    <m:reals/>
	    <m:reals/>
	  </m:apply>
	</m:math>
	
	<definition id="unif">
	  <term>Uniform Convergence</term>
	  <meaning>
	    The <cnxn document="m10883" strength="8">sequence</cnxn> 
	    <m:math>
	      <m:apply>
		<m:csymbol definitionURL="http://cnx.rice.edu/cd/cnxmath.ocd#evaluateat"/>
		<m:bvar>
		  <m:ci>n</m:ci>
		</m:bvar>
		<m:interval>
		  <m:cn>1</m:cn>
		  <m:infinity/>
		</m:interval>
		<m:set>
		  <m:ci type="vector"><m:msub>
		      <m:mi>g</m:mi>
		      <m:mi>n</m:mi>
		    </m:msub></m:ci>
		</m:set>	    
	      </m:apply>
	    </m:math> 
	    converges uniformly to function
	    <m:math><m:ci>g</m:ci></m:math> if for every 
	    <m:math>
	      <m:apply>
		<m:gt/>
		<m:ci>ε</m:ci>
		<m:cn>0</m:cn>
	      </m:apply>
	    </m:math> there is an integer
	    <m:math><m:ci>N</m:ci></m:math> such that
	    <m:math>
	      <m:apply>
		<m:geq/>
		<m:ci>n</m:ci>
		<m:ci>N</m:ci>
	      </m:apply>
	    </m:math> implies

	    <equation id="eq7">
	      <m:math>
		<m:apply>
		  <m:leq/>
		  <m:apply>
		    <m:abs/>
		    <m:apply>
		      <m:minus/>
		      <m:apply>
			<m:ci type="fn"><m:msub>
			    <m:mi>g</m:mi>
			    <m:mi>n</m:mi>
			  </m:msub></m:ci>
			<m:ci>t</m:ci>
		      </m:apply>
		      <m:apply>
			<m:ci type="fn">g</m:ci>
			<m:ci>t</m:ci>
		      </m:apply>
		    </m:apply>
		  </m:apply>
		  <m:ci>ε</m:ci>
		</m:apply>
	      </m:math>
	    </equation>

	    for <emphasis>all</emphasis> 
	    <m:math>
	      <m:apply>
		<m:in/>
		<m:ci>t</m:ci>
		<m:reals/>
	      </m:apply>
	    </m:math>.
	  </meaning>
	</definition>

	Obviously every uniformly convergent sequence is <cnxn document="m10894" strength="8">pointwise</cnxn> convergent.  The
	difference between pointwise and uniform convergence is this:
	If
	<m:math>
	  <m:set>
	    <m:ci><m:msub>
		<m:mi>g</m:mi>
		<m:mi>n</m:mi>
	      </m:msub></m:ci>
	  </m:set>
	</m:math> converges pointwise to
	<m:math><m:ci>g</m:ci></m:math>, then for every 
	<m:math>
	  <m:apply>
	    <m:gt/>
	    <m:ci>ε</m:ci>
	    <m:cn>0</m:cn>
	  </m:apply>
	</m:math> and for every 
	<m:math>
	  <m:apply>
	    <m:in/>
	    <m:ci>t</m:ci>
	    <m:reals/>
	  </m:apply>
	</m:math> there is an integer <m:math><m:ci>N</m:ci></m:math>
	depending on <m:math><m:ci>ε</m:ci></m:math>
	<emphasis>and</emphasis> <m:math><m:ci>t</m:ci></m:math> such
	that <cnxn target="eq7" strength="8"/> holds if 
	<m:math>
	  <m:apply>
	    <m:geq/>
	    <m:ci>n</m:ci>
	    <m:ci>N</m:ci>
	  </m:apply>
	</m:math>.  If 
	<m:math>
	  <m:set>
	    <m:ci><m:msub>
		<m:mi>g</m:mi>
		<m:mi>n</m:mi>
	      </m:msub></m:ci>
	  </m:set>
	</m:math> 
	converges uniformly to <m:math><m:ci>g</m:ci></m:math>, it is
	possible for each 
	<m:math>
	  <m:apply>
	    <m:gt/>
	    <m:ci>ε</m:ci>
	    <m:cn>0</m:cn>
	  </m:apply>
	</m:math> to find <emphasis>one</emphasis> integer
	<m:math><m:ci>N</m:ci></m:math> that will do for all 
	<m:math>
	  <m:apply>
	    <m:in/>
	    <m:ci>t</m:ci>
	    <m:reals/>
	  </m:apply>
	</m:math>.
      </para>

      <example id="eg1_unif">
	<para id="p1_eg1u">

	  <m:math display="block">
	    <m:apply>
	      <m:forall/>
	      <m:bvar>
		<m:ci>t</m:ci>
	      </m:bvar>
	      <m:condition>
		<m:apply>
		  <m:in/>
		  <m:ci>t</m:ci>
		  <m:reals/>
		</m:apply>
	      </m:condition>
	      <m:apply>
		<m:eq/>
		<m:apply>
		  <m:ci type="fn">
		    <m:msub>
		      <m:mi>g</m:mi>
		      <m:mi>n</m:mi>
		    </m:msub>
		  </m:ci>
		  <m:ci>t</m:ci>
		</m:apply>
		<m:apply>
		  <m:divide/>
		  <m:cn>1</m:cn>
		  <m:ci>n</m:ci>
		</m:apply>
	      </m:apply>
	    </m:apply>
	  </m:math>

	  Let 
	  <m:math>
	    <m:apply>
	      <m:gt/>
	      <m:ci>ε</m:ci>
	      <m:cn>0</m:cn>
	    </m:apply>
	  </m:math> 
	  be given.  Then choose 
	  <m:math>
	    <m:apply>
	      <m:eq/>
	      <m:ci>N</m:ci>
	      <m:apply>
		<m:ceiling/>
		<m:apply>
		  <m:divide/>
		  <m:cn>1</m:cn>
		  <m:ci>ε</m:ci>
		</m:apply>
	      </m:apply>
	    </m:apply>
	  </m:math>.  Obviously,

	  <m:math display="block">
	    <m:apply>
	      <m:forall/>
	      <m:bvar>
		<m:ci>n</m:ci>
	      </m:bvar>
	      <m:condition>
		<m:apply>
		  <m:geq/>
		  <m:ci>n</m:ci>
		  <m:ci>N</m:ci>
		</m:apply>
	      </m:condition>
	      <m:apply>
		<m:leq/>
		<m:apply>
		  <m:abs/>
		  <m:apply>
		    <m:minus/>
		    <m:apply>
		      <m:ci type="fn">
			<m:msub>
			  <m:mi>g</m:mi>
			  <m:mi>n</m:mi>
			</m:msub>
		      </m:ci>
		      <m:ci>t</m:ci>
		    </m:apply>
		    <m:cn>0</m:cn>
		  </m:apply>
		</m:apply>
		<m:ci>ε</m:ci>
	      </m:apply>
	    </m:apply>
	  </m:math>
		  
	  for all <m:math><m:ci>t</m:ci></m:math>.  Thus, 
	  <m:math>
	    <m:apply>
	      <m:ci type="fn"><m:msub>
		  <m:mi>g</m:mi>
		  <m:mi>n</m:mi>
		</m:msub></m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math> converges uniformly to
	  <m:math><m:cn>0</m:cn></m:math>.  
	</para>
      </example>

      <example id="eg2_unif">
	<para id="p1_eg2u">
	  
	  <m:math display="block">
	    <m:apply>
	      <m:forall/>
	      <m:bvar>
		<m:ci>t</m:ci>
	      </m:bvar>
	      <m:condition>
		<m:apply>
		  <m:in/>
		  <m:ci>t</m:ci>
		  <m:reals/>
		</m:apply>
	      </m:condition>
	      <m:apply>
		<m:eq/>
		<m:apply>
		  <m:ci type="fn">
		    <m:msub>
		      <m:mi>g</m:mi>
		      <m:mi>n</m:mi>
		    </m:msub>
		  </m:ci>
		  <m:ci>t</m:ci>
		</m:apply>
		<m:apply>
		  <m:divide/>
		  <m:ci>t</m:ci>
		  <m:ci>n</m:ci>
		</m:apply>
	      </m:apply>
	    </m:apply>
	  </m:math>


	  <!-- FIGURE HERE -->


	  Obviously for any 
	  <m:math>
	    <m:apply>
	      <m:gt/>
	      <m:ci>ε</m:ci>
	      <m:cn>0</m:cn>
	    </m:apply>
	  </m:math> we cannot find a single function 
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">
		<m:msub>
		  <m:mi>g</m:mi>
		  <m:mi>n</m:mi>
		</m:msub>
	      </m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math> for which <cnxn target="eq7" strength="8"/> holds
	  with 
	  <m:math>
	    <m:apply>
	      <m:eq/>
	      <m:apply>
		<m:ci type="fn">g</m:ci>
		<m:ci>t</m:ci>
	      </m:apply>
	      <m:cn>0</m:cn>
	    </m:apply>
	  </m:math> for all <m:math><m:ci>t</m:ci></m:math>.  Thus 
	  <m:math>
	    <m:ci><m:msub>
		<m:mi>g</m:mi>
		<m:mi>n</m:mi>
	      </m:msub></m:ci>
	  </m:math> is not uniformly convergent. However we do have:

	  <m:math display="block">
	    <m:apply>
	      <m:tendsto/>
	      <m:apply>
		<m:ci type="fn">
		  <m:msub>
		    <m:mi>g</m:mi>
		    <m:mi>n</m:mi>
		  </m:msub>
		</m:ci>
		<m:ci>t</m:ci>
	      </m:apply>
	      <m:apply>
		<m:ci type="fn">g</m:ci>
		<m:ci>t</m:ci>
	      </m:apply>
	    </m:apply>
	    <m:mtext>  pointwise</m:mtext>
	  </m:math>
	
	  <note type="conclusion">
	    Uniform convergence always implies pointwise convergence,
	    but pointwise convergence does not guarantee uniform
	    convergence. 
	  </note>	  
	</para>
      </example>


      <section id="s7_subf">
	<name>Problems</name>
	<para id="p1_f">
	  Rigorously prove if the following functions converge pointwise,
	  uniformly, or both.

	  <list id="list_unif" type="enumerated">
	    <item>
	      <m:math>
		<m:apply>
		  <m:eq/>
		  <m:apply>
		    <m:ci type="fn">
		      <m:msub>
			<m:mi>g</m:mi>
			<m:mi>n</m:mi>
		      </m:msub>
		    </m:ci>
		    <m:ci>t</m:ci>
		  </m:apply>
		  <m:apply>
		    <m:divide/>
		    <m:apply>
		      <m:sin/>
		      <m:ci>t</m:ci>
		    </m:apply>
		    <m:ci>n</m:ci>
		  </m:apply>
		</m:apply>
	      </m:math>
	    </item>

	    <item>
	      <m:math>
		<m:apply>
		  <m:eq/>
		  <m:apply>
		    <m:ci type="fn">
		      <m:msub>
			<m:mi>g</m:mi>
			<m:mi>n</m:mi>
		      </m:msub>
		    </m:ci>
		    <m:ci>t</m:ci>
		  </m:apply>
		  <m:apply>
		    <m:exp/>
		    <m:apply>
		      <m:divide/>
		      <m:ci>t</m:ci>
		      <m:ci>n</m:ci>
		    </m:apply>
		  </m:apply>
		</m:apply>
	      </m:math>
	    </item>

	    <item>
	      <m:math>
		<m:apply>
		  <m:eq/>
		  <m:apply>
		    <m:ci type="fn">
		      <m:msub>
			<m:mi>g</m:mi>
			<m:mi>n</m:mi>
		      </m:msub>
		    </m:ci>
		    <m:ci>t</m:ci>
		  </m:apply>
		  <m:piecewise>
		    <m:piece>
		      <m:apply>
			<m:divide/>
			<m:cn>1</m:cn>
			<m:apply>
			  <m:times/>
			  <m:ci>n</m:ci>
			  <m:ci>t</m:ci>
			</m:apply>
		      </m:apply>
		      <m:apply>
			<m:gt/>
			<m:ci>t</m:ci>
			<m:cn>0</m:cn>
		      </m:apply>
		    </m:piece>
		    <m:piece>
		      <m:cn>0</m:cn>
		      <m:apply>
			<m:leq/>
			<m:ci>t</m:ci>
			<m:cn>0</m:cn>
		      </m:apply>
		    </m:piece>
		  </m:piecewise>
		</m:apply>
	      </m:math>
	    </item>
	  </list>
	</para>
      </section>
    </section>
	    
  </content>  
</document>
