Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 5.6 — omega limit sets of precompact orbits are internally chain transitive

Proved
StochApproxDyn.LimitSet.omegaLimitSet_isInternallyChainTransitive

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

chain-recurrencedynamical-systemsomega-limit-setp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Φ\PhiΦ be a semiflow on a metric space MMM, not necessarily compact, and let x∈Mx\in Mx∈M. If the closure of the forward orbit γ+(x)={Φt(x):t≥0}\gamma^+(x)=\{\Phi_t(x):t\ge0\}γ+(x)={Φt​(x):t≥0} is compact, then

ω(x) is internally chain transitive.\omega(x)\ \text{is internally chain transitive.}ω(x) is internally chain transitive.

This is the special case of the limit set theorem for a genuine trajectory X(t)=Φt(x)X(t)=\Phi_t(x)X(t)=Φt​(x), and it is applied to the translation semiflow in the proof of that theorem.

Preamble
import Mathlib
import Definitions.Def_StochApproxDyn_LimitSet_ChainRecurrence

open scoped NNReal
Formal statement
namespace StochApproxDyn.LimitSet

/-- Corollary 5.6 (Benaïm 1999, p. 24): for `x` in a (not necessarily compact) metric space `M`,
if the forward orbit `γ⁺(x) = {Φ_t(x) : t ≥ 0}` has compact closure, then the omega limit set
`ω(x)` is internally chain transitive. -/
theorem omegaLimitSet_isInternallyChainTransitive {M : Type*} [MetricSpace M]
    (Φ : Flow ℝ≥0 M) (x : M) (hx : IsCompact (closure (Set.range fun t : ℝ≥0 => Φ t x))) :
    IsInternallyChainTransitive Φ (omegaLimitSet Φ x) := by sorry

end StochApproxDyn.LimitSet
Source
Benaïm, Dynamics of Stochastic Approximation Algorithms, Séminaire de Probabilités XXXIII, LNM 1709 (1999), p. 24, Corollary 5.6
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