Profinite approach to S-adic shift spaces I: Saturating directive sequences

Abstract

This paper is the first in a series of three, about (relatively)free profinite semigroups and S-adic representations of minimal shift spaces. We associate to each primitive S-adic directivesequence ${\boldsymbol{\sigma}}$ a $\textit{profinite image}$ in the free profinite semigroup over the alphabet of the induced minimal shift space. When this profinite image contains a $\mathcal{J}$-maximal maximal subgroup of the free profinite semigroup (which, up to isomorphism, is called the $\textit{Sch\"utzenberger group}$ of the shift space), we say that ${\boldsymbol{\sigma}}$ is $\textit{saturating}$. We show that if ${\boldsymbol{\sigma}}$ is recognizable, then it is saturating. Conversely, we use the notion of saturating sequence to obtain several sufficient conditions for ${\boldsymbol{\sigma}}$ to be recognizable: ${\boldsymbol{\sigma}}$ consists of pure encodings; or ${\boldsymbol{\sigma}}$ is eventually recognizable, saturating and consists of encodings; or ${\boldsymbol{\sigma}}$ is eventually recognizable, recurrent, bounded and consists of encodings. For the most part, we do not assume that ${\boldsymbol{\sigma}}$ has finite alphabet rank although we establish that this combinatorial property has important algebraic consequences, namely that the rank of the Sch\"utzenberger group is also finite, whose maximum possible value we also determine. We also show that for every minimal shift space of finite topological rank, the rank of its Sch\"utzenberger group is a lower bound of the topological rank.