Proposition 5.3 — internally chain transitive connected and internally chain recurrent no proper attractor
ProvedStochApproxDyn.LimitSet.internallyChainTransitive_tfaeLet be a semiflow on a metric space and let be nonempty. The following assertions are equivalent:
- is internally chain transitive;
- is connected and internally chain recurrent;
- is a compact invariant set and admits no proper attractor, that is, the only attractor of the restricted semiflow is itself.
The proposition, originally due to Bowen, makes precise the relation between chain transitivity, chain recurrence and attractors; criterion (2) is how Corollary 5.6 and the limit set theorem are proved.
Formalization Note The hypothesis is added: internally chain transitive and internally chain recurrent sets are nonempty by definition (the source introduces them for "a nonempty invariant set"), while for assertion (3) would hold vacuously. Connectedness is Mathlib's IsConnected, which includes nonemptiness. In (3) the attractors are those of the semiflow on the subspace ; neighbourhoods are taken in .
import Mathlib import Definitions.Def_StochApproxDyn_LimitSet_ChainRecurrence import Definitions.Def_StochApproxDyn_LimitSet_Attractor open scoped NNReal
namespace StochApproxDyn.LimitSet
/-- 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
[IsInternallyChainTransitive Φ Λ,
IsConnected Λ ∧ IsInternallyChainRecurrent Φ Λ,
IsCompact Λ ∧ ∃ h : IsInvariantSet Φ Λ,
∀ A : Set Λ, IsAttractor (restrictSemiflow Φ h) A → A = Set.univ] := by sorry
end StochApproxDyn.LimitSet
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.