Countability of Algebraic Numbers

September 30, 2024

This is a proof that the set of algebraic numbers is countable.

Be PnP_n the set of all polynomials with integer coefficients and degree less or equal to nn. We can observe that exists a bijection between PnP_n and Zn+1\mathbb{Z}^{n+1}, as we can write any polynomial as a0+a1x+a2x2++anxna_0 + a_1x + a_2x^2 + \ldots + a_nx^n So we can express the polynomial as a tuple (a0,a1,a2,,an)(a_0, a_1, a_2, \ldots, a_n). As the product of countable sets is countable, we can conclude that PnP_n is countable.

As each polynomial has a finite number of roots, the set:

An={xR:x is a root of some polynomial in Pn}A_n = \{x \in \mathbb{R} : x \text{ is a root of some polynomial in } P_n\}

Then, be Hn=i=0nAiH_n = \bigcup_{i=0}^{n} A_i, we can see that HnH_n is countable, as it is the countable union of countable sets.

Finally, be H=nNHnH = \bigcup_{n \in \mathbb{N^*}} H_n, we can see that HH is countable, as it is the countable union of countable sets. And HH is the set of all algebraic numbers, so we have proved that the set of algebraic numbers is countable.