Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 5 — a small facial description makes every CH(S(z)) a convex polyhedron

Proved
KarpPapadimitriou.Facial.hull_isPolyhedron_of_small

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

convex-hullp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1polyhedral-combinatorics

Let CCC be a combinatorial optimization problem and F(C)F(C)F(C) a small facial description of CCC. Then for every z∈Lz\in Lz∈L:

  1. only finitely many triples of F(C)F(C)F(C) have first entry zzz;
  2. CH(S(z))\mathrm{CH}(S(z))CH(S(z)) is a convex polyhedron, i.e. there are finitely many pairs (a1,b1),…,(am,bm)∈Qn(z)×Q(a_1,b_1),\dots,(a_m,b_m)\in\mathbb Q^{n(z)}\times\mathbb Q(a1​,b1​),…,(am​,bm​)∈Qn(z)×Q with
CH(S(z))={x∈Qn(z):ai⋅x≤bi, i=1,…,m}.\mathrm{CH}(S(z))=\{x\in\mathbb Q^{n(z)} : a_i\cdot x\le b_i,\ i=1,\dots,m\}.CH(S(z))={x∈Qn(z):ai​⋅x≤bi​, i=1,…,m}.

This is the remark that follows the definition of small facial descriptions: smallness bounds the coefficients, so only finitely many inequalities can be listed for each input, and the convex hull is the intersection of finitely many half-spaces.

Formalization Note Part 1 is the reason the paper's remark holds and is stated explicitly. A half-space is written {x:a⋅x≤b}\{x : a\cdot x\le b\}{x:a⋅x≤b} with rational data; m=0m=0m=0 gives the whole space.

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

theorem hull_isPolyhedron_of_small (C : COP) (F : Triples C)
    (hF : IsFacialDescription C F) (hs : IsSmall C F) (z : List Bool) (hz : z ∈ C.L) :
    {fg : (Fin (C.n z) → ℤ) × ℤ |
        (⟨z, fg⟩ : Σ z : List Bool, (Fin (C.n z) → ℤ) × ℤ) ∈ F}.Finite ∧
      ∃ H : Finset ((Fin (C.n z) → ℚ) × ℚ),
        hull C z = {x : Fin (C.n z) → ℚ | ∀ h ∈ H, h.1 ⬝ᵥ x ≤ h.2} := by sorry

end KarpPapadimitriou.Facial
Source
Karp & Papadimitriou, On linear characterizations of combinatorial optimization problems, MIT/LCS/TM-154 (Feb. 1980), p. 5, remark after the definition of small facial descriptions
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