Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Display (24), Β§6, p. 354 β€” f(Y) + c(Y) β‰₯ f(X) + c(X) for X βŠ† Y in π’ž

Proved
SchrijverSFM.Ring.f_add_c_monotone

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

monotonicityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ring-familysubmodular-functionsubmodular-minimization

Let VVV be a finite set and C\mathcal CC a ring family on VVV with βˆ…,V∈C\emptyset, V \in \mathcal Cβˆ…,V∈C and Muβ‰ MvM_u \ne M_vMu​=Mv​ for all uβ‰ vu \ne vuξ€ =v (MvM_vMv​ 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, 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). Then for all X,Y∈CX, Y \in \mathcal CX,Y∈C with XβŠ†YX \subseteq YXβŠ†Y,

f(Y)+c(Y)β‰₯f(X)+c(X).f(Y) + c(Y) \ge f(X) + c(X).f(Y)+c(Y)β‰₯f(X)+c(X).

So f+cf + cf+c is monotone on C\mathcal CC. This is the inequality used in the last step of (27), and it is where the weights ccc earn their place in the definition of ggg.

Formalization Note The hypothesis Muβ‰ MvM_u \ne M_vMu​=Mv​ is necessary: with V={a,b}V = \{a, b\}V={a,b}, C={βˆ…,V}\mathcal C = \{\emptyset, V\}C={βˆ…,V} (so Ma=Mb=VM_a = M_b = VMa​=Mb​=V), f(βˆ…)=0f(\emptyset) = 0f(βˆ…)=0, f(V)=βˆ’10f(V) = -10f(V)=βˆ’10 and f({a})=f({b})=100f(\{a\}) = f(\{b\}) = 100f({a})=f({b})=100 (values off C\mathcal CC), one gets c≑0c \equiv 0c≑0 and f(V)+c(V)<f(βˆ…)+c(βˆ…)f(V) + c(V) < f(\emptyset) + c(\emptyset)f(V)+c(V)<f(βˆ…)+c(βˆ…).

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

theorem f_add_c_monotone {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) :
    βˆ€ X ∈ C, βˆ€ Y ∈ C, X βŠ† Y β†’ f X + csum C f X ≀ f Y + csum C f Y := 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, display (24)
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