= Countability of algebraic numbers
The <polynomials> over the <integers> form a <countable set>, because they are finite lists of <integers>. Every nonzero <polynomial> has finitely many <polynomial roots>, by the <Lagrange root bound over a field>. Each <algebraic number> is a <polynomial root> of one of these nonzero <polynomials> over the <integers>, so the <algebraic numbers> form a <countable union> of finite <sets> and are countable. They are infinite because they contain all <integers>. Excluding the zero <polynomial> is essential to the root-counting step.
Back to article page