Proof of Theorem 5.2, Part IV, pp. 23–24 — h*(y) − y_{α*} = max_x {Σ_{µ≠α*} x_µ z_µ − h(x)} is nondecreasing in the relative scores z_µ
ProvedReinfRegGames.StrictStable.monotone_stepLet be a penalty function on with conjugate , and fix a vertex . For a score vector write () for the relative scores. Then
and consequently, for two score vectors with for all ,
Since , the Fenchel coupling to the vertex does not increase when every relative score decreases. In the proof of Theorem 5.2 this shows that an orbit started in cannot leave it.
Formalization Note The page writes a strict inequality . For a nonsteep penalty this is false: when the maximizer is the vertex itself (e.g. the quadratic penalty with every ), both sides equal . The proof of Theorem 5.2 only needs the weak inequality (the first exit point has coupling exactly by continuity, while the initial coupling is strictly smaller), so the weak inequality is stated. The maximum is written as a real sSup over the image of , attained for a penalty function.
import Mathlib import Definitions.Def_agt_games import Definitions.Def_ReinfRegGames_Extinction_Model
namespace ReinfRegGames.StrictStable
theorem monotone_step {B : Type*} [Fintype B] [DecidableEq B] (h : (B → ℝ) → ℝ) (K : ℝ) (hpen : ReinfRegGames.Extinction.IsPenalty h K)
(αstar : B) (y y' : B → ℝ) :
ReinfRegGames.Extinction.conj h y - y αstar =
sSup ((fun x => (∑ μ ∈ Finset.univ.erase αstar, x μ * (y μ - y αstar)) - h x) ''
stdSimplex ℝ B) ∧
((∀ μ, μ ≠ αstar → y' μ - y' αstar < y μ - y αstar) →
ReinfRegGames.Extinction.conj h y' - y' αstar ≤ ReinfRegGames.Extinction.conj h y - y αstar) := by sorry
end ReinfRegGames.StrictStable
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.