[Paper Review] Bounded rank-one transformations

Su Gao, Aaron Hill|arXiv (Cornell University)|Sep 7, 2013

Advanced Topics in Algebra15 references4 citations

TL;DR

This paper introduces a canonical boundedness condition for rank-one transformations to characterize trivial centralizer and total ergodicity using bounded cutting and spacer parameters. It establishes that a bounded rank-one transformation has minimal self-joinings of all orders (MSJ) if and only if it is canonically bounded and totally ergodic, providing a simple, parameter-based criterion for MSJ via the spacer and cutting parameters.

ABSTRACT

We define the notion of canonical boundedness among rank-one transformations and use it to characterize the class of all bounded rank-one transformations with trivial centralizer. We also explicitly characterize totally ergodic rank-one transformations with bounded cutting parameter. Together with a recent result of Ryzhikov our results provide a simple procedure for determining whether a bounded rank-one transformation has minimal self-joinings of all orders purely in terms of the cutting and spacer parameters for the transformation.

Motivation & Objective

• To characterize bounded rank-one transformations with trivial centralizer using a new notion of canonical boundedness.
• To provide a necessary and sufficient condition for total ergodicity in rank-one systems with bounded cutting parameters.
• To unify Ryzhikov’s result on minimal self-joinings of all orders (MSJ) with the new criteria, enabling a simple decision procedure.
• To establish that canonical boundedness is independent of the choice of bounded cutting and spacer parameters, ensuring robustness of the characterization.

Proposed method

• Introduce the concept of canonical cutting and spacer parameters derived from a given pair of parameters, which are idempotent and preserve boundedness of the spacer parameter.
• Define a bounded rank-one transformation as canonically bounded if both its canonical cutting and spacer parameters are bounded.
• Prove that trivial centralizer holds if and only if the transformation is canonically bounded, using a condition on the existence of differing spacer values within bounded windows of parameters.
• Establish a criterion for total ergodicity based on the non-divisibility of $ h_N + a_{n,i} $ by any $ d > 1 $, where $ h_N $ is the height of the stage-N tower.
• Use Ryzhikov’s result that MSJ holds iff the transformation is totally ergodic and has trivial centralizer to combine the two criteria into a complete decision procedure.
• Apply recursive tower height definitions: $ h_0 = 1 $, $ h_{n+1} = q_n h_n + extstyleigsum_{0<i<q_n} a_{n,i} $, to analyze ergodicity conditions.

Experimental results

Research questions

• RQ1 When does a bounded rank-one transformation have a trivial centralizer?
• RQ2 What conditions on the cutting and spacer parameters ensure total ergodicity in rank-one systems?
• RQ3 Under what conditions does a bounded rank-one transformation have minimal self-joinings of all orders (MSJ)?
• RQ4 How does the notion of canonical boundedness relate to the intrinsic dynamical properties of rank-one systems?
• RQ5 Can a simple, parameter-based criterion be derived to determine MSJ in bounded rank-one transformations?

Key findings

• A bounded rank-one transformation has trivial centralizer if and only if it is canonically bounded, i.e., its canonical cutting and spacer parameters are both bounded.
• The condition for trivial centralizer is equivalent to: there exists $ k o ext{N} $ such that for all $ N $, there are $ n,m $ in $ [N, N+k) $ with $ a_{n,i} \neq a_{m,j} $ for some $ i,j $, ensuring non-uniformity in spacer values over bounded intervals.
• A rank-one transformation with bounded cutting parameter is totally ergodic if and only if for every $ d > 1 $ and $ N \in \mathbb{N} $, there exists $ n \geq N $ and $ 0 < i < q_n $ such that $ d \nmid (h_N + a_{n,i}) $, where $ h_N $ is the height of the stage-N tower.
• A bounded rank-one transformation has minimal self-joinings of all orders (MSJ) if and only if it is both canonically bounded and totally ergodic, as per Ryzhikov’s theorem.
• The procedure to check MSJ is algorithmic and based solely on the cutting and spacer parameters: verify non-constant spacer values in bounded windows and non-divisibility of $ h_N + a_{n,i} $ by $ d > 1 $.
• The canonical boundedness condition is independent of the choice of bounded parameters, making it a robust invariant for classifying trivial centralizer and MSJ properties.