Proposition C.3 (first part), p. 35 — F_h(p, y) ≥ ½K ‖Q(y) − p‖² for all y
ProvedReinfRegGames.StrictStable.proposition_C_3_boundLet be a -strongly convex penalty function on the simplex (Definition 2.1), with conjugate and Fenchel coupling . Let . Then for every score vector and ,
The Fenchel coupling therefore controls the distance of the choice from : if is small, is close to . This is how the proof of Theorem 5.2 shows that the sublevel set of is mapped by into a small neighbourhood of .
Formalization Note Only the first claim of Proposition C.3 is stated here; the clause " iff " is not part of this item, and (C.11) is a separate item. The norm in the strong convexity inequality (2.5) is the Euclidean one; the page leaves it unspecified, and since is existential in Definition 2.1 the class of penalty functions does not depend on this choice, but the constant does.
import Mathlib import Definitions.Def_agt_games import Definitions.Def_ReinfRegGames_Extinction_Model
namespace ReinfRegGames.StrictStable
theorem proposition_C_3_bound {B : Type*} [Fintype B] (h : (B → ℝ) → ℝ) (K : ℝ) (hpen : ReinfRegGames.Extinction.IsPenalty h K)
(p : B → ℝ) (hp : p ∈ stdSimplex ℝ B) (y x : B → ℝ) (hx : ReinfRegGames.Extinction.IsChoice h y x) :
1 / 2 * K * ReinfRegGames.Extinction.sqDist x p ≤ ReinfRegGames.Extinction.fenchelCoupling h p y := by sorry
end ReinfRegGames.StrictStable
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.