Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition C.2(i), p. 34 — Dh(p,x)<+∞D_h(p,x)<+\inftyDh​(p,x)<+∞ for x∈Δpx\in\Delta_px∈Δp​

Proved
ReinfRegGames.Extinction.proposition_C_2_i

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

bregman-divergenceconvex-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1simplex

Let hhh be a KKK-strongly convex penalty function on the simplex Δ\DeltaΔ and p∈Δp\in\Deltap∈Δ. If x∈Δpx\in\Delta_px∈Δp​, that is, x∈Δx\in\Deltax∈Δ and xα>0x_\alpha>0xα​>0 whenever pα>0p_\alpha>0pα​>0, then the one-sided derivative

h′(x;p−x)=lim⁡t→0+h(x+t(p−x))−h(x)th'(x;p-x)=\lim_{t\to0^+}\frac{h(x+t(p-x))-h(x)}{t}h′(x;p−x)=t→0+lim​th(x+t(p−x))−h(x)​

exists and is a real number. Equivalently, the Bregman divergence Dh(p,x)=h(p)−h(x)−h′(x;p−x)D_h(p,x)=h(p)-h(x)-h'(x;p-x)Dh​(p,x)=h(p)−h(x)−h′(x;p−x) of (C.4) is finite: Dh(p,x)<+∞D_h(p,x)<+\inftyDh​(p,x)<+∞.

This finiteness is what allows Proposition C.4 to conclude that a diverging Fenchel coupling keeps play away from Δp\Delta_pΔp​.

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
  • 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