2.1 A complex number z is said to be algebraic if there are integers a0 , . . .

, an , not all
zero, such that Rudin’s Ex. 2
a0 z n + a1 z n−1 + · · · + an−1 z + an = 0.
Prove that the set of all algebraic numbers are countable.
Proof For each fixed integer n, put

Pn = {a0 z n + · · · + an−1 z + an : ai ∈ Z, i = 0, 1, . . . , n} .

Pn is the set of polynomials of degree n or less. The mapping

a0 z n + · · · + an−1 z + an 7→ (a0 , . . . , an−1 , an )

is a bijective from Pn to Zn+1 . By Theorem S∞ 2.13, Pn is countable. The set of

all polynomials with integer coefficients is n=0 Pn , which is a countable union of
countable sets and so countable. Since each polynomial of degree n has at most n
roots, so the set of all possible roots of all polynomials with integer coefficients is a
countable union of finite sets, hence at most countable. It is obvious that the set is
not finite, so the set of all algebraic numbers are countable.