Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 12, p. 14, (7)–(8) — for ŷ = 2Ry: bᵀŷ ≥ α − 6Rε‴ and Aŷ ≤ c + 6Rε‴ (under |α|, |cᵢ| ≤ R)

Proved
QZeroSum19.LPReduce.eq_7_8

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, R>0R > 0R>0 with ∣ci∣≤R|c_i| \le R∣ci​∣≤R for all iii and ∣α∣≤R|\alpha| \le R∣α∣≤R, and let κ≥0\kappa \ge 0κ≥0. Let A′′′A'''A′′′ be the game matrix (6) (second row (−eT,−1,1)(-e^{\mathsf T}, -1, 1)(−eT,−1,1)), and let y∗=(y,z,h)∈Δm+2y^* = (y, z, h) \in \Delta^{m+2}y∗=(y,z,h)∈Δm+2 satisfy A′′′y∗≤2κA'''y^* \le 2\kappaA′′′y∗≤2κ entrywise. Put y^=2Ry∈Rm\hat y = 2Ry \in \mathbb R^my^​=2Ry∈Rm. Then

bTy^≥α−6Rκ,(7)b^{\mathsf T}\hat y \ge \alpha - 6R\kappa, \qquad\qquad (7)bTy^​≥α−6Rκ,(7) Ay^≤c+6Rκ e.(8)A\hat y \le c + 6R\kappa\, e. \qquad\qquad (8)Ay^​≤c+6Rκe.(8)

With κ=ε′′′\kappa = \varepsilon'''κ=ε′′′ these are the displays (7) and (8) of the proof of Lemma 12: the rescaled yyy-part of an approximately optimal strategy is an approximately feasible point of (4) whose objective is approximately at least α\alphaα.

Formalization Note The page's intermediate bounds bTy^≥α−2(α+2R)ε′′′b^{\mathsf T}\hat y \ge \alpha - 2(\alpha + 2R)\varepsilon'''bTy^​≥α−2(α+2R)ε′′′ and Ay^≤c+2(c+2R)ε′′′A\hat y \le c + 2(c + 2R)\varepsilon'''Ay^​≤c+2(c+2R)ε′′′ are valid as printed for α≥0\alpha \ge 0α≥0 and c≥0c \ge 0c≥0; for general signs they hold with ∣α∣|\alpha|∣α∣ and ∣ci∣|c_i|∣ci​∣, and the final bounds 6Rε′′′6R\varepsilon'''6Rε′′′ then need ∣α∣≤R|\alpha| \le R∣α∣≤R and ∣ci∣≤R|c_i| \le R∣ci​∣≤R. Only the final bounds (7) and (8) are stated. The hypothesis ∣ci∣≤R|c_i| \le R∣ci​∣≤R is a standing assumption of §4 (p. 12); ∣α∣≤R|\alpha| \le R∣α∣≤R is added (the binary search of §4 runs over −R≤OPT≤R-R \le \mathrm{OPT} \le R−R≤OPT≤R, and (6) has entries in [−1,1][-1,1][−1,1] only when ∣α∣≤R|\alpha| \le R∣α∣≤R).

Preamble
import Mathlib
import Definitions.Def_QZeroSum19_LPReduce_Setting

open Matrix
Formal statement
namespace QZeroSum19.LPReduce
theorem eq_7_8 {n m : ℕ} (A : Matrix (Fin n) (Fin m) ℝ) (b : Fin m → ℝ) (c : Fin n → ℝ)
    (α R κ : ℝ) (hR : 0 < R) (hc : ∀ i, |c i| ≤ R) (hα : |α| ≤ R) (hκ : 0 ≤ κ)
    (y' : Fin m ⊕ Fin 2 → ℝ) (hy' : y' ∈ stdSimplex ℝ (Fin m ⊕ Fin 2))
    (hle : ∀ k, (gameMatrix A b c α R *ᵥ y') k ≤ 2 * κ) :
    let yhat : Fin m → ℝ := fun j => 2 * R * y' (Sum.inl j)
    α - 6 * R * κ ≤ b ⬝ᵥ yhat ∧ ∀ i, (A *ᵥ yhat) i ≤ c i + 6 * R * κ := 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, (7) and (8)
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