Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 7, proof of Theorem 1, (i)⇔(ii) — ⟨z,c,k⟩ ∉ D(C) iff c·x < k on all of CH(S(z))

Proved
KarpPapadimitriou.Facial.notMem_DLang_iff_lt_on_hull

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

convex-hulllinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let CCC be a combinatorial optimization problem, 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:

  1. ⟨z,c,k⟩∉D(C)\langle z,c,k\rangle\notin D(C)⟨z,c,k⟩∈/D(C);
  2. 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, read as
c⋅x<kfor every x∈CH(S(z))⊆Qn(z).c\cdot x<k\quad\text{for every }x\in\mathrm{CH}(S(z))\subseteq\mathbb Q^{n(z)}.c⋅x<kfor every x∈CH(S(z))⊆Qn(z).

This is the first step of the proof of Theorem 1: it replaces the combinatorial question by a statement about the convex hull, to which linear programming applies.

Formalization Note "Has optimal value <k<k<k" is read as "every feasible point has value <k<k<k"; this reading is meaningful also when S(z)S(z)S(z) is empty (vacuously true) and when the objective is unbounded (false), and under it the equivalence holds for every S(z)S(z)S(z). The triple ⟨z,c,k⟩\langle z,c,k\rangle⟨z,c,k⟩ is its code over {0,1,−,#}\{0,1,-,\#\}{0,1,−,#}.

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

theorem notMem_DLang_iff_lt_on_hull (C : COP) (z : List Bool) (hz : z ∈ C.L)
    (c : Fin (C.n z) → ℤ) (k : ℤ) :
    encTriple z c k ∉ DLang C ↔
      ∀ x ∈ hull C z, (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), pp. 7–8, proof of Theorem 1, (i)⇔(ii)
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