Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 8, proof of Theorem 1, (iii)⇔(vi) — a nonsingular n(z)×n(z) row selection of F(C) certifies optimal value < k

Proved
KarpPapadimitriou.Facial.lt_on_system_iff_basic_dual

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

basic-solutionslinear-programminglp-dualityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let CCC be a combinatorial optimization problem, F(C)F(C)F(C) a small facial description of CCC, and z∈Lz\in Lz∈L with S(z)≠∅S(z)\neq\emptysetS(z)=∅. Let c∈Zn(z)c\in\mathbb Z^{n(z)}c∈Zn(z) and k∈Zk\in\mathbb Zk∈Z. Then the following are equivalent:

(iii) the program max⁡ c⋅x\max\ c\cdot xmax c⋅x subject to f⋅x≤gf\cdot x\le gf⋅x≤g for all ⟨z,f,g⟩∈F(C)\langle z,f,g\rangle\in F(C)⟨z,f,g⟩∈F(C) has optimal value <k<k<k, i.e. every feasible x∈Qn(z)x\in\mathbb Q^{n(z)}x∈Qn(z) has c⋅x<kc\cdot x<kc⋅x<k;

(vi) there exist an n(z)×n(z)n(z)\times n(z)n(z)×n(z) integer matrix F=(fij)\mathbf F=(f_{ij})F=(fij​) and an integer vector g∈Zn(z)g\in\mathbb Z^{n(z)}g∈Zn(z) such that

⟨z,(fi1,fi2,…,fin(z)),gi⟩∈F(C),i=1,2,…,n(z),\langle z,(f_{i1},f_{i2},\dots,f_{in(z)}),g_i\rangle\in F(C),\qquad i=1,2,\dots,n(z),⟨z,(fi1​,fi2​,…,fin(z)​),gi​⟩∈F(C),i=1,2,…,n(z),

F\mathbf FF is nonsingular, and the (therefore unique) solution y∈Qn(z)y\in\mathbb Q^{n(z)}y∈Qn(z) of the system

yTF=cy^{T}\mathbf F=cyTF=c

is nonnegative and satisfies yTg<ky^{T}g<kyTg<k.

In the paper this equivalence passes through (iv) "the dual of program (I) has optimal value <k<k<k" and (v) "the dual of program (I) has a basic feasible solution of value <k<k<k"; condition (vi) is the explicit form of (v), a basic dual solution supported on n(z)n(z)n(z) linearly independent inequalities. It is the short certificate that Algorithm B guesses to recognize the complement of D(C)D(C)D(C).

Formalization Note The hypothesis S(z)≠∅S(z)\neq\emptysetS(z)=∅ is tacit in the paper's proof and is needed: for n(z)=1n(z)=1n(z)=1 and the description {x≤−1, −x≤0}\{x\le-1,\ -x\le0\}{x≤−1, −x≤0} of the empty hull, c=−1c=-1c=−1 and k=0k=0k=0 satisfy (iii) (vacuously), while the only nonsingular 1×11\times11×1 selection with a nonnegative solution of yTF=cy^T\mathbf F=cyTF=c is the row −x≤0-x\le 0−x≤0, with y=1y=1y=1 and yTg=0≮0y^Tg=0\not<0yTg=0<0. "Unique solution" is formalized as nonsingularity of F\mathbf FF (determinant ≠0\neq0=0), which is how Algorithm B (step (iv)) checks it. Intermediate conditions (iv) and (v) are not stated separately.

Preamble
import Mathlib
import Definitions.Def_KarpPapadimitriou_Facial_FacialDescription
Formal statement
namespace KarpPapadimitriou.Facial

theorem lt_on_system_iff_basic_dual (C : COP) (F : Triples C) (hF : IsFacialDescription C F)
    (hs : IsSmall C F) (z : List Bool) (hz : z ∈ C.L) (hS : (C.S z).Nonempty)
    (c : Fin (C.n z) → ℤ) (k : ℤ) :
    (∀ x : Fin (C.n z) → ℚ,
        (∀ (f : Fin (C.n z) → ℤ) (g : ℤ),
            (⟨z, (f, g)⟩ : Σ z : List Bool, (Fin (C.n z) → ℤ) × ℤ) ∈ F →
              (fun j => (f j : ℚ)) ⬝ᵥ x ≤ (g : ℚ)) →
          (fun j => (c j : ℚ)) ⬝ᵥ x < (k : ℚ)) ↔
      ∃ (fm : Matrix (Fin (C.n z)) (Fin (C.n z)) ℤ) (g : Fin (C.n z) → ℤ),
        (∀ i, (⟨z, (fm i, g i)⟩ : Σ z : List Bool, (Fin (C.n z) → ℤ) × ℤ) ∈ F) ∧
          fm.det ≠ 0 ∧
          ∃ y : Fin (C.n z) → ℚ,
            Matrix.vecMul y (fm.map (fun a : ℤ => (a : ℚ))) = (fun j => (c j : ℚ)) ∧
              0 ≤ y ∧ y ⬝ᵥ (fun i => (g i : ℚ)) < (k : ℚ) := by sorry

end KarpPapadimitriou.Facial
Source
Karp & Papadimitriou, On linear characterizations of combinatorial optimization problems, MIT/LCS/TM-154 (Feb. 1980), p. 8, proof of Theorem 1, (iii)⇔(iv)⇔(v)⇔(vi)
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