Galileo’s paradox and numerosities
Galileo's paradox of infinity involves comparing the set of natural numbers, N, and the set of squares, {n2 : n ∈ N}. Galileo (1638) sets up a one-to-one correspondence between these sets; on this basis, the number of the elements of N is considered to be equal to the number of the elements of...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | article |
| Lenguaje: | DE EN FR PL |
| Publicado: |
Copernicus Center Press
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/803947dad5b04394bd1d76acb1d98b7e |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | Galileo's paradox of infinity involves comparing the set of natural numbers, N, and the set of squares, {n2 : n ∈ N}. Galileo (1638) sets up a one-to-one correspondence between these sets; on this basis, the number of the elements of N is considered to be equal to the number of the elements of {n2 : n ∈ N}. It also characterizes the set of squares as smaller than the set of natural numbers, since ``there are many more numbers than squares". As a result, it concludes that infinities cannot be compared in terms of greater--lesser and the law of trichotomy does not apply to them.
Cantor's cardinal numbers provide a measure for sets. Cantor (1897) gives a definition of the relation greater–lesser between cardinal numbers and establishes the law of trichotomy for these numbers. Yet, when Cantor's theory is applied to subsets of N, it gives that any set can be either finite or of the power ℵ0. Thus, although the set of squares is the subset of N, they are of the same cardinality.
Benci, Di Nasso (2019) introduces specific numbers to measure sets called numerosities. With numerosities, the following claim is true: numerosity of A < numerosity of B, whenever A ⊈ B.
In this paper, we present a simplified version of the theory of numerosities that applies to subsets of N. This theory complies with Galileo's presupposition that when A ⊈ B, then the number of elements in A is smaller than the number of elements in B. Specifically, we show that as the numerosity of N is the number α, the numerosity of the set of squares is the integer part of the number √α, that is ⌊√α⌋, and the inequality ⌊√α⌋ < α holds. |
|---|