Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Display (16), §4, Case 1, p. 351 — if D has no path from P to N, the set U of vertices that can reach N minimizes f

Proved
SchrijverSFM.Alg.caseOne_minimizes

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

base-polytopeoptimality-certificatep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1submodular-minimization

Let fff be a submodular real function on the subsets of V={0,…,n−1}V = \{0, \dots, n-1\}V={0,…,n−1} with f(∅)=0f(\emptyset) = 0f(∅)=0. Let x=λ1h≺1+⋯+λkh≺kx = \lambda_1 h^{\prec_1} + \dots + \lambda_k h^{\prec_k}x=λ1​h≺1​+⋯+λk​h≺k​ be a state of the algorithm (k≥1k \ge 1k≥1, λi>0\lambda_i > 0λi​>0, ∑iλi=1\sum_i \lambda_i = 1∑i​λi​=1), let D=(V,A)D = (V, A)D=(V,A) with A={(u,v)∣u≺iv for some i}A = \{(u, v) \mid u \prec_i v \text{ for some } i\}A={(u,v)∣u≺i​v for some i}, P={v∣x(v)>0}P = \{v \mid x(v) > 0\}P={v∣x(v)>0} and N={v∣x(v)<0}N = \{v \mid x(v) < 0\}N={v∣x(v)<0}. Suppose DDD has no directed path from PPP to NNN (Case 1), and let UUU be the set of vertices of DDD that can reach NNN by a directed path (of length ≥0\ge 0≥0). Then

f(U)≤f(W)for all W⊆V.f(U) \le f(W) \qquad \text{for all } W \subseteq V.f(U)≤f(W)for all W⊆V.

This is the termination condition of the algorithm: when it stops, UUU is a minimizer of fff.

Preamble
import Mathlib
import Definitions.Def_SchrijverSFM_Alg_Setting
Formal statement
namespace SchrijverSFM.Alg

open NonmonotoneSubmod.Shared

theorem caseOne_minimizes {n : ℕ} (f : Finset (Fin n) → ℝ) (hsub : Submodular f)
    (hf0 : f ∅ = 0) (S : State n) (hS : Valid S) (h1 : caseOne f S) :
    ∀ W : Finset (Fin n), f (caseOneSet f S) ≤ f W := by sorry
end SchrijverSFM.Alg
Source
Schrijver, A combinatorial algorithm minimizing submodular functions in strongly polynomial time, J. Combin. Theory Ser. B 80 (2000), p. 351, §4 Case 1, display (16)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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