S2a-reducibility and differentiation in Martin-Löf random reals

2026-08-16

AI Summary

This study addresses the open problem of whether S2a-reducibility satisfies the Barmpalias-Lewis-Pye limit theorem. By integrating computability theory with algorithmic randomness analysis, we construct a precise counterexample that refutes the prevailing conjecture. Our results definitively establish that S2a-reducibility fails to satisfy this limit theorem, thereby revealing fundamental distinctions between S2a-reducibility and monotone Solovay reducibility. This work resolves a longstanding theoretical challenge in the field and clarifies the structural relationships among various reducibilities within the context of Martin-Löf random reals. Ultimately, these findings provide critical insights into the hierarchy of algorithmic randomness, advancing our understanding of the fine structure of reducibility notions for random sequences.

Abstract

Solovay reducibility is studied intensively as a tool to compare the approximability and the degree of randomness of left-c.e. reals. By definition, a real is left-c.e. if it has a left-c.e. approximation, that is, it is the limit of an effective nondecreasing sequence of rationals. If reals $α$ and $β$ have left-c.e. approximations $a_0, a_1, \ldots$ and $b_0, b_1, \ldots$, respectively, such that the approximation ratios \[ \frac{α-a_n}{β-b_n} \] are bounded from above by a constant, the real $α$ is Solovay reducible to $β$. The latter is the case for any such $α$ and $β$ and their left-c.e. approximations whenever $β$ is Martin-Löf random by the Kučera-Slaman Theorem [DOI:10.1137/S0097539799357441]. This result was substantially strengthened by Barmpalias and Lewis-Pye [DOI:10.1016/j.jcss.2017.06.002], who demonstrated that, under the given assumptions, the approximation ratios are not only bounded but actually converge to a limit, which does not depend on the considered left-c.e. approximations. There is a quest for a suitable extension of Solovay reducibility to the class of all reals. Promising candidates include S2a-reducibility on the set of computably approximable reals by Zheng and Rettinger [DOI:10.1007/978-3-540-27798-9_39] and monotone Solovay reducibility by Titov [DOI:10.1007/978-3-031-95908-0_33]. For the latter, Titov [DOI:10.1017/jsl.2025.10157] demonstrated that the theorems of Kučera and Slaman and of Barmpalias and Lewis-Pye extend to all reals. He conjectured further [DOI:10.1017/jsl.2025.10157, Conjecture 3.2] that similar extensions hold for S2a-reducibility in terms of its functional characterization by Kumabe, Miyabe, and Suzuki [DOI:10.3233/COM-230486]. In this work, we refute this conjecture by proving that the analogue of the Barmpalias-Lewis-Pye Limit Theorem does not hold for S2a-reducibility.

Problem

• S2a-reducibility
• Martin-Löf random reals
• Barmpalias-Lewis-Pye Limit Theorem
• Solovay reducibility

Innovation

• S2a-reducibility
• Martin-Löf random reals
• Barmpalias-Lewis-Pye Limit Theorem
• Solovay reducibility
• computably approximable reals