closing lemma
Canonical statement
View source LaTeX
Let \(M\) be a closed smooth manifold, \(r\ge2\), \(f\in\operatorname{Diff}^{r}(M)\), and \(x\in M\) a nonwandering point of \(f\): every neighborhood \(U\ni x\) has \(f^n(U)\cap U\ne\varnothing\) for some \(n>0\). For every \(C^r\) neighborhood \(\mathcal U\) of \(f\), there is \(g\in\mathcal U\) for which \(g^m(x)=x\) for some \(m>0\).Notes
The closing lemma asks whether recurrence can always be converted into genuine periodicity by a small smooth perturbation: given a diffeomorphism of a compact manifold and a nonwandering point — one whose neighborhoods return to meet themselves under iteration — is there arbitrarily -close to for which is periodic? The question took shape around 1960 within the closing-lemma program, and for it remains a basic open conjecture of smooth dynamics.
Pugh established the case [Pugh1967ClosingLemma], and with Robinson extended it to conservative and Hamiltonian systems [PughRobinson1983ClosingLemma]; these perturbation techniques underpin a broad -generic theory of recurrence [BonattiCrovisier2016RecurrenceGenericity]. Beyond , affirmative answers are known in various conservative, low-dimensional and nonuniformly hyperbolic settings.
The obstacle for is that the perturbation must stay small together with derivatives, which drastically limits the room available to move orbits. General proofs have been claimed [Gao2022ClosingClaim], but no such argument is accepted, and the conjecture stands open in every regularity .
References (4)
- [Pugh1967ClosingLemma]
The closing lemma
Open ↗1967 · misc
- [PughRobinson1983ClosingLemma]
The C^1 closing lemma, including Hamiltonians
Open ↗1983 · misc
- [BonattiCrovisier2016RecurrenceGenericity]
Recurrence and genericity
Open ↗2004 · misc
- [Gao2022ClosingClaim]
A proof of the C^r closing lemma and stability conjecture
Open ↗2022 · misc
The boxed statement is the canonical open formulation — not a stronger variant or a related research program. The status reflects the catalog's last review; do your own literature search before investing serious effort.