Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 8, proof of Theorem 1, (ii)⇔(iii) — the hull may be replaced by the system f·x ≤ g, ⟨z,f,g⟩ ∈ F(C)

Proved
KarpPapadimitriou.Facial.lt_on_hull_iff_lt_on_system

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

linear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1polyhedral-combinatorics

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

(ii) the program max⁡ c⋅x\max\ c\cdot xmax c⋅x subject to x∈CH(S(z))x\in\mathrm{CH}(S(z))x∈CH(S(z)) has optimal value <k<k<k;

(iii) the program

max⁡ c⋅xsubject tof⋅x≤g(⟨z,f,g⟩∈F(C))(I)\max\ c\cdot x\quad\text{subject to}\quad f\cdot x\le g\quad(\langle z,f,g\rangle\in F(C))\qquad\text{(I)}max c⋅xsubject tof⋅x≤g(⟨z,f,g⟩∈F(C))(I)

has optimal value <k<k<k.

Here both are read as "every feasible x∈Qn(z)x\in\mathbb Q^{n(z)}x∈Qn(z) has c⋅x<kc\cdot x<kc⋅x<k". The step is the point where the facial description enters the proof of Theorem 1.

Formalization Note As in step (i)⇔(ii), "optimal value <k<k<k" means that every feasible point has value <k<k<k.

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

theorem lt_on_hull_iff_lt_on_system (C : COP) (F : Triples C) (hF : IsFacialDescription C F)
    (z : List Bool) (hz : z ∈ C.L) (c : Fin (C.n z) → ℤ) (k : ℤ) :
    (∀ x ∈ hull C z, (fun j => (c j : ℚ)) ⬝ᵥ x < (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 : ℚ) := 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, (ii)⇔(iii)
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