This paper introduces $mbda$-graph bisystems, establishes their connection to subshifts and $C^*$-algebras, and demonstrates a duality between certain $C^*$-algebras associated with subshifts.
Contribution
It defines $mbda$-graph bisystems, shows their role in presenting subshifts, and constructs associated $C^*$-algebras with a duality property.
Findings
01
Any $mbda$-graph bisystem presents a subshift.
02
Topological conjugacy of subshifts corresponds to proper strong shift equivalence of symbolic matrix bisystems.
03
Associated $C^*$-algebras exhibit a duality, with one isomorphic to a Cuntz-Krieger algebra and the other to a crossed product.
Abstract
We introduce a notion of λ-graph bisystem. It consists of a pair (L−,L+) of two labeled Bratteli diagrams L−,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+) yields a pair of C∗-algebra written…
Equations552
Ml,l+1−Ml+1,l+2+≃κMl,l+1+Ml+1,l+2−,l∈Z+,
Ml,l+1−Ml+1,l+2+≃κMl,l+1+Ml+1,l+2−,l∈Z+,
Al,l+1−(i,β,j)
Al,l+1−(i,β,j)
Al,l+1+(i,α,j)
α∈Σ+∑SαSα∗
α∈Σ+∑SαSα∗
SαSα∗
β∈Σ1−(vil)∑Eil(β)
Sα∗Eil(β)Sα
K0(OL−+)≅
K0(OL−+)≅
K1(OL−+)≅
OL−+≅OL−t−,OL+−≅OL+t+.
OL−+≅OL−t−,OL+−≅OL+t+.
ΛA={(xn)n∈Z∈{1,2,…,N}Z∣A(xn,xn+1)=1 for all n∈Z}
ΛA={(xn)n∈Z∈{1,2,…,N}Z∣A(xn,xn+1)=1 for all n∈Z}
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPetri Nets in System Modeling · semigroups and automata theory · Advanced Algebra and Logic
Full text
Subshifts, λ-graph bisystems and C∗-algebras
Kengo Matsumoto
Department of Mathematics
Joetsu University of Education
Joetsu, 943-8512, Japan
Abstract
We introduce a notion of λ-graph bisystem
that consists of a pair (L−,L+) of two labeled Bratteli diagrams
L−,L+
satisfying certain compatibility condition for labeling their edges.
It is a two-sided extension of λ-graph system,
that has been previously introduced by the author.
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 an algebraically defined relation on symbolic matrix bisystems
called properly strong shift equivalence
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+) yields
a pair of C∗-algebras
written OL−+,OL+− that are first defined as the C∗-algebras
of certain étale groupoids constructed from
(L−,L+).
We study structure of the C∗-algebras, and show that
they are universal unital unique C∗-algebras subject to
certain operator relations
among canonical generators of partial isometries and projections
encoded by the structure of the λ-graph bisystem (L−,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)
by its transition matrix A of the graph,
and the associated C∗-algebra OL−+ is isomorphic to
the Cuntz–Krieger algebra OA,
whereas the other C∗-algebra OL+− is isomorphic to
the crossed product C∗-algebra
C(ΛA)⋊σA∗Z
of the commutative C∗-algebra C(ΛA)
of continuous functions on the shift space ΛA
of the two-sided topological Markov shift
by the automorphism σA∗ induced by the homeomorphism of the shift
σA.
This phenomena shows a duality
between Cuntz–Krieger algebra OA
and the crossed product C∗-algebra
C(ΛA)⋊σA∗Z.
Subshifts, λ-graph systems and its C∗-algebras
3. 3
λ-graph bisystems
4. 4
Symbolic matrix bisystems
5. 5
Subshifts and λ-graph bisystems
6. 6
Strong shift equivalence
7. 7
Étale groupoids for λ-graph bisystems
and its C∗-algebras
8. 8
Structure of the C∗-algebra OL−+
9. 9
K-groups for OL−+
10. 10
A duality: λ-graph systems as λ-graph bisystems
1 Introduction
Cuntz–Krieger in [5] initiated an interplay between symbolic dynamics and C∗-algebras.
They constructed a purely infinite simple C∗-algebra OA
called Cuntz–Krieger algebra from a topological Markov shift defined by a square matrix
A with entries in
{0,1}.
They showed that the algebra OA is a universal unique C∗-algebra generated by
a finite family of partial isometries subject to
certain operator relations defined by the matrix A.
They also proved not only that the stable isomorphism classes of the resulting C∗-algebras are invariant under topological conjugacy of the underlying topological Markov shifts,
but also that their K-groups and Ext-groups are realized as flow equivalence invariants of the Markov shifts.
Their pioneer work has given big influence to both classification theory of C∗-algebras and interplay between symbolic dynamical systems and C∗-algebras.
After their work, many generalizations of Cuntz–Krieger algebras
have come up from several view points (cf.
[6], [10], [15], [18], [32], …).
In [20] (cf. [3]),
the author attempted to generalize Cuntz–Krieger algebras
defined from topological Markov shifts
to C∗-algebras defined from general subshifts.
After [20],
he introduced a notion of λ-graph system written
L=(V,E,λ,ι).
It consists of a labeled Bratteli diagram (V,E,λ)
with its vertex set V=⋃l=0∞Vl,
edge set E=⋃l=0∞El,l+1
and a labeling map
λ:E⟶Σ,
together with a surjective map
ι:Vl+1⟶Vl,l∈Z+={0,1,…,}.
We require certain compatibility condition between the labeled Bratteli diagram
(V,E,λ) and the map ι:V⟶V,
called local property of λ-graph system.
He showed that any λ-graph system presents a subshift
and conversely
any subshift can be presented by a λ-graph system,
called the canonical λ-graph system.
He also introduced a notion of symbolic matrix system that is a matrix presentation of
λ-graph system,
and defined some algebraic relations called (properly)
strong shift equivalence in symbolic matrix systems.
He proved that
if two symbolic matrix systems are (properly) strong shift equivalent,
then their presenting subshifts are topologically conjugate.
Conversely if two subshifts are topologically conjugate,
then their canonically
constructed symbolic matrix systems from the subshifts
are (properly) strong shift equivalent (cf. [25]).
This result generalizes a fundamental classification theorem
of topological Markov shifts proved by R. Williams [39].
A construction of C∗-algebra from a λ-graph system
was presented in [23].
The class of such C∗-algebras are generalization of Cuntz–Krieger algebras.
The resulting C∗-algebra was written
OL
and whose K-theoretic groups were proved to be invariant
under (properly) strong shift equivalence of underlying symbolic dynamical systems,
and hence yield topological conjugacy invariants of general subshifts.
Especially, the K-groups K∗(OLΛ) and the Ext-group Ext∗(OLΛ)
for the C∗-algebra OLΛ
of the canonical λ-graph system
LΛ of a subshift Λ
was the first found computable invariant under flow equivalence
of general subshifts ([24]).
As seen in the construction of λ-graph system from subshifts in [22],
it is essentially due to its (right) one-sided structure of the subshifts.
Hence the resulting C∗-algebra OL
do not exactly reflect two-sided dynamics.
In this paper, we will attempt to construct two-sided extension of λ-graph systems, construct associated C∗-algebras
and study their structure.
We will introduce a notion of λ-graph bisystem over a finite alphabet.
It is a pair of two labeled Bratteli diagrams L−,L+
over alphabets Σ−,Σ+, respectively,
and satisfy certain compatible condition of their edge labeling,
called local property of λ-graph bisystem,
where two alphabet sets Σ−,Σ+ are not related in general.
The two labeled Bratteli diagrams are of the form
L−=(V,E−,λ−),L+=(V,E+,λ+).
They have common vertex sets
V=⋃l=0∞Vl
together with
edge sets
E−=⋃l=0∞El+1,l−
and
E+=⋃l=0∞El,l+1+
and labeling maps
λ−:E−⟶Σ−,λ+:E+⟶Σ+,
respectively.
Its matrix presentation is called a symbolic matrix bisystem written
(M−,M+).
It is a pair (Ml,l+1−,Ml,l+1+)l∈Z+
of sequences of rectangular matrices
such that
Ml,l+1−,Ml,l+1+
are symbolic matrices over Σ−,Σ+,
respectively
satisfying the following commutation relations
corresponding to the local property of λ-graph bisystem :
[TABLE]
where
≃κ
denotes the equality through exchanging
symbols
κ:β⋅α∈Σ−⋅Σ+⟶α⋅β∈Σ+⋅Σ−.
The notions of λ-graph bisystem and symbolic matrix bisystem are not only two-sided extensions of
the preceding λ-graph system and symbolic matrix system,
respectively,
but also generalization of them, respectively.
We will first show that any λ-graph bisystem presents two subshifts.
One is the subshift presented by the labeled Bratteli diagram L−,
and the other one is the one presented the labeled Bratteli diagram L+.
If a λ-graph bisystem satisfies a particular condition on edge labeling called
FPCC (Follower and Predecessor Compatibility Condition),
then the two presented subshifts coincide.
Conversely any subshift is presented by a λ-graph bisystem satisfying FPCC,
called the canonical λ-graph bisystem for the subshift (Proposition 5.4).
We will introduce a notion of properly strong shift equivalence in
symbolic matrix bisystems satisfying FPCC, and prove the following theorem.
Two subshifts are topologically conjugate
if and only if
their canonical symbolic matrix bisystems
are properly strong shift equivalent.
The proof of the only if part of the theorem is harder than that of the if part.
To prove the only if part,
we basically follow the idea given in the proof of [22, Theorem 4.2],
and provide a notion of bipartite λ-graph bisystem as well as bipartite symbolic matrix bisystem.
We will show that the canonical λ-graph bisystems, whose presenting subshifts are topologically conjugate, are connected by a finite chain of bipartite λ-graph bisystems.
We will also
introduce the notion of strong shift equivalence
in general symbolic matrix bisystems.
Properly strong shift equivalence in symbolic matrix bisystems
satisfying FPCC
implies strong shift equivalence.
We will construct a pair of C∗-algebra
written OL−+,OL+− from a λ-graph bisystem
(L−,L+).
The two algebras
OL−+,OL+− are symmetrically constructed as the C∗-algebras
of certain étale groupoids
GL−+,GL+−.
The groupoids
GL−+,GL+−
are Deaconu–Renault groupoids for certain shift dynamical systems
(XL−+,σL−),(XL+−,σL+)
associated with the λ-graph bisystem
(L−,L+).
They are also regarded as
a generalization of the étale groupoids
constructed from λ-graph systems in [23].
We will introduce a notion of σL−-condition (I)
for λ-graph bisystem
that guarantees the étale groupoid GL−+ being essentially principal
and uniqueness of the C∗-algebra OL−+ subject to the operator relations
(L−,L+) below.
Let {v1l,…,vm(l)l} be the vertex set Vl.
For an edge e−∈El+1,l−,
its source vertex and terminal vertex
are denoted by
s(e−)∈Vl+1 and t(e−)∈Vl, respectively.
For an edge e+∈El,l+1+,s(e+)∈Vl,t(e+)∈Vl+1
are similarly defined.
The directions of edges in L−
are upward, whereas those of edges in L+
are downward.
The transition matrices Al,l+1−,Al,l+1+
for L−,L+
are defined by setting
[TABLE]
for
i=1,2,…,m(l),j=1,2,…,m(l+1),β∈Σ−,α∈Σ+.
We will prove the following theorem, that is one of main results of the paper.
Suppose that a λ-graph bisystem (L−,L+)
satisfies σL−-condition (I).
Then the C∗-algebra OL−+
is the universal unital unique C∗-algebra
generated by
partial isometries
Sα indexed by symbols α∈Σ+
and mutually commuting projections
Eil(β) indexed by vertices
vil∈Vl and symbols β∈Σ−
with
β∈Σ1−(vil)
subject to the following operator relations called (L−,L+):
[TABLE]
where
Σ1−(vil)={λ−(e−)∈Σ−∣e−∈El,l−1− such that s(e−)=vil}
for vil∈Vl.
For the other C∗-algebra
OL+−,
we have a symmetric structure theorem to the above Theorem.
λ-graph systems are typical examples of λ-graph bisystems.
If a λ-graph bisystem (L−,L+)
comes from a λ-graph system L,
then the C∗-algebra
OL−+ coincides with the C∗-algebra
OL
of a λ-graph system L
previously studied in [23].
For a λ-graph bisystem
(L−,L+),
let us denote by ΩL−
the compact Hausdorff space of path spaces of the labeled Bratteli diagram
L−.
By the local property of λ-graph bisystem,
the edges labeled symbols α∈Σ+ of the other labeled Bratteli diagram L+
give rise to an endomorphism on the abelian group
C(ΩL−,Z) of Z-valued continuous functions on
ΩL−,
that is denoted by λL−∗+.
Then we have a K-theory formulas for the C∗-algebra
OL−+.
Similar K-theory formulas for
the other C∗-algebra OL+− hold.
Since the properly strong shift equivalence class of
the canonical symbolic matrix bisystem for a subshift is
invariant under topological conjugacy of the subshift,
the following result tells us that
the above K-groups Ki(OL−+),i=0,1
yield topological conjugacy invariants of subshifts.
Let (M−,M+) and (N−,N+)
be symbolic matrix bisystems.
Let
(LM−,LM+) and
(LN−,LN+)
be the associated λ-graph bisystems both of which satisfy FPCC.
Suppose that
(M−,M+) and (N−,N+)
are properly strong shift equivalent.
Then
the C∗-algebras
OLM−+ and
OLN−+
are Morita equivalent, so that their K-groups
Ki(OLM−+) and
Ki(OLN−+)
are isomorphic for i=0,1.
The K-groups Ki(OLΛ−+),i=0,1
of the C∗-algebra
OLΛ−+
of the canonical λ-graph bisystem
(LΛ−,LΛ+)
of a subshift Λ is invariant under topological conjugacy of subshifts.
Let L=(V,E,λ,ι) be a λ-graph system over Σ.
Put Σ+=Σ.
Let L+ be the original labeled Bratteli diagram L without the map
ι:V⟶V.
Define a new alphabet
Σ−={ι}.
The other
labeled Bratteli diagram
L−=(V,E−,λ−) over alphabet Σ−
is defined in the following way.
Define an edge e−∈El+1,l−
if
ι(vjl+1)=vil
so that
s(e−)=vjl+1,t(e−)=vil
and
λ−(e−)=ι∈Σ−.
Then we have a labeled Bratteli diagram
L−=(V,E−,λ−) over alphabet Σ−.
Then the local property of the λ-graph system L makes the pair
(L−,L+) a λ-graph bisystem.
Hence we have a λ-graph bisystem from a λ-graph system.
Let XL+−
be the unit space of the étale groupoid GL+−.
The ι-map induces a shift homeomorphism on XL+−
denoted by σL+.
It yields an automorphism written σL+∗
on the commutative C∗-algebra C(XL+−)
of continuous functions on XL+−.
Then we see the following.
*Let L be a left-resolving λ-graph system over Σ.
Let (L−,L+) be the associated λ-graph bisystem.
Then we have
*
(i)
The C∗-algebra OL−+ is canonically isomorphic to
the C∗-algebra OL
of the original λ-graph system L.
2. (ii)
The C∗-algebra OL+− is isomorphic to the crossed product
C(XL+−)⋊σL+∗Z.
An irreducible finite directed graph naturally gives rise to a λ-graph system.
Let A be its transition matrix for a given finite directed graph.
We then have the two-sided
topological Markov shift
(ΛA,σA) for the matrix A.
We denote by LA the associated λ-graph system for the finite directed graph.
The λ-graph bisystem from LA
obtained by the above procedure is
(LA−,LA+).
As a corollary of the above proposition we have
The C∗-algebra OLA−+
is isomorphic to the Cuntz–Krieger algebra OA,
whereas the other C∗-algebra
OLA+−
is isomorphic to the C∗-algebra of the crossed product
C(ΛA)⋊σA∗Z
of the commutative C∗-algebra
C(ΛA) by the automorphism
σA∗
induced by the homeomorphism σA
of the shift on ΛA.
The above corollary suggests us that the Cuntz–Krieger algebra
OA and the crossed product C∗-algebra C(ΛA)⋊σA∗Z
have a relation like a “duality” pair.
We finally refer to the transpose of λ-graph bisystems and its C∗-algebras.
Proposition 1.8**.**
For a λ-graph bisystem (L−,L+),
denote by
L−t (resp. L+t) the labeled Bratteli diagram obtained by reversing the directions of all edges in L− (resp. L+).
Then the pair
(L+t,L−t) becomes a λ-graph bisystem.
We then have a canonical isomorphisms of C∗-algebras:
[TABLE]
The paper is organized in the following way:
Section 1 is Introduction in which we describe a brief survey of the paper.
In Section 2, we review λ-graph systems, symbolic matrix systems and their C∗-algebras.
The operator relations among the canonical generating partial isometries and projections in the C∗-algebra OL associated with a λ-graph system L are described.
In Section 3,
we introduce a new notion of λ-graph bisystem, that is a main target of the paper. It is a generalization of λ-graph system surveyed in the preceding section.
Several examples of λ-graph bisystems are presented.
In Section 4, a matrix presentation of a λ-graph bisystem is introduced.
It is called a symbolic matrix bisystem, that is also a generalization of symbolic matrix system surveyed in Section 2.
In Section 5, it is shown that for any subshift, there exists a λ-graph bisystem
satisfying FPCC and presenting the subshift.
The λ-graph bisystem is called the canonical λ-graph bisystem for the subshift.
In Section 6, properly strong shift equivalence in symbolic matrix bisystems satisfying FPCC is introduced.
It is proved that
two subshifts are topologically conjugate if and only if
their canonical symbolic matrix bisystems are properly strong shift equivalent.
We also introduce a notion of strong shift equivalence in general symbolic matrix bisystems.
In Section 7, two étale groupoids
GL−+,GL+−
are introduced as the Deaconu–Renault groupoids constructed from cerain shift dynamical systems associated with continuous graphs in the sense of Deaconu [8]
from a λ-graph bisystem (L−,L+).
We then define the C∗-algebras OL−+,OL+− as their groupoid C∗-algebras
C∗(GL−+),C∗(GL+−),
respectively.
In Section 8, condition (I) on a λ-graph bisystem (L−,L+) is introduced.
Under the condition (I),
the C∗-algebra OL−+ as well as OL+−
is realized as a universal unital unique C∗-algebra
generated by partial isometries and projections subject to
certain operator relations encoded by the structure of the
λ-graph bisystem (L−,L+).
It is one of the main results of the paper.
In Section 9,
K-theory formulas of the C∗-algebras OL−+,OL+− are presented.
It is shown that if two symbolic matrix bisystems satisfying FPCC are properly strong shift equivalent, then the C∗-algebras associated with the λ-graph bisystems of the symbolic matrix bisystems are Morita equivalent, so that their K-theory groups yield topological conjugacy invariants of subshifts.
In Section 10,
the two C∗-algebras OL−+,OL+− for λ-graph bisystems
coming from λ-graph systems are studied.
Let (L−,L+) be the λ-graph bisystem defined by a λ-graph system
L.
It is proved that the C∗-algebra
OL−+ is isomorphic to the C∗-algebra
OL of the λ-graph system L in
Section 2, and the other C∗-algebra
OL+− is isomorphic to the crossed product
C(XL+−)⋊σL+∗Z
of the commutative C∗-algebra on the unit space
XL+− of the groupoid GL+−
by the homeomorphism of the shift σL+.
In particular, we know that
the Cuntz–Krieger algebra OA for a finite nonnegative matrix A and
the C∗-algebra of the crossed product C(ΛA)⋊σA∗Z
of the two-sided topological Markov shift ΛA
by the homeomorphism of the shift
are regarded as a duality pair.
Throughout the paper,
the notation N,Z+ will denote the set of positive integers, the set of nonnegative integers,
respectively.
By a nonnegative matrix we mean a finite rectangular matrix with entries in nonnegative integers.
2 Subshifts, λ-graph systems and its C∗-algebra
Let Σ be a finite set, which we call an alphabet.
Each element of Σ is called a symbol or a label.
Denote by ΣZ the set of bi-infinite sequences
(xn)n∈Z of elements of Σ.
We endow ΣZ with the infinite product topology,
so that it is a compact Hausdorff space.
Let us denote by
σ:ΣZ⟶ΣZ
the homeomorphism defined by the left shift
σ((xn)n∈Z)=(xn+1)n∈Z.
Let Λ⊂ΣZ
be a σ-invariant closed subset, that is σ(Λ)=Λ.
Then the topological dynamical system
(Λ,σ)
is called a subshift over Σ,
and the space Λ is called the shift space for (Λ,σ).
We often write a subshift (Λ,σ) as Λ for short.
For a subshift Λ and n∈Z+,
let us denote by Bn(Λ)
the set of admissible words in Λ with length n,
that is defined by
Bn(Λ)={(x1,…,xn)∈Σn∣(xi)i∈Z∈Λ}.
For N=∣Σ∣, the subshift
(ΣZ,σ) is called the full N-shift.
More generally for an N×N matrix A=[A(i,j)]i,j=1N
with entries A(i,j) in {0,1},
the subshift ΛA
defined by
[TABLE]
is called the topological Markov shift defined by the matrix A.
A topological Markov shift is often called a shift of finite type or simply SFT.
The class of sofic shifts are a generalized class containing shifts of finite type.
Let G=(V,E,λ)
be a finite labeled directed graph with
vertex set V,
edge set E
and labeling map
λ:E⟶Σ.
For n∈N, let
[TABLE]
be the set of words appearing in the labeled graph G,
where
t(ei) denote the terminal vertex of ei and
s(ei+1) denote the source vertex of ei+1.
Then the sofic shift ΛG for the labeled graph
G is defined by
[TABLE]
([11], [38]).
A labeled graph G
is said to be left-resolving (resp. right-resolving),
if λ(e)=λ(f) implies t(e)=t(f) (resp. s(e)=s(f)).
It is well-known that any sofic shift may be presented by a left-resolving labeled graph
(cf. [16], [17], [19]).
It is also presented by a right-resolving labeled graph.
There are lots of non-sofic subshifts, for example, Dyck shifts, β-shifts,
substitution subshifts, etc. (cf. [19]).
Non-sofic shifts can not be presented by any finite labeled graphs.
A λ-graph system is a graphical object to present general subshifts
([22]).
The idea defining it is basically due to a notion coming from operator algebras,
called Bratteli diagram (cf. [1]).
Let L=(V,E,λ,ι)
be a λ-graph system over Σ with vertex set
V=⋃l=0∞Vl
and edge set
E=⋃l=0∞El,l+1
that is labeled with symbols in Σ by λ:E→Σ,
and that is supplied with a surjective map
ι(=ιl,l+1):Vl+1→Vl
for each
l∈Z+.
Here the vertex sets Vl,l∈Z+
are finite disjoint sets,
as well as
El,l+1,l∈Z+
are finite disjoint sets.
An edge e in El,l+1 has its source vertex s(e) in Vl
and its terminal vertex t(e)
in
Vl+1
respectively.
Every vertex in V has a successor and every
vertex in Vl for l∈N has a predecessor.
It is then required for definition of λ-graph system that there exists an edge in El+1,l+2
with label α and its terminal is v∈Vl+2
if and only if
there exists an edge in El,l+1
with label α and its terminal is ι(v)∈Vl+1.
For
u∈Vl and
v∈Vl+2,
we put
[TABLE]
As a key hypothesis for L to be a λ-graph system,
we require the condition
that there exists a bijective correspondence between
Eι(u,v)
and
Eι(u,v)
that preserves labels
for each pair (u,v)∈Vl×Vl+2
of vertices.
We call this property the local property of λ-graph system.
For a λ-graph system L,
let
WL be the set of finite label sequences appearing
as concatenating finite labeled paths in L.
Then there exists a unique subshift ΛL
whose admissible words
B∗(ΛL)=⋃n=0∞Bn(ΛL)
coincide with WL.
The subshift
ΛL is called the subshift presented by
L.
Conversely, we have a canonical method to construct a λ-graph system
LΛ from an arbitrary subshift Λ
([22]).
The λ-graph system is called the canonical λ-graph system for the subshift.
A λ-graph system has its matrix presentation,
that is called a symbolic matrix system denoted by (I,M).
In [22], the notation (M,I) has been used for symbolic matrix system.
In this paper, the notation (I,M) will be used instead.
For a λ-graph system L=(V,E,λ,ι) over Σ,
we define its transition matrix system(Il,l+1,Al,l+1)l∈Z+ by setting
[TABLE]
for
i=1,2,…,m(l),j=1,2,…,m(l+1),α∈Σ.
For l∈Z+ and i=1,2,…,m(l),j=1,2,…,m(l+1),
we define
Ml,l+1(i,j)=α1+⋯+αn if
Al,l+1(i,αk,j)=1 for k=1,…,n.
That is Ml,l+1(i,j)=α1+⋯+αn
if and only if
there exist labeled edges from vil to vjl+1 labeled
α1,…,αn.
By the local property of λ-graph system, the matrix equations
[TABLE]
hold, where in the above equality
α⋅1 and 1⋅α for α∈Σ
are identified with each other, and also both
α⋅0 and 0⋅α are recognized as [math].
The sequence
(Il,l+1,Ml,l+1),l∈Z+ of pairs of matrices
Il,l+1,Ml,l+1
is called the symbolic matrix system associated to the
λ-graph system L.
Conversely
a sequence (Il,l+1,Ml,l+1),l∈Z+ of pairs
of symbolic matrices Ml,l+1 over alphabet Σ
and matrices Il,l+1 over {0,1} satisfying
(2.4) gives rise to a λ-graph system over Σ,
and hence a subshift.
The sequence (Il,l+1,Ml,l+1),l∈Z+ is written (I,M),
or (IM,M).
In [22] (cf. [25]),
the author introduced a notion of strong shift equivalence in symbolic matrix systems.
It has been proved that if two symbolic matrix systems are strong shift equivalent,
then the presenting subshifts are topologically conjugate.
Conversely if two subshifts are topologically conjugate, then the canonically constructed symbolic matrix systems are strong shift equivalent.
Therefore classification of subshifts are completely deduced to the classification of symbolic matrix systems up to strong shift equivalence.
This result is a generalization of the fundamental classification theory
of topological Markov shifts by R. Williams ([39], see [30] for sofic case).
The author in [22]
also introduced notions of
K-groups and Bowen–Franks groups for symbolic matrix systems and hence for
λ-graph systems, and proved that they are all strong shift equivalence invariants of symbolic matrix systems.
Hence these invariants give rise to topological conjugacy invariants of general subshifts.
These invariants are regarded as K-theoretic invariants of the associated
C∗-algebras.
A λ-graph system L
is said to be left-resolving if e,f∈E with
t(e)=t(f) and λ(e)=λ(f) implies e=f.
In what follows all λ-graph systems are assumed to be left-resolving.
Let us denote by {v1l,…,vm(l)l} the set Vl of vertices at level l.
The author in [23] introduced
a C∗-algebra OL associated to the λ-graph system as a generalization of Cuntz–Krieger algebras.
The C∗-algebra OL was first constructed as a C∗-algebra
C∗(GL) of an étale groupoid
GL associated to L.
It is realized as a universal C∗-algebra in the following way.
Let L be a left-resolving λ-graph system over alphabet Σ.
Then
the C∗-algebra OL
is realized as a universal concrete
C∗-algebra generated by partial isometries
Sα indexed by symbols α∈Σ
and projections Eil,i=1,2,…,m(l) indexed by vertices vil∈Vl,l∈Z+
satisfying the following operator relations called (L):
[TABLE]
for
i=1,2,…,m(l),\l∈Z+,α∈Σ.
If in particular
L satisfies condition (I) in the sense of [23],
the operator relations determine the C∗-algebra in a unique way.
Let G=(V,E,λ)
be a finite labeled directed graph with labeling map
λ:E⟶Σ.
We assume that the labeling is left-resolving in the above mentioned sense.
Then we have a λ-graph system
LG from the finite labeled graph G
by setting
Vl=V,El,l+1=E for every l∈Z+
and
ι(v)=v,v∈V.
Then the C∗-algebra OG
is so called a graph algebra with labeled edges
([23, Proposition 7.1], cf. [2], [18]).
Any topological Markov shift is realized as an edge shift with labeled edges,
then the operator relations among its canonical generators above
reduce to the usual operator relations of Cuntz–Krieger algebras.
Hence the class of C∗-algebras OL generalizes
the class of Cuntz–Krieger algebras.
It actually generalizes the class of C∗-algebras associated with subshifts
[20] (cf. [3]).
The K-groups for symbolic matrix system described above is nothing but
the K-groups Ki(OL) of the C∗-algebra of the
λ-graph system L for the symbolic matrix system ([23]).
A λ-graph system seems to fit in describing one-sided structure of subshifts.
Actually even if a subshift is a topological Markov shift,
the associated Cuntz–Krieger algebra it-self does not cover two-sided structure of the underlying topological Markov shift.
In this paper, we will generalize λ-graph system
and introduce two-sided extension of it,
and construct associated C∗-algebras.
3 λ-graph bisystems
Let Σ− and Σ+ be two finite alphabets.
They are generally not related to each other.
We will generalize the definition of λ-graph system to two-sided versions
in the following way.
Definition 3.1**.**
A λ-graph bisystem(L−,L+) is a pair of labeled Bratteli diagrams
L−=(V−,E−,λ−) over Σ− and
L+=(V+,E+,λ+) over Σ+
satisfying the following five conditions:
(i)
V−=V+=⋃l=0∞Vl disjoint union of finite sets Vl,l∈Z+
with m(l):=∣Vl∣<∞
for l∈Z+.
2. (ii)
E−=⋃l=0∞El+1,l−
and
E+=⋃l=0∞El,l+1+
disjoint unions of finite sets
El+1,l−,El,l+1+,l∈Z+,
respectively.
3. (iii)
(1) Every edge e−∈El+1,l− satisfies s(e−)∈Vl+1,t(e−)∈Vl,
and
every edge e+∈El,l+1+ satisfies s(e+)∈Vl,t(e+)∈Vl+1.
(2) For every vertex v∈Vl with l=0,
there exists e−∈El+1,l−,f−∈El,l−1− such that
v=s(f−)=t(e−),
and for every vertex v∈V0,
there exists e−∈E1,0− such that
v=t(e−).
For every vertex v∈Vl with l=0,
there exists e+∈El,l+1+,f+∈El−1,l+ such that
v=t(f+)=s(e+),
and for every vertex v∈V0,
there exists e+∈E0,1+ such that
v=s(e+).
4. (iv)
The labeling map λ−:E−⟶Σ−
is right-resolving, that is, the condition
s(e−)=s(f−),λ−(e−)=λ−(f−)
implies e−=f−.
The labeling map λ+:E+⟶Σ+
is left-resolving, that is, the condition
t(e+)=t(f+),λ+(e+)=λ+(f+)
implies e+=f+.
5. (v)
The property (v) is called the local property of λ-graph bisystem.
The pair (L−,L+) is called a λ-graph bisystem overΣ±.
We write
V:=V−=V+ and
{v1l,…,vm(l)l} for the vertex set Vl.
A λ-graph bisystem (L−,L+) is said to be standard
if its top vertex set V0 is a singleton.
A λ-graph bisystem (L−,L+) is said to have a common alphabet
if Σ−=Σ+.
In this case, we write the alphabet Σ−=Σ+
as Σ,
and we say that (L−,L+) is a λ-graph bisystem over common alphabet
Σ.
We write an edge e−∈E− (resp. e+∈E+) as e without
− sign (resp. + sign) unless we specify.
Let (L−,L+) be a λ-graph bisystem over Σ±.
For a vertex u∈Vl,
we define
its follower set F(u) in L− and
its predecessor set P(u) in L+
as in the following way:
[TABLE]
Each element of F(u) is figured such as
[TABLE]
Similarly,
[TABLE]
Each element of P(u) is figured such as
[TABLE]
A standard λ-graph bisystem (L−,L+)
having a common alphabet is said to satisfy
Follower-Predecessor Compatibility Condition,
FPCC for short, if (L−,L+) satisfies the condition
F(u)=P(u)
for every vertex u∈Vl,l∈N.
We will present several examples of λ-graph bisystems.
Example 3.2**.**
(i) λ-graph systems.
Let L=(V,E,λ,ι) be a λ-graph system over Σ.
We may construct a λ-graph bisystem (L−,L+) from L in the following way.
Let us recognize the map ι:E⟶Σ
with a new symbol written ι, and
define a new alphabet
Σ−:={ι}.
The original alphabet Σ is written Σ+.
We define
El,l+1+:=El,l+1 for l∈Z+
and
λ+:=λ:E+⟶Σ+.
We then have a labeled Bratteli diagram
L+:=(V,E+,λ+) over alphabet Σ+.
The other
labeled Bratteli diagram
L−:=(V,E−,λ−) over alphabet Σ−
is defined in the following way.
Define an edge e−∈El+1,l−
if
ι(vjl+1)=vil
so that
s(e−)=vjl+1,t(e−)=vil
and
λ−(e−):=ι∈Σ−.
Then we have a labeling map
λ−:El+1,l−⟶{ι}=Σ−,
and hence a labeled Bratteli diagram
L−:=(V,E−,λ−) over alphabet Σ−.
Then the local property of the λ-graph system L makes the pair
(L−,L+) a λ-graph bisystem.
This λ-graph bisystem does not satisfy FPCC.
Figure 1 in the end of this section is the first six levels of the λ-graph bisystem
defined by the canonical λ-graph system for the β-shift for β=23,
that was used in [14].
The β-shift is not sofic.
In the λ-graph system, the alphabet Σ+=Σ={0,1}.
(ii) A λ-graph bisystem for full N-shift.
Let N be a positive integer with N>1.
Take finite alphabets
Σ−={α1−,…,αN−}
and
Σ+={α1+,…,αN+}.
We will construct a λ-graph bisystem
(LN−,LN+)
in the following way.
Let
Vl={vl} one point set for each l∈Z+,
and
El+1,l−={e1−,…,eN−},
El,l+1+={e1+,…,eN+}
such that
[TABLE]
We set
LN−=(V,E−,λ−)
and
LN+=(V,E+,λ+).
Then
(LN−,LN+) is a λ-graph bisystem
satisfying FPCC.
(iii) A λ-graph bisystem for golden mean shift.
The topological Markov shift defined by the matrix
F=[1110]
is called the golden mean shift (cf. [19]).
Let
Σ−={α−,β−}
and
Σ+={α+,β+}.
We set
V0={v10},V1={v11,v21},Vl={v1l,v2l,v3l,v4l} for l≥2.
The labeled Bratteli diagram LF−
is defined as follows.
Define directed edges labeled symbols in Σ− such as
[TABLE]
for l≥2.
The other labeled Bratteli diagram LF+
is defined as follows.
Define directed edges labeled symbols in Σ+ such as
[TABLE]
for l≥2.
The pair (L−,L+)
becomes a λ-graph bisystem satisfying FPCC.
It is figured in Figure 2 in the end of this section.
(iv) A λ-graph bisystem for even shift.
The sofic shift defined by the symbolic matrix
E=[αββ0]
is called the even shift (cf. [19]).
Let
Σ+={α+,β+} and
Σ−={α−,β−}.
We set
V0={v10},V1={v11,v21},V2={v12,v22,v32},Vl={v1l,v2l,v3l,v4l} for l≥3.
The labeled Bratteli diagram LE− is defined as follows.
Define directed edges labeled symbols in Σ− such as
[TABLE]
for l≥3.
The other labeled Bratteli diagram LE+
is defined as follows.
Define directed edges labeled symbols in Σ+ such as
[TABLE]
for l≥3.
The pair (LE−,LE+)
becomes a λ-graph bisystem that satisfies FPCC.
It is figured in Figure 3
in the end of this section.
Let (L−,L+) be a λ-graph bisystem.
Let us denote by L−t
the labeled Bratteli diagram for which every edge is reversed with the original edge.
This means that for an edge e−∈El+1,l− such that
s(e−)∈Vl+1,t(e−)∈Vl, the reversed edge e−t is defined
by t(e−t):=s(e−)∈Vl+1,s(e−t):=t(e−)∈Vl
and λ−(e−t):=λ−(e−)∈Σ−.
The resulting labeled Bratteli diagram is written L−t.
We similarly define a labeled Bratteli diagram L+t
from L+.
It is easy to see that the pair (L+t,L−t)
becomes a λ-graph bisystem.
It is called the transpose of (L−,L+) and written (L−,L+)t.
where upward arrows ⟵
in L− are labeled ι,
and downward arrows ⟵ and ⟵ (bold)
in L+ are labeled [math] and 1, respectively.
where upward arrows ⟵ and ⟵ (bold)
in LF− are labeled α− and β−, respectively,
and downward arrows ⟵ and ⟵ (bold)
in LF+ are labeled α+ and β+, respectively.
where upward arrows ⟵ and ⟵ (bold)
in LE− are labeled α− and β−, respectively,
and downward arrows ⟵ and ⟵ (bold)
in LE+ are labeled α+ and β+, respectively.
4 Symbolic matrix bisystems
Let Σ be a finite alphabet.
We denote by SΣ the set of finite formal sums of elements of Σ.
By a symbolic matrix A over Σ
we mean a rectangular finite matrix A=[A(i,j)]i,j
whose entries in SΣ.
We write the empty word ∅ as [math] in SΣ.
For the symbolic matrix A,
we write an edge ek labeled αk
for k=1,…,n for a vertex vi to a vertex vj
if A(i,j)=α1+⋯+αn.
For two alphabets Σ,Σ′,
the notation Σ⋅Σ′ denotes the set
{a⋅b∣a∈Σ,b∈Σ′}.
The following notion of specified equivalence
between symbolic matrices due to M. Nasu in
[30], [31].
For two symbolic matrices
A over alphabet Σ
and
A′ over alphabet Σ′
and bijection
ϕ from a subset of Σ onto a subset of Σ′,
we call A and A′ are specified equivalent under specification
ϕ if A′ can be obtained from A
by replacing every symbol
α appearing in A by ϕ(α).
We write it as
A≃ϕA′.
We call ϕ a specification from Σ to Σ′.
For two alphabet Σ1,Σ2,
the bijection
α⋅β∈Σ1⋅Σ2⟶β⋅α∈Σ2⋅Σ1
naturally yields a bijection from
SΣ1⋅Σ2
to
SΣ2⋅Σ1
that we denote by κ
and call the exchanging specification
between Σ1 and Σ2.
Definition 4.1**.**
A symbolic matrix bisystem(Ml,l+1−,Ml,l+1+),l∈Z+ is a pair of
sequences of rectangular symbolic matrices
Ml,l+1− over Σ− and
Ml,l+1+ over Σ+
satisfying
the following five conditions:
(i)
Both Ml,l+1− and Ml,l+1+ are m(l)×m(l+1)
rectangular symbolic matrices with m(l)∈N for l∈Z+.
2. (ii)
(1) For i, there exists j such that Ml,l+1−(i,j)=0, and
for i, there exists j such that Ml,l+1+(i,j)=0.
(2) For j, there exists i such that Ml,l+1−(i,j)=0, and
for j, there exists i such that Ml,l+1+(i,j)=0.
3. (iii)
Each component of both Ml,l+1− and Ml,l+1+
does not have multiple symbols.
This means that
if Ml,l+1−(i,j)=α1+⋯+αn,
then the symbols α1,…,αn
are all distinct each other.
The same condition is required for Ml,l+1+.
4. (iv)
For each j=1,2,…,m(l+1),
both the jth columns
[Ml,l+1−(i,j)]i=1m(l)
and
[Ml,l+1+(i,j)]i=1m(l)
do not have multiple symbols.
Namely, if a symbol α appears in Ml,l+1−(i,j) for some
i∈{1,2,…,m(l)},
then it does not appear in any other row Ml,l+1−(i′,j) for
i′=i,
and Ml,l+1+ has the same property.
5. (v)
Ml,l+1−Ml+1,l+2+≃κMl,l+1+Ml+1,l+2−
for l∈Z+,
that means for i=1,2,…,m(l),j=1,2,…,m(l+2),
[TABLE]
where κ is the exchanging specification between
Σ and Σ′.
The matrix Ml,l+1− (resp. Ml,l+1+) satisfying
the condition (iv) is said to be right-resolving (resp. left-resolving).
The condition (v) exactly corresponds to the local property of λ-graph bisystems (v)
in Definition 3.1.
The pair (M−,M+) is called a symbolic matrix bisystem overΣ±.
It is easy to see that a symbolic matrix bisystem is exactly
a matrix presentation of λ-graph bisystem.
A symbolic matrix bisystem (M−,M+) is said to be standard
if m(0)=1, that is its row sizes of the matrices M0,1− and M0,1+ are one.
A symbolic matrix bisystem (M−,M+) is said to have a common alphabet
if Σ−=Σ+.
In this case, write the alphabet Σ−=Σ+
as Σ,
and say that (M−,M+) is a symbolic matrix bisystem over common alphabet Σ.
It is said to satisfy
Follower-Predecessor Compatibility Condition,
FPCC for short,
if for every l∈N and j=1,2,…,m(l),
the set of words appearing in [M0,1−M1,2−⋯Ml−1,l−](1,j)
coincides with the set of transposed words appearing in
[M0,1+M1,2+⋯Ml−1,l+](1,j).
Two symbolic matrix bisystems
(M−,M+) over ΣM±
and
(N−,N+) over ΣN±
are said to be isomorphic
if their sizes m(l)×m(l+1) and n(l)×n(l+1)
of the matrices Ml,l+1± and Nl,l+1±
coincide, that is m(l)=n(l), for each l∈Z+ and
there exists a specification ϕ
from ΣM to ΣN
and an m(l)×m(l)-permutation matrix
Pl for each l∈Z+ such that
[TABLE]
Let
A=[αij]i,j=1N
be an N×N symbolic matrix
over Σ={αij∣i,j=1,…,N}.
We set alphabets
Σ−={αij−∣i,j=1,…,N}
and
Σ+={αij+∣i,j=1,…,N}.
We will define
N2×N2 symbolic matrices
MA− over Σ− and
MA+ over Σ+
in the following way.
Define first the N×N matrix
A+:=α11+⋮αN1+⋯⋯α1N+⋮αNN+
and the diagonal matrix
αij−IN
whose diagonal entries are
(αij−,…,αij−).
We define
N2×N2 symbolic matrices
MA−,MA+
by setting
[TABLE]
For N=2 and a 2×2 symbolic matrix
A=[acbd],
we have
[TABLE]
Let
κ:Σ−⋅Σ+⟶Σ+⋅Σ−
be the exchanging specification defined by
κ(β⋅α)=α⋅β
for α∈Σ+,β∈Σ−.
We have the following lemma by straightforward calculation.
Lemma 4.2**.**
For an N×N symbolic matrix
A=[αij]i,j=1N,
we have a specified equivalence
MA−⋅MA+≃κMA+⋅MA−.
Proof.
The matrices
MA−⋅MA+
and
MA+⋅MA−
are N×N matrices over N×N symbolic matrices.
Their (i,j)th block matrices are
[TABLE]
respectively, so that we have
a specified equivalence
MA−⋅MA+≃κMA+⋅MA−.
∎
The following proposition is straightforward.
Proposition 4.3**.**
For an N×N symbolic matrix
A=[αij]i,j=1N,
we put
[TABLE]
Then (MAl,l+1−,MAl,l+1+)l∈Z+
becomes a standard symbolic matrix bisystem.
If in particular we identify the symbols αij−
with αij+ for i,j=1,…,N
and put Σ=Σ−=Σ+, then the symbolic matrix bisystem
(MAl,l+1−,MAl,l+1+)l∈Z+ satisfies FPCC.
Remark 4.4**.**
Let (I,M) be a symbolic matrix system over Σ
as in Section 2.
It satisfies the equality (2.4).
We set
Σ+=Σ and
Σ−={1}.
By putting
[TABLE]
we have a symbolic matrix bisystem (M−,M+).
5 Subshifts and λ-graph bisystems
We will show that any λ-graph bisystem (L−,L+) gives rise to two subshifts
written ΛL− and ΛL+.
They are called the presenting subshifts by (L−,L+).
If in particular (L−,L+) satisfies FPCC,
then the two subshifts coincide, and determine one specific subshift.
Conversely any subshift yields a λ-graph bisystem satisfying FPCC whose presenting subshift
is the original subshift.
We fix an arbitrary λ-graph bisystem (L−,L+) over Σ±.
Let us denote by WL−,WL+
the set of words appearing in the labeled Bratteli diagram
L−,L+ respectively.
They are defined by
[TABLE]
It is easy to see that if (L−,L+) satisfies FPCC,
then WL−=WL+.
In this case we write W(L−,L+):=WL+(=WL−).
Lemma 5.1**.**
For a λ-graph bisystem (L−,L+)(not necessarily satisfying FPCC),
there exist a unique pair of subshifts
ΛL− and ΛL+
such that their sets of admissible words
are
WL− and WL+,
respectively.
Proof.
It suffices to show that the set
WL+ is a language in the sense of [19, Definition 1.3.1]
because of [19, Proposition 1.3.4].
It is clear that
any subword of a word of WL+ belongs to WL+.
We will show any word of WL+ may extend to its both sides.
For w∈WL+,
it is obvious that
there exists α+∈Σ+ such that
wα+∈WL+.
By the local property of λ-graph bisystem,
we may find
β+∈Σ+ such that
β+w∈WL+.
Hence a word of WL+ can extend to its both sides,
proving the set WL+ is a language.
We similarly see that WL− is a language.
Therefore they give rise to subshifts
written
ΛL+ and ΛL−, respectively,
such that
their admissible words
are WL+ and WL+, respectively.
∎
The subshifts ΛL− and ΛL+
are called the subshifts presented by (L−,L+).
If in particular (L−,L+) satisfies FPCC,
then WL−=WL+
so that
their presenting subshifts ΛL− and ΛL+
coincide.
Hence a λ-graph bisystem (L−,L+) satisfying FPCC
yields a unique subshift which is called the subshift presented by
(L−,L+) and written
Λ(L−,L+).
We will next construct a λ-graph bisystem satisfying FPCC
from an arbitrary subshift Λ
such that the presented subshift
by the λ-graph bisystem coincides with the original subshift.
We fix a subshift Λ over Σ.
For k,l∈Z with k<l and x=(xn)n∈Z∈Λ,
we set
[TABLE]
[TABLE]
and
Wk,k(x):=∅.
In the above picture, the finite sequence of boxes
□□⋯□
denotes the words
(μk+1,μk+2,…,μl−1) of length l−k−1
that can put in between the left infinite sequence
(…,xk−1,xk) of x
and the right infinite sequence
(xl,xl+1,…) of x.
Two bi-infinite sequences x,y∈Λ
are said to be (k,l)-centrally equivalent if Wk,l(x)=Wk,l(y),
and written x(k,l)∼cy.
This means that the set of words
put in between x(−∞,k] and x[l,∞)
coincides with
the set of words put in between
y(−∞,k] and y[l,∞),
where x(−∞,k]=(xn)n≤k
and
x[l,∞)=(xn)n≥l.
Define the set of equivalence classes
[TABLE]
that is a finite set because the set of words whose lengths are less than or equal to
l−k−1 is finite.
Let
{C1k,l,C2k,l,…,Cm(k,l)k,l} be the set
Ωk,lc
of (k,l)∼c equivalence classes.
For x=(xn)n∈Z∈Cik,l and α∈Σ,
suppose that
(μk+1,μk+2,…,μl−2,α)∈Wk,l(x)
for some μ=(μk+1,μk+2,…,μl−2)∈Bl−k−2(Λ)
so that the bi-infinite sequence
[TABLE]
belongs to Λ.
If x(μ,α) belongs to Cjk,l−1,
then we write
αCik,l⊂Cjk,l−1.
Similarly for
x=(xn)n∈Z∈Cik,l and β∈Σ,
suppose that
(β,νk+2,νk+3,…,νl−1)∈Wk,l(x)
for some ν=(νk+2,νk+3,…,νl−1)∈Bl−k−2(Λ)
so that the bi-infinite sequence
[TABLE]
belongs to Λ.
If x(β,ν) belongs to Chk+1,l,
then we write
Cik,lβ⊂Chk+1,l.
Lemma 5.2**.**
Keep the above notation.
(i)
The notation αCik,l⊂Cjk,l−1
is well-defined, that is, it does not depend on the choice of
x=(xn)n∈Z∈Cik,l and
μ=(μk+1,μk+2,…,μl−2)∈Bl−k−2(Λ)
as long as
(μk+1,μk+2,…,μl−2,α)∈Wk,l(x).
2. (ii)
The notation Cik,lβ⊂Chk+1,l
is well-defined, that is, it does not depend on the choice of
x=(xn)n∈Z∈Cik,l and
ν=(νk+2,νk+3,…,νl−1)∈Bl−k−2(Λ)
as long as
(β,νk+2,νk+3,…,νl−1)∈Wk,l(x).
Proof.
(i)
Take
x=(xn)n∈Z,z=(zn)n∈Z∈Cik,l
such that
x(k,l)∼cz.
Suppose that α∈Σ satisfies
(μk+1,μk+2,…,μl−2,α)∈Wk,l(x)
and
(νk+1,νk+2,…,νl−2,α)∈Wk,l(z)
for some
μ=(μk+1,μk+2,…,μl−2)
and
ν=(νk+1,νk+2,…,νl−2)∈Bl−k−2(Λ).
Consider
the bi-infinite sequences
x(μ,α),z(ν,α)∈Λ.
Since
Wk,l(x)=Wk,l(z),
we have
Wk,l−1(x(μ,α))=Wk,l−1(z(ν,α)).
This implies that
x(μ,α)(k,l−1)∼cz(ν,α),
proving the class
Cjk,l−1 containing x(μ,α)
does not depend on the choice of
x=(xn)n∈Z∈Cik,l and
μ=(μk+1,μk+2,…,μl−2)∈Bl−k−2(Λ)
as long as
(μk+1,μk+2,…,μl−2,α)∈Wk,l(x).
Hence the class
Cjk,l−1 is well-defined.
(ii) is similarly shown to (i).
∎
The following lemma is now clear.
Lemma 5.3**.**
For x,y∈Λ, we have
x(k,l)∼cz
if and only if
σ(x)(k−1,l−1)∼cσ(z).
Hence we may identify
Ωk,lc with Ωk−1,l−1c
and
Cik,l with Cik−1,l−1 for i=1,2,…,m(k,l)=m(k−1,l−1)
through the shift
σ:Λ⟶Λ
so that we identify
Ωk,lc with Ωk+n,l+nc
and
Cik,l with Cik+n,l+n for all n∈Z and
i=1,2,…,m(k,l)=m(k+n,l+n).
Let us in particular specify the following equivalence classes
Ω−l,1c and Ω−1,lc
and define the vertex sets Vl− and Vl+ for l=0,1,2,…
by setting
[TABLE]
Write V0=V0−=V0+.
Put m(l)=m(−l,1)(=m(−1,l)) and let
[TABLE]
Through the bijective correspondence
[TABLE]
the classes Ci−l,1 and Ci−1,l for each i=1,2,…,m(l)
are identified with each other and denoted by
Cil.
Hence the sets
Vl− and Vl+
are identified for each l∈Z+.
They are denoted by Vl.
We regard Cil
as a vertex denoted by vil for i=1,2,…,m(l),
and define an edge e+ labeled α∈Σ from
vil to vjl+1
if αCjl+1⊂Cil.
We write s(e+)=vil the source vertex of e+
and
t(e+)=vjl+1 the terminal vertex of e+,
and the label λ+(e+)=α.
The set of such edges from
vil to vjl+1 for some i=1,2,…,m(l),j=1,2,…,m(l+1)
is denoted by
El,l+1+.
This situation is written
[TABLE]
Similarly
we define an edge e− labeled β∈Σ from
vjl+1 to vil
if Cjl+1β⊂Cil.
We write s(e−)=vjl+1 the source vertex of e−
and
t(e−)=vil the terminal vertex of e−,
and the label λ−(e−)=β.
The set of such edges from
vjl+1 to vil for some
i=1,2,…,m(l),j=1,2,…,m(l+1)
is denoted by
El+1,l−.
This situation is written
[TABLE]
We set
E+=⋃l=0∞El,l+1+,E−=⋃l=0∞El+1,l−.
The natural labeling maps
λ+:E+⟶Σ
and
λ−:E−⟶Σ
are denoted by
λ+ and λ−,
respectively.
We now have the pair
LΛ+=(V,E+,λ+) and
LΛ−=(V,E−,λ−)
of labeled Bratteli diagrams.
Proposition 5.4**.**
The pair (LΛ−,LΛ+) of labeled Bratteli diagrams
is a λ-graph bisystem satisfying FPCC and presenting the subshift Λ.
Proof.
We first show that
the pair (LΛ−,LΛ+) satisfies the local property of λ-graph bisystem.
For vil(=Cil)∈Vl,vjl+2(=Cjl+2)∈Vl+2,
take
(e−,e+)∈E+−(vil,vjl+2) so that
t(e−)=vil,t(e+)=vjl+2 and
s(e−)=s(e+) denoted by vkl+1.
This means that
λ+(e+)Cjl+2⊂Ckl+1
and
Ckl+1λ−(e−)⊂Cil.
Put
α=λ+(e+),β=λ−(e−)∈Σ.
For
x=(xn)n∈Z∈Cjl+2 with
x∈Cj−(l+2),1,
take
ν=(ν−l,ν−l+1,…,ν−1)∈Bl(Λ)
with
(β,ν−l,ν−l+1,…,ν−1,α)∈W−(l+2),1(x)
so that
[TABLE]
where να=(ν−l,ν−l+1,…,ν−1,α).
Let Ck′l+1 be the class of x(β,να)
in Ω−(l+1),1c,
so that we have
Cjl+2β⊂Ck′l+1,
and there exists an edge, denoted by f−,
from vjl+2 to vk′l+1 labeled β.
The class of x(β,να)
in Ω−(l+1),0c
is identified with the class of
σ−l(x(β,να))
in Ω−1,lc.
As
λ+(e+)Cjl+2λ−(e−)⊂Cil,
it belongs to Cil,
so that
there exists an edge, denoted by f+,
from vil to vk′l
such that
λ+(f+)=α.
We thus have
(f+,f−)∈E−+(vil,vjl+2).
It is easy to see that
the correspondence
[TABLE]
gives rise to a desired bijection
between
E+−(vil,vjl+2)
and
E−+(vil,vjl+2).
We second show that
both LΛ− and LΛ+
present the subshift Λ.
Let WLΛ+
be the set of admissible words appearing in the labeled graph
LΛ+
defined before Lemma 5.1.
For any word
μ=(μ1,μ2,…,μl)∈WLΛ+,
there exist
em∈Em−1,m+,m=n+1,…,n+l
such that
μ1=λ+(en+1),μ2=λ+(en+2),…,μl=λ+(en+l) and
t(em)=s(em+1),m=n+1,…,n+l−1
for some n∈Z+.
Let
vin=s(en+1),vjn+l−1=t(en+l).
We then have
[TABLE]
This means that (μ1,…,μl)∈Bl(Λ).
Conversely
it is obvious that any word μ=(μ1,…,μl)∈Bl(Λ)
appears as a labeled path in LΛ+.
Hence the set
WLΛ+
coincides with the set B∗(Λ) of admissible words of Λ,
so that LΛ+ and similarly LΛ−
present Λ.
∎
Definition 5.5**.**
The λ-graph bisystem
(LΛ−,LΛ+)
for a subshift Λ is called the canonicalλ-graph bisystem
for Λ.
Its symbolic matrix bisystem
(MΛ−,MΛ+)
is called the canonical symbolic matrix bisystem for Λ.
The λ-graph bisystems presented in Example 3.2
(ii), (iii) and (iv) are the canonical λ-graph bisystems for the full N-shift,
the golden mean shift and the even shift, respectively.
6 Strong shift equivalence
In the theory of subshifts, one of most interesting and important subjects
is their classification.
R. Williams in [39] proved that two topological Markov shifts are topologically conjugate
if and only if their underlying matrices have a special algebraic relation,
called strong shift equivalence.
His result and its proof have been giving a great influence on
further reserch of symbolic dynamical systems
(cf. [19]).
After Williams, M. Nasu in [30],
generalized Williams’s result to sofic shifts.
The author introduced a notion of (properly) strong shift equivalence in symbolic matrix systems
in [22] (cf. [25]) and
proved that two subshifts are topologically conjugate
if and only if their canonical symbolic matrix systems are (properly) strong shift equivalent.
As seen in the preceding section, any subshift is presented by a λ-graph bisystem
satisfying FPCC,
and hence by a symbolic matrix bisystem having a common alphabet.
In the first part of this section,
we will introduce a notion of properly strong shift equivalence in
symbolic matrix bisystems satisfying FPCC, and prove that
two subshifts are topologically conjugate
if and only if their canonical symbolic matrix bisystems are properly strong shift equivalent.
Throughout the first part of this section,
we assume that all λ-graph bisystems and symbolic matrix bisystems have common alphabets
and satisfy FPCC.
Let
A and A′ be symbolic matrices over alphabets
Σ and Σ′ respectively.
Let
ϕ be a bijection from a subset of Σ onto a subset of Σ′.
Recall that
A and A′ are said to be specified equivalent under specification
ϕ if A′ can be obtained from A
by replacing every symbol
α appearing in components of A by ϕ(α).
We write it as
A≃ϕA′.
We call ϕ a specification from Σ to Σ′.
If we do not specify the specification ϕ, we simply write it
A≃A′.
For an alphabet Σ,
we denote by SΣ the set of finite formal sums of elements of Σ.
For alphabets C,D,
put
C⋅D={cd∣c∈C,d∈D}.
For
x=j∑cj∈SC
and
y=k∑dk∈SD,
define
xy=j,k∑cjdk∈SC⋅D.
Recall that
the exchanging specification κ from C⋅D to D⋅C
is a bijection
from SC⋅D to SD⋅C
defined by
[TABLE]
We first define properly strong shift equivalence in 1-step
between two symbolic matrix bisystems satisfying FPCC
as a generalization of
strong shift equivalences in 1-step between
two nonnegative matrices defined by R. Williams in [39],
and between
two symbolic matrices defined by Nasu in [30].
Let (M−,M+) and (N−,N+) be symbolic matrix bisystems over alphabets
ΣM and ΣN respectively,
both of them satisfy FPCC,
where
Ml,l+1−,Ml,l+1+ are m(l)×m(l+1) symbolic matrices and
Nl,l+1−,Nl,l+1+ are n(l)×n(l+1) symbolic matrices.
Definition 6.1**.**
Two symbolic matrix bisystems
(M−,M+) and (N−,N+)
are said to be properly strong shift equivalent in1-step
if there exist alphabets
C,D and specifications
[TABLE]
and sequences c(l),d(l) on l∈Z+
such that for each l∈Z+, there exist
(1)
a c(l)×d(l+1) matrix Pl over C,
2. (2)
a d(l)×c(l+1) matrix Ql over D,
3. (3)
a d(l)×d(l+1) matrix Xl over D for l being odd,
4. (4)
a c(l)×c(l+1) matrix Xl over D for l being even,
5. (5)
a c(l)×c(l+1) matrix Yl over C for l being odd,
6. (6)
a d(l)×d(l+1) matrix Yl over C for l being even,
satisfying the following equations:
[TABLE]
where κ is the exchanging specification defined by
κ(a⋅b)=b⋅a,
and κφ,κϕ denote the compositions
κ∘φ,κ∘ϕ, respectively.
We write this situation as
(M−,M+)1−pr≈(N−,N+).
By (6.1), we know
c(2l)=m(l) and d(2l)=n(l) for l∈Z+.
Two symbolic matrix bisystems
(M−,M+) and (N−,N+)
are said to be *properly strong shift equivalent in * ℓ-step
if there exists a sequence of symbolic matrix bisystems
(M(i)−,M(i)+),i=1,2,…,ℓ−1
such that
[TABLE]
We denote this situation by
(M−,M+)ℓ−pr≈(N−,N+)
and simply call it a properly strong shift equivalence.
Proposition 6.2**.**
Properly strong shift equivalence in symbolic matrix bisystems is an equivalence relation.
Proof.
It is clear that properly
strong shift equivalence is symmetric and transitive.
It suffices to show that
(M−,M+)1−pr≈(M−,M+).
Put
C=ΣM,D={0,1}.
Define
φ:a∈ΣM→a⋅1∈C⋅D
and
ϕ:a∈ΣM→1⋅a∈D⋅C.
Let
Ek be the k×k identity matrix.
Set
c(2l)=c(2l+1)=d(2l)=m(l),d(2l+1)=m(l+1)
for
l∈Z+,
and
[TABLE]
It is straightforward to see
that they give a properly strong shift equivalence in 1-step
between
(M−,M+) and (M−,M+).
∎
We will prove the following theorem.
Theorem 6.3**.**
Two subshifts are topologically conjugate
if and only if
their canonical symbolic matrix bisystems
are properly strong shift equivalent.
We will first show the only if part of the theorem above.
In our proof,
we will use Nasu’s factorization theorem for topological conjugacy
between subshifts into bipartite codes ([30]).
We now introduce the notion of bipartite symbolic matrix bisystem.
Definition 6.4**.**
A symbolic matrix bisystem (M−,M+) over
common alphabet Σ is said to be bipartite
if there exist disjoint subsets
C,D⊂Σ with Σ=C⊔D
and sequences c(l),d(l) on l∈Z+
with
m(l)=c(l)+d(l),l∈N
such that
for each l∈Z+,
there exist
(1)
a c(l)×d(l+1) matrix Pl,l+1 over C,
2. (2)
a d(l)×c(l+1) matrix Ql,l+1 over D,
3. (3)
a d(l)×d(l+1) matrix Xl,l+1 over D for l being odd,
4. (4)
a c(l)×c(l+1) matrix Xl,l+1 over D for l being even,
5. (5)
a c(l)×c(l+1) matrix Yl,l+1 over C for l being odd,
6. (6)
a d(l)×d(l+1) matrix Yl,l+1 over C for l being even,
satisfying the following equations:
[TABLE]
Under the assumption that (M−,M+) is standard so that
m(0)=1, we require
that c(0)=d(0)=1 and the above equalities
(6.5) for l=0 mean
[TABLE]
We thus see
Lemma 6.5**.**
For a bipartite symbolic matrix bisystem (M−,M+) as above,
put
[TABLE]
and
[TABLE]
[TABLE]
Then the both pairs
(MCD−,MCD+)
and
(MDC−,MDC+)
are
symbolic matrix bisystems over alphabets C⋅D and D⋅C
respectively and
they are properly strong shift equivalent in 1-step,
where
Ml,l+1CD−:≃κX2lY2l+1
means that
Ml,l+1CD−(i,j)
is defined by
κ(X2lY2l+1(i,j))∈C⋅D for all i=1,2,…,m(l),j=1,2,…,m(l+1),
and
Ml,l+1DC−:≃κY2lX2l+1
is similarly defined.
Proof.
By the relations
Ml,l+1−Ml+1,l+2+≃κMl,l+1+Ml+1,l+2−
for l∈Z+,
we have for l being odd,
[TABLE]
so that
[TABLE]
For l being even,
[TABLE]
so that
[TABLE]
We then have
[TABLE]
By looking at the above specified equivalences,
we know that
[TABLE]
Hence
both pairs
(MCD−,MCD+)
and
(MDC−,MDC+)
are
symbolic matrix bisystems.
The corresponding equations to
(6.3) and (6.4)
come from (6.7), (6.8)
so that
they are properly strong shift equivalent in 1-step.
∎
Definition 6.6**.**
A λ-graph bisystem
(L−,L+)
over common alphabet
Σ is said to be bipartite
if
there exist disjoint subsets C,D⊂Σ such that
Σ=C∪D and disjoint subsets
VlC,VlD⊂Vl for each l∈Z+
such that
VlC∪VlD=Vl and
(1)
for each e+∈El,l+1+,
[TABLE]
2. (2)
for each e−∈El+1,l−,
[TABLE]
Proposition 6.7**.**
A symbolic matrix bisystem is bipartite
if and only if the associated λ-graph bisystem
is bipartite.
Proof.
It is clear that
a bipartite symbolic matrix bisystem
gives rise to a bipartite
λ-graph bisystem.
Conversely,
suppose that
a λ-graph bisystem
(L−,L+)
is bipartite.
Let c(l) and d(l) be the cardinalities of the sets
VlD and VlC respectively.
We may identify
VlD and VlC with
the sets
{1,2,…,c(l)} and
{1,2,…,d(l)} respectively.
For i∈VlC,j∈Vl+1D,
put
[TABLE]
where
ek+∈El,l+1+,k=1,2,…,np are all edges of
El,l+1+ satisfying
s(ek+)=i,t(ek+)=j,
so that Pl,l+1(i,j)∈SC.
Similarly we define
for i∈VlD,j∈Vl+1C,
put
[TABLE]
where
fk+∈El,l+1+,k=1,2,…,nq are all edges of
El,l+1+ satisfying
s(fk+)=i,t(fk+)=j,
so that Ql,l+1(i,j)∈SD.
For i∈VlC,j∈Vl+1C with l being odd,
put
[TABLE]
where
ek−∈El+1,l−,k=1,2,…,ny are all edges of
El+1,l− satisfying
s(ek−)=j,t(ek−)=i,
so that Yl,l+1(i,j)∈SC.
For i∈VlC,j∈Vl+1C with l being even,
put
[TABLE]
where
fk−∈El+1,l−,k=1,2,…,nx are all edges of
El+1,l− satisfying
s(fk−)=j,t(fk−)=i,
so that Xl,l+1(i,j)∈SD.
For i∈VlD,j∈Vl+1C,
we similarly define
Yl,l+1(i,j)∈SC for l being even,
and Xl,l+1(i,j)∈SD for l being odd.
Let (M−,M+) be the corresponding symbolic matrix bisystem for (L−,L+).
It is now clear that
they satisfy the equalities (6.5).
Then
the symbolic matrix bisystem (M−,M+) for
(L−,L+)
is bipartite.
∎
Nasu introduced the notion of bipartite subshift in [30] and [31].
A subshift Λ over alphabet Σ is said to be
bipartite if there exist disjoint subsets
C,D⊂Σ with Σ=C⊔D such that
any (xn)n∈Z∈Λ is either
[TABLE]
Let
Λ(2) be the 2-higher power shift for Λ
that is defined by the subshift
[TABLE]
over alphabet Σ2 where
x[2n,2n+1]=(x2n,x2n+1),n∈Z.
Put
[TABLE]
They are subshifts over alphabets C⋅D and D⋅C
respectively.
Hence Λ(2) is partitioned into the two subshifts
ΛCD and ΛDC.
Proposition 6.8**.**
A subshift Λ is bipartite if and only if
its canonical symbolic matrix bisystem (M−,M+) is bipartite.
Proof.
It is clear that
a bipartite symbolic matrix bisystem yields a bipartite λ-graph bisystem, that gives rise to
a bipartite subshift by its construction of the subshift from the
λ-graph bisystem.
Suppose that
Λ
is bipartite with respect to alphabets C,D.
It suffices to show that its canonical λ-graph bisystem
(L−,L+) is bipartite.
Let us denote by
L−=(V−,E−,λ−) and
L+=(V+,E+,λ+).
Let [x]k,l∈Ωk.lc
denote the (k,l)-central equivalence class of x∈Λ.
Define for Z,W=C or D,
[TABLE]
Since Λ is bipartite,
we know that
VlCD−,VlDC−,VlCD+,VlDC+ are all empty if l is odd,
whereas
VlCC−,VlDD−,VlCC+,VlDD+ are all empty if l is even
so that
[TABLE]
Let π:x∈Vl+⟶σl−1(x)∈Vl−
be the bijection that satisfies for Z,W=C or D,π(VlZW+)=VlZW−,l∈Z+.
We identify
Vl+ with Vl− through the map
π:Vl+⟶Vl−.
We set
Vl:=Vl− and
VlC:=VlZC−,VlD:=VlZD− for Z=C or D.
Then we have
[TABLE]
We regard V0,V0C,V0D as all singletons.
For each e−∈El+1,l−,
it is easy to see that
[TABLE]
and
for each e+∈El,l+1+
[TABLE]
for Z,W=C or D.
Therefore
the λ-graph bisystem
(L−,L+) is bipartite.
∎
Let Λ be a bipartite subshift over Σ
with respect to alphabets
C,D.
As in Lemma 6.5, we have
two symbolic matrix bisystems
(MCD−,MCD+)
and
(MDC−,MDC+)
over alphabets
C⋅D and
D⋅C
from the bipartite canonical symbolic matrix bisystem
(MΛ−,MΛ+) for
Λ respectively.
They are naturally identified with
the canonical symbolic matrix bisystems for the subshifts ΛCD
and ΛDC respectively.
By Lemma 6.5, we thus see a corollary below of Proposition 6.8.
Corollary 6.9**.**
For a bipartite subshift Λ
with respect to alphabets C,D,
we have a properly strong shift equivalence in 1-step:
[TABLE]
The following notion of bipartite conjugacy has been introduced by
Nasu in [30], [31].
The conjugacy from ΛCD onto ΛDC that maps
(cidi)i∈Z to
(dici+1)i∈Z
is called the forward bipartite conjugacy.
The conjugacy from ΛCD onto ΛDC that maps
(cidi)i∈Z to
(di−1ci)i∈Z
is called the backward bipartite conjugacy.
A topological conjugacy between subshifts is called
a symbolic conjugacy if it is a 1-block map given by a bijection between the underlying alphabets of the subshifts.
Nasu proved the following factorization theorem for topological conjugacies between subshifts.
Any topological conjugacy ψ between subshifts is factorized into
finite compositions of the form
[TABLE]
where
κ0,…,κn are symbolic conjugacies and
ζ1,…,ζn are either forward or backward bipartite conjugacies.
Thanks to the Nasu’s result above,
we reach the following theorem.
Theorem 6.11**.**
If two subshifts are topologically conjugate,
their canonical symbolic matrix bisystems
are properly strong shift equivalent.
We will prove the converse implication of the theorem above.
We will indeed prove the following proposition.
Proposition 6.12**.**
If two symbolic matrix bisystems are properly strong shift equivalent in 1-step,
their presenting subshifts are topologically conjugate.
To prove the proposition, we provide a notation and a lemma.
For (M−,M+), set the m(l)×m(l+k) matrices:
[TABLE]
for each l,k∈Z+.
Let us denote by ΛM the presented subshift by (M−,M+).
Lemma 6.13**.**
Assume that two symbolic matrix bisystems
(M−,M+) over ΣM and
(N−,N+) over ΣN
are properly strong shift equivalent in 1-step.
Let
φ:ΣM→C⋅D
and
ϕ:ΣN→D⋅C
be specifications
that give rise to the properly strong shift equivalence in 1-step
between them.
For any word
x1x2∈B2(ΛM)
of length two in the presenting subshift ΛM,
put
φ(xi)=cidi,i=1,2
where
ci∈C,di∈D.
Then there uniquely exists a symbol
y0∈ΣN such that
ϕ(y0)=d1c2.
Proof.
Note that by definition the specification
ϕ is not necessarily surjective onto D⋅C.
Since ϕ is injective,
it suffices to show the existence of y0
such that ϕ(y0)=d1c2.
As
x1x2∈B2(ΛM),
for any fixed
l≥3, we may find
j=1,2,…,m(l+2) and
k=1,2,…,m(l)
such that
x1x2 appears in Ml,l+2+(k,j),
and hence in some component of
Ml,l+1+Ml+1,l+2+.
Under specifications appeared in Definition 6.1,
we know the following specified equivalences:
[TABLE]
Since
φ(x1x2)=c1d1c2d2
that appears in some component of
P2lQ2l+1P2l+2Q2l+3
and hence of
P2l−1Q2lP2l+1Q2l+2.
This implies that
the word
d1c2 appears in some component of
Q2lP2l+1.
By the specified equivalence
Nl,l+1+≃ϕQ2lP2l+1
in (6.1),
we may find a unique symbol y0 in ΣN such that
ϕ(y0)=d1c2.
∎
Proof of Proposition 6.12.
Suppose that
(M−,M+) and (N−,N+)
are properly strong shift equivalent in 1-step.
We use the same notation as in Definition 6.1.
By the preceding lemma,
we have a 2-block map Φ
from
B2(ΛM) to ΣN defined by
Φ(x1x2)=y0
where
φ(xi)=cidi,i=1,2
and
ϕ(y0)=d1c2.
Let
Φ∞ be
the sliding block code induced by
Φ
so that
Φ∞
is a map from
ΛM to
(ΣN)Z
(see [19] for sliding block code).
We also write as
Φ the map from B∗(ΛM)
to the set of all words of
ΣN defined by
[TABLE]
We will prove that
Φ∞(ΛM)⊂ΛN.
To prove this, it suffices to show that
for any word w in ΛM,Φ(w) is an admissible word in ΛN.
For
w=w1w2⋯wn∈Bn(ΛM)
and any
fixed
l≥n+1, we find
j=1,2,…,m(l+n) and
k=1,2,…,m(l)
such that
w appears in Ml,l+n+(k,j).
Take
i=1,2,…,m(l−1) with
Ml−1,l−(i,k)=0,
so that w appears in Ml−1,l−Ml,l+n+(i,j).
Put
φ(wi)=cidi,i=1,2,…,n.
Under specifications appeared in Definition 6.1,
we have the following specified equivalences:
[TABLE]
so that the word
d1c2d2c3⋯dn−1cn
appears in some component of
Q2lP2l+1Q2l+2⋯P2l+2n−1.
Hence the word
ϕ−1(d1c2)ϕ−1(d2c3)⋯ϕ−1(dn−1cn)
appears in the corresponding component of
Nl,l+1+Nl+1,l+2+⋯Nl+n−2,l+n−1+.
Thus we see that
Φ(w)
is an admissible word in
ΛN
and that
the sliding block code
Φ∞ maps ΛM to ΛN.
Similarly,
we can construct a sliding block code
Ψ∞ from
ΛN to ΛM
that is the inverse of Φ∞.
Thus two subshifts
ΛN and ΛM
are topologically conjugate.
∎
Therefore we conclude the following theorem
Theorem 6.14**.**
If two symbolic matrix bisystems are properly strong shift equivalent,
their associated subshifts are topologically conjugate.
By Theorem 6.11 and Theorem 6.14,
we conclude Theorem 6.3.
Remark 6.15**.**
If there exist the matrices
Pl,Ql for all sufficiently large number l
in Definition 6.1,
we may show that the presenting subshifts are topologically conjugate
by following the proof of Proposition 6.12.
Properly strong shift equivalence exactly corresponds to
a finite sequence of bipartite decompositions of symbolic matrix bisystems and λ-graph bisystems.
The definition of properly strong shift equivalence for symbolic matrix bisystems however
needs rather complicated formulations than that of strong shift equivalence
for nonnegative matrices in [39].
We will in the rest of this section introduce the notion of strong shift equivalence
between two symbolic matrix bisystems
that is simpler
and weaker than properly strong shift equivalence.
It is also a generalization of the notion of strong shift equivalence
between nonnegative matrices defined by Williams in [39],
between symbolic matrices defined by Nasu in [30],
and between
symbolic matrix systems defined in [22].
From now on, we will treat general symbolic matrix bisystems.
We do not assume that symbolic matrix bisystems satisfy FPCC.
Let (M−,M+),(N−,N+)
be two symbolic matrix bisystems over alphabets
ΣM±,ΣN±, respectively.
Let
m(l),n(l)
be the sequences for which
Ml,l+1−,Ml,l+1+ are m(l)×m(l+1) symbolic matrices and
Nl,l+1−,Nl,l+1+ are n(l)×n(l+1) symbolic matrices,
respectively.
Definition 6.16**.**
Two symbolic matrix bisystems (M−,M+) and (N−,N+)
are said to be strong shift equivalent in 1-step
if there exist alphabets
C,D and
specifications
[TABLE]
such that
for each l∈Z+,
there exist
an m(l)×n(l+1) matrix Hl over C
and
an n(l)×m(l+1) matrix Kl over D
satisfying the following equations:
[TABLE]
and
[TABLE]
We write this situation as
(M−,M+)1−st≈(N−,N+).
Two symbolic matrix bisystems
(M−,M+) and (N−,N+)
are said to be strong shift equivalent in ℓ-step
if there exist symbolic matrix bisystems
(M(i)−,M(i)+),i=1,2,…,ℓ−1
such that
[TABLE]
We denote this situation by
(M−,M+)ℓ−st≈(N−,N+)
and simply call it a strong shift equivalence.
Remark 6.17**.**
If (M−,M+) and (N−,N+) come from
symbolic matrix systems
(IM,M) and (IN,N), respectively,
then the above definition of strong shift equivalence coincides with
the strong shift equivalence in symbolic matrix systems [22, p. 304].
Similarly to the case of properly strong shift equivalence,
we see
that strong shift equivalence on symbolic matrix bisystems is an equivalence relation.
Proposition 6.18**.**
For symbolic matrix bisystems satisfying FPCC,
properly strong shift equivalence in 1-step implies
strong shift equivalence in 1-step.
Proof.
Let
Pl,Ql,Xl and Yl be the matrices
in Definition 6.1
between
(M−,M+)
and
(N−,N+).
We set
[TABLE]
It is straightforward to see that they give rise to a strong shift equivalence in 1-step between
(M−,M+) and (N−,N+).
∎
7 Étale groupoids for λ-graph bisystems
and its C∗-algebras
Let (L−,L+) be a λ-graph bisystem over alphabet Σ±.
We will first construct two continuous graphs
EL−+
and
EL+−
in the sense of Deaconu [8]
(cf. [6], [7], [9]),
and its shift dynamical systems
(XL−+,σL−)
and
(XL+−,σL+),
respectively.
Let L−=(V−,E−,λ−) and
L+=(V+,E+,λ+).
Let Vl be the common vertex sets Vl−=Vl+
and denote it by {v1l,…,vm(l)l}.
We first define two spaces of label sequences as follows:
[TABLE]
Each element of ΩL− is a left-infinite sequence written
[TABLE]
As L− is right-resolving, the edge
el−∈El,l−1−
is uniquely determined by its source vertex ul∈Vl and
its label β−l.
An element
(…,u3,β−3,u2,β−2,u1,β−1)∈ΩL−
is denoted by
[TABLE]
For the pair
(u1,β−1),
the edge e1−∈E1,0− satisfying
λ−(e1−)=β−1,s(e1−)=u1
is unique,
so that the terminal vertex t(e1−)∈V0
is uniquely determined by (u1,β−1), that is denoted by
u0 or u0(ω).
The other space ΩL+
is defined similarly as follows:
[TABLE]
Each element of ΩL+ is a right-infinite sequence written
[TABLE]
As L+ is left-resolving, the edge el+∈El−1,l+
is uniquely determined by its terminal vertex ul∈Vl and
its label αl.
An element
(α1,u1,α2,u2,α3,u3,…)∈ΩL+
is denoted by
ω=(αl,ul)l=1∞∈ΩL+.
Similarly to ΩL−,
the left-resolving property of L+
ensures us that
the edge e1+∈E0,1+ satisfying
λ+(e1+)=α1,t(e1+)=u1
is unique for the pair
(α1,u1),
so that the source vertex s(e1+)∈V0 is uniquely determined by (α1,u1),
that is denoted by
u0 or u0(ω).
We endow both the spaces
ΩL− and ΩL+
with the relative topology of the infinite product topology
on ∏l=1∞(Vl×Σ−) and ∏l=1∞(Σ+×Vl),
respectively,
so that they are compact Hausdorff spaces.
We will next define two continuous graphs
written
EL−+ and EL+−
from
(L−,L+) in the following way:
[TABLE]
Each element of EL−+ is figured such as
[TABLE]
Similarly
[TABLE]
Each element of EL+− is figured such as
[TABLE]
Following Deaconu [8]
(cf. [6], [7], [9]),
we construct a shift dynamical system:
[TABLE]
and the shift map
σL−:XL−+⟶XL−+ by setting
[TABLE]
The set XL−+ is endowed with
the relative topology of the infinite product topology of
Σ+×ΩL−.
It is a zero-dimensional compact Hausdorff space.
The shift map
σL−:XL−+⟶XL−+
is continuous and a local homeomorphism.
As L+ is left-resolving,
for any element
x=(αi,ωi)i=1∞∈XL−+,
there uniquely exists
ω0∈ΩL− such that
(ω0,α1,ω1)∈EL−+
by the local property of λ-graph bisystem.
We denote ω0
by ω0(x), which is uniquely determined by x∈XL−+.
Therefore an element
x=(αi,ωi)i=1∞∈XL−+
defines a two-dimensional diagram as follows:
[TABLE]
We may similarly construct a shift dynamical system
(XL+−,σL+) from the other continuous graph
EL+−.
By the now standard
Deaconu–Renault groupoid construction
(see. [8], [9], [35], [36], cf.
[37]), we have an amenable and étale groupoid written
GL−+
from the shift dynamical system
(XL−+,σL−).
The space of the groupoid is defined by
[TABLE]
The unit space (GL−+)(0) is defined by
[TABLE]
It is identified with the space
XL−+ as a topological space.
The range map and the source map
are defined by
r(x,n,y)=x,s(x,n,y)=y.
The product and the inverse operations
are defined by
[TABLE]
We may similarly construct the other amenable and étale
groupoid GL+− from the shift dynamical system (XL+−,σL+).
Now we will define our C∗-algebra OL−+ in the following way.
Definition 7.1**.**
The C∗-algebra OL−+ associated with a λ-graph bisystem
(L−,L+) is defined to be the C∗-algebra
C∗(GL−+)
of the groupoid
GL−+.
Similarly we define
the C∗-algebra OL+− from the other groupoid
GL+−.
For general theory of C∗-algebras of étale groupoids, see
([34], [35], [36],
cf. [8], [9], [37], etc.).
Let Cc(GL−+) be the set of complex-valued continuous functions on
GL−+ with compact support.
It has a natural product structure and ∗-involution of
given by
[TABLE]
The algebra
Cc(GL−+) is a dense ∗-subalgebra of C∗(GL−+).
We will study the algebraic structure of the C∗-algebra OL−+.
Recall that F(vil) denotes the follower set
of vil∈Vl in L−,
that is defined after Definition 3.1.
We define the cylinder set
UΩL−(vil;ξ)⊂ΩL−
for ξ=(ξ1,ξ2,…,ξl)∈F(vil)
by setting
[TABLE]
Each element of
UΩL−(vil;ξ)
is figured such as
[TABLE]
We note that the vertices ul−1,ul−2,…,u0
of the terminals of the labeled edges
ξ1,ξ2,…,ξl
are automatically determined by vil and ξ, because
L− is right-resolving.
The set of cylinder sets UΩL−(vil;ξ)
form a basis of open sets
of ΩL−.
Let us define a clopen set of XL−+ by setting
[TABLE]
Recall that Bm(ΛL+)
denotes the set of admissible words of
the subshift ΛL+
with length m.
For vil∈Vl,
ξ=(ξ1,ξ2,…,ξl)∈F(vil) and
μ=(μ1,…,μm)∈Bm(ΛL+) with m≤l,
define the cylinder set
UXL−+(μ,vil;ξ) of XL−+ by setting
[TABLE]
Each element of
UXL−+(μ,vil;ξ) is figured such as
[TABLE]
For
x=(αi,ωi)i=1∞∈XL−+,
we put
λi(x)=αi∈Σ+,ωi(x)=ωi∈ΩL−
for i∈N,
respectively, so that
x=(λi(x),ωi(x))i=1∞.
Now L+ is left-resolving
so that there uniquely exists
ω0(x)∈ΩL− satisfying
(ω0(x),α1,ω1)∈EL−+.
Define
U(μ)⊂GL−+
for
μ=(μ1,…,μk)∈Bk(ΛL+),
and
U(vil;ξ)⊂GL−+
for vil∈Vl,ξ∈F(vil) by
[TABLE]
They are clopen sets of GL−+.
We set
[TABLE]
where
χF∈Cc(GL−+) denotes
the characteristic function of a clopen set
F
on the groupoid
GL−+.
We in particular write Sμ as Sα
for the symbol μ=α∈Σ+.
For μ∈B∗(ΛL+),ξ∈F(vil),
we recognize that
Sμ=0,Eil−(ξ)=0.
The following lemma is straightforward.
Lemma 7.2**.**
(i)
For μ=(μ1,…,μm)∈Bm(ΛL+), we have
Sμ=Sμ1⋯Sμm.
2. (ii)
For ξ∈F(vil), the operator
Eil−(ξ) is a projection such that the family
Eil−(ξ),ξ∈F(vil),i=1,…,m(l),l∈Z+
are mutually commuting projections.
The transition matrices Al,l+1−,Al,l+1+
for L−,L+ respectively
are defined by setting
[TABLE]
for
i=1,2,…,m(l),j=1,2,…,m(l+1),β∈Σ−,α∈Σ+.
Let us denote by
AL− the C∗-subalgebra of OL−+ generated by
Eil−(ξ),vil∈Vl,ξ∈F(vil).
We define the other C∗-subalgebra
AL+ of OL+−
in a similar way.
Let us denote by C(ΩL−)
the commutative C∗-algebra of complex valued continuous functions on
ΩL−.
For a subset B⊂A of a C∗-algebra A,
we denote by C∗(B) the C∗-subalgebra of A generated by B.
Lemma 7.3**.**
(i)
Each operator Eil−(ξ) indexed by vertex vil∈Vl and
admissible word ξ=(ξ1,…,ξl)∈F(vil)
is a projection satisfying the following operator relations:
[TABLE]
*where the word
βξ in (7.4) is defined by
βξ=(β,ξ1,…,ξl)
for β∈Σ−,ξ=(ξ1,…,ξl)∈F(vil),
and
Ejl+1(βξ)=0 unless βξ∈F(vjl+1).
*
2. (ii)
The correspondence
[TABLE]
gives rise to an isomorphism of C∗-algebras between
AL− and C(ΩL−).
Proof.
(i) Any element x∈XL−+ defines an element
ω0(x)∈ΩL−.
As the set XL−+
is a disjoint union:
[TABLE]
for a fixed l∈N,
we know the equality (7.3).
The disjoint union
Then the correspondence (7.5) gives rise to an isomorphism
φl:AL−,l⟶C(ΩL−,l)
of the commutative finite dimensional C∗-algebras.
By the identity (7.4) together with (7.7),
we have embeddings
[TABLE]
that are compatible to the isomorphisms
φl:AL−,l⟶C(ΩL−,l),l∈N.
As the algebras AL−,C(ΩL−l)
are inductive limits
AL−=l→∞limAL−,l,C(ΩL−l)=l→∞limC(ΩL−,l)
respectively,
we conclude that the C∗-algebras
AL− and
C(ΩL−l)
are isomorphic.
∎
The following lemma is a key to proving the identity (7.10).
Lemma 7.4**.**
For ξ=(ξ1,ξ2,…,ξl)∈F(vil),α∈Σ+
and x∈XL−+, the following two conditions are equivalent:
(i)
There exists z∈XL−+ such that
[TABLE]
2. (ii)
There exist β∈Σ− and j=1,2,…,m(l+1) such that
[TABLE]
Such z and β bijectively correspond to each other.
Proof.
(i) ⟹ (ii):
Suppose that z∈XL−+
satisfies the conditions (7.8).
Since we see (ω0(z),α,ω1(z))∈EL−+,
we have ω1(z)=ω0(x).
Let ω0(x)=(ul,β−l)l=1∞∈ΩL−,
so that
β−1=ξl,β−2=ξl−1,…,β−l=ξ1,
such as the following figure:
[TABLE]
Put
β=β0 and
vjl+1=ul+1.
Then the condition (7.9) holds.
(ii) ⟹ (i):
Conversely let β∈Σ− and j=1,2,…,m(l+1)
satisfy the condition (7.9).
Let ω0(x)=(ul,β−l)l=1∞∈ΩL−,
so that
β−1=ξl,β−2=ξl−1,…,β−l=ξ1.
By the hypothesis
ξ=(ξ1,ξ2,…,ξl)∈F(vil), there exist unique labeled edges
fn,n−1−∈En,n−1− for n=1,2,…,l such that
s(fl,l−1−)=vil,t(fn,n−1−)=s(fn−1,n−2−),λ−(fn,n−1−)=ξl−n+1
for n=1,2,…,l.
We put
un′=s(fn,n−1−) for
n=1,2,…,l, so that ul′=vil.
By the hypothesis
Al,l+1+(i,α,j)=1 with the local property of λ-graph bisystem,
we may find labeled edges
en,n+1+∈En,n+1+ for n=0,1,…,l such that
s(en,n+1+)=un′,t(en,n+1+)=un,λ+(en,n+1+)=α.
By the condition
(ul,β−l)l=1∞∈ΩL−,
there exists an labeled edge
el+2,l+1−∈El+2,l+1−
such that
s(el+2,l+1−)=ul+2,t(el+2,l+1−)=ul+1(=vjl+1),λ−(el+2,l+1−)=β−l−1.
By applying the local property of λ-graph bisystem for the pair
el,l+1+ and el+2,l+1−
satisfying
t(el,l+1+)=t(el+2,l+1−),
we may find labeled edges
fl+1,l−∈El+1,l−
and
el+1,l+2+∈El+1,l+2+
such that
[TABLE]
We put
ul+1′=s(fl+1,l−)∈Vl+1.
Like this way,
by successively applying the local property of λ-graph bisystem,
we may find
ω′=(u′l,β−l−1)l=1∞∈ΩL−(vil;ξ)
such that
β−1=ξl,…,β−l=ξ1
and
(ω′,α,ω0(x))∈EL−+.
By defining
z=(αi,ωi)i=1∞∈∏i=1∞(Σ+×ΩL−)
such that
α1=α,ω1=ω0(x) and
(αi,ωi)i=2∞=x,
we have
z∈XL−+,
σL−(z)=x, λ1(z)=α
and ω0(z)=ω′∈ΩL−(vil;ξ).
∎
Lemma 7.5**.**
For α∈Σ+ and ξ∈F(vil),
we have
[TABLE]
where Ejl+1−(ξβ)=0 unless
ξβ∈F(vjl+1).
Proof.
It suffices to show that the equality
[TABLE]
holds.
We then have for s=(x,n,z)∈GL−+,
[TABLE]
because
χU(α)(w,−m,x)=1
if and only if
m=−1,x=σL−(w),λ1(w)=α.
Now
[TABLE]
because χU(α)(w′,−m′+n+1,z)=1
if and only if
m′=n,z=σL−(w′),λ1(w′)=α.
Since
χU(vil;ξ)(w,n,w′)=1
if and only if
w=w′,n=0 and ω0(w)∈UΩL−+(vil;ξ),
we have
[TABLE]
By Lemma 7.4 with the hypothesis ξ∈F(vil),
we have
ω0(w)∈UΩL−+(vil;ξ)
with x=z=σL−(w),λ1(w)=α
if and only if
x=z∈UXL−+(vjl+1;ξβ)
for some j and β∈Σ−
such that
Al,l+1+(i,α,j)=1
and
ξβ∈F(vjl+1).
Hence we obtain the equality
By the formula (7.10)
for a fixed l∈Z+,
we have the identity
[TABLE]
For μ=(μ1,…,μm),ν=(ν1,…,νn)∈B∗(ΛL+)
and
vil∈Vl,ξ∈F(vil)
with m,n≤l,
let U(μ,ν,vil;ξ) be
the clopen set of GL−+
defined by
[TABLE]
where
x=(λi(x),ωi(x))i=1∞,z=(λi(z),ωi(z))i=1∞∈XL−+
and
λ[1,m](x)=(λ1(x),…,λm(x)),
λ[1,n](z)=(λ(z)1,…,λn(z))∈B∗(ΛL+).
For μ=ν, we write
U(μ,μ,vil;ξ) as
U(μ,vil;ξ), that is identified with
UXL−+(μ,vil;ξ)
defined in (7.2).
Then we have
Lemma 7.6**.**
[TABLE]
In particular, for the clopen set U(μ,vil;ξ) with
μ∈(μ1,…,μm)∈Bm(ΛL+),vil∈Vl
defined in (7.2),
we have
[TABLE]
Proof.
It suffices to show the equality
[TABLE]
holds.
Suppose
μ=(μ1,…,μm),ν=(ν1,…,νn)∈B∗(ΛL+).
For s=(x,p,z)∈GL−+,
we have
[TABLE]
We know
(x,q,w)∈U(μ) if and only if
q=m,λ[1,m](x)=μ and σL−m(x)=w,
so that we have
[TABLE]
Now we have
(z,−p+m+q′,w′)∈U(ν) if and only if
σL−n(z)=w′,λ[1,n](z)=ν and −p+m+q′=n,
so that
[TABLE]
As
(σL−m(x),p+n−m,σL−n(z))∈U(vil;ξ)
with λ[1,m](x)=μ,λ[1,n](z)=ν
if and only if
(x,p,z)∈U(μ,ν,vil;ξ),
we have the identity (7.14).
∎
Lemma 7.7**.**
The set of finite linear combinations of elements of the form
[TABLE]
is dense in the C∗-algebra
OL−+.
Proof.
Since the sets
of the form U(μ,ν,vil;ξ) form a basis of open sets of the groupoid
GL−+,
the set of finite linear combinations of elements of the form of (7.15)
becomes a dense ∗-subalgebra of OL−+
because of Lemma 7.6.
∎
Put for α∈Σ+
[TABLE]
Regard it as a clopen subset
{(x,0,x)∈GL−+∣λ1(x)=α}
of (GL−+)(0)
and hence of GL−+.
Then we have
As
⋃i=1m(l)⋃ξ∈F(vil)U(α,vil;ξ)=XL−+(α),
we obtain the equality
SαSα∗=χXL−+(α).
(ii)
For s=(x,n,z)∈GL−+,
we have
[TABLE]
Now
χXL−+(α)(w,−m,x)=1
if and only if m=0,w=x,λ1(x)=α.
Since we have
χU(vil;ξ)(x,n,z)=1
if and only if x=z,n=0,ω0(x)∈UΩL−(vil;ξ),
so that
[TABLE]
On the other hand
[TABLE]
Now
χXL−+(α)(w,n−m,z)=1
if and only if n=m,w=z,λ1(z)=α.
Since we have
χU(vil;ξ)(z,−n,x)=1
if and only if z=x,n=0,ω0(x)∈UΩL−(vil;ξ),
so that
[TABLE]
proving
χXL−+(α)∗χU(vil;ξ)=χU(vil;ξ)∗χXL−+(α)
and hence
SαSα∗Eil−(ξ)=Eil−(ξ)SαSα∗.
∎
Proposition 7.9**.**
(i)
The C∗-algebra OL−+
is generated by
partial isometries
Sα indexed by
α∈Σ+
and mutually commuting projections
Eil−(ξ) indexed by vertices vil∈Vl and
admissible words ξ=(ξ1,…,ξl)∈F(vil).
2. (ii)
The partial isometries
Sα,α∈Σ+
and the mutually commuting projections
Eil−(ξ),ξ∈F(vil)
satisfy the following operator relations called (L−,L+):
[TABLE]
Similarly we have
Proposition 7.10**.**
(i)
The C∗-algebra OL+−
is generated by
partial isometries
Tβ indexed by β∈Σ−
and mutually commuting projections
Eil+(η) indexed by vertices vil∈Vl and
admissible words η=(η1,…,ηl)∈P(vil).
2. (ii)
The partial isometries
Tβ,β∈Σ−
and the mutually commuting projections
Eil+(η),η∈P(vil)
satisfy the following operator relations called (L+,L−):
[TABLE]
We will prove in the following section that
the above operator relations among the generators of the C∗-algebras
exactly determine the algebraic structure of the C∗-algebras.
8 Structure of the C∗-algebra OL−+
In what follows, an endomorphism on a unital C∗-algebra means
a ∗-endomorphism that is not necessarily unital.
For a unital C∗-algebra A, let us denote by
End(A) the set of endomorphisms on A.
In [26], the notion of C∗-symbolic dynamical system
(A,ρ,Σ) was introduced as a generalization of both a λ-graph system and an automorphism on a unital C∗-algebra.
Following [26], a finite family
ρα∈End(A),α∈Σ
of endomorphisms on a unital C∗-algebra A
indexed by a finite alphabet Σ
is said to be essential if ρα(1)=0
for all α∈Σ
and the ideal of A generated by ρα(1),α∈Σ
coincides with A.
It is said to be faithful if for any nonzero
a∈A, there exists a symbol α∈Σ such that
ρα(a)=0.
A C∗-symbolic dynamical system is defined by a triplet
(A,ρ,Σ) consisting on a unital C∗-algebra A and
a finite family of endomorphisms
{ρα}α∈Σ of A, that is essential and faithful
([26], cf. [27], [28]).
A C∗-symbolic dynamical system
(A,ρ,Σ) gives rise to a subshift
Λ and a C∗-algebra written
A⋊ρΛ
called the C∗-symbolic crossed product in [26].
The C∗-algebra A⋊ρΛ
is constructed by certain Hilbert C∗-bimodule associated to
the endomorphisms {ρα}α∈Σ of A
(cf. [12], [13], [32], etc.).
If (A,ρ,Σ) satisfies condition (I)
in the sense of [27],
the algebraic structure of the
C∗-algebra A⋊ρΛ
is uniquely determined by certain operator relations among its canonical generators.
In this section, we will show that our C∗-algebra
OL−+ may be realized as a C∗-symbolic crossed product
AL−⋊ρ+ΛL+,
so that we will know that
the operator relations called
(L−,L+) in Proposition 7.9
uniquely determine the algebraic structure of the C∗-algebra
OL−+
under certain condition called
condition (I) on the C∗-symbolic dynamical system
(AL−,ρ+,Σ+).
Let AL− be the C∗-subalgebra
of OL−+
generated by the mutually commuting projections
Eil−(ξ) for vil∈Vl,ξ∈F(vil).
The C∗-subalgebra
AL+ of
OL+− is similarly defined.
Let us denote by
ρα+∈End(AL−),α∈Σ+
the endomorphism on AL− defined by setting
[TABLE]
Then we have a finite family of endomorphisms
ρα+,α∈Σ+
on AL−.
The other endomorphisms
ρβ−∈End(AL+),β∈Σ−
are similarly defined.
Lemma 8.1**.**
The triplets
(AL−,ρ+,Σ+)
and similarly
(AL+,ρ−,Σ−)
are both C∗-symbolic dynamical systems.
Proof.
Since we have
[TABLE]
the family
{ρα+}α∈Σ+
is essential.
It is easy to see that {ρα+}α∈Σ+
is faithful, so that
the triplets
(AL−,ρ+,Σ+)
and similarly
(AL+,ρ−,Σ−)
are both C∗-symbolic dynamical systems.
∎
We will concentrate on the algebra OL−+,
the other algebra OL+− has a symmetric structure.
We define a C∗-subalgebra
DL−+ of OL−+ by
[TABLE]
Let φL−:XL−+⟶ΩL−
be the continuous surjection defined by
φL−(x)=ω0(x),x∈XL−+.
It induces an embedding
C(ΩL−)↪C(XL−+)
corresponding to a natural inclusion
AL−⊂DL−+.
Recall the condition (I) for C∗-symbolic dynamical systems introduced in
[28].
The C∗-symbolic dynamical system
(AL−,ρ+,Σ)
satisfies *condition *(I) if
there exists a unital increasing sequence
[TABLE]
of C∗-subalgebras of AL−
such that
ρα+(Al)⊂Al+1
for all l∈N,α∈Σ+
and
the union ⋃l=1∞Al is dense in AL−
and
for k,l∈N with k≤l,
there exists a projection
qkl∈DL−+
commuting with all elements of
Al
such that
(1)
qkla=0 for all nonzero a∈Al,
2. (2)
qklϕL+m(qkl)=0 for all m=1,2,…,k,
where
ϕL+m(X)=∑μ∈Bm(ΛL+)SμXSμ∗.
By Proposition 7.9 (ii) and (8.1),
we know that our partial isometries Sα,α∈Σ+
satisfy the relations
[TABLE]
for α∈Σ+,ξ∈F(vil).
Let sα,α∈Σ+ be another family of partial isometries satisfying the relations (8.3).
We may consider the corresponding C∗-algebra
DL−+, that is generated by projections
of the form sμEil−(ξ)sμ∗,
and the homomorphism
ϕL+m on it by using sα,α∈Σ+,
instead of Sα,α∈Σ+.
Then [28, Lemma 3.2] tells us that the condition (I)
does not depend on the choice of such partial isometries
satisfying the relations (8.3).
Hence
the condition (I) for (AL−,ρ+,Σ+)
is intrinsically determined by (AL−,ρ+,Σ+)
from [28, Lemma 3.2].
The topological dynamical system
(XL−+,σL−) is said to be essentially free
if the set
Xm,n(σL−)={x∈XL−+∣σL−m(x)=σL−n(x)}
for m,n∈Z+ with m=n does not have non empty interior.
A point x∈XL−+ is said to be eventually periodic
if σL−m(x)=σL−n(x) for some m,n∈Z+
with m=n.
The set of eventually periodic points in XL−+
is denoted by
Pev(σL−).
Hence we have
[TABLE]
The following lemma is known for more general dynamical system.
As the author has not been able to find a complete proof in literature,
the proof is given for the sake of completeness.
The topological dynamical system
(XL−+,σL−) is essentially free
if and only if
the set Pev(σL−)c of non-eventually periodic points is dense in
XL−+.
Proof.
Assume that
(XL−+,σL−) is essentially free.
Suppose that
the set Pev(σL−)c of non-eventually periodic points is not dense in
XL−+.
Since XL−+ is compact Hausdorff and hence regular,
there exists a point x∈XL−+ and an open neighborhood
Ux⊂XL−+ of x
such that
[TABLE]
Hence
we have
Ux⊂Pev(σL−)
so that
[TABLE]
By the Baire’s category theorem,
there exist m,n∈Z+ with m=n such that
Xm,n(σL−)∩Ux
contains an interior point in the set
Ux.
Therefore we conclude that
Xm,n(σL−) contains an interior, a contradiction to the hypothesis that
(XL−+,σL−) is essentially free.
Assume next that the set
Pev(σL−)c
is dense in XL−+.
By (8.4), we know that
if
Xm,n(σL−) contains an open set V for some
m,n with m=n,
then
Pev(σL−) contains V,
a contradiction to the hypothesis that
Pev(σL−)c
is dense in XL−+.
∎
The essential freeness of the topological dynamical system
(XL−+,σL−)
is equivalent to the condition that
the étale groupoid
GL−+ is essentially principal (see [35, Proposition 3.1]),
so that the C∗-subalgebra
DL−+ is maximal abelian in OL−+
by [34, Proposition 4.7].
Recall that a clopen set UXL−+(vil;ξ)
for vil∈Vl,ξ∈F(vil),
in XL−+
is defined in (7.1).
Definition 8.5**.**
A λ-graph bisystem (L−,L+)
is said to satisfy σL−-condition (I)
if for any l,k∈N with k≤l,
there exist
xil(ξ)∈UXL−+(vil;ξ)
for each i=1,2,…,m(l) and ξ∈F(vil)
such that
Let (L−,L+) be a λ-graph bisystem.
Consider the following three conditions:
(i)
The λ-graph bisystem (L−,L+) satisfies σL−-condition (I).
2. (ii)
The topological dynamical system
(XL−+,σL−) is essentially free.
3. (iii)
The C∗-symbolic dynamical system
(AL−,ρ+,Σ+)
satisfies condition (I).
Then we have
(i) ⟹ (ii) and
(i) ⟹ (iii).
Proof.
(i) ⟹ (ii) :
Assume that the λ-graph bisystem
(L−,L+) satisfies σL−-condition (I)
and the topological dynamical system
(XL−+,σL−) is not essentially free.
There exist m,n∈Z+ with m>n
such that
Xm,n(σL−)={x∈XL−+∣σL−m(x)=σL−n(x)}
has a nonempty interior.
By taking l∈N large enough
such as
l>m, we may assume that
U(μ,vil;ξ)⊂Xm,n(σL−)
for some μ=(μ1,…,μp)∈Bp(ΛL+)
and
vil∈Vl.
Since the numbers m and p may be taken large enough,
we may assume that p=m.
Take x∈U(μ,vil;ξ)
and let
ωp(x)=(ul,β−l)l=1∞∈ΩL−.
We put
[TABLE]
Let
ξˉ=(ξ1,ξ2,…,ξl,ξl+1,…,ξl+p+1)∈Bl+p+1(ΛL−),
so that
we have
[TABLE]
As
U(μ,vil;ξ)⊂Xm,n(σL−),
any point of
UXL−+(vi0l+p;ξˉ) consists of periodic points with its period m−n.
Now take k∈N such as k>m−n.
Then there exists no points
xi0l+p(ξˉ)∈UXL−+(vi0l+p;ξˉ)
such that
σL−n(xi0l+p(ξˉ))=xi0l+p(ξˉ) for all
n=1,2,…,k.
It is a contradiction to σL−-condition (I).
(i) ⟹ (iii) :
For a fixed l∈N, let AL−,l be the C∗-subalgebra
of AL− generated by the projections
Eil−(ξ),ξ∈F(vil),i=1,2,…,m(l).
It satisfies the condition
[TABLE]
and the union ⋃l=1∞AL−,l
is dense in AL−.
Since
the λ-graph bisystem (L−,L+) satisfies σL−-condition (I),
for any l,k∈N with k≤l,
there exist
xil(ξ)∈UXL−+(vil;ξ)
for each i=1,2,…,m(l) and ξ∈F(vil)
satsifying (8.5).
Under fixing
l,k∈N with k≤l,
we set
[TABLE]
By (8.5),
we have
σL−n(Y)∩Y=∅
for all n=1,2,…,k.
We may find a clopen set V⊂XL−+
such that Y⊂V and
[TABLE]
Let qkl be the projection of the characteristic function
of V on XL−+.
Since
σL−n(V)∩V=∅
for all
n=1,2,…,k,
we know that
qklϕL+n(qkl)=0
for all
n=1,2,…,k.
Any nonzero element
a∈AL−,l
is of the form
a=∑i=1m(l)∑ξ∈F(vil)cil(ξ)Eil−(ξ)
for some cil(ξ)∈C.
Since a=0,
there exists i0,ξ0 such that
ci0l(ξ0)=0.
Take xi0l(ξ0)∈Y⊂V
so that we have
[TABLE]
and hence
aqkl=0.
∎
Theorem 8.7**.**
Suppose that a λ-graph bisystem (L−,L+)
satisfies σL−-condition (I).
Then the C∗-algebra OL−+
is the universal unital unique C∗-algebra
generated by
partial isometries
Sα indexed by symbols α∈Σ+
and mutually commuting projections
Eil−(ξ) indexed by vertices vil∈Vl and
admissible words ξ=(ξ1,…,ξl)∈F(vil)
subject to the following operator relations called (L−,L+):
[TABLE]
where the word
βξ in (8.8)
and
ξβ in (8.9)
are defined by
βξ=(β,ξ1,…,ξl)
and
ξβ=(ξ1,…,ξl,β)
for β∈Σ−,ξ=(ξ1,…,ξl)∈F(vil)
and
i=1,2,…,m(l),
respectively.
Proof.
The uniqueness of the C∗-algebra OL−+
among the generators
Sα,α∈Σ+
and
Eil−(ξ),vil∈Vl,ξ∈F(vil)
subject to the operator relations (L−,L+)
means that if there exist
another family of
nonzero partial isometries
Sα,α∈Σ+
and nonzero mutually commuting projections
Eil−(ξ),vil∈Vl,ξ∈F(vil)
satisfying the above operator relations
(L−,L+),
then the correspondence
[TABLE]
yield an isomorphism from OL−+
onto the C∗-algebra
OL−+
generated by
Sα,α∈Σ+
and
Eil−(ξ),vil∈Vl,ξ∈F(vil).
We will prove this property.
Let us denote by
AL−
the C∗-subalgebra of
OL−+
generated by
the projections
Eil−(ξ),vil∈Vl,ξ=(ξ1,…,ξl)∈F(vil).
By the relations below
[TABLE]
and commutativity of the projections
Eil−(ξ),
we know that
the correspondence
[TABLE]
gives rise to an isomorphism of C∗-algebras between
AL−
and
C(ΩL−).
Hence by Lemma 7.3 (ii),
the C∗-algebras
AL−
and
AL−
are canonically isomorphic through the correspondence
Eil−(ξ)∈AL−⟶Eil−(ξ)∈AL−.
Now we are assuming that the λ-graph bisystem (L−,L+)
satisfies σL−-condition (I),
so that the C∗-symbolic dynamical system
(AL−,ρ+,Σ+)
satisfies condition (I).
By [28, Theorem 3.9], we know that
the correspondence
[TABLE]
extends to an isomorphism of C∗-algebras
between
OL−+ and
OL−+.
Therefore the C∗-algebra OL−+
is the universal C∗-algebra
subject to the operator relations (L−,L+).
The above discussion shows that OL−+
is the unique C∗-algebra subject to the operator relations
(L−,L+).
∎
For the other C∗-algebra
OL+−, we may similarly define the topological dynamical system
(XL+−,σL+) to be essentially free
and
the λ-graph bisystem (L−,L+) to satisfy σL+-condition (I).
We may show a symmetric statement to Proposition 8.6
to lead the following theorem.
Theorem 8.8**.**
Suppose that a λ-graph bisystem (L−,L+) satisfies
σL+-condition (I).
The C∗-algebra OL+−
is realized as the universal unital unique C∗-algebra
generated by partial isometries
Tβ indexed by symbols β∈Σ−
and mutually commuting projections
Eil+(μ) indexed by vertices vil∈Vl and
admissible words μ=(μ1,…,μl)∈P(vil)
subject to the following operator relations called (L+,L−):
[TABLE]
for β∈Σ−,μ∈P(vil), where
μα=(μ1,…,μl,α) and
αμ=(α,μ1,…,μl).
We will next present the operator relations
(L−,L+) in Theorem 8.7 as well as Theorem 8.8 into
a simpler form than the above relations in Theorem 8.7 as well as Theorem 8.8.
For l∈N,vil∈Vl
and β∈Σ−,
we put
[TABLE]
We then see
Σ1−(vil)={β∈Σ−∣Fβ(vil)=∅}.
We define a projection for β∈Σ1−(vil) in AL−
by
[TABLE]
In case of Fβ(vil)=∅, we define Eil(β)=0.
We have the following lemma.
For l∈N
and ξ=(ξ1,…,ξl)∈F(vil),
let en−∈En,n−1−,n=1,2,…,l
be a finite sequence of edges satisfying
[TABLE]
for n=1,2,…,l−1
that are figured as
[TABLE]
Put
vinn=s(en−)∈Vn
for
n=1,2,…,l−1.
Then we have
[TABLE]
Now we reach the following theorem that is one of the main results of the paper
Theorem 8.11**.**
Suppose that a λ-graph bisystem (L−,L+)
satisfies σL−-condition (I).
Then the C∗-algebra OL−+
is the universal unital unique C∗-algebra
generated by
partial isometries
Sα indexed by symbols α∈Σ+
and mutually commuting projections
Eil(β) indexed by β∈Σ1−(vil)
with vertices vil∈Vl,l∈N
subject to the following operator relations:
[TABLE]
The above four operator relations are also called the relations (L−,L+).
Proof.
Let Sα,α∈Σ+ be partial isometries
and Eil(β),β∈Σ1−(vil)
be mutually commuting projections satisfying
the relations
(8.14), (8.15), (8.16) and (8.17).
For ξ=(ξ1,…,ξl)∈F(vil),
let en−∈En,n−1−,n=1,2,…,l
and
vinn∈Vn,n=1,2,…,l−1 be as in Lemma 8.10,
so that vinn=s(en−) for n=1,2,…,l−1.
Define
[TABLE]
Since
Eil(ξ1),Eil−1l−1(ξ2),⋯,Ei11(ξl)
mutually commute, one sees that
Eil−(ξ) is a projection.
We will henceforth show that the projections
Eil−(ξ) satisfy
the equalities (8.8) and (8.9).
For βξ∈F(vjl+1) with
Al,l+1−(i,β,j)=1, we know
[TABLE]
It then follows that
[TABLE]
because of the equality (8.16).
Hence we obtain the equality (8.8).
By using the preceding lemma, we have
[TABLE]
Let el−∈El+1,l− be the unique edge such that
ξ1=λ−(el−),s(el−)=vjl+1.
By (8.14) and (8.15), we know that
Ejl+1(ξ1)⋅Ejll(ξ2)=0 if and only if
vjll=t(el−), and in this case
Al−1,l+(il−1,α,jl)=1.
Hence we have
[TABLE]
We inductively know that
[TABLE]
As
Ejl+1(ξ1)⋅Ejll(ξ2)⋯Ej22(ξl)=∑β∈Σ−Ejl+1−(ξβ),
by (8.14),
we conclude that
[TABLE]
Since it is direct to see that the equality
[TABLE]
holds,
the family
Sα,α∈Σ+,Eil−(ξ),ξ∈F(vil)
of operators satisfy the relations (L−,L+) of Theorem 8.7.
By the universal property and the uniqueness of the relations (L−,L+) in Theorem 8.7,
the family
Sα,α∈Σ+,Eil−(β),β∈Σ1−(vil)
of operators satisfying
the relations
(8.14), (8.15), (8.16) and (8.17)
completely determine the algebraic structure of the C∗-algebra
OL−+.
∎
Remark 8.12**.**
If a λ-graph bisystem
(L−,L+) comes from a λ-graph system L
as in Example 3.2(i), then the set
Σ1−(vil) is a singleton {ι}
for every vertex vil∈V.
Hence the operator relations (L−,L+) of Theorem 8.11
coincides with the operator relations of Theorem 2.1.
Similarly we have
Theorem 8.13**.**
Suppose that a λ-graph bisystem (L−,L+) satisfies
σL+-condition (I).
The C∗-algebra OL+−
is realized as the universal unital unique C∗-algebra
generated by partial isometries
Tβ indexed by symbols β∈Σ−
and mutually commuting projections
Fil(α) indexed by vertices vil∈Vl and
symbols α∈Σ1+(vil)
subject to the following operator relations:
[TABLE]
where Σ1+(vil)={λ+(e+)∈Σ+∣e+∈El−1,l+,t(e+)=vil}.
The above operator relations are called (L+,L−).
For a λ-graph bisystem (L−,L+),
denote by
L−t (resp. L+t) the labeled Bratteli diagram obtained by reversing the directions of all edges in L− (resp. L+).
Then the pair
(L+t,L−t) becomes a λ-graph bisystem.
Since the C∗-algebras
OL−+ and OL+−
are both universal C∗-algebras subject to the operator relations
(L−,L+) and (L+,L−),
respectively,
we have canonical isomorphisms of C∗-algebras:
[TABLE]
9 K-groups for OL−+
In this section we will describe K-theory formulas
for our C∗-algebras
OL−+ as well as OL+−.
We will then prove that the K-groups are invariant under
strong shift equivalence of the associated symbolic matrix bisystems.
By Theorem 8.11 and Theorem 8.13
(or Theorem 8.7 and Theorem 8.8),
we know that the C∗-algebras OL−+ and OL+−
are nothing but the C∗-symbolic crossed products
AL−⋊ρ−ΛL+
and
AL+⋊ρ+ΛL−
defined in [26],
respectively.
K-theory formulas for the C∗-algebra
A⋊ρΛ
constructed from
a C∗-dynamical system (A,ρ,Σ)
in general have been presented in
[26].
We may apply the formulas to our C∗-algebras
OL−+ and OL+−.
We will focus on the former algebra OL−+,
the latter one is symmetric.
The endomorphisms
ρα+:AL−⟶AL− for α∈Σ+
defined in (8.1)
yield endomorphisms
ρα+∗:K∗(AL−)→K∗(AL−)
for α∈Σ+
on the K-theory groups of AL−.
Define an endomorphism
[TABLE]
by setting
ρ∗+(g)=∑α∈Σ+ρα+∗(g),g∈K∗(AL−).
Lemma 9.1**.**
[TABLE]
Proof.
Since our C∗-algebra OL−+
is isomorphic to
the C∗-symbolic crossed product
AL−⋊ρ+ΛL+,
one has the six term
exact sequence of K-theory ([26], cf. [32], [12]):
[TABLE]
As AL− is an AF-algebra,
one sees that K1(AL−)=0,
so that we have the desired formulas.
∎
The K0-group
K0(C(ΩL−))
of the commutative C∗-algebra
C(ΩL−)
is canonically isomorphic to
the abelian group
C(ΩL−,Z)
of Z-valued continuous functions on ΩL−.
The correspondence
φ∗([Eil−(ξ)])=χUΩL−(vil;ξ) induced by
(7.5) yields
a natural isomorphism
[TABLE]
between
K0(AL−)
and the abelian group
C(ΩL−,Z).
For ω∈ΩL−,
put
[TABLE]
We then define an endomorphism on C(ΩL−,Z)
by setting
[TABLE]
We thus have the following K-theory formulas for OL−+.
Theorem 9.2**.**
[TABLE]
Proof.
It is easy to see that the diagram
[TABLE]
commutes.
Hence by Lemma 9.1,
we get the desired K-theory formulas.
∎
The above K-theory formulas are generalizations of those of the
C∗-algebras OL associated with λ-graph system
L in [23, Theorem 5.5] (cf. [4])
and the crossed products C(ΛA)⋊σA∗Z
of the commutative C∗-algebra C(ΛA)
on the two-sided topological Markov shifts ΛA
by the automorphisms σA∗ induced by the homeomorphism of the shift
σA∗ (cf. [33]).
We will next prove that the groups
Ki(OL−+),i=0,1 are
invariant under properly strong shift equivalence of the associated symbolic matrix bisystems of the λ-graph bisystems (L−,L+) satisfying FPCC.
To prove it we will actually show the following theorem, that was improved by the referee’s kind suggestion.
Let K denote the C∗-algebra of compact operators
on a separable infinite dimensional Hilbert space,
and C denote its diagonal C∗-subalgebra.
Theorem 9.3**.**
Let (M−,M+) and (N−,N+)
be symbolic matrix bisystems.
Let
(LM−,LM+) and
(LN−,LN+)
be the associated λ-graph bisystems both of which satisfy FPCC.
Suppose that
(M−,M+) and
(N−,N+)
are properly strong shift equivalent.
Then
there exists an isomorphism
Φ:OLM−+⊗K⟶OLN−+⊗K
of C∗-algebras such that
Φ(DLM−+⊗C)=DLN−+⊗C.
In particular, the C∗-algebras
OLM−+ and
OLN−+
are Morita equivalent, so that their K-groups
Ki(OLM−+) and
Ki(OLN−+)
are isomorphic for i=0,1.
Proof.
We may assume that
(LM−,LM+) and
(LN−,LN+)
are properly strong shift equivalent in 1-step.
As in the discussion in Section 6,
there exist an alphabet
Σ, disjoint subsets
C,D⊂Σ
and a bipartite symbolic matrix bisystem
(M−,M+)
over
Σ
such that
[TABLE]
Let (L−,L+)
be the associated λ-graph bisystems to
(M−,M+).
We also denote by
(LCD−,LCD+)
(resp.
(LDC−,LDC+)
)
the associated λ-graph bisystems to
(MCD−,MCD+)
(resp.
(MDC−,MDC+)).
By a completely similar argument to [26, Theorem 6.1],
we know that there exist full projections
PC,PD in the C∗-algebra
OL−+
such that both
PC,PD belong to DL−+
satisfying
PC+PD=1 and
[TABLE]
Hence the pair
(OLCD−+,DLCD−+)
and
(OLDC−+,DLDC−+)
is relative Morita equivalent in the sense of
[29].
By using [29, Theorem 4.7],
there exists an isomorphism
Φ:OLCD−+⊗K⟶OLDC−+⊗K
such that
Φ(DLCD−+⊗C)=DLDC−+⊗C.
Since
(OLCD−+,DLCD−+)=(OLM−+,DLM−+)
and
(OLDC−+,DLDC−+)=(OLN−+,DLN−+),
we conclude that
there exists an isomorphism
Φ:OLM−+⊗K⟶OLN−+⊗K
such that
Φ(DLM−+⊗C)=DLN−+⊗C.
∎
Corollary 9.4**.**
The K-groups Ki(OLΛ−+),i=0,1
of the C∗-algebra
OLΛ−+
of the canonical λ-graph bisystem
(LΛ−,LΛ+)
of a subshift Λ is invariant under topological conjugacy of subshifts.
10 A duality: λ-graph systems as λ-graph bisystems
Let L=(V,E,λ,ι) be a λ-graph system over Σ.
We will construct a λ-graph bisystem (L−,L+) from L
as in Example 3.2 (i).
Let us recognize the map ι:V⟶V
as a new symbol written ι, and
define a new alphabet
Σ−={ι}.
The original alphabet Σ is written Σ+.
Let
El,l+1+:=El,l+1 for l∈Z+
and
λ+=λ:E+⟶Σ+.
We then have a labeled Bratteli diagram
L+=(V,E+,λ+) over alphabet Σ+,
that is
the original labeled Bratteli diagram L without the map
ι:V⟶V.
The other
labeled Bratteli diagram
L−=(V,E−,λ−) over alphabet Σ−
is defined in the following way.
Define an edge e−∈El+1,l−
if
ι(vjl+1)=vil
so that
s(e−)=vjl+1,t(e−)=vil
and
λ−(e−)=ι∈Σ−.
Then we have a labeled Bratteli diagram
L−=(V,E−,λ−) over alphabet Σ−.
Then the local property of the λ-graph system L makes the pair
(L−,L+) a λ-graph bisystem.
This λ-graph bisystem does not satisfy FPCC.
Let (Il,l+1,Al,l+1)l∈Z+
be the transition matrix system for the λ-graph system
L defined in (2.2) and (2.3).
The transition matrix bisystem (A−,A+) for
the λ-graph bisystem (L−,L+) defined in
Section 8 satisfies
[TABLE]
for α∈Σ+ and i=1,2,…,m(l),j=1,2,…,m(l+1).
Let Sα,α∈Σ+
and
Eil(β),β∈Σ1−(vil)
be the canonical generating family of the C∗-algebra
OL−+ satisfying the relations (L−,L+) in Theorem 8.11.
Since Σ1−(vil)={ι} for all vertices vil∈Vl,
the projection
Eil(β),β∈Σ1−(vil)
may be written Eil without the symbol β.
The equalities (10.1) tell us that the relations
(L−,L+) in Theorem 8.11 is exactly the same as the relations
(L) in Theorem 2.1.
Hence the C∗-algebra
OL−+ coincides with the C∗-algebra OL
of the λ-graph system L by their universal properties.
Let us consider the other C∗-algebra OL+−.
Then by Theorem 8.8 together with (10.1),
the C∗-algebra is generated by one coisometry
Tι and a family of mutually commuting projections
Eil+(μ),μ∈P(vil),i=1,2,…,m(l),l∈Z+
satisfying the following relations:
Under the condition
Il,l+1(i,j)=1, the local property of λ-graph bisystem
ensures us
[TABLE]
so that the equality
[TABLE]
holds.
As for each j=1,2,…,m(l+1),
there uniquely exists i=1,2,…,m(l) such that
Il,l+1(i,j)=1,
so that ∑i=1m(l)Il,l+1(i,j)=1.
Hence we have
[TABLE]
so that Tι is a unitary.
Recall that
the C∗-subalgebra
DL+−
of OL+−
is generated by the projections of the form
[TABLE]
It is canonically isomorphic to the commutative C∗-algebra
C(XL+−) of continuous functions on XL+−
through the correspondence
[TABLE]
as in Lemma 7.6 for
XL+−
(Note that Lemma 7.6 treats
XL−+).
Hence we know the following lemma.
Lemma 10.1**.**
The isomorphism
φL+:DL+−⟶C(XL+−)
satisfies
φL+∘Ad(Tι∗)=σL+∗∘φL+
where σL+∗:C(XL+−)⟶C(XL+−)
is defined by
σL+∗(f)=f∘σL+
for f∈C(XL+−).
Proof.
The C∗-subalgebra
AL+ of OL+− generated by mutually commuting
projections Eil+(μ),μ∈P(vil)
is isomorphic to the commutative C∗-algebra
C(ΩL+) of continuous functions on the compact Hausdorff space
ΩL+
defined in Section 7.
Now the λ-graph bisystem
(L−,L+)
comes from a λ-graph system L.
Hence the compact Hausdorff space
XL+−
is given by in this case
[TABLE]
Let σL+:XL+−⟶XL+−
be the shift map defined by
σL+((ι,ωi)i=1∞)=(ι,ωi+1)i=1∞.
As
ωi=(α−i+l,uli)l=1∞∈ΩL+,i=0,1,2,…
and
ι(ul+1i+1)=uli,l=0,1,…,i=1,2,…,
we know that
(ι,ωi+1)i=1∞ uniquely determines
(ι,ωi)i=1∞ as in the diagram below,
so that
the shift map
σL+:XL+−⟶XL+−
is actually a homeomorphism on XL+−.
[TABLE]
As
[TABLE]
and
[TABLE]
we conclude that
φL+∘Ad(Tι∗)=σL+∗∘φL+ because of the relation (10.4).
∎
By their universal properties of both the algebra
OL+− and the crossed product
C(XL+−)⋊σL+∗Z
by the automorphism σL+∗
of C(XL+−),
we know that
OL+− is isomorphic to
C(XL+−)⋊σL+∗Z,
Thus we have
the following proposition.
Proposition 10.2**.**
Let L be a left-resolving λ-graph system over Σ.
Let (L−,L+) be the associated λ-graph bisystem.
Then we have
(i)
The C∗-algebra OL−+ is canonically isomorphic to the
the C∗-algebra OL
of the original λ-graph system L.
2. (ii)
The C∗-algebra OL+− is canonically isomorphic to the crossed product
C(XL+−)⋊σL+∗Z.
Let A be an N×N irreducible non-permutation matrix over {0,1},
and ΛA denotes the shift space of the two-sided topological Markov shift (ΛA,σA)
defined by the matrix A as in (2.1).
Let IN be the N×N identity matrix.
Then the pair (IN,A) naturally yields a symbolic matrix system
and hence a symbolic matrix bisystem
whose λ-graph bisystem
is denoted by
(LA−,LA+).
Then we have
Corollary 10.3**.**
The C∗-algebra OLA−+
is isomorphic to the Cuntz–Krieger algebra OA, whereas
the other C∗-algebra
OLA+−
is isomorphic to the C∗-algebra of the crossed product
C(ΛA)⋊σA∗Z
of the commutative C∗-algebra
C(ΛA) of complex valued continuous functions
on the two-sided shift space ΛA by the automorphism induced by the homeomorphism σA
of the shift on ΛA.
Let (L−,L+) be a λ-graph bisystem.
As seen in the construction of the C∗-algebra
OL−+, the C∗-subalgebra
AL− generated by the projections Eil−(ξ),ξ∈F(vil)
is isomorphic to the commutative C∗-algebra
C(ΩL−) whose character space
ΩL− consists of infinite labeled paths of the labeled
Bratteli diagram L−.
Since the matrix
Al,l+1+(i,α,j) for vil∈Vl,vjl+1∈Vl+1,α∈Σ+
in the operator relation (8.9)
is the structure matrix of the other
Bratteli diagram L+,
the operator relation (8.9)
of OL−+ tells us that the Bratteli diagram
L+ “acts” on ΩL−.
We actually see that ρα for α∈Σ+ defined in
(8.1)
gives rise to an endomorphism on
C(ΩL−).
This means that the C∗-algebra
OL−+ may be regarded as the one constructed from an action
of L+ onto L−.
From this view point, the other
C∗-algebra
OL+− may be regarded as the one constructed from an action
of L− onto L+.
This observation says that the two C∗-algebras
OL−+ and OL+−
are obtained from the labeled Bratteli diagrams
L− and L+
by exchanging its roles of the action and the space, respectively.
In this sense, one may consider that the
two C∗-algebras
OL−+ and OL+− have a “duality” to each other.
Therefore Corollary 10.3 shows us that the pair of the Cuntz–Krieger algebra
OA and the crossed product C∗-algebra C(ΛA)⋊σA∗Z
is regarded as a “duality” pair.
More precisely, our definition of “duality” in this setting is the following.
Definition 10.4**.**
Let G1,G2 be amenable and étale groupoids such that
their unit spaces G1(0),G2(0)
are totally disconnected compact Hausdorff spaces.
The pair
(C∗(G1),C(G1(0)))
and
(C∗(G2),C(G2(0)))
of the C∗-algebras of the étale groupoids G1,G2
and their commutative C∗-subalgebras of its diagonals
C(G1(0)) and
C(G2(0))
is said to be a duality pair
if there exists a λ-graph bisystem
(L−,L+) such that there exist isomorphisms
Φ1:C∗(G1)⟶OL−+
and
Φ2:C∗(G2)⟶OL+−
such that
Φ1(C(G1(0)))=C(XL−+)
and
Φ2(C(G2(0)))=C(XL+−),
that is
[TABLE]
In other words, the condition (10.5) is equivalent to
the condition that the groupoids
G1,G2 are isomorphic to
GL−+,GL+−
as étale groupoids, respectively
when the groupoids
G1,G2,GL−+,GL+−
are all essentially principal (Renault [35, Proposition 4.11]).
Let A be an N×N irreducible non-permutation matrix over {0,1}.
Let DA
be the commutative C∗-subalgebra of diagonal elements of the canonical AF-algebra
inside the Cuntz–Krieger algebra OA.
The subalgebra DA
is isomorphic to the commutative C∗-algebra C(ΛA+)
of the right one-sided shift space ΛA+ of ΛA.
As a result, we have the following corollary of Proposition 10.2
by the discussion of this section.
Corollary 10.5**.**
The pair (OA,DA) and (C(ΛA)⋊σA∗Z,C(ΛA))
is a duality pair in the above sense.
Acknowledgments:
The author would like to deeply thank the referee
for many helpful comments and suggestions in the presentation of the paper.
This work was supported by JSPS KAKENHI Grant Numbers 15K04896, 19K03537.
Bibliography39
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] O. Bratteli , Inductive limits of finite-dimensional C ∗ superscript 𝐶 C^{*} -algebras , Trans. Amer. Math. Soc. 171 (1972), pp. 195–234.
2[2] T. M. Carlsen , On C ∗ superscript 𝐶 C^{*} -algebras associated with sofic shifts , J. Operator Theory 49 (2003), pp. 203-212.
3[3] T. M. Carlsen and K. Matsumoto , Some remarks on the C ∗ superscript 𝐶 C^{*} -algebras associated with subshifts , Math. Scand. 95 (2004), pp. 145-160.
4[4] J. Cuntz , A class of C ∗ superscript 𝐶 C^{*} -algebras and topological Markov chains II: reducible chains and the Ext Ext {{\operatorname{Ext}}} -functor for C ∗ superscript 𝐶 C^{*} -algebras , Invent. Math. 63 (1980), pp. 25–40.
5[5] J. Cuntz and W. Krieger , A class of C ∗ superscript 𝐶 C^{*} -algebras and topological Markov chains , Invent. Math. 56 (1980), pp. 251–268.
6[6] V. Deaconu , Groupoids associated with endomorphisms , Trans. Amer. Math. Soc. 347 (1995), pp. 1779–1786.
7[7] V. Deaconu , Generalized Cuntz–Krieger algebras , Proc. Amer. Math. Soc. 124 (1996), pp. 3427–3435.
8[8] V. Deaconu , Generalized solenoids and C ∗ superscript 𝐶 C^{*} -algebras , Pacific J. Math. 190 (1999), pp. 247–260.