Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 (p. 4) — Z is empty iff some u ≥ 0 has Mᵀu ≤ 0 and uᵀq > 0

Proved
LemkeLCP.Existence.lemma_2_p4

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

farkas-lemmalinear-complementarityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1theorem-of-the-alternative

Let MMM be a real square matrix of order nnn, q∈Rnq\in\mathbb R^nq∈Rn, and Z={z≥0:Mz−q≥0}Z=\{z\ge0 : Mz-q\ge0\}Z={z≥0:Mz−q≥0}. Then ZZZ is empty if and only if there is a vector u≥0u\ge 0u≥0 satisfying

MTu≤0anduTq>0.(5)M^{\mathsf T}u\le 0\qquad\text{and}\qquad u^{\mathsf T}q>0. \tag{5}MTu≤0anduTq>0.(5)

This is a theorem of the alternative of Farkas type. In the proof of Theorem 4 only the direction "a uuu satisfying (5) makes ZZZ empty" is used: it is how the case zˉ0>0\bar z_0>0zˉ0​>0 of the augmented path is shown to certify infeasibility. The page states it as an equivalence, and so does this item.

Formalization Note It is the specialization of part (ii) of the published Farkas lemma MatousekLP.Duality.farkas_three_variants to A=−MA=-MA=−M, b=−qb=-qb=−q, over a general finite index type. The paper labels two different results "Lemma 2" (pp. 4 and 6); this is the one on p. 4, which the proof of Theorem 4 on p. 8 calls "Lemma 1".

Preamble
import Mathlib
import Definitions.Def_LemkeLCP_Existence_Setting
open Matrix
Formal statement
namespace LemkeLCP.Existence

theorem lemma_2_p4 {ι : Type*} [Fintype ι] [DecidableEq ι] (M : Matrix ι ι ℝ) (q : ι → ℝ) :
    Z M q = ∅ ↔ ∃ u : ι → ℝ, 0 ≤ u ∧ Mᵀ *ᵥ u ≤ 0 ∧ 0 < u ⬝ᵥ q := by sorry

end LemkeLCP.Existence
Source
Lemke, Bimatrix equilibrium points and mathematical programming, hal-01885823v1, p. 4, Lemma 2, (5)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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