Proposition C.4, p. 35 — forces to have no limit points in
ProvedReinfRegGames.Extinction.proposition_C_4convex-analysisfenchel-couplinglimit-pointsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a -strongly convex penalty function on the simplex and . Let be a sequence of score vectors with , and let . Then
- the sequence has no limit point (cluster point) in ;
- in particular,
Applied along the scores of a player whose Fenchel coupling to diverges, this says that play eventually leaves every neighbourhood of the faces containing , i.e. becomes extinct.
Formalization Note Clause 2 is written as: for every and every there is and some with and (the entries are nonnegative, so this is the being ).
Preamble
import Mathlib import Definitions.Def_agt_games import Definitions.Def_ReinfRegGames_Extinction_Model import Definitions.Def_ReinfRegGames_Extinction_Bregman
Formal statement
namespace ReinfRegGames.Extinction
open Filter Topology
theorem proposition_C_4 {B : Type*} [Fintype B] (h : (B → ℝ) → ℝ) (K : ℝ) (hpen : IsPenalty h K)
(p : B → ℝ) (hp : p ∈ stdSimplex ℝ B) (ys xs : ℕ → B → ℝ)
(hQ : ∀ j, IsChoice h (ys j) (xs j))
(hF : Tendsto (fun j => fenchelCoupling h p (ys j)) atTop atTop) :
(∀ z ∈ deltaP p, ¬ MapClusterPt z atTop xs) ∧
∀ ε > 0, ∀ N : ℕ, ∃ j ≥ N, ∃ α, 0 < p α ∧ xs j α < ε := by sorry
end ReinfRegGames.Extinction
Source
Mertikopoulos & Sandholm, Learning in games via reinforcement and regularization, arXiv:1407.6267v2, p. 35, Proposition C.4
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.