arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2608.15750math.LOcs.ITcs.LOmath.IT

Martin-Löf随机实数中的S2a-可归约性与微分

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

Georgii Sirotenko, Ivan Titov

AI总结:

本研究针对S2a-可归约性,通过证明Barmpalias-Lewis-Pye极限定理的类似结论不成立,反驳了Titov提出的相关猜想,拓展了Solovay可归约性的研究。

AI中文摘要:

Solovay可归约性作为比较左可计算枚举(left-c.e.)实数的可逼近性与随机度的工具被广泛研究。根据定义,一个实数是左可计算枚举的,当且仅当它存在左可计算枚举逼近,即它是有理数的有效非递减序列的极限。若实数α和β分别有左可计算枚举逼近序列a₀,a₁,…和b₀,b₁,…,使得逼近比(α−aₙ)/(β−bₙ)被某常数上界约束,则称α是Solovay可归约到β的。根据Kučera-Slaman定理[DOI:https://doi.org/10.1137/S0097539799357441],当β是Martin-Löf随机实数时,对任意此类α、β及其左可计算枚举逼近,该关系均成立。Barmpalias和Lewis-Pye[DOI:https://doi.org/10.1016/j.jcss.2017.06.002]将该结果大幅强化,证明在给定假设下,逼近比不仅有界,还会收敛到一个与所考虑的左可计算枚举逼近无关的极限。目前学界正寻求将Solovay可归约性适用于所有实数类的合适扩展方案,有前景的候选包括Zheng和Rettinger提出的可计算逼近实数集上的S2a-可归约性[DOI:https://doi.org/10.1007/978-3-540-27798-9_39],以及Titov提出的单调Solovay可归约性。对于后者,Titov[DOI:https://doi.org/10.1007/978-3-031-95908-0_33]证明Kučera-Slaman定理与Barmpalias-Lewis-Pye定理可扩展至所有实数;他进一步猜想[DOI:https://doi.org/10.1017/jsl.2025.10157,猜想3.2],基于Kumabe、Miyabe和Suzuki给出的函数刻画[DOI:https://doi.org/10.3233/COM-230486],类似扩展对S2a-可归约性也成立。本研究通过证明Barmpalias-Lewis-Pye极限定理的类似结论对S2a-可归约性不成立,反驳了该猜想。

英文摘要:

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.

↑