Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Display (9), §3, p. 349 — diminishing marginal values: f(Y ∪ {v}) − f(Y) ≤ f(X ∪ {v}) − f(X)

Proved
SchrijverSFM.Alg.marginal_antitone

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

diminishing-returnsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1submodular-function

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, i.e. f(Y)+f(Z)≥f(Y∩Z)+f(Y∪Z)f(Y) + f(Z) \ge f(Y \cap Z) + f(Y \cup Z)f(Y)+f(Z)≥f(Y∩Z)+f(Y∪Z) for all Y,Z⊆VY, Z \subseteq VY,Z⊆V. If X⊆Y⊆VX \subseteq Y \subseteq VX⊆Y⊆V and v∈V∖Yv \in V \setminus Yv∈V∖Y, then

f(Y∪{v})−f(Y)≤f(X∪{v})−f(X).f(Y \cup \{v\}) - f(Y) \le f(X \cup \{v\}) - f(X).f(Y∪{v})−f(Y)≤f(X∪{v})−f(X).

The marginal value of adding an element can only decrease as the set grows. In the paper this inequality is the tool behind the comparison (8) of the greedy vectors of an order and of a moved order.

Formalization Note The normalization f(∅)=0f(\emptyset) = 0f(∅)=0 of the paper is not needed here and is not assumed.

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

open NonmonotoneSubmod.Shared

theorem marginal_antitone {n : ℕ} (f : Finset (Fin n) → ℝ) (hsub : Submodular f) :
    ∀ X Y : Finset (Fin n), X ⊆ Y → ∀ v : Fin n, v ∉ Y →
      f (insert v Y) - f Y ≤ f (insert v X) - f X := 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. 349, display (9)
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