Search arXivSearch

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:ω\rightarrowω$, 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

Explore connections, maps & timelines

BibTeXRIS

Matouš Schnabel. 2026-08-05. 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

Loops, Inverse Limits and Non-Determinism

We introduce an operator on problems in Weihrauch complexity, which we call the infinite loop or inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a sequence of results in an infinite loop, using some fixed subroutine. We prove that the corresponding operator is monotone with respect to (strong) Weihrauch reducibility but that it is not a closure operator. One of our findings is that weak Kőnig's lemma is closed under infinite loops, which implies that the class of non-deterministically computable problems is also closed under this operation. Consequently, this class allows for a high degree of flexibility in programming. As our main technical tools, we present an injective version of the recursion theorem and an infinitary version of the so-called independent choice theorem. We also show that, in general, the infinite loop operator is more powerful than the composition of the diamond operator followed by the parallelization operator. However, in many practical scenarios, these compositions yield a result, which coincides with the application of the infinite loop operator. Finally, we discuss the special situation of loops for single-valued problems and for problems on Turing degrees.

math.LO

Scott topologies on meet-continuous domains

We study Scott products and sobriety of countable meet-continuous domains, meaning meet-continuous dcpos without any additional continuity or least-element assumption. Using the complete-lattice test-family theorem of Xu and Ji, we prove finite-product equality for those domains that are $L$-dcpos, and for the weaker class whose principal ideals have suprema of all nonempty subsets. For an arbitrary family of nonempty countable meet-continuous $L$-dcpos, we prove that the Scott topology on the order product equals the product of the factor Scott topologies if and only if only finitely many factors lack a least element. We also establish sobriety under bounded completeness and under additional common-upper-bound conditions. Assuming square-product equality, sobriety is characterized by Scott closedness of common-upper-bound sections associated with irreducible Scott-closed sets, with an equivalent sequential formulation in the countable case. Two extraction lemmas extend to meet-semilattice dcpos. The finite-product and sobriety questions for general countable meet-continuous domains remain unresolved here.

math.LO

Randomized Borel $(2d+1)$-coloring of digraphs

Let $G$ be a Borel digraph with maximum out-degree $d \in \mathbb{N}$. We show that $G$ admits a random Borel $(2d+1)$-coloring for which every edge is almost surely not monochromatic. This gives a simpler proof of a recent result of Pelayo-Gómez: such a graph $G$ admits a measurable proper $(2d+1)$-coloring with respect to any Borel probability measure on $V(G)$. Our proof is an adaptation of Pelayo-Gómez's proof to the randomized Borel setting.

math.LO