MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Roughly speaking, a theorem by Vershik says that every ergodic invertible measure-preserving transformation is isomorphic to some "adic" transformation on the spaces of paths of a Bratelli-Vershik graph. What is the adic transformation corresponding to a Bernoulli shift ?

share|cite|improve this question
up vote 3 down vote accepted

The short answer is that nobody knows. The reason is that Vershik's proof uses Rokhlin's towers and is thus virtually non-constructive.

As far as I know, the only known examples of explicit adic realizations are substitutional dynamical systems and the irrational rotations of the circle. Even for a simple ergodic rotation of the 2-torus this is an open question, let alone Bernoulli shifts.

share|cite|improve this answer
I believe I know a way to construct an adic realization of a rotation of the 2-torus. I can send you my notes about that if you are interested. – Stéphane Laurent May 20 at 16:54
This has been done, I believe. A paper in Monatshefte a few years ago, don't remember the author. – Nikita Sidorov May 20 at 17:44
More generally, I believe I know a way to construct an adic realization of $T \times S$ once one has an adic realization of $S$. But I'm not sure it works. – Stéphane Laurent May 20 at 18:30
Well, good luck. I look forward to reading about this one day. – Nikita Sidorov May 20 at 23:35
I try to explain this construction on an example here. Another example here. I discovered this construction while I was working on something else (currently I do not intend to publish this work). – Stéphane Laurent May 22 at 15:01

I think you can realize the Bernoulli shift on $k$ symbols as an adic transformation on the following Bratelli-Vershik diagram: put $k$ nodes on the first level. Suppose levels 1 to $n$ have been defined, and call $L_n$ the set of nodes in the $n$-th level. Then nodes on the $(n+1)$-th level are pairs $(i,j)\in L_n\times L_n$, where $(i,j)$ is connected to $i$ and to $j$ (in this order) to the $n$-th level. Does not this work?

share|cite|improve this answer
Thanks to both of you. @Thierry, hence the graph is "homogeneous", in the sense that the number of paths to some node at level $n$ to a node at level $1$ is the same for all nodes at level $n$ ? – Stéphane Laurent Feb 16 '12 at 15:18
In fact I am not very easy with the adic representation. Is it easy to check that Thierry's proposal is fine ? – Stéphane Laurent Feb 16 '12 at 15:55
Indeed, the graph I proposed is homogeneous: Each node of level n has exactly k^n paths to the root of the diagram. But then I must admit that this poses some problem, since this introduces eigenvalues for the associated adic transformation. So this adic transformation is rather an extension of the Bernoulli shift (probably a direct product with an odometer). – Thierry de la Rue Feb 16 '12 at 20:03

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.