Hostname: page-component-7c8c6479df-nwzlb Total loading time: 0 Render date: 2024-03-29T12:21:55.770Z Has data issue: false hasContentIssue false

ROBUST HETERODIMENSIONAL CYCLES AND $C^1$-GENERIC DYNAMICS

Published online by Cambridge University Press:  10 December 2007

Christian Bonatti
Affiliation:
Institut de Mathématiques de Bourgogne, BP 47 870, 21078 Dijon Cedex, France (bonatti@u-bourgogne.fr)
Lorenzo J. Díaz
Affiliation:
Departamento Matemática, Pontifícia Universidade Católica do Rio de Janeiro, Marquês de S. Vicente 225, 22453-900 Rio de Janeiro, Brazil (lodiaz@mat.puc-rio.br)

Abstract

A diffeomorphism $f$ has a heterodimensional cycle if there are (transitive) hyperbolic sets $\varLambda$ and $\varSigma$ having different indices (dimension of the unstable bundle) such that the unstable manifold of $\varLambda$ meets the stable one of $\varSigma$ and vice versa. This cycle has co-index $1$ if $\mathop{\mathrm{index}}(\varLambda)=\mathop{\mathrm{index}}(\varSigma)\pm1$. This cycle is robust if, for every $g$ close to $f$, the continuations of $\varLambda$ and $\varSigma$ for $g$ have a heterodimensional cycle.

We prove that any co-index $1$ heterodimensional cycle associated with a pair of hyperbolic saddles generates $C^1$-robust heterodimensioal cycles. Therefore, in dimension three, every heterodimensional cycle generates robust cycles.

We also derive some consequences from this result for $C^1$-generic dynamics (in any dimension). Two of such consequences are the following. For tame diffeomorphisms (generic diffeomorphisms with finitely many chain recurrence classes) there is the following dichotomy: either the system is hyperbolic or it has a robust heterodimensional cycle. Moreover, any chain recurrence class containing saddles having different indices has a robust cycle.

Type
Research Article
Copyright
2007 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)