Abstract

For a continuous map f on a compact metric space (X,d), a set D ⊂ X is internally chain transitive if for every x,y ∈ D and every � > 0 there is a sequence of points hx = x0,x1,...,xn = yi such that d(f(xi),xi+1) < � for 0 ≤ i < n. It is known that every !-limit set is internally chain transitive; in earlier work it was shown that for X a shift of finite type, a closed set D ⊂ X is internally chain transitive if and only if D is an !-limit set for some point in X, and that the same is also true for the full tent map T2 : (0,1) → (0,1). In this paper, we prove that for tent maps with periodic critical point every closed, internally chain transitive set is necessarily an !-limit set. Furthermore, we show that there are at least countably many tent maps with non-recurrent critical point for which there is a closed, internally chain transitive set which is not an !-limit set. Together, these results lead us to conjecture that for those tent maps with shadowing, the !-limit sets are precisely those sets having internal chain transitivity.

Highlights

  • You can use this file as a template when submitting your paper to one of the IMPAN journals

  • Remarks and examples are set in roman type

  • The eqnarray construction leads to well-known mistakes—if you have learnt it, just forget it

Read more

Summary

Introduction

You can use this file as a template when submitting your paper to one of the IMPAN journals (except Dissertationes Mathematicae and Banach Center Publications, for which style files exist). Only the term being defined is emphasized. Remarks and examples are set in roman type. A system S is said to be self-extensional if S ∈ B.

Results
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.