Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4–§5, pp. 351–352 — Schrijver's algorithm: Case 1 returns a minimizer (16), every Case 2 state has a successor, and every run has at most |V|⁶ iterations

Proved
SchrijverSFM.Alg.schrijver_algorithm

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

combinatorial-algorithmiteration-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strongly-polynomialsubmodular-minimization

Let V={0,…,n−1}V = \{0, \dots, n-1\}V={0,…,n−1} and let fff be a submodular real function on the subsets of VVV with f(∅)=0f(\emptyset) = 0f(∅)=0. Consider Schrijver's algorithm, whose states are convex combinations x=λ1h≺1+⋯+λkh≺kx = \lambda_1 h^{\prec_1} + \dots + \lambda_k h^{\prec_k}x=λ1​h≺1​+⋯+λk​h≺k​ of greedy vectors, with digraph DDD, P={x>0}P = \{x > 0\}P={x>0} and N={x<0}N = \{x < 0\}N={x<0}. Then:

  1. (Correctness, (16).) For every valid state in Case 1 (no directed path from PPP to NNN), the set UUU of vertices that can reach NNN minimizes fff: f(U)≤f(W)f(U) \le f(W)f(U)≤f(W) for all W⊆VW \subseteq VW⊆V.
  2. (Well-definedness.) For every valid state in Case 2, one iteration of the algorithm can be carried out.
  3. (Running time, §5.) Every run S0→S1→⋯→SmS_0 \to S_1 \to \dots \to S_mS0​→S1​→⋯→Sm​ of mmm iterations from an initial state S0=((≺,1))S_0 = ((\prec, 1))S0​=((≺,1)) satisfies
m≤∣V∣6.m \le |V|^6.m≤∣V∣6.

Together: from any initial order, the algorithm reaches Case 1 after at most ∣V∣6|V|^6∣V∣6 iterations, and then returns a minimizer of fff. This is the main result of the paper; it gives a combinatorial algorithm for submodular function minimization whose number of iterations is bounded by a polynomial in ∣V∣|V|∣V∣ alone.

Formalization Note The ground set is Fin n and ∣V∣=n|V| = n∣V∣=n; "largest" in the choice of ttt and sss refers to the order of Fin n; values are real rather than in an arbitrary ordered field. An iteration is the relation Step of the setting file, which admits every choice the paper leaves open. Conjunct 2 rules out a vacuous reading of conjunct 3. "Strongly polynomial time" and the number of oracle calls are not formalized (there is no machine model); only the iteration count is.

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

open NonmonotoneSubmod.Shared

theorem schrijver_algorithm {n : ℕ} (f : Finset (Fin n) → ℝ) (hsub : Submodular f)
    (hf0 : f ∅ = 0) :
    (∀ S : State n, Valid S → caseOne f S → ∀ W : Finset (Fin n), f (caseOneSet f S) ≤ f W) ∧
    (∀ S : State n, Valid S → ¬ caseOne f S → ∃ S' : State n, Step f S S') ∧
    (∀ (S : ℕ → State n) (m : ℕ), IsRun f S m → m ≤ n ^ 6) := 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)), pp. 351–352 (§4 Case 2) and p. 352 (§5, first sentence)
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