For graph maps, one scrambled pair implies Li-Yorke chaos

preprint2012arXivOpen access

Abstract

For a dynamical system (X,f)(X,f), XX being a compact metric space with metric dd and ff being a continuous map X→XX\to X, a set S⊆XS\subseteq X is scrambled if every pair (x,y)(x,y) of distinct points in SS is scrambled, i.e., lim inf⁡n→+∞d(fn(x),fn(y))=0\liminf_{n\to+\infty}d(f^n(x),f^n(y))=0 and lim sup⁡n→+∞d(fn(x),fn(y))>0\limsup_{n\to+\infty}d(f^n(x),f^n(y))>0. The system (X,f)(X,f) is Li-Yorke chaotic if it has an uncountable scrambled set. It is known that, for interval and circle maps, the existence of a scrambled pair implies Li-Yorke chaos, in fact the existence of a Cantor scrambled set. We prove that the same result holds for graph maps. We further show that on compact countable metric spaces one scrambled pair implies the existence of an infinite scrambled set.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.