Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0803.1715

Disproof of the Continuum Hypothesis and Determination of the Cardinality of Continuum by Approximations of Sets

Slavko Rede
View original source ↗Read source document ↗Export metadata ↓

Abstract

A set theory is developed based on the approximations of sets and denoted by AS. In AS the set of all sets exists but the argument for Russell's and Cantor's paradox fail. The Axioms of Separation, Replacement and Foundation are not valid. All the other axioms of ZF are valid and all the basic sets, such as complement, intersection and cartesian product, exist although complement is not quite the same set as in ZF. The set of all sets can be equipped with the topology of approximations (Ta). Every set is closed and every function is continuous in Ta. This implies that the Continuum Hypothesis is false. The sets containing a subset which is perfect in Ta are of the greatest cardinality. A simple observation shows that the concept of well-ordering must be defined in a slightly different way than in ZF. We prove that a set can be well-ordered if and only if it has no perfect subset. Therefore the cardinalities of arbitrary sets are always comparable without assuming the Axiom of Choice. The cardinals following the smallest infinite cardinal w are 2w, 3w, ..., w^2, 2w^2, 3w^2, >..., w^3.... each being of greater cardinality than the previous one, which is not the case in ZF. Immediately after these cardinals does not follow w^w which is not a well-orderable set but some well-ordered cardinal k, and this one is followed by the cardinals 2k, 3k, ..., k^2, 2k^2, 3k^2, ..., k^3...., etc. The greatest cardinal is P(w) and is not a well-orderable set. The cofinality of a well-ordered set is either 2 or w. The only regular cardinals are 0, 1, 2, w and P(w). All other cardinals are singular. The only strong limit cardinal is w. The only inaccessible cardinal is P(w). Strongly inaccessible cardinals do not exist.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Slavko Rede. 2009-04-15. Disproof of the Continuum Hypothesis and Determination of the Cardinality of Continuum by Approximations of Sets. https://arxiv.org/abs/0803.1715

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

KEEP EXPLORING

Related papers

arXiv2026

On the convergence of a perturbed one dimensional Mann's process

We study a perturbed version of Mann's iterative process (DMP), defined by \[ x_{n+1} = (1 - θ_n)x_n + θ_n f(x_n) + r_n, \] where $f: [0,1] \to [0,1]$ is a continuous function, $\{θ_n\} \subset [0,1]$ is a given sequence, and $\{r_n\} $ represents an error term. We prove that if the sequence $\{θ_n\} $ converges sufficiently slowly to zero and the error term $ r_n $ is suitably small at infinity, then any sequence $\{x_n\} \subset [0,1] $ generated by this process converges to a fixed point of $f$. In addition, we investigate the asymptotic behavior of the trajectories $ x(t) $ as $ t \to \infty$ for a continuous-time version of the process (DMP). We emphasize the parallels between the discrete and the continuous dynamics. Furthermore, through numerical experiments, we analyze the influence of the sequence $\{θ_n\} $ and the error terms on the stability and the convergence rate of the the discrete and the continuous processes. Notably, we observe that the (DMP) algorithm, when affected by stochastic and relatively large error terms, can outperform the bisection method in efficiently identifying the fixed point set of the function $f$.

math.GM↗
arXiv2026

Explicit formula for the discrete Laplace transform of the Möbius function, related special functions, and a criterion for the Riemann hypothesis

In this paper, we assume that all the zeros of the Riemann zeta function are simple. Under this assumption we give an explicit formula for the function $Φ(e^{-t})=\sum_{n=1}^{\infty}μ(n)e^{-nt}$, as a function of the values of $ζ(s)$ and $ζ'(s)$ at the odd integers and as a function of the zeros of $ζ(s)$. A structural feature distinguishes this formula from the classical explicit formula for the Mertens function: the poles of $Γ(s)$ collide with the trivial zeros of $ζ(s)$, producing double poles whose residues contain a logarithmic term. Using this formula, we give a criterion for the Riemann hypothesis: the bound $O(x^{-1/2})$ on the transform implies the Riemann hypothesis unconditionally, while the converse direction requires additional hypotheses on the zeros. We also introduce special entire functions related to $ζ(s)$ and show that they admit absolutely convergent closed forms as Möbius-weighted series of Bessel functions of rotated argument.

math.GM↗
arXiv2026

There exist blow-ups in the incompressible Navier-Stokes equation

In this paper, we solve the Navier-Stokes equation, one of the seven Millennium Prize Problems suggested by Clay Mathematics Institute(CMI). In our paper, the fluid is confined in a solid sphere. We prove that, for any initial velocity u0, there has been a force vector f , such that there exists no smooth solution (p,u) to the respective Navier-Stokes equation. This result also holds for the Euler equation. The paper was first published in 2021, soon after, Professor PG Lemarié-Rieusset contact me and tell that there is a possible flaw, because u may be non-integrable when it decreases not very fast. Hence, I withdraw the paper. Through carefull consideration of several years, we think we can choose a fluid confined in a solid sphere to fix it. So, we update the paper now.

math.GM↗