Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

First equality of (22), supp. p. 10 — total expected cost equals the sum of player cost-vector inner products

Proved
RegLearnGames.FirstOrder.social_cost_eq_sum_inner

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

algorithmic-game-theoryexpected-costp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1smooth-games

Let w1,…,wTw^1,\ldots,w^Tw1,…,wT be mixed profiles in a finite cost game. With citc_i^tcit​ the vector of player iii's expected cost for each pure strategy against the other players' mixed play,

∑t=1TC(wt)=∑t=1T∑i⟨wit,cit⟩.\sum_{t=1}^T C(w^t)=\sum_{t=1}^T\sum_i\langle w_i^t,c_i^t\rangle.t=1∑T​C(wt)=t=1∑T​i∑​⟨wit​,cit​⟩.

This identity converts social cost into the quantities controlled by individual regret bounds.

Formalization Note The expectation uses the product distribution of the players' lotteries. The identity holds for any finite horizon, including T=0T=0T=0, when both sums are empty.

Preamble
import Mathlib
import Definitions.Def_RegLearnGames_FirstOrder_Setting
Formal statement
namespace RegLearnGames.FirstOrder

open Finset

/-- The first equality in display (22), for the complete time horizon. -/
theorem social_cost_eq_sum_inner {n d : ℕ}
    (c : Fin n → (Fin n → Fin d) → ℝ)
    (w : ℕ → Fin n → Fin d → ℝ) (T : ℕ)
    (hw : ∀ t ∈ Finset.Icc 1 T, AGT.IsMixedProfile (w t)) :
    (∑ t ∈ Finset.Icc 1 T, socialCost c (w t)) =
      ∑ t ∈ Finset.Icc 1 T, ∑ i, (w t i) ⬝ᵥ (costVec c (w t) i) := by sorry

end RegLearnGames.FirstOrder
Source
Syrgkanis, Agarwal, Luo, Schapire, Fast Convergence of Regularized Learning in Games, arXiv:1507.00407v5, supp. p. 10 (PDF p. 19), first equality of display (22)
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