SearcharxivSearch

arXiv · 2603.22503

The Reverse Mathematics of Analytic Measurability

Abstract

A classical theorem of Lusin states that all analytic sets are Lebesgue-measurable. In this article we established the reverse mathematical strength of Lusin's theorem, which depends on how precisely it is formalized. By doing so, we answer to a question of Simpson. Our main proof is motivated towards proving a specific version of that result, namely that analytic sets are Lesbesgue-regular, which requires the equality of the outer and inner measures of the set in question. We prove this statement to be equivalent to $\Sigma^{1}_{1}$-$\mathrm{IND}$ over $\mathrm{ATR}_{0}$. The full statement of the theorem, that is the one implying the existence of the measure as a real number, is equivalent to $\Pi^{1}_{1}$-$\mathrm{CA}_{0}$, again provably over $\mathrm{ATR}_{0}$. In our main proof, we draw inspiration from Solovay's construction of a model of Zermelo-Fraenkel set theory where every set is Lebesgue measurable. In our case the argument requires the use of class forcing over a family of standard and non-standard models of a very weak set theory obtained through the method of pseudohierarchies.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Juan P. Aguilera, Thibaut Kouptchinsky, Keita Yokoyama. 2026-03-23. The Reverse Mathematics of Analytic Measurability. https://arxiv.org/abs/2603.22503

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