Multiple recurrence conjecture for computable commuting transformations

About 10 years old · traced to

Let (X,μ)(X,\mu) be a computable probability space. Let T1,…,TkT_1,\ldots,T_k be computable measure-preserving transformations that commute pairwise. Let PP be a Π10\Pi^0_1 class with μ(P)>0\mu(P)>0. A point z∈Pz\in P is Martin-Löf random if it avoids every effectively null Σ10\Sigma^0_1 test. Multiple recurrence conjecture. If z∈Pz\in P is Martin-Löf random, then there exists nn such that

z∈⋂i≤kTi−n(P).z\in\bigcap_{i\leq k}T_i^{-n}(P).

This is a proposed extension of multiple recurrence to computable probability spaces and computable pairwise commuting measure-preserving transformations. The supplied text calls the result “putative” and gives no evidence of a resolution.

References

Primary source

Andre Nies, “Logic Blog 2015f”, arXiv:1602.04432 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.