Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 12, p. 14 — if y* = (y, z, h) ∈ Δ^{m+2} has A‴y* ≤ 2ε‴, then |h − 1/2| ≤ ε‴

Proved
QZeroSum19.LPReduce.h_near_half

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′′′A'''A′′′ be the game matrix (6) (second row (−eT,−1,1)(-e^{\mathsf T}, -1, 1)(−eT,−1,1)) for arbitrary data A,b,c,α,RA, b, c, \alpha, RA,b,c,α,R, and let κ∈R\kappa \in \mathbb Rκ∈R. If y∗=(y,z,h)∈Δm+2y^* = (y, z, h) \in \Delta^{m+2}y∗=(y,z,h)∈Δm+2 satisfies A′′′y∗≤2κA'''y^* \le 2\kappaA′′′y∗≤2κ entrywise, then

∣h−12∣≤κ.\Bigl|h - \frac12\Bigr| \le \kappa .​h−21​​≤κ.

In the proof of Lemma 12 this is applied with κ=ε′′′\kappa = \varepsilon'''κ=ε′′′: an approximately optimal strategy of the game (6) puts weight close to 1/21/21/2 on the homogenizing variable hhh.

Formalization Note hhh is the column inr 1 of Fin m ⊕ Fin 2. Only the first two rows of (6) enter.

Preamble
import Mathlib
import Definitions.Def_QZeroSum19_LPReduce_Setting

open Matrix
Formal statement
namespace QZeroSum19.LPReduce
theorem h_near_half {n m : ℕ} (A : Matrix (Fin n) (Fin m) ℝ) (b : Fin m → ℝ) (c : Fin n → ℝ)
    (α R κ : ℝ) (y' : Fin m ⊕ Fin 2 → ℝ) (hy' : y' ∈ stdSimplex ℝ (Fin m ⊕ Fin 2))
    (hle : ∀ k, (gameMatrix A b c α R *ᵥ y') k ≤ 2 * κ) :
    |y' (Sum.inr 1) - 1 / 2| ≤ κ := 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 ("This implies that |h − 1/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