Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (8.3) — an optimal solution of (8.2) is a worst-case optimal strategy of Alice

Proved
MatousekLP.ZeroSum.lp82_optimal

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

linear-programmingp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1zero-sum-games

Let MMM be a real m×nm \times nm×n payoff matrix, m,n≥1m, n \ge 1m,n≥1, and consider the linear program (8.2)

maximize x0subject toMTx−1x0≥0,∑i=1mxi=1,x≥0.\text{maximize } x_0 \quad\text{subject to}\quad M^T\mathbf x - \mathbf 1 x_0 \ge \mathbf 0,\quad \sum_{i=1}^m x_i = 1,\quad \mathbf x \ge \mathbf 0 .maximize x0​subject toMTx−1x0​≥0,i=1∑m​xi​=1,x≥0.

If (x~0,x~)(\tilde x_0, \tilde{\mathbf x})(x~0​,x~) is an optimal solution of (8.2), then x~\tilde{\mathbf x}x~ is a mixed strategy of Alice and

x~0=β(x~)=max⁡xβ(x),(8.3)\tilde x_0 = \beta(\tilde{\mathbf x}) = \max_{\mathbf x}\beta(\mathbf x), \tag{8.3}x~0​=β(x~)=xmax​β(x),(8.3)

the maximum being over all mixed strategies of Alice. In particular x~\tilde{\mathbf x}x~ is worst-case optimal.

Formalization Note max⁡xβ(x)=β(x~)\max_{\mathbf x}\beta(\mathbf x) = \beta(\tilde{\mathbf x})maxx​β(x)=β(x~) is stated as β(x)≤β(x~)\beta(\mathbf x) \le \beta(\tilde{\mathbf x})β(x)≤β(x~) for every mixed strategy x\mathbf xx.

Preamble
import Mathlib
import Definitions.Def_MatousekLP_ZeroSum_Game
import Definitions.Def_MatousekLP_ZeroSum_GameLP
Formal statement
namespace MatousekLP.ZeroSum

theorem lp82_optimal {m n : ℕ} (hm : 1 ≤ m) (hn : 1 ≤ n)
    (M : Matrix (Fin m) (Fin n) ℝ) (x₀ : ℝ) (xt : Fin m → ℝ) (h : LP82Optimal M x₀ xt) :
    x₀ = beta M xt ∧ xt ∈ stdSimplex ℝ (Fin m) ∧
      ∀ x ∈ stdSimplex ℝ (Fin m), beta M x ≤ beta M xt := by sorry

end MatousekLP.ZeroSum
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, p. 138, Eq. (8.2) and Eq. (8.3)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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