Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5.3 — internally chain transitive   ⟺  \iff⟺ connected and internally chain recurrent   ⟺  \iff⟺ no proper attractor

Proved
StochApproxDyn.Lyapunov.internallyChainTransitive_tfae

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

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

Let Φ\PhiΦ be a semiflow on a metric space MMM and let Λ⊂M\Lambda\subset MΛ⊂M be nonempty. The following assertions are equivalent:

  1. Λ\LambdaΛ is internally chain transitive;
  2. Λ\LambdaΛ is connected and internally chain recurrent;
  3. Λ\LambdaΛ is a compact invariant set and Φ∣Λ\Phi|\LambdaΦ∣Λ admits no proper attractor, i.e.
A⊂Λ an attractor of Φ∣Λ ⟹ A=Λ.A\subset\Lambda \text{ an attractor of }\Phi|\Lambda\ \Longrightarrow\ A=\Lambda .A⊂Λ an attractor of Φ∣Λ ⟹ A=Λ.

The proof of Proposition 6.4 uses (1) ⇒\Rightarrow⇒ (3): an internally chain transitive set cannot contain a smaller attractor of its own restricted semiflow.

Formalization Note Λ\LambdaΛ is assumed nonempty because the internal notions include nonemptiness, while (3) holds vacuously for Λ=∅\Lambda=\emptysetΛ=∅. Attractors of Φ∣Λ\Phi|\LambdaΦ∣Λ are subsets of the subtype Λ\LambdaΛ with its induced metric, and "no proper attractor" is "every attractor equals the whole of Λ\LambdaΛ".

Preamble
import Mathlib
import Definitions.Def_StochApproxDyn_LimitSet_ChainRecurrence
import Definitions.Def_StochApproxDyn_LimitSet_Attractor

open scoped NNReal
Formal statement
namespace StochApproxDyn.Lyapunov

/-- Proposition 5.3 (Benaïm 1999, p. 23), for a nonempty `Λ ⊂ M`. The following are equivalent:
(i) `Λ` is internally chain transitive; (ii) `Λ` is connected and internally chain recurrent;
(iii) `Λ` is a compact invariant set and `Φ|Λ` admits no proper attractor (every attractor of the
restricted semiflow is all of `Λ`). -/
theorem internallyChainTransitive_tfae {M : Type*} [MetricSpace M] (Φ : Flow ℝ≥0 M)
    (Λ : Set M) (hΛ : Λ.Nonempty) :
    List.TFAE
      [StochApproxDyn.LimitSet.IsInternallyChainTransitive Φ Λ,
       IsConnected Λ ∧ StochApproxDyn.LimitSet.IsInternallyChainRecurrent Φ Λ,
       IsCompact Λ ∧ ∃ h : StochApproxDyn.LimitSet.IsInvariantSet Φ Λ,
         ∀ A : Set Λ, StochApproxDyn.LimitSet.IsAttractor (StochApproxDyn.LimitSet.restrictSemiflow Φ h) A → A = Set.univ] := by sorry

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

    Confirmed by the moderator at approval.

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