SearcharxivSearch

arXiv · 2608.02423

Functionary Models of Real Analysis

Abstract

A real number can have more than one name: $0.5$ and $0.4999\ldots$ denote the same thing, and which numbers enjoy such a doubling depends on the base one writes in. We make that dependence the object of study. Fixing a system function $\vartheta$, which assigns a base $\vartheta(n)\geq2$ to every position independently, we build the real numbers as equivalence classes of digit functions $f:\omega\rightarrow\omega$, where the equivalence is generated by two local carrying moves, contraction and broadening, and tested by agreement on finite initial segments. Each class turns out to contain at most two canonical representatives (up to a sign representation), its primary and secondary auxiliary functions, so the doubling above is a theorem of the theory rather than a convention imposed on it. We define order, addition and multiplication and verify the axioms of a Dedekind-complete ordered field, so that by categoricity every choice of $\vartheta$ delivers $\mathbb{R}$ itself. The models are therefore indistinguishable as ordered fields and differ only in how their elements are named, and since $\vartheta$ ranges over an uncountable parameter space, that naming can be chosen to suit a problem. We show what this buys: in any base whose partial products absorb every denominator, a non-zero real number is rational precisely when it has a second name, and Cantor's 1869 irrationality criterion for Cantor series follows from the representation theory rather than from number theory.

Explore related subjects

Keep this discovery

BibTeXRIS

Matouš Schnabel. 2026-08-03. Functionary Models of Real Analysis. https://arxiv.org/abs/2608.02423

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