This paper characterizes the prime ends of natural extensions of unimodal maps with high entropy and constructs sphere homeomorphisms that serve as virtually sphere homeomorphisms for these extensions, especially for tent maps.
Contribution
It provides a complete description of prime ends for natural extensions of unimodal maps and constructs associated sphere homeomorphisms, including generalized pseudo-Anosov maps for post-critically finite cases.
Findings
01
Prime ends of Barge-Martin embeddings are fully described.
02
Constructed sphere homeomorphisms are factors of natural extensions with controlled fibers.
03
Identified generalized pseudo-Anosov maps for dense parameter sets in tent maps.
Abstract
Let {ft:I→I} be a family of unimodal maps with topological entropies h(ft)>21log2, and ft:It→It be their natural extensions, where It=lim(I,ft). Subject to some regularity conditions, which are satisfied by tent maps and quadratic maps, we give a complete description of the prime ends of the Barge-Martin embeddings of It into the sphere. We also construct a family {χt:S2→S2} of sphere homeomorphisms with the property that each χt is a factor of ft, by a semi-conjugacy for which all fibers except one contain at most three points, and for which the exceptional fiber carries no topological entropy: that is, unimodal natural extensions are virtually sphere homeomorphisms. In the case where {ft} is the tent family, we show that χt…
ft(x)=tx(1−x)(0<t≤4) and ft(x)=tmin{x,1−x}(0<t≤2).
ft(x)=tx(1−x)(0<t≤4) and ft(x)=tmin{x,1−x}(0<t≤2).
[a,b]p↓⏐[0,1]fft[a,b]↓⏐p[0,1]
[a,b]p↓⏐[0,1]fft[a,b]↓⏐p[0,1]
X:=lim(X,f)={x∈XN:f(xi+1)=xi for all i∈N}.
X:=lim(X,f)={x∈XN:f(xi+1)=xi for all i∈N}.
d(x,y)=i=0∑∞2id(xi,yi).
d(x,y)=i=0∑∞2id(xi,yi).
f(⟨x0,x1,x2,…⟩)=⟨f(x0),x0,x1,x2,…⟩.
f(⟨x0,x1,x2,…⟩)=⟨f(x0),x0,x1,x2,…⟩.
I(P)=k≥0⋂U(ξk),
I(P)=k≥0⋂U(ξk),
∅=Π(P)⊆I(P)⊆X.
∅=Π(P)⊆I(P)⊆X.
μr=0
μr=0
μr=1
μ≺ν⟺i=0∑rμi is even.
μ≺ν⟺i=0∑rμi is even.
Υ(y,s)={(y,2s)(y,1) if s∈[0,1/2], if s∈[1/2,1].
Υ(y,s)={(y,2s)(y,1) if s∈[0,1/2], if s∈[1/2,1].
I=lim(I,H)=lim(I,f),
I=lim(I,H)=lim(I,f),
cq=10κ1(q)110κ2(q)11…110κm(q)1.
cq=10κ1(q)110κ2(q)11…110κm(q)1.
κi(q)={⌊1/q⌋−1⌊i/q⌋−⌊(i−1)/q⌋−2 if i=1, and if 2≤i≤m,
κi(q)={⌊1/q⌋−1⌊i/q⌋−⌊(i−1)/q⌋−2 if i=1, and if 2≤i≤m,
q(μ)=inf({q∈(0,1/2]∩Q:(cq0)∞≺μ}∪{1/2}).
q(μ)=inf({q∈(0,1/2]∩Q:(cq0)∞≺μ}∪{1/2}).
μ=10κ1(q)110κ2(q)110κ3(q)11….
μ=10κ1(q)110κ2(q)110κ3(q)11….
(wq1)∞⪯μ⪯10(wq1)∞.
(wq1)∞⪯μ⪯10(wq1)∞.
\begin{array}[]{rcll}B(x_{\ell})&=&f(x)_{\ell}&\text{ if }x\in[a,c]\\
B(x_{\ell})&=&f(x)_{u}&\text{ if }x\in[c,b]\\
B(x_{u})&=&f(x)_{\ell}&\text{ if }x\in[\alpha,b],\text{ and}\\
B(x_{u})&=&f(a)_{\ell}&\text{ for all }x\in[a,\alpha].\end{array}
\begin{array}[]{rcll}B(x_{\ell})&=&f(x)_{\ell}&\text{ if }x\in[a,c]\\
B(x_{\ell})&=&f(x)_{u}&\text{ if }x\in[c,b]\\
B(x_{u})&=&f(x)_{\ell}&\text{ if }x\in[\alpha,b],\text{ and}\\
B(x_{u})&=&f(a)_{\ell}&\text{ for all }x\in[a,\alpha].\end{array}
τ∘B(y)=f∘τ(y) for all y∈S∖\accentset∘γ,
τ∘B(y)=f∘τ(y) for all y∈S∖\accentset∘γ,
ϕ(s)=f(a)+(2s−1)(b−f(a))
ϕ(s)=f(a)+(2s−1)(b−f(a))
f(y,s)={(ϕ(s)ℓ,s)(f(τ(y))ℓ,s) if s∈[1/2,ϕ−1(f(τ(y)))], if s∈[ϕ−1(f(τ(y))),1].
f(y,s)={(ϕ(s)ℓ,s)(f(τ(y))ℓ,s) if s∈[1/2,ϕ−1(f(τ(y)))], if s∈[ϕ−1(f(τ(y))),1].
f(y,s)={(ϕ(s)ℓ,s)(f(τ(y))ℓ,ϕ−1(f(τ(y))) if s∈[1/2,ϕ−1(f(τ(y)))], if s∈[ϕ−1(f(τ(y))),1].
f(y,s)={(ϕ(s)ℓ,s)(f(τ(y))ℓ,ϕ−1(f(τ(y))) if s∈[1/2,ϕ−1(f(τ(y)))], if s∈[ϕ−1(f(τ(y))),1].
f(y,s)={(B(y),s)(B(y),ϕ−1(τ(B(y)))) if s∈[1/2,ϕ−1(τ(B(y)))], if s∈[ϕ−1(τ(B(y))),1].
f(y,s)={(B(y),s)(B(y),ϕ−1(τ(B(y)))) if s∈[1/2,ϕ−1(τ(B(y)))], if s∈[ϕ−1(τ(B(y))),1].
Ψ(y,s)={T(y,s)T(B−t(y),v,t−1), if s∈(0,1), where (t,v)=P(s), if s≥1.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Natural extensions of unimodal maps: virtual
sphere homeomorphisms and prime ends of basin boundaries.
Let {ft:I→I} be a family of unimodal maps with topological
entropies h(ft)>21log2, and ft:It→It be their
natural extensions, where It=lim(I,ft). Subject to some regularity
conditions, which are satisfied by tent maps and quadratic maps, we give a
complete description of the prime ends of the Barge-Martin embeddings of
It into the sphere. We also construct a family {χt:S2→S2} of sphere homeomorphisms with the property that each χt is a
factor of ft, by a semi-conjugacy for which all fibers except one
contain at most three points, and for which the exceptional fiber carries no
topological entropy: that is, unimodal natural extensions are virtually
sphere homeomorphisms. In the case where {ft} is the tent family, we
show that χt is a generalized pseudo-Anosov map for the dense
set of parameters for which ft is post-critically finite, so that
{χt} is the completion of the unimodal generalized pseudo-Anosov
family introduced in [21].
1. Introduction
1.1. Overview
The study of continua and their rich topological structures goes back to the
first half of the 20th century, and played a central rôle in the
early development of topology. Embeddings of continua in surfaces have also
been an important ingredient in dynamical systems theory: early examples
include Birkhoff’s remarkable curves [11, 29] and the
Cartwright-Littlewood Theorem [19]. Williams [40, 41] was
the first to notice, in the late 1960s, that continua defined by inverse limits
are a useful tool in the study of dynamical systems: specially relevant here is
his discovery that a particular class of planar continua, the inverse limits of
expanding maps on graphs, describe planar, one-dimensional hyperbolic
attractors. In the early 1990s — inspired in part by the importance of the
Hénon family as a paradigm for the larger family of non-hyperbolic
attractors — Barge and Martin [10, 14] gave a method to
embed a wide class of inverse limits as attractors of planar homeomorphisms.
The inverse limits of unimodal maps of the interval such as those from the
quadratic and tent families are of particular importance for the Hénon
family. These inverse limits are the chief objects of study here. A simple
example is shown in Figure 1 for expository purposes: it will
be used as a point of reference throughout the introduction.
The prime ends of the complementary domains form an essential part of the
analysis of planar continua: in dynamical systems, they have been used in the
description of basin boundaries [2, 33] and, in the wider context
of holomorphic dynamics, prime ends of the complements of Julia
sets [12, 20, 28, 38] have also been studied. In this paper we give a
complete description of the prime ends of the complementary domains of the
Barge-Martin embeddings of the inverse limits of families of unimodal maps. We
believe that this constitutes the first complete analysis in the literature of
the nature of the embeddings of a continuously varying family of planar
attractors. (In subsequent work using more symbolic techniques, Anušić
and Činč [5] reproduce most of the results here about the prime
ends of Barge-Martin embeddings in the specific case of tent map inverse
limits, and enhance our results in this case with additional topological
information concerning folding points and endpoints.)
The topology of unimodal inverse limits is exquisitely complicated. For the
tent family {ft}, results of Bruin and of Raines [18, 37] imply
that, when the parameter t is such that the critical orbit of ft is dense
(a full measure, dense Gδ set of parameters), the inverse
limit It is nowhere locally the product of a Cantor set and an interval,
and is therefore much more complicated than the example of
Figure 1. A striking statement of self-similarity is given by
Barge, Brucks and Diamond [7], who show that there is a
dense Gδ set of parameters t for which every open subset of It
contains a homeomorphic copy of Is for everys∈[2,2].
Moreover, the Ingram conjecture posits that the inverse limits It are
pairwise non-homeomorphic. This has been proved for non-core tent maps by
Barge, Bruin, and Štimac [8], while for core tent maps there are
known to be uncountably many homeomorphism classes (see for
example [4, 25]).
In the second part of the paper, we show that all of these inverse limit spaces
are virtually spheres: there are quotients pt:It→S2 which
respect the natural extensions ft:It→It, and have the
property that, with the exception of at most one x∈S2, the fiber
pt−1(x) contains at most three points: moreover, the exceptional fiber
carries no topological entropy. There is therefore a family {χt} of
sphere homeomorphisms — which is shown to vary continuously — such that
[TABLE]
commutes (here π0:It→I is projection onto the first
coordinate). In view of the mildness of the semi-conjugacies pt, this
suggests that the sphere is a natural space on which to study invertible
analogs of unimodal maps.
The sphere homeomorphisms χt are best seen as generalizations of
Thurston’s pseudo-Anosov maps [39]. A pseudo-Anosov
homeomorphism ϕ of a surface has a transverse pair of invariant singular
foliations, one stable and one unstable, which fill the surface. Collapsing the
stable foliation yields a graph, the train track, which carries an
expanding map. Following Williams, the inverse limit of the train track map
yields a homeomorphism Φ with a one-dimensional hyperbolic attractor. This
homeomorphism can alternatively be obtained by “DA-ing” the prongs of the
pseudo-Anosov foliations, i.e., splitting open the leaves ending at the pronged
singularities. The original pseudo-Anosov map ϕ can be reconstructed
from Φ by “collapsing” stable sets in the complement of the attractor.
The process used to construct the sphere homeomorphisms χt formalizes and
generalizes this last collapse: we start with the Barge-Martin embedding of the
inverse limit of a unimodal map ft as an attactor, and collapse
strongly stable sets (see Definition 5.1) to obtain
χt. In Figure 1 the semi-circular arcs represent
identifications, and are not part of the inverse limit, which consists only of
the horizontal arcs. With this in mind, the quotient can be seen — although
not quite accurately — as being obtained by collapsing, in each vertical
line, the closure of the segments in the complement of the attractor, and then
sewing up the outside in a dynamically coherent way. Because the inverse limit
of a general unimodal map can be much more complicated than that of a train
track map, the dynamics and invariant geometric structures of χt are
correspondingly more complicated. In particular, the invariant stable and
unstable “foliations” are only defined in a measurable sense.
In the case where {ft} is the tent family, the corresponding
family {χt} is a completion of the family of generalized
pseudo-Anosov maps which was constructed in [21] for post-critically
finite tent maps. (A generalized pseudo-Anosov is defined similarly to a
pseudo-Anosov, except that its invariant foliations can have infinitely many
singularities, provided they accumulate on only finitely many points: see
Definition 5.27.) The earlier construction was explicit, and made
essential use of the existence of finite Markov partitions. The constructions
of this paper show not only how generalized pseudo-Anosovs arise directly from
inverse limits and natural extensions — with the leaves of the unstable
foliation of χt coming from the path components of the inverse limit
of ft — but also how they live within the richer class of homeomorphisms
which arise in the post-critically infinite case. These measurable
pseudo-Anosov homeomorphisms, whose invariant foliations are only defined on a
full measure subset of the sphere, are the subject of articles in preparation.
For the countable set of *NBT *parameters introduced in [26], the map
χt is an actual pseudo-Anosov homeomorphism. Thus the analysis of the
family χt also contributes to the question of the completion in the
C0-topology of the set of all pseudo-Anosov homeomorphisms on a given
surface.
1.2. Background
We now proceed to a brief overview of some background theory in dynamics and
topology, which will enable us to give more precise statements of our main
results in Sections 1.3 and 1.4
below.
1.2.1. Unimodal maps
The study of unimodal maps of the interval, one of the simplest classes of
dynamical systems which exhibit complicated behavior, drove the development of
the theory of topological dynamical systems in the 1970s and beyond. A
continuous map f:[a,b]→[a,b] is said to be (non-core) unimodal
if
(a)
f(a)=f(b)=a, and
2. (b)
there is a turning point c∈(a,b) such that f is strictly
increasing on [a,c] and strictly decreasing on [c,b]. Moreover f(x)>x
for x∈(a,c].
The qualification non-core is important here: we will shortly replace
condition (a) with an alternative version which corresponds to restricting the
domain to an invariant sub-interval (the core) in which all of the
non-trivial dynamics is contained.
Prototypical examples of families of unimodal maps are the quadratic
(also known as logistic) and tent families
ft:[0,1]→[0,1] defined respectively by
[TABLE]
The tent family is of particular theoretical importance, because any unimodal
map f:[a,b]→[a,b] with positive topological entropyh(f) (a
numerical measure of the asymptotic rate at which the orbits of nearby points
diverge from each other [1]) is semi-conjugate to the tent map with
slope t=exp(h(f)) [31, 36]. That is, there is an increasing surjection p:[a,b]→[0,1] such that
[TABLE]
commutes, so that the dynamics of f and of the tent map ft agree once
certain intervals in the domain of f — the nontrivial point preimages
p−1(x) — have been collapsed. The semi-conjugacy p can be described
explicitly, by means either of a formula, or of a dynamical description of
exactly which intervals in the domain of f are collapsed.
Kneading theory is a key tool in the analysis of the dynamics of
unimodal maps. Points x∈[a,b] are described by their itinerariesι(x)∈{0,1}N, sequences of [math]s and 1s which encode, for each
successive point on the orbit of x, whether it is on the left (‘[math]’) or the
right (‘1’) of the turning point c. (The details of how to encode c
itself are largely unimportant in this paper, and are left for
Section 2.1.) The itinerary of f(c), the largest point in the
range of f, is of particular importance, and is called the kneading
sequenceκ(f) of f. The dynamics of f is largely determined by its
kneading sequence — in particular, κ(f) determines the topological
entropy h(f), and hence the particular tent map to which f is
semi-conjugate.
The unimodal order (or parity-lexicographic order) ⪯
on {0,1}N is defined (see Definition 2.3) to reflect
the ordering of the interval: if x<y, then ι(x)⪯ι(y).
However, it takes on more meaning when interpreted as an order on the space of
unimodal maps: if κ(f)⪯κ(g), then the dynamics of g is at
least as complicated as the dynamics of f. In particular, κ(ft) is an
increasing function of t if ft is either the quadratic or the tent family.
The core of a unimodal map f:[a,b]→[a,b] is the interval J=[f2(c),f(c)]. It satisfies f(J)=J: moreover, the orbit of
every x∈(a,b) falls into J, so that all of the non-trivial recurrent
dynamics of f is contained in the core. For this reason, it is sensible —
particularly when considering inverse limits — to restrict the domain of a
unimodal map to its core. This corresponds to replacing the condition that
f(a)=f(b)=a with the condition that f(c)=b and f(b)=a.
In this paper we will be exclusively concerned with core unimodal maps, and
Definition 2.1 reflects this. We impose some additional
conditions on our unimodal maps f, which are stated in
Convention 2.8 below. These conditions are of two types:
(a)
Regularity conditions, expressed in a way which allows them to
encompass both the quadratic family and the tent family. These conditions
appear technical, but are standard in the theory of unimodal maps.
2. (b)
The additional condition that f has topological entropy
h(f)>21log2. This is an indecomposability condition: it is
equivalent to the non-existence of a pair of subintervals J1, J2,
disjoint except perhaps at their endpoints, with f(J1)⊂J2 and
f(J2)⊂J1.
Readers without a background in one-dimensional dynamics can substitute “a
unimodal map satisfying the conditions of Convention 2.8” with
“a map from the quadratic or tent family with sufficiently large parameter”,
without substantial loss.
1.2.2. Inverse limits
Let X be a compact metric space with metric d, and let f:X→X be
continuous and surjective. The inverse limit of f:X→X is the
space of “backwards orbits” of f:
[TABLE]
We endow X with a standard metric, also denoted d, which induces its
natural topology as a subspace of the product XN:
[TABLE]
Elements of X are denoted with angle brackets, x=⟨x0,x1,x2,…⟩ and referred to as threads.
The natural extension of f:X→X is the homeomorphism f:X→X defined by
[TABLE]
The projection π0:X→X is defined by π0(x)=x0.
Clearly π0∘f=f∘π0, so that π0 semi-conjugates f
to f. It is straightforward to show that if g:Y→Y is an
invertible dynamical system and p:Y→X semi-conjugates g to f,
then p factors through π0: therefore the natural extension is the
simplest invertible system which has f as a factor.
1.2.3. The Barge-Martin construction
The Barge-Martin construction [10] provides a mechanism for
embedding the inverse limit X of a dynamical system f:X→X as a
global attractor of a self-homeomorphism of a manifold, on which the
homeomorphism restricts to the natural extension of f. We now give a brief
outline of the construction in the case of interest here, where f:I→I is a unimodal map whose inverse limit is embedded as an attractor of a
sphere homeomorphism. Further details can be found in
Section 2.2.
Let T be a topological sphere, D⊂T be a closed disk containing a
copy of I in its interior, and ∂ be a point of T∖D.
Construct a smashΥ:T→T, a near-homeomorphism (i.e. a
uniform limit of homeomorphisms) which
•
collapses D onto I, in such a way that the preimage of each point of I is an arc in D;
•
fixes ∂; and
•
pushes points of T∖(D∪{∂}) “inwards”
towards I.
Let f:T→T be an unwrapping of f: a near-homeomorphism
which
•
sends I into D in such a way that Υ∘f∣I=f; and
•
doesn’t push any points of T∖{∂} too far
“outwards”.
Now consider the near-homeomorphism H=Υ∘f:T→T. By
construction we have H∣I=f, so that the inverse limit T=lim(T,H) contains an embedded copy of I, namely {x∈T:xi∈I for all i}, on which the action of the natural extension H restricts to
f. Because the smash pushes points of T other than ∂ towards I
more strongly than the unwrapping pushes them away, every point of T other
than ⟨∂,∂,∂,…⟩ is attracted to the copy of
I under iteration of H.
The key observation is that the inverse limit T is itself a topological
sphere, as a consequence of the following theorem due to Morton Brown:
Let X be a compact metric space, and f:X→X be a
near-homeomorphism. Then lim(X,f) is homeomorphic to X.
The constructions in this paper depend crucially on the details of the
smash Υ (see Section 2.2), and on the careful
definition of a particular choice of unwrapping f, which is described in
Section 3.
1.2.4. Prime ends
We will describe the Barge-Martin embedding of the inverse limit I of a
unimodal map f in the topological sphere T by means of Carathéodory’s
theory of prime ends. Here we review some basic definitions in order to allow
for precise statements of our main results. We note that while the theory
of prime ends can be profitably approached from the viewpoint of conformal
mappings, the spaces which we will be dealing with have no natural complex
structure, and so we take a purely topological approach. The reader seeking a
more comprehensive introduction from this point of view could consult, for
example, Mather’s paper [30].
Let T be a topological 2-sphere, and X be a non-empty, compact,
connected, non-separating proper subset of T, so that the complement U:=T∖X is a topological open disk. (For most of our applications, T
will be the sphere T of the Barge-Martin embedding, and X will be the
embedded copy of I.) Fix a point ∂∈U.
A crosscut (in (T,X)) is an arc ξ in T which is disjoint
from ∂ and intersects X exactly at the endpoints of ξ. Such a
crosscut separates the open disk U into two components, and we write
U(ξ) for the component which doesn’t contain ∂. If ξ1 and
ξ2 are crosscuts, then we write ξ2<ξ1 to mean that
U(ξ2)⊂U(ξ1). A chain is a sequence (ξk) of disjoint
crosscuts with ξk+1<ξk for each k and diam(ξk)→0 as
k→∞. Two chains (ξk) and (ξk′) are equivalent if for
each k there is some K with ξK<ξk′ and ξK′<ξk.
A prime end (of (T,X)) is an equivalence class of chains of
crosscuts in (T,X).
Let P be a prime end of (T,X). The principal setΠ(P)
of P is the set of points x∈X for which there is some
chain (ξk) representing P with d(ξk,x)→0 as k→∞.
The impressionI(P) of P is defined by
[TABLE]
where (ξk) is a chain representing P (the definition is clearly
independent of the choice of chain). We therefore have
[TABLE]
According to Carathéodory’s classification, a prime end P is of the
**First kind: **
if Π(P)=I(P) is a point;
**Second kind: **
if Π(P) is a point and is strictly contained in
I(P);
**Third kind: **
if Π(P)=I(P) is not a point; and
**Fourth kind: **
if Π(P) is not a point and is strictly contained in
I(P).
The language of rays is helpful in developing an intuitive understanding of
principal sets and impressions. A ray in (T,X) is a continuous
injection σ:[0,∞)→U with d(σ(s),X)→0
as s→∞. The remainderRem(σ) of σ is the set
σ([0,∞))∩X. We say that σlands (and
that its landing point is x∈X) if Rem(σ)={x}. A point
x∈X is accessible if it is the landing point of some ray.
Let P be a prime end defined by a chain (ξk). A ray σconverges to P if for every k there is some t such that
σ([t,∞))⊂U(ξk): in particular, this means that the image
of σ intersects ξk for all sufficiently large k.
It can be shown that if σ converges to P, then Π(P)⊆Rem(σ)⊆I(P): in particular, if σ lands at an
accessible point x∈X, then Π(P)={x}. Moreover, there are rays
σ,σ′ converging to P with Rem(σ)=Π(P) and
Rem(σ′)=I(P). Thus the principal set and impression of P can be
seen, respectively, as the remainders of the “tightest” and “loosest” rays
converging to P.
Let P denote the set of prime ends of (T,X). There is a natural topology
on P, with respect to which it is a topological circle: a basis for this
topology is given by the subsets B(ξ) of P, defined for each
crosscut ξ to consist of all of the prime ends defined by chains (ξk)
with ξk<ξ for some k. (In fact, this is the subspace topology of a
natural topology on P∪U, with respect to which this space is a compact
disk; and the definition above of a ray converging to a prime end is the normal
notion of convergence with respect to this topology.)
A homeomorphism H:(T,X)→(T,X) (such as the natural extension
H:(T,I)→(T,I) of the Barge-Martin construction) induces a
self-homeomorphism of the circle P which sends the prime end represented by
a chain (ξk) to the prime end represented by (H(ξk)). The prime
end rotation number of H:(T,X)→(T,X) is the Poincaré rotation
number of this circle homeomorphism.
1.2.5. Height
Let {ft} be a family of core unimodal maps of an interval I satisfying
the assumptions of Convention 2.8, such as the quadratic or
tent family with topological entropy greater than 21log2. The
Barge-Martin construction yields (abstract) sphere homeomorphisms
Ht:Tt→Tt, having attractors Λt which are
homeomorphic to the inverse limits It:=lim(I,ft), and restricted
to which the homeomorphisms Ht are conjugate to the natural extensions
of ft.
In the first part of the paper we study the prime ends of (Tt,Λt).
In the second part we construct sphere homeomorphisms χt by collapsing a
system of subsets of Tt, which are permuted by Ht, such that
•
each subset intersects Λt in at least one point; and
•
each subset except at most one intersects Λt in only finitely
many points.
The former of these properties ensures that there is a semiconjugacy pt from
ft to χt, and the latter that all but at most one of the fibers
of pt is finite.
Both the structure of the prime ends and the construction of the semiconjugacy
(including the nature of its exceptional fiber) are heavily dependent on the
parameter t, or, to be more precise, on the heightq(ft)
of ft [26] (Section 2.4). Dynamically, the height is the
prime end rotation number of Ht:(Tt,Λt)→(Tt,Λt). It is an element of [0,1/2], dependent only on the kneading
sequence κ(ft) of ft, which decreases as κ(ft) increases in
the unimodal order, with each irrational height being realized by a single
kneading sequence, and each rational height being realized on a closed
height interval of kneading sequences. See Figure 2,
which shows how height varies in the quadratic family. The assumption that
h(ft)>21log2 is, in fact, equivalent to q(ft)<1/2
(Lemma 2.22).
It follows that every unimodal map f is of one of three types:
**Irrational: **
when q(f) is irrational;
**Rational interior: **
when κ(f) is in the interior of the interval
of kneading sequences of some rational height m/n; or
**Rational endpoint: **
when κ(f) is an endpoint of the interval of
kneading sequences of some rational height m/n.
1.3. Prime ends of Barge-Martin attractors
The results of
Theorems 4.46, 4.64,
and 4.66, together with
Remarks 4.47, 4.65,
and 4.71 are summarized in the following
statement, where we refer to a prime end of the first kind (whose impression is
a point) as trivial. As discussed in Section 1.2.1,
the hypothesis of this theorem is satisfied by the tent and quadratic families
with topological entropy greater than 21log2.
Theorem**.**
Let {ft} be a family of unimodal maps satisfying the assumptions of
Convention 2.8. Then the prime ends of the Barge-Martin
attractor of ft in the sphere satisfy the following.
(a)
If ft is of irrational type, then the set of non-trivial
prime ends is a Cantor set. These non-trivial prime ends are of the second
kind, with impression the whole attractor.
2. (b)
If ft is of rational endpoint type with height m/n,
then there are exactly n non-trivial prime ends, which are of the second
kind, with impression the whole attractor.
3. (c)
If ft is of rational interior type with height m/n, then
there are exactly n non-trivial prime ends, whose impressions are the
whole attractor. These are of the third kind (the principal set is also
the whole attractor), unless ft belongs to a particular renormalization
window at the start of the m/n height interval, in which case they are
of the fourth kind.
4. (d)
If ft is of rational type with height m/n then the
attractor has n components of accessible points; while if ft is of
irrational type then the attractor has infinitely many components
of accessible points (countably many intervals and uncountably many
points).
For the example of Figure 1, which depicts the inverse limit of
a tent map ft of rational interior type with height 1/3, there are three
infinite “tunnels”, corresponding to the three non-trivial prime ends, which
become stepwise narrower and narrower as they probe deeper and deeper into the
inverse limit. The natural extension stretches by a factor t in the
horizontal direction, contracts by a factor 1/t in the vertical direction,
and bends the image around as dictated by ft (see for example
Figure 8): thus the three tunnels are permuted by the action,
and so are the three non-trivial prime ends, with rotation number 1/3 equal
to the height. By comparison, Figure 3 depicts an example of
rational interior type with height 2/7, where there are seven infinite
tunnels which are permuted with rotation number 2/7; and
Figure 4 depicts an example of rational endpoint type with
height 1/3: here there are infinitely many tunnels into the inverse limit,
but all of them are finite.
We now give an informal overview of the main steps in the proof of this
theorem, dropping the dependence on t for the sake of clarity. In
Section 3.2 we construct an explicit unwrapping of f to be
used as the starting point of the Barge-Martin construction, based on the
outside map B:S→S of f (Section 3.1), a
monotone circle map which describes the “thickened” action of f as seen
from a circle around I, whose rotation number is equal to the height q(f)
of f. The explicit nature of the unwrapping provides a description of the
elements of T∖Λ which makes it possible to construct
explicit chains of cross cuts to determine the prime ends (see for example
Figure 11). The key part of this process is the definition of a
homeomorphism Ψ:S×[0,∞)/(S×{0})→T∖Λ (Section 4.1), where S is the inverse limit
of the outside map, which provides a coordinate system on T∖Λ
in which these crosscuts can be described in a straightforward way. Because the
space S depends on the dynamics of the outside map, which is strongly
dependent on its rotation number (Theorem 4.33), the
structure of the prime ends themselves is strongly dependent on the height.
1.4. Semi-conjugacy to a family of sphere homeomorphisms
The results of Theorems 5.19 and 5.31 are summarized in
the following statement.
Theorem**.**
Let {ft} be a family of unimodal maps satisfying the assumptions of
Convention 2.8. Then there is a continuously varying
family {χt:S2→S2} of sphere homeomorphisms such that each
natural extension ft:It→It is semi-conjugate to χt, by
a semi-conjugacy all but one of whose fibers contains three or fewer points,
and only countably many of whose fibers contain three points.
If {ft} is the tent family, then for each parameter t for which ft is
post-critically finite, the sphere homeomorphism χt is a generalized
pseudo-Anosov map.
The exceptional fiber depends on the type of the unimodal map ft. In the
tent family case, where different parameters give rise to different kneading
sequences, there is a particularly clean description of these fibers:
•
if ft is of irrational type, then the exceptional fiber is a Cantor set;
•
if ft is of rational interior type with height m/n, then the exceptional fiber is finite with cardinality n; and
•
if ft is of rational endpoint type with height m/n, then the exceptional fiber is countable with n accumulation points.
In particular, the set of parameters for which the exceptional fiber is
infinite is a Cantor set. In the general case the description is more
complicated in an initial subinterval of each height interval, and the
exceptional fibre may contain arcs for parameters in these subintervals (see
Remark 5.17). In all cases no fiber of the semi-conjugacy
carries entropy, so no entropy is lost in the quotient.
For each parameter t, the sphere homeomorphism χt is constructed from
the Barge-Martin homeomorphism Ht:Tt→Tt by collapsing the
elements of an Ht-invariant decomposition Gt of Tt. The
decompositions are dynamically defined, their elements being determined by the
strongly stable components of Ht. The homeomorphism Ψt:St×[0,∞)/(St×{0})→Tt∖Λt enables these components to be described explicitly,
with their configuration determined by the type of the unimodal map ft (see
Figures 14, 15, 16,
and 17). From these descriptions, it can be shown
that each Gt is a non-separating, monotone, upper semicontinuous
decomposition, whose elements all intersect Λt, with at most one
element intersecting Λt in more than three points. It follows from
Moore’s theorem [32] that the quotient space Tt/Gt is itself a
sphere, and the quotient homeomorphism Ht/Gt has the required
properties.
Since these quotient homeomorphisms are all defined on different abstract
spheres, some further work is needed to show that they can be conjugated to a
continuous family of homeomorphisms of a standard sphere. The key result here
is a theorem of Dyer and Hamstrom [23], Theorem 5.22, which
requires, roughly speaking, that if we take the three-dimensional space
obtained by piecing together the spheres Tt, then the decomposition of
this space obtained from the Gt is itself upper semicontinuous. That this
is the case follows once more from the explicit descriptions of the Gt
(see Section 5.4).
That the dynamics of the sphere homeomorphisms χt closely mimic those of
the unimodal maps ft is expressed by the following straightforward result
(see Theorem 5.32).
Theorem**.**
Let f be a unimodal map satisfying the conditions
of Convention 2.8, and χ:S2→S2 be the
corresponding semi-conjugate sphere homeomorphism. Then
(a)
if f is topologically transitive then so is χ;
2. (b)
if f has dense periodic points, then so does χ;
3. (c)
f* and χ have the same number of periodic orbits of each period, with
the exception that, provided κ(f)=10∞,*
•
χ* has one more fixed point than f, and*
•
if f is of rational type with
q(κ(f))=m/n∈(0,1/2), then χ has either one or two fewer period n
orbits than f.
4. (d)
f* and χ have the same topological entropy; and*
5. (e)
if f preserves an ergodic Oxtoby-Ulam-measure, then χ
preserves an ergodic
Oxtoby-Ulam-measure with the same metric entropy.
In particular, if f is a tent map of slope t, then χ
is topologically transitive, has dense periodic points, has topological
entropy log(t), and has an invariant ergodic Oxtoby-Ulam-measure with metric
entropy log(t).
1.5. Acknowledgments
The authors are grateful for the support of FAPESP grants
2011/16265-8 and 2016/04687-9, CAPES grant
88881.119100/2016-01, and CAPES PVE grant 88881.068037/2014-01. This
research has also been supported in part by EU Marie-Curie IRSES
Brazilian-European partnership in Dynamical Systems (FP7-PEOPLE-2012-IRSES
318999 BREUDS). This work was supported by the Engineering and Physical
Sciences Research Council (grant number EP/R024340/1).
2. Preliminaries
2.1. Unimodal maps
In this section we expand on the introductory material presented in
Section 1.2.1, primarily to fix notation and conventions.
Our definition of unimodal maps reflects the fact that we will always consider
them to be defined on their cores.
Definition 2.1** (Unimodal map, turning point).**
A unimodal map is a continuous self-map
f:[a,b]→[a,b] of a compact interval [a,b], satisfying the
following conditions:
(a)
There is some c∈(a,b), which is called the turning point
of f, such that f is strictly increasing on [a,c] and strictly
decreasing on [c,b].
2. (b)
f(c)=b and f(b)=a.
Definition 2.2** (Itinerary).**
Let f:[a,b]→[a,b] be a unimodal map with turning point c, and let
x∈[a,b]. We say that an element μ of {0,1}N is an itinerary of x if, for all r≥0,
[TABLE]
If the orbit {fr(x):r≥0} of x contains c, then there is more
than one itinerary of x. We will nevertheless abuse notation by writing
ι(x)=μ to mean that μ is an itinerary of x.
Definition 2.3** (Unimodal order).**
The unimodal order is a total order ⪯ defined on {0,1}N
as follows. Let μ and ν be distinct elements of {0,1}N, and
let r≥0 be least such that μr=νr. Then
[TABLE]
The unimodal order reflects the ordering of points on the interval
[a,b]: if x,y∈[a,b] have itineraries μ and ν respectively,
and x<y, then μ⪯ν.
Definition 2.4** (Kneading sequence).**
Let f:[a,b]→[a,b] be a unimodal map. The kneading sequenceκ(f)∈{0,1}N of f is the itinerary of b which is smallest
with respect to the unimodal order.
Therefore κ(f) is the unique itinerary of b unless the
turning point c is a periodic point of f. The choice of κ(f) in the
periodic case has no particular significance: it is a convention which ensures
that the kneading sequence is well defined. It means that κ(f)=W∞ for some word W whose length is the period of c and which
contains an even number of 1s. (If V and W are words in the symbols [math] and 1, we write W∞ and VW∞ for the
elements WWW… and VWWW… of {0,1}N.)
We recall the following definition and result (see for example [22]),
which characterize the elements of {0,1}N which are kneading sequences of
unimodal maps.
Definition 2.5** (Maximal sequence).**
An element μ of {0,1}N is maximal if
σr(μ)⪯μ for all r≥0,
where σ:{0,1}N→{0,1}N is the shift map.
Lemma 2.6**.**
An element μ of {0,1}N is the kneading sequence of some unimodal
map f if and only if μ is maximal and μ0μ1=10. ∎
Definition 2.7** (KS).**
We write KS⊂{0,1}N for the set of kneading sequences of unimodal
maps: maximal sequences which start with the symbols 10.
Convention 2.8** (Standing assumptions for unimodal maps).**
All unimodal maps f:[a,b]→[a,b] in this paper will be assumed to satisfy
the following conditions:
(a)
101∞≺κ(f).
2. (b)
If κ(f) is not a periodic sequence, then distinct points
of [a,b] cannot share a common itinerary.
3. (c)
For each n>0 and each μ∈{0,1}N, there are at most two fixed points of fn with itinerary μ. If there are two such points, then κ(f)=σr(μ) for some r.
Condition (a) says that f cannot be subjected to a two-interval
renormalization: it is equivalent to requiring that the topological entropy
h(f) of f be greater than 21log2. Conditions (b) and (c) are
trivially satisfied by tent maps of slope greater than 1, for which no distinct
points share a common itinerary. It follows from standard results in the theory
of unimodal maps that they are also satisfied by quadratic maps, and indeed by
any C3 unimodal map with non-flat turning point, no points of inflection,
and negative Schwarzian derivative.
Note that when we consider standard families of unimodal maps such as the
quadratic family and the tent family, we can apply a parameter-dependent affine
change of coordinates so that the core is constant throughout the family.
The following notation will be useful:
Definition 2.9** (α, the point x^ symmetric to x).**
Let f:[a,b]→[a,b] be a unimodal map with turning point c. We
denote by α the unique point of (c,b] with f(α)=f(a). If
x∈[a,α], we denote by x^ the unique point of [a,α] which
satisfies f(x^)=f(x), and x^=x unless x=c.
Some necessary technical lemmas about the dynamics of unimodal maps, whose
proofs are routine, are presented in Appendix B.
2.2. Inverse limit attractors for unimodal maps: the Barge-Martin
construction
We now provide more details of the construction outlined in
Section 1.2.3. The results stated are from [10]
and [14], restricted to the situation which is of interest in this
paper. Throughout this section f:I→I is a unimodal map defined on
the interval I=[a,b]. Recall that the aim of the construction is to embed the
inverse limit lim(I,f) in the sphere, in such a way that it is a global
attractor of a homeomorphism which restricts to the natural extension f on
lim(I,f).
Definitions 2.10** (S, xu, xℓ, T, ∂, ηy).**
Let S be the circle obtained by gluing together two copies of I at their
endpoints. We denote the points of S by xu and xℓ for x∈I,
depending on whether they come from the ‘upper’ or ‘lower’ copy of I. We
therefore have au=aℓ and bu=bℓ, and we will also denote these
points of S with the symbols a and b respectively.
Let T=S×[0,1]/∼, where ∼ is the equivalence relation
which identifies
•
(xu,1) with (xℓ,1) for each x∈(a,b), and
•
(y,0) with (y′,0) for all y,y′∈S,
with the quotient topology. Then T is a two-sphere, which we endow with any
metric d which induces its topology. Suppressing the equivalence relation,
we will describe points of T by their “coordinates” (y,s)∈S×[0,1]. We identify the subset {(xu,1):x∈I}={(xℓ,1):x∈I} with I, so that (xu,1)=(xℓ,1)=x for all x∈I, and denote by ∂ the point
of T corresponding to S×{0}.
T decomposes into a continuously varying family of arcs {ηy}y∈S defined by ηy(s)=(y,s), with initial points ηy(0)=∂
and final points ηy(1)∈I, whose images are mutually disjoint except
at their initial points and perhaps at their final points. (See
Figure 5. Here, for clarity, we have depicted T with the
point ∂ opened out into the circle S.)
Definitions 2.11** (The projection τ and the smash Υ).**
The projection τ:S→I⊂T is defined by τ(y)=(y,1).
The smashΥ:T→T is the near-homeomorphism defined by
[TABLE]
Definition 2.12** (Unwrapping).**
An unwrapping of the unimodal map f is an
orientation-preserving near-homeomorphism f:T→T with the
properties that
(a)
f is injective on I, and f(I)⊆{(y,s):s≥1/2},
2. (b)
Υ∘f∣I=f, and
3. (c)
f(∂)=∂, and for all y∈S and all s∈(0,1/2],
the second component of f(y,s) is s.
Given such an unwrapping, let H=Υ∘f:T→T. Since H
is a near-homeomorphism, the inverse limit T=lim(T,H) is a topological
sphere by Brown’s theorem. It has as a subset
[TABLE]
the two inverse limits being equal since H∣I=f by
Definition 2.12 (b). We reuse the notation ∂
for the point ∂=⟨∂,∂,…⟩ of T.
Let H:T→T be the natural extension, which we refer to as the
Barge-Martin homeomorphism associated to the unwrapping f. The
following theorem, from [10], is a straightforward consequence of
the facts that H∣I=f, and that for all (y,s)=∂, there is some
r≥0 with Hr(y,s)∈I.
Theorem 2.13**.**
**
(a)
H∣I:I→I* is topologically conjugate to the natural
extension f:lim(I,f)→lim(I,f).*
2. (b)
For all x∈T∖{∂}, the ω-limit set
ω(x,H) is contained in I. ∎
If we consider a parameterized family of unimodal maps, then the constructions
above can be done in a continuous way. Let {ft}t∈[0,1] be a
continuously varying family of unimodal maps I→I (for each of which I is
the dynamical interval); and suppose that unwrappings ft of each ft
are chosen in such a way that {ft} is a continuously varying family of
near-homeomorphisms of T. Let Ht:Tt→Tt be the natural
extension of Ht=Υ∘ft:T→T; and let It=lim(I,Ht). A proof of the following result can be found
in [14], see also [6].
Theorem 2.14**.**
There are homeomorphisms ht:Tt→S2 for each t (where S2
is a standard model of the sphere) such that
(a)
ht∘Ht∘ht−1:S2→S2* is a continuously
varying family of homeomorphisms, and*
2. (b)
The attractors ht(It) vary Hausdorff continuously with t.
∎
2.3. Independence of the unwrapping
In this paper we will carry out a
careful construction of a specific unwrapping f:T→T of each
unimodal map f:I→I, which will enable us to describe precisely the
embedding of I in T, and hence the prime ends of (T,I). A
natural and important question is therefore the extent to which the results
depend on the choice of unwrapping. We now state a theorem whose consequence is
that the results are, in fact, independent of the unwrapping.
If f0 and f1 are unwrappings of the same unimodal map f, with
associated Barge-Martin homeomorphisms H0:T0→T0 and H1:T1→T1 then we can identify I=lim(I,f)=lim(I,H0)=lim(I,H1) as a subset of both T0 and
T1. We say that f0 and f1 are equivalent if there is a
homeomorphism λ:T0→T1 which restricts to the identity on
I. This means that I is equivalently embedded in T0 and T1;
and, since H0∣I=H1∣I=f, that λ conjugates the
actions of H0 and H1 on I.
Theorem 2.15**.**
Any two unwrappings of a unimodal map f are equivalent.
Height is a function q:KS→[0,1/2], introduced in [26],
which will play a central role in this paper. (Recall from
Definition 2.7 that KS denotes the set of kneading sequences
of unimodal maps.) We will see that, for each unimodal map f, the prime end
rotation number of the associated homeomorphism H:(T,I)→(T,I) is equal to q(κ(f)), and that the structure of
the prime ends depends strongly on whether q(κ(f)) is rational or
irrational, as does the exceptional fiber of the semi-conjugacy between f
and a sphere homeomorphism.
Height is defined using certain words cq associated to each rational
q∈(0,1/2], which we now describe. These words, which are closely related to
Sturmian sequences, were introduced by Holmes and Williams [27] in their
work on knot types in suspensions of Smale’s horseshoe map, and developed by
the third author in [26]: they also appear in a paper of Barge and
Diamond [9] on periodic orbits which are accessible from the
complement of the attracting set of Hénon maps in cases where that attracting
set is homeomorphic to the inverse limit of a unimodal map.
Definitions 2.16** (The integers κi(q) and the words cq).**
Let q∈(0,1/2], and let Lq be the straight line in the plane which
passes through the origin and has slope q. For each i≥1, define
κi(q) to be two less than the number of vertical lines
x=\mboxinteger which Lq intersects for y∈[i−1,i].
If q=m/n is rational (throughout the paper, when we write m/n for a
rational number, we always assume that m and n are coprime), define the
word cq∈{0,1}n+1 by
[TABLE]
It is straightforward (see [26]) to obtain the following formula for
κi(q): if q=m/n is rational, then
[TABLE]
where ⌊x⌋ denotes the greatest integer which does not exceed x. On
the other hand, if q is irrational, then κi(q) is given
by (1) for all i≥1.
Remark 2.17**.**
The fact that the formulae (1) do not give κi(q) in
the rational case q=m/n when i>m is irrelevant, since we only make use of
κi(q) for i≤m.
Examples 2.18** (The words cq).**
Figure 6 shows the line L5/17 for x∈[0,17]. The numbers
of intersections with vertical coordinate lines for y∈[i−1,i] are 4,
3, 4, 3, and 4 for i=1, i=2, i=3, i=4, and i=5. Hence
κ1(5/17)=κ3(5/17)=κ5(5/17)=2, while
κ2(5/17)=κ4(5/17)=1. Therefore c5/17=100110110011011001, a
word of length 18.
More generally, if q=m/n then the word cq is clearly palindromic, and
contains n−2m+1 zeroes divided ‘as even-handedly as possible’ into m
(possibly empty) subwords, separated by 11. For example, for each n≥2
we have c1/n=10n−11; c2/(2n+1)=10n−1110n−11;
c3/(3n+1)=10n−1110n−2110n−11; and
c3/(3n+2)=10n−1110n−1110n−11.
The next lemma, from [26], is essential for the definition of height.
Lemma 2.19**.**
(cq0)∞∈KS* for each rational q∈(0,1/2]. Moreover, the function
(0,1/2]∩Q→KS defined by q↦(cq0)∞ is strictly decreasing
with respect to the unimodal order on KS. ∎*
Definition 2.20** (Height).**
Let μ∈KS. Then the heightq(μ)∈[0,1/2] of μ is
given by
[TABLE]
By Lemma 2.19, the height function q:KS→[0,1/2] is
decreasing with respect to the unimodal order on KS and the usual order
on [0,1/2]. The next result, also from [26], describes the interval of
kneading sequences with given rational height.
Definition 2.21** (The words wq).**
For each q=m/n∈(0,1/2), define wq∈{0,1}n−1 to be the word
obtained by deleting the last two symbols of cq; and
wq∈{0,1}n−1 to be the reverse of wq.
Statements (a), (b), and (c) of the following lemma can be found in [26],
while (d) is contained in results of [21] (see also Lemma 11.5
of [5] for a self-contained proof).
Lemma 2.22** (Characterization of kneading sequences of given height).**
**
(a)
For each irrational q∈[0,1/2], there is a unique μ∈KS
with q(μ)=q, namely
[TABLE]
2. (b)
Let μ∈KS. Then q(μ)=0 if and only if
μ=10∞; and q(μ)=1/2 if and only if μ⪯101∞.
3. (c)
Let μ∈KS and q=m/n∈(0,1/2)∩Q. Then q(μ)=q if
and only if
[TABLE]
Moreover, if q(μ)=q and μ=(wq1)∞ then cq is an initial
subword of μ; and if μ is periodic, then either
μ=(wq1)∞ or μ=(wq0)∞, or its period is at least n+2.
4. (d)
Let q=m/n∈(0,1/2)∩Q. then 10(wq1)∞ is pre-periodic to
(wq1)∞: that is, there is some r with σr(10(wq1)∞)=(wq1)∞. ∎
By Lemma 2.22 (b), Condition (a) of
Convention 2.8 says exactly that q(κ(f))∈[0,1/2).
The endpoints of the intervals of kneading sequences of given rational height
will play an important role, as will the kneading sequences (cq0)∞ used
in the definition of height. The acronym NBT in the following notation stands
for ‘no bogus transitions’ and reflects the original motivation of height.
Let q∈(0,1/2)∩Q. We write lhe(q)=(wq1)∞,
rhe(q)=10(wq1)∞, and NBT(q)=(cq0)∞. We write KS(q) for the
set of kneading sequences μ with height q (i.e. with lhe(q)⪯μ⪯rhe(q)). In the special case q=0, we write
lhe(q)=10∞ and rhe(q) is undefined.
Example 2.24**.**
Let q=2/7, with cq=10011001, wq=100110, and wq=011001. Then we
have lhe(2/7)=(1001101)∞, rhe(2/7)=10(0110011)∞, and
NBT(2/7)=(100110010)∞. A kneading sequence μ lies
in KS(2/7) if and only if (1001101)∞⪯μ⪯10(0110011)∞.
In addition to the characterization of Lemma 2.22, there
is a straightforward algorithm which calculates q(μ) for any kneading
sequence which has rational height: see Section 3.2 of [26]111A
script to carry out this calculation can be found at
http://www.maths.liv.ac.uk/cgi-bin/tobyhall/horseshoe
As stated at the beginning of this section, the structure of the prime ends of
(T,I) depends on whether q(κ(f)) is rational or irrational. The
rational case q(κ(f))=m/n also splits into two subcases: one in which
κ(f) is either an endpoint of KS(m/n) or is equal to (wq0)∞ (a
consecutive kneading sequence to lhe(m/n)), and one in which neither of
these happens. The endpoint case further splits into subcases which, while they
yield the same results, are analyzed in quite different ways. These
observations motivate the following definitions (see Figure 7).
Definitions 2.25** **(Irrational and rational types; interior and endpoint types;
early, strict, and late types; tent-like and quadratic-like types; normal
type; general and NBT types).
We say that a unimodal map f is of irrational type or of rational type according as q(κ(f)) is irrational or rational.
In the rational case, with q(κ(f))=m/n∈(0,1/2), we say that f is
of (rational) endpoint type if κ(f)∈{lhe(m/n),(wq0)∞,rhe(m/n)}; and is of (rational) interior type otherwise.
In the rational endpoint case we say that f is of left endpoint type
if κ(f)∈{lhe(m/n),(wq0)∞}, and of right
endpoint type if κ(f)=rhe(m/n).
In the rational left endpoint case, we say that f is of early endpoint
type if κ(f)=lhe(m/n) but fn(a)=a; of strict endpoint
type if κ(f)=lhe(m/n) and fn(a)=a; and of late endpoint
type if κ(f)=(wq0)∞.
In the left strict endpoint case, we say that f is of tent-like type
if b is the only period n point of f with itinerary lhe(m/n); and
that it is of quadratic-like type if it has a second such period n
point (there cannot be more than two period n points with this itinerary by
Convention 2.8 (c)).
We say that f is of normal (endpoint) type if it is either of right
endpoint type, or of tent-like left strict endpoint type. (These are the only
endpoint types which occur for tent maps.)
In the rational interior case we say that f is of (rational) NBT type
if fn+2(c)=c — in which case κ(f)=NBT(m/n)
— and of (rational) general type otherwise.
In the special case m/n=0 (i.e. κ(f)=10∞), we declare f to
be of tent-like strict left endpoint type.
Remark 2.26**.**
To explain the terminology in the rational left
endpoint case, consider a full monotonic family {ft} of unimodal maps such
as the quadratic family, and let t1=inf{t:κ(ft)=lhe(m/n)}.
Then a saddle-node bifurcation occurs at t=t1 creating a semi-stable
period n orbit, which contains a point of itinerary lhe(m/n) and attracts
the orbit of the turning point. As t increases, this periodic orbit splits
into a stable-unstable pair of periodic orbits, both containing points of
itinerary lhe(m/n). We follow this pair of periodic orbits until at t=t2
the stable orbit contains the turning point. We still have
κ(ft2)=lhe(m/n), but now ft2n(a)=a. When we increase the
parameter further, the stable periodic orbit passes through the turning point
and the kneading sequence becomes (wq0)∞. Therefore ft is of early
endpoint type for t∈[t1,t2), of strict quadratic-like endpoint type for
t=t2, and of late endpoint type for t>t2 sufficiently close to t2.
There is no corresponding distinction at the right hand endpoint of the height
interval since, by Convention 2.8 (b), if
κ(f)=rhe(m/n), which is not periodic, then f(a) is necessarily
periodic of period n since it has the same itinerary (wq1)∞ as
fn+1(a).
In the tent family, by contrast, κ(f)=lhe(m/n) only if fn(a)=a,
κ(f) is never equal to (cq0)∞, and there is only ever one point
of any given itinerary. Therefore only the strict tent-like left hand endpoint
case occurs. That is, only the first three rows of Figure 7 are
relevant for tent maps.
The reason for the distinction between rational general and rational NBT types
will become apparent in Section 5.
3. The unwrapping
In this section we construct an explicit unwrapping f:T→T of an
arbitrary unimodal map f:[a,b]→[a,b]. This construction provides
explicit descriptions of the sphere T, the embedded inverse limit I,
and the homeomorphism H:T→T which restricts to the natural
extension f on I.
The construction proceeds in two steps. In Section 3.1 we
recall from [21] the outside mapB:S→S corresponding
to f, which is obtained by “fattening up” the interval to give it some
two-dimensional structure (a closely related construction also appears
in [17]). The unwrapping f itself is then constructed in
Section 3.2. It is the product of the outside map and the
identity on {(y,s):s≤1/2}⊂T, and is gradually changed in
{(y,s):s≥1/2} so that it satisfies the conditions of an unwrapping
(Lemma 3.4). We finish with a description of the
elements of T∖I (Definition 3.6 and
Lemma 3.7).
3.1. The outside map
Let f:[a,b]→[a,b] be a unimodal map with
turning point c∈(a,b). Recall that we denote by α the unique point
of (c,b] with f(α)=f(a).
Recall from Section 2.2 that S denotes the circle obtained
by gluing together two copies of I at their endpoints; that points of S are
denoted xu or xℓ for x∈I; and that we write a=au=aℓ and
b=bu=bℓ∈S. We will use standard interval notation (x,y), [x,y],
etc. for subintervals of S, the interval consisting of the arc which goes
counterclockwise, in the model of Figure 5, from the first point
listed to the second. Thus, for example, the interval [a,b] contains xℓ
for all x∈I, while the interval [b,a] contains xu for all x∈I.
The intuitive motivation for the definition of the outside map B:S→S is illustrated in Figure 8. We add some two-dimensional
structure to the unimodal map f as depicted on the left of the figure,
regarding the image of [a,c) as lying underneath the image of (c,b]. Then
points which are above the interval, lying in (a,α), get folded into
the interior – that is, they no longer remain on the outside. These points
correspond to the interior of the interval γ=[αu,a] in S depicted
on the right hand side of the figure, which is collapsed to a point by the
outside map. Other points above the interval, and all points below the
interval, remain on the outside after one iteration, with points below [a,c)
and above [α,b] being sent below the interval, and points below (c,b]
being sent above the interval.
This intuition leads to the following definition:
Definition 3.1** (The outside map).**
Let f:[a,b]→[a,b] be a unimodal map. The outside map
B:S→S corresponding to f is defined by
[TABLE]
The dynamics of the outside map plays a key role in the paper, and is discussed
in detail in Section 4.4 below. For now we note that, by
the first three equations of (2),
[TABLE]
where \accentset∘γ=(αu,a) and τ:S→I is the projection of
Definition 2.11, satisfying τ(xℓ)=τ(xu)=x.
3.2. Definition of the unwrapping
We now use the outside map to define an unwrapping of
the unimodal map f. Figure 9 shows the
sphere T (with ∂ opened out into the circle S), the
interval I⊂T, the circle S×{1/2} (dashed line), and segments
of some of the arcs ηy (dotted lines). It also depicts an interval J
with endpoints (f(a)ℓ,1/2) and (b,1). The unwrapping will be
constructed so that as x runs from a to c, f(xℓ,1) runs
along J with Υ(f(xℓ,1))=(f(x),1); while as x runs from
c to b, f(xℓ,1)=(f(x),1)∈I. The interval J is defined by
J={(ϕ(s)ℓ,s):s∈[1/2,1]}, where ϕ is the affine map of
Definition 3.2 below.
Definition 3.2** (The map ϕ:[1/2,1]→[f(a),b] and the unwrapping f of a unimodal map f).**
Let ϕ:[1/2,1]→[f(a),b] be the affine map
[TABLE]
with ϕ(1/2)=f(a) and ϕ(1)=b. We define f:T→T as
follows:
(U1)
f(y,s)=(B(y),s) for all (y,s)∈S×[0,1/2].
2. (U2)
If y∈[cℓ,αu] then f(y,s)=(B(y),s) for all
s∈[0,1].
3. (U3)
If y∈[αu,cu] then
[TABLE]
4. (U4)
If y∈[cu,a] then
[TABLE]
5. (U5)
If y∈[a,cℓ] then
[TABLE]
Remarks 3.3**.**
(a)
If y∈\accentset∘γ then the first component of f(y,s) is
equal to B(y) for all s∈[0,1] by (U1), (U2), and (U5).
2. (b)
When parsing this definition, it is helpful to recall that, in order
for f to be an unwrapping, we must have Υ(f(y,1))=f(τ(y)) for each y∈S (Definition 2.12 (b)). The
value s=ϕ−1(f(τ(y))) which appears in (U3), (U4), and (U5) —
noting that in (U5) we have y∈\accentset∘γ, so that
τ(B(y))=f(τ(y)) by (3) — is the parameter of the
point jy of J which retracts to f(τ(y)): therefore f(y,1)
must lie on the decomposition arc η which passes through this point.
According to the definition,
(U3)
When y∈[αu,cu], the path {f(y,s):s∈[1/2,1]}
moves along J from (f(a)ℓ,1/2) until it reaches jy, and
then moves along η until it reaches I;
2. (U4)
When y∈[cu,a], the path {f(y,s):s∈[1/2,1]} moves
along J from (f(a)ℓ,1/2) until it reaches jy, and then
remains at this point;
3. (U5)
When y∈[a,cℓ], the path {f(y,s):s∈[1/2,1]} moves
along η from (B(y),1/2) until it reaches jy, and then remains
at this point.
Lemma 3.4**.**
f* is an unwrapping of f.*
Proof.
A theorem of Youngs [42] states that any continuous monotone
surjection T→T is a near-homeomorphism. Therefore f is a
near-homeomorphism (which is clearly orientation-preserving), since the
preimage of each point of T under f is either a point or an arc. In
fact, the only points of T whose preimages are not points are
•
For each s∈(0,1/2), the point (f(a)ℓ,s), whose preimage is
the arc [αu,a]×{s}, and
•
For each s∈[1/2,1), the point (ϕ(s)ℓ,s) of J, whose
preimage is the arc
[TABLE]
where w(s) and z(s) denote the points of [a,c] and of [c,b]
respectively with f(w(s))=f(z(s))=ϕ(s). The first set in this union
comes from (U3) and (U4), the second from (U4), and the third from (U5).
Moreover, f satisfies condition a) of Definition 2.12,
since f∣I is injective, with f(y,1)∈I∪J for all y∈S
by (U2) – (U5); it satisfies condition b) since Υ∘f(y,1)=f∘τ(y) for all y∈S by (U2) – (U5) and (3);
and it satisfies condition c) by (U1). It is therefore an unwrapping of f
as required.
∎
Definitions 3.5** (H, T, U, H:T→T, B:S→S).**
As in Section 2.2, set H=Υ∘f:T→T, and observe that H∣I=f. Write
[TABLE]
Let H:T→T be the natural extension of H:T→T, so
that H∣I=f, the natural extension of f:I→I.
Let B:S→S denote the natural extension of the outside map
B:S→S. This is a circle homeomorphism, since S is a
topological circle by Brown’s theorem.
We next introduce some notation for the elements of U. The key fact here is
that if y∈S and s∈[0,1/2), then H(y,s)=Υ∘f(y,s)=Υ(B(y),s)=(B(y),2s). Recall that we
denote by ∂ the element ⟨∂,∂,…⟩ of T.
Definition 3.6** (Threads T(y,s) and T(y,s,k) in U).**
(a)
For each y∈S and s∈(0,1), define
[TABLE]
2. (b)
For each y∈S, s∈[1/2,1), and k≥0, define
[TABLE]
Lemma 3.7**.**
Every element of U∖{∂} is equal to exactly one of the
threads of Definition 3.6.
Proof.
Let x∈U∖{∂}. Since x∈I, there is some
least k≥0 with xk∈I: therefore xk=(y,s) for some y∈S
and s∈(0,1).
If k=0 then x=T(y,s), where yi is the first component of xi
for each i. On the other hand, if k≥1 then, since H(xk)∈I, we
have s∈[1/2,1); and x=T(y,s,k−1) where yi is the first
component of xk+i for each i.
∎
The interesting entry of the threads T(y,s,k) is H(y0,s)∈I, which
is where the transition takes place from the dynamics of the outside map to
the dynamics of the unimodal map.
Remark 3.8**.**
The unwrapping f varies continuously with the unimodal map f. It
follows from Theorem 2.14 that if {ft} is a
continuously varying family of unimodal maps, then the spheres constructed
above can be identified with a standard model in such a way that the
homeomorphisms Ht and the attractors It vary continuously.
4. Calculation of prime ends
In this section we determine the prime ends of (T,I) for any unimodal
map f satisfying the conditions of Convention 2.8. The main
tool that we use is an explicit homeomorphism Ψ from the open disk
D=S×[0,∞)/(S×{0}) to U=T∖I, which is
defined in Section 4.1. We will see that Ψ conjugates H∣U
to the product of B and a simple push on D
(Corollary 4.10).
In Section 4.2 we define the locally uniformly landing
setR, a subset of S with the property that Ψ extends
continuously over R×{∞}. In Section 4.3 we
impose some additional conditions (which we show later are always satisfied),
and use these to construct a homeomorphism between S and the circle P
of prime ends.
The structure of the locally uniformly landing set for a specific unimodal
map f depends on the dynamics of the outside map B:S→S, which is
discussed in Section 4.4. Armed with the results of that
section, we will be able to complete the calculation of prime ends. The details
of this calculation depend on whether f is of irrational type, of rational
interior type, or of rational endpoint type, and these cases are presented in
Sections 4.5, 4.6, and 4.7
respectively.
4.1. The homeomorphism Ψ:D→U
Definitions 4.1** **(D, D, ∂′, S∞, X∞, the
push λ, the homeomorphisms G:D→D and G:D→D).
Write D=S×[0,∞)/(S×{0}) and D=S×[0,∞]/(S×{0}). We regard D as a subset of
D, and use coordinates (y,s)∈S×[0,∞] on D and
D: these coordinates are singular at ∂′, the point
corresponding to S×{0}.
Write S∞=S×{∞}⊂D, the circle at infinity. Similarly, given any subset X of
S, we write X∞=X×{∞}⊂S∞.
Let λ:[0,∞]→[0,∞] be defined by
[TABLE]
and G:D→D be the homeomorphism defined by G(y,s)=(B(y),λ(s)). We denote the restriction to D with the same symbol, G:D→D.
In this section we define an explicit homeomorphism Ψ:D→U, which
is constructed in such a way that it conjugates G:D→D to H:U→U, thereby providing a coordinate system on U in which the action
of H is very easy to understand. We will see in subsequent sections
that Ψ extends over an open dense subset of the circle S∞ as a
homeomorphism into T. The non-trivial prime ends of (T,I) can be
understood in terms of the action of Ψ on rays in D which converge to
points of S∞ at which Ψ is discontinuous or not defined.
The surjectivity of Ψ will be an immediate consequence of its definition
(Lemma 4.7). To show that it is continuous and injective,
we first establish that it semi-conjugates G and H
(Lemma 4.8), and then use this semi-conjugacy to extend the
obvious continuity and injectivity on S×(0,1) over the rest of D
(Corollary 4.9).
In order to define Ψ, it will be convenient to introduce the following
notation (in which it should be noted carefully that v is not the
fractional part of s).
Definition 4.2** (Splitting s into parts).**
We define P:[0,∞)→N×[1/2,1) by P(s)=(t,v), where
t=⌊s⌋ is the integer part of s and v=(u+1)/2, where u=s−t is
the fractional part of s.
Definition 4.3** (Ψ:D→U).**
Define Ψ:D→U by Ψ(∂′)=∂ and
[TABLE]
Substituting (5) into the formula for Ψ(y,s)
in the case s≥1 yields the useful alternative expression
[TABLE]
Therefore the number of entries of Ψ(y,s) which are in I is equal to
the integer part t of s. We will frequently use the following immediate
consequence of (7):
[TABLE]
When y∈γ, the definition of f(y,s), and hence of H(y,s),
depends on whether s is smaller or greater than ϕ−1(f(τ(y))) (see
(U3) and (U4) of Definition 3.2).
By (7), the behavior of Ψ(y,s) therefore depends on
whether v=(u+1)/2 is smaller or greater than this value; that is, on whether
the fractional part u of s is smaller or greater than
2ϕ−1(f(τ(yt)))−1. This value will frequently be significant in the
remainder of the paper, and the following notation will be useful.
Definition 4.4** (The function u:S→[0,1]).**
Define u:S→[0,1] by
[TABLE]
In particular u(cu)=1 and u(a)=u(αu)=0. The following
lemma gives the key property of the function u.
Lemma 4.5**.**
Let y∈S and v∈[1/2,1), and write u=2v−1∈[0,1).
Then
[TABLE]
Proof.
If y∈γ then necessarily u≥u(y), and
H(y,v)=τ(B(y))=f(τ(y)) by Remark 3.3 (a)
and (3).
If y∈γ and u≥u(y), then v≥ϕ−1(f(τ(y))), and hence
the first component of f(y,v) is f(τ(y))ℓ by (U3) and (U4) of
Definition 3.2. Therefore H(y,v)=Υ∘f(y,v)=f(τ(y)) as required.
If y∈γ and u<u(y), then v<ϕ−1(f(τ(y))), and hence the
first component of f(y,v) is ϕ(v)ℓ by (U3) and (U4) of
Definition 3.2. Therefore H(y,v)=ϕ(v) as
required.
∎
Remark 4.6**.**
If y∈γ and u=u(y) then H(y,v)=f(τ(y))=ϕ(v). On the other
hand, if y∈γ and u=u(y)=0, then it need not be the case that
H(y,v)=ϕ(v): we have H(y,v)=f(τ(y)), while ϕ(v)=ϕ(1/2)=f(a).
Lemma 4.7**.**
Ψ:D→U* is surjective.*
Proof.
Recall (Lemma 3.7) that every element
of U∖{∂} is either of the form T(y,s) for some
y∈S and s∈(0,1); or of the form T(y,s,k) for some
y∈S, s∈[1/2,1) and k≥0. In the former case we have
T(y,s)=Ψ(y,s); while in the latter case T(y,s,k)=Ψ(Bk+1(y),k+1+(2s−1)) by direct substitution into (6),
since P(k+1+(2s−1))=(k+1,s).
Since ∂=Ψ(∂′), this establishes the surjectivity of
Ψ.
∎
Lemma 4.8**.**
H∘Ψ=Ψ∘G:D→U.
Proof.
The proof is a straightforward calculation by cases. Let (y,s)∈D. If
s=0 then (y,s)=∂′, and H(Ψ(∂′))=Ψ(G(∂′))=∂. We therefore assume that s>0.
(a)
If s∈(0,1/2) then H(y0,s)=Υ∘f(y0,s)=(B(y0),2s) by (U1) of Definition 3.2 and
Definition 2.11. Therefore
[TABLE]
2. (b)
If s∈[1/2,1) then P(λ(s))=P(2s)=P(1+(2s−1))=(1,s), so
that
[TABLE]
3. (c)
If s∈[1,∞) then λ(s)=s+1, so that if P(s)=(t,v) then
P(λ(s))=(t+1,v). Therefore
[TABLE]
since H(ft−1(H(yt,v)))=ft(H(yt,v)).
∎
Corollary 4.9**.**
Ψ:D→U* is a homeomorphism.*
Proof.
For each N≥1, the restriction of G−N to S×[0,N+1) is a
homeomorphism onto S×[0,1). Lemma 4.8 gives
[TABLE]
Since Ψ is evidently continuous and injective on S×[0,1), it is
continuous and injective on S×[0,N+1) for each N, and hence
on D. Therefore (using Lemma 4.7) Ψ is a
continuous bijection.
Ψ−1 is clearly continuous on Ψ(S×[0,1)), and it is
continuous on Ψ(S×(0,∞)) by invariance of domain.
∎
Ψ* is a topological conjugacy between G:D→D and H:U→U. ∎*
4.2. Extension to the circle at infinity
We now investigate the extension of Ψ to points
(y,∞)∈S∞.
Definitions 4.11** **(The rays Ry, the landing set L, the landing function
ω:L→I, D†, Ψ:D†→T).
For each y∈S, let Ry:[0,∞)→U be the ray defined by
Ry(s)=Ψ(y,s). Define the landing setL⊂S to be
the set of y∈S for which Ry lands; and let
ω:L→I denote the landing function, which takes each
y∈L to the landing point of Ry. We write D†=D∪L∞⊂D, and extend Ψ:D→U to a function
Ψ:D†→T by setting Ψ(y,∞)=ω(y) for each
y∈L.
The main results of this section are:
(a)
If all of the entries of the thread y after the (N+1)st lie
in S∖\accentset∘γ, then the first N+1 entries of the thread
Ψ(y,s) are independent of s, provided that s≥N+1
(Lemma 4.13). In particular
(Corollary 4.14), y∈L. For this reason we say that an
element y of S satisfying this condition is landing of
level N. We also show (Lemma 4.16) that the landing
function ω is injective on the set of all points which are landing of
some level.
2. (b)
If all threads sufficiently close to y are also landing of level N
(that is, if y has a locally uniformly landing neighborhood), then Ψ
is continuous at (y,∞) (see
Lemma 4.17 and
Corollary 4.19).
Let N∈N. We say that y∈S is landing of
level N if yi∈\accentset∘γ for all i>N; and we write
LN⊂S for the set of such points. (Therefore
L0⊂L1⊂L2⊂⋯.) We say that a subset J
of S is uniformly landing (of level N) if J⊂LN. We
write R for the set of elements of S which have a uniformly landing
neighborhood in S.
Lemma 4.13**.**
Let y∈LN, and let s≥N+1. Then,
writing P(s)=(t,v),
[TABLE]
Proof.
We have t≥N+1. Now
[TABLE]
as required. Here the first equality
is (7); for the second, we use Remark 3.3 (a) to
give that f(yt,v)1=B(yt)=yt−1, since yt∈\accentset∘γ, so
that H(yt,v)=Υ(f(yt,v))=τ(yt−1); and for the third, we use that
f(τ(yi))=τ(B(yi))=τ(yi−1) for all i>N
by (3), since yi∈\accentset∘γ for these values of i.
∎
Corollary 4.14**.**
Let y∈LN. Then y∈L and
[TABLE]
In particular, R⊂L. ∎
Remark 4.15**.**
Therefore ⋃N≥0LN⊂L. We will see later that these
two sets are equal, except in the late left endpoint case: see
Remark 4.70.
Lemma 4.16**.**
Let L′=⋃N≥0LN. Then ω:L′→I is
injective.
Proof.
Let y,z∈L′ be such that ω(y)=ω(z). Pick N such
that y,z∈LN. Then τ(yN+r)=τ(zN+r) for all r≥0 by (10). However, at least one of
any two successive entries of a thread of I must lie in [a,α) (as
f([α,b])=[a,f(a)], and f(a)<α since κ(f)≻101∞).
Since yN+r,zN+r∈\accentset∘γ for all r, it follows that
yN+r=zN+r for arbitrarily large r, so that y=z as required.
∎
Lemma 4.17**.**
Let J be a uniformly landing subset of S. Then Ψ∣J×[0,∞] is continuous.
Proof.
Since Ψ is continuous on D (Corollary 4.9), it
suffices to prove continuity at points of J∞. So let y∈J, and
let N be such that J⊂LN. Pick sequences y(i)→y in J
and s(i)→∞ in [0,∞).
Let P(s(i))=(t(i),v(i)). Lemma 4.13
gives that, for sufficiently large i,
[TABLE]
which converges to Ψ(y,∞)=ω(y) as
i→∞. Similarly, it follows from (10) that
Ψ(y(i),∞)→Ψ(y,∞) as i→∞.
∎
If J is uniformly landing but not open in S, then Ψ (as opposed to
its restriction to J×[0,∞]) may not be continuous at (y,∞)
when y is a boundary point of J. However, Ψ is continuous at
interior points of J∞, and in particular is continuous at
(y,∞) for all y in the locally uniformly landing set R.
The following immediate corollary, which will be used frequently in the
remainder of the paper, states that Ψ extends continuously and injectively
from the disk D over the locally uniformly landing set at ∞. We
will see later that this is the maximal set over which Ψ has such an
extension.
Definition 4.18** (D).**
We write D=D∪R∞⊂D†⊂D.
Corollary 4.19**.**
Ψ:D→T* is injective and continuous. In particular, its
restriction to any compact subset of D is a homeomorphism onto its image.*
Proof.
Ψ is injective since it is injective on D and on R∞
(Corollary 4.9 and Lemma 4.16), and
Ψ(y,s)∈I if and only if s=∞. It is continuous since it is
continuous on D (Corollary 4.9) and on
R×[0,∞] (Lemma 4.17).
∎
So far in this section we have been concerned with the behavior of
Ψ(y,s) as s→∞. Our final result is a technical lemma with a
different flavor: it states that if there are several consecutive entries in a
thread y which do not lie in \accentset∘γ, then one entry (and hence all
earlier entries) of the thread Ψ(y,s) is constant for s in a
corresponding interval.
Lemma 4.20**.**
Let y∈S, and suppose that r≥1 and k≥1 are such that
yr+i∈\accentset∘γ for all 1≤i≤k. Then
[TABLE]
In particular, if y∈Lr, so that yr+i∈\accentset∘γ for all i≥1, then Ψ(y,s)r−1=f(τ(yr)) for all s≥r+u(yr).
Proof.
Suppose first that s∈[r+u(yr),r+1), so that P(s)=(r,v) for some
v≥2u(yr)+1. Then Ψ(y,s)r−1=H(yr,v)
by (8); and H(yr,v)=f(τ(yr)) by
Lemma 4.5.
Next suppose that s∈[t,t+1) for some integer t with r+1≤t≤r+k,
so that P(s)=(t,v) for some v∈[1/2,1). Then
Ψ(y,s)r−1=ft−r(H(yt,v))=ft−r(τ(B(yt)))=ft−r(τ(yt−1))=f(τ(yr))
as required. Here the first equality uses (8), the second
uses Remark 3.3 (a), and the fourth uses (3)
applied t−r−1 times.
That Ψ(y,r+k+1)r−1=f(τ(yr)) follows from the continuity
of Ψ.
∎
4.3. Good chains of crosscuts
In this section we establish (Theorem 4.28) that there is a
natural homeomorphism between S and the circle P of prime ends of
(T,I), with the property that, for each y∈S, the ray Ry
converges (in the sense of Section 1.2.4) to the prime
end corresponding to y. Moreover (Lemma 4.30), this
homeomorphism conjugates the natural extension B:S→S of the
outside map to the action of H on P, so that the prime end rotation
number of (T,I) is equal to the Poincaré rotation number of B.
The arguments require two conditions which, while they always hold, we will
only be able to establish, on a case by case basis, later. We therefore treat
them as hypotheses for the time being. The first is that the locally uniformly
landing set R is dense in S. The second is that there exist chains of
crosscuts in (D,S∞) whose images under Ψ are well-behaved
chains of crosscuts in (T,I), as expressed by
Definition 4.22 below. We carry over the definitions and
notation of Section 1.2.4 to the (topologically trivial)
pair (D,S∞): a crosscut in (D,S∞) is an arc ξ′ in D, disjoint from ∂′, which
intersects S∞ exactly at its endpoints; U(ξ′) denotes the
component of D∖ξ′ which doesn’t contain ∂′; ξ2′<ξ1′ means that U(ξ2′)⊂U(ξ1′); and (ξk′) is a chain of
crosscuts in (D,S∞) if the ξk′ are disjoint crosscuts with
ξk+1′<ξk′ for each k and diam(ξk′)→0 as k→∞.
Remark 4.21**.**
If a crosscut ξk′ in (D,S∞) has endpoints in R∞
then, by Corollary 4.19, Ψ∣ξk′ is a
homeomorphism onto its image ξk, which is therefore a crosscut in (T,I).
Definition 4.22** (Good chain of crosscuts).**
Let y∈S. A chain (ξk′) of crosscuts in
(D,S∞) is called a good chain for y if
(a)
The endpoints of each ξk′ are in R∞, so that
ξk=Ψ(ξk′) is a crosscut in (T,I) by
Remark 4.21;
2. (b)
(y,∞)∈U(ξk′) for each k, so in particular
ξk′→(y,∞) as k→∞;
3. (c)
diam(ξk)→0 as k→∞; and
4. (d)
if y∈L, then (ξk) does not converge to a point x
of I.
Remarks 4.23**.**
(a)
By Definition 4.22 (a) and (c), if (ξk′) is a good
chain of crosscuts for y, then (ξk) is a chain of crosscuts in
(T,I).
2. (b)
Suppose that there is a good chain of crosscuts (ξk′) for
y∈S.
•
If y∈L then, since Ry lands at ω(y) and
intersects every ξk, we have ξk→ω(y) as k→∞. It
follows that for every ray σ′:[0,∞)→D which lands
at (y,∞), the ray σ=Ψ∘σ′ either lands
at ω(y), or does not land.
•
If y∈L, then for every such ray σ′, the ray σ=Ψ∘σ′ intersects ξk for all sufficiently large k, and
therefore does not land, by condition (d) of the definition.
3. (c)
By Corollary 4.19, there is a good chain of
crosscuts for every y∈R.
4. (d)
We will continue to use the notational convention introduced above:
functions f′:X→D and subsets Y′⊂D will be denoted with
primed symbols, and the corresponding functions
f=Ψ∘f′:X→T and subsets Y=Ψ(Y′)⊂T
with the corresponding unprimed symbols.
Lemma 4.24**.**
Suppose that R is dense in S, and
let σ:[0,∞)→U be a ray which lands at a point of I.
Then the ray σ′=Ψ−1∘σ lands at a point of S∞.
Proof.
The remainder Rem(σ′) is a connected subset of
S∞, so if σ′ didn’t land then, since R is open and dense
in S, there would be a non-trivial closed subinterval J of R with
J∞⊂Rem(σ′). This would contradict the fact that σ
lands, since Ψ∣J×[0,∞] is a homeomorphism onto its image
by Corollary 4.19.
∎
Corollary 4.25**.**
Suppose that R is dense in S. If ξ is a crosscut in (T,I), then ξ′=Ψ−1(ξ) is a crosscut in (D,S∞). Moreover, if ξ2<ξ1 are crosscuts in (T,I), then ξ2′<ξ1′
Proof.
Immediate from Lemma 4.24 and the fact that
U(ξ′)=Ψ−1(U(ξ)).
∎
We now associate a point of S with each prime end P in (T,I),
under the assumption that R is dense in S. Suppose that P is
represented by a chain (ξk), and write Uk=U(ξk). Then each ξk′=Ψ−1(ξk) is a crosscut in (D,S∞), and Uk′:=U(ξk′)=Ψ−1(Uk).
Let Jk′=Uk′∩S∞, a compact arc with endpoints the
endpoints of ξk′. Then ⋂k≥0Jk′ is a single point. For if
not then, since R is open and dense in S, the intersection would
contain K∞ for some K=[y1,y2]⊂R, and every
ξk would intersect both Ψ({y1}×[0,∞]) and
Ψ({y2}×[0,∞]), contradicting diam(ξk)→0 as
Ψ∣K×[0,∞] is a homeomorphism onto its image by
Corollary 4.19.
Since the point of ⋂k≥0Jk′ is independent of the choice of chain
representing P, we can make the following definition:
Definition 4.26** (y:P→S).**
Suppose that R is dense in S. Let P be
a prime end of (T,I). We write y(P) for the element of S
defined by
[TABLE]
where (ξk) is a chain
representing P.
Lemma 4.27**.**
Suppose that R is dense in S. Then
y:P→S is continuous.
Proof.
Let J be an open subset of S, and let P∈y−1(J)
be represented by a chain (ξk). Then there is some k such that
Ψ−1(U(ξk))∩S∞⊂J, and we have
P∈B(ξk)⊂y−1(J), where B(ξk) is the basic open
subset defined in Section 1.2.4.
∎
Theorem 4.28**.**
Suppose that R is dense in S, and that there is
a good chain of crosscuts for every y∈S. Then
(a)
y:P→S* is a homeomorphism;*
2. (b)
For each y∈S, the unique prime end P with y(P)=y is
defined by the chain (Ψ(ξk′)), where (ξk′) is any good chain of
crosscuts for y: or, indeed, any chain of crosscuts which
satisfies (a) – (c) of Definition 4.22.
3. (c)
For each y∈S, the ray Ry converges to the unique prime
end P with y(P)=y; and
4. (d)
the set of accessible points of I is {ω(y):y∈L}.
Proof.
(a)
Let y∈S, and let (ξk′) be a good chain of crosscuts
for y. Write Uk′=U(ξk′), ξk=Ψ(ξk′), and Uk=U(ξk)=Ψ(Uk′). By Remark 4.23 (a), (ξk) is a chain of
crosscuts in (T,I), which therefore represents a prime end P∈P.
By condition (b) of Definition 4.22 we have y(P)=y.
In particular, y:P→S is surjective.
To show injectivity, suppose that (Ξk) is another chain of crosscuts in
(T,I) which defines a prime end Q∈P with
y(Q)=y(P)=y. Write Vk=U(Ξk), and Vk′=Ψ−1(Vk).
By Corollary 4.25, each Ξk′=Ψ−1(Ξk)
is a crosscut in (D,S∞). In order to show that Q=P, we
need to show that each Vℓ contains all but finitely many Uk, and
each Uℓ contains all but finitely many Vk.
Now for each ℓ, since y(Q)=y, we have that
Vℓ′ contains an arc Jℓ′ in S∞ with
(y,∞)∈Jℓ′. Moreover, since the Ξk are mutually
disjoint, so are the Ξk′ by Remark 4.23 (b) (this is
where we use condition (d) of Definition 4.22). Therefore
(y,∞) cannot be an endpoint of more than one of the crosscuts
Ξk′, and hence is in the interior of Jℓ′. Since
ξk′→(y,∞), it follows that Uk′⊂Vℓ′ — and
hence Uk⊂Vℓ — for all sufficiently large k.
To show that each Uℓ contains all but finitely many Vk, let
ξ′<ξℓ′ be a crosscut disjoint from ξℓ′ whose endpoints
are in the same components of R∞ as the endpoints of ξℓ′,
and which satisfies (y,∞)∈U(ξ′). Let X be the
compact subset of D bounded by ξℓ′ and ξ′. Since Ψ∣X
is a homeomorphism onto its image, arcs which intersect both Ψ(U(ξ′))
and the complement of Ψ(Uℓ′) have diameter bounded below. Now
Ξk intersects Ψ(U(ξ′)) for all sufficiently large k (since
y(Q)=y), and diam(Ξk)→0, so that Int(Ξk)⊂Ψ(Uℓ′)=Uℓ — and hence Vk⊂Uℓ — for
all sufficiently large k as required.
2. (b)
Follows immediately from the first paragraph of the proof of (a), which
doesn’t make use of condition (d) of Definition 4.22.
3. (c)
For each k there is some t with {y}×[t,∞)⊂U(ξk′), and therefore
[TABLE]
so that Ry converges to the prime end defined by the
chain (Ψ(ξk′)) as required.
4. (d)
Clearly ω(y) is accessible for all y∈L, since it is the
landing point of the ray Ry.
Let x be an accessible point of I, so that there is a ray
σ:[0,∞)→U which lands at x. By
Lemma 4.24, the ray σ′=Ψ−1∘σ lands at some (y,∞)∈S∞. By Remark 4.23 (b), y∈L and x=ω(y).
∎
Definition 4.29** (P:S→P).**
Suppose that R is dense in S,
and that there is a good chain of crosscuts for every y∈S. Then we
write P:S→P for the inverse of the homeomorphism
y:P→S.
Lemma 4.30**.**
Suppose that R is dense in S, and that there is
a good chain of crosscuts for every y∈S. Then P:S→P
conjugates B:S→S to H:P→P. In particular, the prime end rotation number of
H:(T,I)→(T,I) is equal to ρ(B).
Proof.
Let y∈S. By Theorem 4.28 (c), the ray
Ry converges to P(y), and hence H∘Ry converges to
H(P(y)). By Lemma 4.8, H∘Ry(s)=RB(y)(λ(s)), so that the image of H∘Ry coincides with
the image of RB(y), which converges to P(B(y)) by
Theorem 4.28 (c). Therefore H(P(y))=P(B(y)) as
required.
∎
We will see later (Corollary 4.36) that
ρ(B)=ρ(B)=q(κ(f)). The following lemma summarizes those parts of
the results above which are relevant to the classification of prime ends, for
future reference.
Lemma 4.31**.**
Suppose that R is dense in S, and that
there is a good chain of crosscuts for every y∈S. Then
(a)
If y∈L then Π(P(y))={ω(y)}.
2. (b)
If y∈R then I(P(y))={ω(y)}.
In particular, a prime end P∈P is of the first kind if
y(P)∈R; and is of the first or second kind if y(P)∈L.
Proof.
(a) follows from the fact that Ry converges to P(y)
and lands at ω(y) (see Section 1.2.4). (b) is
immediate from the homeomorphism established in
Corollary 4.19.
∎
4.4. Dynamics of the outside map
In order to determine the prime ends of (T,I), it suffices, in view of the homeomorphism between P and S
(Theorem 4.28) and the triviality of prime ends P(y) with
y∈R (Lemma 4.31), to prove that R is dense in
S and that there is a good chain of crosscuts for every y∈S; and
then to analyze the prime ends which the rays Ry converge to in the
cases when y∈R. The arguments and conclusions are quite different
depending on whether f is of rational or irrational type, and we will
consider these cases separately.
In this section we state and prove the main result which will be needed about
the dynamics of the outside map B:S→S. Because the locally uniformly
landing set R of Definitions 4.12 depends on occurrences of
elements of \accentset∘γ in the threads y∈S, it is primarily necessary to
understand the recurrence properties of γ. Since B collapses γ
to the single point B(a), the main question is: when does the orbit of B(a)
first enter γ? We will see that if f is of rational type with
q(κ(f))=m/n, then n is the smallest positive integer with
Bn(a)∈γ, except when f is of early left endpoint type; while if f
is of irrational type, or of early left endpoint type, then the orbit of B(a)
is disjoint from γ.
Definition 4.32** (N(f)).**
Let f:[a,b]→[a,b] be a unimodal map, and
B:S→S be the corresponding outside map. We define
N(f)∈N∪{∞} by N(f)=∞ if Br(a)∈γ for all
r≥1, and otherwise
[TABLE]
Theorem 4.33 below is an extension (both to more general
hypotheses and to stronger conclusions) of a result of [21]. Because of
the central role which this theorem plays in the paper, we prove it in full,
although we do rely on some technical lemmas from [21].
Before stating the theorem, we remark that the outside map B:S→S is
a monotone degree 1 circle map, and therefore has a Poincaré rotation number
ρ(B). Recall that we denote by α the unique element of (c,b] with
f(α)=f(a). The reader is encouraged to review the notation and results of
Section 2.4 before proceeding.
Theorem 4.33** (Dynamics of the outside map).**
Let f:[a,b]→[a,b] be a unimodal map with
kneading sequence κ(f)=μ, and let B:S→S be the
corresponding outside map. Then
(a)
ρ(B)=q(μ).
2. (b)
If q(μ)=m/n is rational and f is not of early left endpoint type, then
(i)
N(f)=n;
2. (ii)
Bn(a)=a⟺μ=lhe(m/n)* and Bn(a)=αu⟺μ=rhe(m/n); and*
3. (iii)
The set S∖⋃r≥0B−r(γ) of points whose orbits
never fall into γ is:
•
empty if f is of normal endpoint type;
•
the union of n half-open intervals, with open endpoint at a
point of the orbit of B(a) and closed endpoint at a point of a second
period n orbit of B, if f is of quadratic-like strict left endpoint
type; and
•
a single period n orbit of B otherwise.
3. (c)
If q(μ)=m/n is rational and f is of early left endpoint type,
then
(i)
N(f)=∞; and
2. (ii)
B* has a period n orbit Q disjoint from γ which attracts the
orbit of B(a).*
4. (d)
If q(μ) is irrational, then
(i)
N(f)=∞;
2. (ii)
The set ⋃r≥0B−r(γ) of points whose orbits fall
into γ is dense in S; and
3. (iii)
The orbit {Br(a):r≥1} of B(a) is dense in
S∖⋃r≥0B−r(γ).
We will use two lemmas. The first, Lemma 4.34 below,
provides tools for determining N(f) and the rotation number ρ(B).
Although the lemma is straightforward, its statement may be hard to parse, and
we start with an informal description. For r≤N(f) we have that
τ(Br(a))=fr(a) by (3). In order to determine whether or
not Br(a)∈γ, we need to decide whether Br(a) is equal to
fr(a)u or to fr(a)ℓ; and, in the former case, whether or not
fr(a)≤α. The set J defined in the statement of the lemma has the
property that, for 1≤r≤N(f), Br(a)=fr(a)u if and only if
r∈J. Since ι(fr(a))=σr+1(κ(f)) and
ι(α)=1σ2(κ(f)), the smallest r with Br(a)∈γ is
equal to the smallest r for which r∈J and
σr+1(κ(f))⪯1σ2(κ(f)): this is the content of
parts (a) and (b). We will see that ρ(B) depends on how many points of the
orbit of B(a) lie in the upper half of the circle, and part (c) of the lemma
enables us to calculate this. Finally, part (d) extends the ideas of (a)
and (b) to give conditions under which there is a periodic orbit of B,
disjoint from γ, above a periodic orbit of f.
Lemma 4.34**.**
Let f:[a,b]→[a,b] be a unimodal map with kneading sequence
κ(f)=μ, and let B:S→S be the corresponding outside map.
Write
[TABLE]
(a)
Suppose that σr+1(μ)≻1σ2(μ) for all
r∈J. Then N(f)=∞, provided that c is not a periodic point
of f.
2. (b)
Otherwise, let r be least such that r∈J
and σr+1(μ)⪯1σ2(μ). Then N(f)=r,
provided that fi(a)=c for 1≤i<r.
3. (c)
For each N≤N(f) we have
[TABLE]
provided that fi(a)=c for 1≤i<N(f).
4. (d)
Suppose that f has a period N point x whose orbit does not
contain c; and that ι(x)=W∞, where W=10V012j+1 for
some j≥0 and some word V of length N−2j−4. Suppose, moreover,
that whenever σi(W∞)=012k+1ν for some k≥0 and
ν∈{0,1}N, we have ν≻1σ2(μ). Then xu
is a period N point of B whose orbit is disjoint from γ.
Proof.
By (3) we have τ(Br(a))=fr(a) for r≤N(f), so that
Br(a) is either fr(a)ℓ or fr(a)u when r≤N(f). By the
definition (2) of the outside map we have that, for 1≤r≤N(f),
[TABLE]
Provided that fr−1(a)=c for r≤N(f) (so that there is no
ambiguity in the corresponding entries of μ) it follows that, for r≤N(f), we have Br(a)=fr(a)u if and only if there is some k≥0 with
fr−2k−2(a)<c and fj(a)>c for r−2k−1≤j<r (there is an odd
number of 1s in μ preceding the entry corresponding to fr(a)).
This in turn is equivalent to the existence of k≥0 such that
σr−(2k+1)(μ)=012k+1σr+1(μ). By definition of
J we therefore have, under the assumption that fr−1(a)=c for
1≤r≤N(f),
[TABLE]
(a)
If c is not a periodic point of f then fr(a)=c for all
r≥0. Since σr+1(μ)≻1σ2(μ)=ι(α)
whenever r∈J we have fr(a)>α whenever
Br(a)=fr(a)u (note that α has a unique itinerary since
fr(α)=fr(a)=c for all r≥1). Therefore
Br(a)∈γ for all r≥1, i.e. N(f)=∞ as required.
2. (b)
Let r be least such that r∈J and
σr+1(μ)⪯1σ2(μ), and suppose that
fi(a)=c for 1≤i<r. As in (a), we have Bi(a)∈γ
for 1≤i<r. On the other hand, Br(a)=fr(a)u and
ι(fr(a))=σr+1(μ)⪯1σ2(μ)=ι(α). Therefore fr(a)≤α (in the borderline case
ι(fr(a))=σr+1(μ)=1σ2(μ) we have
μ=10(μ2μ3…μr1)∞, which is not periodic, so
that fr(a)=α by Convention 2.8 (b)). Hence
Br(a)∈γ, and N(f)=r as required.
3. (c)
The proof is similar to that of (a) and (b): the condition that
ν≻1σ2(μ) whenever
σi(W∞)=012k+1ν ensures that every point of the orbit
of xu which lies on the upper half of S is not in γ.
∎
It is clear from Lemma 4.34 that a key question is how
certain sequences compare with 1σ2(μ) in the unimodal order. The
next lemma, which contains and extends results of [21], addresses this
and related issues.
Lemma 4.35**.**
**
(a)
Let q=m/n∈Q∩(0,1/2). For each integer j with 1≤j≤m, the
word
[TABLE]
disagrees with the word
[TABLE]
within the shorter of their lengths, and is greater than it in the unimodal
order.
2. (b)
Let q=m/n∈Q∩(0,1/2) and μ∈KS(q). If μ=cqd for
some d∈{0,1}N, then d⪯1σ2(μ).
3. (c)
Let q=m/n∈Q∩(0,1/2) and μ∈KS(q)∖{rhe(q)}. Let ν∈{0,1}N be on the σ-orbit of (wq1)∞
and of the form ν=1k0… with k odd. Then ν≻1σ2(μ).
4. (d)
Let q∈(0,1/2) be irrational. Then for each integer j≥1 we have
[TABLE]
5. (e)
Let q∈(0,1/2) be irrational. Then for every N≥1 there is an
r≥1 such that κr+i(q)=κi(q) for 1≤i≤N; and
there is an s≥1 such that κs+1(q)=κ1(q)−1, and κs+i(q)=κi(q) for 2≤i≤N.
Proof.
Statements (a) and (b) are lemmas 7 and 8 of [21].
Statement (c) is closely related to lemma 9 of [21], whose hypotheses
allow μ to be rhe(q), and whose conclusion is that ν⪰1σ2(μ). It is easily shown that ν=1σ2(μ) is only
possible when μ=rhe(q). (The statements of lemmas 8 and 9 in [21]
have an additional hypothesis relevant to that paper, but this hypothesis is
not used in their proofs.)
To prove (d), observe that:
(i)
It is impossible to have 10κj(q)110κj+1(q)11…=10κ1(q)−1110κ2(q)11…, since then the sequence
(κi(q)) would be eventually periodic, and
limr→∞r∑i=1r(κi(q)+2) would be rational:
but this limit is equal to 1/q by (1).
2. (ii)
It is impossible to have 10κj(q)110κj+1(q)11…≺10κ1(q)−1110κ2(q)11…, since then there would
be some M such that
[TABLE]
Taking a rational approximation m/n to q with m≥M and
κi(m/n)=κi(q) for i≤M would give a contradiction to (a).
For (e), recall (Definition 2.16) that the κi(q) are defined by
intersections of a straight line Lq of slope q with lines of the
coordinate grid. Since Lq passes arbitrarily close to integer lattice
points below the lattice point, any initial segment of the sequence
(κi(q)) occurs infinitely often in the sequence; and since it passes
arbitrarily close to lattice points above the lattice point, the same is true
of the sequence in which κ1(q) is replaced by κ1(q)−1.
∎
Recall
(Lemma 2.22 (b)) that q(μ)=0 if and only if
μ=10∞, and that then f is of tent-like strict left endpoint type
by Definition 2.25, and μ=lhe(0) by
Definitions 2.23. In this case, by
Convention 2.8 (b) and the fact that μ is not periodic,
we have B(a)=a, and statements (a) and (b) are immediate, using
γ=[b,a]. We therefore assume in the remainder of the proof that
q(μ)∈(0,1/2).
Assume first that q=q(μ)=m/n is rational and f is not of early endpoint
type. We will suppose for the proof of (b)(i) that μ=lhe(q), so that
μ=cqd for some d∈{0,1}N by
Lemma 2.22 (c): a similar argument applies when
μ=lhe(q) (noting that in this case we have fn(a)=a∈γ, since
f is not of early endpoint type, so that it is only necessary to show that
Br(a)∈γ for 1≤r<n). In particular, if c is periodic then
it has period at least n+2 by Lemma 2.22 (c) (if
μ=(wq0)∞ then c is not a period n point by
Definition 2.4). Therefore fr(a)=c for r<n.
Recall that cq=10κ1(q)110κ2(q)11…110κm(q)1 is a word of length n+1. Defining J
by (11), the values of r≤n with r∈J are
[TABLE]
and the
corresponding itineraries νi=σri+1(μ) are
[TABLE]
Observe that this statement is true whether or not all of the κi(q)
are positive: if κi(q)>0, then
σri−(2k+1)(μ)=012k+1νi with k=0, while if
κi(q)=0 then this equality holds for some k>0.
Now Lemma 4.35 (a) gives νi≻1σ2(μ)
for 1≤i<m, while Lemma 4.35 (b) gives νm⪯1σ2(μ). Since rm=n, statement (b)(i) follows from
Lemma 4.34 (b).
Since B(γ)=B(a), it follows that B(a) is a period n point of B.
Therefore ρ(B) is the rotation number of this periodic point, which we now
determine.
Let π:R→S be a universal covering with fundamental
domain F=[0,1) and covering transformation group {x↦x+n:n∈Z} such that π(0)=π(1)=a, π(1/2)=b, and
π(x) is in the lower half of S for x∈[0,1/2]. Let B:R→R
be the lift of B with B(0)∈F. It follows from (2)
that B(x)∈F for x∈[0,1/2), while B(x)∈F+1 for x∈[1/2,1).
Now there are exactly m points on the periodic orbit containing B(a) which
lie in π([1/2,1)) by Lemma 4.34 (c). Therefore
ρ(B)=m/n, establishing (a) in the rational non-early endpoint case.
For (b)(ii), observe first that since Br(a)∈\accentset∘γ for 0≤r<n,
it follows from (3) that τ(Bn(a))=fn(τ(a))=fn(a).
Therefore Bn(a)=a⟺τ(Bn(a))=a⟺fn(a)=a, and similarly Bn(a)=αu⟺τ(Bn(a))=α⟺fn(a)=α (where, for the first equivalence, we use
that Bn(a)∈γ).
Now if μ=lhe(m/n) then, since f is not of early endpoint type, we
have fn(a)=a. Conversely, if fn(a)=a then fn−1(a)=b (since
μ=10∞, so that a has only one preimage), and hence fn(b)=b
and fn(c)=c. Therefore μ is a periodic kneading sequence of period n
and height m/n, and so is equal either to lhe(m/n) or to (wm/n0)∞
by Lemma 2.22 (c). However, since c itself is periodic,
the latter case is impossible (Definition 2.4).
If μ=rhe(m/n)=10(wm/n1)∞ then
ι(fn(a))=σn+1(μ)=(1wm/n)∞=1σ2(μ)=ι(α), so that fn(a)=α by Convention 2.8 (b).
Conversely, suppose that fn(a)=α. By the previous paragraph we have
μ=lhe(m/n), so that μ=cm/nd for some d∈{0,1}N by
Lemma 2.22 (c). Therefore
[TABLE]
so that d=(10κ1(m/n)−1110κ2(m/n)11…110κm(m/n)1)∞=(1wm/n)∞, and it follows that μ=cqd=10wm/n(1wm/n)∞=10(wm/n1)∞=rhe(m/n) as required.
For (b)(iii), write Λ=S∖⋃r≥0B−r(γ), and
suppose first that μ∈{lhe(m/n),rhe(m/n)}, so that
Bn(a)∈\accentset∘γ by (b)(ii). We need to show that Λ=P, where P
is a period n orbit of B. Since κ(f)≻lhe(q)=(wq1)∞, f
has a period n point x with this itinerary. By
Lemma 4.34 (d) and Lemma 4.35 (c)
(and the fact that (wq1)∞ only contains blocks of 1s of even length),
xu lies on a period n orbit P⊂Λ of B.
Since B is a monotone degree one circle map and the orbit of B(a) is an
attracting periodic orbit (as B is locally constant at Bn(a)), it only
remains to show that B has no other periodic orbits.
Suppose for a contradiction that B has another periodic orbit R, which must
be disjoint from γ, have period n, and have one point between each
pair of consecutive points of P. By (3), since R is disjoint
from γ, it lies above a periodic orbit of f. Now every point of P
and R in the upper half of S lies to the right of αu, and hence
of cu, so there is only one point of R which could lie either to the right
or to the left of c, namely the one between the two points of P which bound
an interval containing cℓ. Therefore the periodic orbit of f
corresponding to R contains a point y with either
ι(y)=ι(x)=lhe(m/n)=(wq1)∞, or
ι(y)=(wq0)∞=(10κ1(m/n)11…110κm(m/n))∞.
The former is impossible by Convention 2.8 (c), since
μ≻lhe(m/n); while the latter is impossible since ι(y) has an
isolated 1 and so cannot be the itinerary of a point in Λ (we would
have fn−1(y)<c, so the point of R above y=fn(y) would be yℓ;
but then B(yℓ)=f(y)u since y>c, and hence B(yℓ)∈γ since
f(y)<c). This contradiction completes the proof of (b)(iii) in the rational
interior case.
We next consider (b)(iii) in the case where μ=lhe(m/n), so that f is of
strict left endpoint type. In this case the period n orbit Q of a is
disjoint from \accentset∘γ, so that τ(Br(a))=fr(a) for all r≥0. As in the interior case, any other periodic orbit P of B must lie above a second period n orbit of f containing a point of itinerary lhe(m/n).
If f is of tent-like type, then there is no such periodic orbit, so that Q
is the only periodic orbit of B, and is semi-stable. Since a∈Q is stable
through γ, the orbit of any point of S eventually falls into γ.
If f is of quadratic-like type, then f has exactly one such periodic orbit,
and there is an unstable periodic orbit P of B above it by
Lemma 4.34 (d) and Lemma 4.35 (c).
The Bn-orbits of points on one side of a∈Q converge to a
through γ, and so enter γ; while those on the other side have
orbits which remain in the lower half of the circle, and so lie in Λ.
The proof of (b)(iii) when μ=rhe(m/n) is similar: in this case, since
κ(f) is not periodic, there is only one point of itinerary lhe(m/n),
which lies on the orbit of B(a) by Lemma 2.22 (d):
therefore the orbit of B(a) is the only periodic orbit of B, and since
αu lies on this orbit and is stable through γ, we have
Λ=∅. This completes the proof of (b).
For (c), assume that q=q(μ)=m/n and f is of early endpoint type, so
that μ=(wq1)∞ and fn(a)=a. There is therefore a non-trivial
fn-invariant subinterval J of I, containing a and fn(a), consisting
of all points with itinerary σ(μ). Now fn∣J:J→J is
increasing, since wq1 contains an even number of 1s, so that there is a
periodic point z=a in J with frn(a)→z as r→∞. By the
same argument as in the previous case, every x∈J has the property that
{Br(xℓ):r≥1} is disjoint from γ, and in particular B
has a periodic orbit Q, containing zℓ, which attracts the orbit
of B(a) and is disjoint from γ. The rotation number of this periodic
orbit is m/n by the same argument as in the previous case, and hence
ρ(B)=m/n. This establishes (c), and (a) in the early endpoint case.
For (d), and (a) in the irrational case, assume that q=q(μ) is
irrational, so that μ=10κ1(q)110κ2(q)11… by
Lemma 2.22 (a). That Br(a)∈γ for all r≥1 is immediate from Lemma 4.34 (a),
Lemma 4.35 (d), and the fact that c is not periodic. By
the same argument as in the rational case, using
Lemma 4.34 (c), we have
[TABLE]
since m
of the first ∑i=1m(κi(q)+2) points of the orbit of a lie in
[b,a). Therefore ρ(B)=q by (1).
To show that ⋃r≥0B−r(γ) is dense in S assume, for a
contradiction, that there is a non-trivial interval J=[x,y] in S whose
orbit is disjoint from γ. Neither a nor b is in J, since B(b)=a
and a∈γ. Therefore τ(x)=τ(y) and, since κ(f) isn’t
periodic, we have ι(τ(x))=ι(τ(y)). Therefore, if r is
least with ι(τ(x))r=ι(τ(y))r, then Br(J) contains
either cℓ or cu. In the former case we have
Br+2(J)∩γ=∅, and in the latter we have
Br(J)∩γ=∅, which is the required contradiction.
Finally, to show that the orbit of B(a) is dense in S∖⋃r≥0B−r(γ), observe that the ω-limit set ω(B(a),B)
contains both a and αu by Lemma 4.35 (e) and the fact
that distinct points have distinct itineraries. Let U be any interval in S
which contains a point of S∖⋃r≥0B−r(γ). Since it
also contains points of the dense set ⋃r≥0B−r(γ), there
is some r≥0 such that Br(U) contains a neighborhood either of a or
of αu, and hence contains the point BR(a) for some R>r. Therefore
BR−r(a)∈U as required.
∎
Corollary 4.36**.**
Suppose that R is dense in S, and that there is a
good chain of crosscuts for every y∈S. Then the prime end rotation
number of H:(T,I)→(T,I) is q(κ(f)).
Proof.
We have ρ(B)=q(κ(f)) by
Theorem 4.33 (a), since B is a factor of B by the
degree one semi-conjugacy y↦y0. The result follows from
Lemma 4.30.
∎
4.5. The irrational case
Let f:[a,b]→[a,b] be a unimodal map whose kneading sequence
μ=κ(f) has irrational height q=q(μ)∈(0,1/2). In this section
we determine the prime ends of (T,I).
We first use Theorem 4.33 to analyze the dynamics of the
natural extension B:S→S, showing that it is a Denjoy
counterexample (i.e. it has an orbit of wandering intervals). It is
straightforward to show that the landing set L=S
(Lemma 4.38), and that the locally uniformly landing
set R is the union of the interiors of the wandering intervals
(Lemma 4.42), the complement of R being a Cantor set Λ.
In particular, this establishes that R is dense in S.
Lemma 4.44 asserts the existence of a good chain of
crosscuts for every y∈S. Therefore, by Lemma 4.31,
the prime ends P(y) with y∈Λ are of the first kind, while
those with y∈Λ are of the first or second kind. We complete the
analysis by showing that these are of the second kind, and that in fact
I(P(y))=I when y∈Λ
(Lemma 4.45).
Let O={Br(a):r≥1} be the orbit of B(a), which is disjoint
from γ by Theorem 4.33. Since B(γ)=B(a),
and B is injective away from γ, the backwards orbit
{B−r(y):r≥0} of any point y∈S∖O is well-defined,
and is disjoint from γ except perhaps at its first point y. On the
other hand, the backwards orbits of points of O are ill-defined at one
point only: the preimage of B(a) is γ. The elements of S can
therefore be described straightforwardly.
Definitions 4.37** (Threads t(y,r) and t(y) in S).**
(a)
For every y∈γ and r∈Z, define t(y,r)∈S by
[TABLE]
2. (b)
For every y∈S∖⋃r∈ZB−r(γ), define
t(y)∈S by
[TABLE]
Every element y of S can be written in exactly one way as either
t(y,r) or t(y): y is of the form (13) if and only
if there is some (unique) r∈Z with Br(y)0∈γ, in which case
y=t(Br(y)0,−r); and y=t(y0) otherwise. We have
B(t(y,r))=t(y,r+1), and B(t(y))=t(B(y)).
Lemma 4.38**.**
L=S.
Proof.
t(y,r) is landing of level at most max(r,0) (it is landing
of level exactly max(r,0) if y∈\accentset∘γ, and of level [math] if y=a or
y=α), and t(y) is landing of level [math]. The result follows from
Corollary 4.14.
∎
Definition 4.39** (The gaps Gr).**
For each r∈Z, define the gapGr⊂S by
Gr={t(y,r):y∈γ}.
The gaps are compact intervals, since the functions y↦t(y,r) are homeomorphisms γ→Gr. Since B(Gr)=Gr+1 for
each r, and the Gr are mutually disjoint, the gaps form an orbit of
wandering intervals of B, which is therefore a Denjoy counterexample.
Remark 4.40**.**
The map π0:S→S defined by
π0(y)=y0 is continuous and surjective. Moreover,
π0(y)=π0(y′) for y=y′ if and only if y and y′
belong to the same gap Gr for some r>0. Therefore π0 is a monotone
circle map which collapses these gaps. It follows that threads are ordered
around S in the same way that points are ordered around S, except that
the points Br(a) of S for r>0 are blown up into gaps Gr.
Definition 4.41** (The set Λ).**
The set Λ⊂S is defined by
[TABLE]
Lemma 4.42**.**
Λ* is a Cantor set, and R=S∖Λ=⋃r∈Z\accentset∘Gr. In particular, R is dense
in S.*
Proof.
Λ is compact, and is perfect since it is the complement
of a union of open intervals with disjoint closures. To show that it is totally
disconnected, it is enough to show that ⋃r∈ZGr is dense in
S. To do this, let t(y) be a point in the complement of this set. By
Theorem 4.33 (d)(ii), there is a sequence yi→y
in S with Bri(yi)∈γ for some ri≥0. Then the sequence
t(Bri(yi),−ri)=⟨yi,B−1(yi),…⟩ in
⋃r∈ZGr converges to t(y)=⟨y,B−1(y),…⟩. (Note
that, for each k>0, when i is sufficiently large yi lies in a
neighborhood N of y which doesn’t contain any point Br(a) with r≤k,
so that B−r is well-defined and continuous in N for all r≤k.)
Each \accentset∘Gr is uniformly landing of level max(r,0), so
that ⋃r∈Z\accentset∘Gr⊂R. For the converse,
suppose that y∈Λ. Consider first the case where y is not a gap
endpoint, so that y=t(y) for some y∈S∖⋃r∈ZB−r(γ). By
Theorem 4.33 (d)(iii) there is a sequence ri→∞
of positive integers with Bri(a)→y. Then for any z∈\accentset∘γ,
(t(z,ri))i≥0=(⟨Bri(a),…,B(a),z,B−1(z),…⟩)i≥0
is a sequence converging to y which is not uniformly landing.
The proof in the case where y is a gap endpoint is similar. We have
y=t(e,r) where e=a or e=αu, and r∈Z. As in the proof of
Theorem 4.33 (d)(iii), there is a sequence ri→∞
with Bri(a)→e (and Bri(a)∈γ). Then for any
z∈\accentset∘γ, (t(z,ri+r))i≥0 is a sequence converging to y which
is not uniformly landing.
∎
We next show that there is a good chain of crosscuts for every y∈S. The
following notation will be convenient when defining chains of crosscuts.
Definition 4.43** (The crosscuts ξ′(J,s) and ξ(J,s)).**
Let J be an interval in S with endpoints
y1,y2∈L, and let s∈(0,∞). Write ξ′(J,s) for
the crosscut
[TABLE]
in (D,S∞); and ξ(J,s) for the crosscut
Ψ(ξ′(J,s)) in (T,I).
The requirement that y1,y2∈L is automatically satisfied in the
irrational case, but this definition will be used later in situations in which
L=S.
Lemma 4.44**.**
Let y∈S. Then there is a good chain of
crosscuts for y.
Proof.
We can assume that y∈R, i.e. that y∈Λ
(Remark 4.23 (c)), so that y is either a gap endpoint or is
in the complement of the gaps.
Case 1: y=t(y) for some y∈S∖⋃r∈ZB−r(γ), that is, y is in the complement
of the gaps. We construct crosscuts ξk′ in (D,S∞) inductively for k≥1.
(a)
Choose ϵk>0 small enough that if x,z∈I with
∣x−z∣<2ϵk then ∣fr(x)−fr(z)∣<1/2k for 0≤r≤k.
2. (b)
Pick a closed interval Jk⊂S with y in its interior, of length
less than ϵk, which is small enough that it doesn’t contain any of
the points Br(a) with 1≤r≤2k; and that Jk⊂Int(Jk−1)
if k>1. We may shrink Jk in step (c), and we do this in such a way that
y remains in its interior.
3. (c)
It follows that B−k is well-defined and continuous on Jk, and we
make Jk smaller if necessary in order to ensure that ∣τ(B−k(η))−τ(B−k(y))∣<ϵk for all η∈Jk. We shrink Jk again so
that its endpoints L and R are preimages of cu (which is possible by
Theorem 4.33 (d)(ii)). Let i and j be such that
Bi(L)=cu and Bj(R)=cu.
4. (d)
Let Jk be the interval in S, containing y, with endpoints
t(cu,−i)=⟨L,…⟩ and t(cu,−j)=⟨R,…⟩.
5. (e)
Set ξk′=ξ′(Jk,2k).
By Remark 4.40 and (b) above, the points v∈Jk are
exactly the following:
(i)
v=t(v)=⟨v,…⟩, for v∈Jk∖⋃r∈ZB−r(γ);
2. (ii)
v=t(Br(v),−r)=⟨v,…⟩ where v∈Jk and
Br(v)∈γ for some r≥0; and
3. (iii)
v=t(Y,r)=⟨Br(a),…⟩ where Y∈γ and Br(a)∈Jk for some r>2k.
In particular, Jk⊂IntJk−1 when k>1, so
that (ξk′) is a chain of crosscuts in (D,S∞).
(ξk′) satisfies conditions (a) and (b) of Definition 4.22,
so, since L=S, it only remains to show that diam(ξk)→0 as
k→∞, where ξk=Ψ(ξk′). To do this we will show that for
all x∈ξk we have ∣xk−τ(B−k(y))∣<ϵk. It will
follow that if x,z∈ξk we have ∣xk−zk∣<2ϵk, so that
∣xr−zr∣<1/2k for all r≤k by choice of ϵk, establishing the
result.
Consider first points x=Ψ(v,2k)∈Ψ(Jk×{2k}).
By (8) we have xk=fk−1(H(v2k,1/2)), and
H(v2k,1/2)=Υ∘f(v2k,1/2)=τ(B(v2k)) by (U1) of
Definition 3.2. Therefore
[TABLE]
where we use (3) together with the fact that
vr∈\accentset∘γ for 0≤r≤2k.
By (i) – (iii) above, every v∈Jk satisfies v0∈Jk, so that
[TABLE]
by (c) as required.
Now consider points x=Ψ(t(cu,−i),s) or x=Ψ(t(cu,−j),s) with s∈[2k,∞]. Since t(cu,−i) and
t(cu,−j) are landing of level 0 and s>k,
Lemma 4.13 gives xk=τ(B−k(L)) or xk=τ(B−k(R)), and the argument goes through as
before.
Case 2: y=t(e,r) (with e=a or e=αu), i.e. y is an endpoint of Gr for some r. Choose Jk to have one endpoint
t(cu,−i) as above, and the other endpoint t(vk,r), where (vk) is
a sequence in \accentset∘γ converging to e. Then diam(ξk∩Ψ(Gr×[0,∞])) converges to [math] since Ψ∣Gr×[0,∞] is a
homeomorphism; while
diam(ξk∖Ψ(Gr×[0,∞]))
converges to [math] by the same argument as in case 1.
∎
It follows from Theorem 4.28 and
Lemma 4.31 that P:S→P is a homeomorphism;
that the prime end P(y) is of the first kind if y∈Λ; and
that Π(P(y))={ω(y)} for all y. It therefore only remains
to calculate the impressions of the prime ends P(y) for y∈Λ.
Lemma 4.45**.**
I(P(y))=I* for all y∈Λ.*
Proof.
By Theorem 4.28 (b), P=P(y) is defined by
the chain (Ψ(ξk′)), where (ξk′) is the good chain of crosscuts
constructed in the proof of Lemma 4.44. Write ξk=Ψ(ξk′) and Uk=U(ξk). Fix k, and any element x∈I. We
show that x∈Uk, which will establish the result. We use the
notation of the proof of Lemma 4.44.
By Lemma B.1 in Appendix B, there is
some N with fN([a,c])=I. For each i≥1 there exists, by
Theorem 4.33 (d)(iii), an integer ri>i+N with
Bri(a)∈Jk, so that Gri⊂Jk. Since ri−i>N, there is
some z∈[a,c] with fri−i(z)=xi. Then t(zu,ri)∈Gri⊂Jk, and by Corollary 4.14 we have
ω(t(zu,ri))i=fri−i(τ(zu))=xi.
Therefore ω(t(zu,ri))→x as i→∞: since all points of
this sequence are in Uk, we have x∈Uk as
required.
∎
The following theorem provides a summary of what we have proved in the
irrational case.
Theorem 4.46** (Prime ends in the irrational case).**
Let f be a unimodal map satisfying the
conditions of Convention 2.8, and suppose that f is of
irrational type. Then
(a)
There is a Cantor set of prime ends of (T,I) of the second kind,
for which the impression is I. All of the other prime ends are of the
first kind.
2. (b)
The prime end rotation number is q(κ(f)).
Remark 4.47**.**
By Theorem 4.28 (d), the set of accessible
points of I is precisely {ω(y):y∈S}. This set is
partitioned into countably many compact arcs ω(Gr) for r∈Z, and
uncountably many points ω(t(y)) for y∈S∖⋃r∈ZB−r(γ).
4.6. The rational interior case
Let f:[a,b]→[a,b] be a unimodal map whose
kneading sequence μ=κ(f) has rational height
q=q(μ)=m/n∈(0,1/2); and suppose that (wq0)∞≺μ≺rhe(q), so that f is of rational interior type. In this section we
determine the prime ends of (T,I).
By Theorem 4.33 (b)(i) we have that Br(a)∈γ
for 1≤r<n, and Bn(a)∈γ. Therefore B(a) is a period n point
of B, whose orbit Q contains a single point of γ. There is a
corresponding period n orbit Q of the natural extension
B:S→S. By Theorem 4.33 (b)(iii), B has
exactly one other periodic orbit P, which has period n and is disjoint
from γ; and therefore B has exactly one other periodic orbit P,
of period n.
After describing the threads of S, we will show that the points of Q
are not landing, and that every other point of S is locally uniformly
landing, so that R is dense in S
(Lemma 4.52). We then construct good chains of
crosscuts for each y∈S (Lemma 4.59).
In the irrational case the construction of the good chains was rather ad hoc;
here, by contrast, there are natural choices for the crosscuts about the points
of Q, which form an invariant system of subsets of stable sets
(Lemmas 4.56 and 4.57).
By Lemma 4.31, all of the prime ends P(y) with
y∈Q are of the first kind. We show that if y∈Q then
I(P(y))=I (Lemma 4.60); and that
Π(P(y)) is equal to I except in the case where f can be subjected
to a particular type of renormalization, in which case Π(P(y)) is
homeomorphic to the inverse limit of the renormalized map
(Lemmas 4.61
and 4.62). Therefore these prime ends may be of
either the third or the fourth kind.
Write qi=Bi+1(a) for 0≤i≤n−1. By
Theorem 4.33 (b)(ii) we have qn−1∈{a,αu},
so that qn−1∈\accentset∘γ, while the other qi are not in γ. We have
B(qi)=qi+1modn for each i, so that Q={q0,q1,…,qn−1}
is a period n orbit of B. Since B−1 is well defined on
S∖{q0}, the backwards orbit {B−r(y):r≥0} of any
point y∈S∖Q is well-defined. Moreover, B−r(y)∈γ
for all r≥1 for such points y.
Since ρ(B)=m/n, there are m−1 points of Q in each interval
(qi,qi+1modn), and the first point of Q which is encountered when
moving counterclockwise around S from qi is qi+m−1modn.
Write p0 for the point of P between q0 and qm−1modn, and
pi=Bi(p0) for 1≤i≤n−1.
Definitions 4.48** **(Threads qi, pi, and t(y,k,i) in S; the
periodic orbits Q and P).
(a)
For each 0≤i≤n−1, define qi,pi∈S by
[TABLE]
2. (b)
For each y∈γ∖{qn−1}, k∈Z, and 0≤i≤n−1,
define t(y,k,i)=Bkn+i(⟨q0,y,B−1(y),…⟩)∈S, so that
[TABLE]
Write Q={q0,…,qn−1} and P={p0,…,pn−1}, period n orbits of B.
Every element y of S can be written in exactly one way as qi,
pi, or t(y,k,i). To see this, observe that the set
Z(y)={r∈Z:B−(r+1)(y)0∈γ} is empty if and only if
y∈P, and is not bounded above if and only if y∈Q. For any other
y∈S, let R=maxZ(y), and let y=B−(R+1)(y)0∈γ.
Then y=t(y,⌊R/n⌋,Rmodn).
Definitions 4.49** (The intervals Lk,i and Rk,i).**
For each k∈Z and 0≤i≤n−1, define
subsets Lk,i and Rk,i of S by
[TABLE]
These subsets partition S∖(Q∪P), and are half-open intervals
since y↦t(y,k,i) defines homeomorphisms (qn−1,a]→Lk,i and
[αu,qn−1)→Rk,i.
The following lemma, which describes the ordering of the intervals Lk,i,
and Rk,i around the circle S, is illustrated by
Figure 10.
Lemma 4.50**.**
Let 0≤i≤n−1, and write
j=i−m−1modn.
(a)
For each k∈Z, the open endpoint of Lk,i (respectively
Rk,i) is equal to the closed endpoint of Lk+1,i (respectively
Rk+1,i).
2. (b)
As k→∞ we have Lk,i→qi and Rk,i→qi; while as k→−∞ we have Lk,i→pi and
Rk,i→pj.
Proof.
(a) is a straightforward computation of the open endpoints
of the intervals, using the facts that B−1(y)→a as y→q0 through
(q0,b), and B−1(y)→αu as y→q0 through (a,q0). For (b),
the limits as k→∞ are immediate from (15) and those as
k→−∞ from the choice of labeling of the pi (and hence of the
pi).
∎
Remark 4.51**.**
For each y∈γ∖{qn−1},
k∈Z, and 0≤i≤n−1 we have
[TABLE]
Therefore
[TABLE]
and analogously for B(Rk,i).
Lemma 4.52**.**
R=L=S∖Q. In particular,
R is dense in S.
Proof.
Points of Lk,i and Rk,i are landing of level max(kn+i+1,0), and
points of P are landing of level 0. Therefore, by
Lemma 4.50, every point of S∖Q has a
uniformly landing neighborhood, so that S∖Q⊂R⊂L.
We next show that qn−1∈L (and hence qn−1∈R).
Write θ=min(fn(a),fn(a))∈(a,c], and let x and z
be any two distinct elements of [a,θ]. By
Lemma B.2 (a), if μ⪯wq0(wq1)∞ then
fn([a,θ))=[a,θ]; and by Lemma B.2 (b), if
μ≻wq0(wq1)∞ then there is some N with fN([a,θ))=[a,b],
so that fN+i([a,θ))⊃[a,θ] for all i≥0. Hence in
either case there are sequences (x(k)) and (z(k)) in [a,θ)
with fkn(x(k))=x and fkn(z(k))=z for all sufficiently
large k.
Since x(k)∈[a,θ) and θ≤c, we have f(a)≤f(x(k))<f(θ)=fn+1(a), and hence, by
Definition 3.2, there is some v1(k)∈[1/2,ϕ−1(fn+1(a))] with ϕ(v1(k))=f(x(k)). Since
τ(qn−1)=fn(a), it follows from (U3) and (U4) of
Definition 3.2 that f(qn−1,v1(k))=(f(x(k))ℓ,v1(k)), and hence that H(qn−1,v1(k))=f(x(k)). Similarly, there is a sequence (v2(k)) in [1/2,1) with
H(qn−1,v2(k))=f(z(k)) for each k.
By (8) we have that, for sufficiently large k,
Rqn−1(kn+2v1(k)−1)0=fkn(x(k))=x and similarly
Rqn−1(kn+2v2(k)−1)0=fkn(z(k))=z. Therefore
Rqn−1 does not land, so that qn−1∈L as required.
Since Hi+1 maps Rqn−1 onto Rqi for 0≤i<n−1, it
follows that qi∈L for all i.
∎
For future reference, we record the landing points corresponding to the
elements t(y,k,i) of S with k≥0 which are given, using
(10) together with t(y,k,i)∈Lkn+i+1 and
t(y,k,i)kn+i+1=y, by
[TABLE]
We next define some good chains of crosscuts for each qi. The class of
crosscuts which we use is introduced in Definition 4.54,
and it will be shown in Lemma 4.59 how these
combine to give good chains.
Definitions 4.53** (y, min(y,y).).**
For each y∈γ, denote by
y the “symmetric” element of γ satisfying
(a)
f(τ(y))=f(τ(y)), and
2. (b)
y=y unless y=cu.
We set min(y,y)=y if y∈[cu,a], and min(y,y)=y
otherwise. (This convention is so that τ(min(y,y))=min(τ(y),τ(y))).
Definition 4.54** (The crosscuts Γ′(y,k,i) and Γ(y,k,i)).**
For each y∈(cu,a]∖{min(qn−1,qn−1)}, each k∈Z,
and each 0≤i≤n−1, we define a crosscut Γ′(y,k,i) in (D,S∞) by
[TABLE]
where u(y) is given by Definition 4.4 and ξ′(J,s) is as in
Definition 4.43. Here [t(y,k,i),t(y,k,i)] is the interval in S with the given endpoints which is
disjoint from P.
We define Γ(y,k,i)=Ψ(Γ′(y,k,i)), a crosscut in (T,I).
Remark 4.55**.**
(qi,∞)∈U(Γ′(y,k,i)) if and only if y∈(min(qn−1,qn−1),a]. See Figure 11.
Lemma 4.56**.**
For each
y∈(cu,a]∖{min(qn−1,qn−1)}, each k∈Z, and each
0≤i≤n−1, we have Γ(y,k,i)=Hkn+i(Γ(y,0,0)).
Proof.
By Corollary 4.10 we have
Hkn+i(Γ(y,0,0))=Ψ(Gkn+i(Γ′(y,0,0)),
where G:D→D is given (see Definition 4.1) by
G(y,s)=(B(y),λ(s)). Now Gkn+i(Γ′(y,0,0))=Γ′(y,k,i) by
Remark 4.51 and the fact that λ(s)=s+1 for
s≥1 and λ(s)=2s for s<1. The result follows.
∎
The following is a key lemma for the remainder of the paper. It implies, in
particular, that each crosscut Γ(y,k,i) is contained in a stable set
for H; and hence, by Lemma 4.56, that
diam(Γ(y,k,i))→0 as k→∞.
Lemma 4.57**.**
Let y∈(cu,a]∖{min(qn−1,qn−1)}, k≥0, and 0≤i≤n−1. Then every x∈Γ(y,k,i)
has xkn+i=f(τ(y)).
Proof.
In view of Lemma 4.56, we need only show that
every x∈Γ(y,0,0) has x0=f(τ(y)). Now
[TABLE]
(a)
Since t(y,0,0)1=y and t(y,0,0)1+i∈\accentset∘γ for all i≥1, Lemma 4.20 gives that Ψ(t(y,0,0),s)0=f(τ(y)) for all s≥1+u(y); similarly Ψ(t(y,0,0),s)0=f(τ(y))=f(τ(y)) for all s≥1+u(y).
2. (b)
It remains to show that Ψ(y,1+u(y))0=f(τ(y)) for all
y∈[t(y,0,0),t(y,0,0)]. Now in the case y∈(min(qn−1,qn−1),a] we have, by Lemma 4.50,
[TABLE]
while in the case y∈(cu,min(qn−1,qn−1)) we have
[t(y,0,0),t(y,0,0)]={t(y′,0,0):y′∈[y,y]}.
If y′∈[y,y] with y′=qn−1 then
[TABLE]
as required. Here the first equality
uses (8) and that (1+u(y))/2=ϕ−1(f(τ(y))),
while the second uses Lemma 4.5 and the fact that u(y)≤u(y′),
since y′∈[y,y].
On the other hand, if we are in the case y∈(min(qn−1,qn−1),a], and
if y=q0 or y is in Lk,0 or Rk,0 for some k≥1, then
y1=qn−1, and (8) and Lemma 4.5 give
[TABLE]
as required, since ϕ−1(f(τ(y)))≤u(qn−1).
∎
Remark 4.58**.**
There are two connected components of dotted lines on
Figure 11, which are limits of the crosscuts Γ′(y,k,i).
One is the arc {t(cu,k,i)}×[kn+i+2,∞], and the other is the union of the crosscut
ξ′([t(qn−1,k,i),t(a,k+1,i)],kn+i+1+u(qn−1)) and the
crosscut ξ′([t(qn−1,k,i),t(αu,k+1,i)],kn+i+1+u(qn−1)),
each interval in S being the one which contains qi.
By the continuity of Ψ on D, every point (y,s) of the former has
Ψ(y,s)kn+i=f(τ(cu))=b, and every point (y,s) of the latter
has Ψ(y,s)kn+i=f(τ(qn−1))=fn+1(a).
Lemma 4.59**.**
**
(a)
Let 0≤i≤n−1. For every sequence (y(k)) in
(min(qn−1,qn−1),a], the sequence (Γ′(y(k),k,i))k≥0
satisfies conditions (a) – (c) of Definition 4.22 (of a
good chain of crosscuts for qi).
2. (b)
Let y∈S. Then there is a good chain of crosscuts for y.
Proof.
The sequence (Γ′(y(k),k,i))k≥0 is a chain of crosscuts in
(D,S∞) which satisfies condition (a) of
Definition 4.22 by Lemma 4.52; it
satisfies condition (b) by Lemma 4.50 (see
Remark 4.55); and it satisfies condition (c) by
Lemma 4.57, which gives that diam(Γ(y,k,i))≤∣b−a∣/2kn+i.
For part (b) of the lemma, it suffices by Remark 4.23 (c) to
find a good chain of crosscuts for each qi; that is, to show that we can
choose the sequence (y(k)) in such a way that (Γ(y(k),k,i))k≥0 does not converge to a point of I. The argument is similar to
that used in the proof of Lemma 4.52.
Pick two distinct points x,z∈[a,min(τ(qn−1),τ(qn−1)))=[a,θ), where θ=min(fn(a),fn(a)). By Lemma B.2, there are
sequences (x(k)) and (z(k)) in [a,θ) with
fkn(x(k))=x and fkn(z(k))=z for all sufficiently large k.
Since x(k),z(k)∈[a,θ) we have xu(k),zu(k)∈(min(qn−1,qn−1),a] for each k. Then, by
Lemma 4.57, every x∈Γ(xu(k),k,i) has xi+1=x, and
every x∈Γ(zu(k),k,i) has xi+1=z, provided that k
is sufficiently large.
Choosing y(k)=xu(k) when k is even, and y(k)=zu(k) when k
is odd therefore gives a good chain of crosscuts.
∎
It follows from Theorem 4.28 and
Lemma 4.31 that P:S→P is a homeomorphism,
and that the prime end P(y) is of the first kind for all y∈Q.
It therefore only remains to calculate the principal sets and impressions of
the prime ends P(qi). We will do this for P(qn−1): the
analogous results for the other P(qi) follow on observing that
P(qi)=Hi+1(P(qn−1)) for each i by Lemmas 4.56
and 4.59.
Lemma 4.60**.**
Let f be of rational interior type, with
q(κ(f))=m/n. Then I(P(qn−1))=I.
Proof.
By Theorem 4.28 (b) and
Lemma 4.59, P(qn−1) is defined by the
chain (Γ(a,k,n−1))k≥0, so it suffices to show that for every fixed
x∈I and k≥0, we have x∈U(Γ(a,k,n−1)).
By Lemma B.1 there is some N (which we take to be at
least 3) with fN([a,α])⊃fN([a,c])=[a,b]. For each j with jn≥N, we can therefore choose z(j)∈[a,α]∖{τ(qn−1)} with
fN(z(j))=xjn−N. (If xjn−N=fN(τ(qn−1)) then we also have
xjn−N=fN(τ(qn−1)), and either
τ(qn−1)=τ(qn−1) or xjn−N=fN(c). In the latter case we
have xjn−N=fN−2(a)=fN−2(α), and since α has two f-preimages
there is some z(j)=c with fN(z(j))=xjn−N.)
For each such j, let
[TABLE]
which is landing of level jn. By (17) we have
ω(y(j))jn−N=fN(z(j))=xjn−N, so that
ω(y(j))→x as j→∞. Since (y(j),∞)∈U(Γ′(a,k,n−1) for all j>k, we have
ω(y(j))∈U(Γ(a,k,n−1)) for all j>k, and hence
x∈U(Γ(a,k,n−1)) as required.
∎
Lemma 4.61**.**
Let f be of rational interior type,
with q(κ(f))=q=m/n. If κ(f)≻wq0(wq1)∞ then
Π(P(qn−1))=I.
Proof.
Let x∈I. We show that x∈Π(P(qn−1)) by
exhibiting a chain of crosscuts defining P(qn−1) which converges
to x.
By Lemma B.2 (b), there is some N∈N with
fN([a,θ))=[a,b], where θ=min(fn(a),fn(a)). For each k with kn≥N, pick z(k)∈[a,θ)
with fN(z(k))=xkn−N. Since z(k)∈[a,θ) we have
zu(k)∈(min(qn−1,qn−1),a] for each k. Therefore, by
Lemma 4.59 (a), P(qn−1) is
defined by the chain (Γ(zu(k),k−1,n−1))k≥N/n.
By Lemma 4.57, every v∈Γ(zu(k),k−1,n−1) has
vkn−1=f(z(k)), and hence vkn−N=xkn−N. Therefore
Γ(zu(k),k−1,n−1)→x as k→∞ as required.
∎
Lemma 4.62**.**
Let f be of rational interior type, with
q(κ(f))=q=m/n. If κ(f)⪯wq0(wq1)∞ then
Π(P(qn−1))={x∈I:xℓn∈[a,fn(a)] for all ℓ≥0}.
Proof.
This is a consequence of Lemma B.2 (a),
which states that fn([a,fn(a)))=[a,fn(a)] whenever (wq0)∞≺κ(f)⪯wq0(wq1)∞.
Write X={x∈I:xℓn∈[a,fn(a)] for all ℓ≥0}. To
show that X⊂Π(P(qn−1)), we exhibit, for each x∈X, a
chain of crosscuts defining P(qn−1) which converges to x. By
Lemma B.2 (a), fn(a)u=min(qn−1,qn−1), and
for each k≥0 there is some z(k)∈[a,fn(a)) with
fn(z(k))=xkn. By Lemma 4.57, every
v∈Γ(zu(k),k,n−1) has v(k+1)n−1=f(z(k)), and hence
vkn=xkn. Therefore (Γ(z(k),k,n−1))k≥0 is a chain of
crosscuts defining P(qn−1) which converges to x.
To show that Π(P(qn−1))⊂X, it is enough, by
Theorem 4.28 (c), to show that Rem(Rqn−1)⊂X.
To do this, we fix ℓ≥0 and show that Rqn−1(s)ℓn∈[a,fn(a)] for all s≥ℓn+1.
We therefore fix s≥ℓn+1, and write P(s)=(t,v). Recalling that
qn−1=⟨(qn−1,…,q0)∞⟩, using (8), and
abbreviating Rqn−1 to R:
(a)
If t=rn for some r≥ℓ+1 then
[TABLE]
Since fn−1([f(a),fn+1(a)])=[a,fn(a)] by
Lemma B.2 (a), we have R(s)(r−1)n∈[a,fn(a)], and
hence R(s)ℓn∈[a,fn(a)] as required.
2. (b)
If t=rn+i for some r≥ℓ and 1≤i≤n−1 then
[TABLE]
since qn−1−i∈\accentset∘γ. Therefore R(s)rn=fn(a), and hence
R(s)ℓn∈[a,fn(a)] as required.
∎
Remark 4.63**.**
Since P(qi)=Hi+1(P(qn−1)) for 0≤i<n−1, it follows that, whenever we have (wq0)∞≺κ(f)⪯wq0(wq1)∞,
[TABLE]
These principal sets are therefore homeomorphic to the inverse limit
lim([a,fn(a)],fn) of the renormalized map.
The following theorem provides a summary of what we have proved in the rational
interior case.
Theorem 4.64** (Prime ends in the rational interior case).**
Let f be a unimodal map satisfying the
conditions of Convention 2.8, and suppose that
q(κ(f))=m/n∈(0,1/2) is rational, and that
κ(f)∈{lhe(m/n),(wm/n0)∞,rhe(m/n)}. Then
(a)
All except n of the prime ends of (T,I) are of the first kind;
2. (b)
If κ(f)⪯wm/n0(wm/n1)∞, then the n remaining
prime ends are of the fourth kind, with principal set lim([a,fn(a)],fn) and impression I;
3. (c)
If κ(f)≻wm/n0(wm/n1)∞, then the n remaining prime
ends are of the third kind, with principal set and impression I; and
4. (d)
The prime end rotation number is m/n.
∎
Remark 4.65**.**
By Theorem 4.28 (d), the set of accessible
points of I is precisely {ω(y):y∈S∖Q}. This
set is partitioned into n immersed copies of the line.
4.7. The rational endpoint case
We finish by considering the rational endpoint case,
where
μ=κ(f) has rational height q=q(μ)∈(0,1/2) and
μ=lhe(q), μ=rhe(q), or μ=(wq0)∞; or where q=0. The
following theorem summarizes this case.
Theorem 4.66** (Prime ends in the rational endpoint case).**
Let f be a unimodal map satisfying the
conditions of Convention 2.8, and suppose that
q(κ(f))=m/n∈[0,1/2) is rational, and that κ(f)∈{lhe(m/n),(wm/n0)∞,rhe(m/n)}. Then
(a)
All except n of the prime ends of (T,I) are of the first kind;
2. (b)
The n remaining prime ends are of the second kind, with
impression I; and
3. (c)
The prime end rotation number is m/n.
The arguments in the four cases where f is of early endpoint, normal
endpoint, quadratic-like strict left endpoint, or late endpoint type are
different, and we consider each of them briefly in turn, pointing out how they
differ from similar arguments in the rational interior and irrational cases,
and leaving the reader to fill in some details.
4.7.1. The normal endpoint case
In this case either μ=lhe(m/n)
and Bn(a)=a, or μ=rhe(m/n) and Bn(a)=αu; and the orbit
of B(a) is the only periodic orbit of B. We will consider the case where
μ=lhe(m/n): the other case can be treated in exactly the same way. Minor
modifications are needed in the particular case m/n=0 (i.e. when
μ=10∞): we will assume that m/n>0.
The analysis starts in the same way as the rational interior case. We write
qi=Bi+1(a) for 0≤i≤n−1, so that Q={q0,q1,…,qn−1} is
a period n orbit of B, with qn−1=a∈γ. Threads qi and
t(y,k,i) in S, and the periodic orbit Q of B, are introduced
exactly as in Definitions 4.48.
Intervals Rk,i can then be constructed as in
Definitions 4.49. However, since qn−1=a, the
intervals Lk,i of the rational interior case are empty. This means that
the intervals Rk,i converge to qi as k→∞, and to qj as
k→−∞, where j=i−m−1modn
(Figure 12).
Since the threads qi do not contain any entries from \accentset∘γ, the points
of Q are landing of level 0, and hence L=S. On the other hand,
R=S∖Q, since the interior points of Rk,i are not landing
of any level less than kn+i+1.
The construction of good chains of crosscuts for each qi is reminiscent of
the irrational gap endpoint case.
Lemma 4.67**.**
Let 0≤i≤n−1.
Write V=⋃k<0Rk,i+m−1modn, and let (y(k))
be any sequence in V which converges strictly monotonically to qi. For
each k≥1, let Jk be the interval in S with endpoints y(k)
and t(αu,k,i) which contains qi. Let
[TABLE]
Then (ξk′) is a good chain of crosscuts
for qi.
Proof.
Conditions (a) and (b) of Definition 4.22 are
immediate, and condition (d) is vacuous. It is therefore only necessary to show
that diam(ξk)→0 as k→∞, where ξk=Ψ(ξk′).
We have diam(ξk∩Ψ(V×[0,∞]))→0, since Ψ is continuous on V×[0,∞] by Lemma 4.17. To show that the
diameters of the remaining parts of ξk go to zero, we will show that
every x belonging to the arc Ψ({t(αu,k,i)}×[nk+i,∞]) or to the arc Ψ((Jk∖V)×{nk+i}) has
xnk+i−1=τ(q1).
For the former, we have Ψ(t(αu,k,i),s)nk+i−1=τ(t(αu,k,i)nk+i−1)=τ(q1) for all s≥nk+i by
Lemma 4.13, since t(αu,k,i) is landing of
level 0 (and hence of level nk+i−1).
For the latter, observe that if y∈Jk∖V then y=⟨qi,…,q0,(qn−1,…,q0)k,…⟩ and so ynk+i=q0.
Therefore, by (8), Ψ(y,nk+i)nk+i−1=H(q0,1/2)=τ(q1) as required.
∎
It follows from Theorem 4.28 and
Lemma 4.31 that P:S→P is a homeomorphism;
that the prime end P(y) is of the first kind for all y∈Q; and
that Π(P(y))={ω(y)} is a point for y∈Q. It therefore
only remains to calculate the impressions of the prime ends P(qi). The
proof of the following result works in exactly the same way as that of
Lemma 4.60, using the chain of crosscuts from
Lemma 4.67 in place of the chain (Γ(a,k,n−1))k≥0.
Lemma 4.68**.**
Let f be of normal endpoint type, with q(κ(f))=m/n. Then
I(P(qn−1))=I. ∎
4.7.2. The quadratic-like strict left endpoint case
In this case μ=lhe(m/n) and Bn(a)=a, but B has a second period n
orbit P in addition to the orbit of B(a). As in the rational interior case,
we write qi=Bi+1(a) for 0≤i≤n−1, p0 for the point of P
between q0 and qm−1modn, and pi=Bi(p0) for 1≤i≤n−1.
Threads qi, pi, and t(y,k,i) in S, and the periodic orbits
Q and P of B are introduced exactly as in
Definitions 4.48. However, since the B-orbits of
points in each interval (qi,pi] are disjoint from γ, there are
threads
[TABLE]
in S (with t(pi)=pi). We write Ii={t(y):y∈(qi,pi]} for 0≤i≤n−1, half-open intervals in S with
B(Ii)=Ii+1modn. Defining half-open intervals Rk,i as in
Definitions 4.49, the intervals are arranged around S
as depicted in Figure 13 (where j=i−m−1modn).
The remainder of the analysis proceeds exactly as in the normal endpoint case,
except that in the statement of Lemma 4.67 we
take V=Ii rather than V=⋃k<0Rk,i+m−1modn.
4.7.3. The late endpoint case
Here q=m/n>0 and μ=(wq0)∞. In this case qn−1=Bn(a)∈\accentset∘γ
by Theorem 4.33 (b)(ii), and the treatment is identical
to that of the rational interior case up until
Lemma 4.52. Here, because
Lemma B.2 doesn’t apply when κ(f)=(wq0)∞, the
proof that L=S∖Q breaks down. Instead we have:
Lemma 4.69**.**
Let f be of late endpoint type. Then
L=S.
Proof.
The points a and fn(a) are distinct, but both have itinerary
σ((wq0)∞). Since wq0 is a word of length n with an odd number
of 1s, fn∣[a,fn(a)] is decreasing, with a<f2n(a)<fn(a). There is
therefore a unique fixed point p of fn in [a,fn(a)]. Now the
increasing map f2n:[a,fn(a)]→[a,fn(a)] also has p as its
unique fixed point (any other fixed points would be period 2 points of fn
and so would come in pairs, contradicting Convention 2.8 (c)),
so that fkn(x)→p as k→∞ for every x∈[a,fn(a)].
Since every point of S∖Q is landing of some level, it is only
necessary to prove that the rays Rqi land. It is enough to show this
for i=n−1 since Rqi=Hi+1∘Rqn−1 for 0≤i≤n−2.
Fix r≥0 and let s≥r+1. Write P(s)=(t,v) and t=kn+i with 0≤i≤n−1: then (8) gives Ψ(qn−1,s)r=ft−1−r(H(qn−1−i,v)). If i=0 then H(qn−1−i,v)=τ(qn−i)=fn−i+1(a), so that Ψ(qn−1,s)r=f(k+1)n−r(a). On the other
hand, if i=0 then H(qn−1−i,v)∈[f(a),fn+1(a)] by
Definition 3.2, so that Ψ(qn−1,s)r=fkn−r(x) for some x∈[a,fn(a)].
Therefore Ψ(qn−1,s)r→fn−r(p) as s→∞. It follows
that
[TABLE]
so that qn−1∈L as required.
∎
Remark 4.70**.**
Thus, in the late endpoint case, the points of Q are landing, despite not
being landing of any level. This is the only case in which
L=⋃N≥0LN.
Since the interior points of Rk,i are not landing of any level less
than kn+i+1, the locally uniformly landing set is given by
R=S∖Q. The proof of
Lemma 4.59 (a) goes through without change to
show that (Γ′(a,k,i))k≥0 is a good chain of crosscuts for qi
(observing that condition (d) of Definition 4.22 is vacuous);
and the proof of Lemma 4.60 likewise carries over
to show that I(P(qn−1))=I.
4.7.4. The early endpoint case
In this case q=m/n>0 and μ=lhe(m/n), but
fn(a)=a. According to Theorem 4.33 (c)(ii), the
orbit O={Br(a):r≥1} is disjoint from γ, and is attracted
to a period n orbit Q⊂S∖γ of B: in particular,
B−r(y) is defined for all r≥0 provided that y∈O. There are
two possibilities: either Q is semi-stable and is the only periodic orbit
of B, in which case the backwards orbit {B−r(γ):r≥0}
of γ is attracted to Q; or Q is stable, and there is a repelling
period n orbit P⊂S∖γ of B, which attracts the
backwards orbit of γ.
The analysis initially follows that of the irrational case. Elements of S
can be written either as t(y,r), with y∈γ and r∈Z; or as
t(y) with y∈S∖⋃r∈ZB−r(γ), these threads
being defined exactly as in Definitions 4.37. It follows,
as in the proof of Lemma 4.38, that L=S. “Gaps”
Gr={t(y,r):y∈γ} can be defined as in
Definition 4.39.
The difference with the irrational case is that the gaps Gr converge as
r→∞ to the periodic orbit Q of B corresponding to Q; and
they converge as r→−∞ either to Q from the other side (in the case
where Q is the unique periodic orbit of B), or to the periodic orbit P
of B corresponding to P. Since Gr is uniformly landing of level
max(r,0), we have in either case that R=S∖Q.
The construction of a good chain of crosscuts for each point q of Q can
be carried out in exactly the same way as in the irrational case
(Lemma 4.44); and the proof that I(P(q))=I for
each such q is identical to the proof of
Lemma 4.45.
Remark 4.71**.**
By Theorem 4.28 (d), the set of accessible
points of I is precisely {ω(y):y∈S}. Since the landing
function ω is continuous from one side, but not from the other, at the
points of Q, the set of accessible points is partitioned into n immersed
copies of [0,∞).
5. Semi-conjugacy to sphere homeomorphisms
In this section we will prove (Theorem 5.19) that if {ft} is
a continuously varying family of unimodal maps, then there is a corresponding
family {χt:S2→S2} of sphere homeomorphisms such that each
χt is a factor of ft:It→It by a semi-conjugacy with
mild point preimages. In order to simplify the exposition, we start by treating
the case of a single unimodal map f (Theorem 5.15).
We will also show (Theorem 5.31) that if {ft} is a family of tent
maps, then χt is a generalized pseudo-Anosov map for those values
of t for which ft is post-critically finite (and is pseudo-Anosov
when ft is of NBT type). Therefore, in the tent map case, {χt} is a
completion of the family of generalized pseudo-Anosovs constructed
in [21].
In order to construct the semi-conjugacy, we will define a non-separating
monotone upper semi-continuous decomposition G of T, whose elements are
permuted by H, and each of which intersects I. By Moore’s
theorem [32], the quotient space Σ=T/G is again a sphere,
and F=H/G:Σ→Σ is a homeomorphism. Since each of the decomposition elements
intersects I, the natural projection T→Σ induces a surjection
I→Σ, which semi-conjugates f=H∣I to F.
To define the decomposition G, we first introduce the strongly stable
equivalence relation on D† (Definition 5.1). (Recall
that D†=D∪L∞⊂D is the maximal domain of Ψ.) The
idea is that a strongly stable component of T is a maximal connected
subset X of T with the property that, for all x(1),x(2)∈X, there is some N≥0 with HN(x(1))0=HN(x(2))0. A
consequence of this is that d(Hi(x(1)),Hi(x(2)))→0 as
i→∞, so that strongly stable sets are stable: the converse is not
true in general, since the unimodal map f may itself have non-trivial
connected stable sets. Now such a subset X may intersect I (and hence
leave the image of Ψ) many times. A strongly stable component of D†
is a component of the preimage Ψ−1(X). Our decomposition will be
based on these components.
In Lemmas 5.3, 5.5,
5.6, 5.7, and
5.8 we describe the structure of the strongly
stable equivalence classes for each of the types of unimodal map of
Definition 2.25. We then use these to construct a
decomposition G′ of D: one of the decomposition elements is the union
of ∂′ and all of the strongly stable equivalence classes whose closure
contains ∂′, while all of the other decomposition elements are single
strongly stable equivalence classes or single points not in D†. The
decomposition G is obtained by carrying over G′ with Ψ, and adding
single inaccessible points of I (which, by
Theorem 4.28 (d), are precisely the points which are not in the
image of Ψ).
A subset Y of D† is said to be strongly
stable if, for all η1,η2∈Y, there is some N≥0 such that
HN(Ψ(η1))0=HN(Ψ(η2))0.
The strongly stable component of η∈D† is the largest
connected strongly stable set which contains η (i.e. the union of all
such connected strongly stable sets).
Remarks 5.2**.**
(a)
Since G and H are topologically conjugate
(Corollary 4.10), the homeomorphism G:D†→D† permutes the strongly stable components.
2. (b)
{∂′} is a strongly stable component, since if (y,s)=∂′ then HN(Ψ(∂′))0=∂=HN(Ψ(y,s))0 for all N≥0.
5.1. Strongly stable components in the irrational and the rational early
endpoint cases
Recall from Section 4.5 that if f is of irrational type then
L=S, so that D†=D; that B:S→S is a Denjoy
counterexample, having an orbit {Gr:r∈Z} of wandering intervals;
and that the complement of the union of the interiors of these intervals is a
Cantor set Λ, which is the set of points which are not locally
uniformly landing.
If f is of rational early endpoint type (Section 4.7.4)
then the description is the same as in the irrational case, except that the
orbit of the intervals Gr converges as r→∞ and as r→−∞ to
periodic orbits Q and P of B, and R=S∖Q. If Q
and P are distinct, then the former is stable and the latter is unstable;
while if P=Q, then this is a semi-stable orbit, which is the limit on
one side of the intervals Gr as r→∞, and on the other side of the
intervals Gr as r→−∞.
The following lemma is illustrated in the irrational case by
Figure 14. The picture in the early endpoint case is
discussed in Remark 5.4.
Lemma 5.3**.**
Let f be of irrational type or of rational early
endpoint type. Then the strongly stable components of D† are
{∂′} and:
(a)
for each y∈S∖⋃r∈ZGr, the line
Ly={y}×(0,∞];
2. (b)
for each r∈Z:
(i)
the arc Ar={t(cu,r)}×[sr,∞]; where
sr=λr(1), i.e.
[TABLE]
2. (ii)
for each y∈(cu,a), the crosscut Cr,y=ξ′(Jr,y,tr,y);
where Jr,y⊂Gr has endpoints t(y,r) and t(y,r), and
tr,y=λr((1+u(y))/2), i.e.
[TABLE]
3. (iii)
the union Dr of the arcs t(a,r)×[ur,∞] and
t(αu,r)×[ur,∞], and the set Gr×(0,ur]; where ur=sr−1=λr(1/2), i.e.
[TABLE]
Proof.
We first show that each of the sets listed is strongly stable.
(a)
Let y∈S∖⋃r∈ZGr, so that y=⟨y,B−1(y),B−2(y),…⟩ for some y whose orbit under B is disjoint
from γ. Since y is landing of level 0,
Lemma 4.13 gives Ψ(y,s)0=τ(y) for all
s≥1. Applying G repeatedly (or arguing directly using that
Ψ(y,s)=⟨(y,s),(B−1(y),s/2),…⟩ for s∈[0,1)) gives
that, for each m≥1, Hm(Ψ(y,s))0=fm(τ(y)) for all s∈[1/2m,∞]. Therefore Ly is strongly stable.
2. (b)
G(Ar)=Ar+1, G(Cr,y)=Cr+1,y, and G(Dr)=Dr+1 for all
r∈Z and y∈(cu,a). Since G permutes strongly stable components, it
suffices to consider the case r=1.
(i)
We have t(cu,1)=⟨B(a),cu,B−1(cu),…⟩, which is
landing of level 1. By Lemma 4.13,
Ψ(t(cu,1),s)0=f(τ(cu))=b for all s∈[2,∞]=[s1,∞], so that A1 is strongly stable.
2. (ii)
Let y∈(cu,a). Since t(y,1)1=y and t(y,1)1+i∈\accentset∘γ
for all i≥1, Lemma 4.20 gives that
Ψ(t(y,1),s)0=f(τ(y)) for all s≥1+u(y); similarly
Ψ(t(y,1),s)0=f(τ(y))=f(τ(y)) for all such s.
Now let z∈[y,y], so that (t(z,1),1+u(y)) is on the horizontal
segment of the crosscut. Then Ψ(t(z,1),1+u(y))0=H(z,ϕ−1(f(τ(y)))) by (8) and the definition
of u(y). Since z∈[y,y] we have ϕ−1(f(τ(y)))≤ϕ−1(f(τ(z))), so that H(z,ϕ−1(f(τ(y))))=f(τ(y)) by
Lemma 4.5, as required.
Therefore Ψ(η)0=f(τ(y)) for all η∈C1,y, so that
C1,y is strongly stable.
3. (iii)
We have Ψ(y,s)0=f(τ(a))=f(a) for (y,s)∈{t(a,1),t(αu,1)}×[1,∞] as in (ii), and hence
(Hm(Ψ(y,s)))0=fm+1(a) for all such (y,s) and all m≥0.
Now suppose that s∈[1/2m,1/2m−1) for some m≥1, and that y∈G1, so that we have y=⟨B(a),y,B−1(y),…⟩ for some
y∈γ. Then Ψ(y,s)0=(B(a),s) by (6), so that
[TABLE]
using (3) and that the orbit of B(a) is disjoint
from γ. Therefore D1 is strongly stable.
The proof that there are no connected strongly stable sets
which strictly contain one of these sets is a routine consideration of cases.
We will only show that A1 is a strongly stable component, and omit the
entirely analogous proofs in the other cases.
From the argument above, we have Ψ(η)0=b for all η∈A1.
Therefore, if η′∈D† satisfies HN(Ψ(η′))0=HN(Ψ(η))0 for some N≥0 then fN(Ψ(η′)0)=fN(b).
There are therefore only countably many possible values which Ψ(η′)0
can take if η′ is in the strongly stable component containing A1.
Now any connected set Y which strictly contains A1 must intersect
C1,y for all y in some interval (cu,e)⊂(cu,a). Since
Ψ(η′)0=f(τ(y)) for all η′∈C1,y, and since f is not
locally constant, it follows that {Ψ(η′)0:η′∈Y} is
uncountable, and hence Y cannot be strongly stable.
∎
Remark 5.4**.**
In the early endpoint case, the
strongly stable components above each interval Gr, and above points y of
S∖⋃r∈ZGr, are exactly as depicted in
Figure 14, but the intervals Gr are arranged
differently. For each 0≤i≤n−1, the intervals Gi+kn converge
strictly monotonically to a point of Q as k→∞, and the intervals
Gi−kn converge strictly monotonically to a point of P. The open
intervals between each Gi+kn and Gi+(k+1)n are contained in
S∖⋃r∈ZGr, so that the strongly stable components above
them are vertical lines. If Q and P are distinct, then there are also
intervals with one endpoint in Q and one in P which are likewise
contained in S∖⋃r∈ZGr.
5.2. Strongly stable components in the rational case
Consider now the case where f is of rational type but not of early endpoint
type, and let q(κ(f))=m/n∈Q∩[0,1/2). Recall that we write
qn−1=Bn(a)∈γ. We will treat in turn the general case together with
the late endpoint case (Lemma 5.5), the NBT
case (Lemma 5.6), the normal endpoint case
(Lemma 5.7), and the quadratic-like strict
left endpoint case (Lemma 5.8).
Recall that in the interior case, we have L=R=S∖Q, while in
the endpoint case we have L=S and R=S∖Q; and that in
the interior, quadratic-like endpoint, and late endpoint cases, there is a
second period n orbit P of B:S→S, while in the normal
endpoint case Q is the only periodic orbit of B.
Let f be of rational general or late
endpoint type, with q(κ(f))=m/n∈(0,1/2)∩Q. Then the strongly
stable components of D† are {∂′} and:
(a)
for each p∈P, the line Lp={p}×(0,∞];
2. (b)
for each k∈Z and 0≤i≤n−1:
(i)
the arc Ak,i={t(cu,k,i)}×[rk,i,∞], where
rk,i=λkn+i(2), i.e.
[TABLE]
2. (ii)
for each y∈(cu,a]∖{min(qn−1,qn−1)}, the crosscut
Γ′(y,k,i).
3. (iii)
the union Dk,i of
•
the crosscut ξ′([t(qn−1,k,i),t(a,k+1,i)],uk,i);
•
the crosscut ξ′([t(qn−1,k,i),t(αu,k+1,i)],uk,i); and
•
the set [t(a,k+1,i),t(αu,k+1,i)]×[uk,i,vk,i].
Here uk,i=λkn+i(1+u(qn−1)),
vk,i=λkn+i(n+1), and all three of the intervals in S are
those with the given endpoints which are disjoint from P.
Proof.
(a)
If p∈P then p is landing of level 0, and the proof that
Lp is strongly stable is identical to that of part (a) of
Lemma 5.3.
2. (b)
Since Ak,i=Gkn+i(A0,0),
Γ′(y,k,i)=Gkn+i(Γ′(y,0,0)), and Dk,i=Gkn+i(D0,0)
for all k∈Z, 0≤i≤n−1, and y∈(cu,a]∖{min(qn−1,qn−1)}, it suffices to consider the case k=i=0.
That the sets A0,0 and Γ′(y,0,0), and the crosscuts of D0,0,
are strongly stable is immediate from Lemma 4.57 and
Remark 4.58, which gives that Ψ(η)0=b for all
η∈A0,0; Ψ(η)0=f(τ(y)) for all
η∈Γ′(y,0,0); and Ψ(η)0=f(τ(qn−1)) for all η
in the crosscuts of D0,0.
To complete the proof that D0,0 is strongly stable, it is therefore only
required to show that for all y∈[t(a,1,0),t(αu,1,0)] and all
s∈[1+u(qn−1),n+1] we have Ψ(y,s)0=f(τ(qn−1)). Given
y∈[t(a,1,0),t(αu,1,0)]={q0}∪⋃k=1∞(Lk,0∪Rk,0), we have y0=q0 and
yr=qn−r for 1≤r≤n. Since y1=qn−1 and
y1+i∈\accentset∘γ for 1≤i≤n−1, Lemma 4.20
gives that Ψ(y,s)0=f(τ(qn−1)) for all s∈[1+u(qn−1),n+1]
as required.
The proof that there are no connected strongly stable sets
which strictly contain one of these sets proceeds in the same way as in the
proof of Lemma 5.3.
∎
In the NBT case, where qn−1=cu, the interval (cu,min(qn−1,qn−1)) degenerates, leaving the simpler situation described in the
following lemma, whose proof works in exactly the same way as that of
Lemma 5.5. Its conclusions are illustrated by
Figure 16.
Lemma 5.6**.**
Let f be of rational NBT type, with
q(κ(f))=m/n∈(0,1/2)∩Q. Then the strongly stable components of
D† are {∂′} and:
(a)
for each p∈P, the line Lp={p}×(0,∞];
2. (b)
for each k∈Z and 0≤i≤n−1:
(i)
for each y∈(cu,a], the crosscut Γ′(y,k,i).
2. (ii)
the union Dk,i of
•
the crosscut ξ′([t(αu,k+1,i),t(a,k+1,i)],uk,i),
and
•
the set [t(a,k+1,i),t(αu,k+1,i)]×[uk,i,vk,i].
Here uk,i=λkn+i(2), vk,i=λkn+i(n+1), and both of the intervals in S are those with the
given endpoints which are disjoint from P. ∎
In the rational normal endpoint case, on the other hand, the interval
(min(qn−1,qn−1),a] degenerates, giving rise to a more substantial
modification to the description. The following lemma is illustrated by
Figure 17.
Lemma 5.7**.**
Let f be of rational normal endpoint type, with
q(κ(f))=m/n∈[0,1/2)∩Q, and suppose that f is of right hand
endpoint type, so that qn−1=αu (the modifications in the left hand
endpoint case are given at the end of the lemma statement). Then the strongly
stable components of D† are {∂′} and:
(a)
for each k∈Z and 0≤i≤n−1:
(i)
the arc Ak,i={t(cu,k,i)}×[rk,i,∞], where
rk,i=λkn+i(2), i.e.
[TABLE]
2. (ii)
for each y∈(cu,a), the crosscut Γ′(y,k,i).
2. (b)
For each 0≤i≤n−1, the set
[TABLE]
where Ly is the line {y}×(0,∞] and Bk,i=Lk,i×(0,uk,i] with uk,i=λkn+i(1), i.e.
[TABLE]
In the left hand endpoint case qn−1=a, the strongly stable
components are given by replacing qi with qi−m−1modn,
t(a,k,i) with t(αu,k,i), and Lk,i with Rk,i in (b).
Proof.
We suppose that qn−1=αu, so that m/n>0. The
modifications needed for the case qn−1=a are straightforward (including
for the special sub-case m/n=0, when q0=a is fixed by B, and αu=b).
Notice that, since the orbit of a is disjoint from \accentset∘γ, we have
τ(Br(a))=fr(a) for all r≥0 by (3) (here the a on
the left hand side is a∈S, while the a on the right hand side is a∈I). In particular, fn(a)=τ(αu)=α, f(a) is periodic of period n,
and τ(qi)=fi+1(a) for 0≤i≤n−1.
That the sets Ak,i and Γ′(y,k,i) are strongly stable is immediate
from Lemma 4.57 and Remark 4.58.
To show that the sets Di are strongly stable it suffices, since
G(Di)=Di+1modn, to consider the case i=0.
(i)
Let y=q0=⟨(q0,qn−1,qn−2,…,q1)∞⟩. Since
y1=qn−1=αu and y1+i∈\accentset∘γ for all i≥1,
Lemma 4.20 gives that Ψ(y,s)0=f(τ(αu))=f(a) for all s∈[1,∞]. On the other hand, if
s∈[1/2r,1/2r−1) for some r≥1, then Ψ(y,s)0=(q0,s), and hence Hr(Ψ(y,s))0=τ(Br(q0))=τ(qrmodn)=fr+1(a). Therefore, for each r≥0,
[TABLE]
2. (ii)
By a similar argument applied to y=t(a,0,0)=⟨q0,a,B−1(a),…⟩, we obtain that, for each r≥0,
Hr(Ψ(t(a,0,0),s))0=fr+1(a) for all s∈[1/2r,∞].
Now for each k∈Z we have Gkn(t(a,0,0),s)=(t(a,k,0),λkn(s)). By Corollary 4.10, we obtain that for
all k∈Z and all r≥0,
[TABLE]
Therefore, for each k∈Z and each r≥0, we have
[TABLE]
3. (iii)
Now let y=t(y,0,0)=⟨q0,y,B−1(y),…⟩∈L0,0,
where y∈[a,αu). Then Ψ(y,1)0=H(y,1/2)=f(a)
by (8) and (U1) of
Definition 3.2. On the other hand, if s∈(0,1)
we have Ψ(y,s)=⟨(q0,s),…⟩ and hence, as in (i), if
s∈[1/2r,1/2r−1) for some r≥1 then Hr(Ψ(y,s))0=fr+1(a). Therefore, for each r≥0,
[TABLE]
Since Gkn(L0,0)=Lk,0 for each k∈Z, a similar argument to
that of part (ii) establishes that for all k∈Z and all r≥0,
[TABLE]
where we have used that λkn(1)=uk,0 for all k∈Z.
Therefore, for all η1,η2∈D0, there is some r≥0 such that Hr(Ψ(η1))0=Hr(Ψ(η2))0=fr+1(a),
establishing that D0 is strongly stable as required.
The proof that there are no connected strongly stable sets which strictly
contain one of these sets proceeds in the same way as in the proof of
Lemma 5.3.
∎
The quadratic-like strict left endpoint case
(Section 4.7.2) is identical to the normal endpoint
case, except that there are additional half-open intervals
Ii={t(y):y∈(qi,pi]} in S (for 0≤i≤n−1) whose points
satisfy Br(t(y))0∈γ for all r∈Z. The strongly stable
component containing (t(y),∞) is the line
{t(y)}×(0,∞], exactly as in the irrational case; and other
strongly stable components are as in the normal endpoint case. We therefore
have the following description.
Lemma 5.8**.**
Let f be of rational quadratic-like strict left endpoint type, with
q(κ(f))=m/n∈(0,1/2)∩Q.
Then the strongly stable components of D† are {∂′} and:
(a)
for each k∈Z and 0≤i≤n−1:
(i)
the arc Ak,i={t(cu,k,i)}×[rk,i,∞], where
rk,i=λkn+i(2), i.e.
[TABLE]
2. (ii)
for each y∈(cu,a), the crosscut Γ′(y,k,i).
2. (b)
For each 0≤i≤n−1, the set
[TABLE]
where Ly is the line {y}×(0,∞] and Bk,i=Rk,i×(0,uk,i] with uk,i=λkn+i(1), i.e.
[TABLE]
3. (c)
For each 0≤i≤n−1 and each y∈(qi,pi], the line Lt(y).
The following straightforward consequence of the above proofs will be useful in
Section 5.4.
Lemma 5.9**.**
**
(a)
Let f be of irrational or rational early endpoint type. Then for
each r≥1 and each y∈(cu,a), the diameters of the strongly stable
component images Ψ(Ar) and Ψ(Cr,y) are bounded above by
∣b−a∣/2r−1.
2. (b)
Let f be of rational interior or late endpoint type with
q(κ(f))=m/n∈(0,1/2)∩Q. Then for each k≥0, each 0≤i≤n−1, and each y∈(cu,a]∖{min(qn−1,qn−1)}, the
diameters of the strongly stable component images Ψ(Ak,i),
Ψ(Γ′(y,k,i)) and Ψ(Dk,i) are bounded above by
∣b−a∣/2kn+i.
3. (c)
Let f be of rational normal endpoint type or quadratic-like strict
left endpoint type, with q(κ(f))=m/n∈(0,1/2)∩Q. Then for each
k≥0, each 0≤i≤n−1, and each y∈(cu,a), the diameters of
the strongly stable component images Ψ(Ak,i) and
Ψ(Γ′(y,k,i)) are bounded above by ∣b−a∣/2kn+i.
Proof.
In the irrational or early endpoint case, the proof of
Lemma 5.3 shows that every element ξ of
Ψ(A1) (respectively Ψ(C1,y)) has ξ0=b (respectively
ξ0=f(τ(y))). Therefore any two elements of Ψ(Ar) or of
Ψ(Cr,y) have equal (r−1)th entries, and so are within
distance ∣b−a∣/2r−1 of each other. This establishes (a). Parts (b)
and (c) follow similarly from the proofs of
Lemmas 5.5
and 5.7, which show that every
element ξ of Ψ(A0,0) (respectively Ψ(Γ′(y,0,0)),
Ψ(D0,0)) has ξ0=b (respectively ξ0=f(τ(y)), ξ0=f(τ(qn−1))).
∎
5.3. Construction of the sphere homeomorphism
Definition 5.10** (The decomposition G′ of D).**
Let G′ be the decomposition of D whose elements are:
•
{η} for each η∈D∖D†;
•
Strongly stable components whose closures don’t contain ∂′; and
•
The set X which is the union of the strongly stable components
whose closures contain ∂′ (including the strongly stable
component {∂′} itself).
Remark 5.11**.**
It follows from the explicit descriptions of
the strongly stable components that those whose closures don’t contain
∂′ are compact; and that the set X is also compact. Therefore G′
is the largest partition of D into compact sets with the property that
every strongly stable component is contained in a single partition element.
Moreover, the elements of G′ are connected, and are permuted by G, since
G(X)=X.
Lemma 5.12**.**
The restriction of Ψ to each element of G′, apart from the single
points of D∖D† (where it is not defined), is a
homeomorphism onto its image.
Proof.
This is immediate from the descriptions of the strongly stable
components and Corollary 4.19 in all cases except
for the element X of G′ in the irrational, early endpoint, normal
endpoint, and quadratic-like strict left endpoint cases.
Suppose that f is of irrational type, so that the strongly stable components
are given by Lemma 5.3. Then X∩S∞ is the
Cantor set Λ∞. Ψ∣X is injective since Ψ is injective
on D and on Λ∞ (Corollary 4.9 and
Lemma 4.16), and Ψ(η)∈I if and only if
η∈S∞. Since Ψ is continuous away from S∞
(Corollary 4.9), it is only necessary to show that Ψ∣X is
continuous at the points of Λ∞ (of course, Ψ itself is not
continuous at these points).
Now Ψ∣Λ×[0,∞] is continuous by
Lemma 4.17, since Λ is uniformly landing
of level 0. Thus it suffices to show that if (y,s)∈⋃r∈Z(Gr×(0,ur]) is sufficiently close to a point
(y′,∞) of Λ∞, then Ψ(y,s) is close to
Ψ(y′,∞), where Gr×(0,ur] are the rectangles of
Lemma 5.3 (b)(iii). In order to do this we will show
that, for all N≥2, if (y,s)∈Gr×(0,ur] for some r, and
s>N, then Ψ(y,s)N−2=Ψ(t(a,r),∞)N−2. This will establish the result, since if
(y,s) is close to (y′,∞) then (t(a,r),∞)∈Λ∞ is also close to (y′,∞).
Recall that ur<1 for r<1, and ur=r for r≥1. So if (y,s)∈Gr×(0,ur] and s>N, we have N<s≤r. Observe that G−(r−1)(y,s)=(B−(r−1)(y),λ−(r−1)(s))∈G1×(0,1].
Let m≥0 be such that r−m≤s<r−m+1, so that λ−(r−1)(s)∈[1/2m,1/2m−1). By the proof of Lemma 5.3 (b)(iii),
we have Hm(Ψ(G−(r−1)(y,s)))0=fm+1(a): therefore, by
Corollary 4.10, Hm−r+1(Ψ(y,s))0=fm+1(a), and so Ψ(y,s)r−m−1=fm+1(a). Since r−m−1>s−2>N−2, it follows
that
[TABLE]
On the other hand, Ψ(t(a,r),∞)=ω(t(a,r))=⟨fr(a),…,f(a),a,τ(B−1(a)),…⟩ by (10),
since t(a,r)∈Lr. Therefore Ψ(t(a,r),∞)N−2=fr−(N−2)(a), as required.
The proof when f is of early endpoint type is identical, with the periodic
orbit Q in place of the Cantor set Λ; and the proof when f is of
normal endpoint or quadratic-like strict left endpoint type involves only minor
modifications.
∎
Definition 5.13** (The decomposition G of T).**
Let G be the decomposition of T whose
elements are:
•
the images under Ψ of the elements of G′, other than points of
D∖D†; and
•
single points which are not in the image of Ψ.
By Corollary 4.10 and
Remark 5.11, the elements of G are permuted by
H.
Lemma 5.14**.**
G* is a non-separating monotone upper semi-continuous decomposition
of T.*
Proof.
The elements of G are compact, connected, and do not separate T since
the elements of G′ are compact, connected, and contractible, and the
restriction of Ψ to each of them is a homeomorphism by
Lemma 5.12.
That G is upper semi-continuous is a special case of
Lemma 5.26 below (where G is a single slice of a sliced
decomposition which is shown to be upper semi-continuous).
∎
Theorem 5.15** (Semi-conjugacy to sphere homeomorphisms).**
Let f be a unimodal map satisfying the conditions of
Convention 2.8. Then there is a sphere homeomorphism
F:Σ→Σ and a continuous surjection g:I→Σ which semi-conjugates f:I→I to
F:Σ→Σ.
Every fiber of g except for at most one contains three or fewer points, and
only countably many fibers contain three points.
Proof.
By Lemma 5.14 and Moore’s theorem, Σ=T/G is a sphere;
and since H permutes the elements of G, the map F=H/G:Σ→Σ is a homeomorphism. Since every element of G intersects I, and
H∣I=f, it follows that Σ is also the quotient of I by the equivalence
relation ∼G∣I on I induced by G; and the canonical
projection g:I→I/∼G∣I=Σ is a semi-conjugacy between f and F.
The statement about the cardinalities of the fibers of g is immediate from
the descriptions of the elements of G′ (Definition 5.10
and Lemmas 5.3, 5.5,
5.6, 5.7, and
5.8), every one of which except for X
intersects S∞ in three or fewer points, and only countably many of
which can intersect S∞ in three points.
∎
Remark 5.16**.**
Since Ψ∣X is a homeomorphism onto its image
(Lemma 5.12), the restriction of f to the exceptional
fiber Ψ(X∩S∞) of g is topologically conjugate to the action
of the circle homeomorphism B on an invariant subset in the circle, and
therefore has topological entropy zero. It follows from a result of Bowen
(Theorem 17 of [13]), using the fact that all other fibers are finite,
that f:I→I and F:Σ→Σ have the same
topological entropy. Since f and f also have the same topological entropy
(this follows from the same result of Bowen), we conclude that the sphere
homeomorphism F:Σ→Σ has the same topological entropy as the
unimodal map f:I→I.
Remark 5.17**.**
By the proof of Theorem 5.15, the fibers of the semi-conjugacy
g:I→Σ can be described explicitly. Every non-trivial fiber is
contained in the set of accessible points and, conversely, all but countably
many trivial fibers are contained in the set of inaccessible points.
The accessible fibers of g are as follows:
(a)
In the irrational case, there is one fiber equal to ω(Λ),
where Λ is the Cantor set of Definition 4.41; and there
are countably many accessible trivial fibers {ω(t(cu,r))} for
r∈Z. All other accessible fibers are of the form {ω(t(y,r)),ω(t(y,r))}, where y∈\accentset∘γ∖{cu} and r∈Z.
2. (b)
In the early endpoint case there is one fiber
[TABLE]
which is either a countable union of disjoint intervals, or such a union
together with finitely many isolated points; and there are countably many
accessible trivial fibers {ω(t(cu,r))} for r∈Z. All other
accessible fibers are of the form {ω(t(y,r)),ω(t(y,r))}, where y∈\accentset∘γ∖{cu} and r∈Z.
3. (c)
In the normal endpoint case with q(κ(f))=m/n there is one countable
fiber
[TABLE]
where A=a if κ(f)=rhe(m/n), and A=αu if
κ(f)=lhe(m/n); and there are countably many accessible trivial
fibers {ω(t(cu,k,i))} for k∈Z and 0≤i≤n−1. All
other accessible fibers are of the form {ω(t(y,k,i)),ω(t(y,k,i))}, where y∈\accentset∘γ∖{cu}, k∈Z and
0≤i≤n−1.
4. (d)
In the quadratic-like strict left end point case with q(κ(f))=m/n,
there is one fiber
[TABLE]
which is the union of n disjoint compact intervals and countably many
points; and there are countably many accessible trivial fibers
{ω(t(cu,k,i))} for k∈Z and 0≤i≤n−1. All other
accessible fibers are of the form {ω(t(y,k,i)),ω(t(y,k,i))}, where y∈\accentset∘γ∖{cu}, k∈Z and
0≤i≤n−1.
5. (e)
In the rational general and late endpoint cases with q(κ(f))=m/n,
there is one fiber ω(P) of cardinality n; countably many
3-element fibers of the form
[TABLE]
and countably many accessible trivial fibers {ω(t(cu,k,i))} for
k∈Z and 0≤i≤n−1. All other accessible fibers are of the form
{ω(t(y,k,i)),ω(t(y,k,i))}, where
y∈\accentset∘γ∖{qn−1,qn−1,cu}, k∈Z, and 0≤i≤n−1.
6. (f)
In the rational NBT case with q(κ(f))=m/n, there is one fiber
ω(P) of cardinality n. All other accessible fibers are of the
form {ω(t(y,k,i)),ω(t(y,k,i))}, where
y∈γ∖{cu}, k∈Z, and 0≤i≤n−1.
Note that the exceptional fiber of g can only be infinite when f is of
irrational or endpoint type. In particular, for the tent family {ft},
the semi-conjugacy has only finite fibers for an open dense subset of
parameters.
An immediate consequence of Theorem 5.15 is that any
unimodal map with topological entropy greater than 21log2 has
natural extension semi-conjugate to a sphere homeomorphism, although the
fibers of the semi-conjugacy may not be so well behaved when the conditions
of Convention 2.8 are not satisfied.
Corollary 5.18**.**
Let f be any unimodal map (not necessarily satisfying the
conditions of Convention 2.8) with topological entropy
h(f)>21log2. Then the natural extension f is semi-conjugate to
a sphere homeomorphism with the same topological entropy as f.
Proof.
h(f)>21log2 is equivalent to κ(f)≻101∞. Now f is semi-conjugate to a tent map F with
κ(F)=κ(f) and h(F)=h(f) (see [31, 36]), and hence
f:If→If is semi-conjugate to F:IF→IF, which
is semi-conjugate to a sphere homeomorphism of topological entropy h(F) by
Theorem 5.15 and Remark 5.16.
∎
5.4. Continuously varying families
Our aim in this section is the following result, which shows that the above
construction of sphere homeomorphisms can be carried out continuously.
Theorem 5.19**.**
Let J be a compact parameter interval, and
{ft}t∈J be a continuously varying family of unimodal maps, all of
which are defined on the same core interval I and satisfy the conditions of
Convention 2.8. For each t, let
Ft:Σt→Σt be the sphere homeomorphism constructed from
ft in the proof of Theorem 5.15. Then there is a continuously
varying family {χt:S2→S2}t∈J of sphere homeomorphisms
such that χt is topologically conjugate to Ft for each t.
In particular, each natural extension ft:It→It is
semi-conjugate to χt, by a semi-conjugacy all but one of whose fibers
contains three or fewer points, and only countably many of whose fibers contain
three points.
Remark 5.20**.**
If ft:It→It, where {It} is a continuously varying family
of compact intervals — as occurs naturally when families of unimodal maps
are restricted to their core intervals — then the theorem applies after
conjugating by a continuously varying affine coordinate change.
Throughout this section, {ft}t∈J will denote a fixed family of
unimodal maps as in the statement of Theorem 5.19. Because the
domain I=[a,b] is fixed, the circle S and the sphere T are independent of
the parameter t. However, almost every other object is parameter dependent.
This dependence will generally be indicated with a subscript t, but will
sometimes be suppressed, particularly when it doesn’t serve to illuminate
continuity or convergence arguments, in order to avoid excessive notation. For
example, we will not normally make explicit the parameter dependence of cu
and αu.
Recall that {ft:T→T} is a continuously varying family of
unwrappings of {ft}, and that the homeomorphisms Ht:Tt→Tt are the natural extensions of the near-homeomorphisms
[TABLE]
Let
[TABLE]
topologized as a compact subset of TN×J. The following result
from [14] — which is the key lemma used in the proof of
Theorem 2.14 — tells us that T∗ is homeomorphic to
S2×J.
Theorem 5.21**.**
There is a slice-preserving homeomorphism β:T∗→T×J.
Here slice-preserving means that β(Tt×{t})=T×{t} for each t. In [14] this result is stated not
for T∗, but for the inverse limit T×J of the fat map
T×J→T×J defined by (x,t)↦(Ht(x),t). However T∗ and T×J are homeomorphic
by the slice-preserving homeomorphism (⟨x0,x1,…⟩,t)↦⟨(x0,t),(x1,t),…⟩.
Let H∗:T∗→T∗ be the slice-preserving homeomorphism
defined by H∗(x,t)=(Ht(x),t), and G∗ be the
H∗-invariant decomposition of T∗ induced in each slice by
Gt: that is,
[TABLE]
The elements of G∗ are each contained in a slice of T∗, and
moreover are compact, connected, and do not separate their slices, since these
properties are inherited from the Gt (see Lemma 5.14).
Lemma 5.26 below states that G∗ is upper
semi-continuous. We now assume this lemma and show how to complete the proof of
the Theorem 5.19. The key ingredient is the following theorem of
Dyer and Hamstrom [23] (both statement and proof of this result are
contained in the proof of Theorem 8 of [23]: note that a decomposition is
upper semi-continuous if and only if its quotient mapping is closed).
Theorem 5.22** (Dyer – Hamstrom).**
Let G be a monotone upper semi-continuous decomposition of
S2×J into compact subsets, each of whose elements lies in, and does
not separate, some slice S2×{t}. Suppose also that there is an
arc L in S2×J which intersects each slice S2×{t} in a
singleton decomposition element. Then there is a slice-preserving
homeomorphism K:(S2×J)/G→S2×J.
It follows that, assuming the upper semi-continuity of G∗, we have the
commutative diagram of Figure 18. Here π is the quotient
mapping of the decomposition G∗; K is the homeomorphism of
Theorem 5.22 (which exists since, by Theorem 5.21,
T∗ is slice-preserving homeomorphic to S2×J: a suitable
arc L is the one which intersects each Tt×{t} at (zt,t),
where zt∈It is the fixed point of Ht which lies above the fixed
point zt of ft in (c,b)); and H∗/G∗, and χ∗
are the homeomorphisms which make the diagram commute. All of the maps in the
diagram are slice-preserving, and in particular χ∗:S2×J→S2×J defines a continuously varying family {χt}t∈J of
sphere homeomorphisms. Restricting the diagram to a single slice, we see that
χt is topologically conjugate to the homeomorphism Ft=Ht/Gt of
Theorem 5.15, which completes the proof of
Theorem 5.19.
It therefore only remains to show that the decomposition G∗ of
T∗ is upper semi-continuous. We do this by first considering the
decompositions Gt′ of the spaces Dt — which are described
explicitly by Lemmas 5.3,
5.5, 5.6,
5.7, and 5.8
— and then transferring the results using the maps Ψt.
Recall from Definition 5.10 that, for each t∈J, the
decomposition Gt′ of Dt has as elements
•
Strongly stable components whose closures are disjoint from
∂t′,
•
The union Xt of strongly stable components whose closures contain
∂t′, and
•
Single points at which Ψt is not defined.
We write
[TABLE]
topologized as a compact subset of (SN×[0,∞])/(SN×{0})×J, and
define
[TABLE]
to be
the sliced decomposition of D∗ induced on each slice by the
decompositions Gt′.
Recall also (Definitions 4.11) that, for each t, we
denote by Dt† the subset of Dt on which Ψt is defined:
that is, Dt†=Dt if ft is of irrational or rational endpoint
type, and otherwise Dt†=Dt∖Qt. Writing D∗†
for the subset ⨆t∈J(Dt†×{t}) of D∗, we
can then define the function Ψ∗:D∗†→T∗ by
Ψ∗(η,t)=(Ψt(η),t). With these definitions, the
non-trivial elements of the decomposition G∗ of T∗ are
precisely the images under Ψ∗ of the non-trivial elements of
G∗′.
The proof of the following is essentially the same as that of
Corollary 4.9.
Lemma 5.23**.**
Ψ∗* is continuous at ((y,s),t)∈D∗† whenever
s<∞.*
Proof.
For each N∈N, we have that, whenever s<N+1,
[TABLE]
by (9), (6), and (4). This
expression is clearly continuous in ((y,s),t).
∎
The main technique in the proof of upper semi-continuity of G∗ is to
take certain convergent sequences in T∗, transfer them to D∗†
using Ψ∗−1, draw conclusions about the limit in D∗†, and
transfer back to T∗. In order to do this, we need to know that
Ψ∗ respects the limits of certain sequences, although it may not be
continuous at those limits. The following lemma enables us to do this:
parts (a) and (b) are natural, while part (c), which is more esoteric, is
motivated by the specific requirements of the proof.
Lemma 5.24**.**
Let ((y(j),sj),tj)→((y,s),t) be a convergent sequence in D∗†. Then
Ψ∗((y(j),sj),tj)→Ψ∗((y,s),t) if one of the following holds:
(a)
s<∞;
2. (b)
y* and all of the y(j) are landing of level 1; or*
3. (c)
y* is landing of level 1, and there is a sequence
nj→∞ such that for each j we have
sj≤nj+1 and yi(j)∈\accentset∘γtj for 2≤i≤nj.
*
We can assume that s=∞ since otherwise (a) applies. Fix r≥1. Since y∈Lr, Corollary 4.14 gives Ψt(y,∞)r=τ(yr); and since y(j)∈Lr,
Lemma 4.13 gives Ψtj(y(j),sj)r=τ(yr(j)), provided that j is large enough that sj≥r+1.
Therefore for each r≥1 we have Ψtj(y(j),sj)r→Ψt(y,∞)r as j→∞, and the result follows.
3. (c)
We can again assume that s=∞. Fix r≥1. As for (b), we
have Ψt(y,∞)r=τ(yr). For each j large enough that
nj≥r+2, we have y(r+1)+i(j)∈\accentset∘γtj for 1≤i≤nj−(r+1), so that Lemma 4.20 gives
[TABLE]
In particular, since sj≤nj+1 for all j, we have
Ψtj(y(j),sj)r=τ(yr(j)) whenever j is large enough
that sj≥r+2, so that Ψtj(y(j),sj)r→Ψt(y,∞)r as j→∞.
∎
The following abbreviated language will be convenient.
Definition 5.25** (Type and height of a parameter).**
We say that a parameter t∈J is of irrational, rational,
and rational interior, early endpoint, normal endpoint,
quadratic-like strict left endpoint, or late endpoint type
according as ft is. We define the height of t to be
q(κ(ft)).
Lemma 5.26**.**
The decomposition G∗ of T∗ is upper semi-continuous.
Proof.
Let (tj) be a sequence in J converging to t∈J, and for
each j, let gj be a decomposition element of Gtj. We need to
show that there is a decomposition element g∈Gt with the property
that, whenever (ξj,tj) is a sequence in T∗ with (ξj,tj)→(ξ,t) and ξj∈gj for all j, then we have ξ∈g.
This is clearly the case if infinitely many of the gj are singletons, so
we can assume that there are decomposition elements gj′∈Gtj′ with
Ψtj(gj′)=gj for each j.
Observe that if the required property holds for some subsequence of (tj,gj), then it also holds for the full sequence. By taking such a
subsequence, we can therefore further assume that all of the tj are of
rational interior or late endpoint type (type A); or that they are all of
rational normal or quadratic-like endpoint type (type B); or that they are
all of irrational or rational early endpoint type (type C). We will consider
each of these three cases in turn. The arguments will also depend on the type
of the limiting parameter t. We note that t can only be of type A if the
tj are also of type A, and if the sequence mj/nj of their heights is
eventually constant, since the set Jq of parameters t of rational
interior or late endpoint type with prescribed height q is open in J.
This is because Jq={t∈J:(wq1)∞≺κ(ft)≺10(wq1)∞} (see Definitions 2.23
and 2.25); because if κ(ft)=(wq0)∞ then the turning
point of ft is not periodic by Definition 2.4; and
because 10(wq1)∞ is not a periodic sequence by
Lemma 2.22 (d).
The method of proof is the same in all three cases. We first use the explicit
description of the decompositions Gt′ provided by
Lemmas 5.3, 5.5,
5.6, 5.7,
and 5.8 to show that either (i) the
diameters of (a subsequence of) the decomposition elements gj converge to
zero, in which case the result is obvious; or (ii) there is a decomposition
element g′∈Gt′ with the property that, whenever (ηj,tj) is a
sequence in D∗† with (ηj,tj)→(η,t) and ηj∈gj′
for all j, we have η∈g′. Then if (ξj,tj)→(ξ,t) with
ξj∈gj for all j, we define ηj=Ψtj−1(ξj)∈gj′, and take a subsequence if necessary to ensure that (ηj,tj)→(η,t) with η∈g′. Writing g=Ψt(g′), it only remains to
show, using Lemma 5.24, that (ξj,tj)=Ψ∗(ηj,tj)→Ψ∗(η,t), so that ξ∈g as
required.
We will therefore assume, in each case, that (ηj,tj)=((y(j),sj),tj)→(η,t)=((y,s),t) is a sequence in D∗†, and show that the decomposition element
g′∈Gt′ which contains η only depends on the decomposition
elements gj′∈Gtj′ which contain the ηj. The proof in the
given case will then be completed by showing (or observing) that one of the
conditions of Lemma 5.24 holds.
The decomposition elements Xt∈Gt′ (see
Definition 5.10) which contain ∂′ play a special
role in the arguments. Observe that in all cases these contain the
verticals {y}×[0,∞] above the points y∈St which have the property that Btr(y)0∈\accentset∘γt for all
r∈Z; and that in the rational interior and late endpoint cases, Xt is
equal to the union of these verticals.
If infinitely many of the sj are equal to [math] then s=0, and hence (using
Lemma 5.24 (a)), ξ∈Ψt(Xt). We will therefore
always assume that s>0 and that sj>0 for all j.
Sequences of type A are the hardest to treat, mainly because there are
decomposition elements (other than Xt) which are not uniformly landing.
They also involve the most subcases, since limits of type A are possible, and
because limits of type B can be approached in two quite different ways,
either from within their height interval or from outside it. We will treat
this case in detail — although methods of arguments will be successively
abbreviated as they recur — and treat sequences of types B and C more
briefly. Although the proof is quite long, it involves nothing more than the
careful enumeration of cases and their analysis using the explicit
description of the decomposition G∗′.
**Case A: **All tj are of rational interior or late endpoint
type.
In this case the decompositions Gtj′ are given by
Lemma 5.5 or, in the NBT case, by
Lemma 5.6. Let the height of tj be mj/nj.
Suppose first that infinitely many (and so, without loss of generality, all)
of the ηj are contained in the nj-stars Xtj, so that for
each j we have Btjr(y(j))0∈\accentset∘γtj for all r∈Z.
Since Bt and γt vary continuously with t, it follows that
Btr(y)0∈\accentset∘γt for all r∈Z: therefore η∈Xt.
Observing that y and y(j) are landing of level 0, and hence of
level 1, completes the proof using Lemma 5.24 (b).
We can therefore assume that none of the ηj lie in Xtj, and so
can define kj∈Z and 0≤ij≤nj−1 such that
[TABLE]
for each j, where Akj,ij, Dkj,ij, and Γ′(y,kj,ij) are the elements of Gtj′ defined in the statements of
Lemmas 5.5
and 5.6 (we suppress the dependence of these
decomposition elements, as well as that of cu and qnj−1, on tj).
There are three possibilities:
(a)
The sequence (njkj+ij) is not bounded above. Then, by
Lemma 5.9 (b), there is a subsequence of the
ξj=Ψtj(ηj) contained in decomposition elements whose
diameters go to zero.
2. (b)
The sequence (njkj+ij) is not bounded below so that, taking a
subsequence, we can assume that kj<0 for all j and that
njkj+ij→−∞. For each j, we therefore have either that
Btjr(y(j))0∈\accentset∘γtj for all r∈Z with r≤−(njkj+ij+1), or that sj≤2njkj+ij+1 (depending on
whether ηj is in a vertical of its decomposition element, or is in
one of the horizontals, or disks of Dkj,ij). Since s=0 it
follows that Btr(y)0∈\accentset∘γt for all r∈Z. Thus
η∈Xt and the proof is completed using Lemma 5.24 (b).
3. (c)
The sequence (njkj+ij) is bounded so that, taking a
subsequence, we can assume it to be a constant N. Acting on T∗ by
the decomposition-preserving homeomorphism H∗−N, we can further
assume that N=0 (i.e. that kj=ij=0 for all j), so that
[TABLE]
Taking another subsequence, we can assume that ηj∈A0,0 for
all j; or ηj∈D0,0 for all j; or ηj∈⋃yΓ′(y,0,0) for all j.
**1. **If ηj∈A0,0 for all j, then y(j)=t(cu,0,0)=⟨Btj(a),cu,Btj−1(cu),Btj−2(cu),…⟩
(Definition 4.48 (b)) and sj∈[2,∞].
Therefore s∈[2,∞], and since Bt:S→S, Bt−1:S∖{Bt(a)}→S, and cu all depend continuously on t, we
have y=⟨Bt(a),cu,Bt−1(cu),Bt−2(cu),…⟩ provided that
cu is not in the Bt-orbit of a: that is, provided that t is not
of NBT type.
If t is of rational interior, late endpoint, or normal or quadratic-like
endpoint type but not of NBT type, then y=t(cu,0,0), and hence
η∈A0,0 (compare with
Definition 4.48 (b) and
Lemmas 5.5,
5.7,
and 5.8); while if t is of irrational
or early endpoint type then y=t(cu,1) and hence η∈A1,t
(compare with Definition 4.37 (a) and
Lemma 5.3). If t is of NBT type, then t and ti
(for sufficiently large i) all have the same height m/n, and by taking
a subsequence we can assume that either Btjn(a)∈(cu,a] for
all i, or that Btjn(a)∈[αu,cu) for all i (it is
impossible to have Btjn(a)=cu, since there is no decomposition
element A0,0 in the NBT case). In the former case we have that
Btj−n(cu)→αu, so that y=⟨Bt(a),cu,Bt−1(cu),…,Bt−(n−1)(cu),αu,Bt−1(αu),…⟩=⟨q0,qn−1,qn−2,…,q0,αu,Bt−1(αu),…⟩=t(αu,1,0); and in the latter case we have Btj−n(cu)→a,
so that y=t(a,1,0). Hence η∈D0,0 (compare with
Lemma 5.6).
Since y and all of the y(j) are landing of level 1, the proof when
ηj∈A0,0 for all j is complete by
Lemma 5.24 (b).
**2. **If ηj∈D0,0 for all j, then, referring to
the descriptions of D0,0 in the statements of
Lemmas 5.5
and 5.6, we have that for each j one of the
following occurs (and so, taking a subsequence, one of them occurs for
all j):
(i)
ηj is in one of the verticals of the crosscuts in the
description of D0,0: that is, y(j) is one of t(qnj−1,0,0), t(a,1,0), and t(αu,1,0), and
sj∈[1+u(qnj−1),∞] (with the case t(qnj−1,0,0)
omitted if tj is of NBT type). By
Definition 4.48, we have
[TABLE]
Note also that the function u=ut:S→[0,1] of
Definition 4.4 varies continuously with t.
2. (ii)
ηj is in a horizontal of the crosscuts in the description
of D0,0, but does not lie in the set [t(a,1,0),t(αu,1,0)]×[u0,0,v0,0]: that is,
y(j)=t(y,0,0)=⟨Btj(a),y,Btj−1(y),…⟩
for some y between qnj−1 and qnj−1, and
sj=1+u(qnj−1). (This case does not occur if tj is of NBT type.)
3. (iii)
y(j)∈[t(a,1,0),t(αu,1,0)] and sj∈[1+u(qnj−1),nj+1]. (Here the interval is the one with the given
endpoints which contains q0: therefore y(j) lies in this
interval if and only if its first nj+1 entries are ⟨Btj(a),Btjnj(a),…Btj(a),…⟩.)
Consider first the case where t is of rational interior or late endpoint
type with height m/n, so that mj/nj=m/n for all (sufficiently
large) j. Since nj=n, sequences (ηj) of type (i) converge to
(y,s) with y∈{t(qn−1,0,0),t(a,1,0),t(αu,1,0)} and s∈[1+u(qn−1),∞] (notice that if t
is of NBT type and tj is not, then sequences of the form t(qn−1,0,0) — which depend on j since both qn−1 and Btj do —
converge either to t(a,1,0) or t(αu,1,0)). Sequences
(ηj) of type (ii) converge either to (t(y,0,0),s) with y
between qn−1 and qn−1 and s=1+u(qn−1), or to limits of
type (i). Finally, sequences (ηj) of type (iii) converge to (y,s) with y∈[t(a,1,0),t(αu,1,0)] and s∈[1+u(qn−1),n+1].
Therefore η∈D0,0. Since y and all of the y(j) are
landing of level 1 in type (i), and s<∞ in types (ii) and (iii), the
proof in this case is complete.
Now suppose that t is of rational normal or quadratic-like endpoint type
with height m/n. We will assume that this is a right hand endpoint, so
that qn−1=Btn(a)=αu: the left hand endpoint cases are
similar. By taking a subsequence, we can reduce to one of two
possibilities: first, that mj/nj=m/n for all j (we approach the
endpoint from inside the height interval); or second, that nj→∞
as j→∞ (we approach the endpoint from outside the height
interval).
•
Suppose that we approach the endpoint from inside the height
interval. Then sequences (ηj) of type (i) converge to (y,s)
with y∈{t(a,0,0),t(a,1,0),t(a,2,0)} and
s∈[1,∞]. Sequences (ηj) of type (ii) converge either to
(t(y,0,0),1) for some y∈\accentset∘γt, or to limits of type (i).
Finally, sequences (ηj) of type (iii) converge to (y,s) with
s∈[1,n+1] and the first n+1 entries of y being ⟨Bt(a),αu,…,Bt(a),…⟩: that is, y∈⋃k≥1Lk,0.
Therefore η is in the set D0 of
Lemma 5.7 (or of
Lemma 5.8 in the quadratic-like
endpoint case), and hence η∈Xt, and the proof is completed since
y and all of the y(j) are landing of level 1 in type (i), and
s<∞ in types (ii) and (iii).
•
Suppose that we approach the endpoint from outside of the height
interval, so that nj→∞ as j→∞. By taking a
subsequence, we can assume that qnj−1→y∈γt. Since the
qnj−1 are determined by the tj, i.e. by the decomposition
elements gj′ containing the ηj, it is enough to show that the
decomposition element containing η depends only on y: in fact, we
will show that this decomposition element is A0,0 if y=cu; is
Xt if y=a or y=αu; and is Γ′(y,0,0) otherwise.
If y∈\accentset∘γt, then sequences (ηj) of type (i) converge to
η=(y,s) with y=t(y,0,0) or y=t(y,0,0), and
s∈[1+u(y),∞]: therefore η is contained in Γ′(y,0,0) if
y=cu, and in A0,0 if y=cu (see
Lemma 5.7). Sequences (ηj) of
type (ii) converge to η=(t(z,0,0),1+u(y)) for some z
between y and y: therefore η is contained in Γ′(y,0,0) if y=cu, and in A0,0 if y=cu (in which case z=y).
Sequences (ηj) of type (iii) converge to (t(y,0,0),s) with
s∈[1+u(y),∞], since the first nj+1 entries of y(j) are
⟨Btj(a),qnj−1,Btj−1(qnj−1),…Btj−(nj−1)(qnj−1),…⟩, and again η is in
Γ′(y,0,0) if y=cu, and in A0,0 if y=cu.
As before, y and all of the y(j) are landing of level 1 in
type (i), and s<∞ in type (ii). For sequences of type (iii), we
have that y=t(y,0,0) is landing of level 1, sj≤nj+1, and
yi(j)∈\accentset∘γtj for 2≤i≤nj, so that the proof is
completed using Lemma 5.24 (c).
If y=a or y=αu, then sequences of type (i) and of type (iii)
converge to η=(y,s) with Btr(y)0∈\accentset∘γt for
all r∈Z (and with s∈[1,∞]): that is, to η∈Xt;
while sequences of type (ii) converge to η=(t(z,0,0),1) for
some z∈γt, which is contained in the set B0,0 of
Lemma 5.7, and hence in Xt. That
Ψtj(y(j),sj)→Ψt(y,s) follows as when y∈\accentset∘γt.
The argument when t is of irrational or rational early endpoint type is
similar. In this case we must have nj→∞. Taking a subsequence so
that qnj−1→y∈γt, and referring to the notation of
Lemma 5.3, we see that:
•
If y=cu, then sequences of types (i), (ii), and (iii) all
converge to elements of A1;
•
If y∈\accentset∘γt∖{a,αu}, then sequences of all three
types converge to elements of C1,min(y,y); and
•
If y∈{a,αu}, then sequences of all three types converge
to elements of D1⊂Xt.
The argument that Ψtj(y(j),sj)→Ψt(y,s)
for sequences of types (i), (ii), and (iii) uses parts (b), (a), and (c) of
Lemma 5.24 respectively.
**3. **If ηj=(y(j),sj)∈⋃yΓ′(y,0,0) for all j, then let yj∈(cu,a]∖{min(qnj−1,qnj−1)} be such that ηj∈Γ′(yj,0,0), and take a
subsequence so that yj→y∈[cu,a] (as usual, cu and qnj−1
have a suppressed dependence on tj). Taking a further subsequence if
necessary, we can assume that one of the following occurs for all j:
(i)
y(j) is either t(yj,0,0) or t(yj,0,0), and sj∈[1+u(yj),∞]; or
2. (ii)
y(j)∈[t(yj,0,0),t(yj,0,0)], and sj=1+u(yj). (The interval, as usual, is the one with the given endpoints
which is disjoint from P.)
If t is of irrational or early endpoint type; or if t is of rational
interior or normal or quadratic-like endpoint type with height m/n and
y=min(qn−1,qn−1), it then follows straightforwardly that:
•
If t is of rational interior or late endpoint type, then the
limit η lies in A0,0 if y=cu; in D0,0 if y=a; and in
Γ′(y,0,0) otherwise.
•
If t is of rational normal or quadratic-like endpoint type,
then η lies in A0,0 if y=cu; in Xt if y=a; and in
Γ′(y,0,0) otherwise.
•
If t is of irrational or rational early endpoint type,
then η lies in A1 if y=cu; in Xt if y=a; and in C1,y
otherwise.
Suppose, then, that t is of rational interior or normal or quadratic-like
endpoint type with height m/n, and that we have y=min(qn−1,qn−1).
•
If t is of interior type, then mj/nj=m/n for all sufficiently
large j. Sequences y(j) of type (i) converge to t(a,1,0), to
t(αu,1,0), or to t(qn−1,0,0), while sj→s∈[1+u(qn−1),∞], and hence ηj→η∈D0,0.
Similarly, sequences of type (ii) converge to η=(y,1+u(qn−1)),
where y∈[t(qn−1,0,0),t(a,1,0)]∪[t(qn−1,0,0),t(αu,1,0)], so that η∈D0,0.
•
If t is of endpoint type and mj/nj=m/n for all
sufficiently large j, then similarly η∈D0⊂Xt.
•
If t is of endpoint type and nj→∞, then
sequences of both types (i) and (ii) converge to η=(y,s) with
Btr(y)0∈\accentset∘γt for all r∈Z: that is, to η∈Xt.
In all cases either s<∞, or y and the y(j) are all landing
of level 1, so that Ψtj(y(j),sj)→Ψt(y,s) as
j→∞ by Lemma 5.24 (a) and (b).
**Case B: **All tj are of rational normal or quadratic-like
endpoint type.
In this case the decompositions Gtj′ are given by
Lemmas 5.7
and 5.8, and the limit parameter t cannot
be of rational interior or late endpoint type. We will assume that all of the
tj are of strict left hand endpoint type (either tent-like or
quadratic-like): the right hand endpoint case is similar. Let the height
of tj be mj/nj. Suppose first that infinitely many (and so, taking a
subsequence, all) of the ηj are contained in the decomposition elements
Xtj: that is, in one of the sets Di of
Lemmas 5.7 (b)
or 5.8 (b), or in one of the
verticals Lt(y) of Lemma 5.8 (c). We
will show that η∈Xt.
If infinitely many of the ηj are contained in the lines Lqi−mj−1modnj, Lt(αu,k,i), or Lt(y) then
Btr(y)0∈\accentset∘γt for all r∈Z, so that η∈Xt as
required. We can therefore assume that there are kj∈Z and 0≤ij≤nj−1 such that ηj=(y(j),sj) satisfies y(j)∈\accentset∘Rkj,ij (that is, y(j)=t(yj,kj,ij) for some yj∈\accentset∘γtj),
and sj∈(0,ukj,ij], where
[TABLE]
The sequence (njkj+ij) must therefore be bounded below since s>0. If
it is not bounded above then, since the first njkj+ij+1 entries of
t(yj,kj,ij) are disjoint from \accentset∘γtj, we have
Btr(y)0∈\accentset∘γt for all r∈Z, and hence η∈Xt. We
can therefore assume that njkj+ij is constant and, acting on T∗
by the decomposition-preserving homeomorphism H∗−njkj−ij, that
it is equal to [math], so that kj=ij=0, for all j, and s∈(0,1]. Take a subsequence so
that yj→y∈γt, and either mj/nj is constant or
nj→∞.
If mj/nj is constant, then t is of rational endpoint type and either
ηj→(t(y,0,0),s)∈B0,0, or (if y∈\accentset∘γt)
Btr(y)0∈\accentset∘γt for all r∈Z. Therefore η∈Xt.
Suppose then that nj→∞ as j→∞. If y is not on the
Bt-orbit of Bt(a) then η=(y,s) with s∈(0,1] and y=⟨Bt(a),y,Bt−1(y),Bt−2(y),…⟩. If t is of rational
normal endpoint type then η∈B0,0⊂Xt, while if t is of
irrational or rational early endpoint type then y=t(y,1) and (see
Lemma 5.3) η∈D1⊂Xt. On the other hand,
if y is on the Bt-orbit of Bt(a), then t is of rational normal
endpoint type and y∈{a,αu}, so that Btr(y)0∈\accentset∘γt
for all r∈Z. Therefore η∈Xt.
This completes the proof that if ηj∈Xtj for all j, then
η∈Xt. We can therefore assume that there are kj∈Z and 0≤ij≤nj−1 such that
[TABLE]
for each j. The remainder of the proof is now similar to but simpler
than that in case A. By the same argument as in that case (using part (c)
rather than part (b) of Lemma 5.9), we can
reduce to having kj=ij=0 for all j.
•
If ηj∈A0,0 for all j then η∈A0,0 if t is
of rational normal or quadratic-like endpoint type, and η∈A1 if
t is of irrational or rational early endpoint type.
•
If ηj∈⋃yΓ′(yj,0,0) for some sequence yj∈(cu,a), then take a subsequence so that yj→y∈[cu,a]. If y=a
then η∈Xt. If y=cu then η∈A0,0 if t is of rational
normal or quadratic-like endpoint type, and η∈A1 if t is of
irrational or rational early endpoint type. If y∈(cu,a), then
η∈Γ′(y,0,0) if t is of rational normal or quadratic-like
endpoint type, and η∈C1,y if t is of irrational or rational
early endpoint type.
**Case C: **All tj are of irrational or rational early
endpoint type.
In this case the decompositions Gtj′ are given by
Lemma 5.3. If all of the ηj are contained in the
decomposition elements Xtj, then η∈Xt by an argument exactly
analogous to that in case B. We can therefore assume that there are
integers rj such that
[TABLE]
for each j. If (rj) is not bounded above, then by
Lemma 5.9 (a) there is a subsequence of the
ξj=Ψtj(ηj) contained in decomposition elements whose
diameters go to zero; while if (rj) is not bounded below then
Btr(y)0∈\accentset∘γt for all r∈Z, so that η∈Xt. We
can therefore assume that rj is constant and, acting on T∗ by the
decomposition-preserving homeomorphism H∗1−rj, that rj=1 for
all j. The analysis of the different cases then proceeds exactly as in
case B.
∎
In this section we consider the case in which f is a tent map
(of slope t>2) for which the orbit of b is either periodic or
preperiodic. In particular (see Lemma 2.22 (a) and
Remark 2.26), q(κ(f))=m/n is rational, and f is of
interior or normal endpoint type.
We will show that the sphere homeomorphism F:Σ→Σ constructed
in the proof of Theorem 5.15 is pseudo-Anosov when
κ(f)=NBT(m/n); and otherwise is generalized pseudo-Anosov, in the sense
of the following definition from [21].
Definition 5.27** (Generalized pseudo-Anosov).**
A sphere homeomorphism Φ:S2→S2 is generalized pseudo-Anosov if there exist
(a)
a finite Φ-invariant set Z;
2. (b)
a pair (Fs,μs), (Fu,μu) of transverse measured
foliations of S2∖Z (whose transverse measures are non-atomic and
positive on open subsets on transversals) with countably many pronged
singularities, which accumulate on each point of Z and have no other
accumulation points; and
3. (c)
a real number λ>1 such that Φ(Fs,μs)=(Fs,λ1μs) and Φ(Fu,μu)=(Fu,λμu).
We will do this by proving (Theorem 5.31) that F is topologically
conjugate to the explicit generalized pseudo-Anosov Φ constructed
in [21] corresponding to the kneading sequence κ(f). The existence
of the conjugacy will be a consequence of the following list of properties
of Φ (see Figure 19).
(P1)
The homeomorphism Φ is given by Φ=Φ∗/∼:R/∼→R/∼, where Φ∗:R→R is a continuous
self-map of a metric disk R, and ∼ is a Φ∗-invariant equivalence
relation on R for which R/∼ is a sphere.
2. (P2)
There is a projection π:R→[a,b] which semi-conjugates Φ∗
to the tent map f.
3. (P3)
For each x∈[a,b], the fiber Fx:=π−1(x) is a compact
interval if x is not on the (finite) orbit of b, and is a dendrite
otherwise.
4. (P4)
The map x↦Fx is upper semi-continuous with respect to the
Hausdorff metric (that is, for every x0∈[a,b] and every neighborhood U
of Fx0, there is a neighborhood V of x0 with Fx⊂U
for all x∈V).
5. (P5)
Φ∗ is injective on each fiber Fx, and contracts it uniformly by
a factor 1/t (where t is the slope of the tent map f).
6. (P6)
The dynamics of Φ∗ on the boundary ∂R is given by the
outside map B:S→S corresponding to f. More precisely (Lemma 16
of [21]), there is a homeomorphism θ:S→∂R with
the property that Φ∗(θ(y))∈∂R if and only if
y∈\accentset∘γ, and in this case Φ∗(θ(y))=θ(B(y)).
Moreover, τ(y)=π(θ(y)) for each y∈S. We will suppress the
homeomorphism θ, and label points and subsets of ∂R with the
same symbols as the corresponding points and subsets of S. With this
convention, we have Φ∗=B on ∂R∖\accentset∘γ.
7. (P7)
If x∈[a,f(a)) or x=b then Φ∗(Fz)=Fx, where z is the
unique element of [a,b] with f(z)=x.
8. (P8)
If x∈[f(a),b), then x has two f-preimages z,z∈[a,α]. We
have Φ∗(Fz)∪Φ∗(Fz)=Fx; and Φ∗(Fz) and Φ∗(Fz) intersect at exactly one
point, which is Φ∗(zu)=Φ∗(zu). (Notice that zu,zu∈γ.)
9. (P9)
The equivalence relation ∼ is defined as follows: if ξ,ξ′∈R, then ξ∼ξ′ if and only if there is some r≥0 such that
either Φ∗r(ξ)=Φ∗r(ξ′), or Φ∗r(ξ) and Φ∗r(ξ′)
both belong to the periodic orbit P of Φ∗ on ∂R. (This
periodic orbit is given by Theorem 4.33 (b)(iii) in the
interior case; and is the orbit of B(a) in the endpoint case.)
We will also use the following consequences of these
properties:
(P10)
It follows from (P7) and (P8) that Φ∗ is injective away from
γ∖{cu}, while if y∈γ∖{cu} then
Φ∗−1(Φ∗(y))={y,y}. In particular the only point of ∂R which has more than one preimage is q0.
2. (P11)
It follows from (P7) and (P8) that Φ∗ is surjective; and
3. (P12)
It follows from (P6), (P9), and (P10) that all of the non-trivial
equivalence classes of ∼ are contained in ∂R.
Definitions 5.28** (Φ∗:R→R, π:R→I).**
Write
R=lim(R,Φ∗), and let Φ∗:R→R be the natural
extension of Φ∗. Let π:R→I be the function induced by the
semi-conjugacy π:R→I of (P2), that is, π(ξ)i=π(ξi).
We will show (Theorem 5.31) that F:Σ→Σ is
topologically conjugate to Φ:R/∼→R/∼. The proof
is structured as follows. We first show (Lemma 5.29) that
π is a homeomorphism which conjugates Φ∗ and f. There are
therefore commutative diagrams
[TABLE]
where p0(ξ)=ξ0, and p∼ is the canonical
projection of ∼. In order to show that F and Φ are conjugate, it
therefore suffices to show that the fibers of g∘π agree with those of
p∼∘p0: in other words, that g(π(ξ))=g(π(ξ′)) if and
only if ξ0∼ξ0′. This will be done using the description of the
fibers of g given in Remark 5.17, together with the
technical Lemma 5.30.
Lemma 5.29**.**
π* is a homeomorphism which conjugates Φ∗
and f.*
Proof.
π is clearly continuous, and semi-conjugates Φ∗ and
f since π semi-conjugates Φ∗ and f. We will exhibit an explicit
inverse v:I→R of π, which will establish the result since
R and I are compact metric spaces.
To do this, we first define a function h:I→R. Let x∈I. Then
Fx0⊃Φ∗(Fx1)⊃Φ∗2(Fx2)⊃⋯ by (P7) and (P8). Since each
Φ∗j(Fxj) is compact and non-empty by (P3) and (P1), the
intersection ⋂j≥0Φ∗j(Fxj) is non-empty; moreover, it
contains a single point by (P5). We define h(x)∈Fx0 to be the
unique point of this intersection. Then h∘f=Φ∗∘h by
construction. Moreover, h is continuous: for if U is a neighborhood
of h(x), then by (P5) and the definition of h there is some N with
Φ∗N(FxN)⊂U. By (P4), if x′ is sufficiently close
to x then we have also Φ∗N(FxN′)⊂U, and hence
h(x′)∈U.
Define v:I→R by v(x)i=h(f−i(x)). That v(x)∈R
follows from Φ∗∘h=h∘f, which gives
Φ∗(h(f−(i+1)(x)))=h(f−i(x)) for each i.
We now show that v is inverse to π. First, let x∈I. Then for
each i≥0,
[TABLE]
since h(f−i(x))=h(⟨xi,xi+1,…⟩)∈Fxi. On the other hand, if ξ∈R, then for each i≥0,
[TABLE]
since for every j≥0 we have ξi=Φ∗j(ξi+j)∈Φ∗j(Fπ(ξi+j)), so that ξi is the unique element of
⋂j≥0Φ∗j(Fπ(ξi+j)).
∎
The following lemma expresses the connection between the equivalence
relation ∼ defined in (P9) and the identifications on I described in
Remark 5.17.
Lemma 5.30**.**
Let ξ,ξ′∈R.
(a)
If f is of rational general type, then ξ0=ξ0′ but
ξ1=ξ1′ if and only if either
[TABLE]
2. (b)
If f is of rational NBT type, then ξ0=ξ0′ but
ξ1=ξ1′ if and only if
[TABLE]
3. (c)
If f is of rational (normal) endpoint type, then ξ0=ξ0′ but
ξ1=ξ1′ if and only if either
[TABLE]
where A=a if κ(f)=rhe(m/n), and A=αu if
κ(f)=lhe(m/n).
4. (d)
If f is of rational (normal) endpoint type, then there is some r≥0 with Φ∗r(ξ0)∈P (the periodic orbit of (P9)) if and only if
there is some i with 0≤i≤n−1 such that either
π(ξ)=ω(qi), or π(ξ)=ω(t(A,k,i)) for some
k∈Z, where A=a if κ(f)=rhe(m/n), and A=αu if
κ(f)=lhe(m/n).
Proof.
Assume first that f is of general type. By (P10), we have
ξ0=ξ0′ but ξ1=ξ1′ if and only
if {ξ1,ξ1′}={y,y} for some y∈γ∖{cu}.
Since (i) Φ∗−1(∂R)⊂∂R; (ii) the only point
of ∂R which has more than one preimage is
q0=Φ∗(a)=Φ∗(αu); and (iii) the only point of γ on the orbit
of q0 is qn−1, it follows that, for y∈γ∖{cu,qn−1,qn−1}, we have
[TABLE]
Here we have used (P6) (in particular that Φ∗=B on
S∖\accentset∘γ in the first line, and that π=τ on S in the second
line); we have used that π∘Φ∗=f∘π in the second line; and we
have used (17) in the final line.
In the case y∈{qn−1,qn−1}, we have ξ1=qn−1 if and only
if
[TABLE]
while ξ1=qn−1 if and only if ξ=⟨Φ∗(qn−1),qn−1,B−1(qn−1),…⟩. These give the
other two possibilities in the statement of (a),
using (17).
The argument in the NBT case is identical, except that the case y∈{qn−1,qn−1} does not arise since qn−1=cu.
Suppose then that f is of normal endpoint type. As in the general case, we
have ξ0=ξ0′ but ξ1=ξ1′ if and only if {ξ1,ξ1′}={y,y} for some y∈γ∖{cu}. The argument for
y∈{cu,qn−1,qn−1} (i.e. for y∈\accentset∘γ∖{cu})
is identical to the general case. Suppose then, without loss of generality,
that ξ1=a and ξ1′=αu.
Consider first the case where κ(f)=rhe(m/n), so that we have
Bn(a)=Bn(αu)=αu. Then
[TABLE]
while either
[TABLE]
Therefore π(ξ)=ω(t(a,0,0)); while either
π(ξ′)=ω(qi) or
π(ξ′)=ω(t(a,ℓ,0)) for some ℓ>0. Here we have
used (17); and we have used (10) to show that
π(⟨(q0,αu,qn−2,…,q1)∞⟩)=ω(qi).
The case where κ(f)=lhe(m/n) works analogously, and the result follows.
For (d), there is some r≥0 with Φ∗r(ξ0)∈P if and only if either
ξ0∈P (i.e. ξ0=qi for some i), or ξ0=B−s(A) for some
s≥0. This is equivalent to
[TABLE]
The first of these is equivalent to π(ξ)=ω(qi)
for some i; the second to π(ξ)=ω(t(A,k,i)) for some i and
some k≥0; and the third (noting Remark 4.51) to
π(ξ)=ω(t(A,k,i)) for some i and some k<0.
∎
Theorem 5.31**.**
Let f be a post-critically finite tent map of slope t>2. Then the
sphere homeomorphism F:Σ→Σ constructed in the proof of
Theorem 5.15 is topologically conjugate to the generalized
pseudo-Anosov Φ:R/∼→R/∼ constructed
in [21].
Proof.
By (18) and the accompanying discussion, it is only
necessary to show that for all pairs ξ,ξ′ of distinct elements
of R, we have g(π(ξ))=g(π(ξ′)) if and only if
ξ0∼ξ0′.
We start with the case where f is of general type. In this case the points
of P (the periodic orbit of (P9)) have unique Φ∗-preimages —
which are, of course, in P — and hence, by (P9), ξ0∼ξ0′ if and
only if either
(i)
Φ∗r(ξ0)=Φ∗r(ξ0′) for some r≥0; or
2. (ii)
ξ0,ξ0′∈P.
Since ξ=ξ′, condition (i) is equivalent to the
condition
[TABLE]
For if (19) holds, then either s≤0, in
which case ξ0=ξ0′; or s>0, in which case
Φ∗r(ξ0)=Φ∗r(ξ0′) for r=s. Conversely, suppose that there is
some r≥0 for which Φ∗r(ξ0)=Φ∗r(ξ0′), and pick this r to
be as small as possible. If r>0 then we have Φ∗r(ξ)0=Φ∗r(ξ′)0, but Φ∗r−1(ξ0)=Φ∗r−1(ξ0′), so that
Φ∗r−1(ξ)0=Φ∗r−1(ξ′)0; that is,
Φ∗r(ξ)1=Φ∗r(ξ′)1, and hence (19) holds
with s=r. On the other hand, if r=0 then ξ0=ξ0′. Since
ξ=ξ′, there is some greatest i≥0 with ξi=ξi′. Then we
have Φ∗−i(ξ)0=Φ∗−i(ξ′)0 but
Φ∗−i(ξ)1=Φ∗−i(ξ′)1, so that (19)
holds with s=−i.
Therefore condition (i) holds if and only if there is some s∈Z such that
{π(Φ∗s(ξ)),π(Φ∗s(ξ′))} is one of the pairs from the
statement of Lemma 5.30 (a). By Lemma 5.29,
this is equivalent to the existence of s∈Z such that
{fs(π(ξ)),fs(π(ξ′))} is one of these pairs.
Setting r=−s, this in turn is equivalent to the existence of r∈Z such
that {π(ξ),π(ξ′)} is the image under fr of one of these
pairs. That is, condition (i) holds if and only if there is some k∈Z and
0≤i≤n−1 such that
[TABLE]
Observing that condition (ii) holds if and only if π(ξ),π(ξ′)∈ω(P) and comparing with
Remark 5.17 (e), we see that ξ0∼ξ0′ if and only
if g(π(ξ))=g(π(ξ′)).
The proof in the NBT case is similar, using Lemma 5.30 (b) and
Remark 5.17 (f).
Suppose, then, than f is of (normal) endpoint type, so that qn−1 is
either a or αu: as before, we will write A=qn−1, so that
qn−1=αu and A=a when κ(f)=rhe(m/n); while qn−1=a and
A=αu when κ(f)=lhe(m/n). The periodic orbit P of Φ∗
on ∂R is therefore P={q0,q1,…,qn−1} (that is, it is
equal to Q), and the two Φ∗-preimages of q0 are a and αu.
By (P9), ξ0∼ξ0′ if and only if either
(i)
Φ∗r(ξ0)=Φ∗r(ξ0′) for some r≥0; or
2. (ii)
Φ∗r(ξ0),Φ∗r(ξ0′)∈P for some r≥0.
As in the general case, condition (i) is equivalent to (19),
which in turn is equivalent to the existence of r∈Z such that
{π(ξ),π(ξ′)} is the image under fr of one of the pairs
from the statement of Lemma 5.30 (c). That is, condition (i) holds
if and only if there is some k∈Z and 0≤i≤n−1 such that
[TABLE]
On the other hand, by Lemma 5.30 (d), condition (ii) holds if and
only if there are integers k and k′, and 0≤i,i′≤n−1 such that
π(ξ)=ω(qi) or π(ξ)=ω(t(A,k,i)); and π(ξ′)=ω(qi′) or π(ξ′)=ω(t(A,k′,i′)).
Combining conditions (i) and (ii), we obtain that ξ0∼ξ0′ if and only
if either there exist y∈\accentset∘γ∖{cu}, k∈Z, and 0≤i≤n−1 such that
{π(ξ),π(ξ′)}={ω(t(y,k,i)),ω(t(y,k,i))};
or
[TABLE]
Comparing with Remark 5.17 (c), we see that
ξ0∼ξ0′ if and only if g(π(ξ))=g(π(ξ′)), as required.
∎
A detailed description of the dynamics of the sphere homeomorphism F in the
case where f is a tent map but is not post-critically finite is the subject
of ongoing research. Here we only give a straightforward statement about the
way in which dynamical properties of a general f carry over to F. Recall
that a Borel probability measure on a topological manifold M is called an
Oxtoby-Ulam measure, or OU-measure, if it is non-atomic, positive
on open sets, and assigns zero measure to the boundary of M (if it has one).
Theorem 5.32** (Sphere homeomorphism dynamics).**
Let f be a unimodal map satisfying the conditions
of Convention 2.8, and F:Σ→Σ be the
corresponding sphere homeomorphism given by Theorem 5.15. Then
(a)
if f is topologically transitive then so is F;
2. (b)
if f has dense periodic points, then so does F;
3. (c)
f* and F have the same number of periodic orbits of each period, with
the exception that, provided κ(f)=10∞,*
•
F* has one more fixed point than f, and*
•
if f is of rational type with
q(κ(f))=m/n∈(0,1/2), then F has either one or two fewer period n
orbits than f.
4. (d)
f* and F have the same topological entropy; and*
5. (e)
if f preserves an ergodic OU-measure, then F preserves an ergodic
OU-measure with the same metric entropy.
In particular, if f is a tent map of slope t∈(2,2]
restricted to its dynamical interval, then F is topologically transitive, has
dense periodic points, has topological entropy log(t), and has an invariant
ergodic OU-measure with metric entropy log(t).
Proof.
It is well known that if f is topologically transitive or has
dense periodic points, then the same is true of its natural extension f.
Since these properties are preserved by semi-conjugacy, (a) and (b) follow.
(c) follows from the explicit descriptions of the fibers of the semi-conjugacy
g:I→Σ given in Remark 5.17. The only
fiber which contains periodic points is the exceptional fiber in the rational
case: in the normal endpoint case this fiber contains the period n
orbit ω(Q); in the interior and late endpoint cases it is equal to the
period n orbit ω(P); and in the early or quadratic-like strict
endpoint cases, it contains both period n orbits ω(P) and
ω(Q) (or the single semi-stable orbit ω(P)=ω(Q)). In all cases, the exceptional fiber is collapsed to a fixed point of F.
For (e), it is also well known that if μ is an f-invariant Borel
probability measure, then there is a unique f-invariant Borel probability
measure μ on I characterized by (πn)∗(μ)=μ for all n
(here πn:I→I is defined by πn(x)=xn); moreover, μ
is ergodic if and only if μ is; and μ and μ have the same metric
entropy. If μ were atomic then μ would be also. Moreover, since a base
for the topology on I is given by the set of all πn−1(U), where U
is non-empty and open in I, and since μ(πn−1(U))=μ(U), we have
that μ is positive on open sets if μ is.
Write μ~=g∗(μ), so
that μ~ is F-invariant and ergodic. Since g is continuous, μ~ is
also positive on open sets. To show that μ~ is non-atomic, suppose for a
contradiction that there were some z∈Σ with μ~(z)>0. Then, since
μ~ is F-invariant and ergodic, z would belong to a periodic orbit of
full measure, a contradiction since the complement of this periodic orbit would
be open and non-empty.
Except perhaps for a single point (which we now know has μ~-measure zero),
the point preimages of the semi-conjugacy g are finite. Thus g has finite
preimages μ~-almost everywhere and so μ and μ~ have the same
metric entropy.
Therefore μ~ is an F-invariant ergodic OU-measure as required. Since tent
maps of slope t>2 restricted to their dynamical intervals are
transitive, have dense periodic points, have topological entropy log(t), and
have invariant ergodic OU-measures with metric entropy log(t), the final
statement follows.
∎
Remark 5.33**.**
A theorem of Oxtoby and Ulam (see [35] and Appendix 2
of [3]) states that if m1 and m2 are OU-measures on a manifold M,
then there is a homeomorphism h:M→M with h∗(m1)=m2. Therefore
by conjugating the sphere homeomorphism F, we can make it preserve any
OU-measure; in particular, one coming from an area form on Σ.
Appendix A The embedding is independent of the unwrapping
In this appendix we will prove the following result, which establishes that the
prime ends of (T,I) are independent of the choice of unwrapping of the
unimodal map f.
*Theorem 2.15. Any two
unwrappings of a unimodal map f are equivalent. ***
Recall that unwrappings f0 and f1 of f, which have associated
Barge-Martin homeomorphisms H0:(T0,I)→(T0,I) and
H1:(T1,I)→(T1,I), are equivalent if there is a
homeomorphism λ:T0→T1 which restricts to the
identity on I. Theorem 2.15 is a consequence
of the following recent deep result (Theorem 7.3 of [34]).
Theorem A.1** (Oversteegen–Tymchatyn).**
Let K be a continuum and {αt}t∈[0,1]:K→S2 be an isotopy of embeddings of K into the sphere. Then there is an
ambient isotopy {At}t∈[0,1]:S2→S2 with A0=id and
αt=At∘α0 for all t.
Definition A.2** (Weak unwrapping).**
A weak unwrapping of a unimodal map f is
an orientation-preserving near-homeomorphism f:T→T which is
injective on I with f(I)⊂{(y,s):s≥1/2}, and satisfies
Υ∘f∣I=f.
Remark A.3**.**
A weak unwrapping differs from an unwrapping in that it
is not required that the second component of f(y,s) is equal to s
whenever s∈[0,1/2]. A Barge-Martin homeomorphism can be associated to a
weak unwrapping in exactly the same way as to an unwrapping, although it may
not have I as a global attractor (if f pushes points with
s∈[0,1/2] outwards more strongly than the smash Υ pulls them
inwards).
Definition A.4** (u-near-isotopy).**
A homotopy {ft}:T→T of weak
unwrappings of a fixed unimodal map f is called a u-near-isotopy (for
“unwrapping near-isotopy”).
Remark A.5**.**
It is not obvious that a homotopy of near-homeomorphisms of T
can be uniformly approximated by isotopies, and therefore merits the name near-isotopy. That this is the case follows from a theorem of Edwards and
Kirby (Corollary 1.1 of [24]), which states that the
homeomorphism group of any manifold is locally contractible, and hence locally
path connected.
Lemma A.6**.**
Any two u-near-isotopic unwrappings f0:T→T and f1:T→T of a unimodal map f are equivalent.
Proof.
Let {ft} be a u-near isotopy from f0
to f1, and for each t let Ht:(Tt,I)→(Tt,I)
be the Barge-Martin homeomorphism associated with ft. By
Theorem 2.14, there are homeomorphisms ht:Tt→S2 with the property that {Φt=ht∘Ht∘ht−1}:S2→S2 is an isotopy. It follows from the construction of
the homeomorphisms ht (as compositions ht=p1∘β∘ιt) in
the proof of Corollary 2.3 of [14] — which applies equally well
to weak unwrappings as to unwrappings — that ht∣I varies continuously
with t, so that {ht∣I} is an isotopy of embeddings of the
continuum I into S2.
By Theorem A.1, there is an isotopy {At}:S2→S2 with
A0=id and ht∣I=At∘h0∣I for all t. Let λ=h1−1∘A1∘h0:T0→T1. Then λ is the required homeomorphism which restricts to
the identity on I.
∎
Remark A.7**.**
Lemma A.6 extends to apply to any continuous
surjection f:K→K, where K is a Peano non-separating planar
continuum. A theorem of Brechner and Brown [15] states that such a
continuum K has a Disk Mapping Cylinder Neighborhood: that is, it can
be embedded in a disk D in such a way that there is a continuous map
ϕ:S1×[0,1]→D with K=ϕ(S1×{1}), and
ϕ(y1,s1)=ϕ(y2,s2)⟹s1=s2=1. (In fact, Brechner and Brown
show that a planar continuum has a Disk Mapping Cylinder Neighborhood if and
only if it is Peano and non-separating.) Using the associated “coordinates”
(y,s), the Barge-Martin construction can be carried out exactly as in the
case K=I, and the proof of Lemma A.6 goes through without
change.
We next show that there are only two u-near-isotopy classes of unwrappings of a
given unimodal map f. Since a weak unwrapping f is injective on I,
one of the following two cases must occur
(a)
For every x∈[a,c) either f(x)=(f(x)u,s1) and
f(x^)=(f(x)ℓ,s2); or f(x)=(f(x)u,s1) and
f(x^)=(f(x)u,s2) with s1<s2; or f(x)=(f(x)ℓ,s1) and
f(x^)=(f(x)ℓ,s2) with s1>s2.
2. (b)
For every x∈[a,c) either f(x)=(f(x)ℓ,s1) and
f(x^)=(f(x)u,s2); or f(x)=(f(x)u,s1) and
f(x^)=(f(x)u,s2) with s1>s2; or f(x)=(f(x)ℓ,s1) and
f(x^)=(f(x)ℓ,s2) with s1<s2.
We say that f is of type “up” in case (a), and of type
“down” in case (b) (our preferred unwrapping is therefore of type “down”).
Lemma A.8**.**
If two unwrappings f0 and f1 of a unimodal
map f are of the same type, then they are u-near-isotopic.
Proof.
We show first that any unwrapping f of f is
u-near-isotopic to a weak unwrapping which is a homeomorphism, and which has
the same type as f. Since f is a near-homeomorphism, it follows
from the theorem of Edwards and Kirby stated in Remark A.5 that it is
the endpoint of a pseudo-isotopy: that is, that there is a homotopy
{gt}:T→T with g0=f and gt a homeomorphism for t>0.
Define αt=gt∣I:I→T. Since f∣I is a homeomorphism by
definition, {αt} is an isotopy of embeddings. By
Theorem A.1, there is an isotopy {At}:T→T with A0=id
and αt=At∘α0 for all t. Define gt=At−1∘gt, so that g0=f. If t>0 then gt is a homeomorphism
with gt∣I=At−1∘αt=α0=f∣I, so that gt is a weak unwrapping. Therefore f is
u-near-isotopic to the homeomorphism weak unwrapping g1, which is
clearly of the same type as f.
We can therefore complete the proof by showing that if f0 and f1
are homeomorphism weak unwrappings of the same type, then they are
u-near-isotopic. Write ζ:T→I for the map (y,s)↦(y,1).
A fiber in T is an arc of the form ζ−1(x) for some x∈I.
Since f0 and f1 have the same type, we can slide from one to the
other along fibers to produce an isotopy of embeddings {αt}:I→T with α0=f0∣I, α1=f1∣I, and ζ∘αt=f for all t. By Theorem A.1
there is an isotopy {At}:T→T with A0=id and
αt=At∘α0 for all t. Let {Bt}:T→T be the
isotopy defined by Bt=At∘f0. Now
[TABLE]
Therefore {Bt} is a u-near-isotopy (consisting of homeomorphisms) from
f0 to B1.
Now B1∣I=A1∘f0∣I=A1∘α0=α1=f1∣I. Therefore B1 and f1 are orientation-preserving
homeomorphisms T→T which agree on the embedded arc I: by the Alexander
trick, they are isotopic by an isotopy which is constant on I. This isotopy
is a u-near-isotopy from B1 to f1, so that f0 and f1
are u-near-isotopic as required.
∎
Let f be a
unimodal map. By Lemmas A.6 and A.8, any two
unwrappings of f of the same type are equivalent. It therefore only remains
to show that there exist unwrappings f0 and f1 of different types
which are equivalent.
Let Γ:T→T be the involution defined by
Γ(xu,s)=(xℓ,s) and Γ(xℓ,s)=(xu,s). Let f0 be any
unwrapping of type “down”, and let f1=Γ∘f0∘Γ, which is of type “up”. Since Γ commutes with the smash, if
Hi=Υ∘fi:T→T for each i, then H1=Γ∘H0∘Γ.
It follows that the map λ:T0→T1 defined by
λ(⟨x0,x1,…⟩)=⟨Γ(x0),Γ(x1),…⟩ is a
homeomorphism which restricts to the identity on I.
∎
Appendix B Technical lemmas
In this appendix we prove two lemmas about the dynamics of unimodal maps. As is
the case throughout the paper, we assume that unimodal maps satisfy the
conditions of Definition 2.1 and Convention 2.8.
Lemma B.1**.**
Let f:[a,b]→[a,b] be unimodal with turning
point c. Then there is some N such that fN([a,c])=[a,b].
Proof.
κ(f)≻101∞ by
Convention 2.8 (a), so that κ(f)=10(11)ℓ0…
for some ℓ≥0. We shall show that f2ℓ+2([a,c])=[a,b].
We first show by finite induction on i that [a,c]⊂f2i([a,c]) for
0≤i≤ℓ. The base case is trivial. If 1≤i≤ℓ then in
particular ℓ≥1, so that f2(a)≥c. We have by the inductive
hypothesis that f2i−2([a,c])⊃[a,c]. Therefore
f2i−1([a,c])⊃[f(a),b], and f2i([a,c])⊃[a,f2(a)]⊃[a,c] as required.
Therefore f2ℓ([a,c])⊃[a,c]. Since f2ℓ(a)∈f2ℓ([a,c]), it follows that f2ℓ([a,c])⊃[c,f2ℓ(a)]
and so f2ℓ+1([a,c])⊃[f2l+1(a),b]⊃[c,b], the latter inclusion coming from the fact that
κ(f)2ℓ+2=0. Therefore f2ℓ+2([a,c])=[a,b] as required.
∎
If {ft} is a monotonic family of unimodal maps then, for each rational
m/n∈(0,1/2), the height m/n parameter interval starts when the kneading
sequence is (wq1)∞ (with the saddle-node creation of a periodic orbit
whose rightmost point has this itinerary). In a full family, this is followed
by an interval of parameters in which ft is renormalizable (starting with a
period-doubling cascade). This interval ends when the kneading sequence exceeds
wq0(wq1)∞. In the tent family, by contrast, kneading sequences κ
with (wq1)∞≺κ⪯wq0(wq1)∞ do not occur.
Lemma B.2**.**
Let f:[a,b]→[a,b] be unimodal with
q(κ(f))=q=m/n∈(0,1/2), and write θ=min(fn(a),fn(a)).
(a)
*If (wq0)∞≺κ(f)⪯wq0(wq1)∞ then θ=fn(a)
and fn([a,fn(a)))=[a,fn(a)]. *
Moreover, fn−1([f(a),fn+1(a)])=[a,fn(a)].
2. (b)
If wq0(wq1)∞≺κ(f)≺rhe(q) then there is
some N∈N with fN([a,θ))=[a,b].
Proof.
Recall that wq=10κ1(q)110κ2(q)11…110κm−1(q)110κm(q)−1 is a word of length n−1 containing
an odd number of 1s. Moreover κ1(q)=⌊1/q⌋−1>0 so that
wq=10….
(a)
Since (wq0)∞ and (wq0wq1)∞ are consecutive kneading
sequences (the latter is obtained from the former by period doubling), we
have (wq0wq1)∞⪯κ(f)⪯wq0(wq1)∞, and hence
κ(f)=wq0wq1…. In particular, ι(fn(a))=0…, so
that fn(a)≤c and θ=fn(a).
We will first show that fn−1(a)≤f2n−1(a). If
κ(f)=wq0(wq1)∞ then both fn−1(a) and f2n−1(a) have
itinerary (wq1)∞, and since κ(f) is not periodic it follows from
Convention 2.8 (b) that fn−1(a)=f2n−1(a). On the other
hand, if κ(f)=wq0(wq1)∞, then let ℓ≥1 and
ν∈{0,1}N be such that κ(f)=wq0(wq1)ℓν,
where ν does not start with the symbols wq1. Since κ(f)≺wq0(wq1)∞ we have ν≻(wq1)∞. Then ι(fn−1(a))=(wq1)ℓν≺(wq1)ℓ−1ν=ι(f2n−1(a)), so that fn−1(a)≤f2n−1(a) as required.
Now ι(a)=σ(wq0wq1…) and ι(fn(a))=σ(wq1…).
Therefore fi(a) and fi(fn(a)) lie in the same monotone piece of f for
0≤i≤n−3, and they lie in the decreasing piece of f for an even number
of values of i. Therefore fn−2([a,fn(a)))=[fn−2(a),f2n−2(a)).
Since fn−2(a)≤c≤f2n−2(a) (as κ(f)n−1=0 and
κ(f)2n−1=1), and c≤fn−1(a)≤f2n−1(a) (as shown in the
previous paragraph), it follows that fn−1([a,fn(a)))=[fn−1(a),b]
and hence fn([a,fn(a)))=[a,fn(a)] as required. Since f([a,fn(a))=[f(a),fn+1(a)), the final statement is immediate.
2. (b)
Recall that rhe(q)=10(wq1)∞. Using 10wq=wq01 (which is
true since cq=wq01 is palindromic), we have
[TABLE]
In particular, κ(f)=wq01…. We consider separately the case
where κ(f)=wq010… (so that θ=fn(a)), and the case where
κ(f)=wq011… (so that θ=fn(a)).
Case 1:κ(f)=wq010… and θ=fn(a).
Let ℓ≥0 and ν∈{0,1}N be such that
[TABLE]
where ν does not start with the
symbols wq1. Since κ(f)≻wq0(wq1)∞ we have
ν≺(wq1)∞.
Step 1: We will show that
[TABLE]
(Here, [a,σ(ν)) means an interval whose left hand
endpoint is a, and whose right hand endpoint has itinerary σ(ν):
the fact that there may be more than one point with this itinerary will not be
important. We will use this notation throughout the remainder of the proof.)
If ℓ=0 then this is immediate: θ=fn(a) has itinerary
σ(ν), and ν=1… since κ(f)=wq010…. We
therefore suppose that ℓ≥1, so that
[TABLE]
We show by finite induction on i that
[TABLE]
The case i=0 is straightforward, since the first n−2 symbols of
ι(a) and ι(θ) agree, and contain an even number of 1s.
Suppose then that 0<i≤ℓ−1, and assume, by the inductive hypothesis, that
fin−2([a,θ))=[0(wq1)ℓν,1(wq1)ℓ−iν).
Since ν≺(wq1)∞ we have (wq1)ℓ−iν≺(wq1)ℓν, and hence fin−1([a,θ))=((wq1)ℓ−iν,b], and
[TABLE]
Applying fn−2 gives the required result.
Setting i=ℓ−1 gives fℓn−2([a,θ))=[0(wq1)ℓν,1ν) and hence fℓn−1([a,θ))=(ν,b] (since
ν≺(wq1)ℓν). Applying f once more
gives (20).
*Step 2: *We therefore assume that ν=1…, and show that
fN([a,σ(ν)))=[a,b] for some N, which will complete the proof in
case 1.
Recall that
[TABLE]
where κi=κi(q) is given by (1). Since ν
does not begin with the symbols wq1, and satisfies ν≺(wq1)∞,
one of the following possibilities must occur:
(i)
There is some i with 1≤i≤m, and an integer k with 0≤k<κi (or 0≤k<κm−1 in the case i=m), such that
[TABLE]
2. (ii)
There is some i with 1≤i<m such that
[TABLE]
For (i), write M=k+∑j=1i−1(κj+2). If i<m
we have
[TABLE]
Therefore fM+1([a,σ(ν)))⊃[0κi−k−111…,b]. If κi>k+1 then we have fM+2([a,σ(ν)))=[a,b], while
if κi=k+1 then fM+2([a,σ(ν)))⊃[a,1…]⊃[a,c], and the result follows by Lemma B.1. The
case i=m works similarly, remembering that ι(a) starts with the word
σ(wq)0: we always have fM+2([a.σ(ν)))=[a,b] in this case.
For (ii), write M=(∑j=1i(κj+2))−1. Then
fM([a,σ(ν)))=(0…,12r+10…] for some r≥0 (which
will be greater than [math] if and only if κi+1=0). Therefore
fM+1([a,σ(ν)))⊃[12r0…,b]. If r=0 then
fM+2([a,σ(ν)))=[a,b]; while if r>0 then
fM+2([a,σ(ν)))=[a,1…]⊃[a,c], and the result follows
by Lemma B.1.
Case 2:κ(f)=wq011… and
θ=fn(a).
We have κ(f)=wq011…≺rhe(q)=wq01(1wq)∞: equivalently
κ(f)=10wq1…≺10(wq1)∞, since wq01=10wq. Let
ℓ≥1 and ν∈{0,1}N be such that
[TABLE]
where ν does not start with the symbols wq1. Since
κ(f)≺10(wq1)∞ we have ν≻(wq1)∞.
Now ι(a)=0(wq1)ℓν, and
ι(fn(a))=1(wq1)ℓ−1ν, so that
ι(θ)=0(wq1)ℓ−1ν. Therefore
[TABLE]
We have
[TABLE]
Since ν does not begin with the symbols wq1 and
ν≻(wq1)∞, one of the following possibilities must occur:
(i)
There is some i with 1≤i≤m and an integer k with 0≤k<κi (or 0≤k<κm−1 in the case i=m), such that
[TABLE]
2. (ii)
There is some i with 1≤i≤m such that
[TABLE]
For (i), we suppose that i<m to avoid complicating the
notation: the case i=m is similar. Write M=\bigl{(}(\ell-1)n+1\bigr{)}+\bigl{(}k-1+\sum_{j=i+1}^{m}(\kappa_{j}+2)\bigr{)}. Then
[TABLE]
so that fM+1([a,θ))⊃[0κi−k−111…,b]. If
κi>k+1 then we have fM+2([a,θ))=[a,b], while if
κi=k+1 then fM+2([a,θ))⊃[a,1…]⊃[a,c],
and the result follows by Lemma B.1.
For (ii), write M=\bigl{(}(\ell-1)n+1\bigr{)}+\bigl{(}\sum_{j=i}^{m}(\kappa_{j}+2))-2\bigr{)}. Then fM([a,θ))=(0…,12r+10…] for some r≥0. Therefore fM+1([a,θ))⊃[12r0…,b]. If r=0 then fM+2([a,θ))=[a,b]; while if r>0
then fM+2([a,θ))=[a,1…]⊃[a,c], and the result follows by
Lemma B.1.
∎
Bibliography42
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] R. Adler, A. Konheim, and M. Mc Andrew, Topological entropy , Trans. Amer. Math. Soc. 114 (1965), 309–319.
2[2] K. Alligood and J. Yorke, Accessible saddles on fractal basin boundaries , Ergodic Theory Dynam. Systems 12 (1992), no. 3, 377–400.
3[3] S. Alpern and V. Prasad, Typical dynamics of volume preserving homeomorphisms , Cambridge Tracts in Mathematics, vol. 139, Cambridge University Press, Cambridge, 2000.
4[4] A. Anušić, H. Bruin, and J. Činč, The core Ingram conjecture for non-recurrent critical points , Fund. Math. 241 (2018), no. 3, 209–235.
5[5] A. Anušić and J. Činč, Accessible points of planar embeddings of tent inverse limit spaces , Dissertationes Math. 541 (2019), 57.
6[6] M. Barge, Prime end rotation numbers associated with the Hénon maps , Continuum theory and dynamical systems, Lecture Notes in Pure and Appl. Math., vol. 149, Dekker, New York, 1993, pp. 15–33.
7[7] M. Barge, K. Brucks, and B. Diamond, Self-similarity in inverse limit spaces of the tent family , Proc. Amer. Math. Soc. 124 (1996), no. 11, 3563–3570.
8[8] M. Barge, H. Bruin, and S. Štimac, The Ingram conjecture , Geom. Topol. 16 (2012), no. 4, 2481–2516.