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

<record version="11" id="6999">
 <title>algebraic numbers are countable</title>
 <name>AlgebraicNumbersAreCountable</name>
 <created>2005-05-02 15:26:00</created>
 <modified>2009-09-30 08:58:23</modified>
 <type>Theorem</type>
<parent id="209">algebraic number</parent>
 <creator id="2872" name="pahio"/>
 <author id="2872" name="pahio"/>
 <classification>
	<category scheme="msc" code="03E10"/>
	<category scheme="msc" code="11R04"/>
 </classification>
 <synonyms>
	<synonym concept="algebraic numbers are countable" alias="algebraic numbers may be set in a sequence"/>
 </synonyms>
 <related>
	<object name="HeightOfAnAlgebraicNumber2"/>
	<object name="ProofOfTheExistenceOfTranscendentalNumbers"/>
	<object name="A_nAreCountableSoIsA_1XXA_nIfA_1"/>
	<object name="ExamplesOfCountableSets"/>
 </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}

% 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

\theoremstyle{definition}
\newtheorem*{thmplain}{Theorem}</preamble>
 <content>\begin{thmplain}
The set of (a) all algebraic numbers, (b) the real algebraic numbers is countable.
\end{thmplain}

{\em Proof.}\, Let's consider the algebraic equations
\begin{align}
                 P(x) \;=\; 0
\end{align}
where 
     $$P(x) \;:=\; a_0x^n\!+\!a_1x^{n-1}\!+\!\ldots\!+\!a_{n-1}x\!+\!a_n$$
is an \PMlinkname{irreducible}{IrreduciblePolynomial2} and primitive polynomial with integer coefficients $a_j$ and\, $a_0 &gt; 0$.\, Each algebraic number \PMlinkescapetext{satisfies} exactly one such equation (see the minimal polynomial).\, For every integer\, $N = 2,\,3,\,4,\,\ldots$\, there exists a finite number of equations (1) such that
     $$n\!+\!a_0\!+\!|a_1|\!+\ldots+\!|a_n| \;=\; N$$
(e.g. if\, $N = 3$,\, then one has the equations\, $x\!-\!1 = 0$\, and\, 
$x\!+\!1 = 0$) and thus only a finite set of algebraic numbers as the \PMlinkescapetext{roots} of these equations.\, These algebraic numbers may be ordered to a \PMlinkname{finite sequence}{OrderedTuplet} $S_N$ using a \PMlinkescapetext{fixed ordering} system, for example by the magnitude of the real part and the imaginary part.\, When one forms the concatenated sequence
        $$S_2,\,S_3,\,S_4,\,\ldots$$
it comprises all algebraic numbers in a countable setting, which defines a bijection from the set onto $\mathbb{Z}_+$.

\begin{thebibliography}{9}
\bibitem{EK}{\sc E. Kamke:} {\em Mengenlehre}.\, Sammlung G\"oschen: Band 999/999a.\, -- Walter de Gruyter \&amp; Co., Berlin (1962).
\end{thebibliography}</content>
</record>
