Search arXivSearch

arXiv · 2406.12482

On all numbers great and small (Topological fields of Conway's numbers and their completions)

Abstract

The proper Class $\bf{No}$ of all Conway's numbers $\cite{l3}$ is considered as a region of investigation. It turns out to be a total ordered Field (i.e., a field whose domain is a proper Class) and this totally, or linear ordered Class, containing the real numbers ${\mathbb R}$ and the ordinal numbers {\bf On}. For any subfield $F$ of $\bf{No}$, i.e., $F$ is a set nor proper class, considered with topology induced by a linear ordering on $F$ a completion $\tilde F$ is constructed; in particular, for $\zeta=\omega^{\omega^\mu}$, $0\leq\mu<\Omega$, and for a specially defined subfield $F={\mathbb P}_\zeta\subset{\bf No}$ a complete subfield ${\mathbb R}_\zeta\subset{\bf No}$ is defined as $\tilde {\mathbb P}_\zeta$. Fundamental (Cauchy) sequences $(x_\alpha)_{0\leq\alpha<\zeta}$ are considered in a subfield $F\subset {\mathbb P}_\zeta\subset{\bf No}$, where $\zeta$ is the smallest ordinal number which does not belong to $F$, and they are the main instrument in the paper. A fragment of Mathematical Analysis in ${\mathbb R}_\zeta$ is given and two of its non-trivial results are presented: every positive number $x\in{\mathbb R}_\zeta$ has a unique $n$-th root in ${\mathbb R}_\zeta$, for each positive integer $n$ and every odd-degree polynomial with coefficients in ${\mathbb R}_\zeta$ has a root in ${\mathbb R}_\zeta$. Hence so-called fundamental theorem of algebra: the ring ${\mathbb R}_\zeta[i]\stackrel{def}{=}{\mathbb C}_\zeta$ of all numbers of the form $x+iy$ ($x,y\in{\mathbb R}_\zeta$), $i^2=-1$, is an algebraically closed field.

Explore related subjects

Keep this discovery

BibTeXRIS

Ju. T. Lisica. 2024-06-18. On all numbers great and small (Topological fields of Conway's numbers and their completions). https://arxiv.org/abs/2406.12482

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

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO