Distortion in One-Head Machines and Cellular Automata

. We give two families of examples of automorphisms of sub-shifts that are range-distorted , that is, the radius of their iterations grows sublinearly. One of these families comes from one-head machines, and allows us to build such automorphisms for the full shift


Introduction
In this article, 'distortion' means that something that typically grows or moves linearly or not at all instead does so at an intermediate rate. In one-head machines, we consider sublinear head movement (the head visits o(t) cells in t steps), and in cellular automata sublinear radius growth (the radius of the iterates grows in o(t)), which corresponds to range distortion in the terminology of [1]. In both cases, we show 'trichotomy' results: there are logarithmic gaps between periodic and distorted cases, and between distorted and positive-speed machines.
We show that every aperiodic one-head machine is distorted. The existence of aperiodic one-head machines is well-established, in particular [2] shows that they not only exist but form a computationally hard (undecidable) set. The single most beautiful example of an aperiodic machine is probably the SMART machine [3], whose moving tape dynamics is even minimal.
We discuss two ways of achieving distortion in automorphism groups of subshifts. To every one-head machine, we can associate a cellular automaton (on a full shift) whose radius grows at roughly the same speed as the head of the one-head machine moves. Given that there exist distorted one-head machines, there also exist distorted cellular automata. The examples given are reversible, and thus we obtain distorted automorphisms on a transitive subshift, answering an implicit question of [1]. By known embedding theorems, we obtain such examples on all uncountable sofic shifts.
We also construct an example of an automorphism on a general subshift with 'highly unbalanced distortion', in the sense that for an infinite set of times t ∈ N, f t has a 'right-leaning' neighborhood (one of the form a, ∞ ) that contains only slightly more than logarithmically many cells to the left of the origin, and 'left-leaning' neighborhood with the symmetric property, yet all its two-sided neighborhoods grow at an almost linear rate. In particular, the intersection of all neighborhoods is far from being a neighborhood, answering Question 3.26 of [1].

Subshifts and cellular automata
Let Σ be a finite set called the alphabet. Then Σ Z with the product topology is called the full shift, and it is a Z-dynamical system under the shift map σ : Σ Z → Σ Z defined by σ(x) i = x i+1 . Closed shift-invariant subsets of it are called subshifts. If X and Y are subshifts, a function f : X → Y is called a morphism if it is continuous and σ • f = f • σ. It is an endomorphism if Y = X and an automorphism if, besides, it is bijective (in which case it automatically has a left and right inverse endomorphism). A cellular automaton is another name for an endomorphism, though often this term is reserved for the case X = Y = Σ Z .
Automorphisms are also called reversible cellular automata.
An endomorphism f is preperiodic if f p+q = f q for some preperiod q ∈ N and some period p ∈ N \ {0}. If an automorphism is preperiodic with q = 0, it is periodic.
The trace map T f : X → Σ N is the map defined by T f (x) t = f t (x) 0 for all x ∈ X and t ∈ N. It is clear that τ f = T f (X) is a one-sided subshift (closed and shift-invariant), which is finite if and only if f is preperiodic.
For X a subshift and n ∈ N we define the complexity function K X by K X (n) = x 0,n x ∈ X , the number of distinct patterns occuring in configurations of X. It is easy to see that if X is infinite, then K X is increasing.

Neighborhoods and radii
It is quite well-known [4] that if f : X → Y is a morphism, then it admits a neighborhood, that is a finite interval I ⊂ Z such that ∀x, y ∈ X, Let X and Y be Z-subshifts and f : X → Y a morphism. We define the set of neighborhoods as The diameter D(f ) of a morphism f is then the least possible diameter 2r +1 of a central neighborhood −r, r ∈ N (f ).

Remark 1.
It is easy to see that N (f ) is an upset: The case when N (f ) is a principal filter, that is when N (f ) = { J | J ⊃ I} for some finite interval I (it is well-known that this happens for the full shift), is especially desirable. In that case, I must be the intersection of all elements in N (f ), and thus we define I(f ) = J∈N (f ) J (it corresponds to I(−1, f ) in the notation of [1]). Let us also define d(f ) as the diameter of {0} ∪ I(f ), which is at most D(f ) (and is equal if X is the full shift for example). Theorem 5 will give an example of endomorphism where N (f ) is far from being a filter.

Distortion
Let f be an endomorphism of a subshift X. For t ∈ N, let us define D t (f ) This definition is equivalent to the one from [1,5], and comparable to the notion of distortion from group theory: if f t can be expressed as a product of o(t) generators of some finitely generated endomorphism submonoid, then f is range-distorted.
The distortion function t → D t (f ) cannot be arbitrarily low. In fact, naively counting the possible local rules gives a log log lower bound, but the Morse-Hedlund theorem allows to 'remove' one log in the following proposition, which is a direct adaptation from the main argument in [5,Theorem 3.8].
Proposition 1. If X is a subshift and f : X → X an endomorphism. Then exactly one of the following holds: and d(f t ) = Θ(t) (f has non-0 Lyapunov exponents).
Note that if X has linear complexity or if f has positive entropy, then the central class is empty. Moreover, if K X (n) = O(n d ) (resp. O(2 n ε )), then endomorphisms of this class must even have D t (f ) = Ω(t 1/d ) (resp. Ω((log t) −ε )).
Proof. Let t ∈ N. If f is not preperiodic, then neither is its trace τ f . By the Morse-Hedlund theorem, we must have K τ f (t) > t. By definition, D t can be written as 2r + 1 such that for all x, y ∈ X such that x −r,r = y −r,r , , then subadditivity and the Fekete lemma imply that D t = Θ(t) (and the same for d(f t )). This argument is formalized for example in [6] or [1], and the limit of D t /2t corresponds to the maximal so-called Lyapunov exponent, in absolute value.
It is not known if there is the same lower gap for d(f t ), or in general which kinds of growths are possible.
A natural object is the two-dimensional subshift of (two-sided) space-time diagrams of f : X f = { x | ∀t ∈ Z,(x n,t ) n∈Z = f ((x n,t−1 ) n∈Z ) ∈ X}. Following [7], we say that a vector line (or direction) ⊂ R 2 is expansive in X f if there exists a width r ∈ N such that: The following proposition is not difficult. It is for example a particular case of [1,Proposition 4.5].
Proposition 2. A non-periodic automorphism f and its inverse are distorted if and only if X f has the vertical direction as unique direction of nonexpansiveness.
Actually, any 2D subshift is expansive in every nonvertical direction if and only if it is conjugate to X f for some automorphism f such that both f and f −1 are periodic or distorted (a particular case of [1, Proposition 5.6]).
Note that Proposition 2 could motivate a notion of directional distortion, corresponding to endomorphisms whose space-times have a unique direction of nonexpansiveness, and whose composition with the corresponding shift is not preperiodic (in particular, if the unique direction of nonexpansiveness is irrational) .
Several examples of such extremely expansive two-dimensional subshifts are known. A general self-simulating construction is given in [8], and effectivized (so that f is obtained as a partial local rule from the full shift) in [9,10].
We give in Section 4 a construction which is very similar to a second construction in [8], though independent. But first, in Section 3, we prove a link with one-head machines, which allows us to get distorted automorphisms of the full shift.
3 Distorted one-head machines

One-head machines
Let ∆ = {−1, +1} be the set of directions. A one-head machine (or Turing machine) M is a triple (Q, Σ, δ) where Q is a finite set of states, Σ is a finite set of symbols, and δ ⊂ (Q × ∆ × Q) (Q × Σ × Q × Σ) is the transition function. This model (for example introduced in [11]) is equivalent to the one in [12], but handles reversibility better. NotingΣ = Σ (Q × Σ), where elements of Q × Σ are called heads, and We actually focus on total deterministic machines, that is, machines where every configuration has exactly one successor, which makes M M induce an endomorphism of X M , also noted M M . A reversible one-head machine (RTM) is a deterministic one-head machine for which M M is actually an automorphism.
A (total deterministic) one-head machine M is periodic or preperiodic if the corresponding endomorphism is.
A configuration x ∈ X M is weakly periodic if M p M (x) = σ j (x) for some p ≥ 1 and j ∈ Z. We will say that it is aperiodic if it has no weakly periodic configuration containing a head 3 (that is, no configuration x with a nontrivial p ≥ 1 and q ∈ Z such that M p Fix a one-head machine M = (Q, Σ, δ). If x ∈Σ Z contains a head, we write s t (x) for the number of distinct cells that the head of M visits in the first t steps starting from configuration x (taking the number of distinct cells rather than the position makes it nondecreasing, which simplifies some arguments). [14] as the limit of m(t)/t, which exists by subadditivity. A one-head machine will be called distorted if it is not periodic but m is sublinear in t.
We will prove that aperiodic one-head machines are examples of distorted machines.

Speed trichotomy
In this section, we give some information on the possible speeds of one-head machines, namely that there are two gaps of impossible movements. Theorem 1. Let M = (Q, Σ, δ) be a one-head machine with movement bound m. Then exactly one of the following holds: The preperiodic and positive speed cases are quite well understood. It can even be shown that some periodic configuration achieves the maximal speed [14]. We do not know what kinds of intermediate growth functions can be realized with distorted one-head machines.
Here is a simple counting lemma. If H : N → N is nondecreasing, we write H −1 (n) for the largest such that H( ) ≤ n. Lemma 1. Let a 0 , . . . , a n be in N and suppose that |{ i ∈ 0, n | a i = }| ≤ h( ) for all . We have the following. Proof.

Define
where the first inequality follows by sorting the a i in increasing order and observing that then necessarily a i ≥ b i for all i, and the second follows by a direct counting argument.
The upper bound is achieved by a counting argument, and the right object to count are the crossing sequences, which we now define.
To any machine M, configuration x ∈ X M and position J ⊂ Z, we can associate the crossing times θ J (x) as the ordered set of times k ∈ N such that it is formally a tuple, but sometimes we use set notation, like its cardinality |θ J (x)| or diameter max θ J (x)−min θ J (x). Moreover for all steps t ∈ N, we can associate the (partial) crossing sequence u J,t (x) = This definition is close to a finitary version of the notion in [15,14], except we take the sequence at a given cell rather than between two neighboring cells, which makes no difference except for writing. We use notations We are now ready to prove the main equivalence of this section.
Proposition 3. Let M be a one-head machine. The following are equivalent.
2. There exist a configuration x ∈ X M , two distinct positions i, j ∈ Z, and a step t ∈ N such that u i,t (x) = u j,t (x) are nonempty.
3. There exists a configuration x ∈ X M such that the cardinality of θ i (x) is uniformly bounded for i ∈ Z.
4. There exists a configuration x ∈ X M such that the diameter of θ i (x) is uniformly bounded for i ∈ Z.
5. There exists a weakly periodic configuration which is not periodic. 6. M has positive speed: m(n) = Ω(n).
Point 2 actually remains equivalent if the first visited crossing sequence admits the other one as a prefix. The implications 2 ⇒ 3 (resp. 3⇒4) could also have been derived from looking at the countable-state Markov shift built in [14] (resp. from a general result over path spaces [16]), but we give specific proofs for completeness. Proof.
1⇒2 Let x be a configuration and t a step, and which is the sum of lengths of the crossing sequences. Suppose that every crossing sequence u i,t (x) is distinct, for i ∈ J. There are at most (|Σ| |Q|) distinct crossing sequences of length , so it follows from Lemma 1 that t = Ω(|J| log |J|). We get: for some constant B and all large enough t, and where γ is the inverse of the function t → t log t, which satisfies γ(t) ≤ t log t−log log t ≤ 2 t log t for large t. 2⇒3 By symmetry, we can assume that j > i and min θ j,t (x) > min θ i,t (x). By shifting and applying M M , we can assume that i = 0 and min θ i,t (x) = 0. We can also assume that t is minimal for the property that u 0,t (x) = u j,t (x) is not empty. Equivalently, t is the first step n for which k n = |θ 0,n (x)|−|θ j,n (x)| = 0. Since k 0 = 1 and for n ∈ N, gives a right movement by δ (if the machine head had been going to the left on 0 at t = max θ 0,t (x), then it could not have reached position j before time t).
Let J −1 = −∞, 0 and, for n ∈ N, J n = jn + 0, j . Let y ∈ X M have a tape that is periodic on the right in the following way: Let us build inductively a nondecreasing map φ : ,φ(k,n) +1) (in particular, this gives u Jn,k (y) = u J min(n,0) ,φ(k,n) (x)); moreover, the restriction of φ to θ Jn,k (y) × {n} is an injection onto θ J min(n,0) ,φ(k,n) (x). φ(0, n) = 0 clearly satisfies this. Now, suppose that φ has been built up to . By the first remark of the proof, we see that φ(k, n) = t + 1.
The last property of φ gives that for all n ∈ N, |θ Jn,k | = θ J min(n,0) ,φ(k,n) and the fact that the map is bounded gives that this is at most θ J min(n,0) ,t ≤ t. We obtain that the number of visited cells in the first k steps on y is Ω(jk/t).
3⇒4 Let ≥ 1 be minimal such that there is a configuration x ∈ X M \ Σ Z such that ∀i ∈ Z,|θ i (x)| ≤ . Assume that for all n ∈ N, there exists i n ∈ Z for which the diameter of θ in (x) is at least n. Let us consider a limit point y of (M min θi n (x) M σ in (x)) n∈N . By minimality of , we know that |θ i (y)| ≥ for some i ∈ Z. Let t = max θ i (y), and n be such that for all m ≥ n, ∀k ≤ In particular, u i,t (σ im (x)) = u i,t (y) has length at least . By assumption, it actually has length and θ i+im (x) = θ i (σ im (x)) ⊂ 0, t . For every m ≥ max(n, t), we have max θ im (x) ≥ m ≥ t, so that, after time t, the head is in the connected component of Z\{i+i m } that contains i m . Let us assume that i > 0 (the argument is symmetric), so that this connected component is −∞, i + i m for every m, and let j be one position taken by the head after time t. Then for all m ≥ max(n, t), j < i + i m , which means i m > j − i. On the other hand, if i m is itself a position that the head takes after time t, so it must be in −∞, i + i max(n,t) . It results that { i m | m ≥ max(n, t)} is included in the finite set j − i, i + i max(n,t) , which contradicts its infinity.
4⇒5 Let n ≥ 1 and x ∈ X M \ Σ Z such that for all i ∈ Z, the diameter of θ i (x) is at most n. By the pigeonhole principle, there are two distinct positions Assume that i = 0 < j and min θ i (x) = 0 < p = θ j (x) (by symmetry). Then our assumption says that In particular, we get that M p M (y) jm+n = y j(m−1)+n = σ j (y) jm+n . 5⇒6 It is clear that any configuration x such that M p M (x) = σ j (x) has a speed s t (x) ∼ jt/p. 6⇒1 This is obvious.
Proof (of Theorem 1). From Proposition 1 together with Remark 2, we know that if M is not preperiodic, then m(t) = Ω(log t). The other gap corresponds to the implication 1 ⇒ 6 in Proposition 3.

Aperiodic machines
Theorem 2. Every aperiodic one-head machine is distorted.
In particular, there exist distorted one-head machines: see for example [17,3] for constructions of aperiodic machines. The latter is even minimal in the moving tape model (which directly implies aperiodicity, except over the trivial alphabet).
Proof. Consider the three cases of Theorem 1. If M is aperiodic, it naturally cannot be preperiodic. If M were in the last case of the theorem, its trace subshift would contain a periodic point y ∈ (Q × Σ) N with positive speed. On a configuration where this movement is realized, every cell is visited a bounded number of times, during a time interval of bounded length. Thus M is essentially performing a finite transduction, and it is easy to extract, by the pigeonhole principle, a configuration in Q × Σ Z where M acts periodicially.
The machine constructed in [3] also has the property that the trace subshift of the one-head machine (the subshift encoding possible sequences of states that the head can enter when acting on a configuration) has a substitutive structure, and an explicit substitution is given. As the head movement only depends on the trace, it should be possible to compute the movement bound explicitly using spectral properties of the matrix associated to the substitution (see [18]), but this requires a bit of work since the substitution given in [3] is not primitive.

Distortion on sofic shifts
The question of distortion is most interesting on simple subshifts, as then distortion comes from the automorphism itself and not the structure of the subshift. In [1], it is stated in particular that it is not known whether range-distortion can be achieved on transitive subshifts. In this section, we show that the existence of distorted one-head machines directly implies the existence of distorted automorphisms on all uncountable sofic shifts.
The following lemma is a direct corollary of the construction in [19, Lemma 7] (the result is proved for mixing SFTs in [20], with essentially the same construction).
Lemma 2. Let X be a full shift and Y an uncountable sofic shift. Then there exist C, B ∈ N and an embedding φ from the endomorphism monoid of X to that of Y such that |D(φ(f )) − BD(f )| ≤ C for all endomorphisms f of X.
The number B comes from the fact that individual (pairs of) letters are written as words of length B occurring in Y , and C comes from the fact that the rule is only applied in "safe contexts". The proof uses so-called 'conveyor belts' to deal with configurations with several heads. One could also use the construction of [2] to embed the one-head machine to a cellular automaton, and obtain the same result.

Proof (of Lemma 3).
The proof is similar to that of [19,Lemma 7]. For a residual set of points x ∈ Γ Z , we can split x into a product x = · · · w −2 w −1 w 0 w 1 w 2 · · · such that for each i ∈ Z, we have and this factorization is clearly unique: every point in Γ Z can be seen as a point of this form, but the leftmost and/or rightmost words can be degenerate, and have an infinite number of ±1. It is enough to define how f transforms these words, and if the resulting map is uniformly continuous (which will be evident from the construction), then f uniquely extends to a continuous function on the full shift. Shift-commutation follows automatically because the decomposition of x is unique and the decomposition process is shift-invariant, and thus we obtain a cellular automaton. On words in (Σ 2 × {+1}) * (Σ 2 × {−1}) * , we do nothing. If w ∈ (Σ 2 × {+1}) * ((Q×Σ)∪(Σ×Q))(Σ 2 ×{−1}) * , let w ∈ (Σ 2 ) * ((Q×Σ)∪(Σ×Q))(Σ 2 ) * be the word obtained from w by erasing the arrows. We see w as a 'conveyor belt', wrapped around which is a word of length 2 |w |. More precisely, let u = π 1 (w ) and v equals the reversal π 2 (w ), of π 2 (w ), and observe that one of these words is in Σ + and the other one is in Σ * QΣ * .
Apply the transition function of the one-head machine to the configuration (uv) Z . Note that this configuration contains infinitely many heads, but as they move with the same rule, the movement is still well-defined. Note also that if the machine M is reversible, then this application is reversible as well, in the sense that the inverse of M −1 applied at every head undoes the transition step of M even on this periodic configuration. (This justifies the last sentence in the statement of the lemma.) Now, the resulting configuration (u v ) Z still contains exactly one head in every pattern u v . This configuration was obtained by a bijection that unwrapped a word w ∈ (Σ 2 ) * ((Q×Σ)∪(Σ×Q))(Σ 2 ) * to a pair of words. Perform the inverse of this bijection, rewrapping u and v to a word in (Σ 2 ) * ((Q×Σ)∪(Σ×Q))(Σ 2 ) * , and add a +1 and −1 component pointing towards the machine head to each cell containing a symbol in Σ 2 . This defines f . Note that x and f (x) always have the same decomposition, and if the one-head machine is reversible, its reverse one-head machine defines To see that D(f t ) ≤ m(t), consider any configuration x ∈ Γ Z . If there is no machine head in x −m(t),m(t) , then f t (x) 0 = x 0 , since no machine head can travel by more than m(t) cells in t steps. If there is a machine head in this interval in some coordinate j ∈ Z, we start simulating its movement (also modifying the tape according to its movement). Note that the one-head machines stay neatly in their separate conveyor belts, so no machines crash into each other during this simulation. If a head steps out of the interval −m(t), m(t) during the simulation, we can stop simulating it, as it will not reach the origin. After simulating heads for t steps, we know the value of f t (x) 0 . (Of course, we really only have to simulate a head if its conveyor belt contains the origin, and there is a unique such a head, but it does not hurt to simulate all of them.) Theorem 3. Let X be an uncountable sofic shift. Then there exists a distorted automorphism on X.
Proof. Let M be a distorted one-head machine. Then the cellular automaton f constructed in the previous lemma is distorted. By Lemma 2, we obtain the same cellular automaton on any uncountable sofic shift.

Undecidability of distortion
In this section, we show that distortion is undecidable.
Theorem 4. It is undecidable, given a reversible one-head machine M, whether M is distorted.
We can actually see from the proof (and from the reduction in [2]) that it is Π 0 1 -complete. Proof. Every one-head machine lies in exactly one of the three cases of Theorem 1. We have a semialgorithm for the periodic case (by simply computing powers of M and checking whether they are the identity map), and we have a semialgorithm for the case when M has positive speed by the computability of speed, presented in [14, Theorem 2.7]. If we had a semialgorithm for detecting distortion, we would then be able to decide all three classes, contradicting the undecidability of periodicity, established in [2, Theorem 8].
Corollary 1. For every uncountable sofic subshift X, it is undecidable, given an automorphism Φ of X, whether Φ is distorted.

Unbalanced distortion in general subshifts
We give a general construction of a distorted automorphism. The distortion we aim for is 'highly unbalanced'.
As mentioned above, it is desirable that N (f ) is generated by a single interval, that is, I(f ) ∈ N (f ). Thus the size of the difference between I(f ) and the minimal intervals in N (f ) somehow measures the 'badness' of N (f ). We give an automorphism where this difference grows fast along iterations of f : The following theorem shows that we can have d(f t ) be close to logarithmic, while D(f t ) is close to linear.
We note that our construction is very similar to a construction in [8], though ours is not (at least consciously) based on it. Our proof is based on self-similar mud machinery that allows the construction of tracks that take a long time to walk over, but return to their original state once passed. To organize the behavior required in the theorem is then not difficult, though getting the numbers right requires some care because φ and ψ are arbitrary.
Theorem 5. Let φ : N → N be any sublinear function and let ψ : N → N be any nondecreasing superlogarithmic function. Then there exist a subshift X and an automorphism f : X → X such that there exist arbitrarily large t i such that By Proposition 1, the function φ cannot be made linear and ψ cannot be made logarithmic from a subshift X with subexponential complexity.
The following is shown in [1,Theorem 3.24]. Let us say that f is weakly periodic if there exist p ≥ 1 an j ∈ Z such that f p = σ j .
Theorem 6. Let X be an SFT and f : X → X an automorphism which is not weakly periodic. Then I(f t ) ∈ N (f t ) for all large enough t.
They ask [1, Question 3.26] whether the assumption that X is an SFT is needed. Theorem 5 answers by showing a general subshift and an automorphism of it for which at infinitely many t the interval I(f t ) is arbitrarily close to logarithmic in size, but all contiguous neighborhoods are arbitrarily close to linear in size. The proof of Theorem 5 first needs a technical but simple lemma. A function Functions with this property can have weird local behavior, which complicates the argument. We show that all sublinear functions are majored by sublinear functions with some additional nice properties.
A nondecreasing function ψ : N → R has asymptotic slope zero if |ψ(t + 1) − ψ(t)| tends to zero as t −→ ∞. Note that if for a function φ, we write ∂φ : N → R for its discrete derivative ∂φ(t) = φ(t + 1) − φ(t), then asymptotic slope zero, for an increasing function means just that ∂φ(t) tends to 0 as t −→ ∞. If ψ : R → R is piecewise linear and it is linear on every interval i, i + 1 where i ∈ N, then the restriction ψ : N → R has asymptotic slope zero if and only if the slopes of the linear pieces of ψ tend to zero. Lemma 4. If φ : N → R is sublinear, then there is a sublinear increasing piecewise linear function ψ : R → R with asymptotic slope zero such that ψ(t) ≥ φ(t) for all t ∈ N.
Proof. First, we may assume that φ is nondecreasing, by replacing φ(t) with max t i=0 φ(t), as the resulting function stays sublinear. By sublinearity, for all k ≥ 1 there exists t k such that t ≥ t k ⇒ φ(t) ≤ t/k.
Pick such t k ∈ N for all k ≥ 1, and observe that we can increase any of the t k without changing their relevant property. Thus, we can assume the following further properties: Consider the sequence of points (t k+1 , t k+1 /k) ∈ N × R. The second item makes sure that this sequence of points increases on the first axis, and the second makes sure the sequence also increases on the second axis. On t 2 , ∞ , define ψ as the piecewise linear function obtained by linearly interpolating values in the interval t k , t k+1 between t k /(k − 1), t k+1 /k . The function ψ is now increasing t 2 , ∞ , because the point (t k+1 , t k+1 /k) is strictly below point (t k+2 , t k+2 /(k + 1)) for all k ≥ 1.
Note that in the interval t k , ∞ where k ≥ 2, we have ψ(t) ≤ t/(k − 1): Each of the points (t , t /( − 1)) for > k are strictly below the line L k = linearly between these points, we obtain a path that stays under L k , and values of ψ(t) are by definition on this path. It follows from this that ψ is sublinear.
Next, observe that ψ(t + 1) ≤ ψ(t) + 1 k whenever t ≥ t k+1 . This is because the slope of the line between (t +1 , t +1 / ) and (t +2 , t +2 /( + 1)) is for all ≥ 1. Thus, increasing t by one can increase the value of ψ(t) by at most 1/k whenever t ≥ t k+1 , since any such t fits in one of the intervals t + 1, t +1 where ≥ k. Finally, we show that ψ(t) ≥ φ(t) for all but finitely many t, from which the claim follows by choosing the first few values of ψ suitably, and then increasing other values by a constant. Suppose then that k ≥ 2. On the interval t ∈ t k , t k+1 , ψ(t) is linearly interpolated between (t k , t k /(k − 1)) and (t k+1 , t k+1 /k). In particular the line between (t k , t k /k) and (t k+1 , t k+1 /k) is strictly below the graph of ψ. But t ∈ t k , t k+1 ⇒ φ(t) ≤ t/k, implying that (t, ψ(t)) is below the the point (t, t/k), thus below the graph of ψ.
With a slightly more careful construction, ψ could be made to have strictly nonincreasing first difference function (that is, such that the slopes of the linear pieces decrease from piece to piece), though we do not need this.
A function ψ : N → R is 2-nice if for all C ∈ N,ψ(t + C) ≤ 2ψ(t) for all but finitely many t.
Corollary 2. If φ : N → N is sublinear, then there is a sublinear nondecreasing 2-nice function ψ : N → N such that ψ(t) ≥ φ(t) for all t. Proof. Seeing φ as a function φ : N → R, the previous lemma gives us a sublinear increasing ψ : N → R with asymptotic slope zero. It is easy to see (by separate easy proofs in the bounded and in the unbounded case) that any nondecreasing function ψ : N → R with asymptotic slope zero is 2-nice. If ψ : N → R is increasing and 2-nice, then t → ψ(t) : N → N is nondecreasing and 2-nice as well, and it clearly majors ψ, thus φ.
Proof (of Theorem 5). By the previous corollary, we may assume that φ is sublinear and 2-nice.
Take the alphabet {0, 1, 2, 3, 4, 5} × {0, >, <}. The number {0, 1, 2, 3, 4, 5} is the mud state and < and > are called runners. We construct a cellular automaton f that preserves the number of runners in every configuration with the property that on every f -invariant subshift, the map h flipping left and right runners is a time-symmetry for f , assuming that two runners never meet (that is, no word in {<<, <>, ><, >>} appears in the configuration).
We only describe how the CA behaves when runners do not meet, as we will construct our subshift so that this does not happen. Our CA is composed of two CA, f = g 2 • g 1 . The CA g 1 moves every occurrence of < to the left and > to the right. The CA g 2 maps and the local rule is filled arbitrarily so that this is a symbol permutation. It is a good idea to think of a left-going runner < as already being on the left of the symbol, and > as being on the right. We use a shorthand notation reflecting this 4 , and write (a, 0) as simply a, (a, >) as a> and (a, <) as <a. We also write >w and w< when the mud state of the cell the runner is on is not important. Now, the idea is the following: We call a word w ∈ {0, 1} * a track if, when a runner > enters it from one side, it eventually goes out from the other side, leaving w in whatever state it was originally in, with the additional property that the number of times the mud state of a cell in w turns from zero 0 or 1 to a symbol in {2, 3, 4, 5} is odd. The first property means that there exists t such that for all a ∈ {0, 1, 2, 3, 4, 5} we have f t (>0 |w| , aw) = (0 |w| >, aw) and f t (0 |w| <, wa) = (<0 |w| , wa).
The importance of the second requirement will be clarified later. Note that on the first step, the runner is not yet on the support of the word, and on the last step, it is on the last symbol of the word w. To a track w, we associate its duration t(w) ∈ N, which is the least t with the property above.
We where we see that the word returned to its original state, and both 0 and 1 changed their state an odd number of times. Clearly the composition of two tracks is a track, and it is easy to show by induction that if w is a track, then 0w1 is a track as well, so we have a full Dyck language of tracks. One can check the formulas t(uv) = t(u) + t(v) and t(0w1) = 4 + 3t(w). For example t(001011) = 4 + 3t(0101) = 4 + 3(t(01) + t(01)) = 28.
Just for fun, let us show how the head moves through 001011, representing configurations top-down, then left to right. We have and one can check that the vector recording the number of times each symbol 0 or 1 was changed is the all-odd vector (1, 3, 3, 3, 3, 1). The right-to-left case is symmetric. Now fix w 0 = 01. Suppose w i has been defined and define w i+1 ∈ {0, 1} * as where k i+1 ∈ N. Then, writing j = |w j | for all j ∈ N, we have if k i+1 is large enough as a function of i (note that i ≥ 2). Then w i+1 is a track, and writing t j = t(w j ) for all j ∈ N, we have if k i+1 is large enough. (The exact formula is provided for completeness, but we only need t i+1 ≥ 3 ki+1 t i which obviously follows by induction from t(0w1) = 4 + 3t(w).) We pick k i+1 so that ψ( 1 2 t i+1 ) > 2 i+1 . This is possible because when k i+1 grows, i+1 grows at a linear rate, and t i+1 grows exponentially, while ψ is superlogarithmic. More precisely, since t i > 2 we have log 3 1 2 t i+1 ≥ k i+1 and i+1 ≤ 4k i+1 i . By the assumption on ψ, if n is large enough, we have ψ(n) > 8 i log 3 n, so in particular if k i+1 is large enough, we have We have obtained that t i grows very fast as a function of , as it must make the function ψ -which can be arbitrarily close to logarithmic -overtake . Reversing our point of view, we have achieved that i grows 'arbitrarily close to logarithmically' in t i .
It is easy to prove by induction that for every j < i, we have a decomposition w i = w j b 1 w j b 2 · · · b m w j for some m, where the b k are individual bits b k ∈ {0, 1}. Now, we construct our subshift X, which we call the mud run subshift. For each i ∈ N, pick q i ∈ N and k i ∈ N so that φ(q i t i ) < q i i (which is true for any large enough q i since φ is sublinear), and additionally so that 1 2 t ki < φ(q i t i ) ≤ t ki , using the fact that φ(n + t i ) ≤ 2φ(n) for all large enough n. (Note that, if we pick k i ≥ i + 1, the value of t ki is not determined by the values k 1 , . . . , k i , but rather values up to k ki , so it is easy to make sure that t ki is much larger than φ(q i t i ), and we can then increase q i to get φ(q i t i ) in the desired interval.) For each i, take the periodic points x i = (>w qi i ) Z . Then x i is a temporally periodic point for f , and the length of its f -orbit is q i t i , while the length of its σ-orbit is q i i . Let χ : {0, 1, 2, 3, 4, 5} × {0, <, >} → {0, 1, 2, 3, 4, 5} × {0} be the map that removes runners, and define the subshift Y as the closure of σ a (f b (x i )), σ a (f b (χ(x i ))) a ∈ Z,b ∈ Z,i ∈ N .
It is easy to see that f is still an automorphism of this limit subshift (since it has the same inverse), and that every point in Y that is not in the {σ, f }-orbits of x i has at most one runner (simply because i → ∞).
Finally, define X = Y × {0, 1} Z and modify the behavior of f so that it behaves as before on Y , but additionally flips the bit on the second track whenever it turns a symbol from 0 or 1 to another symbol on the Y -component. Then by the assumption that we originally made for tracks that 0 and 1 are changed to another symbol an odd number of times, we have that for all i ∈ N and z ∈ {0, 1} Z we have f qiti (x i , z) = (x i , z ) where z j = 1 − z j for all j ∈ Z.
We will now prove that the evolution of the neighborhoods of f on X has the properties we claim. More precisely, we pick a suitable sequence of times, n i = q i t i ∈ N, at which we look at the neighborhoods N (f ni ). We show that due to our choice of the q i , every interval in N (f ni ) is of size at least φ(n i ). The reason for this is that already on the periodic points x i generating X, we need neighborhoods of this size, since the runners move at a linear speed for a long