Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 10.8 -- min-max relation for the base polyhedron

Proved
DiscreteConvex.Algorithms.base_polyhedron_min_max

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

combinatoricsdiscrete-convex-analysisoperations-research

Proposition 10.8 (p.288). For a finite-valued submodular set function ρ:2V→R\rho : 2^V \to \mathbb Rρ:2V→R, max⁡{x−(V):x∈B(ρ)}=min⁡{ρ(X):X⊆V}\max\{x^-(V) : x \in B(\rho)\} = \min\{\rho(X) : X \subseteq V\}max{x−(V):x∈B(ρ)}=min{ρ(X):X⊆V} (Eq. (10.11)). If ρ\rhoρ is integer valued, the maximizer xxx can be chosen to be an integer vector.

Formalization note. No method or algorithm appears in this statement — it is a structural min-max identity, proved independently of (and, per the book's own remark, an easy consequence of) Edmonds's intersection theorem (chunk 04's edmonds_intersection_theorem) — chosen as a milestone precisely because it needs no algorithm-formalization apparatus, unlike this mission's other two items.

(Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.288, Proposition 10.8.)

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_MConvexSets_SubmodularSetFunction
import Definitions.Def_DiscreteConvex_MConvexSets_BasePolyhedron
import Definitions.Def_DiscreteConvex_Algorithms_NegSum
import Definitions.Def_DiscreteConvex_Algorithms_IsIntegerValued
Formal statement
open DiscreteConvex.MConvexSets

namespace DiscreteConvex.Algorithms

/-- Proposition 10.8 (Murota, *Discrete Convex Analysis*, SIAM 2003, p.288). For a
finite-valued submodular set function `ρ : 2^V → R`, `max\{x⁻(V) : x ∈ B(ρ)\} = min\{ρ(X) :
X ⊆ V\}`. If `ρ` is integer valued, the maximizer can be chosen to be an integer vector. -/
theorem base_polyhedron_min_max {V : Type*} [Fintype V] [DecidableEq V]
    (ρ : Finset V → WithTop ℝ) (hρ : SubmodularSetFunction ρ) (hfin : ∀ X, ρ X ≠ ⊤) :
    (sSup {v : WithTop ℝ | ∃ x ∈ BasePolyhedron ρ, v = (NegSum x : WithTop ℝ)} =
      Finset.univ.inf ρ) ∧
    (IsIntegerValued ρ →
      ∃ x ∈ BasePolyhedron ρ, (∀ v : V, ∃ n : ℤ, x v = (n : ℝ)) ∧
        (NegSum x : WithTop ℝ) = Finset.univ.inf ρ) := by sorry

end DiscreteConvex.Algorithms
Source
Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.288, Proposition 10.8
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