Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Β§6, p. 354 β€” Schrijver's ring-family reduction: g of (26) is submodular (27), and minimizing g βˆ’ c over 2^V yields a minimizer of f over π’ž

Proved
SchrijverSFM.Ring.ring_family_reduction

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reductionring-familysubmodular-functionsubmodular-minimization

Let VVV be a finite set and C\mathcal CC a ring family of subsets of VVV, i.e. closed under union and intersection, normalized as in the paper so that βˆ…βˆˆC\emptyset \in \mathcal Cβˆ…βˆˆC, V∈CV \in \mathcal CV∈C, and Muβ‰ MvM_u \ne M_vMu​=Mv​ for all uβ‰ vu \ne vuξ€ =v, where MvM_vMv​ is the smallest set of C\mathcal CC containing vvv. Let f:2Vβ†’Rf : 2^V \to \mathbb Rf:2Vβ†’R be submodular on C\mathcal CC:

f(XβˆͺY)+f(X∩Y)≀f(X)+f(Y)(X,Y∈C).f(X \cup Y) + f(X \cap Y) \le f(X) + f(Y) \qquad (X, Y \in \mathcal C).f(XβˆͺY)+f(X∩Y)≀f(X)+f(Y)(X,Y∈C).

For v∈Vv \in Vv∈V let LvL_vLv​ be the largest set of C\mathcal CC not containing vvv, let

c(v):=max⁑{0,Β f(Lv)βˆ’f(Lvβˆͺ{v})}c(v) := \max\{0,\ f(L_v) - f(L_v \cup \{v\})\}c(v):=max{0,Β f(Lv​)βˆ’f(Lv​βˆͺ{v})}

as in (23), and c(X):=βˆ‘v∈Xc(v)c(X) := \sum_{v \in X} c(v)c(X):=βˆ‘v∈X​c(v). For XβŠ†VX \subseteq VXβŠ†V let Xβ€Ύ\overline XX be 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). Then:

  1. ggg is submodular on all subsets of VVV: g(X)+g(Y)β‰₯g(X∩Y)+g(XβˆͺY)g(X) + g(Y) \ge g(X \cap Y) + g(X \cup Y)g(X)+g(Y)β‰₯g(X∩Y)+g(XβˆͺY) for all X,YβŠ†VX, Y \subseteq VX,YβŠ†V (display (27));
  2. if UβŠ†VU \subseteq VUβŠ†V minimizes g(U)βˆ’c(U)g(U) - c(U)g(U)βˆ’c(U) over all subsets of VVV, then Uβ€ΎβˆˆC\overline U \in \mathcal CU∈C and
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,

that is, Uβ€Ύ\overline UU minimizes fff over C\mathcal CC.

Together these say that any algorithm minimizing submodular functions on all subsets of VVV also minimizes a submodular function given only on a ring family: run it on the submodular function gβˆ’cg - cgβˆ’c and take the closure of its output.

Formalization Note fff is a function on all of Finset V, but its values outside C\mathcal CC never enter ggg, ccc or the conclusion under the hypotheses. The hypotheses βˆ…βˆˆC\emptyset \in \mathcal Cβˆ…βˆˆC, V∈CV \in \mathcal CV∈C and Muβ‰ MvM_u \ne M_vMu​=Mv​ are the paper's normalization ("We can assume that M=βˆ…M = \emptysetM=βˆ…, V∈CV \in \mathcal CV∈C, and Muβ‰ MvM_u \ne M_vMu​=Mv​ for all uβ‰ vu \ne vuξ€ =v"); without Muβ‰ MvM_u \ne M_vMu​=Mv​ the set Lvβˆͺ{v}L_v \cup \{v\}Lv​βˆͺ{v} in (23) may lie outside C\mathcal CC and the statement can fail. The paper allows any ordered field; we use R\mathbb RR. The running-time claims of Β§6 (computing ccc with 2∣V∣2|V|2∣V∣ oracle calls, strongly polynomial time) are not formalized.

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

theorem ring_family_reduction {V : Type} [Fintype V] [DecidableEq V]
    (C : Set (Finset V)) (hC : IsRingFamily C) (hempty : βˆ… ∈ C) (huniv : Finset.univ ∈ C)
    (hM : βˆ€ u v : V, u β‰  v β†’ M C u β‰  M C v) (f : Finset V β†’ ℝ) (hf : SubmodularOn C f) :
    NonmonotoneSubmod.Shared.Submodular (g C f) ∧
      βˆ€ U : Finset V, (βˆ€ 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), pp. 353–354, Β§6, display (27) and 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