2017
DOI: 10.1007/s00574-017-0033-0
|View full text |Cite
|
Sign up to set email alerts
|

Properties of Shadowable Points: Chaos and Equicontinuity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
11
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 19 publications
(12 citation statements)
references
References 18 publications
1
11
0
Order By: Relevance
“…A shadowable point of a continuous map is defined to be a point such that the shadowing lemma holds for pseudo-orbits beginning at the point. After that, Kawaguchi extends the study on shadowable points recently introduced by Morales in relation to chaotic or non-chaotic properties [4]. About the non-autonomous case, Duarte and Klein give the shadowing property for nonautonomous systems which satisfy several conditions of the maps f n and pseudo-orbits in Avalanche principle proof [5].…”
Section: Introductionmentioning
confidence: 91%
“…A shadowable point of a continuous map is defined to be a point such that the shadowing lemma holds for pseudo-orbits beginning at the point. After that, Kawaguchi extends the study on shadowable points recently introduced by Morales in relation to chaotic or non-chaotic properties [4]. About the non-autonomous case, Duarte and Klein give the shadowing property for nonautonomous systems which satisfy several conditions of the maps f n and pseudo-orbits in Avalanche principle proof [5].…”
Section: Introductionmentioning
confidence: 91%
“…We start stating a result due to Kawaguchi, N. which exhibits an abstraction of the techniques developed in [13] by Moothathu and Oprocha. Lemma 6 (Lemma 2.3 in [5]). Let f : X → X be a continuous map and let…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…Thus for any two distinct sequences s 1 , s 2 ∈ Σ, points which b-shadow γ(s 1 ) and γ(s 2 ) must be distinct. If we now define Y ⊂ X as the set of all the b-shadows x γ(s) for the δ-orbits γ(s), then we can define a surjection π : Y → Σ setting π(x γ(s) ) = s. For more details about the proof of the previous lemmas, see [5].…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…Our proof of Theorem 1.2 and Proposition 1.1 relies on the decompositions of X into the equivalence classes with respect to the chain relations, which we briefly describe below. We remark that such arguments have been already used in several papers (see [9] for details).…”
Section: Proof Of Theorem 12 and Proposition 11mentioning
confidence: 99%
“…Put D i = [f i (p)], 0 ≤ i ≤ m − 1, and D m = D 0 . Then, as shown in [9], we have the following properties.…”
Section: Proof Of Theorem 12 and Proposition 11mentioning
confidence: 99%