Search arXivSearch

arXiv · 1404.6447

Counterexamples to Cantorian Set Theory

Abstract

This paper provides some counterexamples to Cantor's contributions to the foundations of Set Theory. The first counterexample forces Cantor's Diagonal Method (DM) to yield one of the numbers in the target list. To study this anomaly, and given that for the DM to work the list of numbers have to be written down, the set of numbers that can be represented using positional fractional notation, $\mathbb{W}$, is properly characterized. It is then shown that $\mathbb{W}$ is not isomorphic to $\mathbb{R}$, meaning that results obtained from the application of the DM to $\mathbb{W}$ in order to derive properties of $\mathbb{R}$ are not valid. It is then shown that Cantor's DM for a generic list of reals can be forced to yield one of the numbers of the list, thus invalidating Cantor's result that infers the non-denumerability of $\mathbb{R}$ from the application of the DM to $\mathbb{W}$. Cantor's Theorem about the different cardinalities of a set and its power set is then questioned, and by means of another counterexample we show that the theorem does not actually hold for infinite sets. After analyzing all these results, it is shown that the current notion of cardinality for infinite sets does not depend on the size of the sets, but rather on the representation chosen for them. Following this line of thought, the concept of model as a framework for the construction of the representation of a set is introduced, and a theorem showing that an infinite set can be well-ordered if there is a proper model for it is proven. To reiterate that the cardinality of a set does not determine whether the set can be well-ordered, a set of cardinality $\aleph_{0}^{\aleph_{0}}$ is proven to be equipollent to the set of natural numbers $\mathbb{N}$. The paper concludes with an analysis of the cardinality of the ordinal numbers, for which a representation of cardinality $\aleph_{0}^{\aleph_{0}}$ is proposed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Enrique Coiras. 2014-04-24. Counterexamples to Cantorian Set Theory. https://arxiv.org/abs/1404.6447

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The new Fermat-type factorization algorithm

Let n be any odd natural number other than a perfect square. We show that the new factorization algorithm, presented in this paper and which we call DFM-1 (where DFM stands for Detto's Factorization Method), is much more efficient than the implementation technique of Fermat's Factorization Algorithm (FFA) called FFA-1, which, among the implementation techniques of Fermat's Factorization Algorithm (FFA), is the one that requires the fewest iterations to identify the non-trivial and trivial factors of n (excluding the cases in which the two factors of the pair of non-trivial or trivial factors of n are so close to each other that they can be identified at the 1st iteration with each of such implementation techniques). Indeed, by the way in which Euler's totient function of any n that is a semiprime is applied to FFA-1, we arrive at the new factorization algorithm (DFM-1), which halves (possibly rounding up to the next integer) the number of iterations required by FFA-1. Furthermore, in this paper, we present the hypothetical scenario according to which the number of iterations could possibly be further reduced. Finally, and still in relation to this new factorization algorithm, in this paper we present the limit number of iterations, which is less than the number of iterations required by DFM-1 to reach the condition x - y = 1 which characterizes the pair of trivial factors of n, beyond which it is no longer possible for pairs of non-trivial factors of n to occur.

math.GM

A Note on the Measure of Vector and Pythagorean Theorem

Why the square? We present a geometry-axiom-free derivation of the Pythagorean theorem and the square at its core, establishing their algebraic origin from within the bare vector-space framework. Such concepts as the (right) angle, rotation, inner product, orthogonality etc also emerge as a logical construct rather than taken as given. They are necessitated by the square, and the ensuing theory, in turn, $\textit{canonically}$ stems from a $\textit{single}$ definitional primitive $-$ the ($\mathbb R^{\vcenter{\hbox{$\scriptscriptstyle+$}}}\!$-quantitative) invariant $\mathcal Q$-measure of a vector. This provides the core of an algebraic justification for Euclidean geometry. Equally important, these findings account (also canonically) for the complex modulus-squared $p = |\mathfrak a|^2$ $-$ the quantum Born rule $-$ and point out what is even admissible for being quantitatively interpreted. The linear structure and its endomorphisms are rigid in the sense that the $\textit{well-defined}$ interpretable turns out to be, up to gauge $\mathcal Q {\,\to\,} \mathrm{const} {\,\vcenter{\hbox{$\scriptstyle\times$}}\,} \mathcal Q$, the unique gauge-invariant measure $\mathcal Q=|\hspace{-0.18em}| {\cdot}{\cdot}{\cdot} |\hspace{-0.18em}|^2$; independently of the field $\mathbb R$ or $\mathbb C$.

math.GM

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. Liu proposed the conjecture \[ \sum_{\text{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \ge 2+\left(\frac{2r}{R}\right)^k,\qquad k>1, \] with the reverse inequality for $k<1$. We prove this conjecture by reducing it to an algebraic inequality for three positive variables with prescribed sum and product. We also determine the equality cases.

math.GM