Combining chains of random Turing degrees — Problem 1.1
Combining chains of random Turing degrees — Problem 1.1. Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.
Editorial MSC2020 mapping of Combining chains of random Turing degrees — Problem 1.1. https://arxiv.org/html/2608.26628v2#S1.Thmproblem1 Not an author-supplied code.
Problem statement
Problem 1.1 (Levin, private communications).
Are the following true?
Can every chain of random reals in the Turing degrees be combined into a single random real?
Can every Turing ideal generated by random reals be generated by the columns of a single random real?
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
- George Barmpalias
The following problems concern Turing ideals generated by sufficiently random reals.
Notation 1.1.
If , let denote the real obtained from by deleting the digits at positions that are divisible by .
A chain is a sequence of reals such that
for every .
If is a chain of reals, the Turing ideal generated by is
In particular, for a chain ,
For each real , define
The notation means that and differ on finitely many bits.
The real is the infinite join of all the reals .
Proposition 1.2 (Barmpalias–Zhang, unpublished).
If is a sequence of reals and is random for each , then there are reals so that is random. The same conclusion holds for -randomness and weak -randomness for each .
This proposition gives a partial positive answer to Question 1(1) under the additional assumption of relative randomness. Question 1(2) asks for the stronger conclusion that the ideal generated by a random chain is exactly of the form for some random real .
The class of -random reals, equivalently the class of -random reals, is a special case.
There are two obstacles to constructing such a chain. If is -random, then the ideal has the following properties:
For every , the ideal contains an -random real.
The jumps of the columns form a chain and, in particular, are pairwise distinct.
Such a function can be used to produce a chain of -random reals with the same jump in the Turing degrees.
Progress & source assessment
Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.
- [1]Barmpalias, George; Gao, Su; He, Jialiang; Kihara, Takayuki; Nies, Andre; Slaman, Theodore; Tran, Chieu-Minh; Turetsky, Daniel; Welch, Philip; Yu, Liang; Zhang, Hang. Tianyuan Workshop — Open Problems in Mathematical Logic (2026).; Combining chains of random Turing degrees — Problem 1.1 linkhttp://creativecommons.org/licenses/by/4.0/; attributed adaptation; HTML converted to Markdown with original mathematical notation and source links.
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.