Displaying similar documents to “Shadowing and internal chain transitivity”

On strong chain recurrence for maps

Katsuya Yokoi (2015)

Annales Polonici Mathematici

Similarity:

This paper is concerned with strong chain recurrence introduced by Easton. We investigate the depth of the transfinite sequence of nested, closed invariant sets obtained by iterating the process of taking strong chain recurrent points, which is a related form of the central sequence due to Birkhoff. We also note the existence of a Lyapunov function which is decreasing off the strong chain recurrent set. As an application, we give a necessary and sufficient condition for the coincidence...

On the ω-limit sets of tent maps

Andrew D. Barwell, Gareth Davies, Chris Good (2012)

Fundamenta Mathematicae

Similarity:

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 ⟨x = x₀,x₁,...,xₙ = y⟩ such that d ( f ( x i ) , x i + 1 ) < δ for 0 ≤ i< n. 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...

Weak chain-completeness and fixed point property for pseudo-ordered sets

S. Parameshwara Bhatta (2005)

Czechoslovak Mathematical Journal

Similarity:

In this paper the notion of weak chain-completeness is introduced for pseudo-ordered sets as an extension of the notion of chain-completeness of posets (see [3]) and it is shown that every isotone map of a weakly chain-complete pseudo-ordered set into itself has a least fixed point.