The Continuum is Countable: Infinity is Unique

Since the theory developed by Georg Cantor, mathematicians have taken a sharp interest in the sizes of infinite sets. We know that the set of integers is infinitely countable and that its cardinality is ℵ 0 . Cantor proved in 1891 with the diagonal argument that the set of real numbers is uncountable and that there cannot be any bijection between integers and real numbers. The cardinality of the set of real numbers, the continuum, is c = ℵ 1 . Cantor states, in particular, the Continuum Hypothesis (CH) by which there is no set the size of which is between the set of integers and the set of real numbers. The power of the continuum is equal to 2 ℵ 0 which represents the cardinal of P (N), the set of all the subsets of N. Kurt Godel in 1939 and Paul Cohen in the 1960s have shown that the CH, which was mentioned by Hilbert as one of the more acute problems in mathematics in 1900 in Paris during the International Congress of Mathematics, was not provable. Paul Cohen showed that the Continuum Hypothesis is not provable under the Zermelo-Fraenkel set theory even if the axiom of choice is adopted (ZFC).

In this article, I show that the dimension of the set of integers is the same as the dimension of the real line. Cantor’s theory mentioned in fact that there were several dimensions for infinity. This, however, is questionable. Infinity can be thought as an absolute concept and there should not exist several dimensions for the infinite. As a matter of fact, if the set N is an infinite set it should be of same power as the set R. This has not been proven so far. We knew by several arguments, and in particular by the argument of Cantor’s diagonal, that the set R and N do not have the same cardinality and that there is no bijection between these two sets. In this paper, I show that there is a bijection between the set of integers and the set of real numbers. I show that the set R is countable and that there is only one dimension for infinite sets, ℵ. The paper is organized as follows. In a first section, I show that the set N can be represented by an infinite tree and that the cardinal of the set of integers is the same as the cardinal of the powerset of integers. In a second section, I show that the set of real numbers can be represented by an infinite tree and that it is countable. In a third section, I show again that the cardinality of P (N) is the same as the cardinality of N. In a fourth section, I define infinity. Finally, I make some concluding remarks.

In this section, I define an infinite tree bijective with N and I show that the cardinal of P (N)

is the same as the cardinal of N.

Proposition 2.1 There exists an infinite tree bijective with the set N.

Proof: Let us consider an infinite tree starting with 10 nodes (0,1,2,3,4,5,6,7,8,9). Each of these nodes except the node 0 gives rise to 10 branches. Each of these 10 branches defines another 10 nodes. Let us define each of these nodes by the numbers characterizing the unique path to reach a particular node. The first node of the tree is the number 0, below 0 there are the numbers (1, 2, . . . , 9). If now we consider the branches that start at node 1 they reach another 10 nodes.

These nodes are defined by the numbers ((10),(11), ( 12), ( 13), ( 14), (15), ( 16), ( 17), ( 18), ( 19)).

This tree is infinite and any node of the tree gives rise to another 10 nodes. All the numbers of these nodes describe, indeed, the set N. Hence, for any integer there exists a unique path in the tree and to any node of the tree there corresponds an integer (see Figure 1 and Figure 2). N is therefore represented by this infinite tree. The set of the nodes of this infinite tree is bijective with the set N.

This proposition shows that there exists an infinite tree that represents N. In the next proposition, I compute the cardinality of the powerset of N.

Proposition 2.2 ℵ 0 the cardinal of the set N is equal to 10 ℵ 0 .

Proof: Each integer is a node of the tree. The set of the nodes in the tree is bijective with the set of integers. When N is large, counting the number of nodes is the same as counting the number of paths (to infinity) in the tree. The cardinality of the set of the nodes of this infinite tree is 10 ℵ 0 counted 9 times. Indeed, we see in Figures 1 and2 that the set N is of cardinality (0, 1, 2, 3, 4, 5, 6, 7, 8, 9) N counted 9 times. This implies that the cardinality of the set N is 10 ℵ 0 .

As ℵ 0 represents the cardinal of N, which is by definition the cardinal of the set of the nodes in the tree (bijective with N), we get 10 ℵ 0 = ℵ 0 . Note already that this implies that 2 ℵ 0 = ℵ 0 .

This proposition shows that the cardinality of N, ℵ 0 , is equal to 10 ℵ 0 . In the next proposition, I compute the cardinality of the powerset of N.

Proposition 2.3 The cardinal of P (N), the powerset of N, is ℵ 0 .

Proof: Note that the tree representing the set N, which at each node links up with 10 branches, includes the infinite subtree with 2 branches that represen

…(Full text truncated)…

This content is AI-processed based on ArXiv data.