Subshifts, λλ-graph bisystems and C∗C^*-algebras

preprint2020arXivOpen access

Abstract

We introduce a notion of λλ-graph bisystem. It consists of a pair (L−,L+)({\frak L}^-, {\frak L}^+) of two labeled Bratteli diagrams L−,L+{\frak L}^-, {\frak L}^+ over alphabets Σ−,Σ+Σ^-, Σ^+, respectively, and satisfy certain compatibility condition of their labeling on edges. Its matrix presentation is called a symbolic matrix bisystem. We first show that any λλ-graph bisystem presents subshifts and conversely any subshift is presented by a λλ-graph bisystem, called the canonical λλ-graph bisystem for the subshift. We introduce a notion of properly strong shift equivalence on symbolic matrix bisystems and show that two subshifts are topologically conjugate if and only if their canonical symbolic matrix bisystems are properly strong shift equivalent. A λλ-graph bisystem (L−,L+)({\frak L}^-, {\frak L}^+) yields a pair of C∗C^*-algebra written OL−+,OL+−{\mathcal{O}_{{\frak L}^-}^+}, {\mathcal{O}_{{\frak L}^+}^-}. We show that the C∗C^*-algebras are universal unique C∗C^*-algebras subject to certain operator relations among canonical generators encoded by λλ-graph bisystem (L−,L+).({\frak L}^-, {\frak L}^+). If a λλ-graph bisystem comes from a λλ-graph system of a finite directed graph, then the associated subshift is the two-sided topological Markov shift (ΛA,σA)(Λ_A, σ_A) by its transition matrix AA of the graph, and the associated C∗C^*-algebra OL−+{\mathcal{O}_{{\frak L}^-}^+} is isomorphic to OA,{\mathcal{O}}_A, whereas the other C∗C^*-algebra OL+−{\mathcal{O}_{{\frak L}^+}^-} is isomorphic to C(ΛA)⋊σA∗ZC(Λ_A)\rtimes_{σ_A^*}\mathbb{Z} of the commutative C∗C^*-algebra C(ΛA)C(Λ_A) on ΛAΛ_A by the automorphism induced by the homeomorphism of the shift σA.σ_A. This phenomena shows a duality between OA{\mathcal{O}}_A and C(ΛA)⋊σA∗ZC(Λ_A)\rtimes_{σ_A^*}\mathbb{Z}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.