fbpx
Wikipedia

Bratteli–Vershik diagram

In mathematics, a Bratteli–Veršik diagram is an ordered, essentially simple Bratteli diagram (VE) with a homeomorphism on the set of all infinite paths called the Veršhik transformation. It is named after Ola Bratteli and Anatoly Vershik.

Definition edit

Let X = {(e1e2, ...) | ei ∈ Ei and r(ei) = s(ei+1)} be the set of all paths in the essentially simple Bratteli diagram (VE). Let Emin be the set of all minimal edges in E, similarly let Emax be the set of all maximal edges. Let y be the unique infinite path in Emax. (Diagrams which possess a unique infinite path are called "essentially simple".)

The Veršhik transformation is a homeomorphism φ : X → X defined such that φ(x) is the unique minimal path if x = y. Otherwise x = (e1e2,...) | ei ∈ Ei where at least one ei ∉ Emax. Let k be the smallest such integer. Then φ(x) = (f1, f2, ..., fk−1, ek + 1, ek+1, ... ), where ek + 1 is the successor of ek in the total ordering of edges incident on r(ek) and (f1f2, ..., fk−1) is the unique minimal path to ek + 1.

The Veršhik transformation allows us to construct a pointed topological system (Xφy) out of any given ordered, essentially simple Bratteli diagram. The reverse construction is also defined.

Equivalence edit

The notion of graph minor can be promoted from a well-quasi-ordering to an equivalence relation if we assume the relation is symmetric. This is the notion of equivalence used for Bratteli diagrams.

The major result in this field is that equivalent essentially simple ordered Bratteli diagrams correspond to topologically conjugate pointed dynamical systems. This allows us apply results from the former field into the latter and vice versa.[1]

See also edit

Notes edit

  1. ^ Herman, Richard H.; Putnam, Ian F.; Skau, Christian F. (1992). "Ordered Bratteli diagrams, dimension groups and topological dynamics". International Journal of Mathematics. 3 (6): 827–864. doi:10.1142/S0129167X92000382.

Further reading edit

  • Dooley, Anthony H. (2003). "Markov odometers". In Bezuglyi, Sergey; Kolyada, Sergiy (eds.). Topics in dynamics and ergodic theory. Survey papers and mini-courses presented at the international conference and US-Ukrainian workshop on dynamical systems and ergodic theory, Katsiveli, Ukraine, August 21–30, 2000. Lond. Math. Soc. Lect. Note Ser. Vol. 310. Cambridge: Cambridge University Press. pp. 60–80. ISBN 0-521-53365-1. Zbl 1063.37005.

bratteli, vershik, diagram, mathematics, bratteli, veršik, diagram, ordered, essentially, simple, bratteli, diagram, with, homeomorphism, infinite, paths, called, veršhik, transformation, named, after, bratteli, anatoly, vershik, contents, definition, equivale. In mathematics a Bratteli Versik diagram is an ordered essentially simple Bratteli diagram V E with a homeomorphism on the set of all infinite paths called the Vershik transformation It is named after Ola Bratteli and Anatoly Vershik Contents 1 Definition 2 Equivalence 3 See also 4 Notes 5 Further readingDefinition editLet X e1 e2 ei Ei and r ei s ei 1 be the set of all paths in the essentially simple Bratteli diagram V E Let Emin be the set of all minimal edges in E similarly let Emax be the set of all maximal edges Let y be the unique infinite path in Emax Diagrams which possess a unique infinite path are called essentially simple The Vershik transformation is a homeomorphism f X X defined such that f x is the unique minimal path if x y Otherwise x e1 e2 ei Ei where at least one ei Emax Let k be the smallest such integer Then f x f1 f2 fk 1 ek 1 ek 1 where ek 1 is the successor of ek in the total ordering of edges incident on r ek and f1 f2 fk 1 is the unique minimal path to ek 1 The Vershik transformation allows us to construct a pointed topological system X f y out of any given ordered essentially simple Bratteli diagram The reverse construction is also defined Equivalence editThe notion of graph minor can be promoted from a well quasi ordering to an equivalence relation if we assume the relation is symmetric This is the notion of equivalence used for Bratteli diagrams The major result in this field is that equivalent essentially simple ordered Bratteli diagrams correspond to topologically conjugate pointed dynamical systems This allows us apply results from the former field into the latter and vice versa 1 See also editMarkov odometerNotes edit Herman Richard H Putnam Ian F Skau Christian F 1992 Ordered Bratteli diagrams dimension groups and topological dynamics International Journal of Mathematics 3 6 827 864 doi 10 1142 S0129167X92000382 Further reading editDooley Anthony H 2003 Markov odometers In Bezuglyi Sergey Kolyada Sergiy eds Topics in dynamics and ergodic theory Survey papers and mini courses presented at the international conference and US Ukrainian workshop on dynamical systems and ergodic theory Katsiveli Ukraine August 21 30 2000 Lond Math Soc Lect Note Ser Vol 310 Cambridge Cambridge University Press pp 60 80 ISBN 0 521 53365 1 Zbl 1063 37005 Retrieved from https en wikipedia org w index php title Bratteli Vershik diagram amp oldid 1025541861, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.