Uniform persistence and chain recurrence (Q1123436)

From MaRDI portal
Revision as of 09:06, 20 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Uniform persistence and chain recurrence
scientific article

    Statements

    Uniform persistence and chain recurrence (English)
    0 references
    1989
    0 references
    The concept of persistence originates in mathematical ecology and tries to grasp the important property of a community whether it will stay on in the future or not. Definitions can be found in \textit{G. Butler}, \textit{H. Freedman}, \textit{P. Waltman}, Proc. Am. Math. Soc. 96, 425-430 (1986; Zbl 0603.34043)] and in \textit{G. Butler}, \textit{P. Waltman}, J. Differ. Equations 63, 255-263 (1986; Zbl 0603.58033). Persistence is now a central research problem in topological dynamics. The basic theorem proved and generalized in this clearly written paper is the following. If a dissipative dynamical system is given on a closed subset E of a locally compact metric space whose boundary is invariant, a neighbourhood of the boundary apart from the boundary contains no entire trajectories, and the intersection of the interior of E with the stable set of the boundary is empty then the dynamical system is uniformly persistent. \(\{\) There is a misprint at a crucial place: in Theorem 1. (2a) \(\Lambda\) is to be read \(W\}\). The conditions of this theorem are weakened. Applying deep topological dynamics, first it is proved that for uniform persistence it is enough that the conditions hold for each component of the chain recurrent set of the maximal compact invariant set in the boundary. Then it is shown that the same is true if the conditions hold for the components of a Morse decomposition of the maximal compact invariant set in the boundary.
    0 references
    chain recurrence
    0 references
    persistence
    0 references
    dissipative dynamical system
    0 references
    uniform persistence
    0 references
    0 references
    0 references

    Identifiers