Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition C.2(ii), p. 34 — Dh(p,x)≥12K∥x−p∥2D_h(p,x)\ge\frac12K\|x-p\|^2Dh​(p,x)≥21​K∥x−p∥2, with Dh(p,x)=0D_h(p,x)=0Dh​(p,x)=0 iff p=xp=xp=x

Proved
ReinfRegGames.Extinction.proposition_C_2_ii

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

bregman-divergenceconvex-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strong-convexity

Let hhh be a KKK-strongly convex penalty function on the simplex Δ\DeltaΔ and let p,x∈Δp,x\in\Deltap,x∈Δ. Suppose the one-sided derivative h′(x;p−x)h'(x;p-x)h′(x;p−x) is a real number ddd, so that the Bregman divergence Dh(p,x)=h(p)−h(x)−dD_h(p,x)=h(p)-h(x)-dDh​(p,x)=h(p)−h(x)−d of (C.4) is finite. Then

  1. Dh(p,x)≥0D_h(p,x)\ge0Dh​(p,x)≥0;
  2. Dh(p,x)=0D_h(p,x)=0Dh​(p,x)=0 if and only if p=xp=xp=x;
Dh(p,x) ≥ 12K ∥x−p∥22.(C.6)D_h(p,x)\ \ge\ \tfrac12K\,\|x-p\|_2^2 .\qquad\text{(C.6)}Dh​(p,x) ≥ 21​K∥x−p∥22​.(C.6)

Together with (C.11), this makes DhD_hDh​ and the Fenchel coupling quantitative measures of the distance between xxx and ppp.

Formalization Note When h′(x;p−x)=−∞h'(x;p-x)=-\inftyh′(x;p−x)=−∞ the page sets Dh(p,x)=+∞D_h(p,x)=+\inftyDh​(p,x)=+∞, and all three claims hold trivially in the extended reals; the statement therefore quantifies over the points at which the one-sided derivative is a real number. The norm is the Euclidean norm of the definition of penalty function.

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_ii {B : Type*} [Fintype B] (h : (B → ℝ) → ℝ) (K : ℝ) (hpen : IsPenalty h K)
    (p : B → ℝ) (hp : p ∈ stdSimplex ℝ B) (x : B → ℝ) (hx : x ∈ stdSimplex ℝ B) (d : ℝ)
    (hd : HasOneSidedDeriv h x (p - x) d) :
    0 ≤ h p - h x - d ∧ (h p - h x - d = 0 ↔ p = x) ∧
      1 / 2 * K * sqDist x p ≤ h p - h 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(ii), (C.6)
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