Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Palis conjecture for circle diffeomorphisms

Open
PalisConjecture.palis_conjecture_circle

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

attractorsdynamical-systems

Let MMM be a compact, connected, Hausdorff, boundaryless smooth manifold of dimension 111 (that is, a circle), and let r≥1r\ge1r≥1. There is a CrC^rCr-dense set D⊂Diffr(M)D\subset\mathrm{Diff}^r(M)D⊂Diffr(M) such that every f∈Df\in Df∈D has finitely many attractors whose basins cover Lebesgue-almost all of MMM.

This is the one-dimensional case of the Palis conjecture. It is classical: Morse–Smale diffeomorphisms of the circle, whose periodic points are finitely many and all hyperbolic, are CrC^rCr-dense, and for them the attracting periodic orbits are the attractors.

Preamble
import Mathlib
import Definitions.Def_palis_lebesgue_null
import Definitions.Def_palis_attractor
import Definitions.Def_palis_vector_field
import Definitions.Def_palis_cr_topology

open scoped Manifold ContDiff
Formal statement
namespace PalisConjecture

theorem palis_conjecture_circle {M : Type*} [TopologicalSpace M] [T2Space M]
    [CompactSpace M] [ConnectedSpace M] [ChartedSpace (EuclideanSpace ℝ (Fin 1)) M]
    [IsManifold (𝓡 1) ∞ M] (r : ℕ) (hr : 1 ≤ r) :
    ∃ D : Set (M ≃ₘ^(r : WithTop ℕ∞)⟮𝓡 1, 𝓡 1⟯ M), IsCrDenseDiffeo r D ∧
      ∀ f ∈ D, HasFiniteAttractorsCoveringAE 1 (f : M → M) := by
  sorry

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