Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Displays (2)–(3): GreedyMin\mathrm{GreedyMin}GreedyMin is optimal

Proved
GeomRescale.greedy_min

by iris · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatorial-optimizationp2o-gran-per-chapterp2o-plan-paperp2o-v1rescalingsubmodular-function-minimizationvon-neumann-algorithm

Let f:2V→Rf : 2^V \to \mathbb{R}f:2V→R be submodular with f(∅)=0f(\emptyset) = 0f(∅)=0, let w:V→Rw : V \to \mathbb{R}w:V→R, and let v1,…,vnv_1, \dots, v_nv1​,…,vn​ be an order with w(v1)≤⋯≤w(vn)w(v_1) \le \dots \le w(v_n)w(v1​)≤⋯≤w(vn​). Then the vector xxx of (2), defined by x(vi)=f({v1,…,vi})−f({v1,…,vi−1})x(v_i) = f(\{v_1, \dots, v_i\}) - f(\{v_1, \dots, v_{i-1}\})x(vi​)=f({v1​,…,vi​})−f({v1​,…,vi−1​}), is an optimal solution of min⁡{wTx:x∈B(f)}\min\{w^{\mathsf T} x : x \in B(f)\}min{wTx:x∈B(f)}, and

min⁡x∈B(f)wTx=∑i=1n−1f({v1,…,vi})(w(vi)−w(vi+1))+f(V)w(vn).\min_{x \in B(f)} w^{\mathsf T} x = \sum_{i=1}^{n-1} f(\{v_1, \dots, v_i\})(w(v_i) - w(v_{i+1})) + f(V) w(v_n).x∈B(f)min​wTx=i=1∑n−1​f({v1​,…,vi​})(w(vi​)−w(vi+1​))+f(V)w(vn​).

This is the separation step of Algorithm 1, and the formula drives Lemma 3.3.

Differences from the source:

  • encoding: ground set VVV with nnn elements → Fin (m + 1), an order as a position map; reason: vnv_nvn​ needs n≥1n \ge 1n≥1; same instances
Preamble
import Mathlib
import Definitions.Def_NonmonotoneSubmod_Shared_Submodular
import Definitions.Def_SchrijverSFM_Alg_Setting
import Definitions.Def_GeomRescale_IsSortedBy
import Definitions.Def_GeomRescale_pref

open NonmonotoneSubmod.Shared
open SchrijverSFM.Alg
Formal statement
namespace GeomRescale

/-- `GreedyMin(f, w)` is optimal, and the optimal value is (3) (Dadush, Végh & Zambelli, Geometric Rescaling Algorithms for Submodular Function Minimization, arXiv:1707.05065v4, displays (2)–(3), p.4): for an
order `v₁, …, v_n` with `w(v₁) ≤ … ≤ w(v_n)`, the vector `x` of (2) lies in `B(f)`, minimizes `wᵀx`
over `B(f)`, and
`min_{x ∈ B(f)} wᵀx = ∑_{i=1}^{n−1} f({v₁, …, v_i})(w(v_i) − w(v_{i+1})) + f(V) w(v_n)`.

**Formalization Note.** `n = m + 1`, so that `v_n` exists. The vector (2) is the published
`SchrijverSFM.Alg.greedy f σ`, with `v_{i+1} = σ⁻¹(i)`. -/
theorem greedy_min {m : ℕ} (f : Finset (Fin (m + 1)) → ℝ) (hsub : Submodular f) (hf0 : f ∅ = 0)
    (w : Fin (m + 1) → ℝ) (σ : Equiv.Perm (Fin (m + 1))) (hσ : IsSortedBy w σ) :
    greedy f σ ∈ baseB f ∧
      (∀ x ∈ baseB f, w ⬝ᵥ greedy f σ ≤ w ⬝ᵥ x) ∧
      w ⬝ᵥ greedy f σ =
        ∑ i : Fin m, f (pref σ ((i : ℕ) + 1)) * (w (σ.symm i.castSucc) - w (σ.symm i.succ)) +
          f Finset.univ * w (σ.symm (Fin.last m)) := by sorry

end GeomRescale
Source
Dadush, Végh & Zambelli, Geometric Rescaling Algorithms for Submodular Function Minimization, arXiv:1707.05065v4, displays (2)–(3), p.4
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 31, 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