DEGREES OF CODES AND ALMOST CONJUGACY

Abstract

In Chapters 7 and 8 we studied two notions of equivalence for shifts of finite type and sofic shifts: conjugacy and finite equivalence. Conjugacy is the stronger and more fundamental notion, while finite equivalence is more decidable. In this chapter, we introduce an intermediate concept of equivalence called almost conjugacy, which was motivated by constructions of codes in ergodic theory. For a finite-to-one factor code on an irreducible shift of finite type or sofic shift, there is, by definition, a uniform upper bound on the number of pre-images of points in the image. Thus, the number of pre-images can vary through a finite set of positive integers. In §9.1 we show that certain points which are “representative” of the range shift all have the same number of pre-images. This number is called the degree of the code. In §9.2 we focus on codes of degree one, called almost invertible codes, and show how under certain circumstances finite-to-one codes can be replaced by almost invertible codes without changing the domain and range. In §9.3 we introduce the notion of almost conjugacy, which by definition is a finite equivalence in which both legs are almost invertible. We show that entropy and period form a complete set of almost conjugacy invariants for irreducible shifts of finite type and for irreducible sofic shifts. Finally, in §9.4 we conclude with results which assert that the “representative” points are really “typical” points in a probabilistic sense.