Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 12, p. 14 — a primal point with Σy ≤ R and bᵀy ≥ α gives ŷ = (y/(2R), 1/2 − Σy/(2R), 1/2) ∈ Δ^{m+2} with A‴ŷ ≤ 0

Proved
QZeroSum19.LPReduce.certificate

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

linear-programminglp-reductionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1zero-sum-game

Let A∈Rn×mA \in \mathbb R^{n\times m}A∈Rn×m, b∈Rmb \in \mathbb R^mb∈Rm, c∈Rnc \in \mathbb R^nc∈Rn, α∈R\alpha \in \mathbb Rα∈R and R>0R > 0R>0, and let A′′′A'''A′′′ be the game matrix (6) (with second row (−eT,−1,1)(-e^{\mathsf T}, -1, 1)(−eT,−1,1)). Suppose y∈Rmy \in \mathbb R^my∈Rm satisfies Ay≤cAy \le cAy≤c, y≥0y \ge 0y≥0, ∑jyj≤R\sum_j y_j \le R∑j​yj​≤R and bTy≥αb^{\mathsf T}y \ge \alphabTy≥α. Put

y^=(y2R, 12−∑jyj2R, 12)∈Rm+2.\hat y = \Bigl(\frac{y}{2R},\ \frac12 - \frac{\sum_j y_j}{2R},\ \frac12\Bigr) \in \mathbb R^{m+2}.y^​=(2Ry​, 21​−2R∑j​yj​​, 21​)∈Rm+2.

Then y^\hat yy^​ lies in the simplex Δm+2\Delta^{m+2}Δm+2 and

A′′′y^=(00(−bTy+α)/(2R)(Ay−c)/(2R))≤0.A'''\hat y = \begin{pmatrix} 0 \\ 0 \\ (-b^{\mathsf T}y + \alpha)/(2R) \\ (Ay - c)/(2R)\end{pmatrix} \le 0 .A′′′y^​=​00(−bTy+α)/(2R)(Ay−c)/(2R)​​≤0.

This is the certificate of the first case of the proof of Lemma 12: if OPT≥α\mathrm{OPT} \ge \alphaOPT≥α, the game (6) has a strategy for the column player that keeps every row payoff nonpositive.

Formalization Note The conclusion states y^∈Δm+2\hat y \in \Delta^{m+2}y^​∈Δm+2 and that every entry of A′′′y^A'''\hat yA′′′y^​ is at most 000; the explicit values of the entries are not part of the statement. The columns are indexed by Fin m ⊕ Fin 2, with zzz at inr 0 and hhh at inr 1.

Preamble
import Mathlib
import Definitions.Def_QZeroSum19_LPReduce_Setting

open Matrix
Formal statement
namespace QZeroSum19.LPReduce
theorem certificate {n m : ℕ} (A : Matrix (Fin n) (Fin m) ℝ) (b : Fin m → ℝ) (c : Fin n → ℝ)
    (α R : ℝ) (hR : 0 < R) (y : Fin m → ℝ) (hy : IsPrimalFeasible A c y)
    (hsum : ∑ j, y j ≤ R) (hby : α ≤ b ⬝ᵥ y) :
    let yhat : Fin m ⊕ Fin 2 → ℝ :=
      Sum.elim (fun j => y j / (2 * R)) ![1 / 2 - (∑ j, y j) / (2 * R), 1 / 2]
    yhat ∈ stdSimplex ℝ (Fin m ⊕ Fin 2) ∧ ∀ k, (gameMatrix A b c α R *ᵥ yhat) k ≤ 0 := 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, first case (definition of ŷ and the display A‴ŷ ≤ 0)
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