Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 12, p. 14 — if λ* ≤ t, some strategy y* ∈ Δ has every row payoff (My*)ₖ ≤ t

Proved
QZeroSum19.LPReduce.exists_strategy_le

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

lp-reductionminimaxp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1zero-sum-game

Let MMM be a real matrix with finite row set III and finite nonempty column set KKK, let λ∗(M)=inf⁡y∈ΔKmax⁡i(My)i\lambda^*(M) = \inf_{y \in \Delta^K} \max_{i} (My)_iλ∗(M)=infy∈ΔK​maxi​(My)i​ be its game value, and let t∈Rt \in \mathbb Rt∈R. If λ∗(M)≤t\lambda^*(M) \le tλ∗(M)≤t, then there is a strategy y∗∈ΔKy^* \in \Delta^Ky∗∈ΔK with

(My∗)k≤tfor every row k.(My^*)_k \le t \quad\text{for every row } k .(My∗)k​≤tfor every row k.

In the proof of Lemma 12 this is the step "if λ∗≤2ε′′′\lambda^* \le 2\varepsilon'''λ∗≤2ε′′′ and y∗=(y,z,h)y^* = (y, z, h)y∗=(y,z,h) is a strategy with this value, then A′′′y∗≤2ε′′′A'''y^* \le 2\varepsilon'''A′′′y∗≤2ε′′′", applied to M=A′′′M = A'''M=A′′′ and t=2ε′′′t = 2\varepsilon'''t=2ε′′′: the value of the game is achieved by some strategy of the column player.

Formalization Note The statement is posed for any finite matrix, with the column type nonempty so that the simplex is nonempty; the game matrix (6) has m+2≥2m + 2 \ge 2m+2≥2 columns.

Preamble
import Mathlib
import Definitions.Def_QZeroSum19_LPReduce_Setting

open Matrix
Formal statement
namespace QZeroSum19.LPReduce
theorem exists_strategy_le {ι κ : Type*} [Fintype ι] [Fintype κ] [Nonempty κ]
    (M : Matrix ι κ ℝ) (t : ℝ) (ht : QZeroSum19.GK.gameValue M ≤ t) :
    ∃ y ∈ stdSimplex ℝ κ, ∀ k, (M *ᵥ y) k ≤ t := by sorry
end QZeroSum19.LPReduce
Source
van Apeldoorn and Gilyén, Quantum algorithms for zero-sum games, arXiv:1904.03180v1, p. 14, proof of Lemma 12, second case ("y* = (y, z, h) is a strategy with this value, then … A‴y* ≤ 2ε‴")
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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