Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.1, p. 16 — on P_M, Mp̄ ≥ −λ ≥ −(B − 1)γ for a Z₊-matrix M

Proved
LinExchangeSP.ZPlus.lemma_7_1

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

linear-inequalitiesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polyhedraz-matrix

Let M∈Z+(t,t)M \in \mathcal{Z}_+(t,t)M∈Z+​(t,t) be a square Z+Z_+Z+​-matrix with t≥1t \ge 1t≥1, and let γ∈Qt\gamma \in \mathbb{Q}^tγ∈Qt with γ>0\gamma > 0γ>0. Put λi=∑j≠iγj\lambda_i = \sum_{j\ne i}\gamma_jλi​=∑j=i​γj​ and B=∑j=1tγj/min⁡i∈[t]γiB = \sum_{j=1}^t \gamma_j / \min_{i\in[t]}\gamma_iB=∑j=1t​γj​/mini∈[t]​γi​. If pˉ∈R+t\bar p \in \mathbb{R}^t_+pˉ​∈R+t​ satisfies Mpˉ≤γM\bar p \le \gammaMpˉ​≤γ, then

Mpˉ ≥ −λ ≥ −(B−1)γM\bar p \ \ge\ -\lambda\ \ge\ -(B-1)\gammaMpˉ​ ≥ −λ ≥ −(B−1)γ

componentwise.

The lemma gives a lower bound on every constraint of PMP_MPM​; the constraints of the approximating M2VPI system are nonnegative combinations of these lower bounds.

Formalization Note γ>0\gamma > 0γ>0 is the standing assumption of §7 (p. 16, "γ∈Qk\gamma \in \mathbb{Q}^kγ∈Qk, γ>0\gamma > 0γ>0"); it is needed for the second inequality. t≥1t \ge 1t≥1 is needed for BBB. The positive-diagonal assumption of §7 is not needed and is not imposed.

Preamble
import Mathlib
import Definitions.Def_LinExchangeSP_ZPlus_Setting
Formal statement
namespace LinExchangeSP.ZPlus

/-- Lemma 7.1 (p. 16): for `M ∈ Z₊(t, t)`, `γ > 0` and `p̄ ≥ 0` with `Mp̄ ≤ γ`, every row satisfies
`M_i p̄ ≥ -λ_i ≥ -(B - 1)γ_i`, with `λ_i = ∑_{j ≠ i} γ_j` and `B = ∑ⱼ γⱼ / minᵢ γᵢ`. -/
theorem lemma_7_1 {t : ℕ} (ht : 0 < t) (M : Matrix (Fin t) (Fin t) ℚ) (hM : IsZPlus M)
    (γ : Fin t → ℚ) (hγ : ∀ i, 0 < γ i) (p : Fin t → ℝ) (hp : ∀ j, 0 ≤ p j)
    (hMp : ∀ i, rowVal M p i ≤ (γ i : ℝ)) :
    ∀ i, -((lam γ i : ℚ) : ℝ) ≤ rowVal M p i ∧
      -((Bconst γ ht - 1) * (γ i : ℝ)) ≤ -((lam γ i : ℚ) : ℝ) := by sorry

end LinExchangeSP.ZPlus
Source
Garg & Végh, A strongly polynomial algorithm for linear exchange markets, arXiv:1809.06266v3, p. 16, Lemma 7.1
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