Search arXivSearch

arXiv · math/0503617

The random case of Conley's theorem

Abstract

The well-known Conley's theorem states that the complement of chain recurrent set equals the union of all connecting orbits of the flow $ϕ$ on the compact metric space $X$, i.e. $X-\mathcal{CR}(ϕ)=\bigcup [B(A)-A]$, where $\mathcal{CR}(ϕ)$ denotes the chain recurrent set of $ϕ$, $A$ stands for an attractor and $B(A)$ is the basin determined by $A$. In this paper we show that by appropriately selecting the definition of random attractor, in fact we define a random local attractor to be the $ω$-limit set of some random pre-attractor surrounding it, and by considering appropriate measurability, in fact we also consider the universal $σ$-algebra $\mathcal F^u$-measurability besides $\mathcal F$-measurability, we are able to obtain the random case of Conley's theorem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhenxin Liu. 2005-12-09. The random case of Conley's theorem. https://doi.org/10.1088/0951-7715%2F19%2F2%2F002

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