Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

CrC^rCr convergence and CrC^rCr-dense sets of diffeomorphisms and vector fields

Definition
palis_cr_topology

by Lucas · Oct 11, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

dynamical-systemsmanifoldstopology

Let MMM be a manifold modelled on Rn\mathbb R^nRn and r≥0r\ge0r≥0 an integer.

  1. A sequence of maps gk:M→Mg_k:M\to Mgk​:M→M converges in CrC^rCr to f:M→Mf:M\to Mf:M→M if (a) for every compact K⊂MK\subset MK⊂M and open U⊃f(K)U\supset f(K)U⊃f(K), eventually gk(K)⊂Ug_k(K)\subset Ugk​(K)⊂U; and (b) for all charts e,e′e,e'e,e′ of the atlas, every compact KKK in the image of eee with f(e−1K)f(e^{-1}K)f(e−1K) inside the domain of e′e'e′, and every j≤rj\le rj≤r, the jjj-th derivatives Dj(e′∘gk∘e−1)D^j(e'\circ g_k\circ e^{-1})Dj(e′∘gk​∘e−1) converge uniformly on KKK to Dj(e′∘f∘e−1)D^j(e'\circ f\circ e^{-1})Dj(e′∘f∘e−1).
  2. A set D⊂Diffr(M)D\subset\mathrm{Diff}^r(M)D⊂Diffr(M) is CrC^rCr-dense if every f∈Diffr(M)f\in\mathrm{Diff}^r(M)f∈Diffr(M) is the CrC^rCr limit of a sequence of elements of DDD.
  3. A sequence of vector fields YkY_kYk​ converges in CrC^rCr to XXX if for every chart eee of the atlas, every compact KKK in the image of eee and every j≤rj\le rj≤r, Dj(Yk)e→DjXeD^j (Y_k)_e\to D^j X_eDj(Yk​)e​→DjXe​ uniformly on KKK, where XeX_eXe​ is the local representative of XXX.
  4. A set DDD of vector fields is CrC^rCr-dense in Xr(M)\mathfrak X^r(M)Xr(M) if every CrC^rCr vector field is the CrC^rCr limit of a sequence of elements of DDD.

For compact MMM this is convergence in the usual CrC^rCr topology on Diffr(M)\mathrm{Diff}^r(M)Diffr(M) and Xr(M)\mathfrak X^r(M)Xr(M). Since that topology is metrizable, sequential density is equivalent to density.

Formalization Note Derivatives are iteratedFDeriv ℝ j and uniform convergence is TendstoUniformlyOn. Since the derivative is local, the composite e′∘gk∘e−1e'\circ g_k\circ e^{-1}e′∘gk​∘e−1 agrees near KKK with the true chart representative once gk(e−1K)g_k(e^{-1}K)gk​(e−1K) lies in the domain of e′e'e′, which holds eventually by (a).

Definition code
import Mathlib
import Definitions.Def_palis_vector_field

/-!
# The `C^r` topology on `Diff^r(M)` and on `𝔛^r(M)` (via convergent sequences)

For a compact manifold the `C^r` topology is metrizable, so a set is dense iff every element
is the limit of a sequence from the set. We therefore describe density through `C^r`
convergence of sequences: uniform convergence together with uniform convergence of all
derivatives of order `≤ r` of the chart representatives on compact subsets of chart domains.
-/

namespace PalisConjecture

open Filter
open scoped Manifold ContDiff

variable {n : ℕ} {M : Type*} [TopologicalSpace M] [ChartedSpace (EuclideanSpace ℝ (Fin n)) M]

/-- `C^r` convergence `g k → f` of maps `M → M`:
1. compact-open (`C^0`) convergence: for every compact `K` and open `U` with `f(K) ⊆ U`,
   eventually `g k (K) ⊆ U`;
2. for all charts `e, e'` of the atlas, every compact `K ⊆ e.target` with `f(e⁻¹ K) ⊆ e'.source`,
   and every `j ≤ r`, the `j`-th derivatives of `e' ∘ g k ∘ e⁻¹` converge uniformly on `K` to
   the `j`-th derivative of `e' ∘ f ∘ e⁻¹`. -/
def CrConvergesMap (n : ℕ) {M : Type*} [TopologicalSpace M]
    [ChartedSpace (EuclideanSpace ℝ (Fin n)) M] (r : ℕ) (g : ℕ → M → M) (f : M → M) : Prop :=
  (∀ K : Set M, IsCompact K → ∀ U : Set M, IsOpen U → f '' K ⊆ U →
      ∀ᶠ k in atTop, g k '' K ⊆ U) ∧
  ∀ e ∈ atlas (EuclideanSpace ℝ (Fin n)) M, ∀ e' ∈ atlas (EuclideanSpace ℝ (Fin n)) M,
    ∀ K : Set (EuclideanSpace ℝ (Fin n)), IsCompact K → K ⊆ e.target →
      e.symm '' K ⊆ f ⁻¹' e'.source → ∀ j : ℕ, j ≤ r →
        TendstoUniformlyOn (fun k => iteratedFDeriv ℝ j (e' ∘ g k ∘ e.symm))
          (iteratedFDeriv ℝ j (e' ∘ f ∘ e.symm)) atTop K

/-- A set `D` of `C^r` diffeomorphisms of `M` is dense in `Diff^r(M)` for the `C^r` topology. -/
def IsCrDenseDiffeo [IsManifold (𝓡 n) ∞ M] (r : ℕ)
    (D : Set (M ≃ₘ^(r : WithTop ℕ∞)⟮𝓡 n, 𝓡 n⟯ M)) : Prop :=
  ∀ f : M ≃ₘ^(r : WithTop ℕ∞)⟮𝓡 n, 𝓡 n⟯ M,
    ∃ g : ℕ → (M ≃ₘ^(r : WithTop ℕ∞)⟮𝓡 n, 𝓡 n⟯ M), (∀ k, g k ∈ D) ∧
      CrConvergesMap n r (fun k => (g k : M → M)) f

/-- `C^r` convergence `Y k → X` of vector fields: for every chart `e` of the atlas, every compact
`K ⊆ e.target` and every `j ≤ r`, the `j`-th derivatives of the chart representatives converge
uniformly on `K`. -/
def CrConvergesVF [IsManifold (𝓡 n) ∞ M] (r : ℕ)
    (Y : ℕ → (x : M) → TangentSpace (𝓡 n) x) (X : (x : M) → TangentSpace (𝓡 n) x) : Prop :=
  ∀ e ∈ atlas (EuclideanSpace ℝ (Fin n)) M,
    ∀ K : Set (EuclideanSpace ℝ (Fin n)), IsCompact K → K ⊆ e.target → ∀ j : ℕ, j ≤ r →
      TendstoUniformlyOn (fun k => iteratedFDeriv ℝ j (vfLocalRep (Y k) e))
        (iteratedFDeriv ℝ j (vfLocalRep X e)) atTop K

/-- A set `D` of vector fields is dense in `𝔛^r(M)` for the `C^r` topology: every `C^r` vector
field is a `C^r` limit of a sequence of elements of `D`. -/
def IsCrDenseVF [IsManifold (𝓡 n) ∞ M] (r : ℕ)
    (D : Set ((x : M) → TangentSpace (𝓡 n) x)) : Prop :=
  ∀ X : (x : M) → TangentSpace (𝓡 n) x, IsCrVectorField r X →
    ∃ Y : ℕ → (x : M) → TangentSpace (𝓡 n) x, (∀ k, Y k ∈ D) ∧ CrConvergesVF r Y X

end PalisConjecture
Source
Open Problem Garden, "Jacob Palis Conjecture (Finitude of Attractors) (Dynamical Systems)", posted by Jailton Viana, April 24, 2013, https://www.openproblemgarden.org/op/jacob_palis_conjecture_finitude_of_attractors_dynamical_systems (Conjecture box and the Definition of attractor below it); bibliography: C. Bonatti, L. J. Diaz, M. Viana, Dynamics Beyond Uniform Hyperbolicity, Encyclopaedia of Mathematical Sciences 102, Springer, 2005.
Human review
  • Endorsed by Shuze Chen · Oct 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 11, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me