SearcharxivSearch

arXiv · 2501.02693

Any function I can actually write down is measurable, right?

Abstract

In this expository paper aimed at a general mathematical audience, we discuss how to combine certain classic theorems of set-theoretic inner model theory and effective descriptive set theory with work on Hilbert's tenth problem and universal Diophantine equations to produce the following surprising result: There is a specific polynomial $p(x,y,z,n,k_1,\dots,k_{70})$ of degree $7$ with integer coefficients such that it is independent of $\mathsf{ZFC}$ (and much stronger theories) whether the function $$f(x) = \inf_{y \in \mathbb{R}}\sup_{z \in \mathbb{R}}\inf_{n \in \mathbb{N}}\sup_{\bar{k} \in \mathbb{N}^{70}}p(x,y,z,n,\bar{k})$$ is Lebesgue measurable. We also give similarly defined $g(x,y)$ with the property that the statement "$x \mapsto g(x,r)$ is measurable for every $r \in \mathbb{R}$" has large cardinal consistency strength (and in particular implies the consistency of $\mathsf{ZFC}$) and $h(m,x,y,z)$ such that $h(1,x,y,z),\dots,h(16,x,y,z)$ can consistently be the indicator functions of a Banach$\unicode{x2013}$Tarski paradoxical decomposition of the sphere. Finally, we discuss some situations in which measurability of analogously defined functions can be concluded by inspection, which touches on model-theoretic o-minimality and the fact that sufficiently strong large cardinal hypotheses (such as Vop\v{e}nka's principle and much weaker assumptions) imply that all 'reasonably definable' functions (including the above $f(x)$, $g(x,y)$, and $h(m,x,y,z)$) are universally measurable.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

James E. Hanson. 2025-01-06. Any function I can actually write down is measurable, right?. https://arxiv.org/abs/2501.02693

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