Are The Algebraic Numbers Countable?

A number α R \alpha \in \mathbb{R} is called algebraic if there exists a polynomial p ( x ) p(x) with rational coefficients such that p ( α ) = 0 p(\alpha) = 0 .

Let S R S \subset \mathbb{R} denote the set of algebraic numbers. Which of the following is true of S ? S?

S S is finite S S is countably infinite S S is uncountably infinite

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Q \mathbb{Q} , rational numbers set is a countable infinite set. I mean, there exists a bijective function f : N Q f:\mathbb{N} \rightarrow \mathbb{Q} where N \mathbb{N} is natural numbers set. Now, each algebraic number α \alpha is a root of a polinomyal p ( x ) p(x) with rational coefficients. Let n n be the degree of the polynomial p ( x ) p(x) . Then every polynomial with rational coefficients of degree n n can be seen as a element of Q n + 1 \mathbb{Q}^{n + 1} where Q n + 1 |\mathbb{Q}^{n + 1}| is countable infinite due to a finite product of countable sets is a countable set. By this way, all polynomials with rational coefficients can be seen as contained in i = 1 Q i \cup_{i =1}^\infty \mathbb{Q}^{i} , with i N i \in \mathbb{N} and every set of this union is a countable infinite set. Therefore, due to countable infinite union of countable infinite sets is a countable infinite set, i = 1 Q i \cup_{i=1}^\infty \mathbb{Q}^i is a countable infinite set, and then we can say that the set of the all polynomial with rational coefficients is a countable infinite set,and because of this we can infire that the set of algebraic numbers S S is a countable infinite set, because cardinal of Q = Q cardinal of S = S \text{cardinal of Q} = |\mathbb{Q}| \leq \text{cardinal of S} = |S| \leq { polynomial with rational coefficients } i = 1 Q i = Q \leq|\{ \text{polynomial with rational coefficients}\}| \leq |\cup_{i=1}^\infty \mathbb{Q}^i| = |\mathbb{Q}| .

(Applying Schroeder-Bernstein Theorem.- If A and B are sets and A B A |A| \leq |B| \leq |A| , then |A| = |B|.)

guillermo templado you have written the union of infinite sets is countable .this is right but the carttesion product of infinte sets is uncountable , so can u explain me how have u done that?

Log in to reply

The union countable of infinite sets countable is countable, and the finite cartesian product of infinite countable set is countable... It's sufficies to prove it by induction and for 2 sets, respectively. Right now, it's not easy for me, an exhaustive explanation of these facts...

Guillermo Templado - 3 years ago
Cantdo Math
May 7, 2020

For each degree starting from one , we can make a list of all the possible coefficients set since it is countably infinite i.e. at first we create a list of all the coefficients set of degree 1 polynomial and then degree 2 polynomial and so on. Hence,the number of rational polynomials are countably infinite.

Now for each of the algebraic numbers there exist some coefficients set (more than one ).But we only define a mapping from algebraic numbers to the minimal polynomial which has the number as the root.In this way,there is a bijection between all those countably infinite polynomials and the algebraic numbers

Hence in this way we can make a bijection between natural numbers and algebraic numbers ,the answer is indeed countably infinite.

My explanation is motivated by this wiki cardinality Specifically the part where they show the bijection between the rational and natural numbers.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...