Table of Contents
Fetching ...

Toeplitz subshifts of finite rank

Su Gao, Ruiwen Li, Bo Peng, Yiming Sun

Abstract

In this paper we study some basic problems about Toeplitz subshifts of finite topological rank. We define the notion of a strong Toeplitz subshift of finite rank $K$ by combining the characterizations of Toeplitz-ness and of finite topological rank $K$ from the point of view of the Bratteli--Vershik representation or from the $\mathcal{S}$-adic point of view. The characterization problem asks if for every $K\geq 2$, every Toeplitz subshift of topological rank $K$ is a strong Toeplitz subshift of rank $K$. We give a negative answer to the characterization problem by constructing a Toeplitz subshift of topological rank $2$ which fails to be a strong Toeplitz subshift of rank $2$. However, we show that the set of all strong Toeplitz subshifts of finite rank is generic in the space of all infinite minimal subshifts. In the second part we consider several classification problems for Toeplitz subshifts of topological rank $2$ from the point of view of descriptive set theory. We completely determine the complexity of the conjugacy problem, the flip conjugacy problem, and the bi-factor problem by showing that, as equivalence relations, they are hyperfinite and not smooth. We also consider the inverse problem for all Toeplitz subshifts. We give a criterion for when a Toeplitz subshift is conjugate to its own inverse, and use it to show that the set of all such Toeplitz subshifts is a meager set in the space of all infinite minimal subshifts. Finally, we show that the automorphism group of any Toeplitz subshift of finite rank is isomorphic to $\mathbb{Z}\oplus C$ for some finite cyclic group $C$, and for every nontrivial finite cyclic group $C$, $\mathbb{Z}\oplus C$ can be realized as the isomorphism type of an automorphism group of a strong Toeplitz subshift of finite rank greater than $2$.

Toeplitz subshifts of finite rank

Abstract

In this paper we study some basic problems about Toeplitz subshifts of finite topological rank. We define the notion of a strong Toeplitz subshift of finite rank by combining the characterizations of Toeplitz-ness and of finite topological rank from the point of view of the Bratteli--Vershik representation or from the -adic point of view. The characterization problem asks if for every , every Toeplitz subshift of topological rank is a strong Toeplitz subshift of rank . We give a negative answer to the characterization problem by constructing a Toeplitz subshift of topological rank which fails to be a strong Toeplitz subshift of rank . However, we show that the set of all strong Toeplitz subshifts of finite rank is generic in the space of all infinite minimal subshifts. In the second part we consider several classification problems for Toeplitz subshifts of topological rank from the point of view of descriptive set theory. We completely determine the complexity of the conjugacy problem, the flip conjugacy problem, and the bi-factor problem by showing that, as equivalence relations, they are hyperfinite and not smooth. We also consider the inverse problem for all Toeplitz subshifts. We give a criterion for when a Toeplitz subshift is conjugate to its own inverse, and use it to show that the set of all such Toeplitz subshifts is a meager set in the space of all infinite minimal subshifts. Finally, we show that the automorphism group of any Toeplitz subshift of finite rank is isomorphic to for some finite cyclic group , and for every nontrivial finite cyclic group , can be realized as the isomorphism type of an automorphism group of a strong Toeplitz subshift of finite rank greater than .

Paper Structure

This paper contains 20 sections, 44 theorems, 124 equations.

Key Result

Theorem 1.2

The following classification problems for all Toeplitz subshifts of topological rank $2$ are hyperfinite and not smooth:

Theorems & Definitions (81)

  • Theorem 1.2
  • Theorem 1.3
  • Lemma 2.1
  • Theorem 2.2: Kechris--Louveau KL
  • Lemma 2.3: Jackson--Kechris--Louveau JKL
  • Lemma 2.4: Thomas Thomas2013
  • Theorem 2.5: Curtis--Hedlund--Lyndon
  • Theorem 2.6: Downarowicz--Kwitakowski--Lacroix DKL
  • Lemma 2.7: Berthé--Steiner--Thuswaldner--Yassawi BSTY19
  • Proposition 3.1: Arbulú--Durand--Espinoza ADE2024
  • ...and 71 more