A geometric simulation theorem on direct products of finitely generated groups
A geometric simulation theorem on direct products of finitely generated groups, Discrete Analysis 2019:9, 25 pp.
In 1961, the mathematician and philosopher Hao Wang introduced the notion that we now call a Wang tiling of Z2. Each tile is a unit square with edges marked in a certain way, and two tiles can be placed next to each other if and only if the adjacent edges have the same marking. (Also, tiles are not allowed to be rotated.)
Wang observed that if every set of Wang tiles admits a periodic tiling, then there is an algorithm for deciding whether any given finite set of Wang tiles can tile the plane, since if it cannot, then by an easy compactness argument there is some finite subset of the plane that cannot be tiled, whereas if it can, then one can do a brute-force search for a fundamental domain of the tiling. Wang believed that every tiling should be periodic, but his student Robert Berger showed in his PhD thesis in 1964 that the the tiling problem could be used to encode the halting problem, thereby proving that there was no algorithm for solving the former, which yielded the first known example of a set of tiles that could tile the plane but only aperiodically. (The result appeared in paper form in 1966.)
The notions of Wang tilings and aperiodicity have been fruitfully generalized from Z2 to more general groups, as follows. Let G be a group (which will be infinite) and let A be a set of symbols, which we can think of as our “tiles”. Define a pattern to be a function p:X→A, where X is some finite subset of G. Given a function ω:G→A, say that the pattern p occurs in ω if there exists some g∈G such that ω(gx)=p(x) for every x∈X. Now let P be a finite set of forbidden patterns. The set of all functions ω such that no pattern p∈P occurs in ω is called the subshift of finite type determined by P. The functions ω that satisfy this condition are called configurations. Note that the set of tilings of the plane with a given set of Wang tiles is a subshift of finite type determined by the rules that stipulate when two tiles may be placed next to each other, each of which is given by a forbidden pattern of size 2.
Note that G acts on a subshift of finite type in an obvious way: if h∈G and ω is a configuration, then so is the function ωh defined by ωh(g)=ω(h−1g). The map (h,ω)↦ωh is easily checked to be an action. The subshift is called strongly aperiodic if this action is free: that is, if no non-trivial group element takes any configuration to itself. In the case of Wang tiles, the subshift is strongly aperiodic if and only if no tiling with the given set of tiles is periodic.
This paper is about so-called simulation theorems. A basic example of such a theorem is the following result mentioned by the authors. A group is said to be recursively presented if it is countably generated and there is an algorithm for determining whether any given word in the generators is a relation. It is known that every subgroup of a finitely presented group is recursively presented, and a theorem of Graham Higman states the converse: that every recursively presented group can be embedded into a finitely presented group.
The interesting feature of this theorem is that a rather complicated object – a recursively presented group – can be embedded into a much simpler one – a finitely presented group. In this paper, a theorem of a similar kind is proved for dynamical systems. It can be shown that if the shift action of a subshift of finite type is restricted to a subgroup, the resulting action need not be a subshift of finite type. However it has the important property of being effectively closed. This means, roughly speaking, that there is an algorithm that determines, for any group element g, any pair ω,ω′ of configurations, and any pair N1,N2 of basic open neighbourhoods of ωg and ω′ (in the product topology), whether N1 and N2 are disjoint. Even more roughly, it is effectively closed if there is an algorithm that allows one to approximate the action arbitrarily well.
One can now ask whether an effectively closed subshift can be embedded, in a suitable sense, into a subshift of finite type. The main result of this paper is a result of exactly this type. It has a number of interesting consequences, of which a notable one is that the Grigorchuk group (the famous group that exhibits growth that is intermediate between polynomial and exponential) admits a non-empty strongly aperiodic subshift of finite type. The proof builds on a number of deep ideas due to Mike Hochman and Tom Meyerovitch, and the author and Mathieu Sablik. An unusual feature of the argument is that it obtains aperiodic tilings by first obtaining computational simulations, rather than first obtaining aperiodic tilings and then extracting computational corollaries from them.