DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS

Similar documents
A Context free language associated with interval maps

Cutwidth and degeneracy of graphs

A new simple recursive algorithm for finding prime numbers using Rosser s theorem

On infinite permutations

b-chromatic number of cacti

Axiom of infinity and construction of N

Topology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.

On Poincare-Wirtinger inequalities in spaces of functions of bounded variation

On path partitions of the divisor graph

Hook lengths and shifted parts of partitions

Some tight polynomial-exponential lower bounds for an exponential function

On constraint qualifications with generalized convexity and optimality conditions

About partial probabilistic information

INDECOMPOSABILITY IN INVERSE LIMITS WITH SET-VALUED FUNCTIONS

Exact Comparison of Quadratic Irrationals

On the longest path in a recursively partitionable graph

Confluence Algebras and Acyclicity of the Koszul Complex

On The Exact Solution of Newell-Whitehead-Segel Equation Using the Homotopy Perturbation Method

Low frequency resolvent estimates for long range perturbations of the Euclidean Laplacian

A note on the acyclic 3-choosability of some planar graphs

A proximal approach to the inversion of ill-conditioned matrices

Compact Sets with Dense Orbit in 2 X

Unfolding the Skorohod reflection of a semimartingale

Smart Bolometer: Toward Monolithic Bolometer with Smart Functions

Methylation-associated PHOX2B gene silencing is a rare event in human neuroblastoma.

L institution sportive : rêve et illusion

On Symmetric Norm Inequalities And Hermitian Block-Matrices

Completeness of the Tree System for Propositional Classical Logic

Nel s category theory based differential and integral Calculus, or Did Newton know category theory?

There are infinitely many twin primes 30n+11 and 30n+13, 30n+17 and 30n+19, 30n+29 and 30n+31

Space-time directional Lyapunov exponents for cellular au- automata

Passerelle entre les arts : la sculpture sonore

Soundness of the System of Semantic Trees for Classical Logic based on Fitting and Smullyan

On a series of Ramanujan

Dynamical Systems 2, MA 761

TOPOLOGICAL ENTROPY AND TOPOLOGICAL STRUCTURES OF CONTINUA

Negative results on acyclic improper colorings

Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks

APPLICATIONS OF ALMOST ONE-TO-ONE MAPS

A new approach of the concept of prime number

The Windy Postman Problem on Series-Parallel Graphs

Chebyshev polynomials, quadratic surds and a variation of Pascal s triangle

On size, radius and minimum degree

A remark on a theorem of A. E. Ingham.

Topology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.

Differential approximation results for the Steiner tree problem

Case report on the article Water nanoelectrolysis: A simple model, Journal of Applied Physics (2017) 122,

Li- Yorke Chaos in Product Dynamical Systems

New estimates for the div-curl-grad operators and elliptic problems with L1-data in the half-space

NAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key

Full-order observers for linear systems with unknown inputs

MAPPING CHAINABLE CONTINUA ONTO DENDROIDS

On additive decompositions of the set of primitive roots modulo p

A non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications

BERGE VAISMAN AND NASH EQUILIBRIA: TRANSFORMATION OF GAMES

All Associated Stirling Numbers are Arithmetical Triangles

Vibro-acoustic simulation of a car window

Course 212: Academic Year Section 1: Metric Spaces

SENSITIVITY AND REGIONALLY PROXIMAL RELATION IN MINIMAL SYSTEMS

Can we reduce health inequalities? An analysis of the English strategy ( )

MATH 54 - TOPOLOGY SUMMER 2015 FINAL EXAMINATION. Problem 1

approximation results for the Traveling Salesman and related Problems

Easter bracelets for years

Topology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.

On the link between finite differences and derivatives of polynomials

Periodic solutions of differential equations with three variable in vector-valued space

Tropical Graph Signal Processing

A Simple Proof of P versus NP

Self-dual skew codes and factorization of skew polynomials

Replicator Dynamics and Correlated Equilibrium

Bodies of constant width in arbitrary dimension

A note on the computation of the fraction of smallest denominator in between two irreducible fractions

The Mahler measure of trinomials of height 1

Vector fields in the presence of a contact structure

Submodular Partition Functions

Quasi-periodic solutions of the 2D Euler equation

Stickelberger s congruences for absolute norms of relative discriminants

Comments on the method of harmonic balance

NOWHERE LOCALLY UNIFORMLY CONTINUOUS FUNCTIONS

Evolution of the cooperation and consequences of a decrease in plant diversity on the root symbiont diversity

On Symmetric Norm Inequalities And Hermitian Block-Matrices

Norm Inequalities of Positive Semi-Definite Matrices

Finite volume method for nonlinear transmission problems

On the simultaneous stabilization of three or more plants

Some Generalized Euclidean and 2-stage Euclidean number fields that are not norm-euclidean

CHAOS ON THE INTERVAL a survey of relationship between the various kinds of chaos for continuous interval maps. Sylvie Ruette

Solution to Sylvester equation associated to linear descriptor systems

ON THE UNIQUENESS IN THE 3D NAVIER-STOKES EQUATIONS

Thomas Lugand. To cite this version: HAL Id: tel

On Newton-Raphson iteration for multiplicative inverses modulo prime powers

Solutions to Tutorial 8 (Week 9)

Avalanche Polynomials of some Families of Graphs

Dispersion relation results for VCS at JLab

The core of voting games: a partition approach

A numerical analysis of chaos in the double pendulum

REVERSIBILITY AND OSCILLATIONS IN ZERO-SUM DISCOUNTED STOCHASTIC GAMES

Thermodynamic form of the equation of motion for perfect fluids of grade n

Chaos induced by coupled-expanding maps

POINTWISE PRODUCTS OF UNIFORMLY CONTINUOUS FUNCTIONS

Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University

Transcription:

DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS Issam Naghmouchi To cite this version: Issam Naghmouchi. DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS. 2010. <hal-00593321v2> HAL Id: hal-00593321 https://hal.archives-ouvertes.fr/hal-00593321v2 Submitted on 13 Aug 2011 HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

1 DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS ISSAM NAGHMOUCHI Abstract. We show that for a monotone dendrite map f : D D, any ω-limit set is either finite or a minimal Cantor set. We also prove that UR(f) = R(f) = Λ(f) = P (f) where P (f), UR(f), R(f) and Λ(f) denote the sets of periodic points, uniformly recurrent points, recurrent points and the union of all ω-limit sets respectively. Moreover, we prove that the following properties are equivalent: (i) R(f) = D, (ii) R(f) = D and (iii) D \ End(D) P (f). 1. Introduction This paper is devoted to monotone dendrite maps. The structure of ω- limit set for monotone dendrite maps is studied here. Acosta and Eslami [1] proved that any infinite ω-limit set of a dendrite homeomorphism is a Cantor minimal set. Efremova and Makhrova [4] constructed a homeomorphism of the Gehman dendrite having an infinite ω-limit set which is a minimal Cantor set. In [12], we proved that for a monotone dendrite map, any infinite ω-limit set does not contain periodic points. This paper can be viewed as a continuation of the paper [12]. We prove that any infinite ω-limit set of monotone dendrite map is a minimal Cantor set (Corollary 1.3), this generalizes Acosta and Eslami result in [1]. For a graph map f, Hawete [5] proved that UR(f) = R(f). For a monotone dendrite map f, we prove that UR(f) = R(f) = Λ(f) = P (f). Oversteegen and Tymchatyn [13] showed that recurrent homeomorphisms of the plane are periodic. Kolev and Pérouème [6] proved that recurrent homeomorphisms of a compact surface with negative Euler characteristic are still periodic. In this direction, we prove that every relatively recurrent monotone dendrite map is a homeomorphism where every cut point is periodic (Theorem 1.6 and Corollary 1.7). Before stating our main results, we recall some basic properties of dendrites and monotone maps. A continuum is a compact connected metric space. A topological space is arcwise connected if any two of its points can be joined by an arc. We use the terminologies from Nadler [11]. An arc is any space homeomorphic to the compact interval [0, 1]. A dendrite D is a locally connected continuum which contains no simple closed curve. Recall that any two distinct points 1 This work was supported by the research unit 99UR/15-15 2000 Mathematics Subject Classification. 37B20, 37B45, 37E99. Key words and phrases. dendrite map, ω-limit set, minimal set, periodic point, transitive, Li-Yorke pair, pointwise recurrent. 1

2 ISSAM NAGHMOUCHI x, y of a dendrite D can be joined by a unique arc with endpoints x and y, denote this arc by [x, y] and let [x, y) = [x, y] \ {y} (resp. (x, y] = [x, y] \ {x} and (x, y) = [x, y] \ {x, y}). A point e D is called an endpoint if D \ {e} is connected. The set of endpoints of D is denoted by End(D). Any point x D \ End(D) is called a cut point. The set of cut points of D is dense in D. A continuous map from a dendrite into itself is called a dendrite map. Every dendrite has the fixed point property (see [11]); that is every dendrite map has a fixed point. Let Z + and N be the sets of non-negative integers and positive integers respectively. Let X be a compact metric space with metric d. For a subset A of X, denote by A the closure of A and by diam(a) the diameter of A. For δ > 0 and x X, denote by B(x, δ) := {y X : d(x, y) < δ}. Let f : X X be a continuous map. Denote by f n the n-th iterate of f; that is, f 0 = Identity and f n = f f n 1 if n 1. For any x X the subset O f (x) = {f n (x) : n Z + } is called the f-orbit of x. A point x X is called periodic of prime period n N if f n (x) = x and f i (x) x for 1 i n 1. We define the ω-limit set of a point x to be the set ω f (x) = {y X : n i N, n i, lim i d(f n i (x), y) = 0} = {f k (x) : k n}. n N A point x X is said to be recurrent for f if x ω f (x). The set ω f (x) is a non-empty, closed and strongly invariant set, i.e. f(ω f (x)) = ω f (x). If ω f (x) is finite then it is a periodic orbit. If ω f m(x) is finite for some m N then ω f (x) is also finite (see [3] for more details). A subset A X is called f-invariant if f(a) A. It is called a minimal set of f if it is nonempty, closed, f-invariant and minimal (in the sense of inclusion) for these properties. If X is a minimal set of f, we say that f is a minimal map; in this case, every f-orbit is dense in X. A point x X is called uniformly recurrent of f if for any neighborhood U of x there exists N N such that {f n+i (x) : i = 0, 1,..., N} U for all n N. Note that x is uniformly recurrent if and only if O f (x) = ω f (x) is a minimal set (see [3], Proposition 5, Chapter V). Let F ix(f), P (f), UR(f), R(f) and Λ(f) denote the sets of fixed points, periodic points, uniformly recurrent points, recurrent points and the union of all ω-limit sets respectively. Then we have the inclusion relation Fix(f) P(f) UR(f) R(f) Λ(f). We say that f is pointwise recurrent (resp. relatively recurrent) if R(f) = X (resp. R(f) = X). We say that f is transitive if for any two nonempty open sets U and V in X, there exists n N such that f n (U) V ; or equivalently if there is a point x X for which ω f (x) = X since X here is a compact metric space (see [7], Theorem 2.2.2). A pair (x, y) X X is called proximal if lim inf n d(f n (x), f n (y)) = 0, it is called distal if lim inf n d(f n (x), f n (y)) > 0. If lim sup n d(f n (x), f n (y)) = 0, (x, y) is called asymptotic. A pair (x, y) is called a Li-Yorke pair (of f) if it is proximal but not asymptotic. We say that f is distal if for any x, y X with x y, the pair (x, y) is distal.

DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS 3 Definition 1.1. ([8]) Let X, Y be two topological spaces. A map f : X Y is said to be monotone if for any connected subset C of Y, f 1 (C) is connected. Notice that f n is monotone for every n N when f itself is monotone. Our main results can be stated as follows: Theorem 1.2. Let f : D D be a monotone dendrite map. Then for any x D, we have: (i) ω f (x) is a minimal set. (ii) ω f (x) P (f). Corollary 1.3. Let f : D D be a monotone dendrite map. Then for any x D, ω f (x) is either a finite set or a minimal Cantor set. In particular, f is not transitive. Theorem 1.4. Let f : D D be a monotone dendrite map. Then UR(f) = R(f) = Λ(f) = P (f). Corollary 1.5. Let f : D D be a monotone dendrite map. Then the restriction map f R(f) is a distal homeomorphism. Theorem 1.6. Let f : D D be a monotone dendrite map. Then the following statements are equivalent: (i) f is pointwise recurrent. (ii) f is relatively recurrent. (iii) every cut point is a periodic point. So from Corollary 1.5, we have the following: Corollary 1.7. Let f : D D be a monotone dendrite map. relatively recurrent, then f is a distal homeomorphism. If f is This paper is organized as follows: In section 2, we give some preliminaries which are useful for the rest of the paper. In section 3, we give some preparatory results concerning monotone dendrite maps and in section 4, we prove the main results of this paper. We need the following results: 2. Preliminaries Theorem 2.1. ([2], Theorem 3.10) Let (X, d) be compact metric space and let f : X X be a continuous map without Li-Yorke pairs. Then f is minimal when it is transitive.

4 ISSAM NAGHMOUCHI Theorem 2.2. ([12], Corollary 1.2) Let f : D D be a monotone dendrite map. Then f has no Li-Yorke pairs. Lemma 2.3. If J is a compact interval and f : J J is a continuous monotone map, then for any x J, ω f (x) is either a fixed point or a periodic orbit of period 2. In particular, f has no Li-Yorke pair. Proof. The proof is trivial. Lemma 2.4. ([10], Lemma 2.1) Let (D, d) be a dendrite. Then for every ε > 0, there exists δ = δ(ε) > 0 such that, for any x, y D with d(x, y) δ, we have diam([x, y]) < ε. Lemma 2.5. ([10], Lemma 2.2) Let [a, b] be an arc in a dendrite (D, d) and w [a, b). There is δ > 0 such that if v D with d(v, b) δ then [v, a] [w, a]. Lemma 2.6. Let [a, b] be a non degenerate arc in a dendrite (D, d). Then there is δ > 0 such that [u, v] [a, b] for any u, v D satisfying d(a, u) < δ and d(b, v) < δ. Proof. As a b, there exist y, z (a, b) such that z (y, b). By Lemma 2.5, there is δ > 0 such that if u B(a, δ) and v B(b, δ) then [u, z] [y, z] and [v, y] [z, y], so [u, v] = [u, y] [y, z] [z, v] [y, z] and hence [u, v] [a, b]. This completes the proof. Lemma 2.7. ([10], Lemma 2.3) Let (C i ) i N be a sequence of connected subsets of a dendrite (D, d). If C i C j = for all i j, then lim diam(c n) = 0. n + Lemma 2.8. Let (D, d) be a dendrite and f : D D a monotone dendrite map. Then for any x, y D, f([x, y]) = [f(x), f(y)]. Proof. Since f is continuous and monotone, we have f([x, y]) [f(x), f(y)] and f 1 ([f(x), f(y)]) [x, y] respectively. Hence, [f(x), f(y)] f([x, y]) and therefore, f([x, y]) = [f(x), f(y)]. Lemma 2.9. Let (D, d) be a dendrite and f : D D a monotone dendrite map. Suppose that a F ix(f) and let x D. If for some n Z + and m N, (a, f n (x)] (a, f m+n (x)], then (a, x] (a, f m (x)]. Proof. Take z (a, f n (x)] (a, f m+n (x)]. Since f n ([a, x]) = [a, f n (x)] and f n ([a, f m (x)]) = [a, f m+n (x)] (Lemma 2.8), there exist y 1 (a, x] and y 2 (a, f m (x)] such that f n (y 1 ) = f n (y 2 ) = z. By Lemma 2.8, f n ([y 1, y 2 ]) = {z} so a / [y 1, y 2 ] since z a. Then necessarily, (a, x] (a, f m (x)].

DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS 5 Lemma 2.10. Let f : D D be a monotone dendrite map, a F ix(f) and x D. If [a, x] [a, f(x)] then there exists b F ix(f) such that lim n + f n (x) = b and [a, f n (x)] [a, b] for all n Z +. Proof. We prove by induction on n that [a, f n (x)] [a, f n+1 (x)] for every n Z + : For n = 0, we have [a, x] [a, f(x)]. Suppose that for some n Z +, [a, f n (x)] [a, f n+1 (x)] then by Lemma 2.8, [a, f n+1 (x)] [a, f n+2 (x)]. Thus the closure I of the set I = n Z+ [a, f n (x)] is an f-invariant arc and the sequence (f n (x)) n Z+ is monotone in this arc, so it converges to a fixed point b I, and we get [a, f n (x)] [a, b] = I, for all n Z +. 3. Some results Lemma 3.1. Let f : D D be a monotone dendrite map. Let a F ix(f) and x D be such that [a, x] F ix(f) = {a} and [a, x] [a, f(x)] = [a, u 1 ] where u 1 (a, x). Then the following statements hold: (i) if f(u 1 ) [a, u 1 ) then ω f (x) = {a}. (ii) if f(u 1 ) (u 1, f(x)] then there exists b F ix(f) such that ω f (x) = {b}. Proof. By Lemma 2.8, f([a, x]) = [a, f(x)], then as u 1 (a, f(x)], there is u 0 (a, x] such that f(u 0 ) = u 1. Denote for all n N, u n = f n (u 0 ). Proof of (i). In this case, u 0 (u 1, x] and as [a, x] F ix(f) = {a}, then for every y [a, u 0 ], ω f (x) = {a}. If for some k Z +, f k (x) [a, u 0 ], then it is clear that ω f (x) = {a}. Suppose that for all k Z +, f k (x) / [a, u 0 ]. In this case, we will see that for each k N, (3.1) [u k, f k (x)] [a, x] = {u k }. We proceed by induction on k: For k = 1, [u 1, f(x)] [a, x] = {u 1 } (see Fig. 1). Figure 1 Now suppose that for some k N, [u k, f k (x)] [a, x] = {u k }. If [u k+1, f k+1 (x)] [a, x] {u k+1 }, then there is y (u k+1, f k+1 (x)] [a, u 1 ]. Since f([a, u 0 ]) = [a, u 1 ] and f([u k, f k (x)]) = [u k+1, f k+1 (x)], there exist w [a, u 0 ] and v [u k, f k (x)]

6 ISSAM NAGHMOUCHI such that f(w) = f(v) = y. By Lemma 2.8, f([w, v]) = {y}. Since [u k, f k (x)] [a, x] = {u k }, we get u k [w, v] and so f(u k ) = y u k+1, a contradiction. Then [u k+1, f k+1 (x)] [a, x] = {u k+1 }. We will prove now that the sets (u k, f k (x)], k N, are pairwise disjoint. Suppose that there exist i, j N and z D such that z (u i, f i (x)] (u i+j, f i+j (x)]. As f i ([u 0, x]) = [u i, f i (x)] and f i ([u j, f j (x)]) = [u i+j, f i+j (x)], there exist y 1 [u 0, x] and y 2 [u j, f j (x)] such that f i (y 1 ) = f i (y 2 ) = z, so by Lemma 2.8, f i ([y 1, y 2 ]) = {z}. By (3.1), [u j, f j (x)] [a, x] = {u j }, and since y 1 [u 0, x] [a, x], we have u j [y 1, y 2 ], thus u i+j = f i (u j ) = z, a contradiction. We conclude that the sets (u k, f k (x)], k N are pairwise disjoint, so by Lemma 2.7, we have lim k + diam([u k, f k (x)]) = 0 and therefore the pair (x, u 0 ) is asymptotic. Hence, ω f (x) = ω f (u 0 ) = {a}. Proof of (ii). By Lemma 2.10, there exists b F ix(f) such that lim n + f n (u 1 ) = b and [a, u n ] [a, b] for all n N. Clearly, [u 1, b] F ix(f) = {b} (Lemma 2.10). We distinguish three cases: Case 1. b [u 1, f(x)]: In this case b = u 2, indeed, we have u 1 [x, b], so by Lemma 2.8, u 2 = f(u 1 ) [f(x), b]. Therefore, u 2 [f(x), b] [a, b] = {b}, thus u 2 = b and f([u 1, b]) = {b}. Now, if the sets (b, f n (x)], for n Z +, are pairwise disjoint then by Lemma 2.7, lim n diam([b, f n (x)]) = 0 and so ω f (x) = {b}. Otherwise, there exist n Z + and m N such that (b, f n (x)] (b, f m+n (x)]. So by Lemma 2.9, [b, x] [b, f m (x)] = [b, v] for some v (b, x]. Let us show that v [b, u 1 ]: We have b [a, f(x)], and since b F ix(f), we have b [a, f m (x)] (Lemma 2.8). So {a, b, v} [a, f m (x)], then v does not belong to (u 1, x] (since otherwise the set {a, b, v} cannot be included in an arc). We have v (b, u 1 ] and f([u 1, b]) = {b} then f m (v) = b. In result, [b, x] [b, f m (x)] = [b, v] where v (b, u 1 ] (b, x) and f m (v) = b. Applying Lemma 3.1,(i) to the map f m by considering the fixed point b of f m instead of a and the point v instead of u 1, we get ω f m(x) = {b} and as b F ix(f), ω f (x) = {b}. Case 2. b / [u 1, f(x)] and f(x) [u 1, b]: In this case, we have, by Lemma 2.10, ω f (x) = ω f (f(x)) = {b}. Case 3. b / [u 1, f(x)] and f(x) / [u 1, b]: In this case, [b, x] [b, f(x)] = [b, v] where v (u 1, b]. So f(v) (v, b] (Lemma 2.10). Applying Lemma 3.1, (i) to the map f by considering b instead of a and v instead of u, we get ω f (x) = {b}. The proof is complete. Lemma 3.2. Let f : D D be a monotone dendrite map. Let a F ix(f) and x D. If ω f (x) is infinite then for every n N, [a, x] [a, f n (x)] = [a, u n ] where u n F ix(f n ). Proof. One can suppose that [a, x] F ix(f) = {a}. Let n N and [a, x] [a, f n (x)] = [a, u n ]. Then, u n [a, x), indeed, if u n = x, then by Lemma 2.10 applied to f n, we get ω f n(x) = {b} F ix(f n ) and so ω f (x)

DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS 7 is finite, a contradiction. It follows that u n F ix(f n ) if u n = a and, by Lemma 3.1, if u n (a, x). 4. Proof of main results Proof of Theorem 1.2: If ω f (x) is finite, then Theorem 1.2 obviously holds. In the following we may assume that ω f (x) is infinite. Proof of (i). Take a F ix(f) such that [a, x] F ix(f) = {a}. By Lemma 2.7, the sets (a, f 2n (x)], for n N, cannot be pairwise disjoint (since otherwise, ω f 2(x) = {a} and so ω f (x) is finite). So by Lemma 2.9, there exist n 0 N with n 0 > 1 and u 0 D such that [a, x] [a, f n 0 (x)] = [a, u 0 ] where u 0 (a, x]. By Lemma 2.10, u 0 (a, x) and by Lemma 3.2, u 0 F ix(f n 0 ). If we consider now the map f n 0 then in the same way, we can prove that there exist an integer n 1 N with n 1 > 1 and a fixed point u 1 of f n 0n 1 in the arc (u 0, x) such that [a, x] [a, f n 0n 1 (x)] = [a, u 1 ]. By induction, we find a sequence of integers (n i ) i Z+ and a sequence of points (u i ) i Z+ in D such that for every i Z +, we have: (4.1) n i > 1, (4.2) u i F ix(f N i ), (4.3) u i+1 (u i, x), (4.4) [a, x] [a, f N i (x)] = [a, u i ], where N i = Π 0 j i n i. Then by (4.3), the sequence of points (u i ) i N is monotone in the arc [a, x] so it converges to a point u [a, x] (see Figure 2). It is possible that u = x. Figure 2 From (4.4), the sets [u i, f N i (x)], for i N are pairwise disjoint, hence by Lemma 2.7, lim i + diam([u i, f N i (x)]) = 0. Then lim i + f N i (x) = u and by (4.1), lim i + N i = + so u ω f (x). If u = x, then the map

8 ISSAM NAGHMOUCHI f ωf (x) is transitive. If u x, then for every i N, we have [u, x] [u i, x] and since f N i ([u i, x]) = [u i, f N i (x)] (Lemma 2.8), [f N i (u ), f N i (x)] = f N i ([u, x]) [u i, f N i (x)]. So lim i + diam([f N i (u ), f N i (x)]) = 0. Then the pair (u, x) is proximal and by Theorem 2.2, it is an asymptotic pair, so ω f (u ) = ω f (x). Therefore, regardless of whether u = x or u x, f ωf (x) is a transitive map without Li-Yorke pairs, hence, by Theorem 2.1, this map is minimal and so ω f (x) is a minimal set. Proof of (ii): By (4.2), u i P (f) for all i N. Since lim i + u i = u, we have u P (f). As f(p (f)) = P (f), then ω f (x) = ω f (u ) P (f). Proof of Corollary 1.3: Let x D be such that ω f (x) is infinite. By Theorem 1.2, ω f (x) is minimal so it has no isolated point. To prove that ω f (x) is a Cantor set, it suffices to prove that it is totally disconnected: Otherwise, ω f (x) contains a non-degenerate arc [a, b]. By Theorem 1.2, a, b P (f), so by Lemma 2.6, there are p, q P (f) such that [p, q] [a, b]. Take y [p, q] [a, b]. Since p and q are periodic, there is n N such that f n (p) = p and f n (q) = q, so f n ([p, q]) = [p, q] (Lemma 2.8). By Lemma 2.3, ω f n(y) is finite and so is ω f (y). But this contradicts that ω f (y) = ω f (x) is an infinite minimal set. Thus ω f (x) must be totally disconnected. Proof of Theorem 1.4: By Theorem 1.2, we have UR(f) = R(f) = Λ(f) P (f). So it suffices to prove that P (f) R(f). Let x P (f). We distinguish two cases: Case 1. ω f (x) is a periodic orbit: Without loss of generality, one can assume that ω f (x) = {a} F ix(f). We will prove that x = a and so x R(f). Suppose that x a. Take w (x, a), by Lemma 2.5, there is δ > 0 such that if p B(x, δ) then [p, a] [w, a]. As x P (f), one can choose p P (f). We will show that [p, a] [x, a]: otherwise, [p, a] [x, a] = [v, a] where v (x, a), so take v (x, v), then by Lemma 2.5 applying for v instead of w, there is q P (f) such that [q, a] [v, a], hence [q, a] [p, a] = [v, a]. Thus, a / [p, q] (since otherwise, [q, a] [p, a] = {a}, but [q, a] [p, a] = [v, a] {a}) and v [p, q]. As p and q are periodic points, there is n N such that f n (p) = p and f n (q) = q, so by Lemma 2.8, f n ([p, q]) = [p, q] and hence ω f n(v) [p, q]. As ω f (x) = {a}, the pair (x, a) is asymptotic and then, by Lemma 2.4, lim n + diam([f n (x), a]) = 0. Hence, for any point y [x, a], ω f (y) = {a}. In particular, ω f (v) = {a} and then ω f n(v) = {a}, a contradiction since a / [q, p]. Thus, [p, a] [x, a]. The arc [p, a] is f n -invariant, by Lemma 2.8, so f n (x) [p, a]. In fact, since ω f (x) = {a}, f n (x) (x, a] and there is x n (p, x) such that f n (x n ) = x. So for each m N, ω f m(x n ) = {a}. Again since x P (f) and x a, one can find q P (f) such that [q, p] [x n, p] and a / [q, p]. Take m N such

DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS 9 that f m (q) = q and f m (p) = p, then, by Lemma 2.8, f m ([q, p]) = [q, p]. So ω f m(x n ) [q, p], a contradiction. Therefore, x = a. Case 2. ω f (x) is infinite: Let u and u 0 P (f) given in the proof of Theorem 1.2. We will prove that x = u, and so x ω f (x) which implies that x R(f): Assume that x u. As x P (f), then by Lemma 2.5, we can find p P (f) such that [p, u 0 ] [u, u 0 ], so u [p, u 0 ]. Take n N such that f n (p) = p and f n (u 0 ) = u 0, hence by Lemma 2.8, f n ([p, u 0 ]) = [p, u 0 ], so, by Lemma 2.3, ω f n(u ) is finite and so is ω f (u ) = ω f (x), a contradiction. For both cases 1 or 2, we proved that x R(f). So P (f) R(f) and therefore UR(f) = R(f) = Λ(f) = P (f). Proof of Corollary 1.5: Take x, y R(f) with x y. By Theorem 2.2, the pair (x, y) is either asymptotic or distal. Let us prove that the pair (x, y) is distal. Indeed, suppose that (x, y) is an asymptotic pair, then by Lemma 2.4, lim n + diam([f n (x), f n (y)]) = 0 and thus, ω f (x) = ω f (y) = ω f (z) for any z [x, y]. As x, y P (f) (Theorem 1.4), then, by Lemma 2.6, there exist p, q P (f) such that [p, q] [x, y]. Take z [p, q] [x, y]. Let n N be such that f n (p) = p and f n (q) = q, hence by Lemma 2.8, the arc [p, q] is f n invariant. So by Lemma 2.3, ω f n(z) is finite, hence it is a periodic orbit for f n and so ω f (z) = ω f (x) = ω f (y) is a periodic orbit for f. As x, y R(f) we have x, y P (f) which is impossible. Therefore, the map f R(f) is one to one. Moreover, as f(r(f)) = R(f) and R(f) = P (f) is compact, the map f R(f) is a homeomorphism. Proof of Theorem 1.6: (i) (ii) is clear. (iii) (i) follows from Theorem 1.4. It remains to prove (ii) (iii): By Theorem 1.4, P (f) = D. Take x a cut point of D, then D \ {x} has more than one connected component and let A and B be two disjoint connected components of D \ {x}. Since the set P (f) is dense, one can find two periodic points a and b with a A and b B, so x [a, b]. Without loss of generality, one can assume that a, b F ix(f). Suppose that x is not a fixed point. If f(x) (x, b] then f n (x) [f(x), b] for all n N. Take w (x, f(x)). As w f(x) and P (f) = D, there is, by Lemma 2.5, a periodic point p such that [f(x), b] [p, a] = and [p, a] [w, x], so x [p, a]. Let m N be the period of p, then f m ([p, a]) = [p, a] (Lemma 2.8). Therefore, f km (x) [p, a] for all k Z + and we have f n (x) [f(x), b] for all n N, this is a contradiction since [f(x), b] [p, a] =. By a similar way, the case f(x) [a, x) leads to a contradiction. Therefore, x P (f), this completes the proof. Acknowledgements. I would like to thanks the referees for their useful comments.

10 ISSAM NAGHMOUCHI References 1. G. Acosta, P. Eslami, On open maps between dendrites, Houston J. Math. 33, (2007), 753-770. 2. F. Blanchard, E. Glasner, S. Kolyada, A. Maass, On Li-Yorke pairs, J. Reine Angew. Math. 547 (2002), 51-68. 3. L.S. Block, W.A. Coppel, Dynamics in One Dimension, Lecture Notes in Math, 1513. Springer-Verlag, 1992. 4. L. Efremova, E.N. Makhrova, The dynamics of monotone maps of dendrites, Sb. Math. 192, (2001), 807-821. 5. H. Hawete, Relatively Pointwise recurrent graph map, Proc. Amer. Math. Soc. 139 (2011), 2087-2092. 6. B. Kolev and M.-C. Pérouème, Recurrent surface homeomorphisms, Math. Proc. Cambridge Philos. Soc. 124, (1998), 161-168. 7. S. Kolyada, L. Snoha, Some aspects of topological transitivity - a survey, Grazer Math. Ber., 334 (1997), 3-35. 8. K. Kuratowski, Topology, vol. 2, Academic Press, New York 1968. 9. J.H. Mai, Pointwise-recurrent graph maps, Ergod. Th. and Dynam. Sys. (2005), 25, 629-637. 10. J.H. Mai, E.H. Shi, R = P for maps of dendrites X with Card(End(X)) < c, Int. J. Bifurcation and Chaos, 19, 4 (2009), 1391-1396. 11. S. B. Nadler, Continuum Theory: An Introduction, (Monographs and Textbooks in Pure and Applied Mathematics, 158). Marcel Dekker, Inc., New York, 1992. 12. I. Naghmouchi, Dynamic of monotone graph, dendrite and dendroid maps, To appear in Int. J. Bifurcation and Chaos (2011). 13. L. G. Oversteegen, E. D. Tymchatyn. Recurrent homeomorphisms on R 2 are periodic, Proc. Amer. Math. Soc. 110 (1990), 1083-1088. Issam Naghmouchi, University of Carthage, Faculty of Science of Bizerte, Department of Mathematics, Jarzouna, 7021, Tunisia. E-mail address: issam.nagh@gmail.com