Search arXivSearch

arXiv · 0710.5683

The random case of Conley's theorem: II. The complete Lyapunov function

Abstract

Conley in \cite{Con} constructed a complete Lyapunov function for a flow on compact metric space which is constant on orbits in the chain recurrent set and is strictly decreasing on orbits outside the chain recurrent set. This indicates that the dynamical complexity focuses on the chain recurrent set and the dynamical behavior outside the chain recurrent set is quite simple. In this paper, a similar result is obtained for random dynamical systems under the assumption that the base space $(Ω,\mathcal F,\mathbb P)$ is a separable metric space endowed with a probability measure. By constructing a complete Lyapunov function, which is constant on orbits in the random chain recurrent set and is strictly decreasing on orbits outside the random chain recurrent set, the random case of Conley's fundamental theorem of dynamical systems is obtained. Furthermore, this result for random dynamical systems is generalized to noncompact state spaces.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhenxin Liu. 2007-10-30. The random case of Conley's theorem: II. The complete Lyapunov function. https://doi.org/10.1088/0951-7715%2F20%2F4%2F012

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS