Oriented and standard shadowing properties for topological flows. (English) Zbl 1536.37027
Summary: We prove that oriented and standard shadowing properties are equivalent for topological flows with finite singularities that are Lyapunov stable or backward Lyapunov stable. Moreover, we prove that the direct product \(\phi_1 \times \phi_2\) of two topological flows has the oriented shadowing property if \(\phi_1\) with finite singularities has the oriented shadowing property, while \(\phi_2\) has the limit set consisting of finite singularities that are Lyapunov stable or backward Lyapunov stable.
MSC:
37B65 | Approximate trajectories, pseudotrajectories, shadowing and related notions for topological dynamical systems |
37B25 | Stability of topological dynamical systems |
References:
[1] | Fisher, T. and Hasselblatt, B., Hyperbolic flows, European Mathematical Society, 2019. · Zbl 1430.37002 |
[2] | Komuro, M., One-parameter flows with the pseudoorbit tracing property, Monatsh. Math. 98 (1984), 219-253. · Zbl 0545.58037 |
[3] | Pilyugin, S. and Sakai K., Shadowing and hyperbolicity, Vol. 2193. Berlin: Springer, 2017. · Zbl 1426.37004 |
[4] | Palmer K., Pilyugin S. and Tikhomirov, S., Lipschitz shadowing and structural stability of flows, J. Differential Equations 252 (2012), 1723-1747. · Zbl 1246.37044 |
[5] | Tikhomirov, S., An example of a vector field with the oriented shadowing property, J. Dyn. Control Syst. 21 (2015), 643-654. · Zbl 1358.37056 |
[6] | Tikhomirov, S., Interiors of sets of vector fields with shadowing corresponding to certain classes of reparameterizations, Vestnik St. Petersburg University: Mathematics 41(4)(2008), 360-366. · Zbl 1181.37027 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.