<?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>Cardinality of Sets</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; 
	}
.unbulleted {
	list-style-type: none;
	}
</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">Cardinality of Sets</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: 25 September 2009</p>

<h2 class="section">Definition</h2>
<p>
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>S</mi>
	</mrow></math>
	and
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>T</mi>
	</mrow></math>
	be set.
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>S</mi>
	</mrow></math>
	and
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>T</mi>
	</mrow></math>
	have the same <strong>cardinality</strong>,
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mo>Card</mo>
		<mfenced open="(" close=")" separators=",">
			<mi>S</mi>
		</mfenced>
		<mo>=</mo>
		<mo>Card</mo>
		<mfenced open="(" close=")" separators=",">
			<mi>T</mi>
		</mfenced>
	</mrow></math>,
	if there is a bijective map from
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>S</mi>
	</mrow></math>
	to
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>T</mi>
	</mrow></math>.
</p>

<h2 class="section">Notation</h2>
<p>
	Let
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>S</mi>
	</mrow></math>
	be a set.  Then
	<math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><mrow>
		<mo>Card</mo>
		<mfenced open="(" close=")" separators=",">
			<mi>S</mi>
		</mfenced>
		<mo>=</mo>
		<mfenced open="{" close="" separators=",">
			<mtable columnalign="left left">
				<mtr>
					<mtd>
						<mn>0</mn>
					</mtd>
					<mtd>
						<mtext>if&nbsp;</mtext>
						<mi>S</mi>
						<mo>=</mo>
						<mi>&empty;</mi>
						<mtext>,</mtext>
					</mtd>
				</mtr>
				<mtr>
					<mtd>
						<mi>n</mi>
					</mtd>
					<mtd>
						<mtext>if&nbsp;</mtext>
						<mo>Card</mo>
						<mfenced open="(" close=")" separators=",">
							<mi>S</mi>
						</mfenced>
						<mo>=</mo>
						<mo>Card</mo>
						<mfenced open="(" close=")" separators=",">
							<mfenced open="{" close="}" separators=",">
								<mn>1</mn>
								<mn>2</mn>
								<mo>&hellip;</mo>
								<mi>n</mi>
							</mfenced>
						</mfenced>
						<mtext>,</mtext>
					</mtd>
				</mtr>
				<mtr>
					<mtd>
						<mn>&infin;</mn>
					</mtd>
					<mtd>
						<mtext>otherwise.</mtext>
					</mtd>
				</mtr>
			</mtable>
		</mfenced>
	</mrow></math>
</p>
<p>
	Note that even in the case where
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mo>Card</mo>
		<mfenced open="(" close=")" separators=",">
			<mi>S</mi>
		</mfenced>
		<mo>=</mo>
		<mi>&infin;</mi>
	</mrow></math>
	and
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mo>Card</mo>
		<mfenced open="(" close=")" separators=",">
			<mi>T</mi>
		</mfenced>
		<mo>=</mo>
		<mi>&infin;</mi>
	</mrow></math>,
	we may have that
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mo>Card</mo>
		<mfenced open="(" close=")" separators=",">
			<mi>S</mi>
		</mfenced>
		<mo>&ne;</mo>
		<mo>Card</mo>
		<mfenced open="(" close=")" separators=",">
			<mi>T</mi>
		</mfenced>
	</mrow></math>.
</p>

<h2 class="section">Definitions</h2>

<p>
	A set is
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>S</mi>
	</mrow></math>
	<strong>finite</strong> if
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mo>Card</mo>
		<mfenced open="(" close=")" separators=",">
			<mi>S</mi>
		</mfenced>
		<mo>&ne;</mo>
		<mi>&infin;</mi>
	</mrow></math>.
</p>
<p>
	A set
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>S</mi>
	</mrow></math>
	is <strong>infinite</strong> if 
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>S</mi>
	</mrow></math>
	is not finite.
</p>
<p>
	A set
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>S</mi>
	</mrow></math>
	is <strong>countable</strong> if either
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>s</mi>
	</mrow></math>
	is finite or
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mo>Card</mo>
		<mfenced open="(" close=")" separators=",">
			<mi>S</mi>
		</mfenced>
		<mo>=</mo>
		<mo>Card</mo>
		<mfenced open="(" close=")" separators=",">
			<msub>
				<mo>&Zopf;</mo>
				<mrow>
					<mo>&gt;</mo>
					<mn>0</mn>
				</mrow>
			</msub>
		</mfenced>
	</mrow></math>.
</p>
<p>
	A set
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>S</mi>
	</mrow></math>
	is <strong>countably infinite</strong> if
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>S</mi>
	</mrow></math>
	is countable and not finite.
</p>
<p>
	A set
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>S</mi>
	</mrow></math>
	is <strong>uncountable</strong> if
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mi>S</mi>
	</mrow></math>
	is not countable.
</p>

<h2 class="section">Homework</h2>

<p>
	Show that
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mo>Card</mo>
		<mfenced open="(" close=")" separators=",">
			<mi>&Ropf;</mi>
		</mfenced>
		<mo>=</mo>
		<mi>&infin;</mi>
	</mrow></math>,
	that
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mo>Card</mo>
		<mfenced open="(" close=")" separators=",">
			<mi>&Qopf;</mi>
		</mfenced>
		<mo>=</mo>
		<mi>&infin;</mi>
	</mrow></math>
	and that
	<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
		<mo>Card</mo>
		<mfenced open="(" close=")" separators=",">
			<mi>&Ropf;</mi>
		</mfenced>
		<mo>&ne;</mo>
		<mo>Card</mo>
		<mfenced open="(" close=")" separators=",">
			<mi>&Qopf;</mi>
		</mfenced>
	</mrow></math>.<mrow></mrow>
</p>

<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>

