Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Orientable manifolds

Definition
palis_orientable

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

manifoldstopology

A smooth manifold MMM modelled on Rn\mathbb R^nRn is orientable if there is a family A\mathcal AA of charts from the maximal C∞C^\inftyC∞ atlas of MMM whose domains cover MMM and whose transition maps have positive Jacobian determinant:

det⁡D(e′∘e−1)(y)>0for all e,e′∈A and y∈e(Ue∩Ue′).\det D(e'\circ e^{-1})(y)>0\quad\text{for all } e,e'\in\mathcal A \text{ and } y\in e(U_e\cap U_{e'}).detD(e′∘e−1)(y)>0for all e,e′∈A and y∈e(Ue​∩Ue′​).

This hypothesis is used in Peixoto's theorem on flows on surfaces.

Formalization Note The maximal atlas is IsManifold.maximalAtlas (𝓡 n) ∞ M. The determinant is that of the Fréchet derivative, viewed as a linear map.

Definition code
import Mathlib

/-!
# Orientable manifolds
-/

namespace PalisConjecture

open scoped Manifold ContDiff

/-- `M` is orientable: there is a family of charts from the maximal smooth atlas covering `M`
whose transition maps all have positive Jacobian determinant. -/
def IsOrientable (n : ℕ) (M : Type*) [TopologicalSpace M]
    [ChartedSpace (EuclideanSpace ℝ (Fin n)) M] : Prop :=
  ∃ A ⊆ IsManifold.maximalAtlas (𝓡 n) ∞ M,
    (∀ x : M, ∃ e ∈ A, x ∈ e.source) ∧
    ∀ e ∈ A, ∀ e' ∈ A, ∀ y ∈ e.target ∩ e.symm ⁻¹' e'.source,
      0 < LinearMap.det (fderiv ℝ (e' ∘ e.symm) y : EuclideanSpace ℝ (Fin n) →ₗ[ℝ] EuclideanSpace ℝ (Fin n))

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