Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6, last paragraph, p. 354 — if U minimizes g(U) − c(U) over all U ⊆ V then Ū minimizes f over 𝒞

Proved
SchrijverSFM.Ring.minimizer_transfer

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

minimizerp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ring-familysubmodular-minimization

Let VVV be a finite set and C\mathcal CC a ring family on VVV with V∈CV \in \mathcal CV∈C. Let f:2V→Rf : 2^V \to \mathbb Rf:2V→R be any function, ccc the weights of (23) extended modularly to sets, X‾\overline XX the smallest set of C\mathcal CC containing XXX, and g(X)=f(X‾)+c(X‾)g(X) = f(\overline X) + c(\overline X)g(X)=f(X)+c(X) as in (26). If U⊆VU \subseteq VU⊆V minimizes g(U)−c(U)g(U) - c(U)g(U)−c(U) over all subsets of VVV, that is,

g(U)−c(U)≤g(W)−c(W)for all W⊆V,g(U) - c(U) \le g(W) - c(W) \qquad \text{for all } W \subseteq V,g(U)−c(U)≤g(W)−c(W)for all W⊆V,

then U‾∈C\overline U \in \mathcal CU∈C and U‾\overline UU minimizes fff over C\mathcal CC:

f(U‾)≤f(T)for all T∈C.f(\overline U) \le f(T) \qquad \text{for all } T \in \mathcal C.f(U)≤f(T)for all T∈C.

This is the final step of Schrijver's reduction: a minimizer of the submodular function g−cg - cg−c on 2V2^V2V, found by the algorithm of §§2–5, yields a minimizer of fff over the ring family.

Formalization Note Only closure under union and intersection and V∈CV \in \mathcal CV∈C are used; submodularity of fff, ∅∈C\emptyset \in \mathcal C∅∈C and Mu≠MvM_u \ne M_vMu​=Mv​ are not assumed here (they are needed for (27), not for this transfer).

Preamble
import Mathlib
import Definitions.Def_NonmonotoneSubmod_Shared_Submodular
import Definitions.Def_SchrijverSFM_Ring_Setting
Formal statement
namespace SchrijverSFM.Ring

theorem minimizer_transfer {V : Type} [Fintype V] [DecidableEq V]
    (C : Set (Finset V)) (hC : IsRingFamily C) (huniv : Finset.univ ∈ C)
    (f : Finset V → ℝ) (U : Finset V)
    (hU : ∀ W : Finset V, g C f U - csum C f U ≤ g C f W - csum C f W) :
    closure C U ∈ C ∧ ∀ T ∈ C, f (closure C U) ≤ f T := by sorry

end SchrijverSFM.Ring
Source
Schrijver, A combinatorial algorithm minimizing submodular functions in strongly polynomial time, J. Combin. Theory Ser. B 80 (2000), p. 354, §6, last paragraph
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