Universal Systems for Entropy Intervals

A topological system is universal for a class of ergodic measure-theoretic systems if its simplex of invariant measures contains, up to an isomorphism, all elements of this class and no elements from outside the class. We construct universal systems for classes given by the combination of three properties: measure-theoretic entropy belonging to a nondegenerate interval of the extended nonnegative real halfline, invertibility and aperiodicity. For classes consisting of aperiodic systems the universal system can be made minimal.

algebra in Z completed with respect to ν, are measure-theoretically isomorphic. We will shortly pronounce the last condition as (Z , F) supports a measure isomorphic to μ. Notice that so understood universality is insensitive to whether the system has periodic points or carries measures of maximal entropy. Krieger Generator Theorem [6] is equivalent to saying that the full shift is universal. The notion has been studied in various contexts, in particular for toral automorphisms [7] or systems with specification [8].
We will adopt the following, slightly stronger and more precise, notion of universality: a system (Z , F) is said to be universal for a class H of ergodic endomorphisms (i.e., not necessarily invertible measure-theoretic dynamical systems understood modulo isomorphism) whenever three conditions hold: (1) For every system (X , F , μ, T ), where T : X → X is an ergodic endomorphism of a standard probability space (X , F , μ), belonging to the class H, (Z , F) supports a measure isomorphic to μ. (2) Conversely, for every ergodic F-invariant Borel probability measure ν on Z , the system (Z , B ν , ν, F) belongs to H. (3) If H consists exclusively of automorphisms, a universal system should be invertible (F should be a homeomorphism).
We are interested in the existence of universal systems for classes determined by inequalities imposed upon the Kolmogorov-Sinai entropy, invertibility and aperiodicity. And so, for an interval I ⊂ [0, ∞] (which can be closed or open on either side, and may but need not contain infinity), we define H e I as the class of all ergodic endomorphisms whose Kolmogorov-Sinai entropy is contained in the interval I . Also, we define H a I as the class of all ergodic automorphisms contained in H e I . Additionally, if 0 ∈ I we will distinguish the classesH e I andH a I consisting of aperiodic elements of H e I and H a I , respectively (if 0 / ∈ I , aperiodicity is obvious). The question is: which of the above classes possess a universal system, and which do not.
Universal systems for the classes H a [0,∞] (of all automorphisms) and H e [0,∞] (of all endomorphisms) are well known to exist-the full shift (bilateral or unilateral, respectively) with a Cantor alphabet is an obvious example. While universal systems for H a [0,C) and H e [0,C) (for any 0 < C ≤ ∞) can be easily created as countable unions of universal systems in the classical sense, the question for other types of entropy intervals remained, until recently, completely open. For closed entropy intervals [0, C], the requirement (2) makes the definition of universality much more demanding than the one considered earlier. In a recent paper of the second author [10] a somewhat surprising result has been proved: H a {0} does not admit a universal system (and an analogous result can be deduced for H e {0} ). We are not aware of any previous results concerning intervals not containing 0. In this paper we will fill in the missing cases by showing that in most situations the universal systems do exist. We leave open the cases of degenerate (one-point) intervals {c} where c = 0. For technical reasons we also leave out the noninvertible cases where I is bounded and does not contain 0, but we strongly believe that the universal systems can be created by the same methods as used for automorphisms once the necessary modifications are made in some of the classical results of Jewett-Krieger type.
Let us also mention results combining the notion of universality with minimality. Weiss constructed a minimal system universal in the class of all aperiodic automorphisms [12]. The first author of this paper extended this result in [1] to aperiodic endomorphisms (also obtaining a minimal universal system). There are also results by Shilon and Weiss [11] presenting minimal bilateral subshifts universal (in the classical sense) for the class of aperiodic automorphisms with entropy in [0, C), however these systems admit (inevitably, as they are subshifts) some exceptional measures with maximal entropy C . Since these measures do not  represent all ergodic systems with this entropy value, their examples are not universal (for  neitherH a [0,C) norH a [0,C] ) in our stronger understanding. We will address the possibility of creating minimal universal systems for the classesH a I andH e I in Sect. 6 (strengthening the results of [11]).

Topological Inverse Limits of Subshifts
Throughout this paper by a subshift we will mean any closed subset of a symbolic space S ( is a finite set called alphabet and S = Z or S = N 0 = {0, 1, 2, . . . }, depending on whether we discuss invertible or noninvertible case), invariant under the standard shift map (Sx)(i) = x(i +1) (x ∈ S ). Suppose we have a sequence of subshifts (X k , S k ) (k ≥ 1, each possibly on a different alphabet k ) such that for each k, (X k , S k ) is a topological factor of (X k+1 , S k+1 ). Let π k : X k+1 → X k be the corresponding factor map (recall that such map is always a block code with finite horizon).

Definition 2.1 The inverse limit
is defined as the set with T acting coordinatewise by the shifts S k .
The set X defined above is zero-dimensional, closed and T -invariant, hence (X, T ) is a zerodimensional topological dynamical system. Conversely, every zero-dimensional topological dynamical system (X, T ) is topologically conjugate to an inverse limit of unilateral subshifts (also bilateral, if T is invertible). Indeed. First notice that every clopen partition P of X determines a symbolic system formed by the (unilateral or bilateral, depending on the meaning of S) P-names of the points x ∈ X and it is easy to see that this subshift is a topological factor of (X, T ). We will call this factor the P-process. Now, let P 1 , P 2 , . . . be a sequence of clopen partitions of X such that P k+1 P k for each k ≥ 1 and diam(P k ) → 0, and let (X k , S k ) denote the P k -process. It is easy to see that for each k ≥ 1, (X k , S k ) is a topological factor of (X k+1 , S k+1 ) (via a one-block code, i.e., by a translation of single symbols). Since the partitions P k jointly separate points, it is clear that the corresponding inverse limit is topologically conjugate to (X, T ). Any zero-dimensional system (X, T ), as an inverse limit of subshifts (X k , S k ), has a convenient array representation, in which the elements of X are two-dimensional arrays x = [x(k, i)] k≥1,i∈S consisting of countably many rows, where the kth row x k is an infinite (unilateral or bilateral) sequence over some finite alphabet k . The rule behind the assignment is where λ → P λ is a bijective labeling of P k by k (in other words, the kth row is the P k -name of x). The map T acts on the arrays as the horizontal shift (T x)(k, i) = x(k, i + 1) for all k, i. From now on we will use the letter S (or S k ) to denote the shift in symbolic systems, while T (or T k , T , etc.) will be used for more general transformations including shifts on arrays.
We will exploit an inverse limit representation with special properties. 1 We formulate it for automorphisms. The noninvertible case will be discussed separately, see Remark 2.6.

Theorem 2.2 Fix an interval
Let (X 1 , S 1 ) be a strictly ergodic bilateral subshift which is a Jewett-Krieger model for the Bernoulli shift with entropy c (if c = 0 then we let (X 1 , S 1 ) be the trivial subshift over one symbol). Then, for every ergodic automorphism (X , F , μ, T ) with entropy h ∈ I , there exists an increasing sequence of strictly ergodic subshifts (X 1 , S 1 ) ← (X 2 , S 2 ) ← · · · (the first one being the selected Bernoulli model), each having entropy strictly smaller than C, and such that the inverse limit is a strictly ergodic model for (X , F , μ, T ).
The proof relies on the following construction, which we call a mix of two processes (in the definition and the following lemma we do not need to assume invertibility of T ):

Definition 2.3
Let (X , F , μ, T ) be a measure-theoretic dynamical system (endomorphism or automorphism). Let P and Q be two finite measurable partitions of X . Fix a coefficient 0 < p < 1. Choose a Rokhlin tower of height n and remainder of measure at most 1 n (we will say an "n-tower"). Denote by W the partition into two sets: the union P of the lower pn levels of the tower and its complement Q. Let R = MIX n ( pP + (1 − p)Q) be the partition refining W in the following way: on P we apply the (restriction of) partition P, on Q we apply the (restriction of) partition Q.
In terms of symbolic dynamics, the R-process can be imagined in as follows: each point x ∈ X has its (unilateral or bilateral, depending on the invertibility of T ) P-name, Q-name, and W-name. Then the R-name of x coincides with the P-name along these coordinates, where the W-name reads "P", otherwise (i.e., where the W-name reads "Q") it coincides with the Q-name. The first kind occurs in blocks of length precisely pn , alternated by blocks of the second kind, each having length at least n − pn (and, typically, not much longer).

Lemma 2.4
Let h 1 and h 2 denote the entropies of the P-process and Q-process, respectively. Fix a coefficient 0 < p < 1 and any δ > 0. Then, for n large enough (regardless of the particular choice of an n-tower), the entropy of the process generated by MIX n (( pP Proof The mixed process in the symbolic form corresponds to an invariant measure on S , where = 1 ∪ 2 , 1 is a labeling of P, 2 is a labeling of Q, and S = Z or N 0 . It is rather obvious, that with n → ∞, this measure approaches (in the weak-star topology) the convex combination pμ 1 + (1 − p)μ 2 , where μ 1 and μ 2 are the invariant measures corresponding to the symbolic representations of the processes generated by P and Q, respectively. Now the assertion follows from affinity and upper semicontinuity of the entropy function on invariant measures in symbolic systems.

Remark 2.5
More is true: the entropy of the process generated by MIX n ( pP + (1 − p)Q) converges (with n) to ph 1 + (1 − p)h 2 , but this fact will not be used (and its proof requires more tools).
Proof of Theorem 2.2 By the Sinai Theorem, the system (X , F , μ, T ) has the Bernoulli shift with entropy c (which, by the Ornstein Theorem, is unique) as a measure-theoretic factor. Using a theorem of Weiss [13,Theorem 3.14], we can find a strictly ergodic model (X , T ) of (X , F , μ, T ) which has the selected strictly ergodic model (X 1 , S 1 ) of the Bernoulli shift as a topological factor. Moreover, (X , T ) is zero-dimensional. Let P 1 be the partition of X by the cylinder sets corresponding to single symbols of the alphabet used in (X 1 , S 1 ). Next, let P 2 , P 3 , . . . be a sequence of clopen partitions of X such that P k+1 P k for each k ≥ 1 and diam(P k ) → 0. For each k, the P k -process is a symbolic topological factor of (X , T ); the first one is the Bernoulli model, the (k + 1)st process factors topologically onto the kth one, and the inverse limit equals (X , T ). If h < C, all these processes have entropies strictly smaller than C and the proof is finished at this point.
The nontrivial part of the proof concerns the case h = C. In order to unify the construction, if additionally c = 0 (and P 1 does not generate a nontrivial Bernoulli system), we temporarily shift the enumeration by letting P 0 be the trivial partition, while for P 1 we choose a clopen partition which generates a process (necessarily strictly ergodic) with positive entropy c < C (clearly, such a partition exists). At the end of the construction we will shift back the enumeration, to fit it to the formulation of the theorem.
We are going to create a sequence of clopen partitions R k of X , leading to the desired sequence of symbolic factors (X k , S k ). We begin by letting R 1 = P 1 .
Let p 1 , p 2 , . . . be a sequence of coefficients (strictly between 0 and 1), increasing to 1. We will be using Rokhlin n-towers as in Lemma 2.4, but they need to satisfy two additional requirements: (1) the towers must be measurable with respect to the factor generated by R 1 , (2) the levels of the towers (and hence the reminder) must be clopen.
The first condition can be easily satisfied by simply choosing the towers within the factor system (X 1 , S 1 ) (this is the reason why we could not accept this system to be trivial) and then lifting them to (X , T ). The second condition can be obtained by a standard three-step approximation, using regularity (we slightly shrink the levels to make them closed), continuity (we slightly enlarge the levels to make them open) and zero-dimensionality (we shrink the levels again to make them clopen). Of course, these modifications must be performed within the factor (X 1 , S 1 ), before lifting to (X , T ). The R 1 -process (equal to (X 1 , S 1 )) has entropy c (or c ) strictly smaller than C.
Step k+1 Suppose we have defined a clopen partition R k so that the R k -process (X k , S k ) has entropy strictly smaller than C. Because the weighted average with coefficients p k+1 and (1 − p k+1 ) of the entropies of the P k+1 -process and the R k -process is strictly smaller than C, using Lemma 2.4, we can create their mix R k+1 = MIX n k+1 ( p k+1 P k+1 + (1 − p k+1 )R k ), with n k+1 large enough so that the mixed process has entropy strictly smaller than C.
It is obvious that since for large k the coefficient p k+1 is close to 1, the partition R k+1 is a good approximation of P k+1 (in the sense of measure). This implies that the inverse limit (X, T ) of the R k -processes is measure-theoretically isomorphic to the inverse limit of the P k -processes, while the latter equals (X , T ) and is a model for (X , F , μ, T ). The only remaining difficulty is to verify that the R k -process is a topological factor of the R k+1process, for each k ≥ 1.
If we agree that each partition P k is labeled by an alphabet k (these alphabets being pairwise disjoint), then the R k -names contain symbols from all alphabets 1 through k . In the (k + 1)st step some of these symbols are replaced by the "refined" symbols from k+1 (recall that P k+1 is finer than each of P 1 through P k ). In order to reconstruct the R k -name (of some point x) from its R k+1 -name, we need to find all symbols from k+1 and replace them by the corresponding "cruder" symbols from the alphabets 1 through k . Here, at every such place (say, at coordinate i in the name of x) we need to decide which of these k alphabets should be used. For that we need to know the position of T i x with respect to all the towers used in steps 1, . . . , k. This can be determined as follows: at first we replace all symbols in the R k+1 -name by the "crudest" symbols from 1 . In this manner we reconstruct the R 1 -name of x. Now, since all the towers are clopen and measurable with respect to the R 1 -process, the position of T i x with respect to these towers can be decided in a continuous (i.e., with finite coding horizon) procedure. The proof is now complete.
Remark 2. 6 We believe that Theorem 2.2 holds also for noninvertible systems (X , F , μ, T ) with (X 1 , S 1 ) being a strictly ergodic model of a one-sided Bernoulli shift with entropy c. There are, however, three problems, of which only one we know how to resolve. Of course, none of them appears in case c = 0, and Theorem 2.2 holds in this case also for endomorphisms, with (X 1 , S 1 ) being the trivial unilateral subshift over one symbol. The three problems are: (1) Sinai's theorem for endomorphisms (X , F , μ, T ) does hold (the original proof works) and it produces some unilateral Bernoulli shift with entropy c as a factor. However, since the Ornstein Theorem is known to fail for unilateral Bernoulli shifts, the above factor may depend on (X , F , μ, T ). If c > log 2 then all Bernoulli shifts with entropy c are weakly isomorphic (each of them requires at least 3 symbols and a theorem of del Junco [4, Theorem 1] applies), which enables us to pick any one of them to create (X 1 , S 1 ). But if c ≤ log 2, it may happen that for endomorphisms in some subclass (of the class with entropies in I ) the Bernoulli factor with entropy c requires two symbols, while in the remaining subclass-three or more. It is unknown whether there is a factor relation (in any direction) between these two kinds of Bernoulli shifts, so we cannot choose one Bernoulli shift good (as a factor) for the entire class. We solve this problem by creating two "quasi universal" systems: one based on the Bernoulli shift on two symbols (it is unique, for fixed entropy), and another, based on a Bernoulli shift on three symbols (these are weakly isomorphic, so any of them can serve). In the end, the union of the two "quasi universal" systems will be universal. (2) An analog of the Jewett-Krieger Theorem for noninvertible systems has been proved by Rosenthal ([9], the same result follows also from [2]), but it cannot be hoped that, in case of finite entropy, the strictly ergodic model can always be chosen a unilateral subshift. Such a subshift obviously admits a finite forward generator, while not every endomorphism does. On the other hand, any unilateral Bernoulli shift by definition admits a finite forward generator, so one can hope that a strictly ergodic unilateral subshift model (X 1 , S 1 ) exists. But this is not clear at all. (3) We have not been able to find a noninvertible version of Weiss' theorem, which is needed to define (X , T ). We strongly believe that the necessary modification is possible, but the task requires extensive work, not fitting in the frames of this exposition. Proof We fix a strictly ergodic subshift (X 1 , S 1 ) which is a model of the Bernoulli shift with entropy c (if c = 0 this is a trivial subshift over a one-element alphabet) and we let 1 denote the alphabet used in X 1 . For l ≥ 2 let l = {0, 1, . . . , l − 1}. We define Y = X 1 × l≥2 S l , where S = Z or N 0 , depending on invertibility (recall that the noninvertible case is handled only for trivial (X 1 , S 1 )). So defined Y is a collection of matrices y = [y(l, n)] l≥1,n∈S consisting of countably many rows, where the lth row y l is an infinite (bilateral or unilateral) sequence over l . We act on elements y by the left shift T , i.e. T y = y where y (l, n) = y(l, n + 1) for all l, n.

Universal Systems for Closed Entropy Intervals
An l-rectangle is a finite matrix of size l × 2 l , such that in row i it contains elements of 1, 2, . . . , l). We say that an l-rectangle R occurs in y ∈ Y if R = [y(i, j) : i = 1, 2, . . . , l, j = n, n + 1, . . . , n + 2 l − 1] for some n ∈ S. If B is a block of length 2 l over the alphabet 1 (we will write B ∈ 2 l 1 ), then by Rec l,B (y) we denote the collection of all l-rectangles occurring in y and having the block B in the first row (if B does not occur in X 1 , this collection is empty for all y ∈ Y ).
We define Z as a subset of Y consisting of elements y satisfying, for all l ≥ 2 and any B ∈ 2 l 1 , the inequality #Rec l,B (y) ≤ exp(2 l (C − c)).
It is obvious that Z is a closed and T -invariant subset of Y . Let F denote the restriction of T to Z . We will show that (Z , F) is a universal system in question.
For l ≥ 1, we denote by (Z l , F l ) the topological (symbolic) factor of (Z , F) obtained by the restriction to the first l rows (in particular, (Z 1 , F 1 ) = (X 1 , S 1 )). Let Q l denote the clopen partition of Z (and, in fact of Z l ) defined by fixing the entries y(1, 0), y(2, 0), . . . , y(l, 0). Then {Q l } is a refining sequence of partitions in Z and the Q l -process coincides with (Z l , F l ). Note that 2 l −1 n=0 F −n l Q l partitions Z into cylinder sets corresponding precisely to the lrectangles. Consider an ergodic measure ν supported by Z . Let y ∈ Z be a point generic for ν and let ν l denote the image of ν by projection onto Z l . Then by well known facts on entropy and by (3.1), for any l ≥ 2 we have The entropy of ν, which equals is hence contained between c and C. In this way, Z satisfies the second postulate for being universal in the class H aa I (or H e I ). It remains to show that every ergodic measure-theoretic system (X , F , μ, T ) satisfying h μ (T ) ∈ I is isomorphic to an ergodic F-invariant measure ν supported by Z . By Theorem 2.2, there exists a strictly ergodic zero-dimensional model (X, T ) of (X , F , μ, T ), which is an inverse limit of uniquely ergodic symbolic factors (X k , T k ), each of entropy strictly smaller than C and with (X 1 , S 1 ) equal to the system appearing as the first row factor of (Z , F). Let R k be a clopen partition of X which generates the factor (X k , T k ). Replacing, if necessary R k by k i=1 R i , we can assume that R k+1 R k for every k ≥ 1. Let r k be the cardinality of R k . Of course, we can injectively label R k with the alphabet l (perhaps not using all symbols) for any l ≥ r k . Since h top (T k ) < C, applying the variational principle for topological entropy (see [3,Theorem 6.8.8]) and strict ergodicity, we get h top (T k |X 1 ) < C − c. Next, by subadditivity of topological conditional entropy for open covers, there exists a positive integer m k such that for any m ≥ m k . Let l 1 = 1 and then put inductively l k+1 = max{r k+1 , m k+1 , l k + 1} for all k ≥ 1. In this manner we guarantee three properties: • the sequence {l k } k≥1 starts with 1 and strictly increases, • for each k ≥ 1 the partition R k can be labeled using the alphabet l k , • we have the inequality (3.2) for l k in place of m. Now we can produce a special, topologically conjugate, array representation of (X, T ), by placing each symbolic factor (X k , T k ) in row number l k (instead of in row k) and filling all other (unused) rows by zeros. From now on, (X, T ) will denote this representation. We will argue that so understood (X, T ) is a subsystem of (Z , F). Indeed, the alphabet used in the lth row of (X, T ) is contained in l , for every l ≥ 1. Further, notice that since R k refines all R i with i ≤ k and the added rows are filled with zeros, we can easily estimate the cardinality of l-rectangles appearing in X with a fixed block B in the first row (this will of course estimate the number of such l-rectangles appearing in each individual element of X ), as follows.
If l = l k for some k ≥ 2, this cardinality equals that of hence does not exceed exp(2 l k (C − c)), as required.
For l not of the form l k , we let k be the largest index with l k < l. Since all rows numbered l k + 1, l k + 2, . . . , l are filled with zeros, the cardinality of l-rectangles with a fixed first row B equals that of which, by submultiplicativity, does not exceed . . B 2 l−l k is the partition of B into 2 l−l k blocks of equal lengths 2 l k . Since, by (3.2) (applied to m = l k ), each of the multipliers does not exceed exp(2 l k (C −c)), the total cardinality in question is bounded by exp (2 l (C − c)). We have proved that X is contained in Z , hence the (unique) ergodic measure (call it ν) supported by X is in fact supported by Z , and it is isomorphic to the initially selected measure μ. This ends the proof of the first postulate of universality of (Z , F), and hence the entire proof. (with n > 1 C ) in case C < ∞, or just H aa [0,n] in case C = ∞ obtained in Theorem 3.1, and then arrange (in some larger space) a disjoint union over increasing n of copies of such systems shrinking in diameter and accumulating at a fixpoint. The same proof works in the noninvertible case.

Universal Systems for Open Entropy Intervals
We pass to H aa (c,C) . First, we will need a special topological (invertible) system (X 1 , T 1 ). It should have countably many ergodic measures ν n . We need all these measures to be Bernoulli with entropies smaller than c+C 2 . The entropies of these measures should strictly decrease in n and converge to c, while the measures themselves should converge (in the weak-star topology) to ν 1 (which has the largest entropy in the sequence). The existence of such a system (on the Cantor set) follows from [5], as well as from [2, Corollary 5.2] (also in the noninvertible case).
Next, we let (X 2 , T 2 ) be the universal system for H aa [0,C−h(ν 1 )) and we define (Z , F) as the direct product (X 1 × X 2 , T 1 × T 2 ). We will argue that this is the desired universal system.
Clearly, any invariant measure on (Z , F) has entropy strictly between c and C. On the other hand, any system (X , F , μ, T ) with entropy h in this range has a (measure-theoretic) Bernoulli factor isomorphic to some ν n (we choose n to be the smallest index with h > h(ν n )) and then it is a joining of ν n with an automorphism of entropy h − h(ν n ) + , where is arbitrarily small ( -independent completion; see e.g. [3,Corollary 4.4.8]). If n = 1 then h − h(ν 1 ) + can be made smaller than C − h(ν 1 ), and thus the -independent completion is represented by an invariant measure ν on X 2 . The product system (Z , F) supports all joinings of ν 1 with ν , in particular the one isomorphic to μ. If n > 1 then the difference h − h(ν n ) does not exceed h(ν 1 ) − c, which is smaller than C − h(ν 1 ), so h − h(ν n ) + can be made smaller than C − h(ν 1 ) and the rest of the argument applies just as for n = 1.
In case of endomorphisms, the systems (X 1 , T 1 ) and (X 2 , T 2 ) can be constructed, using the same tools, with the measures ν n representing unilateral Bernoulli shifts. It is true that if an endomorphism (X , F , μ, T ) has entropy h ∈ I then it has one of the Bernoulli measures ν n as a measure-theoretic factor (the inequality between h and entropy of ν n is sharp hence we can apply Sinai Theorem combined with [4, Theorem 2]). The weak spot is the existence of an -independent completion. It is known that [3, Corollary 4.4.8] fails for endomorphisms (see [3,Remark 4.4.9]). Thus, we can safely conduct the proof only if C = ∞ because then on (X 2 , T 2 ) we can find a measure ν isomorphic to μ and on (Z , F) use the "factor joining" supported by the graph of the measure-theoretic factor map from ν to ν n , which is also isomorphic to μ. all rows) the marker processes have the joint entropy strictly smaller than C, as required. We have shown that (Z ,F) is universal for the class in question. Once this is established, we can pass to creating minimal universal models. This is immediate (modulo appropriate tools). The universal system, (Z , F) or (Z ,F), for a class consisting of aperiodic measures (as listed in the formulation of the theorem) is zero-dimensional and obviously aperiodic. Then [1, Theorem 1] provides a zero-dimensional minimal system with exactly the same simplex of invariant measures. Clearly, this minimal system is universal for the same class.

All Nondegenerate Intervals
Remark 6.2 The above theorem strengthens the result from [11] in two ways: it applies to endomorphism as well as automorphisms, and produces universal systems in our stronger understanding. In one aspect it is weaker: our universal system is not a subshift.

Open Questions
Let us gather the unsolved cases. We begin with the one for which we strongly believe that the answer is positive: For the next question we are inclined toward the negative answer (by similarity to the case with c = 0), but not enough to conjecture: The type of intervals (the upper end finite and closed) does not immediately exclude such a possibility but our methods inevitably lead to nonexpansive zero-dimensional systems. If the answer was positive then we could apply the "faces technique" of [2] to answer positively Question 7.2.