Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.5 — on a compact space, R(Φ)R(\Phi)R(Φ) is internally chain recurrent

Proved
StochApproxDyn.LimitSet.chainRecurrentSet_isInternallyChainRecurrent

by mikedeng1 · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

chain-recurrencedynamical-systemsp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Φ\PhiΦ be a semiflow on a nonempty compact metric space MMM, and let R(Φ)R(\Phi)R(Φ) be its set of chain recurrent points. Then

R(Φ) is internally chain recurrent:R(\Phi)\ \text{is internally chain recurrent:}R(Φ) is internally chain recurrent:

it is compact and invariant, Φt(R(Φ))=R(Φ)\Phi_t(R(\Phi))=R(\Phi)Φt​(R(Φ))=R(Φ) for all t≥0t\ge0t≥0, and every point of R(Φ)R(\Phi)R(Φ) is chain recurrent for the restricted semiflow Φ∣R(Φ)\Phi|R(\Phi)Φ∣R(Φ), i.e. by pseudo-orbits that stay in R(Φ)R(\Phi)R(Φ).

The theorem was proved by Conley for flows; it says that chain recurrence does not need excursions outside the chain recurrent set.

Formalization Note MMM is assumed nonempty ([Nonempty M]), because internally chain recurrent sets are nonempty by definition; for M=∅M=\emptysetM=∅ the set R(Φ)R(\Phi)R(Φ) is empty.

Preamble
import Mathlib
import Definitions.Def_StochApproxDyn_LimitSet_ChainRecurrence

open scoped NNReal
Formal statement
namespace StochApproxDyn.LimitSet

/-- Theorem 5.5 (Benaïm 1999, p. 23): if `M` is a (nonempty) compact metric space, the chain
recurrent set `R(Φ)` of a semiflow `Φ` on `M` is internally chain recurrent. -/
theorem chainRecurrentSet_isInternallyChainRecurrent {M : Type*} [MetricSpace M]
    [CompactSpace M] [Nonempty M] (Φ : Flow ℝ≥0 M) :
    IsInternallyChainRecurrent Φ (chainRecurrentSet Φ) := by sorry

end StochApproxDyn.LimitSet
Source
Benaïm, Dynamics of Stochastic Approximation Algorithms, Séminaire de Probabilités XXXIII, LNM 1709 (1999), p. 23, Theorem 5.5
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 4, 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