<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0//EN"
   "http://www.w3.org/Math/DTD/mathml2/xhtml-math11-f.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head> 
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<title>SeriesLect1</title>
<style type="text/css">
body {
    counter-reset: section 0;  
    text-align: justify
}

h2.title {
    text-align:center
}
p.author {
    text-align:center
}
li {
    text-indent: 0em;
}
p.indent {
    text-indent: 2em; 
}

h2.section {
    counter-reset: eqn 0 result 0 subsection 0;  
}
h2.section:before {
    content: counter(section) ". ";
    counter-increment: section 1;  /* Add 1 to section */
}
h3.subsection:before {
    content: counter(section) "." counter(subsection);
    counter-increment: subsection;  /* Add 1 to subsection */
}

div.theorem:before { 
    content: "Theorem " counter(section) "." counter(result) " "; 
    counter-increment: result 1;
    font-style: normal; 
    font-weight: bold; 
}
div.theorem{ font-style:italic }
div.proposition:before { 
    content: "Proposition " counter(section) "." counter(result) " "; 
	counter-increment: result 1;
    font-style: normal; 
    font-weight: bold; 
}
div.proposition{ font-style:italic }
div.lemma:before { 
    content: "Lemma " counter(section) "." counter(result) " "; 
    counter-increment: result;
    font-style: normal; 
    font-weight: bold; 
}
div.lemma{ font-style:italic }

table.dispeq {
   width:100%;
   }
td.eq {
   text-align:center;
     }
td.eqno {
    width: 10px;
    text-align:right;
    }
td.eqno:after { 
     content: "("counter(section)"."counter(eqn)")";
     counter-increment: eqn;
     font-style: normal; 
  }
</style>
</head>

<body>
<h2 class="title"> Series</h2>

<p class="author">
Arun Ram <br />
Department of Mathematics and Statistics <br />
University of Melbourne <br />
Parkville VIC 3010 Australia <br />
aram@unimelb.edu.au <br />
<br />
and <br />
<br />
Department of Mathematics <br />
University of Wisconsin, Madison <br />
Madison, WI 53706 USA <br />
ram@math.wisc.edu <br />
</p>


<p> Last updates: 09 July 2009 </p>


<h2 class="section"> Sequences </h2>

<p class="indent"> 
Let 
<math xmlns="http://www.w3.org/1998/Math/MathML">
  <mi>X</mi>
</math> 
be a set.  A <strong>sequence</strong> 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>(</mo><msub><mi>x</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>x</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>x</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>)</mo></math> 
of points in 
<math xmlns="http://www.w3.org/1998/Math/MathML">
  <mi>X</mi>
</math> 
is a function
<table class="dispeq">
<tr><td class="eq">
<math xmlns="http://www.w3.org/1998/Math/MathML">
  <mrow>
  <mtable>
    <mtr>
      <mtd>
        <msub><mi>&Zopf;</mi><mrow><mo>&gt;</mo><mn>0</mn></mrow></msub>
	</mtd>
	<mtd>	
		<mo>&longrightarrow;</mo>
      </mtd>
      <mtd>
        <mi>X</mi>
      </mtd>
    </mtr>
    <mtr>
      <mtd>
        <mi>n</mi>
      </mtd>
	  <mtd>
	  <mo>&longmapsto;</mo>
	  </mtd>
      <mtd>
        <msub><mi>x</mi><mi>n</mi></msub>
      </mtd>
    </mtr>
  </mtable>
  </mrow>
</math></td>
</tr></table>
</p>

<p class="noindent"> 
Let 
<math xmlns="http://www.w3.org/1998/Math/MathML">
  <mi>X</mi>
</math> 
be a set and let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>(</mo><msub><mi>x</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>x</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>x</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>)</mo></math> 
be a sequence in 
<math xmlns="http://www.w3.org/1998/Math/MathML">
  <mi>X</mi>
</math>.
A <strong>limit</strong> of the sequence
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>(</mo><msub><mi>x</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>x</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>x</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>)</mo></math> 
is a limit point of the
sequence with respect to the Fr&eacute;chet filter on 
<math xmlns="http://www.w3.org/1998/Math/MathML">
        <msub><mi>&Zopf;</mi><mrow><mo>&gt;</mo><mn>0</mn></mrow></msub>
</math>.  Write
<table class="dispeq">
<tr><td class="eq">
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>y</mi><mo>=</mo>
<munder><mi>lim</mi><mrow><mi>n</mi><mo>&rightarrow;</mo><mi>&infin;</mi></mrow></munder>
<msub><mi>x</mi><mi>n</mi></msub>
<mspace width="2em"/>
</math>
if <math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>y</mi></math>
is a limit of the sequence
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>(</mo><msub><mi>x</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>x</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>x</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>)</mo></math> 
</td>
</tr></table>
</p>

<p class="noindent"> 
The sequence 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>(</mo><msub><mi>x</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>x</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>x</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>)</mo></math> 
<strong>converges</strong> if 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<munder><mi>lim</mi><mrow><mi>n</mi><mo>&rightarrow;</mo><mi>&infin;</mi></mrow></munder>
<msub><mi>x</mi><mi>n</mi></msub>
</math>
exists and is unique.
</p>


<p class="noindent"> 
The sequence 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>(</mo><msub><mi>x</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>x</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>x</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>)</mo></math> 
<strong>diverges</strong> if it does not converge.
</p>

<p class="noindent"> 
Let 
<math xmlns="http://www.w3.org/1998/Math/MathML">
  <mi>X</mi>
</math> 
be a totally ordered set and let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>(</mo><msub><mi>x</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>x</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>x</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>)</mo></math> 
be a sequence in 
<math xmlns="http://www.w3.org/1998/Math/MathML">
  <mi>X</mi>
</math>.  The <strong>upper limit</strong> of
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>(</mo><msub><mi>x</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>x</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>x</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>)</mo></math> 
is
<table class="dispeq">
<tr><td class="eq">
<math xmlns="http://www.w3.org/1998/Math/MathML">
  <mi>lim</mi><mi>sup</mi><msub><mi>x</mi><mi>n</mi></msub>
<mo>=</mo>
<munder><mi>lim</mi><mrow><mi>n</mi><mo>&rightarrow;</mo><mi>&infin;</mi></mrow></munder>
<mi>sup</mi><mo>{</mo><msub><mi>x</mi><mi>n</mi></msub><mo>,</mo> 
<msub><mi>x</mi><mrow><mi>n</mi><mo>+</mo><mi>1</mi></mrow></msub><mo>,</mo>
<msub><mi>x</mi><mrow><mi>n</mi><mo>+</mo><mi>2</mi></mrow></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>}</mo>
</math>
</td></tr></table>
</p>

<p class="noindent"> 
Let 
<math xmlns="http://www.w3.org/1998/Math/MathML">
  <mi>X</mi>
</math> 
be a totally ordered set and let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>(</mo><msub><mi>x</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>x</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>x</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>)</mo></math> 
be a sequence in 
<math xmlns="http://www.w3.org/1998/Math/MathML">
  <mi>X</mi>
</math>.  The <strong>lower limit</strong> of
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>(</mo><msub><mi>x</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>x</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>x</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>)</mo></math> 
is
<table class="dispeq">
<tr><td class="eq">
<math xmlns="http://www.w3.org/1998/Math/MathML">
  <mi>lim</mi><mi>inf</mi><msub><mi>x</mi><mi>n</mi></msub>
<mo>=</mo>
<munder><mi>lim</mi><mrow><mi>n</mi><mo>&rightarrow;</mo><mi>&infin;</mi></mrow></munder>
<mi>inf</mi><mo>{</mo><msub><mi>x</mi><mi>n</mi></msub><mo>,</mo> 
<msub><mi>x</mi><mrow><mi>n</mi><mo>+</mo><mi>1</mi></mrow></msub><mo>,</mo>
<msub><mi>x</mi><mrow><mi>n</mi><mo>+</mo><mi>2</mi></mrow></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>}</mo>
</math>
</td></tr></table>
</p>


<p class="noindent"> 
A sequence
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>(</mo><msub><mi>x</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>x</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>x</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>)</mo></math> 
is <strong>bounded</strong> if the set
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>{</mo><msub><mi>x</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>x</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>x</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>}</mo></math> 
has an upper bound.
</p>

<p class="noindent"> 
A sequence
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>(</mo><msub><mi>x</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>x</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>x</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>)</mo></math> 
is <strong>monotonically increasing</strong> if it satisfies
if <math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>i</mi><mo>&isin;</mo><msub><mi>&Zopf;</mi><mrow><mo>&gt;</mo><mn>0</mn></mrow></msub>
</math>
then
<math xmlns="http://www.w3.org/1998/Math/MathML">
<msub><mi>x</mi><mi>i</mi></msub>
<mo>&ge;</mo>
<msub><mi>x</mi><mrow><mi>i</mi><mo>+</mo><mn>1</mn></mrow></msub>
</math>.
</p>

<p class="noindent"> 
A sequence
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>(</mo><msub><mi>x</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>x</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>x</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>)</mo></math> 
is <strong>monotonically decreasing</strong> if it satisfies
if <math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>i</mi><mo>&isin;</mo><msub><mi>&Zopf;</mi><mrow><mo>&gt;</mo><mn>0</mn></mrow></msub>
</math>
then
<math xmlns="http://www.w3.org/1998/Math/MathML">
<msub><mi>x</mi><mi>i</mi></msub>
<mo>&le;</mo>
<msub><mi>x</mi><mrow><mi>i</mi><mo>+</mo><mn>1</mn></mrow></msub>
</math>.
</p>

<h2 class="section"> Series </h2>

<p class="noindent"> 
Let 
<math xmlns="http://www.w3.org/1998/Math/MathML">
  <mi>X</mi>
</math> 
be a set and let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>(</mo><msub><mi>x</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>x</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>x</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>)</mo></math> 
be a sequence in 
<math xmlns="http://www.w3.org/1998/Math/MathML">
  <mi>X</mi>
</math>.
The <strong>series</strong>
<math xmlns="http://www.w3.org/1998/Math/MathML">
<munderover><mo>&sum;</mo><mrow><mi>n</mi><mo>=</mo><mn>1</mn></mrow>
<mo>&infin;</mo></munderover>
<msub><mi>a</mi><mi>n</mi></msub>
</math> is
<table class="dispeq">
<tr><td class="eq">
the sequence
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mspace width="2em"/>
<mo>(</mo><msub><mi>s</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>s</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>s</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>)</mo>
<mspace width="2em"/>
<mtext>where</mtext>
<mspace width="2em"/>
<msub><mi>s</mi><mi>k</mi></msub>
<mo>=</mo>
<msub><mi>a</mi><mi>1</mi></msub><mo>+</mo> 
<msub><mi>a</mi><mi>2</mi></msub><mo>+</mo>
  <mo>&hellip;</mo>
<msub><mi>a</mi><mi>k</mi></msub><mo>.</mo>
</math> 
</td>
</tr></table>
Write
<table class="dispeq">
<tr><td class="eq">
<math xmlns="http://www.w3.org/1998/Math/MathML">
<munderover><mo>&sum;</mo><mrow><mi>n</mi><mo>=</mo><mn>1</mn></mrow>
<mo>&infin;</mo></munderover>
<msub><mi>a</mi><mi>n</mi></msub>
<mo>=</mo><mi>a</mi>
<mspace width="2em"/>
<mtext>if</mtext>
<mspace width="2em"/>
<munder><mi>lim</mi><mrow><mi>n</mi><mo>&rightarrow;</mo><mi>&infin;</mi></mrow></munder>
<msub><mi>s</mi><mi>n</mi></msub>
<mo>=</mo><mi>a</mi><mo>.</mo>
</math>
</td></tr></table>
</p>

<p class="noindent"> 
The series
<math xmlns="http://www.w3.org/1998/Math/MathML">
<munderover><mo>&sum;</mo><mrow><mi>n</mi><mo>=</mo><mn>1</mn></mrow>
<mo>&infin;</mo></munderover>
<msub><mi>a</mi><mi>n</mi></msub>
</math> <strong>converges</strong> if the sequence
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>(</mo><msub><mi>s</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>s</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>s</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>)</mo>
</math>
converges.
</p>

<p class="noindent"> 
The series
<math xmlns="http://www.w3.org/1998/Math/MathML">
<munderover><mo>&sum;</mo><mrow><mi>n</mi><mo>=</mo><mn>1</mn></mrow>
<mo>&infin;</mo></munderover>
<msub><mi>a</mi><mi>n</mi></msub>
</math> <strong>diverges</strong> if the sequence
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>(</mo><msub><mi>s</mi><mi>1</mi></msub><mo>,</mo> 
<msub><mi>s</mi><mi>2</mi></msub><mo>,</mo>
<msub><mi>s</mi><mi>3</mi></msub><mo>,</mo>
  <mo>&hellip;</mo>
<mo>)</mo>
</math>
diverges.
</p>

<p class="noindent"> 
The series
<math xmlns="http://www.w3.org/1998/Math/MathML">
<munderover><mo>&sum;</mo><mrow><mi>n</mi><mo>=</mo><mn>1</mn></mrow>
<mo>&infin;</mo></munderover>
<msub><mi>a</mi><mi>n</mi></msub>
</math> <strong>converges absolutely</strong> if the series
<math xmlns="http://www.w3.org/1998/Math/MathML">
<munderover><mo>&sum;</mo><mrow><mi>n</mi><mo>=</mo><mn>1</mn></mrow>
<mo>&infin;</mo></munderover>
<mo>&vert;</mo><msub><mi>a</mi><mi>n</mi></msub><mo>&vert;</mo>
</math> converges.
</p>


<div class="theorem">
Suppose that 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<munderover><mo>&sum;</mo><mrow><mi>n</mi><mo>=</mo><mn>1</mn></mrow>
<mo>&infin;</mo></munderover>
<msub><mi>a</mi><mi>n</mi></msub>
<mo>=</mo><mi>a</mi></math>
and 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<munderover><mo>&sum;</mo><mrow><mi>n</mi><mo>=</mo><mn>1</mn></mrow>
<mo>&infin;</mo></munderover>
<msub><mi>a</mi><mi>n</mi></msub>
</math>
converges absolutely. Then
<ol>
<li>
Every rearrangement of 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<munderover><mo>&sum;</mo><mrow><mi>n</mi><mo>=</mo><mn>1</mn></mrow>
<mo>&infin;</mo></munderover>
<msub><mi>a</mi><mi>n</mi></msub>
</math>
converges to 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>a</mi></math>.
</li>
<li>
If 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<munderover><mo>&sum;</mo><mrow><mi>n</mi><mo>=</mo><mn>1</mn></mrow>
<mo>&infin;</mo></munderover>
<msub><mi>b</mi><mi>n</mi></msub>
</math>
is a series and 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<munderover><mo>&sum;</mo><mrow><mi>n</mi><mo>=</mo><mn>1</mn></mrow>
<mo>&infin;</mo></munderover>
<msub><mi>b</mi><mi>n</mi></msub>
<mo>=</mo><mi>b</mi></math>
then
<math xmlns="http://www.w3.org/1998/Math/MathML">
<munderover><mo>&sum;</mo><mrow><mi>n</mi><mo>=</mo><mn>1</mn></mrow>
<mo>&infin;</mo></munderover>
<msub><mi>a</mi><mi>n</mi></msub>
<msub><mi>b</mi><mi>n</mi></msub>
<mo>=</mo><mi>a</mi><mi>b</mi></math>. IS THIS RIGHT? IT IS DIFFERENT FROM THE
ORIGINAL NOTES.
</li>
</ol>
</div>




<h2 class="section"> References </h2>

<p>
<a name="[BG]" id="[BG]"> [BG] </a> 
<a href="http://www.math.brown.edu/faculty/braverman.html">
A. Braverman</a> and 
<a href="http://www.math.harvard.edu/~gaitsgde/"> 
D. Gaitsgory </a>, 
<a href="http://projecteuclid.org/DPubS?service=Repository&amp;version=1.0&amp;verb=Disseminate&amp;handle=euclid.dmj/1091737024&amp;view=body&amp;content-type=pdf_1#" title="View PDF">
<em> Crystals via the affine Grassmanian</em></a>, 
<a href="http://www.dukeupress.edu/dmj/">Duke Math. J.</a> 
<a href="http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;page=toc&amp;handle=euclid.dmj/1091737018">
<strong>107</strong> no. 3,</a> (2001), 561-575;  
<a href="http://arxiv.org/abs/math.AG/9909077v2?front">
arXiv:math/9909077v2</a>, 
<a href="http://www.ams.org/mathscinet-getitem?mr=1828302">
MR1828302 (2002e:20083)</a>
</p>


</body>
</html>
