Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(16:C) — theorem of the alternative for matrices (strict form)

Proved
TheoryOfGames.Minimax.alternative_strict

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

convexitygame-theoryp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1theorem-of-the-alternative

Let a(i,j)a(i, j)a(i,j), i=1,…,ni = 1, \dots, ni=1,…,n, j=1,…,mj = 1, \dots, mj=1,…,m, be a real matrix with n≥1n \ge 1n≥1 rows and m≥1m \ge 1m≥1 columns, and let SkS_kSk​ denote the simplex of probability vectors in Rk\mathbb R^kRk. Then exactly one of the following holds:

  1. (16:16:a) there is x=(x1,…,xm)∈Smx = (x_1, \dots, x_m) \in S_mx=(x1​,…,xm​)∈Sm​ with
∑j=1ma(i,j) xj≤0for i=1,…,n;\sum_{j=1}^m a(i, j)\, x_j \le 0 \quad \text{for } i = 1, \dots, n;j=1∑m​a(i,j)xj​≤0for i=1,…,n;
  1. (16:16:b) there is w=(w1,…,wn)∈Snw = (w_1, \dots, w_n) \in S_nw=(w1​,…,wn​)∈Sn​ with
∑i=1na(i,j) wi>0for j=1,…,m.\sum_{i=1}^n a(i, j)\, w_i > 0 \quad \text{for } j = 1, \dots, m.i=1∑n​a(i,j)wi​>0for j=1,…,m.

The existence of one of the two alternatives is (16:C); that they exclude each other is the observation stated immediately after it. This is the convexity result from which the book derives the minimax theorem (via (16:F)).

Formalization Note Rows and columns are indexed from 000 (Fin n, Fin m). "Exactly one" is Xor of the two existence statements.

Preamble
import Mathlib
Formal statement
namespace TheoryOfGames.Minimax

/-- (16:C), p. 140, with the observation after it: for a real matrix `a(i, j)` with `n ≥ 1`
rows and `m ≥ 1` columns, exactly one of the following holds: there is `x ∈ S_m` with
`∑_j a(i, j) x_j ≤ 0` for every row `i` (16:16:a), or there is `w ∈ S_n` with
`∑_i a(i, j) w_i > 0` for every column `j` (16:16:b). -/
theorem alternative_strict {n m : ℕ} (hn : 0 < n) (hm : 0 < m) (a : Fin n → Fin m → ℝ) :
    Xor (∃ x ∈ stdSimplex ℝ (Fin m), ∀ i, ∑ j, a i j * x j ≤ 0)
      (∃ w ∈ stdSimplex ℝ (Fin n), ∀ j, 0 < ∑ i, a i j * w i) := by sorry

end TheoryOfGames.Minimax
Source
von Neumann & Morgenstern, Theory of Games and Economic Behavior (60th-anniversary ed., Princeton 2007), p. 140, (16:C) and the following observation
Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

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