Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The identity map has no attractors

Proved
PalisConjecture.identity_not_finitely_many_attractors

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

attractorsdynamical-systems

Let MMM be a nonempty Hausdorff manifold modelled on Rn\mathbb R^nRn with n≥1n\ge1n≥1. The identity map idM\mathrm{id}_MidM​ does not have finitely many attractors whose basins cover Lebesgue-almost all of MMM.

This shows that the property in the Palis conjecture is not satisfied by every diffeomorphism, so the density requirement has content. Each transitive invariant set of the identity is a single point. Its basin is that point, which is Lebesgue-null when n≥1n\ge1n≥1. So there are no attractors, and MMM itself is not null.

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 identity_not_finitely_many_attractors (n : ℕ) (hn : 1 ≤ n) {M : Type*}
    [TopologicalSpace M] [T2Space M] [Nonempty M]
    [ChartedSpace (EuclideanSpace ℝ (Fin n)) M] :
    ¬ HasFiniteAttractorsCoveringAE n (id : 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