Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.23 -- submodular_base_polyhedron_minkowski_sum

Proved
DiscreteConvex.MConvexSetsB.submodular_base_polyhedron_minkowski_sum

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

combinatoricsconvex-optimizationdiscrete-convex-analysis

Theorem 4.23 (p.115-116). (1) For submodular set functions ρ1,ρ2∈S[R]\rho_1,\rho_2 \in S[\mathbb R]ρ1​,ρ2​∈S[R], B(ρ1)+B(ρ2)=B(ρ1+ρ2)B(\rho_1) + B(\rho_2) = B(\rho_1+\rho_2)B(ρ1​)+B(ρ2​)=B(ρ1​+ρ2​) (Minkowski sum of base polyhedra). (2) For integer-valued ρ1,ρ2∈S[Z]\rho_1,\rho_2 \in S[\mathbb Z]ρ1​,ρ2​∈S[Z], (B(ρ1)∩ZV)+(B(ρ2)∩ZV)=B(ρ1+ρ2)∩ZV(B(\rho_1)\cap\mathbb Z^V) + (B(\rho_2)\cap\mathbb Z^V) = B(\rho_1+\rho_2)\cap\mathbb Z^V(B(ρ1​)∩ZV)+(B(ρ2​)∩ZV)=B(ρ1​+ρ2​)∩ZV. (3) For M-convex sets B1,B2⊆ZVB_1,B_2 \subseteq \mathbb Z^VB1​,B2​⊆ZV, B1+B2B_1+B_2B1​+B2​ is an M-convex set and B1+B2‾=B1‾+B2‾\overline{B_1+B_2} = \overline{B_1}+\overline{B_2}B1​+B2​​=B1​​+B2​​: the Minkowski sum of M-convex sets is again M-convex, and its convex hull is the Minkowski sum of the summands' convex hulls.

Formalization Note. Part (3) is stated for arbitrary M-convex B1,B2B_1, B_2B1​,B2​ independently of the ρ1,ρ2\rho_1,\rho_2ρ1​,ρ2​ of parts (1)-(2), rather than adding Bi=B(ρi)∩ZVB_i = B(\rho_i)\cap\mathbb Z^VBi​=B(ρi​)∩ZV as an extra hypothesis: Theorem 4.15 (chunk 04-mconvex-sets) already supplies such a ρi\rho_iρi​ for any M-convex BiB_iBi​, so no generality is lost by decoupling the three parts. Minkowski sums use Mathlib's pointwise Set addition.

(Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.115-116, Theorem 4.23.)

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_MConvexSetsB_SubmodularSetFunction
import Definitions.Def_DiscreteConvex_MConvexSetsB_BasePolyhedron
import Definitions.Def_DiscreteConvex_MConvexSetsB_IsIntegerValued
import Definitions.Def_DiscreteConvex_MConvexSetsB_IntPts
import Definitions.Def_DiscreteConvex_MConvexSetsB_ExchangeAxiomB
import Definitions.Def_DiscreteConvex_MConvexSetsB_IntEmbed
open scoped Pointwise
Formal statement
/-!
Murota, *Discrete Convex Analysis*, SIAM 2003, p.115-116, Theorem 4.23, in `DiscreteConvex.MConvexSetsB`.
-/

namespace DiscreteConvex.MConvexSetsB

/-- Theorem 4.23 (Murota, *Discrete Convex Analysis*, SIAM 2003, p.115-116). See the item's
`natural_language_statement` for the full statement. -/
theorem submodular_base_polyhedron_minkowski_sum {V : Type*} [Fintype V] [DecidableEq V]
    (ρ1 ρ2 : Finset V → WithTop ℝ) (hρ1 : SubmodularSetFunction ρ1) (hρ2 : SubmodularSetFunction ρ2)
    (B1 B2 : Set (V → ℤ)) (hExc1 : ExchangeAxiomB B1) (hExc2 : ExchangeAxiomB B2)
    (hB1ne : B1.Nonempty) (hB2ne : B2.Nonempty) :
    (BasePolyhedron ρ1 + BasePolyhedron ρ2 = BasePolyhedron (fun X => ρ1 X + ρ2 X)) ∧
    (IsIntegerValued ρ1 → IsIntegerValued ρ2 →
      (BasePolyhedron ρ1 ∩ IntPts) + (BasePolyhedron ρ2 ∩ IntPts) =
        BasePolyhedron (fun X => ρ1 X + ρ2 X) ∩ IntPts) ∧
    (ExchangeAxiomB (B1 + B2) ∧ (B1 + B2).Nonempty ∧
      convexHull ℝ (IntEmbed (B1 + B2)) = convexHull ℝ (IntEmbed B1) + convexHull ℝ (IntEmbed B2)) := by sorry

end DiscreteConvex.MConvexSetsB
Source
Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.115-116, Theorem 4.23
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