Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition C.4, p. 35 — Fh(p,yj)→+∞F_h(p,y_j)\to+\inftyFh​(p,yj​)→+∞ forces Q(yj)Q(y_j)Q(yj​) to have no limit points in Δp\Delta_pΔp​

Proved
ReinfRegGames.Extinction.proposition_C_4

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

convex-analysisfenchel-couplinglimit-pointsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let hhh be a KKK-strongly convex penalty function on the simplex Δ\DeltaΔ and p∈Δp\in\Deltap∈Δ. Let (yj)j≥0(y_j)_{j\ge0}(yj​)j≥0​ be a sequence of score vectors with Fh(p,yj)→+∞F_h(p,y_j)\to+\inftyFh​(p,yj​)→+∞, and let xj=Q(yj)x_j=Q(y_j)xj​=Q(yj​). Then

  1. the sequence (xj)(x_j)(xj​) has no limit point (cluster point) in Δp\Delta_pΔp​;
  2. in particular,
lim inf⁡j→∞ min⁡{xj,α: α∈supp⁡(p)}=0.\liminf_{j\to\infty}\ \min\{x_{j,\alpha}:\ \alpha\in\operatorname{supp}(p)\}=0 .j→∞liminf​ min{xj,α​: α∈supp(p)}=0.

Applied along the scores of a player whose Fenchel coupling to pkp_kpk​ diverges, this says that play eventually leaves every neighbourhood of the faces containing pkp_kpk​, i.e. pkp_kpk​ becomes extinct.

Formalization Note Clause 2 is written as: for every ε>0\varepsilon>0ε>0 and every NNN there is j≥Nj\ge Nj≥N and some α\alphaα with pα>0p_\alpha>0pα​>0 and xj,α<εx_{j,\alpha}<\varepsilonxj,α​<ε (the entries are nonnegative, so this is the lim inf⁡\liminfliminf being 000).

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
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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