Proposition C.3, p. 35 —
ProvedReinfRegGames.Extinction.proposition_C_3Let be a penalty function on the simplex with strong convexity constant (Definition 2.1, Euclidean norm), let , and let be a score vector with , i.e. maximizes over . Then the Fenchel coupling satisfies
In particular , the form in which the inequality enters the proof of Theorem 4.1 (as , before (4.8)). The bound holds at every , including those for which lies on the boundary of the simplex outside . Moreover, for every sequence of score vectors with ,
Formalization Note This item is the first sentence of Proposition C.3 (the inequality and the " if and only if " clause, read along sequences); (C.11) is the separate item eq_C_11. The norm is the Euclidean norm of the definition of penalty function.
import Mathlib import Definitions.Def_agt_games import Definitions.Def_ReinfRegGames_Extinction_Model
namespace ReinfRegGames.Extinction
theorem proposition_C_3 {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) :
1 / 2 * K * sqDist x p ≤ fenchelCoupling h p y ∧
∀ ys xs : ℕ → B → ℝ, (∀ j, IsChoice h (ys j) (xs j)) →
(Filter.Tendsto (fun j => fenchelCoupling h p (ys j)) Filter.atTop (nhds 0) ↔
Filter.Tendsto xs Filter.atTop (nhds p)) := by sorry
end ReinfRegGames.Extinction
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.