<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0 plus SVG 1.1//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>Filters, Limit Points and Cluster Points</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>
	<script src="DWConfiguration/ActiveContent/IncludeFiles/AC_ActiveX.js" type="text/javascript"></script>
	<script src="DWConfiguration/ActiveContent/IncludeFiles/AC_RunActiveContent.js" type="text/javascript"></script>
</head>

<body>
<div style="max-width:50em; margin-left:auto; margin-right:auto;">
<h2 class="title">Filters, Limit Points and Cluster Points</h2>

<p class="author">
	Arun Ram <br />
	Department of Mathematics <br />
	University of Wisconsin, Madison <br />
	Madison, WI 53706 USA <br />
	ram@math.wisc.edu <br />
	<br />
	and <br />
	<br />
	Department of Mathematics and Statistics <br />
	University of Melbourne <br />
	Parkville, VIC 3010 Australia <br />
	aram@unimelb.edu.au
</p>

<p>Last updates: 16 September 2009</p>

<h2 class="section">Filters</h2>

<p>
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	be a set.  A <strong>filter</strong> on
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	is a collection
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>&Fscr;</mi>
	</mrow></math>
	of subsets of
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	such that
	<ol type="a">
		<li>
			if
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<mi>E</mi>
				<mo>&sube;</mo>
				<mi>X</mi>
			</mrow></math>
			such that there exists
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<mi>U</mi>
				<mo>&isin;</mo>
				<mi>&Fscr;</mi>
			</mrow></math>
			with
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<mi>E</mi>
				<mo>&supe;</mo>
				<mi>U</mi>
			</mrow></math>
			then
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<mi>E</mi>
				<mo>&isin;</mo>
				<mi>&Fscr;</mi>
			</mrow></math>,
		</li>
		<li>
			finite intersections of elements of
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<mi>&Fscr;</mi>
			</mrow></math>
			are in
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<mi>&Fscr;</mi>
			</mrow></math>,
		</li>
		<li>
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<mi>&empty;</mi>
				<mo>&notin;</mo>
				<mi>&Fscr;</mi>
			</mrow></math>.
		</li>
	</ol>
</p>
<p>
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	be a set and let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<msub>
			<mi>&Fscr;</mi>
			<mn>1</mn>
		</msub>
	</mrow></math>
	and
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<msub>
			<mi>&Fscr;</mi>
			<mn>2</mn>
		</msub>
	</mrow></math>
	be filters on
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>.
	The filter
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<msub>
			<mi>&Fscr;</mi>
			<mn>1</mn>
		</msub>
	</mrow></math>
	is <strong>finer</strong> than
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<msub>
			<mi>&Fscr;</mi>
			<mn>2</mn>
		</msub>
	</mrow></math>
	if
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<msub>
			<mi>&Fscr;</mi>
			<mn>1</mn>
		</msub>
		<mo>&supe;</mo>
		<msub>
			<mi>&Fscr;</mi>
			<mn>2</mn>
		</msub>
	</mrow></math>.
</p>
<p>
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	be a topological space and let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>x</mi>
		<mo>&isin;</mo>
		<mi>X</mi>
	</mrow></math>.
	The <strong>neighbourhood filter</strong> of
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>x</mi>
	</mrow></math>
	is the collection
	<math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow>
		<mi>&Fscr;</mi>
		<mo>=</mo>
		<mfenced open="{" close="}" separators=",">
			<mrow>
				<mtext>neighbourhoods of&nbsp;</mtext>
				<mi>x</mi>
			</mrow>
		</mfenced>
		<mtext>.</mtext>
	</mrow></math>
</p>
<p>
	The <strong>Fréchet filter</strong> on
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<msub>
			<mi>&Zopf;</mi>
			<mrow>
				<mo>&gt;</mo>
				<mn>0</mn>
			</mrow>
		</msub>
	</mrow></math>
	is the collection
	<math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow>
		<mi>&Fscr;</mi>
		<mo>=</mo>
		<mfenced open="{" close="}" separators=",">
			<mrow>
				<mtext>complements of finite sets of&nbsp;</mtext>
				<msub>
					<mi>&Zopf;</mi>
					<mrow>
						<mo>&gt;</mo>
						<mn>0</mn>
					</mrow>
				</msub>
			</mrow>
		</mfenced>
		<mtext>.</mtext>
	</mrow></math>
</p>
<p>
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>&Fscr;</mi>
	</mrow></math>
	be a filter on a set
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>.
	A <strong>filter base</strong> of
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>&Fscr;</mi>
	</mrow></math>
	is a collection
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>&Bscr;</mi>
	</mrow></math>
	of subsets of
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	such that
	<math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow>
		<mi>&Fscr;</mi>
		<mo>=</mo>
		<mfenced open="{" close="}" separators=",">
			<mrow>
				<mtext>subsets of&nbsp;</mtext>
				<mi>X</mi>
				<mtext>&nbsp;that contain a set in&nbsp;</mtext>
				<mi>&Bscr;</mi>
			</mrow>
		</mfenced>
		<mtext>.</mtext>
	</mrow></math>
</p><p>
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>&Fscr;</mi>
	</mrow></math>
	be a filter on a set
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>.
	A <strong>subbase</strong> of
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>&Fscr;</mi>
	</mrow></math>
	is a collection
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>&Sscr;</mi>
	</mrow></math>
	<strong>[SCRIPT S NOT DISPLAYING ON MY MACHINE]</strong> of subsets of
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	such that
	<math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow>
		<mi>&Bscr;</mi>
		<mo>=</mo>
		<mfenced open="{" close="}" separators=",">
			<mrow>
				<mtext>finite intersections of elements of&nbsp;</mtext>
				<mi>&Sscr;</mi>
			</mrow>
		</mfenced>
	</mrow></math>
	is a base of the filter
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>&Fscr;</mi>
	</mrow></math>.
</p>

<h2 class="section">Limit points and cluster points</h2>

<p>
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	be a set and let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>&Fscr;</mi>
	</mrow></math>
	be a filter on
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>.
	A <strong>limit point</strong> of
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>&Fscr;</mi>
	</mrow></math>
	is a point
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>x</mi>
		<mo>&isin;</mo>
		<mi>X</mi>
	</mrow></math>
	such that the neighbourhood filter of
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>x</mi>
	</mrow></math>
	is finer than
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>&Fscr;</mi>
	</mrow></math>.
</p>
<p>
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	be a set and let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>&Bscr;</mi>
	</mrow></math>
	be a filter base of a filter
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>&Fscr;</mi>
	</mrow></math>
	on
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>.
	A <strong>cluster point</strong> of
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>&Bscr;</mi>
	</mrow></math>
	is a point
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>x</mi>
		<mo>&isin;</mo>
		<mi>X</mi>
	</mrow></math>
	such that
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>x</mi>
	</mrow></math>
	is in the closure of each set in
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>&Bscr;</mi>
	</mrow></math>.
</p>
<p>
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	be a set with a filter
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>&Fscr;</mi>
	</mrow></math>
	and let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>Y</mi>
	</mrow></math>
	be a topological space.  Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>f</mi>
		<mo>:</mo>
		<mi>X</mi>
		<mo>&rarr;</mo>
		<mi>Y</mi>
	</mrow></math>
	be a function. 
</p>
<p>
	A <strong>limit point</strong> of
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>f</mi>
		<mo>:</mo>
		<mi>X</mi>
		<mo>&rarr;</mo>
		<mi>Y</mi>
	</mrow></math>
	is a limit point of the filter base
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>f</mi>
		<mfenced open="(" close=")" separators=",">
			<mi>&Fscr;</mi>
		</mfenced>
	</mrow></math>.
	Write
	<p align="center">
		<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
			<mi>y</mi>
			<mo>=</mo>
			<munder>
				<mo>lim</mo>
				<mi>&Fscr;</mi>
			</munder>
			<mi>f</mi>
			<mfenced open="(" close=")" separators=",">
				<mi>x</mi>
			</mfenced>
		</mrow></math>
		if 
		<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
			<mi>y</mi>
		</mrow></math>
		is a limit point of
		<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
			<mi>f</mi>
		</mrow></math>.
	</p>
</p>
<p>
	A <strong>cluster point</strong> of
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>f</mi>
		<mo>:</mo>
		<mi>X</mi>
		<mo>&rarr;</mo>
		<mi>Y</mi>
	</mrow></math>
	is a cluster point of the filter base
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>f</mi>
		<mfenced open="(" close=")" separators=",">
			<mi>&Fscr;</mi>
		</mfenced>
	</mrow></math>.
</p>
<p>
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	be a set.  A <strong>sequence</strong>
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mfenced open="(" close=")" separators=",">
			<msub>
				<mi>x</mi>
				<mn>1</mn>
			</msub>
			<msub>
				<mi>x</mi>
				<mn>2</mn>
			</msub>
			<msub>
				<mi>x</mi>
				<mn>3</mn>
			</msub>
			<mo>&hellip;</mo>
		</mfenced>
	</mrow></math>
	of points in
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	is a function
	<math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow>
		<mtable columnalign="right center left">
			<mtr>
				<mtd>
					<msub>
						<mi>&Zopf;</mi>
						<mrow>
							<mo>&gt;</mo>
							<mn>0</mn>
						</mrow>
					</msub>
				</mtd>
				<mtd>
					<mo>&xrarr;</mo>
				</mtd>
				<mtd>
					<mi>X</mi>
				</mtd>
			</mtr>
			<mtr>
				<mtd>
					<mi>n</mi>
				</mtd>
				<mtd>
					<mo>&xmap;</mo>
				</mtd>
				<mtd>
					<msub>
						<mi>x</mi>
						<mi>n</mi>
					</msub>
				</mtd>
			</mtr>
		</mtable>
	</mrow></math>.
</p>
<p>
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	be a set and let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mfenced open="(" close=")" separators=",">
			<msub>
				<mi>x</mi>
				<mn>1</mn>
			</msub>
			<msub>
				<mi>x</mi>
				<mn>2</mn>
			</msub>
			<msub>
				<mi>x</mi>
				<mn>3</mn>
			</msub>
			<mo>&hellip;</mo>
		</mfenced>
	</mrow></math>
	be a sequence in
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>.
	A <strong>limit</strong> of the sequence
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mfenced open="(" close=")" separators=",">
			<msub>
				<mi>x</mi>
				<mn>1</mn>
			</msub>
			<msub>
				<mi>x</mi>
				<mn>2</mn>
			</msub>
			<mo>&hellip;</mo>
		</mfenced>
	</mrow></math>
	is a limit point of the sequence with respect to the Fréchet filter on
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<msub>
			<mi>&Zopf;</mi>
			<mn>0</mn>
		</msub>
	</mrow></math>
	. Write
	<math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow>
		<mi>y</mi>
		<mo>=</mo>
		<munder>
			<mo>lim</mo>
			<mrow>
				<mi>n</mi>
				<mo>&rarr;</mo>
				<mi>&infin;</mi>
			</mrow>
		</munder>
		<mi>f</mi>
		<mfenced open="(" close=")" separators=",">
			<msub>
				<mi>x</mi>
				<mi>n</mi>
			</msub>
		</mfenced>
	</mrow></math>
	<strong>[I ASSUME THIS WAS SUPPOSED TO BE x_n NOT x]</strong> if
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>y</mi>
	</mrow></math>
	is a limit of the sequence
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mfenced open="(" close=")" separators=",">
			<msub>
				<mi>x</mi>
				<mn>1</mn>
			</msub>
			<msub>
				<mi>x</mi>
				<mn>2</mn>
			</msub>
			<mo>&hellip;</mo>
		</mfenced>
	</mrow></math>.
</p>
<p>
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	be a set and let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mfenced open="(" close=")" separators=",">
			<msub>
				<mi>x</mi>
				<mn>1</mn>
			</msub>
			<msub>
				<mi>x</mi>
				<mn>2</mn>
			</msub>
			<mo>&hellip;</mo>
		</mfenced>
	</mrow></math>
	be a sequence in
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>.
	A <strong>cluster point</strong> of the sequence
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mfenced open="(" close=")" separators=",">
			<msub>
				<mi>x</mi>
				<mn>1</mn>
			</msub>
			<msub>
				<mi>x</mi>
				<mn>2</mn>
			</msub>
			<mo>&hellip;</mo>
		</mfenced>
	</mrow></math>
	is a cluster point of the sequence with respect to the Fréchet filter on
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<msub>
			<mi>&Zopf;</mi>
			<mrow>
				<mo>&gt;</mo>
				<mn>0</mn>
			</mrow>
		</msub>
	</mrow></math>.
</p>
<p>
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	and
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>Y</mi>
	</mrow></math>
	be topological spaces.  Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>a</mi>
		<mo>&isin;</mo>
		<mi>X</mi>
	</mrow></math>.
	A <strong>limit of</strong>
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>f</mi>
		<mfenced open="(" close=")" separators=",">
			<mi>x</mi>
		</mfenced>
	</mrow></math>
	<strong>as</strong>
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>x</mi>
	</mrow></math>
	<strong>approaches</strong>
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>a</mi>
	</mrow></math>
	is a limit point of
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>f</mi>
	</mrow></math>
	with respect to the neighbourhood filter of
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>a</mi>
	</mrow></math>.
	Write
	<math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow>
		<mi>y</mi>
		<mo>=</mo>
		<munder>
			<mo>lim</mo>
			<mrow>
				<mi>x</mi>
				<mo>&rarr;</mo>
				<mi>a</mi>
			</mrow>
		</munder>
		<mi>f</mi>
		<mfenced open="(" close=")" separators=",">
			<mi>x</mi>
		</mfenced>
		<mtext>,</mtext>
	</mrow></math>
	if
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>y</mi>
	</mrow></math>
	is a limit of
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>f</mi>
		<mfenced open="(" close=")" separators=",">
			<mi>x</mi>
		</mfenced>
	</mrow></math>
	as
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>x</mi>
	</mrow></math>
	approaches
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>a</mi>
	</mrow></math>.
</p>
<p>
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	and
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>Y</mi>
	</mrow></math>
	be topological spaces and let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>a</mi>
		<mo>&isin;</mo>
		<mi>X</mi>
	</mrow></math>.
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>f</mi>
		<mo>:</mo>
		<mi>X</mi>
		<mo>&rarr;</mo>
		<mi>Y</mi>
	</mrow></math>
	be a function.  The function
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>f</mi>
	</mrow></math>
	is <strong>continuous at</strong>
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>a</mi>
	</mrow></math>
	if it satisfies the condition,
	<p align="center">
		if
		<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
			<mi>N</mi>
		</mrow></math>
		is a neighbourhood of
		<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
			<mi>f</mi>
			<mfenced open="(" close=")" separators=",">
				<mi>x</mi>
			</mfenced>
		</mrow></math>
		in
		<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
			<mi>Y</mi>
		</mrow></math>,
		then
		<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
			<msup>
				<mi>f</mi>
				<mrow>
					<mo>-</mo>
					<mn>1</mn>
				</mrow>
			</msup>
		</mrow></math>
		is a neighbourhood of
		<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
			<mi>a</mi>
		</mrow></math>
		in
		<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
			<mi>X</mi>
		</mrow></math>.
	</p>
</p>
<div class="theorem">
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	and
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>Y</mi>
	</mrow></math>
	be topological spaces and let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>a</mi>
		<mo>&isin;</mo>
		<mi>X</mi>
	</mrow></math>.
	A function
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>f</mi>
		<mo>:</mo>
		<mi>X</mi>
		<mi>&rarr;</mi>
		<mi>Y</mi>
	</mrow></math>
	is continuous at
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>a</mi>
	</mrow></math>
	if and only if
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<msub>
			<mo>lim</mo>
			<mrow>
				<mi>x</mi>
				<mo>&rarr;</mo>
				<mi>a</mi>
			</mrow>
		</msub>
		<mi>f</mi>
		<mfenced open="(" close=")" separators=",">
			<mi>x</mi>
		</mfenced>
		<mo>=</mo>
		<mi>f</mi>
		<mfenced open="(" close=")" separators=",">
			<mi>a</mi>
		</mfenced>
	</mrow></math>.
</div><br />
<div class="theorem">
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>
	be a topological space and let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mfenced open="(" close=")" separators=",">
			<msub>
				<mi>x</mi>
				<mn>1</mn>
			</msub>
			<msub>
				<mi>x</mi>
				<mn>2</mn>
			</msub>
			<mo>&hellip;</mo>
		</mfenced>
	</mrow></math>
	be a sequence in
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>X</mi>
	</mrow></math>.
	Then
	<ol type="a">
		<li>
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<mi>y</mi>
			</mrow></math>
			is a limit point of
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<mfenced open="(" close=")" separators=",">
					<msub>
						<mi>x</mi>
						<mn>1</mn>
					</msub>
					<msub>
						<mi>x</mi>
						<mn>2</mn>
					</msub>
					<mo>&hellip;</mo>
				</mfenced>
			</mrow></math>
			if and only if, if
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<msub>
					<mi>N</mi>
					<mi>y</mi>
				</msub>
			</mrow></math>
			is a neighbourhood of
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<mi>y</mi>
			</mrow></math>
			then there exists
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<msub>
					<mi>n</mi>
					<mn>0</mn>
				</msub>
				<mo>&isin;</mo>
				<msub>
					<mi>&Zopf;</mi>
					<mrow>
						<mo>&gt;</mo>
						<mi>0</mi>
					</mrow>
				</msub>
			</mrow></math>
			such that
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<msub>
					<mi>x</mi>
					<mi>n</mi>
				</msub>
				<mo>&isin;</mo>
				<msub>
					<mi>N</mi>
					<mi>x</mi>
				</msub>
			</mrow></math>
			for all
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<mi>n</mi>
				<mo>&isin;</mo>
				<mi>&Zopf;</mi>
				<mtext>,&nbsp;</mtext>
				<mi>n</mi>
				<mo>&ge;</mo>
				<msub>
					<mi>n</mi>
					<mn>0</mn>
				</msub>
			</mrow></math>.
		</li>
		<li>
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<mi>y</mi>
			</mrow></math>
			is a cluster point of
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<mfenced open="(" close=")" separators=",">
					<msub>
						<mi>x</mi>
						<mn>1</mn>
					</msub>
					<msub>
						<mi>x</mi>
						<mn>2</mn>
					</msub>
					<mo>&hellip;</mo>
				</mfenced>
			</mrow></math>
			if and only if, if
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<msub>
					<mi>N</mi>
					<mi>y</mi>
				</msub>
			</mrow></math>
			is a neighbourhood of
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<mi>y</mi>
			</mrow></math>
			and
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<msub>
					<mi>n</mi>
					<mn>0</mn>
				</msub>
				<mo>&isin;</mo>
				<msub>
					<mi>&Zopf;</mi>
					<mrow>
						<mo>&ge;</mo>
						<mn>0</mn>
					</mrow>
				</msub>
			</mrow></math>
			then there exists
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<mi>n</mi>
				<mo>&isin;</mo>
				<msub>
					<mi>&Zopf;</mi>
					<mrow>
						<mo>&gt;</mo>
						<mi>0</mi>
					</mrow>
				</msub>
			</mrow></math>
			with
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<mi>n</mi>
				<mo>&ge;</mo>
				<msub>
					<mi>n</mi>
					<mn>0</mn>
				</msub>
			</mrow></math>
			such that
			<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
				<msub>
					<mi>x</mi>
					<mi>n</mi>
				</msub>
				<mo>&isin;</mo>
				<msub>
					<mi>N</mi>
					<mi>y</mi>
				</msub>
			</mrow></math>.
		</li>
	</ol>
</div><br />

<h2 class="section">References <b>[PLACEHOLDER]</b></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>
</div>
</body>
</html>
