Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.1, p. 4 — ∑j∈AfX−j(j)≥(1−c)f(A)\sum_{j\in A} f_{X-j}(j) \ge (1-c) f(A)∑j∈A​fX−j​(j)≥(1−c)f(A) for monotone submodular fff of curvature ≤c\le c≤c with f(∅)=0f(\emptyset)=0f(∅)=0

Proved
CurvatureSubmod.LocalSearch.lemma_2_1

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

curvaturep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1submodular

Let XXX be a finite set and f:2X→R≥0f : 2^X \to \mathbb{R}_{\ge 0}f:2X→R≥0​ a monotone increasing submodular function with f(∅)=0f(\emptyset) = 0f(∅)=0 and total curvature at most ccc, i.e. fX−j(j)≥(1−c)f∅(j)f_{X-j}(j) \ge (1-c) f_\emptyset(j)fX−j​(j)≥(1−c)f∅​(j) for every j∈Xj \in Xj∈X. Then for every A⊆XA \subseteq XA⊆X,

∑j∈AfX−j(j) ≥ (1−c) f(A).\sum_{j \in A} f_{X-j}(j) \ \ge\ (1-c)\, f(A).j∈A∑​fX−j​(j) ≥ (1−c)f(A).

The left-hand side is the linear function ℓ\ellℓ of §6.1; the lemma says that this linear part already captures a (1−c)(1-c)(1−c) fraction of fff, which is where the curvature enters the 1−c/e1 - c/e1−c/e guarantee of Theorem 6.1.

Formalization Note The hypothesis f(∅)=0f(\emptyset) = 0f(∅)=0 is added: the printed lemma is false without it. For f(A)=1+∣A∣f(A) = 1 + |A|f(A)=1+∣A∣ (monotone, submodular, nonnegative, curvature 000) the left side is ∣A∣<1+∣A∣|A| < 1 + |A|∣A∣<1+∣A∣; the proof's last step (1−c)[f(A)−f(∅)]≥(1−c)f(A)(1-c)[f(A) - f(\emptyset)] \ge (1-c) f(A)(1−c)[f(A)−f(∅)]≥(1−c)f(A) goes the wrong way. No range of ccc is assumed: for c>1c > 1c>1 the right side is nonpositive and the statement still holds. Curvature is in product form (see the Setting definition).

Preamble
import Mathlib
import Definitions.Def_NonmonotoneSubmod_Shared_Submodular
import Definitions.Def_CurvatureSubmod_LocalSearch_Setting
Formal statement
namespace CurvatureSubmod.LocalSearch

/-- Lemma 2.1, p. 4 (proof p. 14), with the added hypothesis `f ∅ = 0`. -/
theorem lemma_2_1 {X : Type} [Fintype X] [DecidableEq X] (f : Finset X → ℝ)
    (hf0 : ∀ A, 0 ≤ f A) (hmono : MonoInc f) (hsub : NonmonotoneSubmod.Shared.Submodular f)
    (c : ℝ) (hcurv : CurvAtMostInc f c) (hempty : f ∅ = 0) (A : Finset X) :
    (1 - c) * f A ≤ ∑ j ∈ A, marg f (Finset.univ.erase j) j := by sorry

end CurvatureSubmod.LocalSearch
Source
Sviridenko, Vondrák, Ward, Optimal approximation for submodular and supermodular optimization with bounded curvature (SODA 2015 version, Oct. 9, 2014), p. 4, Lemma 2.1 (proof p. 14)
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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