Topological properties of Lorenz maps derived from unimodal maps

A symmetric Lorenz map is obtain by ``flipping'' one of the two branches of a symmetric unimodal map. We use this to derive a Sharkovsky-like theorem for symmetric Lorenz maps, and also to find cases where the unimodal map restricted to the critical omega-limit set is conjugate to a Sturmian shift. This has connections with properties of unimodal inverse limit spaces embedded as attractors of some planar homeomorphisms.


Introduction
Topological properties of a continuous dynamical system are, in general, easier to understand than those of discontinuous systems. For example, for continuous functions of the real line there is the celebrated Sharkovsky Theorem [27], which says that if the map has a periodic point of prime period n, it also has a periodic point of prime period m for every m ≺ n in the Sharkovsky order 1 ≺ 2 ≺ 4 ≺ 8 ≺ · · · ≺ 4 · 7 ≺ 4 · 5 ≺ 4 · 3 · · · ≺ 2 · 7 ≺ 2 · 5 ≺ 2 · 3 · · · ≺ 7 ≺ 5 ≺ 3.
However, in general there is no analogue of the Sharkovsky theorem for discontinuous functions of the reals.
In this paper we study Lorenz maps, which are piecewise monotone interval maps with a single discontinuity point. Such Lorenz maps appear as Poincaré maps of geometric models of Lorenz attractors described independently by Guckenheimer [20], Williams [28] and Afraimovich, Bykov and Shil'nikov [1]. For the class of "old" maps (discontinuous degree one interval maps) which also include Lorenz maps, a characterisation of periodic orbit forcing was given by Alsedá, Llibre, Misurewicz and Tresser in [3]. Hofbauer in [22] obtained a result similar as in [3] using an oriented graph with infinitely many vertices whose closed paths represent the periodic orbits of the map except that he did not characterize completely the set of periodic points. In [2] the connection between β-expansions and Sharkovsky's ordering is given. Recently, Cosper [18] proved a direct analogue of Sharkovsky's theorem in special families of piecewise monotone maps (truncated tent map family).
In the present paper we combine some old and more recent results on the relation between unimodal and Lorenz maps, including a version of Sharkovsky's Theorem. The basic idea is to explore the relation between a unimodal map f and symmetric Lorenz maps ϕ and ψ obtained by "flipping the right branch" and "flipping the left branch" of the graph of f respectively, see Figure 1. For increasing Lorenz maps ϕ we prove in Theorem 1 that Sharkovsky's Theorem holds with the exception of the fixed points and for decreasing Lorenz maps ψ we prove in Theorem 2 that Sharkovsky's Theorem holds possibly except for periods 2 r , r ≥ 1.
We can turn ϕ into a proper circle endomorphism (with unique rotation number independent of x ∈ S 1 ) by setting (see also Figure 3): where a < c is such that ϕ(a) = ϕ(1), ϕ(x), otherwise.
In Proposition 2 we calculate the rotation number of the family of such maps, and prove that in the irrational rotation number case the restriction to omega limit set is a minimal homeomorphism. We use techniques developed primarily for unimodal interval maps.
Next, we also give an implementation of Sturmian shifts in interval maps. For every Sturmian shift we assign a unimodal map (basically a kneading sequence) so that the unimodal map restricted to its omega limit set is conjugate to that Sturmian shift.
Mapsφ, besides being interesting on their own, prove also to be very useful in surface dynamics. Namely, knowledge of their dynamics can be related to special orientation preserving planar embeddings of inverse limit spaces with bonding maps being f . In the last section of the paper we connect the mapφ to the study of unimodal inverse limit spaces represented as attractors of some planar homeomorphisms (this was initially done in [8] using a map conjugated toφ). In Theorem 3 we give a compete characterisation of accessible points of tent inverse limit spaces embedded in such a way. Then Corollary 1 gives a partial answer to Problem 1 in [4] by giving an example of tent inverse limit space which has uncountably many inhomogeneities with only countably infinitely many of them not being endpoints.

Preliminaries
Let I := [0, 1] be the unit interval, and f : I → I a symmetric unimodal map, i.e., given the involutionx = 1 − x, we assume that f (x) = f (x) for every x. This means that the critical point c = 1 2 , and by an appropriate scaling, we can assume that f (c) = 1. For example, f a (x) = 1 − a(x − 1 2 ) 2 with a ∈ (0, 4] is the logistic family in this scaling. We can turn f into an (increasing) symmetric Lorenz map ϕ : I → I by flipping the right half of the graph vertically around c = 1 2 , see Figure 1, giving the following result: The choice ϕ(c) = f (c) = 1 is arbitrary, only made to be definite.
We can also flip the left branch of f and obtain ψ :=φ which is called a decreasing symmetric Lorenz map. Then ψ(x) = ψ(x) for all x, and by induction if n is even.
Suppose then ψ n is continuous at x. Then (1) implies that ψ n (x) = f n (x) if and only if f n is decreasing at x and n is odd, f n is increasing at x and n is even, and ψ n (x) = f n (x) otherwise.

Sharkovsky's Theorem for Lorenz maps
We can describe the dynamics of f using the standard symbolic dynamics with the alphabet {0, * , 1}, where the symbols stand for the sets [0, c), {c} and (c, 1] respectively. It is also enough to restrict the study to the dynamical core [f (0), 1], since points from [0, f (0)) will be mapped to the core under f . The kneading invariant ν ∈ {0, * , 1} N is the itinerary of the point 1 = f (c). Since the itinerary map x → i(x) is monotone in the parity-lexicographical order on {0, * , 1} N , the kneading invariant is maximal admissible sequence, i.e., i(x) ≤ pl ν for all x ∈ I. Also, i(x) ≥ pl σ(ν) for all x ∈ [f (0), 1]. It can be shown that every itinerary for which every shift is in parity-lexicographical ordering between σ(ν) and ν can be realized by a point in the dynamical core (see e.g. [24]).
Also, if an m-periodic point y is closest to c from all the points in its orbit, and i(f (y)) = e 1 . . . e m , then σ n (e 1 . . . e m ) ≤ pl e 1 . . . e m for all n ≥ 1. As a corollary, e 1 . . . e m−1 e m (if admissible) is periodic of period k = m or k = m/2, which we prove in the rest of this paragraph. To prove that, assume that there is k ≥ 3 such that for j = m/k we can write e 1 . . . e m−1 e m = (e 1 . . . e j ) k . Then,since e 1 . . . e m is maximal among its shifts, e 1 . . . e j < pl e 1 . . . e j , and thus # 1 (e 1 . . . e j ) is odd. But then If f n is decreasing at x, then the statement holds for m = n as well.
Proof. By Sharkovsky's Theorem, f has at least one periodic orbit of period m. Take the m-periodic point y closest to c, so the itinerary e := i(f (y)) is maximal (w.r.t. the party-lexicographical order ≤ pl ) among all admissible m-periodic itineraries. Find e by setting e i = 1 − e i if e i = * and i = km, k ∈ N. Otherwise we set e i = e i . Let us first show that e is admissible. Let j ≥ 1 be the smallest integer such that e j = ν j . If j < m, then both e, e < pl ν. If m ≤ j and #{1 ≤ i ≤ m : e i = 1} is odd, then e < pl e < pl ν. The remaining case is #{1 ≤ i ≤ m : e i = 1} is even and m ≤ j. Assume that m = j. Thus e = ν 1 . . . ν m . To show that e = ν 1 . . . ν m is admissible, assume that e > pl ν. Since #{1 ≤ i ≤ m : ν i = 1} is odd, we have ν < pl σ m (e ) = e < pl σ m (ν), which contradicts shift-maximality of ν. Thus, e is admissible in this case. Also, e cannot be periodic of period m/2 since e 1 . . . e m−1 e m has an odd number of ones. It follows that e < pl e , which contradicts the assumption that e is the closest to ν among m-periodic itineraries, so this case is not possible. Assume that m < j. Then σ m (e) ≤ pl σ m (ν) but since the first symbol at which σ m (e) = e and σ m (ν) differ is j − m, the parity argument and m-periodicity of e imply that σ m (ν) > pl ν, which contradicts the shift-maximality of ν. So this case cannot occur either.
Moreover, we also conclude that f m is decreasing in y and increasing in y . From the discussion preceding the statement of the lemma, we conclude that the prime period of y is m or m/2.
If y has prime period m/2 = k, then e = e 1 . . . e k e 1 . . . e k−1 e k and e = e 1 . . . e k . Since σ k (e) < pl e, we conclude that #{1 ≤ i ≤ k : e i = 1} is odd, from which is follows that f k is decreasing in y .
For discontinuous interval maps, there are previous results regarding the forcing relation between periods, see e.g. [3] which however do not give the following result.
Theorem 1. Symmetric increasing Lorenz maps ϕ satisfy Sharkovsky's Theorem, except for the fixed points.
Proof. We start the proof for the symmetric Lorenz map ϕ with two claims.
(1) We first show that if ϕ has a periodic point of prime period n ≥ 1, then f also has a periodic point of prime period n, unless, possibly, n is a power of 2, and then f has a periodic point of prime period n or n 2 . Let ϕ n (x) = x and assume ϕ k (x) = x for all k < n. Then the same holds for x. At exactly one of x andx, say at x, f n is increasing, so f n (x) = x. Assume k < n is such that f k (x) = x and take the smallest such (so that x has prime period k). If k is not a power of two, then, since k divides n, Sharkovsky's Theorem gives the existence of a periodic point of prime period n as well. So we only have to consider the case that k = 2 r .
If f k is increasing at x, then ϕ k (x) = f k (x) = x, a contradiction. Thus f k must be decreasing at x. In that case f 2k is increasing at x, and thus ϕ 2k (x) = f 2k (x) = x, from which we conclude that n = 2k = 2 r+1 and x is a periodic point of f of prime period k = n 2 .
(2) Next we show that if m > 1 is such that f has an m-periodic point, then there exists an m-periodic point of ϕ.
The remaining case is when f m is decreasing at x. By Lemma 1 and its proof, we find a point x such that f m (x ) = x and f m is increasing at x . If m is indeed the prime period of x , then we can use the above argument to conclude that x is m-periodic point of ϕ. Otherwise, the prime period of x is m/2 and f m/2 is decreasing in x . But then ϕ m/2 (x ) = x and ϕ m (x ) = x , so x is periodic for ϕ with prime period m.
However, if m = 1, then e = 1, e = 0 and x lies in general outside the core (and in fact outside I), so it is lost in the construction of ϕ. Indeed, ϕ has a fixed point only if it comes from a "full" unimodal map f (i.e., a unimodal map that exhibits all possible itineraries of points, such as e.g. the quadratic Chebyshev polynomial f (x) = 4x(1 − x)).
To finish the proof, assume that ϕ has an n-periodic point. By the first part of the proof, there exists an n-periodic point for f (or possibly an n/2-periodic point if n is a power of 2). Sharkovsky's Theorem implies that f has an m-periodic point for every m ≺ n. The second part of the proof implies that there exists an m-periodic point of ϕ provided m = 1.
There are maps f with periodic points of period 2 r and no other periods. If r is maximal with this property, we say that f is of type 2 r . If f has periodic points of all periods of the form 2 r we say that f is of type 2 ∞ . The union of these two is called type 2 ∞ . If x is a 2 r -periodic point of a unimodal map f of type 2 ∞ , then we say that x has the pattern from the first period doubling cascade; itinerary of such point is the (shift of the) 2 r -periodic continuation of the Feigenbaum itinerary ν where the dots indicate the powers of 2.
Studying the decreasing symmetric Lorenz maps ψ we can obtain a theorem similar to Theorem 1.
Proof. The proof for a decreasing symmetric Lorenz map ψ is similar as for increasing Lorenz maps. We only need to repeat the two claims.
(1) Let ψ n (x) = x and assume ψ k (x) = x for all k < n. Then the same holds forx. For even n the proof is the same as for ϕ in Theorem 1, so assume that n is odd. At exactly one of x andx, say at x, f n is decreasing, so f n (x) = x. Assume k is a divisor of n is such that f k (x) = x. Then k and n/k are odd and f k is decreasing as well, so ψ k (x) = x, which is a contradiction. (2) Assume that f has a n-periodic point and take m ≺ n. (We note that the claim does not hold for m = n. Indeed, if n = m = 3 and the 3-periodic point is emerging in a saddle node bifurcation, then ψ does not yet have a 3-periodic point.) By Lemma 1, f has periodic points x of prime period m, and if m is not a power of two, then we can take x orientation preserving as well as orientation reversing. Assume that f k (x) = x for all proper divisors k of m.
• If m is odd, we take x orientation reversing, so that ψ m ( Therefore m is the prime period of x for ψ. • If m is even, we take x orientation preserving, so that ψ m (x) = x. Analogously as above we prove that m is the prime period of x for ψ.
This shows that ψ satisfies Sharkovsky's Theorem with the potential exception of periodic points in the first period doubling cascade. For instance, if f a (x) = 1 − a(x − 1 2 ) 2 with 4 > a > a Feig (where a Feig is the Feigenbaum parameter, then ψ does not have a point of prime period 2, despite the fact that it has periods n 2. More generally, if f a is r − 1 renormalisable of period 2 (so in contrast with Theorem 1 the final renormalisation has period 2 r−1 ), then ψ has no periodic point of period 2 r . The map ψ always has a fixed point, so we don't need to make exceptions for fixed points.

Cutting times
We recall some notation from Hofbauer towers and kneading maps that we use later in the paper; for more information on these topics, see e.g. [11,Chapter 6].
Recall that c denotes the critical point 1/2. For n ∈ N denote by c n := f n (c). We assume that c 2 < c (otherwise the dynamics of f is trivial).
Define inductively D 1 := [c, c 1 ], and We say that n is a cutting time if c ∈ D n . The cutting times are denoted by S 0 , S 1 , S 2 , . . . (where S 0 = 1 and S 1 = 2). They were introduced in the late 1970s by Hofbauer [21]. The difference between consecutive cutting times is again a cutting time (see e.g. Subsection 6.1 in [11]), so we can define the kneading map Q : We call f long-branched if lim inf n |D n | > 0, which is equivalent to lim inf k |D S k | > 0 and also to lim sup k Q(k) < ∞.
A purely symbolic way of obtaining the cutting times is the following. Recall that we use the itinerary map i for f (and also for ϕ) with codes 0 for [0, c) and 1 for (c, 1]. We will use the modified kneading sequence ν = lim x c i(x) = 10 · · · ∈ {0, 1} N , where we traditionally omit the zero-th symbol. Note that if c is not periodic, ν = i(c 1 ) and the modification is only made so that the itineraries do not contain symbol * (we take the smaller of the two sequences in parity-lexicographical ordering).
We can split any sequence e ∈ {0, 1} N into maximal pieces (up to the last symbol) that coincide with a prefix of ν. To this end, define That is, the function ρ depends on e and ν, but we will suppress this dependence. When we apply this for e = ν, we obtain or in other words S k = ρ k (1) for e = ν and k ≥ 0.
Define the closest precritical points ζ ∈ I as any point such that f n (ζ) = c for some n ≥ 1 and f k (x) = c for all k ≤ n and x ∈ (ζ, c). By symmetry, if ζ is a closest precritical point,ζ = 1 − ζ is also a closest precritical point. If ζ ∈ (ζ, c) is a closest precritical point of the lowest n > n, then the itineraries of f (c) and f (x), x ∈ (ζ ,ζ) coincide for exactly n − 2 entries, and differ at entry n − 1. Hence n is a cutting time, say n = S k for some k ≥ 1. We use the notation ζ = ζ k if n = S k . That is Applying this to x = f m (c), we obtain that ρ(m) − m is a cutting time. In particular, see Figure 2, and the larger Q(k), the closer f S k−1 (c) is to c.
Let κ = min{j > 1 : ν j = 1}. Then we can define the co-cutting times aŝ The cutting and co-cutting times are always disjoint sequences (see [13,Lemma 2]), and {Ŝ k } = ∅ if f is the full unimodal map (because then ν = 10000 . . . and κ is not defined). Furthermore, there is a co-kneading mapQ : it was shown that Q(k) → ∞ impliesQ(k) → ∞ and that c is persistently recurrent. This property was introduced by Blokh and implies minimality of ω(c), see [7] and also [14,Section 3].
In fact, lim sup k Q(k) = ∞ implies that lim sup kQ (k) = ∞, but not vice versa. If both lim sup k Q(k) < ∞ and lim sup kQ (k) < ∞, then c is non-recurrent, but as we will see in Section 6, there are maps where lim sup k Q(k) < lim sup kQ (k) = ∞.

Sturmian shifts
There are multiple ways of defining Sturmian shifts and we take the one using the symbolic dynamics of circle rotations.
x → x + α mod 1, be the rotation over an irrational angle α. Let β ∈ S 1 and build the itinerary u = (u n ) n≥0 by Then u is called a rotational sequence. The minimal (and uniquely ergodic) shift space obtained as X α = {σ n (u) : n ∈ N} is the Sturmian shift of frequency α, and each x ∈ X α is called a Sturmian sequence.
The purpose of this section is to describe cases when unimodal maps restricted to their critical omega-limit sets ω(c) are conjugate to Sturmian shift. There are in fact multiple ways of choosing the kneading map Q so that (ω(c), f ) is Sturmian. The simplest way is by means of the Ostrowski numeration, see [25]. Indeed, let α ∈ I be some irrational number and let p n /q n be the convergent of its continued fraction expansion. Thus q −1 = 0, q 0 = 1 and q n = a n q n−1 + q n−2 . Take k n = n j=0 a j and then cutting times as follows:      S k = k + 1 for 0 ≤ k ≤ a 1 , S kn = q n for n ≥ 1, S kn+a = aq n + q n−1 for 1 ≤ a ≤ a n , n ≥ 1.
To each x ∈ I we can assign a rotation number by first assigning a lift Φ : R → R to the Lorenz map ϕ: Then Φ(x) mod 1 = ϕ(x mod 1) and the rotation number is defined as Next we turn ϕ into a proper circle endomorphism (with unique rotation number independent of x ∈ S 1 ) by setting: where a < c is such that ϕ(a) = ϕ(1), ϕ(x), otherwise.
Also let b > c be such that ϕ(b) = a, see Figure 3.
The circle endomorphismφ obtained from ϕ was already studied in the last section of [12].  1] if no such k exists. In the latter case, the kneading map Q(j) ≤ 1 for all j ∈ N, and if α / ∈ Q, then f : ω(c) → ω(c) is a minimal homeomorphism.
If there is no such minimal n, i.e., ϕ n (1) / ∈ (b, b) for all n ≥ 1, then f n (1) / ∈ (b, b) for all n ≥ 1 (and in particular Q(j) ≤ 1) for all j ≥ 1. A counting argument similar to the above shows that α = lim sup k→∞ k/S k = lim k→∞ k/S k . It is possible that α is rational, e.g., for the logistic map f a (x) = 1 − a(x − 1 2 ) 2 with a = 3.5097. In this case, ν = (101) ∞ andφ i (1) converges to an attracting orbit of period 3. Also for the tent map √ 5} has period three and avoids [0, a].
If α / ∈ Q, then ωφ(c) is the Cantor set, disjoint from [0, a] and minimal w.r.t. the action ofφ. Under the semi-conjugacy f between f and ϕ (indeed f • f = f • ϕ), this projects to a minimal map f : ω f (c) → ω f (c). We will show that f : ω ϕ (c) → ω f (c) is in fact a homeomorphism, from which it follows that f : ω f (c) → ω f (c) is also a homeomorphism. Assume by contradiction that x < c <x are points in ω ϕ (c) such that f (x) = f (x) = y ∈ ω f (c). Then, since f is the semi-conjugacy between ϕ and f , we must have f (ϕ n (x)) = f (ϕ n (x)) = f n (y) for every n ∈ N. Note that ϕ n (x) = ϕ n (x) for every n ∈ N, and thus ϕ n (x) = ϕ n (x), unless ϕ n (x) = c, and thus f n (x) = c. Since c is not periodic, there exists N ∈ N such that ϕ n (x) = ϕ n (x) for all n ≥ N , and thus f n (y) has two f -preimages in ω ϕ (c). Since f : ω f (c) → ω f (c) is minimal, for every ε > 0 there exists infinitely many y ∈ orb f (y) which are ε-close to f 2 (c) = f (1). For sufficiently small ε, an f -preimage of a point ε-close to f (1) will be contained in [0, a]. Since every point in orb f (y) eventually has both f -preimages in ω ϕ (c), we conclude that We argued so far that there exist stunted Lorenz maps for which orbφ(c) is a Cantor set with dynamics similar to circle rotations (in fact to Denjoy circle maps) with irrational rotation number, and that there are also unimodal maps with kneading map bounded by 1, such that f | ω(c) is semi-conjugate to a circle rotation, and in fact, the rotation number is α = lim k→∞ k/S k . Therefore (ω(c), f ) represents a Sturmian shift.
In fact, every irrational rotation number (hence every Sturmian shift) can be realized this way, as we can prove by studying this rotation number closer. Indeed, let α = [0; a 1 , a 2 , a 3 , . . . ] be the continued fraction expansion of ρ, with convergents p i q i . For the irrational rotation R α , the denominators q i are the times of closest returns of any point x ∈ S 1 to itself, and these returns occur alternatingly on the left and on the right. If we assume that R q i α (x) is to the right of x, and set For the mapφ, the closest returns on the left indeed accumulate on c, but the right neighborhood [c, b) is the preimage of the plateau [0, a) and no further iterates of c enter that region. Instead, returns on the left accumulate on b.
Translating this back to the unimodal map f with kneading sequence ν = ν 1 ν 2 ν 3 . . . , the closest returns on the left correspond to closest returns at co-cutting times (recall that there are no cutting times S j so that f S j (c) ∈ (b, b)). If q i is such a co-cutting time, then (recalling the function ρ from (3) and using the above argument), the Farey convergents ρ a (q i ) = q i + aq i+1 are also the next co-cutting times for 1 ≤ a ≤ a i+1 , and in particular, ρ a i+1 (q i ) = q i+2 .
where dots indicate cutting times and primes co-cutting times. The bold symbols indicate the positions q i . In fact, for each i and therefore c has two limit itineraries lim x c i(x) = 0ν and lim x c i(x) = 1ν, but c has only one preimage in ω(c).
6. Outside maps and unimodal inverse limit spaces see Figure 4. Let us carry this out for the family of cores of tent maps T λ : I → I, for all λ ∈ (1, 2].
Then the map on R/Z and the outside map are conjugate with conjugacy G : But the conjugacy reverses orientation, so the rotation numbers are each others opposite, α forφ versus 1 − α for B. Figure 4. Constructing the outside and stunted Lorenz map for a tent map T λ .
Outside map B was used in [8] to give a complete description of the prime end and accessible points structure in unimodal inverse limits embedded in the plane as attractors of an orientation-preserving homeomorphism of the plane (or the two-dimensional sphere S 2 ).
In the rest of the section we restate some results from [8] and relate them to the established conjugacy between maps B andφ.
Recall that I denotes the unit interval [0, 1]. The inverse limit space with the bonding map g : I → I is a subspace of the Hilbert cube I N 0 defined by Equipped with the product topology, the space lim ← − (I, g) is a continuum, i.e., compact and connected metric space. Define the shift homeomorphism g : lim ← − (I, g) → lim ← − (I, g), There is a natural way to make lim ← − (I, g) an attractor of an orientation preserving sphere homeomorphism. Such embeddings are called Barge-Brown-Martin embeddings (abbreviated BBM embeddings), see [6] for the original construction, [9] for generalisation of the construction to parametrised families and [8] for the construction applied to unimodal inverse limits. As the outcome of the BBM embedding of lim ← − (I, g), one obtains an orientation-preserving homeomorphism H : S 2 → S 2 so that H| lim ← − (I,g) is topologically conjugate to g and for every x ∈ S 2 \ {point}, and ω(x, H) is contained in lim ← − (I, g).
In [8] the authors study in detail BBM embeddings of inverse limits of unimodal maps satisfying certain (mild) conditions, which are in particular satisfied for the tent map family T λ , λ ∈ ( √ 2, 2]. For simplicity we state the following results for tent maps only, noting that they can be generalized to a much wider class of unimodal maps. Fix the slope λ ∈ ( √ 2, 2] for the tent map T λ . Let B be the corresponding outside map. Denote by S = lim ← − {S 1 , B}. Theorem 4.28 from [8] shows that there is a natural homeomorphism h between S and the circle P of prime ends of lim ← − (I, T λ ). Then h conjugates the shift homeomorphism B of the outside map to the action of H on P , so that the prime end rotation number of lim ← − (I, T λ ) is equal to the rotation number (as defined in (9)) of B, see [8,Lemma 4.30]. Finally, Corollary 4.36 in [8] gives that the prime end rotation number of B is equal to the rotation number of B. Sinceφ and B are conjugate, the results above follow analogously and by Proposition 2 we obtain that the prime end rotation number of B equals 1 − α. Remark 1. In [8], the prime end rotation number is expressed in terms of the height q(ν) of the kneading sequence of a unimodal map f (see the definition of height in e.g. [8, Section 2.6]). Proposition 2 thus gives an algorithm to compute the height of the kneading sequence in the following way: find the smallest n ∈ N such that c n ∈ (1−b, b), and n is a cutting time n = S k . Then the height equals 1 − k/S k . If no such n exists, then the height equals 1 − lim k→∞ k/S k . Recall that b > c is such that f 2 (b) = f 2 (c), so the itinerary of b is i(b) = 11ν 3 ν 4 ν 5 . . ., see (11), where ν = i(f (c)) = 10ν 3 ν 4 ν 5 . . . is the kneading sequence. Hence, the previous condition can be expressed with symbols as 01ν 3 ν 4 ν 5 . . . ≺ ν n ν n+1 ν n+2 . . . ≺ 11ν 3 ν 4 ν 5 . . ., where ≺ denotes the parity-lexicographic ordering on symbolic sequences.
Furthermore, [8] gives the complete characterisation of accessible points the BBM embeddings of lim ← − (I, T λ ) using the outside map. We emphasize it here and connect it to the stunted Lorenz map ϕ.
Using the conjugacy of B andφ, we can state the previous theorem in terms ofφ directly. We parametrise the circle above as T : I → R 2 as T (t) = ( 1 2 + 1 2 cos(π + 2tπ), 1 2 sin(π + 2tπ)) and letδ = (T (0), T ( λ−1 λ )). The vertical projection onto a horizontal diameter is denoted by τ as above (that is actually τ • G, where G is the conjugacy betweenφ and B and it is equal to the vertical projection). In particular, such that y i ∈δ for all i > N and such that x N +j = τ (y N +j ) for all j ≥ 0.
We say that a point x = (x 0 , x 1 , . . .) ∈ lim ← − (I, T λ ) is a folding point if x n ∈ ω T λ (c) for every n ≥ 0. In the context of inverse limits on intervals this is equivalent to saying that x has no neighbourhood homeomorphic to the Cantor set times an open interval (see [26]). In the case when rotation number ofφ is irrational, Proposition 2 and its proof imply that f : ω ϕ (c) → ω T λ (c) is a homeomorphism (recall that orbits of c under ϕ andφ are the same when the corresponding height of the tent map is irrational). From that and Theorem 3 we have the following: and the rotation number ofφ is irrational (i.e., the height of the kneading sequence of T λ is irrational), then every folding point of lim ← − (I, T λ ) embedded in R 2 by the orientation-preserving BBM embedding is accessible.
Remark 2. Given a continuum X, we say that point x ∈ X is an endpoint if for every subcontinua A, B ⊂ X such that x ∈ A ∩ B, we have A ⊂ B or B ⊂ A. In [5] it was shown that if lim ← − (I, T λ ) is embedded in the plane by an orientation-preserving BBM embedding, and ifφ has irrational rotation number (i.e., the height of the kneading sequence of T λ is irrational), then all endpoints are accessible. Moreover, it was shown that there also exist countably many accessible non-end folding points. Corollary 1 1 in particular implies that there are uncountably many endpoints and only countably many non-end folding point in lim ← − (I, T λ ). This partially answers Problem 1 in [4].
Let us discuss the irrational rotation number case in more details. If 1 − α (and hence α) is irrational, then Proposition 2 gives that Q(j) ≤ 1 for all j, and T λ : ω(c) → ω(c) is a Cantor minimal homeomorphism conjugate to a Sturmian shift. This implies that H induces Denjoy-like dynamics on the corresponding circle of prime ends P . In [5], a detailed characterisation of accessible points for BBM embeddings of tent inverse limit spaces is given (there, also accessible endpoints and non-end folding points are distinguished), based solely on symbolic dynamics techniques from kneading theory. It follows (see [5,Theorem 11.20]) that there is a Cantor set C ⊂ P corresponding to accessible folding points in lim ← − (I, T λ ) uncountably many of which are endpoints and countably many are non-end folding points. Furthermore, all endpoints are accessible. The remaining countably infinitely many open arcs P \ C correspond to countably infinitely many open arcs in different arc-components of lim ← − (I, T λ ) (unions of all arcs containing some point from lim ← − (I, T λ )) that are accessible at more than one point. Thus this planar continua are interesting also from a topological perspective. A theorem of Mazurkiewicz [23] shows that for every indecomposable planar continuum there are at most countably infinitely many arc-components accessible at more than one point. Our examples confirm that it is possible to find planar continua indeed having countably infinitely many arc-components accessible at more than one point. Furthermore, T λ is long-branched since sup j Q(j) = 1. Therefore, all proper subcontinua of lim ← − (I, T λ ) are arcs (see e.g. [10, Proposition 3]). Thus, from the discussion in this section we have a complete understanding of topology of lim ← − (I, T λ ) as well as their orientation-preserving BBM planar embedding in the case when the rotation number ofφ is irrational (that is, the height of the kneading sequence of T λ is irrational).