SearcharxivSearch

arXiv · 2503.08799

Absoluteness of the Riemann integral

Abstract

This article explores the concept of absoluteness in the context of mathematical analysis, focusing specifically on the Riemann integral on $\mathbb{R}^{n}$. In mathematical logic, "absoluteness" refers to the invariance of the truth value of certain statements in different mathematical universes. Leveraging this idea, we investigate the conditions under which the Riemann integral on $\mathbb{R}^{n}$ remains absolute between transitive models of ZFC, the standard axiomatic system in which current mathematics is usually formalized. To this end, we develop a framework for integration on Boolean algebras with respect to finitely additive measures and show that the classical Riemann integral is a particular case of this generalized approach. Our main result establishes that the Riemann integral over rectangles in $\mathbb{R}^{n}$ is absolute in the following sense: if $M \subseteq N$ are transitive models of ZFC, $a, b \in \mathbb{R}^{n} \cap M$, and $f \colon [a, b] \to \mathbb{R}$ is a bounded function in $M$, then $f$ is Riemann integrable in $M$ if, and only if, in $N$ there exists some Riemann integrable function $g \colon [a, b] \to \mathbb{R}$ extending $f$. In this case, the values of the integrals computed in each model are the same. Furthermore, the function $g$ is unique except for a measure zero set.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Carlos M. Parra-Londoño, Andrés F. Uribe-Zapata. 2025-03-11. Absoluteness of the Riemann integral. https://arxiv.org/abs/2503.08799

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