<?xml version="1.0" encoding="UTF-8"?>

<record version="5" id="6315">
 <title>F\"urstenberg's proof of the infinitude of primes</title>
 <name>FurstenbergsProofOfTheInfinitudeOfPrimes</name>
 <created>2004-10-07 12:24:45</created>
 <modified>2006-10-25 00:22:58</modified>
 <type>Proof</type>
<parent id="438">prime</parent>
 <selfproof>0</selfproof>
 <creator id="2727" name="mathcam"/>
 <author id="2727" name="mathcam"/>
 <classification>
	<category scheme="msc" code="11A41"/>
 </classification>
 <related>
	<object name="HausdorffSpaceNotCompletelyHausdorff"/>
 </related>
 <preamble>% this is the default PlanetMath preamble.  as your knowledge
% of TeX increases, you will probably want to edit this, but
% it should be fine as is for beginners.

% almost certainly you want these
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{amsthm}

% used for TeXing text within eps files
%\usepackage{psfrag}
% need this for including graphics (\includegraphics)
%\usepackage{graphicx}
% for neatly defining theorems and propositions
%\usepackage{amsthm}
% making logically defined graphics
%\usepackage{xypic}

% there are many more packages, add them here as you need them

% define commands here

\newcommand{\mc}{\mathcal}
\newcommand{\mb}{\mathbb}
\newcommand{\mf}{\mathfrak}
\newcommand{\ol}{\overline}
\newcommand{\ra}{\rightarrow}
\newcommand{\la}{\leftarrow}
\newcommand{\La}{\Leftarrow}
\newcommand{\Ra}{\Rightarrow}
\newcommand{\nor}{\vartriangleleft}
\newcommand{\Gal}{\text{Gal}}
\newcommand{\GL}{\text{GL}}
\newcommand{\Z}{\mb{Z}}
\newcommand{\R}{\mb{R}}
\newcommand{\Q}{\mb{Q}}
\newcommand{\C}{\mb{C}}
\newcommand{\&lt;}{\langle}
\renewcommand{\&gt;}{\rangle}</preamble>
 <content>F\"urstenberg's proof (\cite{fberg}, \cite{priben}) that there are infinitely many primes is an amusing and beautiful blend of elementary number theory and point-set topology.

Consider the arithmetic progression topology on the positive integers, where a basis of open sets is given by subsets of the form $U_{a,b}=\{n\in\Z^+|n\equiv b\mod a\}$.  Arithmetic progressions themselves are by definition open, and in fact clopen, since

\begin{align*}
U_{a,b}^c=\bigcup_{c\neq b} U_{a,c}
\end{align*}

where the union is taken over a set of distinct residue classes modulo $a$.  Hence the complement of $U_{a,b}$ is a union of open sets and so is open, so $U_{a,b}$ itself is closed (and hence clopen).

Consider the set $U=\cup_p U_{p,0}$, where the union runs over all primes $p$.  Then the complement of $U$ in $\Z^+$ is the single element $\{1\}$, which is clearly not an open set (every open set is infinite in this topology).  Thus $U$ is not closed, but since we have written $U$ as a union of closed sets and a \emph{\PMlinkescapetext{finite}} union of closed sets is again closed, this implies that there must be infinitely many terms appearing in that union, i.e. that there must be infinitely many distinct primes.

\begin{thebibliography}{9}
\bibitem{fberg} 
Furstenberg, Harry, 
\emph{On the infinitude of primes}, 
American Mathematical Monthly, Vol. 62, 1955, p. 353. 
\bibitem{priben}
Ribenboim, Paulo.  \emph{The New Book of Prime Number Records}.  Springer, 1996.  p. 10
\end{thebibliography}</content>
</record>
