Proposition C.2(i), p. 34 — for
ProvedReinfRegGames.Extinction.proposition_C_2_ibregman-divergenceconvex-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1simplex
Let be a -strongly convex penalty function on the simplex and . If , that is, and whenever , then the one-sided derivative
exists and is a real number. Equivalently, the Bregman divergence of (C.4) is finite: .
This finiteness is what allows Proposition C.4 to conclude that a diverging Fenchel coupling keeps play away from .
Formalization Note Finiteness is stated as the existence of a real limit in the predicate HasOneSidedDeriv.
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
theorem proposition_C_2_i {B : Type*} [Fintype B] (h : (B → ℝ) → ℝ) (K : ℝ) (hpen : IsPenalty h K)
(p : B → ℝ) (hp : p ∈ stdSimplex ℝ B) (x : B → ℝ) (hx : x ∈ deltaP p) :
∃ d : ℝ, HasOneSidedDeriv h x (p - x) d := by sorry
end ReinfRegGames.Extinction
Source
Mertikopoulos & Sandholm, Learning in games via reinforcement and regularization, arXiv:1407.6267v2, p. 34, Proposition C.2(i)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.