SearcharxivSearch

arXiv · 1304.0698

Decomposing Borel functions using the Shore-Slaman join theorem

Abstract

Jayne and Rogers proved that every function from an analytic space into a separable metric space is decomposable into countably many continuous functions with closed domains if and only if the preimage of each $F_\sigma$ set under it is again $F_\sigma$. Many researchers conjectured that the Jayne-Rogers theorem can be generalized to all finite levels of Borel functions. In this paper, by using the Shore-Slaman join theorem on the Turing degrees, we show the following variant of the Jayne-Rogers theorem at finite and transfinite levels of the hierarchy of Borel functions: For all countable ordinals $\alpha$ and $\beta$ with $\alpha\leq\beta<\alpha\cdot 2$, every function between Polish spaces having small transfinite inductive dimension is decomposable into countably many Baire class $\gamma$ functions with $\mathbf{\Delta}^0_{\beta+1}$ domains such that $\gamma+\alpha\leq\beta$ if and only if the preimage of each $\mathbf{\Sigma}^0_{\alpha+1}$ set under that function is $\mathbf{\Sigma}^0_{\beta+1}$, and the transformation of a $\mathbf{\Sigma}^0_{\alpha+1}$ set into the $\mathbf{\Sigma}^0_{\beta+1}$ preimage is continuous.

Explore related subjects

Keep this discovery

BibTeXRIS

Takayuki Kihara. 2013-04-02. Decomposing Borel functions using the Shore-Slaman join theorem. https://arxiv.org/abs/1304.0698

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