Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(C.11) of Proposition C.3, p. 35 — Fh(p,y)=Dh(p,x)F_h(p,y)=D_h(p,x)Fh​(p,y)=Dh​(p,x) whenever Q(y)=x∈ΔpQ(y)=x\in\Delta_pQ(y)=x∈Δp​

Proved
ReinfRegGames.Extinction.eq_C_11

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

bregman-divergenceconvex-analysisfenchel-couplingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let hhh be a KKK-strongly convex penalty function on the simplex Δ\DeltaΔ, let p∈Δp\in\Deltap∈Δ, and let yyy be a score vector with x=Q(y)x=Q(y)x=Q(y). If x∈Δpx\in\Delta_px∈Δp​, then the one-sided derivative h′(x;p−x)h'(x;p-x)h′(x;p−x) exists, is a real number, and

Fh(p,y)=Dh(p,x)=h(p)−h(x)−h′(x;p−x).(C.11)F_h(p,y)=D_h(p,x)=h(p)-h(x)-h'(x;p-x). \qquad\text{(C.11)}Fh​(p,y)=Dh​(p,x)=h(p)−h(x)−h′(x;p−x).(C.11)

The identity transfers the continuity of the Bregman divergence on Δp\Delta_pΔp​ (Proposition C.2(iii)) to the Fenchel coupling, which is how Proposition C.4 is proved.

Formalization Note The statement says that the one-sided derivative of hhh at xxx in the direction p−xp-xp−x equals h(p)−h(x)−Fh(p,y)h(p)-h(x)-F_h(p,y)h(p)−h(x)−Fh​(p,y), which is (C.11) rearranged and includes the existence of the derivative.

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 eq_C_11 {B : Type*} [Fintype B] (h : (B → ℝ) → ℝ) (K : ℝ) (hpen : IsPenalty h K)
    (p : B → ℝ) (hp : p ∈ stdSimplex ℝ B) (y x : B → ℝ) (hQ : IsChoice h y x)
    (hx : x ∈ deltaP p) :
    HasOneSidedDeriv h x (p - x) (h p - h x - fenchelCoupling h p y) := by sorry

end ReinfRegGames.Extinction
Source
Mertikopoulos & Sandholm, Learning in games via reinforcement and regularization, arXiv:1407.6267v2, p. 35, Proposition C.3, (C.11)
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