Unique ergodicity, and not, for primitive substitutions on compact alphabets containing isolated points
Abstract
We consider generalised subshifts generated by continuous substitution on compact Hausdorff alphabets. Although primitivity still implies minimality of the subshift generated by the substitution, Durand, Ormes and Petite showed, in contrast to the finite case, that primitivity no longer implies unique ergodicity, by constructing counterexamples with Cantor alphabet. Here we show that, even for the arguably simplest case of the one-point compactification of the natural numbers, primitivity is still insufficient for unique ergodicity, or even the existence of a natural length function (NLF). In previous work with Mañibo and Rust we showed that, for irreducible substitutions, unique ergodicity and existence of a NLF follow from strong power convergence of the renormalised substitution operator T; criteria were also developed that can sometimes confirm strong power convergence. Here we show the converse, so that strong power convergence of T is equivalent to having both unique ergodicity and a NLF. We then consider the case of alphabets with only finitely many accumulation points, showing how upper bounds (and usually an exact formula) for the essential spectral radius of T can be derived from associated finite substitutions, determined by the behaviour of substitution of the accumulation points. For many primitive substitutions this can be used to prove quasi-compactness of T, and thus unique ergodicity. For primitive substitutions on alphabets with at least one isolated point, we show that strong power convergence and quasi-compactness of T are equivalent and, in fact, that these properties are equivalent to iteration of substitution growing words in length uniformly across all seeds in the alphabet.
Related
- Saturation numbers for joins with graphs containing isolated vertices
- Systematic Codes Correcting Two Deletions with Three Redundant Symbols over Large Alphabets
- A Layered Simplex Architecture for Large Alphabets
- New upper and lower bounds on covering codes K_q(n,R) for alphabets of size 5 <= q <= 21
- The Thue-Morse substitutions and self-similar groups and algebras
BibTeX
@misc{walton2026unique,
title = {{Unique ergodicity, and not, for primitive substitutions on compact alphabets containing isolated points}},
author = {James J. Walton},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2609.07550},
eprint = {2609.07550},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.07550},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Unique ergodicity, and not, for primitive substitutions on compact alphabets containing isolated points
AU - James J. Walton
PY - 2026
DA - 2026/10/19
PB - arXiv
DO - 10.48550/arxiv.2609.07550
UR - https://arxiv.org/abs/2609.07550
AB - We consider generalised subshifts generated by continuous substitution on compact Hausdorff alphabets. Although primitivity still implies minimality of the subshift generated by the substitution, Durand, Ormes and Petite showed, in contrast to the finite case, that primitivity no longer implies unique ergodicity, by constructing counterexamples with Cantor alphabet. Here we show that, even for the arguably simplest case of the one-point compactification of the natural numbers, primitivity is still insufficient for unique ergodicity, or even the existence of a natural length function (NLF). In previous work with Mañibo and Rust we showed that, for irreducible substitutions, unique ergodicity and existence of a NLF follow from strong power convergence of the renormalised substitution operator T; criteria were also developed that can sometimes confirm strong power convergence. Here we show the converse, so that strong power convergence of T is equivalent to having both unique ergodicity and a NLF. We then consider the case of alphabets with only finitely many accumulation points, showing how upper bounds (and usually an exact formula) for the essential spectral radius of T can be derived from associated finite substitutions, determined by the behaviour of substitution of the accumulation points. For many primitive substitutions this can be used to prove quasi-compactness of T, and thus unique ergodicity. For primitive substitutions on alphabets with at least one isolated point, we show that strong power convergence and quasi-compactness of T are equivalent and, in fact, that these properties are equivalent to iteration of substitution growing words in length uniformly across all seeds in the alphabet.
ER -