SearcharxivSearch

arXiv · 1609.03198

Definability Aspects of the Denjoy Integral

Abstract

The Denjoy integral is an integral that extends the Lebesgue integral and can integrate any derivative. In this paper, it is shown that the graph of the indefinite Denjoy integral $f\mapsto \int_a^x f$ is a coanalytic non-Borel relation on the product space $M[a,b]\times C[a,b]$, where $M[a,b]$ is the Polish space of real-valued measurable functions on $[a,b]$ and where $C[a,b]$ is the Polish space of real-valued continuous functions on $[a,b]$. Using the same methods, it is also shown that the class of indefinite Denjoy integrals, called $ACG_{\ast}[a,b]$, is a coanalytic but not Borel subclass of the space $C[a,b]$, thus answering a question posed by Dougherty and Kechris. Some basic model theory of the associated spaces of integrable functions is also studied. Here the main result is that, when viewed as an $\mathbb{R}[X]$-module with the indeterminate $X$ being interpreted as the indefinite integral, the space of continuous functions on the interval $[a,b]$ is elementarily equivalent to the Lebesgue-integrable and Denjoy-integrable functions on this interval, and each is stable but not superstable, and that they all have a common decidable theory when viewed as $\mathbb{Q}[X]$-modules.

Explore related subjects

Keep this discovery

BibTeXRIS

Sean Walsh. 2016-09-11. Definability Aspects of the Denjoy Integral. https://arxiv.org/abs/1609.03198

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