OpenFrontiers
← Back to the index
OP-11819Status unassessedLogic and foundations

Jumps and complexity within 2-random chains — Problem 1.4

Jumps and complexity within 2-random chains — Problem 1.4. Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.

Editorial MSC2020 mapping of Jumps and complexity within 2-random chains — Problem 1.4. https://arxiv.org/html/2608.26628v2#S1.Thmproblem4 Not an author-supplied code.

Licensed source statementAs of 2608.26628v2; current status unassessedSource & evidence ↓

Problem statement

Problem 1.4.

Toward a negative answer to Levin’s Problem 1.2, are the following true?

Are there 22-random reals x<Tzx<_{T}z such that

x′≡Tz′?x^{\prime}\equiv_{T}z^{\prime}?

Are there 22-random reals x<Tzx<_{T}z such that

∣K(x↾n)−K(z↾n)∣=O(1)?\left|K(x\upharpoonright n)-K(z\upharpoonright n)\right|=O(1)?

Is there a Turing ideal BB generated by a chain of 22-random reals such that BB contains no xx-random real for any x∈Bx\in B?

What are the jumps of 22-random reals? See [1].

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

  1. George Barmpalias

The following problems concern Turing ideals generated by sufficiently random reals.

Notation 1.1.

If α∈2ω\alpha\in 2^{\omega}, let α(i)\alpha^{(i)} denote the real obtained from α\alpha by deleting the digits α(k)\alpha(k) at positions kk that are divisible by 2i2^{i}.

A chain is a sequence (xi)i∈N(x_{i})_{i\in\mathbb{N}} of reals such that

xi<Txi+1x_{i}<_{T}x_{i+1}

for every i∈Ni\in\mathbb{N}.

If BB is a chain of reals, the Turing ideal generated by BB is

[B]:={z:∃x∈B, z≤Tx}.[B]:=\{z:\exists x\in B,\ z\leq_{T}x\}.

In particular, for a chain (xi)i∈N(x_{i})_{i\in\mathbb{N}},

[(xi)]:={z:∃i, z≤Txi}.[(x_{i})]:=\{z:\exists i,\ z\leq_{T}x_{i}\}.

For each real α\alpha, define

[α]:={z:∃i, z≤Tα(i)}.[\alpha]:=\{z:\exists i,\ z\leq_{T}\alpha^{(i)}\}.

The notation z≈xz\approx x means that zz and xx differ on finitely many bits.

The real ⨁ixi\bigoplus_{i}x_{i} is the infinite join of all the reals xix_{i}.

Proposition 1.2 (Barmpalias–Zhang, unpublished).

If (xi)i∈N(x_{i})_{i\in\mathbb{N}} is a sequence of reals and ⨁i≤nxi\bigoplus_{i\leq n}x_{i} is random for each nn, then there are reals zi≈xiz_{i}\approx x_{i} so that ⨁izi\bigoplus_{i}z_{i} is random. The same conclusion holds for kk-randomness and weak kk-randomness for each k∈Nk\in\mathbb{N}.

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 [α][\alpha] for some random real α\alpha.

The class ML(∅′)\mathrm{ML}(\emptyset^{\prime}) of ∅′\emptyset^{\prime}-random reals, equivalently the class of 22-random reals, is a special case.

There are two obstacles to constructing such a chain. If α\alpha is 22-random, then the ideal [α][\alpha] has the following properties:

For every x∈[α]x\in[\alpha], the ideal [α][\alpha] contains an x′x^{\prime}-random real.

The jumps of the columns α(i)\alpha^{(i)} form a chain and, in particular, are pairwise distinct.

Such a function can be used to produce a chain of 22-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.

References
  1. [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).; Jumps and complexity within 2-random chains — Problem 1.4 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 recorded

Attempts 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 notes

Notes 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.