Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.9 -- discrete separation for L-convex sets

Proved
DiscreteConvex.LConvexSets.discrete_separation_lconvex

by Shuze Chen · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsdiscrete-convex-analysisdiscrete-geometry

Theorem 5.9 (p.126). Let D1,D2⊆ZVD_1, D_2 \subseteq \mathbb Z^VD1​,D2​⊆ZV be L-convex sets. If they are disjoint, there exists x∗∈{−1,0,1}Vx^* \in \{-1,0,1\}^Vx∗∈{−1,0,1}V such that

inf⁡{⟨p,x∗⟩:p∈D1}−sup⁡{⟨p,x∗⟩:p∈D2}≥1.\inf\{\langle p, x^*\rangle : p \in D_1\} - \sup\{\langle p, x^*\rangle : p \in D_2\} \ge 1.inf{⟨p,x∗⟩:p∈D1​}−sup{⟨p,x∗⟩:p∈D2​}≥1.

An ordinary separating hyperplane exists for any two disjoint convex sets; the content here is that the separator can always be forced into {−1,0,1}V\{-1,0,1\}^V{−1,0,1}V — three values per coordinate — independent of how large or awkwardly shaped D1,D2D_1, D_2D1​,D2​ are. A formalization proving only the classical real-valued separation (any x∗∈RVx^* \in \mathbb R^Vx∗∈RV) would state nothing specific to discrete convexity.

Formalization Note. The conclusion is stated as sup⁡D2⟨p,x∗⟩+1≤inf⁡D1⟨p,x∗⟩\sup_{D_2}\langle p,x^*\rangle + 1 \le \inf_{D_1}\langle p,x^*\ranglesupD2​​⟨p,x∗⟩+1≤infD1​​⟨p,x∗⟩ (addition) rather than inf⁡−sup⁡≥1\inf - \sup \ge 1inf−sup≥1 (subtraction), an equivalent reformulation that avoids EReal subtraction's ⊤ - ⊤ ambiguity; the infimum and supremum are taken in EReal (a complete lattice) so that both are total even though D1,D2D_1, D_2D1​,D2​ may be unbounded (L-convex sets are always translation-invariant along the all-ones direction, hence typically infinite).

(Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.126, Theorem 5.9.)

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_LConvexSets_LConvexSet
Formal statement
namespace DiscreteConvex.LConvexSets

/-- Theorem 5.9 (discrete separation for L-convex sets; Murota, *Discrete Convex Analysis*,
SIAM 2003, p.126). Let `D1, D2 ⊆ Zⱽ` be L-convex sets. If they are disjoint, there exists
`x* ∈ {-1,0,1}ⱽ` such that `inf{⟨p,x*⟩ : p ∈ D1} - sup{⟨p,x*⟩ : p ∈ D2} ≥ 1`. -/
theorem discrete_separation_lconvex {V : Type*} [Fintype V] [DecidableEq V]
    (D1 D2 : Set (V → ℤ)) (hD1 : LConvexSet D1) (hD2 : LConvexSet D2)
    (hdisj : D1 ∩ D2 = ∅) :
    ∃ x : V → ℤ, (∀ v, x v = -1 ∨ x v = 0 ∨ x v = 1) ∧
      sSup ((fun p : V → ℤ => ((∑ v, (x v : ℝ) * (p v : ℝ) : ℝ) : EReal)) '' D2) + 1 ≤
        sInf ((fun p : V → ℤ => ((∑ v, (x v : ℝ) * (p v : ℝ) : ℝ) : EReal)) '' D1) := by sorry

end DiscreteConvex.LConvexSets
Source
Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.126, Theorem 5.9
Human review
  • Endorsed by Community (Bot) · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 1, 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